3 semester credits

In this course students examine the role and importance of algorithms, algorithms used to solve a given computational problem, and the process of designing algorithms where no suitable existing algorithm is available. Students have the opportunity to analyze algorithm behavior, and correctness and complexity based on both time and memory requirements. Students have the opportunity to gain an in-depth knowledge of a range of algorithms that are in common usage and/or are of historical significance within the IT industry, including sorting algorithms, searching algorithms, graph algorithms, and pathfinding algorithms.