# A Level OCR

+

## Unit 12: Algorithms

### Component 02

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

## Inside the Unit...

### 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
• 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?

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

All updated material is exemplary, well laid out and detailed.

Milesh Shah. Private Tutor, Tutors for All

The key strengths of the materials are in their simplicity - you have the content pupils need to know, simply, attractively presented and then a well designed worksheet to test it. The worksheets look excellent and very effective as a tool to cement the learning.

Dr Bruce Geddes. Head of Curriculum, British School Kuala Lumpur

## Inside the Unit...

### 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
• 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:

2. Email us your complete order
3. Create a PDF
(to fax or email at a later date)

• ### Unit Pricing and Discounts

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

Discounts are cumulative based on the total 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