Skip to main content

The course covers topics on technical analysis and runtime algorithms, asymptotic notation O, Z and I, some data structures (e.g. heaps and priority queues), sorting and searching algorithms and algorithm design techniques. Students will also learn about basic graph algorithms (search by width and depth, applications, coating trees, shortest paths, matching) and NP-completeness.

Prerequisite: MATH 203

Lecture:
3
Laboratory:
0