Lesson about Linked Lists. Contains elements of component 1.4.2 (b,c) from OCR A-Level Computer Science spec. Lesson has exam style questions with mark scheme.
Contains explanations of Linked List data structure, how it is applied and used with dynamic memory and the use of pointers. Includes an example of an implementation (object orientated approach in pseudocode) of a linked list which could be used to create a program in an appropriate language. Exam questions are included with mark schemes.
Included is a Powerpoint with notes and tasks, exam question worksheet to help aid progress.
Please leave a review with your feedback. Thanks
Get this resource as part of a bundle and save up to 33%
A bundle is a package of resources grouped together to teach a particular topic, or a series of lessons, in one place.
Something went wrong, please try again later.
Far too much text that's far too small. Only one image in the entire presentation. You should break up your slides with 8 points of data into multiple slides with one concept per slide, with an image to help describe the concept, and a quick check for understanding after.
Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.
£2.00