How to revise Programming, Data Structures and Algorithms using Python
Programming, Data Structures and Algorithms using Python questions reward clear reasoning as well as a final answer. This revision guide is a starting point for using the available papers; it is not the official syllabus or a promise about future exams.
Revision focus
Complexity; recursion; searching; sorting; graphs; data structures
Useful prior knowledge
Python functions, loops and containers
Common mistakes
Ignoring a worst-case input or changing a list while reasoning about its original indices
Use these papers effectively
Trace the algorithm on a tiny example, then state the invariant and complexity. Include an empty or boundary input in your reasoning. After checking a solution, solve the question again without looking and record the specific step you missed.
Revision guidance only. Check your current official course materials for the assessed syllabus.