Discrete Mathematics
Relations. Mathematical structures. Number theory. Algorithms. Complexity of algorithms. Cryptology. Recurrence relations. Graph theory. A shortest-path algorithm. Planar graphs. Trees. A maximal flow algorithm. Finite-state automata. Languages and grammar. Turing machines. The Church-Turing thesis. Unsolvable problems.
3 credits. Prerequisite: Ma 110
Course Code: Ma 352
