CS201Computer ScienceIntermediateFall 2026
Master the building blocks behind every efficient program — and ace your technical interviews.
About this course
Go beyond syntax and learn how to reason about performance.
- Big-O notation
- Arrays, linked lists, stacks and queues
- Trees, graphs and hashing
- Sorting and searching
Syllabus
1Complexity3 lessons▾
- Watch: algorithms in plain English25 min
- Big-O notation30 min
- Analysing loops20 min
2Linear structures2 lessons▾
- Arrays vs linked lists25 min
- Stacks and queues20 min
3Trees and graphs2 lessons▾
- Binary search trees30 min
- Graph traversal: BFS & DFS35 min