Introduction to Data Structures and Algorithms

Data Structure

A particular way of organizing data in a computer so that it can be used efficiently, representing values in memory specified by pointers.

Pointer

A bit string representing a memory address that can be stored in memory and manipulated by a computer program.

Array

A fixed-length, ordered collection of values of the same type stored in contiguous memory locations, 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; serves as a container structure.

Linked List

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

Flashcard #6Term: Stack

Definition: A Last-In-First-Out (LIFO) abstract data type where addition (push) and removal (pop) operations occur exclusively at the top.

Flashcard #7Term: Queue

Definition: 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.

Flashcard #8Term: Hashing

Definition: A method for storing and retrieving records from a database by performing a computation on a search key to identify its table position.

Flashcard #9Term: Slot

Definition: A position in a hash table where records are placed, typically indexed from

0

0 to

M

−

1

M−1 where

M

M is the total number of positions.

Flashcard #10Term: Tree

Definition: A hierarchical, non-cyclic data structure consisting of a root node and potential child nodes connected by edges.

Flashcard #11Term: Abstract Data Type (ADT)

Definition: A mathematical model for data structures defined solely by the operations that may be performed on it and constraints on those operations.

Flashcard #12Term: Algorithm

Definition: A finite sequence of exact and unambiguous steps for executing a computational task that eventually terminates.

Flashcard #13Term: Pseudocode

Definition: An informal high-level description of an algorithm that uses structural conventions of programming languages intended for human reading.

Flashcard #14Term: Flowchart

Definition: A diagrammatic representation of an algorithm or process that displays steps inside various box shapes connected by directional arrows.

Flashcard #15Term: Terminal Symbol (Flowchart)

Definition: A flowchart symbol that displays the start and end points of a process set.

Flashcard #16Term: Decision Symbol (Flowchart)

Definition: A flowchart symbol used to indicate a point in the process where a choice must be made to determine the next action.