Standard syllabus
Algorithms · Undergraduate · CS / Programming
Topics
Design paradigms
- Divide and conquer: mergesort, quicksort, master theorem (intro)
- Greedy algorithms: activity selection, Huffman coding (intro)
- Dynamic programming: knapsack, LCS, matrix chain (intro)
- Graph representations and traversal (BFS, DFS)
- Topological sort and strongly connected components (intro)
Classic problems
- Shortest paths: Dijkstra and Bellman–Ford (intro)
- Minimum spanning trees: Kruskal and Prim
- Network flow overview (Ford–Fulkerson at survey level)
- Backtracking: N-queens, subset sum
- NP-completeness: reductions and classic problems (intro)
Pricing calculator
Choose materials, tutoring, or both — or book a single session as needed. Customize your plan on the subscribe page.
$1,162 · Algorithms · 18 tutoring hrs
Study guides, worksheets, reviews, practice tests, and answer keys for 1 class. 18 tutoring hours (1 hr / week · semester). Bundle discount applied vs buying separately. Pay in full via Zelle.