Note: This course description is only applicable for the Computer Science Post-Baccalaureate program ... sorting algorithms, recurrence relations, divide and conquer algorithms, greedy algorithms, ...

Quantum computers promise to speed calculations dramatically in some key areas such as computational chemistry and high-speed networking. But they're so different from today's computers that ...

sorting algorithms, algorithmic lower bounds, graph algorithms. This course is delivered through a combination of lectures and classes totalling a minimum of 30 hours across Winter Term.

Mathematicians have long sought to develop algorithms that can compare any two graphs. In practice, many algorithms always seem to work efficiently. But in theory, there is no guarantee.