1/25
Vocabulary flashcards covering core concepts of data abstraction, memory organization, and standard data structures from COMP 1100.
Memory Cell
A hardware location in computer memory that stores a group of bits and is identified by a unique memory address.
Memory Address
A unique identifier assigned to each individual cell in memory hardware (RAM).
Abstraction
The conceptual simplification of a complex system that focuses on essential features while hiding lower-level implementation details.
Machine Language
A low-level language abstraction written entirely in bits (0s and 1s), making it very difficult for humans to understand directly.
Assembly Language
A mid-level language abstraction that uses human-readable mnemonics (such as ADD and MOV) closer to CPU hardware activities.
High-Level Language
A language abstraction level (such as Python, Java, or C++) designed to be easily understood and written by human programmers.
Data Abstraction
The technique of hiding how data is physically stored in memory hardware, allowing programmers to visualize and manipulate data through conceptual structures during process execution.
Primitive Type
A single data item (such as an int or float) stored in memory at one location that does not require abstraction.
Data Structure
A specialized format for organizing and storing a group of related values to perform systematic operations.
Array
A data structure that stores a fixed-size collection of elements of the same data type, providing fast random access via an index.
One-Dimensional Array (1D Array)
A linear array initialized with a fixed size to store elements of a single type, accessed using a single zero-based index.
Two-Dimensional Array (2D Array)
An array of arrays structured into rows and columns, where each element is accessed using two indices.
Row-Major Order
An indexing convention for multi-dimensional arrays where the first index specifies the row and the second index specifies the column.
List
A flexible data structure capable of growing and shrinking dynamically and storing heterogeneous elements of different data types.
Heterogeneous Elements
Elements belonging to multiple different data types (such as strings, integers, and floats) stored together in a single collection.
Queue
A data structure enforcing the First-In, First-Out (FIFO) principle, where elements are processed strictly in the order they arrive.
FIFO (First-In, First-Out)
An operational principle in which the earliest item added to the structure is the first one removed or serviced.
Stack
A data structure enforcing the Last-In, First-Out (LIFO) principle, where both insertion and removal happen at a single end called the top.
LIFO (Last-In, First-Out)
An operational principle in which the most recently added item is the first one removed.
Push
The stack operation of placing a new element onto the top of the stack.
Pop
The stack operation of removing the most recently placed element from the top of the stack.
Balanced Parentheses Checking
An algorithm that utilizes a stack to confirm that every opening parenthesis has a matching closing parenthesis in the correct order.
Tree
A non-linear data structure used to represent hierarchical relationships, consisting of nodes connected by edges.
Root Node
The topmost node in a hierarchical tree structure from which all branches descend.
Terminal Node (Leaf Node)
A node in a tree structure that has no descendant child nodes.
Subtree
A tree structure consisting of a child node and all of its descendants, contained within a larger parent tree.