Introduction to Data Structures and Algorithms – Vocabulary Flashcards

Vocabulary flashcards covering core terms from the lecture notes on data structures, ADTs, algorithms, and flowcharts.

Data structures

A way of organizing data in memory to represent values of an abstract data type and enable efficient access and manipulation.

Abstract Data Type (ADT)

A mathematical model defining a class of data structures by their behavior (operations) and constraints, independent of implementation.

Array

Fixed-length, ordered collection of elements of the same type stored contiguously; 1D or 2D (matrix); indexed.

List

Abstract data type representing a sequence of values (duplicates allowed); has two families: front-focused and random-access interfaces.

Linked List

Chain of nodes with data and a link to the next node; allows efficient insertion/removal without contiguous storage.

Stack

Abstract data type implementing LIFO; operations: push (add), pop (remove), and top/peek; may overflow when full.

Queue

Abstract data type implementing FIFO; enqueue (add to rear) and dequeue (remove from front).

Hashing

Storing and retrieving records using a hash table and a hash function to map keys to slots.

Hash table

An array of slots where records are stored according to the hash function.

Slot

A position in a hash table, numbered from 0 to M-1.

Tree

A data structure of nodes connected by edges with no cycles; hierarchical with a root and children.

Root

The top node of a tree from which all other nodes descend.

Node

An element in a tree or graph containing data and references to other nodes (children/links).

Flowchart

A diagram showing an algorithm, workflow, or process using symbols connected by arrows.

Algorithm

A finite sequence of precise steps to solve a computational task; must terminate.

Pseudocode

An informal high-level description of an algorithm using a programming-like structure, readable by humans.

Human language

Expressing an algorithm in plain, natural language rather than formal code.

Terminal symbol

Flowchart symbol that marks the start or end of a process.

Input/Output (flowchart symbol)

Flowchart symbol representing input or output operations.

Processing (flowchart symbol)

Flowchart symbol representing a computation or processing step.

Decision symbol

Flowchart symbol indicating a point where a decision affects the next step.

On-page Connector

Flowchart symbol that connects flow lines within the same page.

Off-page Connector

Flowchart symbol that continues a flow line on a different page.

FIFO

First-In-First-Out ordering used by queues.

LIFO

Last-In-First-Out ordering used by stacks.

Hash function

Function that computes a hash index from a key to locate a record in a hash table.

Overflow

Condition when a data structure (like a stack) cannot accept more elements due to lack of space.

Null / Empty tree

A tree with no nodes.