|
|
|
 |
This course is intended to help students develop the background they will need in order to master more advanced material encountered later and covers the following topics: Mathematical induction, algorithms, proof of correctness of programs. Sets, relations and functions. Combinatorics, probability (probability spaces, inclusion/exclusion, random variables, moments, binomial distribution). Difference equations, propositional logic, truth tables, DNF and CNF. Trees and graphs. Formal machines (automata and regular expressions, grammars). Rates of growth of functions, intractable problems.
Co-requisite: CS530