31/07/21 MBA//Kujur/CAM/U 2/DS 1

Strategic Productiv
e

Business Appropriat
Qualitativ e
e Data
& Timely

Operational Accessible

Fig:- Nature of Business Data.

31/07/21 MBA//Kujur/CAM/U 2/DS 2
 DATA STRUCTURE

Definition:

The way of organising data that considers, not

only the items stored but also their relationship with
each other.

31/07/21 MBA//Kujur/CAM/U 2/DS 3

 Factors for Designing Data Structure

a) Relationship between the data items.

b) Rapid access & retrieval of related data.

c) Ease to modification of data.

d) Cost & other factors i.e. user, programmer,

time, etc.

31/07/21 MBA//Kujur/CAM/U 2/DS 4

 Basic Data Structure Operations

Searchin Accessing
g

Separati Data Sorting

ng Operations

Combinin Inserting
g Deleting

Fig:- Basic Data Structure Operations.

31/07/21 MBA//Kujur/CAM/U 2/DS 5
 Kinds of Data Structure
Tables Stacks

Data
Arrays Structure Linked
Lists

Queues Trees

Fig :- Kinds of Data Structure

31/07/21 MBA//Kujur/CAM/U 2/DS 6

 Kinds of Data Structure
Tables Stacks

Data
Arrays Structure Linked
Lists

Queues Trees

Fig :- Kinds of Data Structure

31/07/21 MBA//Kujur/CAM/U 2/DS BACK 7

Tables
• The data can be presented in the form of a
table i.e. rows & columns

1. Simple Table with one 2. Table having two arguments

argument
Age in years Frequency Wt. 46 - 50 51 - 55 56 - 60
Age in yrs\
Below 30 12 Below 30 2 8 11
31 - 33 8 31 - 33 6 10 4
34 - 36 10 34 - 36 1 5 7
37 - 39 5 37 - 39 4 8 9

31/07/21 MBA//Kujur/CAM/U 2/DS BACK 8

Arrays
• It is a set of data items of the same type, stored
together.
Numeric Array String Array
List of values, where each one is a List of values, where each one is a
numeric value. string value.
Eg:- Number of employees Eg:- Name of an employee

1. Single dimensional array

54 45 67 35 48 62

2. Multi - dimensional
array 54 45 67
35 48 62

31/07/21 MBA//Kujur/CAM/U 2/DS BACK 9

Queues
• It is used for temporary storage and has the
characteristics that an element can only be added to
one end, and can be removed from the opposite end.
• Thus, a queue follows First In First Out (FIFO)
discipline.

Front Rear

A B C D E F G

31/07/21 MBA//Kujur/CAM/U 2/DS BACK 10

Stacks
• A stack is capable of G
holding a series of items to F
be processed, on a Last In
E
First Out (LIFO) basis.
D
• Adding items to the stack is
called pushing in & C
removing the item is called B
popping out
A

31/07/21 MBA//Kujur/CAM/U 2/DS BACK 11

Linked Lists
• In this structure, each record has an extra field called pointer
or link, giving address of logically following record.
• Thus, a list makes use of a pointer which starts from one data
item & points the following data item.
Physical representation of Linked List
Address 1 Address 2 Address 3

Double Linked List

Add 1 Add 2 Add 3

Circular Linked List

Add 1 Add 2 Add 3

31/07/21 MBA//Kujur/CAM/U 2/DS BACK 12

Tree structure
• Each junction in a tree is called node & each node is
connected to one parent node & one or more descendent .
• Removal of parent node forms one or more sub-trees.
• The number of sub trees of a node is its degree.

Populatio
n

Male Female

Employe Unemploye Employe Unemploye

d d d d

31/07/21 MBA//Kujur/CAM/U 2/DS BACK 13