MATH 359:Discrete Mathematics
Credits:
3
Boolean algebra. Combinatorics languages and grammars. Recurrence relations, generating functions and applications. Problems of definition by induction: no closed form, infinite loops and the halting problem. Algorithms: correctness, complexity, efficiency. Graph theory: planarity, Euler circuits, shortest-path algorithm. Network flows. Modelling computation:languages and grammars, models, finite state machines, Turing machines.