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 (121 Slides) cover all aspects of the specification in relation to Edexcel GCSE Computer Science 1CP2 (from 2020) topic 4.
It includes:
Teaching PowerPoints (including checkpoint questions and answers)
Student PowerPoint (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)
This pack consists of 30 editable homework/classwork activities that can be used to support your delivery of the course. In addition, the homework pack also contains a suggested mark scheme for each activity.
Topic 1 & 6
· Decomposition and Abstraction
· Flowcharts and Programs
· Sorting Data
· Sorting and Searching Programs
· Selection
· Arrays (Lists)
· Functions
· Improving Programs
· Testing
Topic 2
· Data Capacity
· Conversions
· Compression
Topic 3
· Components of a CPU
· CPU Performance
· Embedded Systems
· Storage Comparison
· Operating Systems
· Utility Software
· Authentication
· Programming Languages
Topic 4
· LANS and WANS
· Wired and Wireless Networks
· Star and Mesh Networks
· Network Protocols
· The Concept of Layers
Topic 5
· The Impact of Technology
· The Environment
· Social & Work Issues
· Network Vulnerabilities
These adaptable PowerPoint Presentations (219 Slides) cover all aspects of the specification in relation to AQA GCSE Computer Science 8525 (from 2020) component 3.4.
It includes:
Teaching PowerPoints (including checkpoint questions and answers) -
Student PowerPoints (Including checkpoint questions, but omits the answers)
Content Covered:
Define the terms hardware and software and understand the relationship between them.
Construct truth tables for the following logic gates:
• NOT
• AND
• OR
• XOR.
Construct truth tables for simple logic circuits using combinations of NOT, AND, OR and XOR gates.
Interpret the results of simple truth tables.
Create, modify and interpret simple logic circuit diagrams.
Students will only need to use NOT, AND, OR and XOR gates within logic circuits.
Students will be expected to understand and use the standard logic circuit symbols.
Create and interpret simple Boolean expressions made up of NOT, AND, OR and XOR operations.
Create the Boolean expression for a simple logic circuit.
Create a logic circuit from a simple Booleanexpression.
Explain what is meant by:
• system software
• application software.
Give examples of both types of software.
Understand the need for, and functions of, operating systems (OS) and utility programs.
Understand that the OS handles management of the:
• processor(s)
• memory
• input/output (I/O) devices
• applications
• security.
Know that there are different levels of programming language:
• low-level language
• high-level language.
Explain the main differences between low-level and high-level languages.
Know that machine code and assembly language are considered to be low-level languages and explain the differences between them.
Understand that all programming code written in high-level or assembly languages must be translated.
Understand that machine code is expressed in binary and is specific to a processor or family of processors.
Understand the advantages and disadvantages of low-level language programming compared with high-level language programming.
Understand that there are three common types of program translator:
• interpreter
• compiler
• assembler.
Explain the main differences between these three types of translator.
Understand when it would be appropriate to use each type of translator.
Explain the role and operation of main memory and the following major components of a central processing unit (CPU) within the Von Neumann architecture:
• arithmetic logic unit
• control unit
• clock
• register
• bus.
Explain the effect of the following on the performance of the CPU:
• clock speed
• number of processor cores
• cache size.
Understand and explain the Fetch-Execute cycle.
Understand the different types of memory within a computer:
• RAM
• ROM
• Cache
• Register.
Know what the different types of memory are used for and why they are required.
etc
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.
This pack includes four practice exam papers with mark schemes for AQA GCSE Computer Science (9–1) specification (first teaching September 2020, examinations from 2022).
The papers have been written to replicate the style of AQA examinations. These papers provide students with an opportunity to familiarise themselves with the look and feel of an AQA paper.
The digital pack includes:
· two practice papers for Computational Thinking and Programming Skills (Paper 1)
· two practice papers for Computing Concepts (Paper 2)
The papers combined cover all aspects of the computer science curriculum.
You will also receive a comprehensive mark scheme for each paper.
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. Students also have to complete a series of challenges at the end of each activity.
These adaptable PowerPoint Presentations (79 Slides) cover all aspects of the specification in relation to Edexcel GCSE Computer Science 1CP2 (from 2020) topic 5.
It includes:
Teaching PowerPoints (including checkpoint questions and answers)
Student PowerPoints (Including checkpoint questions, but omits the answers)
Content Covered:
· understand environmental issues associated with the use of digital devices (energy consumption, manufacture, replacement cycle, disposal)
· understand ethical and legal issues associated with the collection and use of personal data (privacy, ownership, consent, misuse, data protection)
· understand ethical and legal issues associated with the use of artificial intelligence, machine learning and robotics (accountability, safety, algorithmic bias, legal liability)
· understand methods of intellectual property protection for computer systems and software (copyright, patents, trademarks, licencing)
· understand the threat to digital systems posed by malware (viruses, worms, Trojans, ransomware, key loggers) and how hackers exploit technical vulnerabilities (unpatched software, out-of-date anti-malware) and use social engineering to carry out cyberattacks
· understand methods of protecting digital systems and data (anti-malware, encryption, acceptable use policies, backup and recovery procedures)
This pack consists of 13 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.
Topic 1 & 6 - 3 Tests
Topic 2 – 1 Test
Topic 3 – 5 Tests
Topic 4 – 2 Tests
Topic 5 – 2 Tests
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
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. Students also have to complete a series of challenges at the end of each activity.
This pack includes four practice exam papers with mark schemes for Edexcel GCSE Computer Science (9–1) specification (first teaching September 2020, examinations from 2022).
The papers have been written to replicate the style of Edexcel examinations. These papers provide students with an opportunity to familiarise themselves with the look and feel of an Edexcel paper. Python is the programming language used.
The digital pack includes:
· two practice papers for Principles of Computer Science (Paper 1)
· two practice papers for Application of Computational Thinking (Paper 2) – Included with these papers are Python files for access by students during the exam and a complete set of Python file solutions.
The papers combined cover all aspects of the computer science curriculum.
You will also receive a comprehensive mark scheme for each paper.
These adaptable Teacher PowerPoint Presentations (479 Slides) cover all aspects of the specification in relation to OCR GCSE Computer Science J277 (from 2020) Component 1 - Computer Systems.
It includes:
Teaching PowerPoint Presentations (including checkpoint questions and answers)
Student PowerPoint Presentations (Including checkpoint questions, but omits the answers)
Content Covered:
1.1 Systems architecture
1.2 Memory and storage
1.3Computer networks, connections and protocols
1.4 Network security
1.5 Systems software
1.6 Ethical, legal, cultural and environmental impacts of digital technology
These adaptable PowerPoint Presentations (836 Slides) cover all aspects of the specification in relation to OCR GCSE Computer Science J277 (from 2020).
Component 1 - Computer Systems
Component 2 - Computational thinking, algorithms and programming.
It includes:
Teaching PowerPoint Presentations (including checkpoint questions and answers) 800+Slides
Student PowerPoint Presentations (Including checkpoint questions, but omits the
answers)
A Complete Guide to Python Programming (including student activities)
Content Covered:
1.1 Systems architecture
1.2 Memory and storage
1.3 Computer networks, connections and protocols
1.4 Network security
1.5 Systems software
1.6 Ethical, legal, cultural and environmental impacts of digital technology
2.1 Algorithms
2.2 Programming fundamentals
2.3 Producing robust programs
2.4 Boolean logic
2.5 Programming languages and Integrated Development Environments
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.
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!
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. Students also have to complete a series of challenges at the end of each activity.
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
These adaptable PowerPoint Presentations (788 Slides) provide complete coverage of all aspects of the specification in relation to AQA GCSE Computer Science 8525 (from 2020) - Unit 3.1 to 3.8.
It includes:
Teaching PowerPoints (including checkpoint questions and answers)
Student PowerPoints (Including checkpoint questions, but omits the answers)
A Complete Guide to Python Programming (Includes student activities)
What does the teacher pack cover?
• 3.1 Fundamentals of algorithms
• 3.2 Programming
• 3.3 Fundamentals of data representation
• 3.4 Computer systems
• 3.5 Fundamentals of computer networks
• 3.6 Cyber security
• 3.7 Relational databases and structured query language (SQL)
• 3.8 Ethical, legal and environmental impacts of digital technology on wider society, including
issues of privacy