This course introduces students to ideas and techniques from discrete mathematics that are widely used in Computer Science. Students will learn about the fundamentals of propositional and predicate calculus, set theory, relations, recursive structures and counting. This course will help increase students’ mathematical sophistication and their ability to handle abstract problems.

This course covers the theory of graphs and networks for both directed and undirected graphs. Topics include graph isomorphism, Eulerian and Hamiltonian graphs, matching, covers, connectivity, coloring, and planarity. There is an emphasis on applications to real world problems and on graph algorithms such as those for spanning trees, shortest paths, and network flows.

This course introduces the fundamental concepts of graph theory. Topics to be studied include graph isomorphism, trees, network flows, connectivity in graphs, matchings, graph colorings, and planar graphs. Applications such as traffic routing and scheduling problems will be considered.

Special Topics courses cover content that is not represented in the main curriculum on an experimental or trial basis.

Masters-level research by the candidate on an appropriate topic as arranged between the candidate and the research advisor.

Continuation of Thesis

Independent Study