Paper 1 Content

Fundamentals of Algorithms

• Algorithms, Decomposition & Abstraction
• Understanding the inputs, processing and outputs within an algorithm
• Using a trace table to identify the state of variables in a program

Searching and Sorting

• Binary / Linear Search
• Merge / Bubble Sort
• Comparison of efficiency

Programming

• Use of Variables, input, and print
• Understanding of selection and iteration (conditional and count controlled)
• Understand the need for subroutines and efficient coding
• One and two-dimensional arrays
• Records
• Syntax vs Logic errors

Revision Clocks        Scroll to the bottom of the page

Past Papers can be found here (link): AQA GCSE CS Paper 1

Paper 2 Content

Fundamentals of Data Representation

• Binary, Hexadecimal and Conversion
• Units of Information – GB, kB, Byte
• Binary Addition / Shift
• ASCII / Unicode
• Images and Sound
• Compression

Computer Systems

• Boolean Logic, OR, NOT, AND, XOR
• Software Classification
• High / Low Level Languages and Translators
• Systems Architecture – CPU, RAM, Fetch Decode Execute Cycle

Computer Networks

• LAN, WAN, PAN
• Advantages of a Network / What is a network?
• Star & Bus
• Protocols and Packet Tracing
• Network Security
• TCP/IP Layers – ATIL

Databases

• SQL – Select, From, Where, Order By

Ethical, Legal and Moral

• Lengthy Questions – Refer to the ethical, legal and moral impacts for a given scenario

Revision Clocks        Scroll to the bottom of the page

Past Paper can be found here (link):

AQA GCSE CS Paper 2