<p>A useful resource for guiding students through the process of converting positive and negative denary numbers into floating-point form. Includes step-by-step animations related to the process of normalising the mantissa and calculating the exponet of a floating-point representation.</p> <p>Designed for the Cambridge A2 Computer Science course.</p>

<p>Designed for the Cambridge AS Computer Science course. One PowerPoint compares relational databases with flat files, including looking at the benefits of relational databases. The other PowerPoint walks you through the requirements for relational database tables to be normalised, from first normal form (1NF) to third normal form (3NF).</p> <p>I use these to frame lesson activities and discussion.</p>

<p>Covers:</p> <ul> <li>logic shifts left/right (unsigned integers)</li> <li>arithmetic shifts left/right (two’s complement integers)</li> </ul> <p>Includes animations to show what occurs during bit shifting.</p> <p>Use as the basis of notes for students and teachers. Clear examples shown on each slide.</p> <p>Suitable for GCSE level or above.</p>

<p>Designed for the Cambridge 9618 A2 curriculum.</p> <ul> <li>Two PowerPoint presentations - teacher versions have answers</li> <li>Three worksheets for use with Dijkstra’s algorithm</li> </ul> <p>Don’t have much time but still need to teach basic graph theory? This is the perfect set of resources to get you up and running.</p>

<p>Designed for the Cambridge IGCSE Computer Science course, this presentation is applicable to other exam boards as well. Shows symbols and truth tables for the following logic gates: AND, OR, NOT, NAND, NOR, XOR.</p> <p>Also demonstrates logic statements - a good activity is to have students draw logic circuits from these logic statements and then complete the corresponding truth tables. Also includes a nod to binary addition and the half-adder logic circuit.</p>

<p>Designed for the Cambridge A2 Computer Science course, this PowerPoint introduces real numbers in binary. It reiterates concepts about positive integers, covered in IGCSE Computer Science, then looks at fixed-point binary place values, before covering key terms related to floating-point representations: register, mantissa, exponent.</p> <p>Useful as an introductory lesson on floating-point binary or as part of a (flipped classroom) homework exercise.</p>

<p>Not sure where to start with the Declarative Programming Paradigm? This PowerPoint was designed for the Cambridge A2 Computer Science course although it’s applicable to other exam boards as well.</p> <p>Use this presentation as a starting point. Covers terminology associated with the declarative programming paradigm.</p>