Introduction to Data Structures and Algorithms

A set of vocabulary flashcards keying in on core data structures, abstract data types, algorithm characteristics, and flowchart symbols from the lecture notes.

Data Structures

A particular way of organizing data in a computer so that it can be used efficiently, representing the arrangement of data in memory locations for an abstract data type's carrier set.

Pointer

A bit string representing a memory address that can be stored in memory and manipulated by a program, used to fetch and store data at any location in memory.

Array

A fixed-length, ordered collection of values of the same type stored in contiguous memory locations, where each element is identified by at least one index or key.

List

An abstract data type representing a sequence of values where the same value may occur more than once.

Linked List

A data structure consisting of chains of nodes where each node contains data and a reference (link) to the next node in the sequence.

Stack

A Last-In-First-Out (LIFO) abstract data type where addition (push) and removal (pop) operations occur only at one end, referred to as the top.

Overflow State

The condition of a stack when it does not contain enough space to accept an entity being pushed into it.

Peek

A stack operation that returns the value of the top element without removing it from the structure.

Queue

A First-In-First-Out (FIFO) linear abstract data type where entities are added at the rear terminal position and removed from the front terminal position.

Hashing

A method for storing and retrieving records from a database by performing a computation on a search key $K$ to identify its target position in a hash table.

Hash Table

An array used in a hashing system to store records based on address calculations.

Hash Function

The function that performs calculations on a search key to determine its position in a hash table.

Slot

A position in a hash table, numbered from $0$ to $M - 1$, where $M$ represents the total number of slots.

Tree

A hierarchical data structure made up of nodes (vertices) and edges with no cycles, consisting of a root node and potential levels of additional child nodes.

Abstract Data Type (ADT)

A mathematical model for a class of data structures defined only by the operations that may be performed on it and mathematical pre-conditions and constraints.

Algorithm

A finite sequence of simple, definite steps for accomplishing a computational task that accepts input data, manipulates it, and terminates after producing an output.

Pseudocode

An informal high-level description of the operating principle of a computer program that uses structural conventions of a programming language intended for human reading.

Flowchart

A diagram representing an algorithm, workflow, or process using boxes of various kinds connected by arrows to illustrate the sequence of steps.

Terminal Symbol

A flowchart symbol used to show the start and end of a set of computer-related processes.

Decision Symbol

A flowchart symbol indicating a point in a process where a decision must be made to determine further action.

On-page Connector

A flowchart symbol used to connect parts of a flowchart that continue on the same page.

Off-page Connector

A flowchart symbol used to connect parts of a flowchart that continue to separate pages.