This document presents an overview of different data structures, including linear and non-linear data structures. It defines data structure as a logical way of storing and retrieving data. Linear data structures discussed include arrays, stacks, queues, and linked lists. Non-linear data structures discussed are trees and graphs. For each data structure, the document describes representations and common operations like traversing, searching, insertion, and deletion.

1. MOST WEL COME

2. Presentation
on
Data Structure
Submitted To
Submitted By
Mrs. Jaspreet Kaur Navtar
Singh
(Lect.) Roll no:-
2219
BCA-
1ST(E)
Group:-
A

3. Data
Structure
And its types

4. Data
structure
It is a logical way to storing the
data and it also define
mechanism of retrieve data.

5. Types of Data Structure
Data
Structure
NON
LINEAR
LINEAR

6. Data Structure
Operation
Traversing: Accessing each record exactly once
so that certain item in the record may be processed.
Searching: finding the location of the record with
a given key value .
Insertion : add a new record to the structure
Deletion : removing a record from the structure

7. Linear Data Structure
1.Array
2.Stack
3.Queue
4.Linked List

8. Array
:-An array is a collection of
homogeneous type of data
elements.
:-An array is consisting of a
collection of elements .

9. Operation Performed On
Array
1.Traversing
2.Search
3.Insertion
4.Deletion
5.Sorting
6.Merging

10. Representation of Array
AAA 1
BBB 2
CCC 3
DDD 4
EEE 5

11. Array Representation

12. Stack
A Stack is a list of elements in
which an element may be
inserted or deleted at one end
which is known as TOP of the
stack.

14. Representation of Stack
EEE TOP
DDD
CCC
BBB
AAA
12/20/201414

15. Stack Representation
12/20/201415

16. Queue
A queue is a linear list of element in which
insertion can be done at one end which is
known as front and deletion can be done
which is known as rear.
12/20/201416

17. Operation Performed On
Queue
Insertion :AddANew Element In Queue
Deletion: Removing An Element In Queue
12/20/201417

18. Representation of Queue
55 65 75
12/20/201418

19. Queue Representation
12/20/201419

20. Linked
List
A Linked list is a linear collection of data
elements .It has two part one is info and
other is link part.info part gives
information and link part is address of
next node
12/20/201420

21. Operation Performed on
Linked List
1.Traversing
2.Searching
3.Insertion
4.Deletion
12/20/201421

22. Linked Representation
12/20/201422

23. 2.Non Linear
1.Tree
2.Graph
12/20/201423

24. Tree
In computer science, a tree is a widely-used data
structure that emulates a hierarchical tree structure
with a set of linked nodes.
12/20/201424

25. Operation On Tree
1.Insertion
2.Deletion
3.Searching
12/20/201425

26. Tree Representation
12/20/201426

27. Graph
A graph data structure may also associate to each edge some edge
value, such as a symbolic label or a numeric attribute (cost,
capacity, length, etc.).
12/20/201427

28. Operation Performed
Graph
1.Searching
2.Insertion
3.Deletion
12/20/201428

29. Graph Representation
12/20/201429

30. BABA FARID GROUP
OF
INSTITUTIONS
(BATHINDA)
12/20/201430

31. THANKS FOR YOUR
VISIT
NAVTAR SIDHU
ROLL NO:2219
BCA=1ST (E)SEM 2ND
BABA FARID GROUP OF INSTITUTIONS
BATHINDA
12/20/201431