Document Type

Syllabus

Publication Date

Fall 2003

Abstract

Course syllabus for CPSC 438 Discrete Structures

Course description: Continuing survey of foundations of discrete mathematics, covering linear algebra, counting methods, sequences, discrete probability, and theoretical computer science, including linear transformations, matrix algebra, linear systems, eigenanalysis, combinatorial matrix theory, linear programming, linear and nonlinear least squares, permutation and combinations, inclusion/exclusion, partitions, sequences, generating functions, finite differences, finite sums, probabilistic independence and dependence, random variable, discrete probability computations, random walks, system reliability, discrete-time Markov chains, queuing theory, simulation, theoretical computational models, languages and models, algorithmic complexity, randomized algorithms.

Download

Share

COinS