Fundamental Algorithms - Design and Analysis

This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures  and analysis techniques for these problems.

Divide and Conquer Paradigm.
Solving Recurrences.
Quick Sort.
Heap Sort.
Insertion Sort and Asymptotic Analysis.
Decision Tree.
Linear Time Sorting.
Order Statistics.
Hashing.
Universal Hashing, BST Sort.
Red-Black Tree.
Augmenting Data Structure.
Computational Geometry.
Van Emde Boas Data Structure.
Dynamic Programming.
Graph Algorithm.
BFS and DFS.
Dijkstra.
Bellman Ford.
Floyd Marshall.