Introduction to Data Structures and Algorithms

Vocabulary flashcards covering core concepts of data structures, abstract data types, algorithms, and flowchart symbols.

Data Structures

A particular way of organizing data in a computer to 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.

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 array index or key.

List

An abstract data type representing a sequence of values where the same value may occur more than once, serving as a computer representation of a finite sequence.

Linked List

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

Stack

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

Overflow State

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

Peek (or Top)

An operation on a stack that returns the value of the top element without removing it from the structure.

Queue

A First-In-First-Out (FIFO) linear data structure where entities are added to 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 position in a hash table.

Hash Table

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

Slot

A position in a hash table, denoted by the variable $M$, with slots numbered from $0$ to $M - 1$.

Hash Function

The function that performs a calculation on a search key $K$ to identify its corresponding slot in a hash table.

Trees

A hierarchical data structure made up of nodes (vertices) and edges without any cycles, starting at a root node.

Abstract Data Type (ADT)

A mathematical model for a class of data structures with similar behavior, defined solely by the operations that may be performed on it and mathematical pre-conditions and constraints on those operations.

Algorithm

A finite sequence of simple and definite steps for accomplishing a computational task that takes input values, manipulates them, and produces output values before terminating.

Human Language

A method of expressing an algorithm using plain, natural language instead of formal programming code or mathematical notation.

Pseudocode

An informal high-level description of the operating principle of an algorithm or program, using structural conventions of programming languages intended for human reading.

Flowchart

A diagrammatic representation of an algorithm, workflow, or process showing steps in boxes connected by arrows.

Terminal Symbol

A flowchart symbol that shows the start and end of a set of computer-related processes.

Input/Output Symbol

A flowchart symbol used to show any input or output operation.

Computer Processing Symbol

A flowchart symbol that shows any processing performed by a computer system.

Predefined Processing Symbol

A flowchart symbol indicating any process not specially defined in the flowchart.

Comment Symbol

A flowchart symbol used for writing any explanatory statement required to clarify something.

Flow Line

A flowchart element used for connecting symbols to indicate the order of execution.

Decision Symbol

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

On-page Connector

A flowchart symbol that connects parts of a flowchart continued on the same page.

Off-page Connector

A flowchart symbol that connects parts of a flowchart and continues to separate pages.

Document Input/Output Symbol

A flowchart symbol used when input comes from a document and output goes to a document.