Topics | Subtopics & Slides | Date |
---|---|---|
Introduction | ||
Syllabus | ||
Introduction | ||
Chapter 1: Analysis of Algorithms | Analysis of Algorithms | |
Chapter 2: Basic Data Structures | Elementary Data Structures | |
Priority Queues and Heaps | ||
Dictionaries and Hash Tables | ||
Chapter 3: Search Trees and Skip Lists | Binary Search Trees | |
Red-Black Trees | ||
Chapter 4: Sorting, Sets, and Selection | Merge Sort & Quick Sort | |
Linear time sortings | ||
Chapter 5: Fundamental Techniques | Greedy Method | |
Divided and Conquer | ||
Dynamic Programming | ||
Chapter 6: Graphs | Introduction to Graphs | |
BFS and BFS algorithms | ||
Dictionaries and Hash Tables | ||
Digraphs | ||
Biconnectivity | ||
Chapter 7: Weighted Graphs | Intordution to Minimum Spanning Trees | |
Kruskal's Algorithm | ||
Prim's Algorithm | ||
Shortest Paths |
Last update: Dec 2019