CS A200 – Data Structures Introduction

Vocabulary terms and definitions covering the fundamentals of data structures, algorithms, data abstraction, ADTs, and pseudocode conventions.

Data Structure

A specific way to store and organize data in a computer so that it can be used efficiently.

Linear Data Structures

A category of data structures that includes arrays and linked lists.

Programming Algorithm

A set of exact steps needed for a computer to solve a problem or reach a goal, analogous to a recipe.

Procedure

A process that lists the input needed and a set of steps to produce a specific output.

Data Abstraction

The practice of separating the "logical view" of data from the "physical view" of how it is actually stored.

Logical View

The conceptual representation of data, such as a numeric value or a sequence of elements.

Physical View

The actual storage of data in memory, such as binary 2’s complement for numbers or a linked list/vector for a list.

Abstract Data Type (ADT)

A high-level definition of data types that specifies a collection of data and a set of operations without specifying the implementation.

Pseudocode

A high-level description of an algorithm that combines natural language (like English) with familiar programming language structures.

Assignment Operator (Formal Pseudocode)

Represented by the left arrow sign $\leftarrow$, which is equivalent to the $=$ operator in C++.

Equality Relation (Formal Pseudocode)

Represented by the equal sign $=$, which is equivalent to the $==$ operator in C++.

Array Indexing (Pseudocode)

For an $n$-celled array $A$, cells are indexed from $A[0]$ to $A[n - 1]$.

Function Returns (Pseudocode)

The operation used to send a value back to the function that called the current function.

Indentation (Pseudocode)

Used in structures like IF/ELSE, WHILE, and FOR loops to indicate which actions are included within that block.