COMP 1100: Chapter 8 - Data Abstraction

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/25

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering core concepts of data abstraction, memory organization, and standard data structures from COMP 1100.

26 Terms

1
New cards

Memory Cell

A hardware location in computer memory that stores a group of bits and is identified by a unique memory address.

2
New cards

Memory Address

A unique identifier assigned to each individual cell in memory hardware (RAM).

3
New cards

Abstraction

The conceptual simplification of a complex system that focuses on essential features while hiding lower-level implementation details.

4
New cards

Machine Language

A low-level language abstraction written entirely in bits (00s and 11s), making it very difficult for humans to understand directly.

5
New cards

Assembly Language

A mid-level language abstraction that uses human-readable mnemonics (such as ADD and MOV) closer to CPU hardware activities.

6
New cards

High-Level Language

A language abstraction level (such as Python, Java, or C++) designed to be easily understood and written by human programmers.

7
New cards

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.

8
New cards

Primitive Type

A single data item (such as an int or float) stored in memory at one location that does not require abstraction.

9
New cards

Data Structure

A specialized format for organizing and storing a group of related values to perform systematic operations.

10
New cards

Array

A data structure that stores a fixed-size collection of elements of the same data type, providing fast random access via an index.

11
New cards

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.

12
New cards

Two-Dimensional Array (2D Array)

An array of arrays structured into rows and columns, where each element is accessed using two indices.

13
New cards

Row-Major Order

An indexing convention for multi-dimensional arrays where the first index specifies the row and the second index specifies the column.

14
New cards

List

A flexible data structure capable of growing and shrinking dynamically and storing heterogeneous elements of different data types.

15
New cards

Heterogeneous Elements

Elements belonging to multiple different data types (such as strings, integers, and floats) stored together in a single collection.

16
New cards

Queue

A data structure enforcing the First-In, First-Out (FIFO) principle, where elements are processed strictly in the order they arrive.

17
New cards

FIFO (First-In, First-Out)

An operational principle in which the earliest item added to the structure is the first one removed or serviced.

18
New cards

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.

19
New cards

LIFO (Last-In, First-Out)

An operational principle in which the most recently added item is the first one removed.

20
New cards

Push

The stack operation of placing a new element onto the top of the stack.

21
New cards

Pop

The stack operation of removing the most recently placed element from the top of the stack.

22
New cards

Balanced Parentheses Checking

An algorithm that utilizes a stack to confirm that every opening parenthesis has a matching closing parenthesis in the correct order.

23
New cards

Tree

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

24
New cards

Root Node

The topmost node in a hierarchical tree structure from which all branches descend.

25
New cards

Terminal Node (Leaf Node)

A node in a tree structure that has no descendant child nodes.

26
New cards

Subtree

A tree structure consisting of a child node and all of its descendants, contained within a larger parent tree.