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.
Took CS 1332? Add your workload, difficulty and whether you'd take it again. Only the averages are shown, unless you include your rating in a review. Writing a review updates it too.
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
12 hrs/week10/10 difficultyWould take again
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…
I took this alongside two other technical classes and it was manageable, but only because I started every assignment the day it came out. The difficulty comes in waves. The first few weeks feel fine, the tree and heap weeks are the steepest, and hashing and so…
Honest take: most of the semester felt steady and fair, but the stretch covering BSTs, AVL trees and heaps took over my life for a couple of weeks. What helped: drawing every operation by hand, going to office hours with specific failing cases, and a weekly st…