I started out as a science teacher and made the transition to teaching ICT and Computer Science, which I have now been doing for over 20 years. I have also worked with primary school teachers to support their delivery of the national curriculum in computing.
Edulito is a UK based educational publishing company that provides learning resources for school-aged children. All of the available resources have been tested in UK schools.
I started out as a science teacher and made the transition to teaching ICT and Computer Science, which I have now been doing for over 20 years. I have also worked with primary school teachers to support their delivery of the national curriculum in computing.
Edulito is a UK based educational publishing company that provides learning resources for school-aged children. All of the available resources have been tested in UK schools.
These adaptable PowerPoint Presentations (750 Slides) provide complete coverage of all aspects of the specification in relation to Edexcel GCSE Computer Science 1CP2 (from 2020) - Topics 1 to 6.
It includes:
Teaching PowerPoints (including checkpoint questions and answers) - 750+ slides
Student PowerPoints (Including checkpoint questions, but omits the answers)
A Complete Guide to Python Programming (including student activities)
The resources cover:
Topic 1: Computational thinking – understanding of what algorithms are, what they are used for and how they work; ability to follow, amend and write algorithms; ability to construct truth tables.
Topic 2: Data – understanding of binary, data representation, data storage and compression.
Topic 3: Computers – understanding of hardware and software components of computer systems and characteristics of programming languages.
Topic 4: Networks – understanding of computer networks and network security.
Topic 5: Issues and impact – awareness of emerging trends in computing technologies, and the impact of computing on individuals, society and the environment, including ethical, legal and ownership issues.
Topic 6: Problem solving with programming
This photocopiable resource has been produced to ensure that your students are able to successfully complete their GCSE Computer Science GCSE (9-1), but can also be used by other exam systems.
This test is designed to provide a stimulating, engaging and effective way of assessing the progress of your students. As well as the topic test, you are also provided with a comprehensive marking scheme.
Please be aware that there may be appropriate alternative answers to some of the questions, and it is therefore suggested that the teacher uses their discretion when marking students work.
These adaptable PowerPoint Presentations (188 Slides) cover all aspects of the specification in relation to AQA GCSE Computer Science 8525 (from 2020) component 3.2. Python is used as the programming language in this unit.
It includes:
Teaching PowerPoints (including checkpoint questions and answers)
Student PowerPoints (Includes checkpoint questions, but omits the answers)
Content Covered:
Understand the concept of a data type.
Understand and use the following appropriately:
• integer
• real
• Boolean
• character
• string.
Use, understand and know how the following
statement types can be combined in programs:
• variable declaration
• constant declaration
• assignment
• iteration
• selection
• subroutine (procedure/function).
Use definite (count controlled) and indefinite (condition controlled) iteration, including indefinite iteration with the condition(s) at the start or the end of the iterative structure.
Use nested selection and nested iteration structures.
Use meaningful identifier names and know why it is important to use them.
Be familiar with and be able to use:
• addition
• subtraction
• multiplication
• real division
• integer division, including remainders.
Be familiar with and be able to use:
• equal to
• not equal to
• less than
• greater than
• less than or equal to
• greater than or equal to.
Be familiar with and be able to use:
• NOT
• AND
• OR
Understand the concept of data structures.
Use arrays (or equivalent) in the design of solutions to simple problems.
Use records (or equivalent) in the design of solutions to simple problems.
Be able to obtain user input from the keyboard.
Be able to output data and information from a program to the computer display.
Understand and be able to use:
• Length
• Position
• Sub-string
• Concatenation
• convert character to character code
• convert character code to character
• string conversion operations.
Be able to use random number generation.
Understand the concept of subroutines.
Explain the advantages of using subroutines in programs.
Describe the use of parameters to pass data within programs.
Use subroutines that return values to the calling routine.
Know that subroutines may declare their own variables, called local variables, and that local
variables usually:
• only exist while the subroutine is executing
• are only accessible within the subroutine.
Use local variables and explain why it is good practice to do so.
Describe the structured approach to programming.
Explain the advantages of the structured approach.
Be able to write simple data validation routines.
Be able to write simple authentication routines.
Understand what is meant by testing in the context of algorithms and programs.
Be able to correct errors within algorithms and programs.
Understand what test data is and describe the following types of test data:
• normal (typical)
• boundary (extreme)
• erroneous data.
This pack consists of 14 end of topic tests that can be used to support your delivery of the course. In addition, the topic test bundle also contains a mark scheme for each test.
Unit 1.1 – 1 Test
Unit 1.2 – 3 Tests
Unit 1.3 – 2 Tests
Unit 1.4 -1 Test
Unit 1.5 - 1 Test
Unit 1.6 - 1 Test
Unit 2.1 - 1 Test
Unit 2.2 - 1 Test
Unit 2.3 - 1 Test
Unit 2.4 - 1 Test
Unit 2.5 - 1 Test
These adaptable PowerPoint Presentations (69 Slides) cover all aspects of the specification in relation to AQA GCSE Computer Science 8525 (from 2020) component 3.5.
It includes:
Teaching PowerPoints (including checkpoint questions and answers) - 69 slides
Student PowerPoints (Including checkpoint questions, but omits the answers)
Content Covered:
Define what a computer network is.
Discuss the advantages and disadvantages of computer networks.
Describe the main types of computer network including:
• Personal Area Network (PAN)
• Local Area Network (LAN)
• Wide Area Network (WAN).
Understand that networks can be wired or wireless.
Discuss the advantages and disadvantages of wireless networks as opposed to wired networks.
Describe the following common LAN topologies:
• star
• bus.
Define the term network protocol.
Explain the purpose and use of common network protocols including:
• Ethernet
• Wi-Fi
• TCP (Transmission Control Protocol)
• UDP (User Datagram Protocol)
• IP (Internet Protocol)
• HTTP (Hypertext Transfer Protocol)
• HTTPS (Hypertext Transfer Protocol Secure)
• FTP (File Transfer Protocol)
• email protocols:
• SMTP (Simple Mail Transfer Protocol)
• IMAP (Internet Message Access Protocol).
Understand the need for, and importance of, network security.
Explain the following methods of network security:
• authentication
• encryption
• firewall
• MAC address filtering.
Describe the 4-layer TCP/IP model:
• application layer
• transport layer
• internet layer
• link layer.
Understand that the HTTP, HTTPS, SMTP, IMAP and FTP protocols operate at the application layer.
Understand that the TCP and UDP protocols operate at the transport layer.
Understand that the IP protocol operates at the internet layer.
These adaptable PowerPoint Presentations (125 Slides) cover all aspects of the specification in relation to AQA GCSE Computer Science 8525 (from 2020) component 3.3.
It includes:
Teaching PowerPoints (including checkpoint questions and answers) - 125 Slides
Student PowerPoints (Including checkpoint questions, but omits the answers)
Content Covered:
Understand the following number bases:
• decimal (base 10)
• binary (base 2)
• hexadecimal (base 16).
Understand that computers use binary to represent all data and instructions.
Explain why hexadecimal is often used in computer science.
Understand how binary can be used to represent whole numbers.
Understand how hexadecimal can be used to represent whole numbers.
Be able to convert in both directions between:
• binary and decimal
• binary and hexadecimal
• decimal and hexadecimal.
Know that:
• a bit is the fundamental unit of information
• a byte is a group of 8 bits.
Know that quantities of bytes can be described using prefixes. Know the names, symbols and corresponding values for the decimal prefixes: • kilo, 1 kB is 1,000 bytes
• mega, 1 MB is 1,000 kilobytes
• giga, 1 GB is 1,000 Megabytes
• tera, 1 TB is 1,000 Gigabytes.
Be able to compare quantities of bytes using the prefixes above.
Be able to add together up to three binary numbers.
Be able to apply a binary shift to a binary number.
Describe situations where binary shifts can be used.
Understand what a character set is and be able to describe the following character encoding methods:
• 7-bit ASCII
• Unicode.
Understand that character codes are commonly grouped and run in sequence within encoding tables.
Describe the purpose of Unicode and the advantages of Unicode over ASCII. Know that Unicode uses the same codes as ASCII up to 127.
Understand what a pixel is and be able to describe how pixels relate to an image and the way images are displayed.
Describe the following for bitmaps:
• image size
• colour depth.
Know that the size of a bitmap image is measured in pixels (width x height).
Describe how a bitmap represents an image using pixels and colour depth.
Describe using examples how the number of pixels and colour depth can affect the file size of a bitmap image.
Calculate bitmap image file sizes based on the number of pixels and colour depth.
Convert binary data into a bitmap image.
Convert a bitmap image into binary data.
Understand that sound is analogue and that it must be converted to a digital form for storage
and processing in a computer.
Understand that analogue signals are sampled to create the digital version of sound.
Describe the digital representation of sound in terms of:
• sampling rate
• sample resolution.
Calculate sound file sizes based on the sampling rate and the sample resolution.
Explain what data compression is.
Understand why data may be compressed and that there are different ways to compress data.
These adaptable Powerpoint Presentations (274 Slides) cover all aspects of the specification in relation to Edexcel GCSE Computer Science 1CP2 (from 2020) topic 1 and topic 6.
These two topics have been combined so that students can learn about algorithms and at the same time have the opportunity to understand how algorithms can then be developed into programs. The programming language used is Python.
It includes:
Teaching PowerPoints (including checkpoint questions and answers)
Student PowerPoints (Including checkpoint questions, but omits the answers)
Content Covered:
Topic 1
· understand the benefit of using decomposition and abstraction to model aspects of the real world and analyse, understand and solve problems
· understand the benefits of using subprograms
· be able to follow and write algorithms (flowcharts, written descriptions, draft program code or assessment reference language) that use sequence, selection, repetition (count-controlled, pre-conditioned, post-conditioned) and iteration (over every item in a data structure), and input, processing and output to solve problems
· understand the need for and be able to follow and write algorithms that use variables and constants and one- and two-dimensional data structures (strings, records, arrays)
· understand the need for and be able to follow and write algorithms that use arithmetic operators (add, subtract, divide, multiply, modulus, integer division), relational operators (equal to, less than, greater than, not equal to, less than or equal to, greater than or equal to) and logical operators (AND, OR, NOT)
· be able to determine the correct output of an algorithm for a given set of data and use a trace table to determine what value a variable will hold at a given point in an algorithm
· be able to identify and correct errors (logic, runtime) in algorithms
· understand how standard algorithms (bubble sort, merge sort, linear search, binary search) work
· be able to use logical reasoning and test data to evaluate an algorithm’s fitness for purpose and efficiency (number of compares, number of passes through a loop, use of memory)
· be able to apply logical operators (AND, OR, NOT) in appropriate truth tables to solve problems
Topic 6
· be able to use decomposition and abstraction to analyse, understand and solve problems
· be able to read, write, analyse and refine programs written in a high-level programming language
· be able to convert algorithms (flowcharts, written descriptions) into programs and convert programs into algorithms
· be able to use techniques (layout, comments, meaningful identifiers, white space) to make programs easier to read, understand and maintain
· be able to identify, locate and correct program errors (logic, syntax, runtime)
etc
These adaptable PowerPoint Presentations (169 Slides) cover all aspects of the specification in relation to Edexcel GCSE Computer Science 1CP2 (from 2020) topic 3.
It includes:
Teaching PowerPoints (including checkpoint questions and answers)
Student PowerPoints (Including checkpoint questions, but omits the answers)
Content Covered:
· understand why computers are connected in a network
· understand different types of networks (LAN, WAN)
· understand how the internet is structured (IP addressing, routers)
· understand how the characteristics of wired and wireless connectivity impact on performance (speed, range, throughput, bandwidth)
· understand that network speeds are measured in bits per second (kilobit, megabit, gigabit) and be able to construct expressions involving file size, transmission rate and time
· understand the role of and need for protocols (Ethernet, Wi-Fi, TCP/IP, HTTP, HTTPS, FTP and email (POP3, SMTP, IMAP))
· understand how the 4-layer (application, transport, network, data link) TCP/IP model handles data transmission over a network
· understand characteristics of network topologies (bus, star, mesh)
· understand the importance of network security, ways of identifying network vulnerabilities (penetration testing, ethical hacking) and methods of protecting networks (access control, physical security, firewalls)
These adaptable PowerPoint Presentations (107 Slides) cover all aspects of the specification in relation to Edexcel GCSE Computer Science 1CP2 (from 2020) topic 2.
It includes a:
Teaching PowerPoint Presentations (includes checkpoint questions and answers)
Student PowerPoint Presentations (Includes checkpoint questions, but omits the answers)
Content Covered:
· understand that computers use binary to represent data (numbers, text, sound, graphics) and program instructions and be able to determine the maximum number of states that can be represented by a binary pattern of a given length
· understand how computers represent and manipulate unsigned integers and two’s complement signed integers
· be able to convert between denary and 8-bit binary numbers (0 – 255, -127 – 128)
· be able to add together two positive binary patterns and apply logical and arithmetic binary shifts
· understand the concept of overflow in relation to the number of bits available to store a value
· understand why hexadecimal notation is used and be able to convert between hexadecimal and binary
· understand how computers encode characters using 7-bit ASCII
· understand how bitmap images are represented in binary (pixels, resolution, colour depth)
· understand how analogue sound is represented in binary (amplitude, sample rate, bit depth, sample interval)
· understand the limitations of binary representation of data (sampling frequency, resolution) when constrained by the number of available bits
· understand that data storage is measured in binary multiples (bit, nibble, byte, kibibyte, mebibyte, gibibyte, tebibyte) and be able to construct expressions to calculate file sizes and data capacity requirements
· understand the need for data compression and methods of compressing data (lossless, lossy)
This resource has been produced to teach children from 8 – 14 years of age about programming concepts by creating fun activities using the visual programming language Scratch 3.0. The activities and challenges have been designed to provide a stimulating, engaging and effective way of improving students’ knowledge of core programming concepts. Students also have to complete a series of challenges at the end of each activity.
Each Lesson includes:
A student worksheet including activities and challenges.
A teacher PowerPoint for use in class or online.
A complete video tutorial.
Scratch templates to get your students started.
Professor Cody Teaches Kids to Code using Scratch 3.0 – Lesson 1 – What is Coding?
This lesson is about algorithms and how they are used to produce computer programs.
Students will learn about the use of sequences of instructions and why it is important that these instructions are given in the correct order. They will create a dance computer program, add music and watch their very own choreographed dance! Lesson 1 comes with a complete video tutorial that will both engage and motivate.
Professor Cody Teaches Kids to Code using Scratch 3.0 – Lesson 2 – Using Variables
This lesson introduces the concept of variables and students have the opportunity of using text variables and number variables and completing a series of challenges.
Professor Cody Teaches Kids to Code using Scratch 3.0 – Lesson 3 – Using Selection
This lesson introduces the concept of selection and students have the opportunity of developing programs that use If and If then Else block structures. They will learn how to make a multi-answer quiz and create a Crack the Code game.
Professor Cody Teaches Kids to Code using Scratch 3.0 – Lesson 4 – Using Iteration (Repetition)
This lesson introduces the concept of Iteration (Repetition) and students have the opportunity of developing programs that repeat loops as well as forever loops. They will learn how to make programs more efficient by creating shapes using a repeat loop and will then move on to create a scary game using repeats and forever loops.
Professor Cody Teaches Kids to Code using Scratch 3.0 – Lesson 5 – Using Procedures & Functions
This lesson introduces the concept of Procedures and Functions using My Blocks.
Students have the opportunity of developing programs that use procedures to spray a car in a car factory as well as procedures used to build a house. They will also have the opportunity to create a function that returns a value to the main program.
Professor Cody Teaches Kids to Code using Scratch 3.0 – Lesson 6 – Using Arrays (Lists)
This lesson introduces the concept of Arrays using Scratch Lists. Students have the opportunity of developing programs that use arrays to make a birthday present list. They also get to make a memory game, where they have to memorise a series of items in a list. Finally, they use an array to create a high scorer list in a game.
These 6 video tutorials can be used as standalone teaching resources or can be used in conjunction with the Prof Cody Teaches Kids to Code using Scratch Lesson 1 - 6 teaching resources or the Professor Cody Teaches Kids to Code using Scratch book.
Each video, teaches kids about the key concepts of programming, in a fun and engaging way.
Each tutorial also includes a range of fun, game-making challenges.
Here is a list of the videos that are ready for you to download:
Video Tutorial 1 - What is Coding (6 Minutes)
Video Tutorial 2 - Using Variables (6 Minutes)
Video Tutorial 3 - Using Selection (8 Minutes)
Video Tutorial 4 - Using Iteration (Repetition) (7 minutes)
Video Tutorial 5 - Using Procedures and Functions (11 minutes)
Video Tutorial 6 - Using Arrays (Lists) (13 minutes)
The videos are also available to stream via YouTube
Lesson 1 – What is Coding?
This lesson is about algorithms and how they are used to produce computer programs.
Students will learn about the use of sequences of instructions and why it is important that these instructions are given in the correct order. They will create a dance computer program, add music and watch their very own choreographed dance!
Professor Cody Teaches Kids to Code using Scratch 3.0 – Lesson 2 – Using Variables
This lesson introduces the concept of variables and students have the opportunity of using text variables and number variables and completing a series of challenges.
Professor Cody Teaches Kids to Code using Scratch 3.0 – Lesson 3 – Using Selection
This lesson introduces the concept of selection and students have the opportunity of developing programs that use If and If then Else block structures. They will learn how to make a multi-answer quiz and create a Crack the Code game.
Professor Cody Teaches Kids to Code using Scratch 3.0 – Lesson 4 – Using Iteration (Repetition)
This lesson introduces the concept of Iteration (Repetition) and students have the opportunity of developing programs that repeat loops as well as forever loops. They will learn how to make programs more efficient by creating shapes using a repeat loop and will then move on to create a scary game using repeats and forever loops.
Professor Cody Teaches Kids to Code using Scratch 3.0 – Lesson 5 – Using Procedures & Functions
This lesson introduces the concept of Procedures and Functions using My Blocks.
Students have the opportunity of developing programs that use procedures to spray a car in a car factory as well as procedures used to build a house. They will also have the opportunity to create a function that returns a value to the main program.
Professor Cody Teaches Kids to Code using Scratch 3.0 – Lesson 6 – Using Arrays (Lists)
This lesson introduces the concept of Arrays using Scratch Lists. Students have the opportunity of developing programs that use arrays to make a birthday present list. They also get to make a memory game, where they have to memorise a series of items in a list. Finally, they use an array to create a high scorer list in a game.
This photocopiable resource has been produced to ensure that your students are able to successfully complete their GCSE Computer Science GCSE (9-1), but can also be used by other exam systems.
This test has been designed to provide a stimulating, engaging and effective way of assessing the progress of your students. As well as the topic test, you are also provided with a comprehensive marking scheme.
Please be aware that there may be appropriate alternative answers to some of the questions, and it is therefore suggested that the teacher uses their discretion when marking students work.
This photocopiable resource has been produced to ensure that your students are able to successfully complete their GCSE Computer Science GCSE (9-1), but can also be used by other exam systems.
This test has been designed to provide a stimulating, engaging and effective way of assessing the progress of your students. As well as the topic test, you are also provided with a comprehensive marking scheme.
Please be aware that there may be appropriate alternative answers to some of the questions, and it is therefore suggested that the teacher uses their discretion when marking students work.
This photocopiable resource has been produced to ensure that your students are able to successfully complete the OCR Computer Science GCSE NEA.
This support pack is designed to provide a stimulating, engaging and effective way of preparing both teachers and students for the Non-Examined Assessment Component of the 9-1 GCSE in computer science.
The pack contains:
Introduction for students - NEA Procedures
Technical Preparation for the NEA component
J276 Programming project Sample Task 1 - Archside Academy Detention Database.
Including:
NEA sample project scenario
NEA sample student solution
NEA sample Python code
J276 Programming project Sample Task 2 - Quiz Board Game
Including:
NEA sample project scenario
NEA sample student solution
NEA sample Python code
Help sheet 1 - Creating a board game using Python - Includes a complete set of instructions
Help sheet 2 - Creating a database using Python - Includes a complete set of instructions
Help Sheet 3 - Menus, Lists and Exporting using Python - Includes a complete set of instructions
This photocopiable resource has been produced to ensure that your students are able to successfully complete their GCSE Computer Science GCSE (9-1), but can also be used by other exam systems.
This test has been designed to provide a stimulating, engaging and effective way of assessing the progress of your students. As well as the topic test, you are also provided with a comprehensive marking scheme.
Please be aware that there may be appropriate alternative answers to some of the questions, and it is therefore suggested that the teacher uses their discretion when marking students work.
This photocopiable resource has been produced to ensure that your students are able to successfully complete their GCSE Computer Science GCSE (9-1), but can also be used by other exam systems.
This test has been designed to provide a stimulating, engaging and effective way of assessing the progress of your students. As well as the topic test, you are also provided with a comprehensive marking scheme.
Please be aware that there may be appropriate alternative answers to some of the questions, and it is therefore suggested that the teacher uses their discretion when marking students work.
This photocopiable resource has been produced to provide 7 to 14 year olds with exciting and engaging opportunities to learn coding concepts using the Python programming language. There are enough activities for 4 to 5 lessons.
Including:
Algorithms
Sequences
Iteration (Repetition)
Selection
Variables
The resource covers the programming aspect of the computing national curriculum.
use two or more programming languages, at least one of which is textual, to solve a variety of computational problems
make appropriate use of data structures [for example, lists, tables or arrays]
design and develop modular programs that use procedures or functions.
In this lesson you learn about 2D Arrays or as they are called in Python - 2D Lists.
You will learn how to create a list, append a new item to a list, search for an item in a 2D list and displaying a 2D list as a table.
Python and the Python Logo are trademarks or registered trade marks of the Python Software Foundation.
In this lesson you are introduced to the use of relational (sometimes known as comparison) operators and Boolean. operators in Python programming.
Python and the Python Logo are trademarks or registered trade marks of the Python Software Foundation.
In this video I introduce variables and how they are used in Python programs.
Python and the Python Logo are trademarks or registered trade marks of the Python Software Foundation.
