This course provides the mathematical foundations for graduate-level study in computer science, including such topics as complexity of algorithms, modular arithmetic, induction and proof techniques, graph theory, combinatorics, Boolean algebra, logic circuits, and automata.
Outcomes: To analyze properties of functions, relations, graphs, trees, paths; evaluate Boolean Expressions; apply induction towards proving correctness of algorithm and classifying resource usage; synthesize finite-state machines and logic circuits.
Outcomes: To analyze properties of functions, relations, graphs, trees, paths; evaluate Boolean Expressions; apply induction towards proving correctness of algorithm and classifying resource usage; synthesize finite-state machines and logic circuits.