KS4 Computer Science

Module 1 - Systems Architecture

Core declarative knowledge: What should students know?

  • What is the purpose of the CPU?
  • What actions occur at each stage of the fetch-decode=execute cycle.
  • The role of each component of the CPU.
  • The purpose of each register and what it stores.
  • How the common characteristics such as clock speed, cache and number of cores affect the performance of a CPU.
  • Purpose and examples of embedded systems.

Core procedural knowledge: What should students be able to do?

  • Puils need to be able to:

    • Draw a diagram which represents the Von Neuman Architecture which shows how the CPU works and communicates with the memory to execute instructions.

Links to prior learning (to be made explicit and tested)

  • Systems Architecture – Year 7 / Module 5
Module 2 - Memory & Storage

Core declarative knowledge: What should students know?

  • Why there is a need for primary storage
  • The difference between RAM and ROM
  • The purpose of ROM in a computer system
  • The purpose of RAM in a computer system
  • How virtual memory works
  • The use of secondary storage
  • Describe common types of storage
  • Explain the characteristics of different types of storage
  • How data such as numbers, characters, sound and images are stored in a computer
  • How character sets are logically ordered.
  • The two different types of compression.
  • Advantages and disadvantages of compressing files.

Core procedural knowledge: What should students be able to do?

  • Pupils need to be able to:

    • List different types of secondary storage
    • Identify suitable secondary storage needed for given scenarios
    • Know the characteristics of secondary storage such as capacity, cost, speed, portabilty, reliability and durability.
    • Calculate required storage capacity for a given set of files.
    • Calculate the file sizes of sound, image and text files:
    • Sound file size = sample rate x duration (s) x bit depth
    • Image file size = colour depth x image height (px) x image
      width (px)
    • Text file size = bits per character x number of characters
    • Convert denary values to binary digits
    • Convert denary values to hexadecimal values and vice versa
    • Convert binary digits to denary
    • Convert binary digits to hexadecimal and vice versa
    • Calculate the resolution of an image

Links to prior learning (to be made explicit and tested)

  • Data Representation – Year 7 / Module 4 and Year 9 / Module 5
Module 3 - Algorithms

Core declarative knowledge: What should students know?

  • The principles of computational thinking (abstraction, decomposition and algorithmic thinking)
  • Identify the inputs, processes, and outputs for a problem
  • Understand the main steps of searching and sorting algorithms are (Binary & Linear search and Bubble, Merge & Insertion sort)

Core procedural knowledge: What should students be able to do?

  • Use and create structure diagrams
  • Create, interpret, correct, complete, and refine algorithms using:
    Flowcharts,
    Reference language/high-level programming language (Python)
  • Identify common errors
  • Trace tables
  • Identify syntax/logic errors in code and suggest fixes
  • Apply Binary and Linar search to a set of data
  • Apply Bubble sort, Merge sort and Insertion sort on a set of data
  • Identify the algorith used for each algorithm

Links to prior learning (to be made explicit and tested)

  • Intro to Python – Year 8 / Module 1
Module 4 - Computer Networks, Connections & Protocols

Core declarative knowledge: What should students know?

  • Identify different types of network, such as LAN and WAN.
  • Explain factors thata ffect performance of networks
  • Describe the different roles of computers in a client-server and a peer-to-peer network
  • Know 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
  • Know the Internet as a worldwide collection of computer networks and define:

    • DNS (Domain Name Server)
    • Hosting
    • The Cloud
    • Web servers and clients
  • Know how networks can be connected in different ways such as a Star network ot Mesh network.
  • Know the modes of connection ie wired and wireless.
  • How encryption works.
  • The steps of IP and MAC addressing.
  • All the common protocols:

    • TCP/IP (Transmission control 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)

Core procedural knowledge: What should students know?

  • Pupils need to be able to:

    • Draw the different ways a network can be connected: As a Star network topology and a Mesh networ topology.

Links to prior learning (to be made explicit and tested)

  • Intro to websites – Year 8 / Module 4
Module 5 - Network Security

Core declarative knowledge: What should students know?

  • The diffrent Forms of attack on a network such as:

    • Malware
    • Social engineering, e.g. phishing, people as the ‘weak point’
    • Brute-force attacks
    • Denial of service attacks
  • Data interception and theft
  • The concept of SQL injection
  • The Common prevention methods such as:

    • Penetration testing
    • Anti-malware software
    • Firewalls
    • User access levels
    • Passwords
    • Encryption
    • Physical security

Links to prior learning (to be made explicit and tested)

  • Systems Security – Year 9 / Module 3
Module 6 - Boolean Logic

Core declarative knowledge: What should students know?

  • Know how truth tables work for each logic gate
  • Recognise each gate symbol
  • Understand how to create, complete or edit logic diagrams and truth tables for given scenarios

Core procedural knowledge: What should students be able to do?

  • Pupils need to be able to:

    • Draw simple logic diagrams using the operators AND, OR and NOT.
    • Draw truth tables to represent their logic diagrams.
    • Combine Boolean operators using AND, OR and NOT.

Links to prior learning (to be made explicit and tested)

  • Boolean Logic – Year 9 / Module 6