The following resources work in conjunction with KS3 Computer Science: Data Representation - Year 7. 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!

The following resources work in conjunction with Computational Thinking for KS3 and KS3 Computer Science: Algorithm Design - Year 7. 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!

The following resources work in conjunction with KS3 Computer Science: Computer Systems Year 7. 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!

Within KS3 Computer Science: Data Representation - Year 8, your students will recall and build upon understanding developed within Data Representation for Year 7 and learn the following: To recall binary and denary conversion techniques from year 7. To be able to add two binary numbers using binary addition and understand the term overflow error. Understand the use and purpose of ASCII and Unicode character sets. Understand how images are stored on a computer. Understand the relationship between resolution, colour depth and file size. Recap the terms ‘Base 2’ and ‘Base 10’ number systems. To apply understanding to the use of Hexadecimal (base 16). Your students will learn these concepts through a range of clearly presented explanations and a range of tasks and challenges to consolidate learning. This unit of work also includes a final assessment. Full teacher solutions also included! Before completing this unit of work, it is recommended that your students complete Data Representation for Year 7 and Computer Systems for Year 8 so they have an understanding of the different hardware components of a computer.

"There are 10 kinds of people in the world; those who understand binary numbers… and those who don’t!" Alongside understanding the joke above(!), KS3 Computer Science: Data Representation - Year 7 will teach your students the following: Explain why a computer uses binary. To be able to identify the number of bits in different units of data e.g. Bit, Nibble, Byte, Kilobyte, Megabyte, Gigabyte, etc. To explain the difference between ‘base 2’ and ‘base 10’ numbering systems. To be able to convert binary into denary and vice versa. Explain how characters are stored in the ASCII character set. Your students will learn this information through a variety of clearly presented instructions as well as a range of tasks and activities designed to consolidate learning. This unit of work also includes a final assessment. Full teacher solutions also included! Before completing this unit of work, it is recommended that your students complete Computer systems for year 7 so they have an understanding of the different hardware components of a computer.

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: 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

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

Download my poster which includes example task ideas on how to apply computational thinking problem solving skills to English! The poster includes a range of tasks and classroom ideas that use key computational thinking skills! *Computational Thinking is a skill set that can be used across the curriculum, not just within computer science! The logical approach to solving a problem means that it’s application can be used to develop and improve students ability to deal with difficult problems in a more rational way. The aim of my posters is to make you realise that many of the brilliant tasks that teachers facilitate week in, week out actually include computational thinking. It’s just a matter of making it more explicit!

Rob-Bot! is a fun and exciting card game that also helps develop your Computational Thinking skills! Rob-Bot! consists of a pack of 57 playing cards, each of which contains 8 different characters or objects (there are 57 characters and objects to find in total). Each card contains one character or object which matches to one in every other card in the pack. Normal game (2-4 players) Deal out all the cards. The player to the left of the dealer starts by placing down their card The other player(s) must identify a character or object that is both on the card that has been placed down and their own card. Once identified, the player must state which character or object is the same and place down the card. The player who gets rid of cards the first wins. How does Rob-Bot! develop Computational Thinking skills? Decomposition: Identifying specific characters and objects on the cards. Pattern Recognition: Searching for and finding the same character or object on your card and the card in play. Abstraction: Dismissing and filtering out characters and objects on your card that don’t match those on the card in play. Algorithm Design: Develop and refine the technique of searching for and identifying the matching characters and objects. Use Rob-Bot! to develop keywords in the following topic areas: Computational thinking Computer systems Networks Algorithm design Embedded systems Logic gates Malware This resource includes a PDF which includes all the cards and instructions on how to print. Suitable for ages 6+

Revision clocks are a great way for students to develop retrieval practice in preperation for exam season! My students loved it and really engaged with it! This resource contains two revision clocks for both paper 1 and paper 2 topics for the AQA GCSE Computer Science specification as well as instructions to support their use. Note: it is recommended that the posters are printed out on A3 paper for best effect.

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 lesson gives students a clear understanding of the required data types which are expected to be known for GCSE 9-1 computer science. Within this unit of work, students will learn: To understand the different types of data used within algorithms e.g. Integer Real Boolean Character String To understand how variables are used to store data. To understand how to analyse and edit string: measuring the length of a string, string indexing and changing case. A range of activities and challenges are included to allow students to consolidate their learning. Solutions are also included. Use this lesson alongside my KS4 algorithms work to give students a comprehensive understanding of how data types are used within algorithms!

A simple poster to help explain the four concepts of Computational Thinking: Decomposition, Pattern Recognition, Abstraction and Algorithm Design! Computational Thinking is a skill set that can be used across the curriculum, not just within computer science! The logical approach to solving a problem means that it’s application can be used to develop and improve students ability to deal with difficult problems in a more rational way. The aim of my posters is to make you realise that many of the brilliant tasks that teachers facilitate week in, week out actually include computational thinking. It’s just a matter of making it more explicit!

Learn how to record information onto trace tables with this great resource! Within this unit of work students will learn: What a trace table is and how they are used. How a trace table is used to record changes using the following algorithm techniques; * Sequence * Selection * WHILE loop * FOR loop * REPEAT loop * Arrays There are a range of different trace table activities to complete, with solutions also included! **It is recommended that students complete the following units prior to attempting this unit of work: GCSE 9-1 Computer Science: KS4 Algorithm Design GCSE 9-1 Computer Science: Arrays**

**What is an array? How are they used within algorithms?! ** Within this short unit of work (2-3 lessons) students will learn: what an array is and how they are used. to create, edit, input and output information to and from an array. to use both one and two dimensional arrays As well as activities and tasks within the lessons, final differentiated (Rookie, Pro and Beast level) challenges have been included to consolidate learning. All required resources are included within the PowerPoint. There are some items that require printing within the resource section at the end. It is recommended that this resources is used after completing GCSE 9-1 Computer Science: KS4 Algorithm Design

Introduce your students to key algorithm design techniques with this resource! Within this unit of work your students will: Learn how to write algorithms using both symbols (flowchart) and written notation (pseudocode). Learn how to write algorithms using structured techniques including: * Sequencing * Selection * Iteration (looping) Gain understanding of the need for accuracy when writing algorithms. Practice debugging your code. This resource includes explanations of each algorithm design technique as well as clear structured examples of how to write them using both flowchart and pseudocode. After each technique has been explained, students have the opportunity to apply their understanding within an activity which includes higher ability expectations. A final Rookie, Pro and Beast algorithm design challenge has also been included as well as suggested solutions for each activity.