Description
Provides the background in combinatorics and probability theory required in design and
analysis of algorithms, in system analysis, and in other areas of computer science.
Credits: 4
01:198:205 or 14:332:202; 01:640:152. Credit not given for this course and 01:640:477.
Please note that courses for which a student has received a grade of D cannot be used to satisfy prerequisite requirements.
Semesters Offered:Spring and fall
Topics: Counting: Binomial Coefficients, Permutations, Combinations
Recurrence Relations
Discrete Probability:
Events and Random Variables
Conditional Probability, Independence
Expectation, Variance, Standard Deviation
Binomial, Poisson and Geometric Distributions
Regular Sets, Finite Automata
Graph Theory: Paths, Components, Connectivity, Euler Paths, Hamiltonian Paths, Planar Graphs, Trees
Expected Work: Weekly assignments; 1 or 2 programs
Exams: 1 or 2 hourlies, Final Exam
