New to PG?
Start here
BusinessComputer ScienceDesign & TechnologyEnglishHumanitiesLanguagesMathematicsPEScienceClearReviseAbout
Back to All Units

A Level AQA

£140.00 + VAT Discounted rate from £112.00

+

Unit 8: Algorithms

AQA Paper 1

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

Inside the Unit...

Download Free Sample 7.5mb

Areas Covered

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

  • Topic 1: Recursive algorithms
  • Topic 2: Big-O notation
  • Topic 3: Searching and sorting
  • Topic 4: Graph traversal algorithms
  • Topic 5: Optimisation algorithms
  • Download free sample above
  • Topic 6: Limits of computation
  • End of unit assessment

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

Summary

This is a theoretical unit covering all of Section 4.3 Fundamentals of algorithms (except Section 4.3.3 Reverse Polish which is covered in Unit 9). Searching and sorting algorithms are covered in an interactive and practical way, with reference to Big-O notation in terms of time and space complexity. It also covers Section 4.1.1.15 on the role of stack frames in subroutine calls, and Section 4.1.1.16 on recursive techniques, putting these into practice with tree traversals and a depth-first graph traversal. Optimisation algorithms, such as Dijkstra’s shortest path algorithm are covered along with a complete topic on the limits of computation, including intractable algorithms and the Halting problem.

What's included in the toolkit?

Toolkit

The A Level units have been written to satisfy the specification for Paper 1 and Paper 2 of the AQA 7517 Computer Science AS 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...

“
”

I have purchased some of your units and we love them.

Chris Myhill. Curriculum Leader for ICT and Computing, Bradfield School

“
”

Your books are the best on the market by a mile. Easy to read and follow. Good use of example questions.

Tom Sparrowhawk. Head of Computer Science, All Saints CofE Academy

Relevant Textbooks

Inside the Unit...

  • Download Free Sample 7.5mb

    Areas Covered

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

    • Topic 1: Recursive algorithms
    • Topic 2: Big-O notation
    • Topic 3: Searching and sorting
    • Topic 4: Graph traversal algorithms
    • Topic 5: Optimisation algorithms
    • Download free sample above
    • Topic 6: Limits of computation
    • End of unit assessment

    There are worksheets, homework tasks, and an 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