Advanced Data Structures for A-Level Computer Science CP522
Following on from CP502 (which is a pre-requisite to this course) this PDE covers Linked Lists, Graphs, Trees and Binary Search Trees. Gain further confidence in teaching the data structures content in the A-level specification including attempting and marking exam questions.
Summary
The second course on Data Structures for A-level teachers, this course covers further content from the specifications from OCR and AQA, including Abstract Data Types, Linked Lists, Trees and Binary Trees.
Who is it for?
A-level Computer Science teachers
What topics are covered?
01 | Recap and Linked Lists Recap arrays and lists, recap what is an Abstract Data Type (ADT), the purpose and structure of linked lists, implement linked lists in code
02 | Graphs Understand why graphs are used, know the structure of graphs, be able to represent graphs
03 | Implementing a Graph Understand how to implement graphs in Python, be able to answer exam style questions on Graphs
04 | Trees Define a tree data structure, know the difference between a tree and a binary search tree, be able to implement trees
05 | Tree traversal Describe tree traversal and the purposes of different methods, carry out a Breadth-first traversal, carry out Depth-first traversals: pre-order, in-order, post-order
06 | Exam Question Practice Walking-talking mock style session, be able to answer exam style questions on graphs and trees
How will you learn?
A mixture of PDL-led instruction, worked examples and participant-led practical activities.
How long is this course?
5 hours.
Outcomes
By the end of this course, you will be able to:
- Participants are more confident delivering A-level Data Structures content.
- Participants feel able to attempt exam board questions with students and can mark their attempts confidently.