Welcome to my TES shop! I am a subject leader for ICT & Computer Science, creating and sharing resources to support teachers in delivering ICT, Computer Science, Computational Thinking and the Digital Competence Framework. For more resources, visit robbotresources.com
email: carl@robbotresources.com
Welcome to my TES shop! I am a subject leader for ICT & Computer Science, creating and sharing resources to support teachers in delivering ICT, Computer Science, Computational Thinking and the Digital Competence Framework. For more resources, visit robbotresources.com
email: carl@robbotresources.com
Within this short unit of work, students will learn the following:
To understand why subroutines are used.
To explain the difference between a procedure and a function.
To explain the purpose of a local and global variable.
To understand how to write a subroutine.
Learning is consolidated with a series of differentiated subroutine algorithm tasks that challenge students on their understanding of algorithms and subroutines.
It is highly recommended that students complete the Rob-Bot Resources KS4 Algorithm Design unit of work before completing this unit.
This bundle has been created to support students in their revision for their GCSE Computer Science Exams. It contains the following:
GCSE 9-1 Computer Science Flash Activity Sheets
GCSE Computer Science Vocabulary - Interactive Booklet
GCSE 9-1 Computer Science Knowledge Organiser: Computer Systems
GCSE 9-1 Computer Science Poster: How to read and write Edexcel pseudo code
GCSE 9-1 Computer Science Poster: How to read and write Edexcel pseudo code
GCSE 9-1 Computer Science Poster: Impact of Digital Technology on Society
GCSE Computer Science: Revision Clock
Develop brilliant Algorithm Designers with my Algorithms bundle! This package includes the following units of work:
GCSE 9-1 Computer Science: KS4 Algorithm Design
GCSE 9-1 Computer Science: Algorithm Design - Data Types
GCSE 9-1 Computer Science: Algorithm Design - Arrays
GCSE 9-1 Computer Science:Algorithm Design - Subroutines
GCSE 9-1 Computer Science: Algorithm Design - Trace Tables
I have also added some of my most popular posters to support and consolidate student understanding even more.
Purchase all these great resources in this single bundle and save over 40% on individual cost!
This bundle includes both my comprehensive Sorting and Searching Algorithms units of work.
Within Sorting Algorithms, your students will learn how to:
Understand different methods of sorting data within an array:
Bubble sort
Merge sort
Explain how both methods work.
Identify advantages and disadvantages of using both techniques.
Within Searching Algorithms, your students will learn to:
To understand different methods of searching data within an array:
Linear search
Binary search
Explain how both methods work.
To identify advantages and disadvantages of using both techniques.
Students will learn about how both sorting and searching techniques work through clearly presented explanations, pseudocode, diagrams and animations. Students will develop and consolidate their understanding through a range of tasks and activities including the creation of algorithms using Python.
Recommended prior learning:
KS4 Algorithm Design (Sequencing, Selection & Iteration): https://www.tes.com/teaching-resource/gcse-9-1-computer-science-ks4-algorithm-design-12044669
Data Types: https://www.tes.com/teaching-resource/gcse-9-1-computer-science-algorithm-design-data-types-12047021
Arrays: https://www.tes.com/teaching-resource/gcse-9-1-computer-science-algorithm-design-arrays-12044694
Subroutines: https://www.tes.com/teaching-resource/gcse-9-1-computer-science-algorithm-design-subroutines-12047070
KS3 Computer Science: Algorithm Design - Year 8 recaps and builds upon the basic understanding of algorithm design learned within Algorithm design for Year 7 and allows your students to learn the following:
Understand that an algorithm is a set of instructions used to solve a problem.
Use both flowchart and pseudocode to design an algorithm.
To recap the following algorithm design techniques Sequence and Selection.
To understand the following data types:
Character
String
Real
Integer
Boolean
To learn how to use looping to write repeatable sequences of code.
To apply understanding into subroutine challenges.
To understand different types of errors that can occur while writing algorithms (Syntax, Logic and Runtime) and methods used to identify them.
This resource includes a range of clearly presented explanations as well as a range of structured tasks to help your students practice their skills.
It is recommended that students first complete the Algorithm Design - Year 7 and Computational Thinking for KS3 unit of work in order to develop a basic understanding of both computational thinking and algorithms.
This unit of work also includes a final assessment.
Full teacher solutions also included!
This short unit of work introduces year 7 students to the basic concepts of algorithm design. Students will learn the following:
Understand that an algorithm is a set of instructions used to solve a problem.
Use both flowchart and pseudocode to design an algorithm.
Learn the following algorithm design techniques;
Sequence
Selection
Understand Boolean statements such as <, > and = and know when to apply them within an algorithm.
Understand how to use variables to store information for later use within an algorithm.
This resource includes a range of clearly presented explanations as well as a range of structured tasks to help your students practice their skills.
It is recommended that students first complete the Computational Thinking for KS3 unit of work in order to develop a basic understanding of both computational thinking and algorithms.
This unit of work also includes a final assessment.
Full teacher solutions also included!
Within this unit of work, your students will learn to:
Understand different methods of sorting data within an array:
- Bubble sort
- Merge sort
Explain how both methods work.
Identify advantages and disadvantages of using both techniques.
Students will learn about how both sorting methods work through clearly presented explanations, pseudocode, diagrams and animations. Students will develop and consolidate their understanding through a range of tasks and activities including the creation of sorting algorithms using Python.
Although this unit of work has been created following the AQA GCSE 9-1 Computer Science specification, it is applicable to anyone who wants to learn about sorting algorithms.
Recommended prior learning:
KS4 Algorithm Design (Sequencing, Selection & Iteration): https://www.tes.com/teaching-resource/gcse-9-1-computer-science-ks4-algorithm-design-12044669
Data Types: https://www.tes.com/teaching-resource/gcse-9-1-computer-science-algorithm-design-data-types-12047021
Arrays: https://www.tes.com/teaching-resource/gcse-9-1-computer-science-algorithm-design-arrays-12044694
Subroutines: https://www.tes.com/teaching-resource/gcse-9-1-computer-science-algorithm-design-subroutines-12047070
Within this unit of work, your students will learn to:
To understand different methods of searching data within an array:
Linear search
Binary search
Explain how both methods work.
To identify advantages and disadvantages of using both techniques.
Students will learn about how both searching methods work through clearly presented explanations, pseudocode, diagrams and animations. Students will develop and consolidate their understanding through a range of tasks and activities including the creation of searching algorithms using Python.
Although this unit of work has been created following the AQA GCSE 9-1 Computer Science specification, it is applicable to anyone who wants to learn about searching algorithms.
Recommended prior learning:
KS4 Algorithm Design (Sequencing, Selection & Iteration): https://www.tes.com/teaching-resource/gcse-9-1-computer-science-ks4-algorithm-design-12044669
Data Types: https://www.tes.com/teaching-resource/gcse-9-1-computer-science-algorithm-design-data-types-12047021
Arrays: https://www.tes.com/teaching-resource/gcse-9-1-computer-science-algorithm-design-arrays-12044694
Subroutines: https://www.tes.com/teaching-resource/gcse-9-1-computer-science-algorithm-design-subroutines-12047070
Practice makes perfect with this activity pack which includes over 1000 questions split between four different challenge levels, allowing students of all abilities to learn how to convert decimal numbers into binary!
Level 1: Eight activity sheets containing four sets of eight numbers each set within a progressive range.
Level 2: Eight activity sheets containing two sets of sixteen numbers both sets within a progressive range.
Level 3: Eight activity sheets containing thirty two numbers each page within a progressive range.
Level 4: Eight activity sheets containing thirty two random numbers within the range of 0 to 255.
Each pack includes 8 pages of 32 questions, converting the numbers 0 to 255 (a byte). Each challenge pack includes clear explanations on how to make conversions and calculation tables to support the given conversion techniques and make students feel confident in doing it themselves.
Each challenge pack is provided as printable pdf so that students can complete them on paper. All answers are included on both pdf and ppt to allow for both teacher or self assessment.
Ideal to use as starter activities, plenaries or homework!
This resource includes two different packs:
Questions Pack
The questions pack includes a range of practice 9 and 12 mark exam questions which cover topics found within all major GCSE computer science specifications including:
Cyber Security
Mobile Technology
Wireless Networking
Cloud Storage
The Theft of Computer Code
Wearable Technologies & Implants
Privacy and Data Protection
An additional 10 questions are also included and cover the following topics:
Artificial Intelligence
Autonomous Vehicles
Businesses and Services
Environmental Issues
The Digital Divide
What3Words
Facial Recognition Technology
Social Networking
Social Media Addiction
Fake News
Each question includes the following:
Planning activities
Answer structure guidance
Mark scheme
This pack also includes information on how to tackle long answer questions.
Topics Pack
This includes information which covers a wide range of topics associated with the impact and risks of digital technology on society.
Each question within the questions pack is covered with a range of information which includes benefits, and environmental, ethical and legal & privacy concerns.
This bundle includes all 6 Binary Ninja number conversion packs which includes over 6000 questions for your students! Each activity pack includes over 1000 questions split between four different challenge levels, allowing students of all abilities to learn how to convert binary, decimal and hexadecimal numbers!
Each activity pack contains four levels of differentiation:
Level 1: Eight activity sheets containing four sets of eight numbers each set within a progressive range.
Level 2: Eight activity sheets containing two sets of sixteen numbers both sets within a progressive range.
Level 3: Eight activity sheets containing thirty two numbers each page within a progressive range.
Level 4: Eight activity sheets containing thirty two random numbers within the range of 0 to 255.
Each pack includes 8 pages of 32 questions, converting the numbers 0 to 255 (a byte). Each challenge pack includes clear explanations on how to make conversions and calculation tables to support the given conversion techniques and make students feel confident in doing it themselves.
Each pack is provided as printable pdf so that students can complete them on paper. All answers are included on both pdf and ppt to allow for both teacher or self assessment.
Ideal to use as starter activities, plenaries or homework!
Practice makes perfect with this activity pack which includes over 1000 questions split between four different challenge levels, allowing students of all abilities to learn how to convert binary numbers into hexadecimal!
Level 1: Eight activity sheets containing four sets of eight numbers each set within a progressive range.
Level 2: Eight activity sheets containing two sets of sixteen numbers both sets within a progressive range.
Level 3: Eight activity sheets containing thirty two numbers each page within a progressive range.
Level 4: Eight activity sheets containing thirty two random numbers within the range of 0 to 255.
Each pack includes 8 pages of 32 questions, converting the numbers 0 to 255 (a byte). Each challenge pack includes clear explanations on how to make conversions and calculation tables to support the given conversion techniques and make students feel confident in doing it themselves.
Each challenge pack is provided as printable pdf so that students can complete them on paper. All answers are included on both pdf and ppt to allow for both teacher or self assessment.
Ideal to use as starter activities, plenaries or homework!
Computer Science || Data Conversion Poster Set
Unlock the world of data conversion with my exclusive four poster set!
Dive into the realm of data transformation as my visually stunning posters guide you through the process in three simple steps!
Data conversion techniques include:
Binary to decimal
Decimal to binary
Hexadecimal to binary
Binary to hexadecimal
A must have for all GCSE Computer Science teaching rooms!
Computer Science || Command Word Poster Set
Upgrade your classroom wall displays with this fantastic poster set! Use the poster set to review your students grasp of command words specifically used within Computer Science based exam questions.
The following command words are covered:
Tick
Calculate
Explain
Describe
Identify
State
Name
Give
Compare
Complete
Show
Draw
Convert
Simplify
Within sets of three, each question includes an explanation of the question, an example exam question and a model answer (with marking annotation).
Created as hexadecimals, the poster set can be placed as creatively as you are!
Note: Each hexadecimal poster section will need cutting out individually.
Computer Science || Logic Gates & Boolean Expressions Poster Set
Discover the essence of logical brilliance with my Logic Gates and Boolean Expression simplification poster set!
Unveil the secrets of digital circuits as these posters illustrate the functions of fundamental logic gates. From AND and OR to XOR and NOT, navigate through their operations seamlessly.
Elevate your skills further as the set demystifies Boolean expression simplification, empowering you to optimise logical processes effortlessly.
Perfect for students of Computer Science, this poster set is your gateway to mastering the language of binary brilliance!
Purchase my three comprehensive guides to computational thinking in one bargain package!
Includes:
Computational thinking for KS3
Computational thinking for KS4
Problem Solving for KS3
Also includes my popular poster resources to help promote computational thinking within your classroom!
Teach your students how to mail merge using this resource!
This pack contains;
A power point presentation to explain how to conduct a mail merge - this can be used independently by students.
Mail merge address list
A letter with identified fields to merge
An example of how the merge should look
Ideal for supporting ECDL students!
The aim of this lesson is to introduce students to writing their first ever code!
Students will not need to use a computer!
Starter - Which job would you rather do: Formula 1 Driver or a Formula 1 Mechanic?
Introduction to different types of IT users: Formula 1 Driver is the expert user of software while the Mechanic is the creator of the software.
Task 1: Robots and Programmers - Get your Robot to a specific location and back using the given commands.
Main task: Cup stacking - use the symbols available and create the differentiated structures as shown.
For the lesson you will also need:
Plastic cups
Poster paper
Pens to write code
Print out the resource packs for each group of students.
I have used this lesson for students between years 5 and 9, all of which have thoroughly enjoyed it!
***Please leave a review!***
A quick reference poster which I’ve developed to help develop independent learning skills within computer science lessons. The sheet includes key words, programming techniques, data types, flowchart symbols and examples of writing algorithms in both flowcharts and pseudocode.
Suitable for KS3 and KS4, I have included both jpg and PNG versions.
***Please leave a review!
The following resources work in conjunction with KS3 Computer Science: Networks. This knowledge organiser includes all the topics learned within this unit of work into one single page.
The revision sheet helps your students to prepare for the end of unit assessment while also developing independent learning skills!
