Algorithms and Data Structures

First half-semester – Basic techniques and data structures
1. Introduction to algorithms
    Recursion
    Divide and conquer
    Analyzing algorithms
2. Dynamic programming
    Longest common superstring
    Edit distance of strings
    String matching
3. Graph algorithms
BFS and its applications
    Connected components
    Shortest paths
    Recognizing bipartite graphs
    Finding maximum matching in bipartite graphs
4. DFS and its applications
    Strongly connected components
    Directed acyclic graphs
    Shortest and longest path in directed acyclic graphs
5. Shortest path in weighted graphs
    Bellman-Ford algorithm
    Floyd's algorithm
    Dijkstra's algorithm
6. Minimum spanning trees
    Basic properties
    Greedy algorithms (Jarnik-Prim, Kruskal)

Second half-semester – Graph algorithms and geometric algorithms

7. Search in unordered list: worst case and average case
    Finding the smallest and the largest element in a list
    Finding the median in linear time in ordered list
8. Search trees
    B-tree
    Hashing
9. Sorting algorithms:
    Bubble sort
    Insertion sort
    Merge sort
    Quicksort
10. Lower bound on number of comparisons
    Binsort and radix sort11. Union-find data structure
    Geometric problems in the plane
    Intersection of line segments
12. Closest pair of points
    Determining the convex hull of points