WACE Computer Science flashcards
WACE Computer Science · Build recall with a focused review session.
32 cards. Read the term and the definition here. The deck at the top of this page is optional.
- Data type
- A classification that specifies which values a variable may hold and which operations apply to it, such as integer, real, Boolean, character or string.
- Boolean
- A data type with exactly two possible values, true and false, used to represent conditions and the results of comparisons in selection and iteration.
- Array
- A fixed-size collection of elements of the same data type, stored in consecutive memory locations and accessed by a numeric index starting from zero.
- Record
- A composite data structure made of named fields that may hold different data types, used to model a single entity such as a student or product.
- Stack
- A last-in-first-out data structure where insertion (push) and removal (pop) both occur at the same end, used for undo operations and expression evaluation.
- Queue
- A first-in-first-out data structure where items are added at the rear and removed from the front, used for scheduling and buffering tasks.
- Linear search
- A search that checks each element of a list in turn until the target is found or the list ends, with time complexity O(n).
- Binary search
- A search that repeatedly halves a sorted list by comparing the target with the middle element, giving O(log n) time but requiring sorted data.
- Merge sort
- A divide-and-conquer sort that splits a list into halves, sorts each recursively, then merges them in order, achieving O(n log n) time.
- Two's complement
- A binary representation of signed integers where the most significant bit indicates sign; negation is done by inverting all bits and adding one.
- Hexadecimal
- A base-16 number system using digits 0-9 and A-F, commonly used as compact shorthand for binary because each digit represents exactly four bits.
- De Morgan's laws
- Two Boolean identities: the negation of A AND B equals NOT A OR NOT B, and the negation of A OR B equals NOT A AND NOT B.
- Syntax error
- An error that breaks the grammatical rules of a programming language, detected during compilation or interpretation, preventing the program from running.
- Logic error
- An error where the program runs without crashing but produces incorrect output because the algorithm or conditions are wrong; found by testing.
- Runtime error
- An error occurring while a program executes, such as division by zero or an out-of-range array index, which usually halts execution abnormally.
- Abstraction
- A technique that hides unnecessary implementation detail behind a simplified interface, letting programmers use a component without knowing its internals.
- Encapsulation
- Bundling data together with the methods that operate on it, restricting direct access so the internal state can only change through defined operations.
- CPU fetch-decode-execute cycle
- The repeated process where the CPU fetches an instruction from memory at the program counter, decodes it, executes it, then stores any result.
- Program counter
- A CPU register holding the memory address of the next instruction to be fetched, advanced after each fetch to keep execution sequential.
- Cache memory
- Fast, small, volatile memory between the CPU and RAM that stores recently or frequently used instructions and data to reduce average access time.
- RAM
- Random access memory is volatile primary storage that holds currently running programs and data; its contents are lost when power is removed.
- Operating system role
- System software that manages hardware, memory, files and processes, provides a user interface, and lets application software run on the machine.
- OSI model
- A seven-layer reference model for network communication: physical, data link, network, transport, session, presentation and application, each with defined responsibilities.
- TCP
- A connection-oriented transport protocol providing reliable, ordered delivery of data using acknowledgements and retransmission of lost packets.
- UDP
- A connectionless transport protocol that sends packets without acknowledgements; it is fast but does not guarantee delivery or ordering.
- DNS
- The Domain Name System translates human-readable domain names into IP addresses so clients can locate servers on a network.
- IP address
- A numeric identifier assigned to a device on a network, used by the internet protocol to route packets to the correct destination.
- Star topology
- A network layout where every device connects to a central switch or hub; faults are easy to isolate but the centre is a single point of failure.
- Encryption
- The process of converting plaintext into ciphertext using a key so that intercepted data cannot be read without the corresponding decryption key.
- Hashing
- A one-way transformation producing a fixed-length value from input data, used to verify integrity and to store passwords without keeping the original.
- Phishing
- A social-engineering attack using deceptive messages or fake websites to trick users into revealing credentials or installing malicious software.
- Australian Privacy Principles
- Thirteen principles in Australian law governing how organisations collect, use, store, disclose and provide access to personal information.