Covers the fundamentals of algorithms and various algorithmic strategies, including time and space complexity, sorting algorithms, recurrence relations, divide and conquer algorithms, greedy ...

Basic data structures: Heaps, and Binary Search Trees. Algorithm Design Approaches: Divide and Conquer including analysis using recurrences Greedy Algorithms Dynamic Programming Algorithms Algorithms ...

Algorithm design and analysis is fundamental to all areas of computer science and gives a rigorous framework for the study optimization. This course provides an introduction to algorithm design ...