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
5 posts in Trees · Clear filters
Study GuideAlex Chen· Spring 2026
28lit. Radiant · 28 lit, 0 off6comments
Concept ExplanationMei Tanaka· Spring 2026
15lit. Bright · 15 lit, 0 off2comments
Study GuideAlex Chen· Spring 2026
28
Study GuideAlex Chen· Spring 2026
28
Concept ExplanationJordan Kim· Spring 2026
19lit. Radiant · 19 lit, 0 off5comments
Concept ExplanationMei Tanaka· Spring 2026
15lit. Bright · 15 lit, 0 off2comments
NotesDaniel Okafor· Spring 2026
15lit. Bright · 15 lit, 0 off2comments
Concept ExplanationIsabella Rossi· Spring 2026
19lit. Bright · 19 lit, 1 off2comments