Data Structure (Module 1)
Data Structure (Module 1)
Faculty
School of Engineering & Technology
K.R. Mangalam University
Session 1 :
Key Learning Outcome
Background
Why we use Data Structures: Understanding the significance of
Data Structure
Introduction of Data Structure and ADT
Static and Dynamic Implementations
Examples of Data Structures
Real-life applications
• Back button.[LIFO]
"A data structure is a systematic way of organizing and accessing data." - Clifford
A. Shaffer
"A data structure is a way to store and organize data in order to facilitate access
and modifications." - Cormen, Leiserson, Rivest, and Stein
"A data structure is a systematic way to organize and access data." - Robert
Sedgewick
"A data structure is a systematic way of organizing and accessing data." - Mark
Allen Weiss
Create
Selection
Updating
Destroy or Delete
The data structures that are derived from the primitive data
structures are called non-primitive data structure.
Traversal
Insertion
Selection
Searching
Array:
An array is a type of linear data structure that is defined as a
collection of elements with same or different data types. They exist
in both single dimension and multiple dimensions.
Stack:
Stack is a linear data structure that follows a particular order in
which the operations are performed. The order may be LIFO(Last
In First Out) or FILO(First In Last Out).
Queue:
A queue can be defined as an ordered list which enables insert
operations to be performed at one end called REAR and delete
operations to be performed at another end called FRONT.
Linked Lists:
A linked list is a linear data structure which can store a collection of
"nodes" connected together via links i.e. pointers. Linked lists
nodes are not stored at a contiguous location, rather they are linked
using pointers to the different memory locations. A node consists of
the data value and a pointer to the address of the next node within
the linked list.
Trees:
A tree data structure is a hierarchical structure that is used to
represent and organize data in a way that is easy to navigate and
search. It is a collection of nodes that are connected by edges and
has a hierarchical relationship between the nodes.
Graphs:
A Graph Data Structure is a collection of nodes connected by edges.
It’s used to represent relationships between different entities. Graph
algorithms are methods used to manipulate and analyze graphs,
solving various problems like finding the shortest path or detecting
cycles.