Digital literacy Algorithms Networking
Creating content:
• Creating tables
• what if questions
• cell references, charts
• functions
• formulas Data in computers-
• binary switches
• electronic circuits
• data
• pixels
• bitmaps
• sounds
Programming in Scratch
• algorithms with multiple paths
• Ifs, decision box, nested selection, e.g. calculator program, brushing teeth algorithm)
Programming constructs
• programs in a linear sequence which have multiple paths (inputs, variables, outputs, selection)
• data types (boolean, string, integer, real);
• operators are used to make comparisons in programs (selection, >,<,!=,==)
• selection is used to create multiple paths in a program (IF, Else, decision) e.g. a simple shape program
• iteration is used to repeat an instruction in a program
Communication
• Computers can communicate with one and other with 1s and 0s, packets/envelopes to send data)
• Networks (Definition, benefits and risks)
• Network types (LAN, WAN and PAN, definition, examples and differences between them
Security
• Malicious code (Definition, examples, Malware types)
Skills taught:
• Use a model to ask what-if questions based on different inputs
• Use a range of data to create charts
• Approximate the file size of a bitmap image
Skills taught:
• Trace a simple algorithm using a table
• Create programs which have multiple paths
• Use selection in programs to test conditions
• Use complex Boolean operations when completing if statements
• Use condition and count controlled iteration to repeat instructions in programs
Skills taught:
• Describe the journey of a packet between one computer to another
• Explain the differences between different network topologies
• Describe the impact of malicious code on computer networks
Autumn Spring Summer
Algorithms Computer Systems Networking
Programming in Python
• algorithms, abstraction and decompositions
• designing a quiz game (decisions, data, iteration)
• error handling (looping, data valiadation, robust programming) Reading and modifying algorithm
• Tracing & Debugging Programming constructs
• If/elif/nested selection
• Iteration (count controlled/condition controlled) Handling data in programs
• Manipulating data (operators) –
• <,>, less than, more than, equal to, not equal to Data structures –
• variables are a store for a single piece of data of one type (storage box, data type);
Subroutines –
• call a subroutine to complete a task multiple times
Model of a computer system
• FDE Cycle (Hardware diagram, definition of a computer, CPU and Volatile RAM, Current running applications, System BUS),
• Factors affecting processing Speed (Hertz, Clock speed, Muticore processors, intro to cache, Link clock speed to FDE cycle, Parallel and multi tasking and limitation),
• RAM Vs ROM (Properties of RAM and ROM, how and when used BIOS and Bootstrap)
• Von Nueman Vs Embedded Systems Hardwware and software
• Magnetic storage
• Optical Storage
• Solid state
• Compare all secondary storage(advantages and disadvantages)
• Software (definition, system, utility and application)
• Operating system (Definition, Interface and the five management roles)
Types of networks
• Network medium
• Wired Vs Wireless
• Bus Topology
• Star Topology Network security
• Malware types
• Security risks to networks
Skills taught:
• Write programs which use multiple paths in Python
• Use multiple variables within a program
• Use complex Boolean conditions
• Use indefinite iteration to test a value
Skills taught:
• Describe each step and process in the FDE cycle
• Define embedded vs. non embedded systems
• Compare and contrast types of memory storage
Skills taught:
• Explain the differences between difference between network types
• Describe different types of malware
Algorithms, Programming & Data Representation Computer Systems & Programming Networking
Tracing & Debugging -
• robust programming,
• error checking (dealing with inputs)
• logical errors & syntax errors Set piece algorithms –
• bubble sort
• linear search Programming
• boolean expression (while, IF, AND, OR, NOT)
• complex boolean conditions (e.g. for a password check which limits to three attempts);
• file handling techniques Data structures
• 1D arrays/lists
• Variables Data representation
• Binary conversions
• Hex conversions
Data representation
• Multiplication and division of binary (left and right shift)
• Units of information (bits, byte, kilobyte, megabyte, gigabyte, terabyte)
• Text data (character encoding, ASCII) Logic circuits
• Logic gates - AND, OR, NOT logic gates (identifying logic gates and completing truth tables)
• Logic circuits (drawing logic circuits for a problem) Sub routines
• Modular structure
• Functions and procedures
• Parameters and arguments
• Local and global variables
Network types
• Advantages and disadvantages of different network mediums Data communication
• TCP/IP (Definition of protocol, Layers, advantages of layers, TCP/IP as a communication protocol)
• TCP/IP layers (layers and their roles, application protocols) Cyber security
• Social engineering (phishing, pharming, blagging, shouldering)
• Security - threats (removable media, poor configurations, people)
• Network security methods (authentication, encryption, firewall, MAC address filtering)
• Penetration testing (White box and black box)
• SQL injection attacks
• DDOS attacks
Skills taught:
• Creating a program which traps errors based on one condition
• Trace the bubble sort and linear search for a list
• Create an if statement which checks two conditions
• Create a program which iterates through each element in a 1D list
Skills taught:
• Demonstrate how to convert between binary, hex and decimal and vice versa
• Demonstrate how to multiple and divide a binary number
• Explain the purpose of the ASCII code system for character encoding
• Design programs with a modular structure
• Create programs which use parameters and arguments
Skills taught
• Describe how a packet flows through different mediums
• Explain how the TCP/IP is used as a flow to check the transmission of packets
Autumn Spring Summer
Theme of Term SQL, data representation and networking Bridging Project
Tracing & Debugging -
• robust programming,
• error checking (dealing with inputs)
• run time errors Set piece algorithms –
• divide and conquer algorithms
• merge sort
• insertion sort
• binary search Data structures -
• 2D lists (e.g. a grid);
Computer Systems
• Tiers of programming languages Sub routines
Structured Query Language
• Use of records
• Query in SQL Data representation
Logic circuits (drawing logic circuits for a problem e.g. burgler alarm, interpreting a logic circuit with up to three gates and completing an associative truth table)
Impact of digital technology on wider society
• Ethical issues
• Legal issues
• Cultural issues
• Environment issues
• Privacy issues
• Legislation
Programming techniques with Sixth Form in mind
Skills taught:
• Creating a program which traps errors based on two conditions
• Dry run programs that return values from a sub routine into a variable
• Create programs which use sub routines
• Explain the advantages of using sub routines for structured programming
Skills taught:
• Demonstrate how to query and add data to a SQL file
• Illustrate how to draw logic circuits for simple problems
• Describe the impact five issues have with reference to use and access to digital technology with reference to points such as the digital divide
• Explain the impact of key legislation such as the data protection act
Prpogramming & Computer Systems Prpogramming & Computer Systems Coursework preparation, Networking & Programming
Fundamentals of programming
• Programming basics (sequencing, data types)
• Selection
• Iteration
• Arrays (1 and 2 dimensional)
• Subroutines
• Files and exception handling
• Preparation for On Screen Test (Battleships) Data representation
• Number systems (decimal, binary, hex)
• Bits, bytes and binary
• Binary arithmetic
• Representing images
• Representing sound (Nyquists theorem)
• Data compression and encryption algorithms
Fundamentals of programming
• Preparation for the On Screen Test (Plant simulation)
• Structured programming
• Writing and interpreting algorithms
• Testing
• Abstraction and automation
• Finite state machines Computer Systems
• Hardware and software
• Programming language classification
• Logic gates and Boolean algebra
• Internal Computer Architecture
• The processor
• Assembly language
• Input – output devices
• Secondary storage devices
Comunnication
• Communication methods
• Network topologies
• Client server and peer to peer
• Wireless networking
• Communication privacy
• Social, cultural and ethical issues Object Orientated Programming (OOP)
• Basic concepts of OOP
• OOP design principles
• Application of OOP
• OST (Rabbits and Foxes) Structured Query Language (SQL)
• Entity relationship modelling
• Relational databases and normalisation
• Introduction to SQL
• Defining and updating tables using SQL
• Systematic approach to problem solving Coursework preparation (tKinter for creating an application) Skills taught:
• Write a program which handles multiple inputs
• Create robust program with multiple levels of selection
• Apply complex Boolean operators to conditional statements
• Use iteration to output each value in a 2D and 1D list
• Conversation between binary, decimal and hexadecimal
• Calculation of file size for sound and images
Skills taught:
• Handling a program with parameters and arguments and sub routines through dry running
• Checking a program for robustness and making suitable edits
• Expanding on a program based on set criteria
• Be able to explain the role of each component in a Computer System
Skills taught:
• Describe how a packet is sent across a network
• Evaluate the main social, ethical and cultural issues with networking
• Demonstrate how a program can be created using classes and objects
• Demonstrate how data can be modelled using SQL
Year 13
Autumn Spring Summer
Programming, Data Structures & Computer Systems Algorithms, Regular Languages & Networking Revision
Functional programming
• Functional programming
• Functional application
• Lists in functional programming
• Big data
• Preparation for On Screen Test (based on Zig Zag pre release) Data structures
• Queues
• Lists
• Stacks
• Hash tables
• Graphs
• Trees
• Vectors Computer Systems
• Floating point form
• Dual adder
• D type flip flop
Algorithms
• Recursive algorithms
• Big-O notation
• Searching and sorting
• Graphs and traversal algorithms
• Optimisation algorithms
• Limits of computation Regular languages
• Mealy machines
• Sets
• Regular expressions
• Turing machine
• Backus-Naur form
• Reverse Polish Notation The Internet
• Structure of the internet
• Packet switching and routers
• Internet security
• TCP/IP
• IP addresses
• Client server model Skills taught:
• Be able to apply a map and fold to a list in functional programming
• Make edits to OOP programs
• Apply graphs, trees and vectors to algorithms
Skills taught:
• Demonstrate the use of a stack frame in a recursively defined algorithm
• Dry run and program searching and sorting algorithms
• Demonstrate how a stack can be used in RPN
• Use syntax checking tools such as BNF to check languages
Skills taught:
• Practice long answer essay questions on ethical and legal considerations
• Practice practical programming questions
