COR Electives

These are courses that count towards the 32 credit requirement.

The following couses count towards the 32 credits required for the MS degree. They do not count towards the required seven  xx8 courses. Other graduate courses that count towards the 32 credits required must be discussed with Rex Kincaid.

Math 510. Special Topics. Fall or Spring [1, 2, or 3 credits, depending upon material] Staff. A treatment of topics of interest not routinely covered by existing courses. Mathematical statistics and game theory are two recent topics offered that are of interest to COR graduate students.

Math 524. Operations Research II---Stochastic Models. Spring [3]. Pre-requisite: Math 501 or equivalent probability background. A survey of probabilistic Operations Research models and applications. Topics include stochastic processes, Markov chains, queueing theory and applications, Markovian decision processes, inventory theory, and decision analysis.

Math 532. Combinatorial Theory. Spring of even numbered years [3]. A discussion of combinatorial theory and applications to practical problems. The topics covered include: graph theory, graphical algorithms, elementary principles of enumeration, the inclusion-exclusion principle, Polya counting principle, recurrence relations, generating functions. Additional topics such as combinatorial designs, coding theory, Boolean algebra and Switching functions, may be included as time permits.

CSci 526. Simulation. Fall [3]. Pre-requisites: Calculus, Data Structures. Introduction to simulation. Discrete and continuous stochastic models, random number generation, elementary statistics, simulation of queuing and inventory systems, Monte Carlo simulation, point and interval parameter estimation.

CSci 616. Stochastic Models in Computer Science. Fall [3]. Pre-requisites: Knowledge of Discrete Mathematics and Calculus. An introduction to stochastic models, problem solving, and expected value analysis as applied to algorithms and systems in computer science. Topics include probability, discrete and continuous random variables, discrete-time Markov chains, and continuous-time birth-death processes.

CSci 653. Analysis of Algorithms. Fall [3]. Pre-requisite: CSci 503 or CSci 539. Algorithm design techniques including divide-and-conquer, dynamic programming and greedy method. Analysis methods including worst case and average case. Additional topics chosen from among amortized analysis, lower bound theory and NP-completeness.

CSci 670. Colloquium. Fall and Spring (1). Each full-time graduate student is required to enroll in this course. No credits earned in this course may be applied to the number of credits required for a degree.

CSci 680. Statistical Computing. Fall [3]. Pre-requisites: Probability, Statistics. Topics include linear regression, linear least squares, matrix factorization, nonlinear regression, Gauss-Newton methods, maximum likelihood estimation, parameter estimation, quasi-Newton methods, Monte Carlo integration, and bootstrap methods.

CSci 726. Discrete Event Simulation. Spring [3] Staff. Pre-requisite: CSci 526. Methods of discrete event simulation. Markov chains. Simulation of open and closed networks of queues. Simulation of non-stationary Poisson processes. Transient and steady-state analysis. Event list algorithms and data structures. Theoretical and empirical tests of randomness.

CSci 736. Discrete Linear Systems. Spring [3] Staff. Pre-requisite: Calculus, Linear Algebra, Data Structures, CSci 616. Modeling and analysis of discrete linear systems. The sampling theorem, Nyquist frequency and aliasing. Digital filters. Convolution, the discrete and fast Fourier transform. Selected applications from data compression, coding, transmission and reconstruction, information theory, signal-to-noise ratio and noise suppression presented.