Typical Workload
Moderate11.6hrs/week
Difficulty
Hard7.6/ 10
Would take again
Most would77%
Averages from 31 student ratings. Student opinions, not an OfCourse rating. Rate this course
Georgia Tech30 Verified Students30 posts
Lists, trees, heaps, hashing, sorting and graph algorithms, plus the Big-O analysis behind them.
Workload: about 12 to 15 hours a week, more during the tree unit. What went well: the course builds steadily. Once linked lists and recursion made sense, trees felt like a natural next step, and graphs built on both. What was hard: the coding assignments have a lot of edge cases, and it's easy to underestimate them. I…
Radiant · 18 lit, 0 off
1 post in Dynamic Programming · Clear filters
Concept ExplanationTyler Brooks· Spring 2026
24lit. Radiant · 24 lit, 0 off2comments
Concept ExplanationTyler Brooks· Spring 2026
24lit. Radiant · 24 lit, 0 off