Project life cycle and  managementQuick View
rnodamcraernodamcrae

Project life cycle and management

(0)
A presentation that discusses the different stages of a typical life cycle, focusing on the documentation that is produced at each stage. It that takes the class through what is the waterfall and agile project management methodologies and looks at the advantages and disadvantages of each methodology. There are two accompanying documents. One is a simple starter exercise to help pupils recall the lesson later on and a whole lesson activity. This starts with pupils planning the making of a cake according to the project cycle process, and leads them to creating a Gantt chart for the creation of a website. This has been used in Unit 8 of the Cambridge Technicals in ICT , other vocational ICT courses and could be used in the IB course.
Edexcel GCSE Computer science paper 2 mock exam 2021 onwardsQuick View
rnodamcraernodamcrae

Edexcel GCSE Computer science paper 2 mock exam 2021 onwards

(0)
Mock exam for the new Edexcel GCSE specification starting 2020. Though not approved by the exam board, this follows very closely the sample exam paper given by Edexcel but is sufficiently different to that paper so that you can use it in a mock exam. The exam is in Python. A mark scheme has been included
Trace tablesQuick View
rnodamcraernodamcrae

Trace tables

(0)
A set of trace tables written in pseudocode. 30 different trace tables designed so that they gradually become more complex, from the most basic of programming concepts like ASSIGNMENT to the the passing of data between functions. Appropriate for introduction to coding level courses, like GCSE CS. Appropriate to be used as lesson starters, included into homeworks or for in class exams. Can be used when teaching Python or any other C family language.
Edexcel GCSE Computer Science theory mock examQuick View
rnodamcraernodamcrae

Edexcel GCSE Computer Science theory mock exam

(0)
Since the only exam for the new Edexcel GCSE computer science Paper 1: Principles of Computer Science is an easily available sample paper, I have created this simulation exam so that pupils can be given a mock exam and their genuine capability in the topic be judged. This follows the sample paper carefully but draws on typical GCS style questions from previous years as guidance. This is a mock exam for the GCSe that started in 2020 for first assessment in 2022 A mark scheme is supplied.
Boolean AlgebraQuick View
rnodamcraernodamcrae

Boolean Algebra

(0)
A presentation that can be used for A level computer science. It will take the pupils through the creation of digital circuits from combinations of logic gates through to the simplification of logic statements using Boolean Algebra. There are two accompanying worksheets which can be used in the lesson or broken up to be used in mock exams or as starters.
RISC VS CISCQuick View
rnodamcraernodamcrae

RISC VS CISC

(0)
A simple slide show originally created for AQA A level computer science. This will outline the differences between RISC and CISC, indicating the advantages of one over the other, and suggesting where each is employed.
CD and Hard DriveQuick View
rnodamcraernodamcrae

CD and Hard Drive

(0)
A resource originally designed for AQA GCSE Computer Science but that can be used at A level too. The presentation goes through how data is recorded and stored on a magnetic Hard Drive and an optical CD disc. It also shows how a hard drive can become fragmented and how the use of a defrag utility can improve efficiency. The accompanying worksheet can be used to supplement learning.
Circular QueueQuick View
rnodamcraernodamcrae

Circular Queue

(0)
Orignally designed for AQA A Level Computer Science this presentation explains how a circular queue is different to a linear queue and shows how the front andd rear of the queue change as elements are added or taken away from the queue. At the end it sets a programming challenge for pupils.
IB Computing Paper 1 mock examQuick View
rnodamcraernodamcrae

IB Computing Paper 1 mock exam

(0)
A mock exam for the IB diploma paper 1. Since IB makes public all its past papers I have created a mock exam that mimics as a closely as possible the design, duration and complexity of the Paper 1 but which is not out in the general public domain. This can therefore be used to test IB computing pupils and render an accurate idea of their genuine capabilities and understanding. The nature of the questions follows the IB papers and focuses on topics that often arise: recursion; distributed and central control; binary trees; stacks; the role of the operating system and so on. A full mark scheme is also include.
Common CircuitsQuick View
rnodamcraernodamcrae

Common Circuits

(0)
A resource originally designed for AQA A level Computer Science but which can also be used at GCSE level. There is a presentation showing three common circuits: the half adder, the full adder and Flip Flops. Both the D and SR Flip flop are discussed. Corresponding truth tables for the circuits are presented. When presenting Flip Flops the slide show introduces the notion of sequential circuits, explaining how they can be used to store data and why they are volatile. The accompanying PDFs are of the same set of supporting questions; one has answers as guidance for the teacher.
JSON and XMLQuick View
rnodamcraernodamcrae

JSON and XML

(0)
A resource originally designed for AQA A level computer Science. There is a slide-show that introduces JSON and XML. It shows typical coding for both and outline the advantages and disadvantages of the two approaches. There are two PDFs of the same worksheet to accompany the slide-show; one with answers for the teacher.
Solid State MemoryQuick View
rnodamcraernodamcrae

Solid State Memory

(0)
A presentation show explaining the basic principals of how a solid state memory works. Appropriate for A level computer science. A label the diagram worksheet accompanies the presentation.
Genetic Algorithms for travelling salesperson problemQuick View
rnodamcraernodamcrae

Genetic Algorithms for travelling salesperson problem

(0)
A series of slide shows that introduce the idea of genetic algorithms, how they work and what they require. Discussion includes the concepts of crossover, mutation and inheritance. Created with the current Paper 3 component of the IB, international baccalaureate, computing qualification dealing with the traveling salesperson problem Key words: Shortest path, genetic algorithms, crossover, mutation, traveling salesman problem, graphs, mapping, map
SSHQuick View
rnodamcraernodamcrae

SSH

(0)
A slide show that identifies what SSH is, what it is used for and the authentication steps that must take place in order to set up a secure session. The worksheet can be used either as a quiz sheet or for pupils to take notes as the slide show is shown.