A stack is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO (Last In First Out) or FILO (First In Last Out).

A queue is a linear data structure that follows a particular order in which the operations are performed. The order is FIFO (First In First Out).

A tree is a non-linear data structure used to represent hierarchical data. It consists of nodes, with one being the root, and each node having zero or more child nodes.

Finding items in a tree typically involves traversal algorithms such as in-order, pre-order, and post-order traversal.

Logic problems involve reasoning through a set of premises to arrive at a valid conclusion. They are solved using logical deduction.

Big O notation describes the upper bound of the time complexity of an algorithm, providing a worst-case scenario of its growth rate.

Tractable problems can be solved in polynomial time, whereas intractable problems cannot be solved in polynomial time and are typically NP-hard.

Sound representation involves converting sound waves into digital format using sampling, quantization, and encoding processes.

Normalised floating point binary numbers are used to represent real numbers in a way that can support a wide range of values using a fixed number of bits.

Ciphers are algorithms for performing encryption or decryption—a series of well-defined steps that can be followed as a procedure to secure data.

Databases are organized collections of data, typically stored and accessed electronically from a computer system.

CPU architecture refers to the design and organization of the central processing unit, including its components and the way it processes instructions.

The fetch-execute cycle is the basic operational process of a computer, where it fetches an instruction from memory and then executes it.

Factors include clock speed, core count, cache size, and instruction set efficiency.

Interrupts are signals that inform the CPU to stop and execute a task, usually as a result of an external event like input from a user.

Machine code is the lowest-level programming language, consisting of binary code. Assembly language is a low-level language with a more human-readable format.

Truth tables are used to represent the output of logic gates and circuits for all possible input combinations.

Logic gates are basic building blocks of digital circuits, implementing Boolean functions like AND, OR, and NOT.

Half-adders add two single binary digits, while full-adders add three binary digits, accounting for carry input.

Simplifying Boolean equations involves reducing expressions using Boolean algebra rules to minimize the number of logic gates needed.

Additional content for this flashcard.

Additional content for this flashcard.

Additional content for this flashcard.

Additional content for this flashcard.

Additional content for this flashcard.

Additional content for this flashcard.

Additional content for this flashcard.

Additional content for this flashcard.

Additional content for this flashcard.