## Python Nested FOR Loops for GCSE and A Level Computer Science

Why do I Need Nested Loops? Nested loops are a very important concept in Python programming and GCSE and A Level Computer Science, and are used in many algorithms. For example sorting algorithms such as Bubble Sort and Selection Sort rely on them, as does iterating through a 2D list. Sometimes while loops are used […]

## Flowcharts for GCSE Computer Science

Representing algorithms for GCSE Computer Science There are several ways to represent algorithms for GCSE Computer Science: Structured English Flowchart Pseudocode Program statements in a particular language In this article we are looking at flowcharts for GCSE Computer Science. For our example, we will create an algorithm which determines whether a given whole number is […]

## Binary Search Algorithm for GCSE and A Level Computer Science

Binary search is an algorithm which is fundamental to both GCSE and A Level Computer Science for all boards. It is a very clever algorithm which reduces the time needed to search for items in large datasets dramatically. It is important to note that in order to use binary search, your data must be sorted. […]

## GCSE Computer Science Programming Practice – Pascal’s Triangle

Whether you are going to start your GCSE Computer Science course next term or are already halfway through, it’s always a good time to do some coding practice. Here’s a fun intermediate level challenge for all you coding enthusiasts out there. Coding Pascal’s Triangle with Python Pascal’s Triangle is a fascinating mathematical structure which contains […]

## Times Tables Trace Table

I want to share a programming activity with you which addresses several topics in the GCSE computer Science syllabus. One of the challenges when following a syllabus with clearly delineated assessment objectives is that the knowledge required to become a competent programmer is deeply interconnected, and the various components rarely appear in isolation. For example, […]

## Book Review – Grokking Algorithms by Aditya Bhargava

Understanding algorithms for A Level Computer Science can be tough, and any resource which makes the job easier has to be a good thing. I expect you are familiar with the phrase “a picture is worth a thousand words.” One of the main strengths of Bhargava’a book is the extremely clear (and sometimes quirky) pictures […]

## Insertion Sort for GCSE and A Level Computer Science

Insertion sort is one of the standard algorithms you will come across studying Computer Science for GCSE and A Level. There are many different versions of the code for it scattered across the internet, but there are basically three common “flavours” you will find. In this article we will look at some Python implementations. First […]

## Cambridge A Level Computer Science Trace Tables Exam-Style Question

The Cambridge International AS and A Level Computer Science Coursebook is generally a fantastic resource, covering the entire 9608 syllabus in depth. However, there are a few frustrating issues with the book, including some errors. For example, on page 245 as part of an exam-style question, the following pseudocode is given for an algorithm to […]

## The Euclidean Algorithm on the TI-84 Graphing Calculator

The Euclidean Algorithm an ancient Greek method for finding the greatest common divisor of two numbers. In spite of its age, it is still of great importance in modern mathematics and computing, for example in encryption algorithms such as RSA. There is a great video from James Tanton explaining the algorithm here. Below is TI-Basic […]