Computer Science

Curriculum Mapping Document

Year

Term

Curriculum

Assessment

7

Autumn 1

STRIPE – Image (rotation 1). Creation of images using Fireworks and understanding of image storing as a bitmap using binary.

Portfolio of practical work Unit folder.

Autumn 2

STRIPE – Image (rotation 2). Creation of images using Fireworks and understanding of image storing as a bitmap using binary.

Portfolio of practical work Unit folder.

Spring 1

STRIPE – Image (rotation 3). Creation of images using Fireworks and understanding of image storing as a bitmap using binary.

Portfolio of practical work Unit folder.

Spring 2

STRIPE – Superpowers (rotation 1). Use of spreadsheet and database software.

Portfolio of practical work Unit folder.

Summer 1

STRIPE – Superpowers (rotation 2). Use of spreadsheet and database software.

Portfolio of practical work Unit folder.

Summer 2

STRIPE – Superpowers (rotation 3). Use of spreadsheet and database software.

Portfolio of practical work Unit folder.

8

Autumn 1 Foundations of Computing

Establish the difference between ICT and Computing Basic components of a modern computer Hardware / Software, Input  / Output  Applications software (the purpose of each application) Managing work areas and good practice (USB sticks!) Basic Internet safety Basic Internet searching techniques

Hardware/software summary task Storage units task End of unit in-class test

Autumn 2 Low Level Computing

Development of computers since WWII. Storage units (bits, bytes, kilobytes, etc) Use of binary. Introduction to sorting and searching algorithms.

Algorithm task In class test – binary conversion. End of unit test.

Spring 1 Sequencing instructions

Use of Small BASIC for textual programming The computer as a “non-thinking entity” Definition of key terms (sequence / selection / iteration) Basic selection (IF touching, etc) Basic iteration (FOREVER loop, etc)

Independent creation of Small BASIC program at end of module.

Spring 2 Databases

Creation of a flat file database Fields, records and key fields Queries Basic SQL (SELECT…FROM..WHERE)

Database task completed In class end of unit test.

Summer 1 Spreadsheets

Use of existing spreadsheets for modelling purposes. Introduction to simple formulae and functions.

Spreadsheet task completed In class end of unit test.

Summer 2 Game programming

Use of Mission Maker and/or Scratch to plan and create a game, following instructions to meet a goal/

Independent creation of program at end of module. End of unit test.

9

Autumn 1 Computational thinking

What is an algorithm? Abstraction and decomposition Sorting algorithms (bubble sort and insertion sort) Algorithms for gaming (Os and Xs)

Algorithm explanation task. End of unit test

 

 

Autumn 2 Intro to Python programming

Input, output, variables, sequence, selection and iteration (FOR and WHILE) covered in Python v3.

Assessment of programming challenge and in-class test.

Spring 1 Databases

Recap on flat file databases Introduction to relational databases inc. advantages over flat file) Basic normalisation (design in 3NF) Validation Queries inc. SQL Reports

Completed multi-table database in 3NF for given scenario, built during lessons. End of unit test (students given a partially completed relational database).

Spring 2 The Web

Introduction to HTML Creation of a simple 2 page website using HTML in notepad++ Modification of this site using Dreamweaver CSS Client side and server side scripts / web servers / link to databases (how does Amazon work? etc) The Internet as a WAN (WANs + LANs covered) Extension – introduction to Javascript

Assessment of multi-page website created in lessons 6 and 7 of this module.

Summer 1

Digital literacy

Staying safe online. Digital footprints. Phishing and cyber security. How to stay safe in the modern world.

End of unit test

Summer 2

Python

Programming challenges based n work completed in Autumn 2.

Assessment of programming challenges. End of unit test.

10

Autumn 1 GCSE Computer Science (9-1)

Data representation Binary and Hexadecimal Binary addition Data Compression Programming Procedures Functions

Assessment of mock examination questions focusing on theory covered Assessment of programming content through set tasks.

Autumn 2

The processor (CPU) Features of a processor that affect performance (cores / cache / clock speed) Little Man Computer Op codes and operands Sorting and searching algorithms Bubble sort, Insertion sort and Merge sort Linear search and Binary search Programming Arrays and lists Validation  / handling exceptions

Assessment of mock examination questions focusing on theory covered Assessment of programming content through set tasks.

Spring 1

Algorithms Computational thinking Abstraction Decomposition Pseudocode Flowcharts Programming Identifying errors and debugging Storing data in text files, including using the CSV and Pickle module.

Y10 Mock examination Assessment of mock examination questions focusing on theory covered Assessment of programming content through set tasks.

Spring 2

System security Threats posed to systems Methods of attack (brute force / DDoS / SQL injection / zero day) Securing a network Policies Passwords and levels of access Encryption  Hashing Social engineering Programming SQL to store data in and retrieve data from a database (SQLite). Data dictionaries. Networking.

Assessment of mock examination questions focusing on theory covered Assessment of programming content through set tasks.

Summer 1

Preparation for Non Examined Assessment (NEA). NEA (previously called coursework) is released in September Year 11. In the summer term, students will prepare for and then complete a mock NEA which they will be able to receive feedback on in order to be ready to start in September of Year 11.

Assessment of mock NEA components

Summer 2

Producing robust programs. defensive design considerations (input sanitisation/validation, planning for contingencies, anticipating misuse, authentication). Maintainability (comments, indentation). the purpose of testing. Types of testing: (iterative, final/terminal). How to identify syntax and logic errors. Selecting and using suitable test data (normal, erroneous and borderline.

Assessment of mock examination questions focusing on theory covered Assessment of programming content through set tasks.

11

Autumn 1 NEA

Completion of 20 hours NEA task.

Formal assessment of NEA.

Autumn 2 NEA

Completion of 20 hours NEA task.

Formal assessment of NEA.

Spring 1

Data representation (image/sound/characters).

Computational logic.

Assessment focussing on mock examination questions and past papers for A451 theory examination.

Spring 2

Systems software. Translators and facilities of languages.

Programming pseudocode challenges.

Assessment focussing on mock examination questions and past papers for A451 theory examination.

Summer 1

Ethical, legal and cultural isues.

Revision of all examination topics for J276/01 and J276/02/

Assessment of mock papers and past exam questions. All questions from all existing past  exam papers are split down into units on the VLE.

Summer 2

 

 

12

Autumn 1 A Level Computer Science

Computing principles (01): Structure and function of the processor Types of processor (RISC and CISC, Parallel) Input, output and storage Algorithms and problem solving (02): Python challenges (recap from GCSE) Sorting algorithms (bubble / insertion) Searching algorithms (linear / binary) Implementing algorithms in Python Stacks / queues / lists

Assessment at the end of every unit of work via examination questions (for component 01) and examination questions and programmed solutions (for component 02)

Autumn 2

Computing principles (01): Data types Representation of number (binary, hexadecimal, floating point, negative numbers) Computer legislation Algorithms and problem solving (02): The web Client side – HTML / CSS / Javascript Server side – PHP Use of PHP as a 2nd high level language

Assessment at the end of every unit of work via examination questions (for component 01) and examination questions and programmed solutions (for component 02)

Spring 1

Computing principles (01): Databases Networks Boolean algebra, logic gates and Karnaugh maps Algorithms and problem solving (02): Abstraction Decomposition Procedures and logic

Assessment at the end of every unit of work via examination questions (for component 01) and examination questions and programmed solutions (for component 02)

Spring 2

Computing principles (01): Ethical, moral and cultural issues Arrays, records, tuples and lists. Algorithms and problem solving (02): Assembly language Software development methodologies Testing

Assessment at the end of every unit of work via examination questions (for component 01) and examination questions and programmed solutions (for component 02)

Summer 1

Computing principles (01): Revision and mock examination practice Algorithms and problem solving (02): Revision and mock examination practice

Assessment of mock papers and past exam questions. All questions from all existing past  exam papers are split down into units on the VLE.

Summer 2

Further revision for component 01 and 02 examinations. Commence investigation for Y13 project (20% of A Level grade)

Assessment of mock papers and past exam questions. All questions from all existing past  exam papers are split down into units on the VLE.

13

Autumn 1 A Level Computer Science

Component 03, Computer Science Project. Students investigate and complete a major project, implementing a solution in a high level language (such as Python or PHP).

Assessment of completed project, worth 20% of the final A Level grade.

Autumn 2

Component 03, Computer Science Project. Students investigate and complete a major project, implementing a solution in a high level language (such as Python or PHP).

Assessment of completed project, worth 20% of the final A Level grade.

Spring 1

Recap on associated coverage from Y12, plus additional coverage of these areas : Component 01 Memory management, paging and segmentation Stages of compilation (lexical analysis, syntax analysis, code generation and optimisation) Addressing modes (immediate, direct indirect and indexed) Component 02 Object Orientated programming Quick sort, Dijkstra’s algorithm, A* algorithm. PageRank algorithm

Y13 mock examination, January Assessment at the end of every unit of work via examination questions (for component 01) and examination questions and programmed solutions (for component 02)

Spring 2

Component 01 Normalisation of databases to 3NF Databases – referential integrity transaction processing, record locking. Search engine indexing Component 02 Backtracking, heuristics, pipelining Big O notation to determine efficiency of algorithms

Assessment at the end of every unit of work via examination questions (for component 01) and examination questions and programmed solutions (for component 02)

Summer 1

Component 01 Bitwise manipulation, masks and shifts. Graphs, trees and hash tables Deriving Boolean statements using De Morgan’s Law and other laws. Logic associated with D type flop-flops, half and full adders. Component 02 Algorithm and problem solving practice using Python Plus revision for the June examinations

Assessment at the end of every unit of work via examination questions (for component 01) and examination questions and programmed solutions (for component 02)

Summer 2