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.
Answers come only from what CS 1332 students have shared.
AI answers are summaries of student posts and can be wrong or out of date. Check the linked posts and your official course materials, and follow your course's academic integrity rules.
Sign in to ask questions answered from CS 1332 student posts. Your chats are saved to your account.
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
Unit 2
Trees
Unit 5
Algorithm Design