CMS 702 Data Structures & Algorithms · Postgrad Notes

Notes

Full transcription of 16 pages of class notes: algorithms, asymptotic analysis, core data structures, hashing and BSTs.

The official course outline with a topic-by-topic check of what the class notes cover.

Definitions, lists and diagrams to memorise, worded for direct recall.

Outline topics the class notes skip: graphs, sorting mechanics, stack vs heap, covered short and exam-shaped.

35 questions with answers, in exam format.

Five past questions answered at full length, with model structure notes.

Cheatsheet and study guide built from the class notes.

Mock paper, answer plans, worked drills and a walk-in sheet.

Topics the notes name but never develop, worked in full.