Computer Science,
one step at a time.

binary addition and overflow is the relevant concept. Two positive operands cannot have a negative mathematical sum, so the sign change shows two's-complement overflow. Overflow occurs when the mathematical result lies outside the range representable by the fixed number of bits; a carry alone does not define signed overflow.

Watch for: Do not describe Data representation vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

bitmap pixels and headers is the relevant concept. The metadata belongs in the bitmap header, while the grid values encode the pixels. A bitmap stores colour information for individual pixels and uses a file header to record metadata needed to interpret the pixel data.

Watch for: Do not describe Multimedia: graphics and sound vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

purpose of compression is the relevant concept. Compressing the encoded data reduces the transfer size and therefore the download time at the same connection speed. Compression reduces the number of bits needed to store or transmit data, saving storage capacity and reducing transfer time or bandwidth demand.

Watch for: Do not describe Compression vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

Ethernet CSMA/CD is the relevant concept. They detect the collision, abort their transmissions and retry after independently chosen backoff delays, reducing the chance of another collision. With CSMA/CD, a device listens before transmitting, detects a collision on shared Ethernet, stops, waits for a random backoff interval and then tries again.

Watch for: Do not describe Networks including the internet vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

input, output, memory and storage roles is the relevant concept. The microphone is input, RAM is primary memory and the solid-state drive is persistent secondary storage. Input hardware captures data, output hardware presents results, primary memory holds instructions and data directly available to the processor, and secondary storage retains data persistently.

Watch for: Do not describe Computers and their components vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

expression-to-circuit construction is the relevant concept. The circuit changes meaning because bracket scope determines which intermediate signal is inverted; each subexpression must be built before its enclosing operation. To construct a logic circuit from an expression, evaluate the innermost bracketed operations first and preserve every inversion at the correct intermediate output.

Watch for: Do not describe Logic gates and logic circuits vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

PC, MAR, MDR and CIR registers is the relevant concept. The address moves PC → MAR, the fetched instruction moves memory → MDR → CIR, and the PC is incremented. The PC holds the address of the next instruction, the MAR holds a memory address being accessed, the MDR holds data or an instruction transferred to or from memory, and the CIR holds the current instruction being decoded or executed.

Watch for: Do not describe CPU architecture vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

assembly trace discipline is the relevant concept. A correct trace records each changed register and memory value in instruction order and stops only when the comparison makes the exit jump execute. Tracing assembly requires updating PC, ACC, IX, relevant memory and condition state after each instruction while distinguishing literal operands from memory contents.

Watch for: Do not describe Assembly language vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

XOR mask for toggling a bit is the relevant concept. The result is 1000 0100 because the two masked positions invert and every unmasked position is preserved. Bitwise XOR with a 1 toggles the corresponding bit, while XOR with 0 leaves that bit unchanged.

Watch for: Do not describe Bit manipulation vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

operating-system purpose and interface is the relevant concept. The operating system mediates the requests and allocates hardware resources safely instead of each application controlling the hardware independently. An operating system provides an interface between users, applications and hardware, coordinates shared resources and supplies services that let programs run without controlling each device directly.

Watch for: Do not describe Operating systems vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

assembler translation is the relevant concept. The assembler maps the mnemonics to opcodes and resolves the symbolic references into the target machine representation. An assembler translates assembly-language mnemonics and symbolic operands into the machine-code instructions and addresses required by a particular processor.

Watch for: Do not describe Language translators vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

security, privacy and integrity distinction is the relevant concept. Encryption supports security, but the mistype is an integrity failure and the unexplained secondary use is a privacy issue. Data security protects data and systems from unauthorised access or damage, privacy concerns appropriate collection and use of personal data, and integrity means data remains accurate, complete and unaltered except by authorised processes.

Watch for: Do not describe Data security vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

validation versus verification is the relevant concept. The range validation accepts a plausible value, so verification against the source is still needed to detect the transcription error. Validation tests whether data is reasonable and follows defined rules, while verification checks whether data was copied or transferred accurately; valid data can still be factually wrong.

Watch for: Do not describe Data integrity vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

professional computing ethics is the relevant concept. An ethical professional considers proportionality, affected people and preventable harm rather than treating legality alone as sufficient. Computing ethics provides principles for responsible professional decisions where technical capability affects people, rights, safety, fairness and the public interest beyond minimum legal compliance.

Watch for: Do not describe Ethics and ownership vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

normalisation to third normal form is the relevant concept. StudentName depends only on StudentID and CourseTitle only on CourseID, so separate STUDENT and COURSE tables remove partial dependencies before ENROLMENT retains the keys and Grade. First normal form requires atomic values and no repeating groups, second normal form removes partial dependency on part of a composite key, and third normal form removes non-key dependencies on other non-key attributes.

Watch for: Do not describe Database concepts vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

DBMS-controlled shared data is the relevant concept. The DBMS coordinates shared access and one authoritative representation, reducing inconsistency between separate files. A database management system centrally controls structured data and provides consistent querying, concurrency, security and integrity services that reduce duplicated application-specific file handling.

Watch for: Do not describe Database management systems vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

primary-key and foreign-key definitions is the relevant concept. ALTER TABLE PERFORMANCE ADD FOREIGN KEY (EventID) REFERENCES EVENT (EventID) adds the required referential constraint. PRIMARY KEY(field) enforces the selected row identifier, while FOREIGN KEY(field) REFERENCES Parent(PrimaryField) defines and enforces a relationship to an existing parent key.

Watch for: Do not describe DDL and DML vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

abstraction by removing irrelevant detail is the relevant concept. Road connectivity and cost affect route choice, whereas building colour is irrelevant and is removed by abstraction. Abstraction represents a problem using only details essential to its purpose, deliberately omitting information that does not affect the required solution.

Watch for: Do not describe Computational thinking skills vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

logic statements in algorithms is the relevant concept. The intended condition is Authenticated AND (IsAdmin OR IsOwner); omitting the grouping may change which unauthenticated cases pass. Logical operators AND, OR and NOT combine or invert Boolean conditions, and parentheses make the intended grouping explicit when a decision has several tests.

Watch for: Do not describe Algorithms vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

INTEGER and REAL selection is the relevant concept. Passenger count should be INTEGER and measured fuel mass should be REAL because only the latter requires a fractional component. INTEGER stores whole numbers exactly within its supported range, while REAL stores values that may contain a fractional part and can introduce finite-precision representation effects.

Watch for: Do not describe Data types and records vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

A one-dimensional array stores a linear sequence of same-type elements addressed by one index, such as daily readings or a list of names. This is the defining distinction required by section 10.2; the other choices describe different concepts from Arrays.

Watch for: Do not describe Arrays vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

persistent file storage is the relevant concept. Writing the results to a file provides persistence across executions and power loss. A file keeps data beyond one program execution and can hold more persistent content than is practical to re-enter or retain only in volatile main memory.

Watch for: Do not describe Files vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

abstract data type definition is the relevant concept. The visible behaviour and operations define the ADT, while the hidden representation can change without changing client use. An abstract data type specifies a collection of data and the permitted operations on that data independently of the internal representation used to implement them.

Watch for: Do not describe Introduction to abstract data types vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

translating a design into pseudocode is the relevant concept. Equivalent pseudocode must keep the input, the invalid-data branch and the nested adult-versus-child choice with the same conditions. Implementing a flowchart or structured-English design requires preserving its order, decisions, repetition, inputs and outputs in equivalent unambiguous pseudocode rather than inventing different behaviour.

Watch for: Do not describe Programming basics vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

IF without ELSE is the relevant concept. A single IF Temperature > Limit THEN branch is sufficient because the false case deliberately performs no alternative action. An IF without ELSE executes its block only when the condition is TRUE and otherwise continues after ENDIF without executing an alternative block.

Watch for: Do not describe Constructs vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

procedure definition and call is the relevant concept. A DisplayHeading procedure removes duplicated statements and is called for its action rather than used as an expression operand. A procedure is a named subroutine defined with a header and body, invoked by a call to perform an action, and does not supply a return value that replaces the call in an expression.

Watch for: Do not describe Structured programming vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

development-life-cycle purpose is the relevant concept. A defined life cycle would establish and trace requirements through design and testing before release, reducing uncontrolled rework. A program development life cycle organises analysis, design, coding, testing and maintenance so requirements, decisions, quality checks and changes are managed systematically.

Watch for: Do not describe Program development life cycle vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

structure-chart purpose is the relevant concept. The hierarchy and parameter links document module organisation; detailed loop and selection logic belongs in pseudocode or a flowchart. A structure chart documents hierarchical module decomposition and the calls and data or control items passed between modules, rather than showing the detailed statement-by-statement control flow.

Watch for: Do not describe Program design vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

test plans, test data and maintenance is the relevant concept. The cases include normal, abnormal and boundary data, while the three later changes are corrective, adaptive and perfective maintenance respectively. A test plan records cases, normal, abnormal and boundary data, expected results and actual outcomes; after release, corrective maintenance fixes faults, adaptive maintenance responds to environment change and perfective maintenance improves functionality or performance.

Watch for: Do not describe Program testing and maintenance vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

purpose of user-defined types is the relevant concept. A named Flight type captures the entity consistently and prevents every module inventing a different collection of primitive variables. A user-defined type models a problem-specific set or structure with a meaningful name, constraining values and grouping related data more clearly than unrelated primitive variables.

Watch for: Do not describe User-defined data types vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

serial file organisation is the relevant concept. Serial organisation suits the append-only event stream, but a specific event may require scanning earlier records. A serial file stores records in arrival order with no ordering key, making insertion simple but normally requiring a sequential scan to find a particular record.

Watch for: Do not describe File organisation and access vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

rounding-error accumulation is the relevant concept. The binary approximation can make the exact equality fail, so a justified tolerance or different exact representation is safer. Rounding selects a nearby representable value after an operation, and repeated floating-point operations can accumulate or propagate small errors so equality tests and final results need suitable tolerance or precision.

Watch for: Do not describe Floating-point representation and manipulation vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

need for communication protocols is the relevant concept. Without a common protocol the receiver cannot reliably parse the bytes even though the physical connection works. A communication protocol defines shared rules for message format, timing, addressing, sequencing and error handling so independent devices can interpret exchanges consistently.

Watch for: Do not describe Protocols vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

circuit switching is the relevant concept. The reserved path gives consistent delay and capacity, but unused silent intervals cannot be shared by other sessions. Circuit switching establishes a dedicated end-to-end communication path with reserved capacity for the session before data transfer begins, giving predictable service but wasting capacity during silence.

Watch for: Do not describe Circuit switching and packet switching vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

RISC instruction-set characteristics is the relevant concept. The load/store separation and simple register operations are characteristic of RISC design. A RISC processor uses a smaller set of simple, often fixed-length instructions with few addressing modes and commonly a load/store design supported by many registers.

Watch for: Do not describe Processors, parallel processing and virtual machines vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

De Morgan's laws is the relevant concept. NOT(Ready OR Authorised) becomes (NOT Ready) AND (NOT Authorised), not an OR of the complements. De Morgan's laws state NOT(A AND B) = (NOT A) OR (NOT B) and NOT(A OR B) = (NOT A) AND (NOT B), with each input and the operator transformed.

Watch for: Do not describe Boolean algebra and logic circuits vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

segmentation, page replacement and thrashing is the relevant concept. The working sets do not fit in RAM, so repeated replacement causes thrashing; reducing active demand or adding frames can restore useful execution. Segmentation uses variable-size logical units such as code or data, unlike fixed-size paging; excessive page replacement can cause thrashing when the system spends more time swapping pages than executing useful work.

Watch for: Do not describe Purposes of an operating system vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

Backus–Naur Form grammar is the relevant concept. The recursive alternative derives any non-empty sequence of the permitted digit terminals, while other characters cannot be derived. Backus–Naur Form defines a non-terminal using production alternatives made from terminals and other non-terminals, allowing recursive rules to describe repeated or nested language structure.

Watch for: Do not describe Translation software vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

plaintext, ciphertext and keys is the relevant concept. A sound cryptosystem is designed to resist recovery of plaintext despite algorithm knowledge, provided the key remains secure. Encryption applies an algorithm and key to plaintext to produce ciphertext, while decryption with the required key recovers plaintext; security depends on protected keys rather than secrecy of the algorithm alone.

Watch for: Do not describe Encryption, protocols and digital certificates vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

backpropagation and regression is the relevant concept. A loss gradient is propagated backward to update weights, and the continuous target makes the overall task regression rather than classification. Backpropagation propagates output error gradients backward through a neural network to update weights, while regression learns a relationship that predicts a continuous numeric outcome.

Watch for: Do not describe Artificial intelligence vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

time and space complexity comparison is the relevant concept. A scales better in time for large n but consumes more auxiliary memory, so the appropriate choice depends on input size and memory constraints. Big O describes how time or extra space grows with input size, ignoring constant factors, so algorithms performing the same task should be compared on relevant worst or typical growth and memory requirements.

Watch for: Do not describe Algorithms vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

call-stack frames is the relevant concept. Three separate frames preserve each node parameter and return point instead of later calls overwriting earlier call state. Each recursive call needs a stack frame holding its parameters, local variables and return address, allowing multiple active instances of the same routine to retain different state.

Watch for: Do not describe Recursion vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

programming paradigm is the relevant concept. The first follows an imperative paradigm and the second a declarative paradigm, despite sharing the same required outcome. A programming paradigm is a general model for structuring programs and expressing computation, such as low-level, imperative, object-oriented or declarative programming.

Watch for: Do not describe Programming paradigms vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.

try, specific handlers and guaranteed cleanup is the relevant concept. A conversion-specific handler reports the data fault and a guaranteed cleanup block closes the opened file on both success and failure paths. Robust exception code protects the operations that may fail, catches specific expected exception types, avoids concealing unrelated faults and places required cleanup where it runs whether processing succeeds or fails.

Watch for: Do not describe File processing and exception handling vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.