Week 8 — Midterm Exam Week: Quiz-1¶
CEN207 Data Structures (formerly CE205) · Fall 2026–2027 · 31.10–08.11.2026
Quiz-1 covers weeks 1–6 and is 40% of the midterm grade (the midterm project RAP1 is the other 60%).
| Week | Topics to review |
|---|---|
| 1 | Big-O, memory layout, pointers |
| 2 | Linked lists (singly, doubly, circular, XOR), arrays, sparse matrices |
| 3 | Stacks and queues, expression conversion, Tower of Hanoi, recursion |
| 4 | Binary trees and traversals, heaps, heap sort, Huffman coding |
| 5 | Graph representations, BFS, DFS, topological sort |
| 6 | Linear/binary search, hashing and collision resolution |
How to prepare
Replay the animations in each week's notes step by step, then solve the self-check questions at the end of each week without looking at the answers.