1/59
Comprehensive vocabulary flashcards covering logic circuits, networking topologies and protocols, data structures, relational database normalization and transactions, web client-server processing, software development paradigms, and computational problem-solving strategies.
D-Type flip flop
A logic circuit that can store the value of one bit (0 or 1). It has two inputs (data input D and clock signal CLK) and two outputs (data output Q and its inverse 'Q), updating its stored state only on the rising edge of the clock signal.
Clock signal
A regular pulse (change in voltage) generated by the CPU that is used to coordinate computer components and determine when data is captured and stored in sequential circuits.
Half adder
A logic circuit used to perform the addition of two single-bit numbers. It consists of two inputs (A and B) and two outputs: Sum (S) and Carry (Cout), constructed using an XOR gate and an AND gate.
Full adder
A logic circuit that adds three binary inputs (A, B, and a carry-in Cin from a previous stage) and produces two outputs (Cout and Sum S). It can be formed by joining two half adders with an OR gate.
Standards
A set of guidelines, conventions, or hardware and software specifications that govern how tasks are performed or products function, enabling devices from different manufacturers to be compatible and work seamlessly together.
Protocol
A set of agreed rules that govern data transmission across devices to ensure that all network devices interpret transmitted data and signals in the same way.
Physical topology
The physical layout and configuration of cables, wires, and network components that form a network (such as bus, star, or mesh).
Logical topology
The conceptual path and manner in which data flows across and around a network, regardless of its physical wiring layout.
Bus topology
A network architecture in which every computer and workstation is attached to a single continuous central backbone cable plugged into a terminator at each end.
Star topology
A network layout in which each workstation or node connects via its own independent cable directly to a central switch or computer that directs the flow of data using MAC addresses.
Mesh topology
A network topology in which every node connects directly to every other node, commonly implemented wirelessly (such as Wi-Fi) so data can dynamically route around connection breaks.
Protocol layering
A modular networking approach that divides communication tasks into ordered levels/layers that perform specific functions sequentially, allowing individual layers to be modified or upgraded without disrupting the others.
TCP/IP stack
A four-layer communication protocol stack (Application, Transport, Internet, and Link layers) that governs how data packets are formatted, addressed, routed, transmitted, and received across networks.
Transport layer
The layer in the TCP/IP stack that establishes end-to-end communication between sender and receiver using TCP, fragments data into numbered packets labeled with port numbers, and requests retransmission of lost packets.
Internet layer
The TCP/IP stack layer where routers operate, responsible for routing data packets across network boundaries by attaching source and destination IP addresses to form sockets.
Link layer
The lowest TCP/IP stack layer providing the physical device interface; it attaches source and destination MAC addresses to packets and converts digital data into electrical or physical signals.
IP address
A logical, changeable numerical identifier (such as four numbers from 0 to 255 in IPv4) assigned to a network device to provide global identification and packet routing across networks.
MAC address (Media Access Control)
A permanent, unique 6-byte hexadecimal physical address assigned and hard-coded into a device's Network Interface Card (NIC) at manufacture, used for local-level device identification.
DNS (Domain Name System)
An internet directory service that names and organizes internet resources by translating human-readable domain names into their associated numerical IP addresses.
URL (Uniform Resource Locator)
The complete internet address of a web resource that specifies its exact protocol, server location, resource name, and file type so a browser can request and retrieve it.
LAN (Local Area Network)
A computer network covering a small geographical area on a single site, where all networking equipment, cables, and infrastructure are owned and managed by the organisation or individual.
WAN (Wide Area Network)
A network covering a large geographical area formed by interconnecting multiple LANs, typically relying on third-party telecommunications infrastructure and connections.
Packet switching
A networking method where data is split into small packets that are routed independently across the network along the most optimal paths and reassembled into the correct order at the destination.
Circuit switching
A communication technique in which a dedicated, continuous physical link is established between two communicating devices for the entire duration of the transmission session.
DoS (Denial of Service)
A cyberattack in which a single machine floods a target server with useless traffic to overwhelm its resources, causing it to crash or become unavailable to legitimate users.
DDoS (Distributed Denial of Service)
A coordinated cyberattack where multiple compromised systems simultaneously flood a single target server with traffic from distributed locations to exhaust its bandwidth and capacity.
SQL injection
A security vulnerability where malicious SQL commands are entered into web input fields to manipulate or bypass back-end database execution, potentially exposing, modifying, or deleting sensitive data.
Firewall
A hardware device or software utility that inspects and filters incoming and outgoing network traffic according to predefined security rules to block unauthorized external access.
Proxy server
An intermediary server that intercepts and processes internet requests on behalf of clients, hiding client IP addresses for privacy, caching frequent web pages, and filtering network traffic.
Gateway
A network device used to connect two dissimilar networks running different communication protocols by translating packet headers and formatting across protocol boundaries.
Array
A static data structure that stores an ordered collection of elements of a single data type in contiguous, adjacent memory locations, supporting zero-indexed direct access.
Tuple
A static, immutable data structure that holds an ordered collection of elements of various data types, initialized with parentheses and unmodifiable once created.
Linked list
A dynamic data structure consisting of discrete nodes, where each node holds a data field and a pointer referencing the memory address of the next consecutive node in the sequence.
Stack
A Last-In, First-Out (LIFO) abstract data structure where elements are added (pushed) and removed (popped) exclusively from one end referenced by a top pointer.
Queue
A First-In, First-Out (FIFO) linear data structure where elements are appended at the rear via enqueue operations and removed from the front via dequeue operations.
Adjacency matrix
A 2D array representation of a graph where rows and columns represent vertices, and cells store values (1, 0, or edge weights) indicating whether an edge connects each pair of nodes.
Adjacency list
A graph representation implemented as a list of dictionaries or lists mapping each vertex to its immediate neighbours and weights, offering space efficiency for sparse graphs.
Binary search tree
A hierarchical binary tree data structure where each node has at most two child nodes, organized such that every node in the left subtree is strictly less than the parent node and every node in the right subtree is greater.
Hash table
A data structure that maps key-value pairs by applying a mathematical hash function to the key to calculate an index location, providing an average-case time complexity of O(1) for insertions, deletions, and lookups.
Primary key
A unique field or attribute chosen to uniquely identify each individual record in a database relation or table.
Foreign key
An attribute in a database table that serves as a cross-reference link by matching the primary key column of another distinct table.
First normal form (1NF)
A relational database standard requiring unique field names, values belonging to identical domains, atomic data within every cell, an established primary key, and no duplicate records.
Second normal form (2NF)
A database design state that satisfies 1NF and contains no partial dependencies, meaning every non-key attribute depends entirely on the full composite primary key.
Third normal form (3NF)
A database layout in 2NF that has eliminated all non-key (transitive) dependencies, ensuring all attributes rely solely upon the primary key itself.
Referential integrity
A relational database property ensuring consistent relationships between tables by requiring that foreign keys strictly reference existing primary keys to prevent orphaned records.
Record locking
A concurrency control technique in multi-user databases that locks a record while being edited by one transaction to prevent conflicting updates, inconsistent reads, or lost modifications.
ACID
A collection of transaction processing properties (Atomicity, Consistency, Isolation, and Durability) ensuring reliable execution and data integrity in database systems.
PageRank algorithm
A link-analysis algorithm used by search engines to rank web pages based on the quantity and quality of incoming links, the rank of the linking sites, and the number of outbound links.
Client side processing
Processing executed locally within the user's web browser (typically using JavaScript) to validate input, style interfaces, and handle interactivity without reloading the page or contacting the server.
Server Side processing
Computation carried out remotely on the web server (using languages like PHP or SQL) to execute database queries, validate data securely, and compute sensitive business logic.
Waterfall lifecycle
A traditional, sequential software development model in which project phases (feasibility, analysis, design, implementation, testing, evaluation, and maintenance) proceed strictly in order, with each stage completed before the next starts.
Extreme Programming (XP)
An agile software development methodology focused on producing high-quality code via paired programming, iterative development, regular code refactoring, continuous testing, and direct customer feedback.
Rapid Application Development (RAD)
An iterative software methodology prioritizing fast prototypes, strict time-boxing of features, and continuous user evaluation over comprehensive upfront planning and documentation.
Spiral model
A risk-driven software development paradigm characterized by repeating cycles across four quadrants: determine objectives, identify and manage risk, develop and test prototypes, and plan the next iteration.
White-box testing
Software testing conducted by developers who have complete knowledge of the internal code structure, designed to test every logical pathway, branch, and condition within the system.
Black box testing
Software testing performed without reference to internal source code or architecture, evaluating the program solely on whether supplied inputs produce the specified expected outputs.
Divide and conquer
An algorithmic approach that recursively breaks down a problem into smaller subproblems of the same type, solves them individually, and recombines the results to form the complete solution.
Backtracking
An algorithmic problem-solving approach that systematically explores solution candidates along a branch and abandons ('backtracks' from) any path as soon as it is determined not to lead to a valid solution.
Heuristics
A practical, rule-of-thumb problem-solving technique used to find an acceptable, near-optimal solution when exhaustively evaluating every possible outcome is computationally unfeasible.
Big O notation
A formal mathematical notation used to classify and characterize the efficiency and scaling behaviour of an algorithm's execution time or memory requirements as input size n grows.