MATSEC AM Computing key terms

A design in which a single processor fetches instructions and data from the same shared memory, executing one instruction at a time in a fetch-decode-execute cycle.

A register holding the memory address of the next instruction to be fetched, automatically incremented after each fetch unless a jump changes the sequence.

A small, very fast storage location inside the CPU used to hold operands, addresses or intermediate results during instruction execution.

The CPU component that performs integer arithmetic such as addition and subtraction and logical operations such as AND, OR and comparison of values.

The repeating sequence in which the CPU retrieves an instruction from memory, works out what operation it specifies, then carries it out.

The complete collection of machine-level operations a particular processor can carry out, each encoded as a binary pattern with defined operands.

A small, fast memory between the CPU and main memory that keeps recently or frequently used data to reduce the average time needed to access it.

A technique where disk storage is used to extend apparent main memory, with pages swapped in and out as needed by the running process.

A memory management scheme dividing memory into fixed-size blocks so that non-contiguous physical frames can hold a program's logical pages.

System software that manages hardware resources, schedules processes, handles files and provides services and interfaces for application programs.

A signal that temporarily suspends the current instruction sequence so the processor can service an urgent event, then resume where it stopped.

A program that translates an entire source file into machine code or another target language before the resulting program is run.

A program that reads source code and executes it statement by statement, translating each part at run time rather than producing a separate executable file.

A mistake in the grammar of a program, such as a missing bracket or misspelled keyword, which prevents translation or execution from proceeding.

A flaw where a program runs without crashing but produces incorrect output because the algorithm or conditions are wrong.

A defined set of inputs, preconditions and expected outputs used to check whether a program behaves correctly, often covering normal and boundary values.

Manually tracing a program's statements with sample data, recording variable values step by step, to verify logic or locate a fault.

A finite, unambiguous sequence of steps that transforms given inputs into a required output and always terminates.

A structured, language-independent notation using keywords and indentation to describe an algorithm without the strict rules of real code.

A diagram using standard symbols such as rectangles for processes and diamonds for decisions to represent the sequence of steps in an algorithm.

A field or minimal combination of fields whose values uniquely identify each record in a table and cannot be null.

A field in one table whose values must match a primary key value in another table, creating a link and enforcing referential integrity.

A collection of data organised as tables of rows and columns, linked by shared key values and queried with operations such as select, project and join.

The process of restructuring tables to remove redundant data and update anomalies by organising fields into related tables according to dependency rules.

A rule ensuring that every value of a foreign key matches an existing primary key value, or is null, so links between tables stay valid.

A rule requiring that no field forming part of a primary key may contain a null value, so every record can be identified.

A search that examines each element of a list in turn until the target is found or the list ends, working on unsorted data.

A search of a sorted list that repeatedly compares the target with the middle element and discards the half that cannot contain it.

A sorting method that repeatedly compares adjacent items and swaps them when out of order, pushing the largest remaining value to the end each pass.

An agreed set of rules governing how data is formatted, addressed, transmitted and acknowledged between devices on a network.

A numeric label assigned to a device on a network so that packets can be routed to it, written as four decimal octets in IPv4.

A 32-bit pattern that separates the network portion of an IPv4 address from the host portion, identifying which addresses are local.

A method of sending data by splitting it into small packets that travel independently across shared links and are reassembled at the destination.

A transport protocol providing reliable, ordered delivery by numbering segments, acknowledging receipt and retransmitting anything lost.

A connectionless transport protocol that sends datagrams without acknowledgement or retransmission, giving low overhead but no delivery guarantee.

The transformation of readable data into an unreadable form using a key, so that only parties able to reverse it can recover the content.

A scheme where the same secret key is used both to encrypt and to decrypt data, so the key must be shared securely in advance.

A scheme using a matched key pair: a public key to encrypt and a private key to decrypt, removing the need to share a secret key.

A one-way calculation producing a fixed-length fingerprint of data, used for integrity checks and password storage because it cannot be reversed.

A value created with the sender's private key that a recipient can verify with the public key, proving origin and detecting later alteration.

A deception in which messages impersonating a trusted organisation trick a recipient into revealing credentials or clicking malicious links.

Software written to harm or exploit a system, including viruses, worms, trojans and ransomware, often delivered through attachments or downloads.

Manipulating people through trust, urgency or authority to obtain confidential information or persuade them to perform unsafe actions.

Maltese legislation, aligned with the GDPR, setting rules on lawful processing, storage and transfer of personal data and rights of data subjects.

Any information relating to an identified or identifiable living individual, including names, identifiers, location data and online identifiers.

A legal right giving the creator of an original work control over copying, distribution and adaptation for a fixed term.

A legal agreement stating how a program may be used, copied, modified or redistributed, such as proprietary, freeware or open source terms.