Typical Workload

Moderate

11.6hrs/week

Difficulty

Hard

7.6/ 10

Would take again

Most would

77%

Averages from 31 student ratings. Student opinions, not an OfCourse rating. Rate this course

CS 1332Data Structures & Algorithms

Georgia Tech30 Verified Students30 posts

Lists, trees, heaps, hashing, sorting and graph algorithms, plus the Big-O analysis behind them.

Ask AI Write a post

Radiant

Brightest review

Hard, but the most useful class I've taken so far

ABAisha Bello54

Brightest Newest

Georgia Tech

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

3 posts in Heaps · Clear filters

Unit 1: Foundations

My one-page Big-O cheat sheet for every structure we covered
NotesPriya Natarajan· Spring 2026
25lit. Radiant · 25 lit, 0 off4comments
Why is building a heap O(n) and not O(n log n)?
Concept ExplanationSam Patel· Summer 2026
12lit. Bright · 12 lit, 0 off1comments

Unit 2: Trees

My one-page Big-O cheat sheet for every structure we covered
NotesPriya Natarajan· Spring 2026
25

Unit 3: Hashing & Sorting

My one-page Big-O cheat sheet for every structure we covered
NotesPriya Natarajan· Spring 2026
25

Heaps: my notes on up-heap, down-heap and building a heap

NotesDaniel Okafor· Spring 2026

15lit. Bright · 15 lit, 0 off2comments

Why is building a heap O(n) and not O(n log n)?

Concept ExplanationSam Patel· Summer 2026

12lit. Bright · 12 lit, 0 off1comments