Description

This course introduces the mathematical design and analysis of computer algorithms. Algorithm complexity, growth of functions, recurrences will be covered. Algorithm design techniques such as divide-and-conquer, dynamic programming and greediness will be introduced. Moreover, well known algorithms for e.g., sorting, searching, graph problems and computational geometry will be developed.

Program

Bachelor of Computer Science - 144 CRs

Objectives

• 1. Apply asymptotic time complexity analysis to choose among competing algorithms.
  2. Construct and solve recurrence equations describing the asymptotic time complexity of a given algorithm.
  3. Identify the best algorithm design technique for a given problem.
  4. Implement efficient algorithms using the appropriate data structures.