Introduction to discrete structures and probability as they apply to design and analysis. Review of proof techniques: induction and recursion. Graphs and trees, and their applications in computing. Finite automata and regular expressions. Counting: arithmetic and geometric progressions, permutations and combinations, modular arithmetic. Probability.
This course will require you to be online for live lectures every week at the scheduled time. Class recordings will also be available until after your exam period. More details will be included in your course outline available on the first day of class.