51ºÚÁÏ

This pack consists of 34 editable homework/classwork activities that can be used to support your delivery of the course. In addition, the homework bundle also contains a suggested mark scheme for each activity. Unit 3.1 · Decomposition and Abstraction · Flowcharts and High-Level Languages · Sorting Data · Sorting & Searching Programs Unit 3.2 · Selection · Iteration · Arrays (Lists) · Functions · Improving Programs · Testing Unit 3.3 · Data Capacity · Conversions · Compression Unit 3.4 · Components of a CPU · CPU Performance · Embedded Systems · Operating Systems · Utility Software · Boolean Logic and Truth Tables · Logic Gates · Programming Languages Unit 3.5 · LANs and WANs · Wired & Wireless Networks · Star & Bus Topology · Network Protocols · The Concept of Layers Unit 3.6 · Malware · Cyber Threats · Network Vulnerabilities Unit 3.7 · Relational Databases · Relational Databases and SQL Unit 3.8 · The Impact of Technology · The Digital Divide · Impact of New Technology

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 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. Unit 3.1 – 1 Test Unit 3.2 – 2 Tests Unit 3.3 – 1 Test Unit 3.4 – 4 Tests Unit 3.5 - 2 Test Unit 3.6 – 1 Test Unit 3.7 – 1 Test Unit 3.8 – 1 Test

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

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.

This is an 18 page introduction to programming using Python. It includes: Python -The Basics The use of variables, constants, operators, inputs, outputs and assignments The use of data types The use of basic string manipulation Each section includes activities for the students to complete. I would greatly appreciate feedback on what you think of this resource.

These adaptable PowerPoint Presentations (42 Slides) cover all aspects of the specification in relation to OCR GCSE Computer Science J277 (from 2020) component 2.4. It includes: Teaching PowerPoint Presentations (includes checkpoint questions and answers) Student PowerPoint Presentations (Includes checkpoint questions, but omits the answers) Content Covered: Simple logic diagrams using the operators AND, OR and NOT Truth tables Combining Boolean operators using AND, OR and NOT Applying logical operators in truth tables to solve problems

These adaptable PowerPoint Presentations (86 Slides) cover all aspects of the specification in relation to OCR GCSE Computer Science J277 (from 2020) component 2.1. It includes: Teaching PowerPoints (includes checkpoint questions and answers) Student PowerPoints (Includes checkpoint questions, but omits the answers) Content Covered: Principles of computational thinking: Abstraction Decomposition Algorithmic thinking Identify the inputs, processes, and outputs for a problem Structure diagrams Create, interpret, correct, complete, and refine algorithms using: Pseudocode Flowcharts Reference language/high-level programming language Identify common errors Trace tables Standard searching algorithms: Binary search Linear search Standard sorting algorithms: Bubble sort Merge sort Insertion sort

Two great programming games for your students to create. Each game provides education and entertainment for a one hour lesson, with a number of challenges to stretch pupils knowledge and understanding of programming concepts. Halloween Part 1 This game includes the creation of spooky ghosts that need to be caught. Each time you catch a ghost you get points. Halloween Part 2 This game includes a flying witch who is really hungry and gets points each time she eats a flying bat. The witch must also try to avoid the thunder and lightening as each time she is hit she loses points. Students can open an online Scratch template to get them started on their adventure.

Parts 1 -3 of this guide to programming using Python go through many of the programing techniques required to produce simple programs. Part 4 seeks to provide an opportunity to put these ideas into practice. The first section provides instructions on creating a simple board game and the second section demonstrates how Python can be used to create a simple database that can then be searched.

This is a 17 page introduction to programming using Python. It includes: The use of Lists (arrays), including one and two dimensional arrays File handing operations (open, read, write and close) Each section includes activities for the students to complete. I would greatly appreciate feedback on what you think of this resource.

This is a 15 page continuation from Part 1 of programming using Python. It includes: The use of sequences and selection (including Boolean and comparison operators) The use of iteration (count and condition controlled loops) Each section includes activities for the students to complete. I would greatly appreciate feedback on what you think of this resource.

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. Python is used as the programming language.

This sample project is designed to provide a stimulating, engaging and effective way of preparing students for the Programming Project Component of the 9-1 GCSE in computer science. Students use Python to create a Quiz Board Game. Including: Sample project scenario Sample student solution Sample Python code

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.

This lesson introduces string manipulation and explains how it is used in Python. It includes changing the case of a text string to upper case or lower case; finding the length of a string and how to use formatting to output a table of data. Python and the Python Logo are trademarks or registered trade marks of the Python Software Foundation.