Fundamentals of Algorithms

We are proud to be launching the ONLY comprehensive and accurate workbook that covers ALL of the “Fundamentals of Algorithms” syllabus. Covers the theory and gives lots of practical activities and even includes the answers.

This book has been written to give you practical hands-on approach to help you learn how to write algorithms. Instead of chapters of technical jargon and mind-numbing tedium the theory is broken down into smaller, manageable chunks with practical tasks for you to perform as you go along. This helps you ensure you understand the theory and remember it as you apply it to practical problems.

This book was specifically written to assist students preparing for their AQA GCSE Computer Science examination (8520), and the pseudocode and objectives have been written specifically to match the syllabus, as of February 2018. However, the theory and methods would be beneficial to anybody who wants to know how to create good algorithms.

Includes a single PDF document which can be given to the pupils to work through for homework tasks or in class.

This is what is included:

82 page PDF document which covers the ENTIRE AQA GCSE Computer Science “fundamentals of algorithms” specification.

Uses the correct AQA specified symbols for flowcharts including using subroutines and arrays.

Uses the correct AQA specified pseudocode.

Regular practical tasks allow the pupils to consolidate the theory and put it into practise. All answers are provided.

Includes lots of help in understanding linear and binary searches and bubble and merge sorts including links to YouTube videos and practical card based activities to help them understand and compare the different search and sort algorithms.

Table of contents:

• Introduction

• What are algorithms?

• Computer programs and algorithms

• Decomposition

• Abstraction

• Basic Pseudocode

• Recap programming basics

• What is an expression?

• Arithmetic Operations

• Relational Operators

• Boolean Operators

• Input and Output

• Iteration

• Selection

• Nesting statements

• Flowcharts

• Flowchart symbols

• Drawing loops in flowcharts

• Understanding flowcharts

• Trace Tables

• More complex trace tables

• Dealing with Arrays

• Subroutines

• Writing subroutines in pseudocode

• Showing subroutines in flowcharts

• Dealing with strings

• ASCII and Unicode

• Searching Algorithms

• Linear search

• Binary Search

• Compare the two search algorithms

• Sorting Algorithms

• Bubble Sort

• Merge Sort

• Compare the two sort algorithms

All this for only £20.

What are you waiting for, click here to buy this comprehensive workbook and give your students the helping hand they need to get to grips with algorithms.