Course Overview
1.
Introduction
2.
Live Classes
3.
Assessments
4.
Getting Help
5.
Giving Help
6.
Academic Integrity
7.
Course Tools
Week 1: Python and Data Structures Review
8.
Introduction
9.
Data structures
10.
Arrays vs. linked lists
11.
Efficiency and big-O notation
12.
Recursion
13.
Dictionaries and trees
14.
Week 1 Quiz
15.
Assignment 1
Week 2: Hash Tables
16.
Introduction
17.
Direct-address tables
18.
Hash tables
19.
Separate chaining
20.
Open addressing I
21.
Open addressing II
22.
Hash deletion
23.
Example hash function
24.
Applications
25.
Reading
26.
Practice
27.
Week 2 Quiz
28.
Assignment 2
Week 3: Priority Queues and Heaps
29.
Introduction
30.
Priority queues
31.
Heaps
32.
Heap insertion
33.
Heap removal
34.
Heap construction
35.
Heapsort
36.
Heapsort analysis
37.
heapq library
38.
Reading
39.
Practice
40.
Week 3 Quiz
Week 4: Dynamic Programming
41.
Introduction
42.
Rod cutting problem
43.
Dynamic programming
44.
Fibonacci top-down
45.
Fibonacci bottom-up
46.
Longest common subsequence
47.
Reading
48.
Practice
49.
Week 4 Quiz
50.
Assignment 3
Week 5: Midterm Exam
51.
Introduction
52.
Midterm Exam
Week 6: Graphs I
53.
Introduction
54.
Basics
55.
Representations
56.
Traversals
57.
Minimum spanning trees
58.
Prim's algorithm
59.
Topological sort
60.
Strongly connected components
61.
Reading
62.
Practice
63.
Week 6 Quiz
Week 7: Graphs II
64.
Introduction
65.
Graph implementation
66.
Dijkstra's algorithm
67.
Bellman-Ford algorithm
68.
Floyd-Warshall algorithm
69.
Bipartite graphs
70.
Stable marriage problem
71.
Week 7 Quiz
72.
Assignment 4
Week 8: Advanced Algorithms
73.
Introduction
74.
Quicksort
75.
Quicksort analysis
76.
String matching
77.
Rabin Karp
78.
Linear programming
79.
Duality
80.
Practice
81.
Week 8 Quiz
Week 9: Intractable Problems
82.
Introduction
83.
Traveling salesman
84.
Hard problems
85.
Complexity classes
86.
Reductions
87.
Approximation algorithms
88.
Reading
89.
Week 9 Quiz
90.
Assignment 5
Week 10: Final Exam
91.
Introduction
92.
Final Exam
Light
Rust
Coal
Navy
Ayu
Course Name
Reading
Read about intractable problems in Chapter 12 of
An Open Guide to Data Structures and Algorithms
.