Data Structures and their Applications

These flashcards cover essential vocabulary related to data structures and their applications, aiding in understanding key concepts in algorithms.

Algorithm

A step-by-step procedure for solving a problem or performing a task.

Big-Oh Notation

A mathematical representation used to describe the performance or complexity of an algorithm in terms of time or space relative to the size of the input.

Data Structure

A way of organizing and storing data in a computer so that it can be accessed and modified efficiently.

Array

A collection of items stored at contiguous memory locations, holding a fixed number of elements of the same type.

LinkedList

A data structure consisting of a sequence of elements where each element points to the next one, allowing for dynamic size.

Stack

A linear data structure where elements are added and removed from one end, following a last-in-first-out (LIFO) order.

Queue

A linear data structure where elements are added at one end (rear) and removed from the other end (front), following a first-in-first-out (FIFO) order.

Hash Table

A data structure that maps keys to values using a hash function to compute an index into an array.

Graph

A collection of nodes (vertices) connected by edges, used to represent relationships or connections.

Path

A sequence of vertices in a graph where each consecutive pair is connected by an edge.

Directed Graph

A graph where the edges have a direction, from one vertex to another.

Undirected Graph

A graph where the edges do not have a direction and the connection between vertices is mutual.

Weighted Graph

A graph where each edge has a weight or cost associated with it, representing the distance or cost to traverse that edge.

Connectivity

A property of a graph that describes whether there is a path between any two vertices.

Complete Graph

A graph where there is an edge between every pair of vertices.

Collision

A situation in a hash table where two keys hash to the same index.

FIFO

First-In-First-Out; a principle where the first element added to a queue will be the first one to be removed.

LIFO

Last-In-First-Out; a principle where the last element added to a stack will be the first one to be removed.

Edge

A connection between two vertices in a graph.

Vertex (Node)

A fundamental unit of a graph, representing a point of connection.