## Listing all results (139)

### Algorithm efficiency

From a more mathematical perspective this time, this document covers the derivation of algorithm complexity. It could be used in the classroom as extension reading  or as a homework.

### Big O Notation

This presentation covers algorithms and their complexity expressed as Big O notation. This could be used by students as a revision aid or as a basic introduction to the topic.

### Computational thinking: Puzzling tours

This is a very comprehensive resource covering a range of pathfinding algorithm activities using graphs. It includes the Knight’s Tour puzzle as well as other examples. This is a highly readable resource that could be used for smaller activities including homework.

### Create a Face

This unplugged activity uses a large model of a face, operated by several children working together, to teach how ‘emotion’ can be expressed by robots following simple rules. These rules are expressed as IF, THEN, ELSE, statements which, when combined, show the complex movement of a whole face in reaction to...

### Boolean algebra exploration

This set of resources provides comprehensive coverage of the topic of logic, Boolean algebra and simplifying expressions using Karnaugh maps. There are a series of student activities involving deriving expressions from logic gate combinations, rules of Boolean algebra and building logic expressions.

...

### Summary of Boolean algebra

This document is a Computing at School community resource that covers the laws of Boolean algebra. It consists of a student worksheet and answer sheet. It is very suitable as a revision resource.

### Searching, sorting and Big O notation

A resource from the CS4FN bank produced by Queen Mary and King’s College, University of London. Students will be able to link the algorithms that they have learned and the relative complexity expressed in Big O notation. The resource consists of a series of slides, program files with solution, an activity sheet and...

### Learning from probabilities

One of the series of Royal Institution Christmas lectures focusing on Bayes’ theorem. The topic of the resource is an investigation into stolen chocolate biscuits so would make an interesting end of term diversion.

### Range versus accuracy in floating point binary numbers

Students need to be aware of the trade-off when the number of bits allocated to the mantissa and exponent are increased or decreased. This worksheet allows them to answer practice questions. Answers are provided.

### Software testing

This document consists of presentation slides on the topic of software testing. It defines relevant keywords and explains testing methodologies. It could form a useful revision resource or comprehension questions could be designed around its contents.