Skip to content
ExamSpine

Question bank

254 questions so far. 162 are checked for you: your code is run against tests, or your trace table is compared with one made by running the code (22 of the trace tables also ask one written question you mark yourself). 92 are written answers you mark yourself against the marking points.219 questions in Java so far. 18 are checked for you: your trace table is compared with one made by running the code (9 of the trace tables also ask one written question you mark yourself). 109 are code questions: Java answers can't run here yet, so they are not checked for you. 92 are written answers you mark yourself against the marking points.

Ready for a whole paper? Sit a practice paper, made from these questions.

254 of 254 questions

Name the main components of a CPU and state what each one does

Explain what cache memory is for and what a cache hit and a cache miss mean

Describe the fetch, decode and execute cycle step by step

Explain pipelining and how overlapping instruction stages raises throughput

Compare internal and external secondary storage types including HDD, SSD, optical, flash and network attached storage

Convert between denary, binary and hexadecimal

Explain how integers are stored, including a representation for negative numbers

Explain how a bitmap image is stored, and how resolution and colour depth affect file size

Write the Boolean expression for a described condition

Explain how the operating system allocates and protects memory between processes

Compare scheduling approaches such as round robin, priority and first come first served

Compare polling and interrupts as ways for hardware to get the processor's attention

Compare interpreters and compilers on error detection, translation time, execution speed and portability

Explain what bytecode is and how a virtual machine executes it

State the function of a router, switch, modem, gateway, network interface card, wireless access point and firewall

Compare TCP and UDP and say when each is the right transport protocol

Name the four layers of the TCP/IP model and state what each is responsible for

Trace a piece of data down and back up the TCP/IP layers, describing encapsulation

Describe common network topologies including star, mesh and hybrid

Describe how a DNS lookup resolves a domain name to an IP address

Interpret CIDR notation to identify a network range

Explain what an IP address is and how it differs from a MAC address

Explain packet switching and what a packet contains

Explain what a firewall does and where it sits in a network

Describe common network attacks including DoS and DDoS, man in the middle, phishing, malware, SQL injection and cross-site scripting

Explain what encryption does and distinguish plaintext from ciphertext

Explain what a primary key is and why every table needs one

Identify one-to-one, one-to-many and many-to-many relationships in a scenario

Describe the data anomalies that poor design causes on insert, update and delete

Read an entity relationship diagram and state the entities, attributes and relationships it describes

Choose appropriate SQL data types such as INTEGER, REAL, BOOLEAN, CHAR, VARCHAR and DATE for given attributes

Identify partial and transitive dependencies in a table

Write a single-table SELECT query using WHERE, ORDER BY and DISTINCT

Write INSERT, UPDATE and DELETE statements, and explain the consequence of omitting a WHERE clause

Use the aggregate functions COUNT, SUM, AVG, MIN and MAX in a query

Explain what a transaction is and why some operations must succeed or fail as a unit

Compare relational and non-relational approaches on schema flexibility, scaling and consistency

Explain what machine learning is and how it differs from a conventionally programmed solution

Distinguish supervised, unsupervised and reinforcement learning

Distinguish classification from regression as supervised tasks

Compare running a model on an edge device with running it in a data centre or cloud platform

Recommend a hardware deployment for a described machine learning scenario and justify it

Explain why raw data must be cleaned before training and what happens if it is not

Identify data quality problems such as missing values, duplicates, outliers and inconsistent formats

Explain what feature selection is and why fewer, better features can improve a model

Interpret a fitted regression line and use it to make a prediction

Evaluate a classifier using accuracy and the counts of correct and incorrect predictions per class

Explain what a hyperparameter is and how it differs from a learned parameter

Explain why a model must be evaluated on data it was not trained on

Explain how bias enters a machine learning system through data, labels or design choices

Apply decomposition to break a problem into sub-problems

Design an algorithm as an ordered sequence of unambiguous steps

Read a flowchart and state what the algorithm it describes does

Read first →

Trace a flowchart with given inputs and produce the correct output, using a trace table

Declare and assign variables of the common primitive types

Read first →

Choose an appropriate data type for a given value and explain why

Distinguish local from global scope and predict which value a name refers to

Read first →

Trace a program by hand and record variable values at each step in a trace table

Apply arithmetic, comparison and logical operators correctly, including operator precedence

Read first →

Convert between data types explicitly and explain when conversion loses information

Read first →

Extract a substring from a string by position

Read first →

Manipulate strings by concatenating, searching, replacing and changing case

Read first →

Split a string on a delimiter and rejoin parts

Read first →

Explain what an exception is and when a program should handle one

Read first →

Write code that catches an exception and recovers, rather than crashing

Read first →

Validate input so that bad data is rejected before it causes an error

Read first →

Distinguish syntax, runtime and logic errors and identify which one a described failure is

Read first →

Debug a program using tracing, test output and breakpoints, and explain the fix

Read first →

Design test cases including normal, boundary and invalid inputs

Read first →

Distinguish static from dynamic data structures

Read first →

Compare static and dynamic structures on memory use, flexibility and access speed

Create, index, update and iterate over a one-dimensional array or list

Read first →

Write code that searches or accumulates over a list

Read first →

Create and traverse a two-dimensional array or list, including by row and by column

Read first →

Trace code that manipulates an array or list and state the final contents

Read first →

Explain the last in, first out behaviour of a stack and name its operations

Read first →

Trace a sequence of push and pop operations and state the stack contents at the end

Identify a problem that a stack solves naturally and explain why

Read first →

Explain the first in, first out behaviour of a queue and name its operations

Read first →

Trace a sequence of enqueue and dequeue operations and state the queue contents at the end

Identify a problem that a queue solves naturally and explain why

Read first →

Write a program whose statements run in the correct order to meet a stated objective

Read first →

Write conditional statements using if, else if and else

Read first →

Write nested and compound conditions correctly

Read first →

Trace a program with branching and state which branch runs for given inputs

Read first →

Write a count-controlled loop

Read first →

Write a condition-controlled loop and avoid an infinite loop

Read first →

Write nested loops, for example to process a two-dimensional structure

Read first →

Trace a loop and state the number of iterations and the final values

Read first →

Define a function with parameters and a return value, and call it

Read first →

Explain the difference between a parameter and an argument, and between returning and printing

Read first →

Decompose a long program into functions and explain the benefit of modularisation

Read first →

Explain what algorithmic efficiency means and why it is measured against input size rather than clock time

Read first →

State the meaning of the common complexity classes including constant, linear, logarithmic and quadratic time

Read first →

Determine the Big O complexity of a short piece of code from its loop structure

Read first →

Write a binary search and explain why it requires sorted data

Trace a binary search on a given sorted list and count the comparisons

Write a selection sort and state its complexity

Compare a recursive and an iterative solution to the same problem on clarity and cost

Write a recursive algorithm for a standard problem such as factorial or Fibonacci

Trace a recursive call stack and state the return value

Trace a program that creates several objects and state the state of each

Explain encapsulation and information hiding and why internal state is protected

Explain inheritance and the relationship between a superclass and a subclass

Explain why separating interface from implementation lets the implementation change safely

Choose an appropriate ADT for a described problem and justify it