This document provides an overview of classic data structures, including their classification and implementation. It discusses that classic data structures can be classified as either linear or non-linear. Linear data structures like arrays and linked lists have elements arranged sequentially, while non-linear structures like trees and graphs store elements in a non-sequential manner. It also outlines common data structures like stacks, queues, trees and graphs, describing their properties and usages. Finally, it notes that implementing data structures involves determining their storage representation and defining algorithms to manipulate them.

1. Date structures
algorithms
submitted by
n.nagajothi
1 M.Sc. It
1

2. Over viwe of data structers
➜ A few data structures are frequently use
in almost all application areas and with
the help of which almost all complex
data structures can be construct .
➜ These data structures are know as
fundamental data structures or classic
data structures
2

3. Classification of classic data
structure
3
Data
Structure
Non-Linear
Data Structure
Linear Data
Structure
Array Stack Tree Graphs

4. “
Classic data structures are
classified into two main class:
 Linear data structures
 Non-Linear data structure
4

5. Classic data Structure
Non-linear data structures
 Data structures where
data elements are not
arranged sequentially or
linearly are called non-
linear data structures.
 In a non-linear data
structure, single level is
not involved
linear data structure
 Data structure where data
elements are arranged
sequentially or linearly
where the elements are
attached to its previous
and next adjacent in what
is called a linear data
structure.
 In a linear data structure,
single level is involved
5

6. Array
 An array is a data
structure for storing
more than one data
item that has a similar
data type.
6

7. 7
Stack
 Stack is a linear data
structure which 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).

8. 8
Queue
 A Queue is a linear
structure which follows a
particular order in which
the operations are
performed.
 The order is First In First
Out (FIFO) ...

9. 9
Link list
 A linked list is a
sequence of data
structures, which are
connected together via
links

10. 10
Tree
 A tree data structure is
a non-linear data
structure because it
does not store in a
sequential manner.
 It is a hierarchical
structure as elements in
a Tree are arranged in
multiple levels

11. 11
Graphs
 A Graph is a non-
linear data
structure consisting of
nodes and edges.
 The nodes are
sometimes also referred
to as vertices and the
edges

12. 12
Hash tables
➜ Hash Table is a data
structure which stores
data in an associative
manner.

13. 13
Sets
 A set is a collection of
objects need not to be in
any particular order.

14. “
Implementation of data
structures
 Storage representation
 Algorithmic notion of various
operation of the classic data
structure
14

15. Phase 1
 How a data structrure
can be stored in a
computer memery.
 Is based on the use of
other data structure
Two phase are
Phase 2
 A function for manipulating a
data structure is expressed in
treams of algorithems.
 It will be use C/C++.
 Different statements to use:
if(condition)then(condition)
 else(condition),while(condition
)do,for(initialization,condition,u
pdata)do…
15

16. Thank you
16