This magic trick from the Computer Science for Fun team at QMUL shows that computing is about more than just programming and computational thinking is about more than just algorithms.

A simple mathematical approach is taken with dealt piles of cards – this allows the dealer to control the whereabouts of the...

This unplugged activity from the CS4FN team uses two examples – an insulting computer and one that can play snap – to look at simple computer programming, flow of control and logic. Everything is provided for this front-of-class activity, which would act as an effective starter for a lesson on programming concepts...

In this activity from the CS4FN team, learners are introduced to algorithms in the context of artificial intelligence. They are challenged to beat a ‘piece of paper’ at a game of noughts and crosses. By following a simple algorithm, the piece of paper becomes very difficult to beat. The algorithm is a sequence of...

The twenty seven challenges contained in this booklet are designed to challenge and inspire students whilst helping them on their journey to becoming a ‘computational thinker’. The ideas contained in the booklet will also provide useful teacher stimulation when planning lessons.

Many of the challenges...

This resource contains a series of card tricks. Each trick is presented in two parts. In the first part enough detail is given so that the trick can be performed. A description of the desired effect is given followed by an explanation of the mechanics of the trick – actually what is done to ensure the trick works...

The Magic of Computer Science II begins with an introduction to the resource, explaining the basic concepts used in the book. There follows descriptions of how to perform seven tricks with explanations of how the trick works and the computer science concepts illustrated in the tricks.

The joker in...

The third collection of magic tricks, from Paul Curzon and Peter McOwan, is entitled ‘magic meets mistakes, machines and medicine. The five card tricks contained make use of maths and computer science theory, and are used by real magicians.

Each trick includes magician’s instructions. The theory behind each...

Our society is linked by many networks: telephone networks, utility supply networks, computer networks, and road networks. For a particular network there is usually some choice about where the roads, cables, or radio links can be placed. This resource explores the need to find ways of efficiently linking objects in...

When there are a lot of people using one resource, such as cars using roads, or messages getting through the Internet, there is the possibility of “deadlock”. A way of working cooperatively is needed to avoid this happening. The resource begins with instructions on how to play the orange game. The activity contains...

This activity shows how to accomplish a simple, but nevertheless seemingly impossible task -making a fair random choice by flipping a coin, between two people who don’t necessarily trust each other, and are connected only by a telephone. The resource begins with a detailed explanation of the activity and...

Many optimization problems involve situations where certain events cannot occur at the same time, or where certain members of a set of objects cannot be adjacent. For example, anyone who has tried to time-table classes or meetings will have encountered the problem of satisfying the constraints on all the people...

This edition of the Computing at School newsletter focuses on teaching computing in primary schools, and contains articles covering:

*Pedagogy of computing in primary schools

*National curriculum programme of study

*Game design in the primary classroom

*Primary – secondary transition...

This introductory article shows working examples of basic Python programs. It includes:

• Printing to the screen
• Comments
• Simple arithmetic
• Using variables
• Strings and string arrays
• For and While loops
• Random numbers from the Random library
• Creating a...