GCSE Computer Science for OCR Overview Scheme of Work

Similar documents
OCR J276 (9-1) GCSE Computer Science

Autumn 1 Autumn 2 Spring 1 Spring 2 Summer 1 Summer 2. networks. environmental concerns. Knowledge and skills covered: Knowledge and skills covered:

HASTINGS HIGH SCHOOL

OCR GCSE (9-1) Computer Science J276 Accompanying Instructional Document

Computing 1: Computer Systems

Switching to AQA from OCR

Year 10 OCR GCSE Computer Science (9-1)

AQA GCSE Computer Science PLC

Switching to AQA from Edexcel

Learning objectives. Computer principles The characteristics of contemporary processors, input, output and storage devices

Edexcel GCSE in Computer Science Microsoft IT Academy Mapping

2c. Content of Computer systems (Component 01)

OCR J276 GCSE Computer Science

COMPUTING SUBJECT KNOWLEDGE AUDIT

COURSE OUTLINE COMPUTER SCIENCE GENERAL YEAR 12: 2019 UNIT 3 AND UNIT 4

OCR GCSE Computing Learning Grids H/W

SAMPLE COURSE OUTLINE COMPUTER SCIENCE GENERAL YEAR 12

Systems Architecture. Systems Architecture. Memory. Memory. Memory. Memory. The Purpose and Function. The Purpose and Function

ICT & Computing Progress Grid

OCR Level 3 Advanced GCE in Computer Science (H446)

SAMPLE CURRICULUM GUIDE June 2014

OCR J276 GCSE Computer Science

GCSE Computer Science Component 02

GCSE Computer Science Revision and Workbook

Department Curriculum and Assessment Outline

IB Computer Science Topic.2-

COMPUTER SYSTEM. COMPUTER SYSTEM IB DP Computer science Standard Level ICS3U. COMPUTER SYSTEM IB DP Computer science Standard Level ICS3U

CSC 170 Fall 2017 Dr. R. M. Siegfried. Study Guide for Final Exam

Syllabus for Computer Science General Part I

elc International School

Unit 2: Technology Systems

OCR J276 GCSE Computer Science

ST. MARY S COLLEGE FORM 4

Southam College Computing & ICT Department. Summer Project

«Computer Science» Requirements for applicants by Innopolis University

OHIO ASSESSMENTS FOR EDUCATORS (OAE) FIELD 010: COMPUTER INFORMATION SCIENCE

Computing at Cox Green Curriculum Plan. Key Stage 3 Year 7

GCSE Computing. Revision Pack TWO. Data Representation Questions. Name: /113. Attempt One % Attempt Two % Attempt Three %

N.B. These pastpapers may rely on the knowledge gained from the previous chapters.

Computing Science: National 5 and Higher skills, knowledge and understanding

GCSE Subject Level Conditions and Requirements for Computer Science May 2015

DUMBARTON ACADEMY NATIONAL 5 COMPUTING SCIENCE REVISION

Angel International School - Manipay 2 nd Term Examination March, 2016 Computing

UNIT 1 USING LOGIC. UPGRADE 8 Write a detailed report on how logic gates would be used to add up two nibbles using examples and explanations

N5 Computing Science - Solutions

COMPUTER SCIENCE UNIT 1: Understanding Computer Science

Cambridge International Examinations Cambridge International General Certificate of Secondary Education

2nd Paragraph should make a point (could be an advantage or disadvantage) and explain the point fully giving an example where necessary.

Topics. Hardware and Software. Introduction. Main Memory. The CPU 9/21/2014. Introduction to Computers and Programming

Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level

understand the need for input and output devices describe suitable output devices for a wide range of computer controlled situations

Information Science 1

Computer Science General Course Year 12. Selected Unit 3 syllabus content for the. Externally set task 2019

Explain why data is represented in computer systems in binary form

Year 12 Computer Science Learning Cycle 2 Overview

Computer Science Curriculum Content, KS5

Electricity: Voltage. Gate: A signal enters the gate at a certain voltage. The gate performs operations on it, and sends it out was a new signal.

Dawood Public School Course Outline Computer Science

The CPU and Memory. How does a computer work? How does a computer interact with data? How are instructions performed? Recall schematic diagram:

Spellings and Abbreviations

Resources to support the National 5 Computing Science course

User. Application program. Interfaces. Operating system. Hardware

Autumn 1 Autumn 2. An Introduction to Idsall s Network & esafety. Programming with Scratch. Spring 1 Spring 2

Dawood Public School Course Outline Computer Science Class XI

Dec Hex Bin ORG ; ZERO. Introduction To Computing

GUIDANCE FOR TEACHING

This paper consists of 27 pages and the instructions for the completion of a mark-reading sheet.

Higher Grade Computing Homework Answers Units 1 & 2

AQA GCSE (9-1) Computer Science. S Robson and PM Heathcote

COURSE OUTLINE APPLIED INFORMATION TECHNOLOGY GENERAL YEAR 12: 2018 UNIT 3 AND UNIT 4

N5 Computing Science - Revision

National 5 Computing Science Software Design & Development

HARDWARE. There are a number of factors that effect the speed of the processor. Explain how these factors affect the speed of the computer s CPU.

8. A is approximately one billion bytes a. Kilobyte b. Bit c. Gigabyte d. Megabyte 9. SMPT, FTP and DNS are applications of the layer a. Data link b.

Stonelaw High School. Computing Science. BGE - Computer Systems

Computer Organization

S.1 ICT Distribute students eclass user accounts and school login accounts.

Computer Science. Pre-Exam. Revision

INTRODUCTION TO COMPUTERS

This document contains additional questions; it is not intended to be treated as a complete paper.

ARIZONA CTE CAREER PREPARATION STANDARDS & MEASUREMENT CRITERIA SOFTWARE DEVELOPMENT,

Solve only 2 out of 3 questions

Introduction. Arizona State University 1

Dawood Public School Course Outline Computer Science Class XI

Bits and Bit Patterns

WYSE Academic Challenge Computer Fundamentals Test (State Finals)

Introduction to Computers. Joslyn A. Smith

OCR A Level GCE Computer Science

Cambridge International Examinations Cambridge Ordinary Level

CC411: Introduction To Microprocessors

C H A P T E R 1. Introduction to Computers and Programming

Hardware and Software - Revision Summary

KS3 Computing - Life Without Levels

COSC 122 Computer Fluency. Computer Organization. Dr. Ramon Lawrence University of British Columbia Okanagan

Stewards Pooi Kei College Secondary 4 Information and Communication Technology Teaching Schedule ( )

CS 101, Mock Computer Architecture

GIRLS SECONDARY, L-IMRIEĦEL HALF YEARLY EXAMINATIONS 2015/2016

GCSE (9-1) Computer Science Teacher's Workbook 4th Edition James Franklin

CMPUT 101 with Solutions Quiz 2 (50 minutes) November 16, 2000

Transcription:

GCSE Computer Science for OCR Overview Scheme of Work The following assumes a two-year model. During the course, the final challenges can be used for practice in computational thinking, algorithm design and coding as well as maintaining a practical element during the study of the more theoretical aspects of the course. They can also be used for introducing the requirements of the Programming Project (J276/03/04): analysis, design, development, testing, evaluations and conclusions, and the use of appropriate programming. They can also be used to stress the items listed in the specification section 2.3 Producing robust programs: defensive design considerations: o input sanitisation/validation o planning for contingencies o anticipating misuse o authentication maintainability: o comments o indentation the purpose of testing types of testing: o iterative o final/terminal how to identify syntax and logic errors selecting and using suitable test data. In the following overview, suitable final challenges are suggested to accompany the content.

Number of Learning outcomes 1 Algorithms 7 Explain what an algorithm is and create algorithms to solve specific problems. Use sequence, selection and iteration in algorithms. Use input, processing and output in algorithms. Express algorithms using flow charts and pseudocode. Analyse, assess and compare different algorithms. Create, name and use suitable variables. 2.1 Algorithms Algorithmic thinking the use of the three basic programming constructs used to control the flow of a program: sequence, selection and iteration the use of variables, constants, operators, inputs, outputs and assignments 2.1 Algorithms how to produce algorithms using pseudocode and flow diagrams 2.1 Algorithms interpret, correct or complete algorithms the use of variables, constants, operators, inputs, outputs and assignments

1 Algorithms (continued) Use arithmetic, relational and Boolean operators. the common arithmetic operators; the common Boolean operators Final challenge: Cambridge Elevate resources Use conditional statements. 2.4 Computational logic Create an algorithm to help a taxi company calculate its fares. 10 interactive activities 6 worksheets 2 animations apply computing related mathematics: +, -, /, *, exponentiation, MOD, DIV the use of the three basic programming constructs used to control the flow of a program: selection

Number of Learning outcomes 2 Iteration 6 Explain what is meant by iteration. Explain the difference between definite and indefinite iteration. Use for loops. Final challenge: Use while loops. Use do until loops. Use nested loops. Analyse algorithms using trace tables. Use iteration when designing algorithms. Write an algorithm for a computer game. the use of the three basic programming constructs used to control the flow of a program: iteration (count and condition controlled loops) 2.1 Algorithms interpret, correct or complete algorithms the use of the three basic programming constructs used to control the flow of a program: iteration (count and condition controlled loops) Cambridge Elevate resources 5 interactive activities 5 worksheets

Number of Learning outcomes 3 Boolean logic 2 Create truth tables for Boolean operators Draw AND, OR and NOT logic gates Combine logic gates into logic circuits Create truth tables for logic circuits. 2.4 Computational logic simple logic diagrams using the operations AND, OR and NOT truth tables 2.4 Computational logic simple logic diagrams using the operations AND, OR and NOT 2.4 Computational logic simple logic diagrams using the operations AND, OR and NOT truth tables 2.4 Computational logic applying logical operators in appropriate truth tables to solve problems Final challenge: Cambridge Elevate resources Design logic circuits to solve a control problem. 3 interactive activities 4 worksheets 1 animation combining Boolean operators using AND, OR and NOT to two levels

4 Data types and structures Final challenge: Cambridge Elevate resources Number of Learning outcomes 3 Explain what is meant by data type and list some common types Use the correct data types in algorithms Carry out various manipulations such as finding the length of and slicing and concatenating string data types Create and work with simple array data structures Create and work with two dimensional arrays. Describe other data structures Encode and decode messages with an encryption key. 5 interactive activities 4 worksheets 1 animation the use of data types: integer, real, Boolean, character and string casting the use of basic string manipulation the use of arrays (or equivalent) when solving problems, including both one and two dimensional arrays the use of records to store data the use of SQL to search for data

5 Searching and sorting algorithms Final challenge: Cambridge Elevate resources Number of Learning outcomes 4 Explain why sorted lists are of more value than unsorted lists Describe the bubble sort, selection sort and merge sort algorithms Use these algorithms to sort lists into ascending and descending order Describe the linear and binary search algorithms Use these algorithms to search sorted and unsorted lists Write code for the implementation of these algorithms. Write an algorithm to find the top ten. 4 interactive activities 5 worksheets 4 animations 2.1 Algorithms standard sorting algorithms: bubble sort, merge sort, insertion sort 2.1 Algorithms standard searching algorithms: binary search and linear search All mentioned above including one and two dimensional arrays

6 Input and output Number of Learning outcomes 3 Explain why user input is needed. Describe ways in which data input can be validated. 2.3 Producing robust programs defensive design considerations: input sanitisation/validation planning for contingencies anticipating misuse authentication Format output. 2.6 Data representation The purpose of testing The types of testing Check digits Work with text files. the use of basic file handling operations: open, read, write, close Final challenge: Cambridge Elevate resources Write a program to create and manage logins. 4 interactive activities 4 worksheets 2 animations

Number of Learning outcomes 7 Problem solving 4 Explain what is meant by computational thinking Explain what is meant by decomposition and abstraction and use them to solve problems Create algorithms to solve problems that you have analysed Explain what is meant by topdown and bottom-up problem solving Create structured programs using procedures 2.1 Algorithms computational thinking: abstraction decomposition 2.3 Producing robust programs All sections previously mentioned 2.1 Algorithms computational thinking: abstraction decomposition how to use sub programs (functions and procedures) to produce structured code

7 Problem solving (continued) Follow the systems development cycle to analyse problems, design and implement solutions and test the outcomes. 2.3 Producing robust programs maintainability: comments and indentation types of testing: iterative and final/terminal how to identify syntax and logic errors selecting and using suitable test data. Final challenge Write a program for ordering a pizza online. 2.5 Translators and facilities of languages common tools and facilities available in an integrated development environment (IDE): editors, error diagnostics, run-time environment, translators Cambridge Elevate resources 3 interactive activities 5 worksheets 3 animations

8 Binary and hexadecimal Number of Learning outcomes 5 Explain how data is represented by computer systems. Explain why the binary system is essential for computer processing. Convert binary numbers into denary and vice versa. Carry out addition, subtraction, multiplication and division on binary numbers. Use left and right shifts when multiplying or dividing binary numbers by powers of 2. 2.4 Computational logic why data is represented in computer systems in binary form 2.6 Data representation Units bit, nibble, byte, kilobyte, megabyte, gigabyte, terabyte, petabyte how data needs to be converted into a binary format to be processed by a computer. 2.6 Data representation how to convert positive denary whole numbers (0-255) into 8 bit binary numbers and vice versa 2.6 Data representation how to add two 8 bit binary integers and explain overflow errors which may occur 2.6 Data representation binary shifts

8 Binary and hexadecimal (continued) Final challenge Cambridge Elevate resources Explain why hexadecimal numbers are used. Convert between binary, denary and hexadecimal. Write a program that will convert between different number formats. 4 interactive activities 5 worksheets 1 animation 2.6 Data representation how to convert positive denary whole numbers (0-255) into 2 digit hexadecimal numbers and vice versa how to convert from binary to hexadecimal equivalents and vice versa

9 Binary representations Number of Learning outcomes 4 Explain how characters are represented in binary. Calculate the ASCII code for any character. Calculate the size of a text file. Explain how images are represented in binary. Calculate the size of an image file. 2.6 Data representation Characters the use of binary codes to represent characters the term character-set the relationship between the number of bits per character in a character set and the number of characters which can be represented (for example ASCII, extended ASCII and Unicode) 2.6 Data representation Images how an image is represented as a series of pixels represented in binary metadata included in the file the effect of colour depth and resolution on the size of an image file

9 Binary representations (continued) Final challenge Cambridge Elevate resources Explain how sound is represented in binary. Calculate the size of an audio file. 2.6 Data representation Sound how sound can be sampled and stored in digital form how sampling intervals and other factors affect the size of a sound file and the quality of its playback: sample size bit rate sampling frequency 2.6 Data representation Compression need for compression types of compression: lossy and lossless Explain the disadvantages of large image and audio files. Explain how file compression reduces the size of files. Explain the differences between lossless and lossy file compression. Create a program to compress and decompress image files for a social media site. 4 interactive activities 4 worksheets

10 Programming languages Final challenge Cambridge Elevate resources Number of Learning outcomes 2 Describe the difference between low and high level languages. Explain the advantages of using high level languages. Explain how program instructions are encoded in low level languages Explain why high level languages need to be translated Explain the characteristics and use of an assembler a compiler an interpreter. Write programs using a low level language. 1 interactive activity 3 worksheets 1 animation 2.5 Translators and facilities of languages 2.5 Translators and facilities of languages 2.5 Translators and facilities of languages Characteristics and purpose of different levels of programming language, including lowlevel languages the purpose of translators the characteristics of an assembler, a compiler and an interpreter

11 Computer systems: hardware Number of Learning outcomes 4 Explain what is meant by a computer system. Explain what is meant by an embedded system. Describe the structure of the central processing unit and the functions of its components. 1.2 Memory the difference between RAM and ROM the purpose of ROM in a computer system the purpose of RAM in a computer system the need for virtual memory flash memory. 1.1 Systems architecture 1.1 Systems architecture embedded systems: purpose of embedded systems examples of embedded systems the purpose of the CPU Von Neumann architecture: MAR (Memory Address Register) MDR (Memory Data Register) Program Counter Accumulator common CPU components and their function: ALU (Arithmetic Logic Unit) CU (Control Unit) Cache

11 Computer systems: hardware (continued) Describe the fetch-decodeexecute cycle. 1.1 Systems architecture the function of the CPU as fetch and execute instructions stored in memory Final challenge Cambridge Elevate resources Create a learning resource. 4 interactive activities 5 worksheets 2 animations Explain the need for and role of multiple cores and cache and virtual memory. Describe secondary storage media and the advantages and disadvantages of each. 1.1 Systems architecture how common characteristics of CPUs affect their performance: clock speed cache size number of cores 1.3 Storage the need for secondary storage data capacity and calculation of data capacity requirements common types of storage: optical, magnetic, solid state suitable storage devices and storage media for a given application, and the advantages and disadvantages of these, using characteristics: capacity, speed, portability, durability, reliability, cost

12 Computer systems: systems software Final challenge Cambridge Elevate resources Number of Learning outcomes 1 Explain what is meant by systems software. Explain what is meant by an operating system. Describe the functions of the operating system. Explain what is meant by utility systems software. List some examples of utility systems software and their functions. Create a program to clean up a hard disk drive. 2 interactive activities 3 worksheets 1.7 Systems software the purpose and functionality of systems software operating systems: user interface memory management/ multitasking peripheral management and drivers user management file management 1.7 Systems software utility system software: encryption software defragmentation data compression the role and methods of backup: full incremental

Number of Learning outcomes 13 Networks 5 Explain what is meant by a computer network and list the different types of networks. Describe the differences between client server and peer-to-peer networks. Explain the functions of the hardware needed to connect computers. Explain how computers communicate using cable and microwave. 1.4 Wired and wireless networks 1.4 Wired and wireless networks 1.4 Wired and wireless networks 1.4 Wired and wireless networks types of networks: LAN (Local Area Network) WAN (Wide Area Network) the different roles of computers in a clientserver and a peer-to-peer network the hardware needed to connect stand-alone computers into a Local Area Network: wireless access points routers/switches NIC (Network Interface Controller/Card) transmission media factors that affect the performance of networks Describe network topologies. 1.5 Network topologies, protocols and layers 1.5 Network topologies, protocols and layers Wifi: frequency and channels ethernet star and mesh network topologies

13 Networks (continued) Final challenge Explain how users connect to and use the internet. Explain how data is transmitted across networks. Explain the use of protocols. Explain how virtual networks can be set up. Act as a consultant. 1.4 Wired and wireless networks 1.5 Network topologies, protocols and layers 1.5 Network topologies, protocols and layers 1.4 Wired and wireless networks the internet as a worldwide collection of computer networks: DNS (Domain Name Server); hosting; the cloud packet switching the uses of IP addressing, MAC addressing, and protocols including: TCP/IP (Transmission Control Protocol/Internet Protocol); HTTP (Hyper Text Transfer Protocol); HTTPS (Hyper Text Transfer Protocol Secure); FTP (File Transfer Protocol); POP (Post Office Protocol); IMAP (Internet Message Access Protocol); SMTP (Simple Mail Transfer Protocol) the concept of layers the concept of virtual networks Cambridge Elevate resources 5 interactive activities 5 worksheets

Number of Learning outcomes 14 System security 3 Describe the different strategies that criminals use to attack computer networks 1.6 System security threats posed to networks: malware, phishing Final challenge Explain how people are the greatest security risks to networks Describe the threats posed to networks Explain how these threats can be identified, prevented and combatted Explain the role of network policies. Design and code an information point. 1.6 System security people as the weak point in secure systems (social engineering) 1.6 System security brute force attacks denial of service attacks data interception and theft the concept of SQL injection poor network policy 1.6 System security Identifying and preventing vulnerabilities: penetration testing; network forensics; antimalware software; firewalls; user access levels; passwords; encryption 1.6 System security network policies

Cambridge Elevate resources 3 interactive activities 4 worksheets Chapter Number of Learning outcomes 15 Ethical, legal, 4 Investigate and discuss cultural and the following issues in environmental relation to the concerns development and impact of computer science technologies: environmental ethical legal cultural Discuss issues of data collection and privacy Final challenge Describe the legislation relevant to computer science. Design and code an online test. 1.8 Ethical, legal, cultural and environmental concerns 1.8 Ethical, legal, cultural and environmental concerns 1.8 Ethical, legal, cultural and environmental concerns how to investigate and discuss Computer Science technologies while considering: ethical issues; legal issues; cultural issues; environmental issues how key stakeholders are affected by technologies environmental impact of Computer Science cultural implications of Computer Science privacy issues legislation relevant to Computer Science: The Data Protection Act 1998; Computer Misuse Act 1990; Copyright Designs and Patents Act 1988; Creative Commons Licensing; Freedom of Information Act 2000; open source vs proprietary software

Cambridge Elevate resources 2 interactive activities 4 worksheets