Course Search Results

  • COSC 5020: Adv Tpcs: Comp Sci

    1.00 - 6.00 Credits
    University of Wyoming

    Advanced topics in computer science. (A maximum of 12 hours may be applied to graduate study.) Prerequisites: graduate standing and consent of instructor.
    ShareCOSC 5020 - Adv Tpcs: Comp Sci

  • COSC 5050: Res Writing COSC

    3.00 Credits
    University of Wyoming

    Instruction in methods for performing and reporting research in the field of computer science. The primary task is preparation of a research paper; to that end, the class covers how to collect and analyze previously published work, generate and develop a research topic, and present research results in acceptable written form. Prerequisite: graduate standing, consent of instructor.
    ShareCOSC 5050 - Res Writing COSC

  • COSC 5110: Analysis Of Algor

    3.00 Credits
    University of Wyoming

    Analysis of algorithms to determine their time and space requirements. Beginning with data structures such as lists, stacks, trees, and sets and their implementations. The class then analyzes specific algorithms for internal sorting, hashing, and string search. Offered fall semester of even numbered years. Prerequisite: COSC 3020 or equivalent and consent of the department.
    ShareCOSC 5110 - Analysis Of Algor

  • COSC 5120: Thry Of Computatn

    3.00 Credits
    University of Wyoming

    Models of computation, the Church-Turing thesis, computable functions, decidable and enumerable sets, unsolvable problems, correctness of programs, and complexity of computation. The theory of computation provides precise answers to the fundamental questions of computer science: Which problems can be solved by machine computation and which can be solved using a reasonable amount of computer resources. Prerequisite: COSC 4100.
    ShareCOSC 5120 - Thry Of Computatn

  • COSC 5200: Comp Complexity

    3.00 Credits
    University of Wyoming

    Formalization of the notion of inherent intractability of a problem and efficiency criteria of an algorithm. Models of computation. Equivalence of models. Classes P, NP, PSPACE. Techniques for proving previous problems NP-complete. Approximation algorithms. Efficient algorithms for sets and partitioning UNION-FInd, matrix multiplication, graph problems. Modular arithmetic. Models of parallel computation and parallel algorithms. Prerequisite: COSC 4100 or consent of instructor. (Offered fall semester of odd numbered years.)
    ShareCOSC 5200 - Comp Complexity

  • COSC 5220: Lang & Automata

    3.00 Credits
    University of Wyoming

    The study of regular, context-free, and context-sensitive languages and their relations to finite-state, pushdown and linear-bounded automata. Context-free language recognition. The halting problem and decidability results. Prerequisite: COSC 4100.
    ShareCOSC 5220 - Lang & Automata

  • COSC 5310: Comp Methods I

    3.00 Credits
    University of Wyoming

    First semester of a three-semester computational methods series. Review of iterative solutions of linear and nonlinear systems of equations, polynomial interpolation/approximation, numerical integration and differentiation, and basic ideas of Monte Carlo methods. Comparison of numerical techniques for progrmming time and space requirements, as well as convergence and stability. Cross listed with MATH 5310. Prerequisites: MATH 3310, COSC 1010.
    ShareCOSC 5310 - Comp Methods I

  • COSC 5340: Comp Methods II

    3.00 Credits
    University of Wyoming

    Second semester of a three-semester computational methods series with emphasis on numerical solution of differential equations. Topics include explicit and implicit methods, methods for stiff ODE problems, finite difference, finite volume and finite element methods for time-independence PDEs, semi/fully discrete methods for time-dependent PDEs. Cross listed with MATH 5340. Prerequisite: MATH/COSC 5310.
    ShareCOSC 5340 - Comp Methods II

  • COSC 5345: Comp Methods III

    3.00 Credits
    University of Wyoming

    Third semester of a three-semester computational methods series with emphasis on numerical solution of problems displaing sharp fronts and interfaces (nonlinear conservation laws, Hamilton-Jacobi equations. Cross listed with MATH 5345. Prerequisite: MATH/COSC 5340.
    ShareCOSC 5345 - Comp Methods III

  • COSC 5350: System Simulation

    3.00 Credits
    University of Wyoming

    Introduces simulation and comparison with other techniques. Studies discrete simulation models, and introduction to, or review of, queuing theory and stochastic processes. Compares discrete change simulation languages. Examines simulation methodology including generation of random numbers and variates, design of simulation experiments for optimization, analysis of data generated by simulation models and results. Selected applications of simulation. Dual listed with COSC 4350. Prerequisite: COSC 3020, MATH 4250 or STAT 2010. Additional work is assigned for those enrolled for graduate credit.
    ShareCOSC 5350 - System Simulation