Data structures in A Level computer science CC512 / C01
Summary
Who is it for?
This course is aimed at teachers delivering A Level computer science. It is advised you have some basic knowledge of data structures from GCSE computer science specifications, i.e. one and two dimensional arrays, the differences between static and dynamic structures etc.
During this course you’ll access the Isaac Computer Science platform, it is advised you sign up for a free, teacher's account ahead of the course.
What topics are covered?
- 01 | Introduction to data structures – during this session you’ll explore why data structures are used within programs, you’ll explore the differences between static and dynamic data structures.
- 02 | Stacks and queues – during this session you’ll explore how stacks and queues are used, you’ll learn about the main operations of both stacks and queues.
- 03 | Programming stacks and queues – during this session you’ll get hands on with Python programs, you’ll develop functions to push, pop and peek stacks, you’ll also implement linear queues.
- 04 | Hash tables – during this session you’ll develop an understanding of how to use and the subsequent need for hash tables, the main requirements and how values are inserted and retrieved from hash tables.
- 05 | Exam questions – during this session you’ll consolidate the learning from the previous sessions and explore several A Level exam questions, reviewing the knowledge required of your students in an exam context.
How will you learn?
Scheduled live, interactive online sessions led by an experienced practitioner. Flexible Professional Development Leader-supported, participant-led tasks, involving deep exploration of the subject content.
How long is this course?
This course will last approximately 5 hours, these sessions maybe split across multiple days.
Who is the course leader?
-
Neil Crumpton
Neil is an experienced educator and consultant with over 21 years of experience in the field of education, specializing in Science and Computer...
-
Outcomes
By the end of this intensive CPD pathway you will be able to:
- To identify what is meant by a data structure, including the differences between static and dynamic data structures
- Understand the features of stacks and queues, trace their states and recognise practical applications of stack and queues
- Explore how to use hash tables, including identifying the main requirements and how values are inserted and retrieved.
- Explore how the Isaac Computer Science platform can support your student's learning about data structures.
Sessions
Date | Time | Location | |
---|---|---|---|
1 - Introduction to data structures | 21 November 2024 | 09:00-10:00 | City of Stoke-On-Trent Sixth Form College |
2 - Stacks and queues | 21 November 2024 | 10:30-11:30 | City of Stoke-On-Trent Sixth Form College |
3 - Programming stacks and queues | 21 November 2024 | 11:30-12:30 | City of Stoke-On-Trent Sixth Form College |
4 - Hash tables | 21 November 2024 | 13:30-14:30 | City of Stoke-On-Trent Sixth Form College |
5 - Exam questions | 21 November 2024 | 15:00-16:00 | City of Stoke-On-Trent Sixth Form College |
Actions
Cost
English Maintained | Activity feeFree | Subsidy available*£0.00 |
---|---|---|
Other | Activity fee£75.00 +VAT | Subsidy available*£0.00 |
Priority school | Activity feeFree | Subsidy available*£0.00 |
Priority school repeat teacher | Activity feeFree | Subsidy available*£0.00 |
Trainee Teacher | Activity feeFree | |
This subsidy can contribute towards the costs associated with supply cover Find out more. |
Check your school subsidy status
The subsidy value may be higher for your school or college.
Additional information
Would you like this course delivered at your school? Contact enquiries@stem.org.uk to find out more.
Interested in this course?
Sign up to receive our emails to hear about the latest CPD available