Evaluation and design of algorithms A Level Resources

A Level Computer Science: Evaluation and design of algorithms

This module contains:

  • An editable PowerPoint lesson presentation
  • Editable revision handouts
  • A glossary which covers the key terminologies of the module
  • Topic mindmaps for visualising the key concepts
  • Printable flashcards to help students engage active recall
  • A quiz with answer key to test knowledge and understanding of the module
Compatible with the following examination boards
Evaluation and design of algorithms A Level Resources Image 1
Evaluation and design of algorithms A Level Resources Image 2
Evaluation and design of algorithms A Level Resources Image 3
Evaluation and design of algorithms A Level Resources Image 4
Evaluation and design of algorithms A Level Resources Image 5

Download →

Evaluation and design of algorithms

A problem can be solved in many ways. Choosing the best solution is important in programming. The important requirements for a proper solution: must work correctly and must complete the task in a specific time. The efficiency of algorithms can be compared using time and space requirements. Time requirements: denote the time taken to complete the task. Space requirements: denote the amount of memory required to complete the task.

This A Level Computer Science module introduces evaluation and design of algorithms to your students, explaining:

  • Comparing the efficiency of different algorithms for the same problem
  • Time and space measures
  • Big-O notation for expressing time complexities

More Algorithms Modules

Evaluation and design of algorithms is one lesson in our Algorithms module. The other theory lessons can be found below: