Advanced Data Structures for A-Level Computer Science CO903
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?
This course is aimed at teachers delivering A Level computer science.
What topics are covered?
- 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
- Graphs Understand why graphs are used, know the structure of graphs, be able to represent graphs
- Implementing a Graph Understand how to implement graphs in Python, be able to answer exam style questions on Graphs
- Trees Define a tree data structure, know the difference between a tree and a binary search tree, be able to implement trees
- 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
- Exam Question Practice Walking-talking mock style session, be able to answer exam style questions on graphs and trees
How will you learn?
This online, self-paced course can be completed flexibly. You can join and start this course at any time after the advertised date, and keep access for a year after booking.
How long is this course?
This course is approximately 5 hours of self directed learning.
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.