IB Comp Sci SL Unit 4

Abstract Data Type (ADT)

A high-level description of a data structure that defines its behavior (operations) without specifying its implementation details.

Stack

A data structure that follows the Last In, First Out (LIFO) principle, where elements are added and removed from the same end (top).

Queue

A data structure that follows the First In, First Out (FIFO) principle, where elements are added at the rear and removed from the front.

Tree

A hierarchical data structure consisting of nodes connected by edges, often used to represent relationships.

Abstraction

The process of simplifying complex systems by focusing on essential features and ignoring unnecessary details. E.g. two cats and two dogs = four animals

Modularity

The practice of dividing software into smaller, self-contained units (modules) that can be independently developed and maintained.

Concurrency

The ability of a system to execute multiple tasks seemingly at the same time, typically by interleaving their execution.

Parallel Processing

The simultaneous execution of multiple tasks using multiple cores or processors.

Deadlock

A situation where two or more processes are blocked indefinitely, waiting for each other to release resources. (also a transformer!!! 😋 )

Encapsulation

The bundling of data and methods that operate on that data within a single unit (class).