MATH-285 Discrete Mathematics II

Topics covered include: Algorithms, growth of functions (big O notation), computational complexity of algorithms, divide-and-conquer algorithms, graphs and their properties (isomorphisms of graphs, Euler and Hamilton paths, shortest path problem, graph coloring) trees (tree traversal, minimum spanning trees). As time allows: matrices and linear transformations.

Credits

4