Credits: 2.00
Description:
This course covers recurrence relations and generating functions. Equivalence relations and partial orderings. Graphs and connectivity of graphs. Trees and sorting. Boolean algebra, languages and finite state machines.
Prerequisite: MA 2312.