Data Structures

Vocabulary-style flashcards based on Mr. J.I. Magutorima's lecture on Data Structures, covering definitions, classifications, and fundamental operations.

Data structure

A storage that is used to store and organize data; it is a way of arranging data on a computer so that it can be accessed and updated efficiently.

Logical or Mathematical model

A particular organization of data is called a data structure.

Data structure vs. Data types

Data structure is slightly different from data types; it is the collection of data types arranged in a specific order.

Primitive Data Structure

Basic data structures which include Integer, Boolean, Character, and Float.

Non-primitive Data Structure

Higher-level data structures categorized into Linear (Arrays, Linked List, Queue, Stack) and Non-Linear (Tree, Graph).

Linear Data Structure

A structure where elements are arranged in sequence one after the other in a particular order, making them easy to implement.

Array Data Structure

A container which can hold a fix number of items of the same type arranged in continuous memory, often referenced by a set of $n$ consecutive numbers, usually $1, 2, 3 ... n$.

Stack Data Structure

A linear data structure where elements are stored based on the LIFO principle, similar to a pile of plates.

LIFO

Last In First Out; the principle where the last element stored in a stack will be removed first.

Queue Data Structure

A linear data structure working on the FIFO principle, where the first element stored in the queue will be removed first.

FIFO

First In First Out; a principle where the first element in a sequence (like a queue of people) is the first to be processed.

Linked List Data Structure

A linear collection of data elements called nodes, where the order is given by means of pointers.

Node (in Linked List)

A list element containing data and a reference (address) to the next element of the list.

Non Linear Data Structure

A structure where elements are not in sequence but arranged in a hierarchical manner where one element connects to one or more elements.

Graph Data Structure

A non-linear structure where each node is called a vertex and each vertex is connected to other vertices through edges.

Vertex

The name for each node within a graph data structure.

Trees Data Structure

A collection of vertices and edges similar to a graph, but there can only be one edge between two vertices.

Traversing

Accessing each record/node exactly once so that certain items in the record may be processed.

Searching

Finding the location of the desired node within a structure using a given key value.

Inserting

A data structure operation involving removing a node/record from the structure.

Sorting

Arranging data items in a structure in a particular order, such as ascending or descending.

Deleting

Removing a node/record from the structure.

Merging

Combining records of two different sorted files into a single sorted file.