2.1 - Algorithms
2.1.3 - Searching and Sorting Algorithms

This is one of the most straightforward parts of unit 2. All of the algorithms here have easy to understand methods and are sufficiently different that you shouldn't confuse one for the other. As usual, at GCSE level, you need to know the algorithm and some advantages and disadvantages. It seems like a lot at […]

Read more
2.5 - Languages and IDE's
2.5 - Languages and Integrated Development Environments (IDE's)

In this section: 2.5.1 – Languages Fact: Computers only understand binary. That is their language. Everything else is meaningless to them. It might seem odd, then, that there are hundreds of programming languages available today and none of them look anything like binary. How is this possible? Why do they exist? Computer programming is a […]

Read more
2.4 - Boolean Logic
2.4 - Boolean Logic

In Unit 1 we learned that the CPU has a fixed set of instructions (an instruction set) and that these can be combined to make useful programs. The CPU then fetches, decodes and executes these instructions continuously until the power is turned off. This section takes the next step towards understanding how a CPU really […]

Read more
2.3 - Robust Programs
2.3 - Producing Robust Programs

This section is all about creating programs that don’t fall apart as soon as something unexpected happens. We should all know by now that computers have zero intelligence and can only do exactly as they are told. Therefore, when we do something like taking input in a program and we tell the computer to expect […]

Read more