New to PG?
Start here
BooksBusinessComputer ScienceDesign & TechnologyEnglishHumanitiesLanguagesMathsPEScienceClearReviseAbout
Back to All Units

A Level OCR

£140.00 + VAT Discounted rate from £112.00

+

Unit 12: Algorithms

Component 02

Unplugged Unit
Perfect for lessons away from computers or workshops.
12

Inside the Unit...

Download Free Sample 7.2mb

Areas Covered

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

  • Topic 1: Analysis and design of algorithms
  • Topic 2: Searching algorithms
  • Topic 3: Bubble sort and insertion sort
  • Topic 4: Merge sort and quicksort
  • Topic 5: Graph traversal algorithms
  • Topic 6: Optimisation algorithms
  • Download sample lesson above
  • End of unit assessment

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

Summary

This is a theoretical unit covering Section 2.3 Algorithms (except algorithms for stacks, queues, trees and linked lists which are covered in Unit 7). Searching and sorting algorithms (bubble sort, insertion sort, merge sort, quick sort) are explained in an interactive and practical way, with reference to Big-O notation in terms of time and space complexity. Topic 5 tackles standard algorithms for depth-first and breadth-first graph traversals. Optimisation algorithms, such as Dijkstra’s shortest path algorithm and the A* algorithm are covered along with a discussion of intractable problems, in the final topic. 

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...

“
”

The graphics are excellent which will help the students understand the links between different aspects of computer hardware.  I particularly like the example answers which clearly illustrate where marks can be achieved.

Ms Penny Cox. Head of Computer Science, Francis Combe Academy

“
”

I have a lot of low ability students who struggle to engage with education generally and these resources have tapped into their interests in an engaging but productive way. 

Alan Glasgow. Head of IT and Computer Science, Norton Hill School

Relevant Textbooks

Inside the Unit...

  • Download Free Sample 7.2mb

    Areas Covered

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

    • Topic 1: Analysis and design of algorithms
    • Topic 2: Searching algorithms
    • Topic 3: Bubble sort and insertion sort
    • Topic 4: Merge sort and quicksort
    • Topic 5: Graph traversal algorithms
    • Topic 6: Optimisation algorithms
    • Download sample lesson above
    • End of unit assessment

    There are six worksheets, six 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