New to PG?
Start here

A Level OCR

£140.00 + VAT Discounted rate from £112.00

+

Unit 7: Data structures

Component 01

7

Inside the Unit...

Download Free Sample 7.2mb

Areas Covered

This unit consists of seven topics, each more substantial than a single lesson and intended to be covered over the course of a week.

  • Topic 1: Arrays, tuples and records
  • Topic 2: Queues
  • Download free sample above
  • Topic 3: Lists and linked lists
  • Topic 4: Stacks
  • Topic 5: Hash tables
  • Topic 6: Graphs
  • Topic 7: Trees
  • End of unit assessment

There are seven worksheets, seven homework tasks, and an examination-style assessment test, each with answers included in this unit.

Summary

The unit is subdivided into seven topics plus a test. It covers all of Section 1.4.2 of the OCR A-Level specification H446. The unit gives practical and worked examples of each of the different abstract data structures including linked lists, graphs, stacks, queues, trees, binary search trees and hash tables. The function and practical application of each data type is discussed, with pseudocode and coded program solutions for relevant algorithms in VB and Python. A comprehensive examination-style assessment the whole unit is included at the end of the unit.

What's included in the toolkit?

Toolkit

The A Level units have been written to satisfy the specification for Component 1 and Component 2 of the OCR H046/H446 Computer Science AS/A Level. Each unit contains:

  • PowerPoint slides for each topic
  • Detailed lesson plans
  • Learning objectives and outcomes
  • Worksheets and homework activities with answers
  • End-of-unit, exam-style assessment test with answers
  • Other material and links to online resources

What people say...

Keep producing the resources, they’ve been a lifesaver for me this year.

John Matthews. Teacher of Computing, Queen Elizabeth’s Hospital School

I have used the PG Online A-level Computer Science presentations and class exercises to help me to explain new specification topics such as: Merge Sort, Big Data, Functional Programming, Adders, D-type Flip-flops, and pre-existing topics such as: Subnet Masks and Tree Traversals.

Marie Shaw. Teacher of A-Level Computer Science, Queen Mary's College

Relevant Textbooks

Inside the Unit...

  • Download Free Sample 7.2mb

    Areas Covered

    This unit consists of seven topics, each more substantial than a single lesson and intended to be covered over the course of a week.

    • Topic 1: Arrays, tuples and records
    • Topic 2: Queues
    • Download free sample above
    • Topic 3: Lists and linked lists
    • Topic 4: Stacks
    • Topic 5: Hash tables
    • Topic 6: Graphs
    • Topic 7: Trees
    • End of unit assessment

    There are seven worksheets, seven homework tasks, and an examination-style assessment test, each with answers included in this unit.

  • How to order

    1. Add individual units to a draft order or download a blank order form below to complete manually

    2. Using a draft order you can either:

    1. Save your order online
      (registration or log in required)
    2. Email us your complete order
      (registration or log in required)
    3. Create a PDF
      (to fax or email at a later date)

    Download blank order form

    PDF

    Word

  • Unit Pricing and Discounts

    Each unit is individually priced for LIFE. Please view each unit for detail. 

    Discounts are cumulative based on the total number of units licenced to your department.

    All prices subject to further discounts and VAT.

    There are no annual renewal fees.

    2-5 units 10% discount
    6-11 units 15% discount
    12+ units 20% discount