Data
Structure
Notes
(Short –
English)
1. Data
Structure
A data
structure
is a way
of
organizing
and
storing
data so
that it can
be
accessed
and
modified
efficiently
.
2. Types
of Data
Structure
s
(a)
Primitive
Data
Structure
s
Basic data
types.
Examples
: int, float,
char
(b) Non-
Primitive
Data
Structure
s
Complex
data
structures.
Examples
: Array,
Linked
List,
Stack,
Queue,
Tree,
Graph
3. Linear
Data
Structure
s
Data
elements
are
arranged
sequential
ly.
Examples
: Array,
Stack,
Queue,
Linked
List
4. Non-
Linear
Data
Structure
s
Data
elements
are not
arranged
sequential
ly.
Examples
: Tree,
Graph
5. Array
An array
is a
collection
of similar
data types
stored at
contiguou
s memory
locations.
6. Linked
List
A linked
list is a
collection
of nodes
where
each node
contains
data and a
pointer.
7. Stack
Stack
follows
LIFO
(Last In
First Out)
principle.
Operatio
ns: Push,
Pop
8. Queue
Queue
follows
FIFO
(First In
First Out)
principle.
Operatio
ns:
Enqueue,
Dequeue
9. Tree
A tree is a
hierarchic
al data
structure.
Example:
Binary
Tree
10.
Graph
A graph
consists of
nodes
(vertices)
and edges.
11.
Searching
Techniqu
es
•Linear
Search
• Binary
Search
12.
Sorting
Techniqu
es
•Bubble
Sort
• Selection
Sort
• Insertion
Sort
13.
Advantag
es of Data
Structure
s
• Efficient
data
managem
ent
• Faster
data
access
• Better
memory
utilizatio
n
14.
Exam-
Oriented
Questions
1. Define
data
structure.
2. What is
stack?
3. Explain
queue.
4. Differe
ntiate
between
array and
linked
list.
5. What is
binary
search?