DATA STRUCTURES
STUDY MATERIAL
Sai Campus Recruitment Training
Gauraverse
@gaurav._.tiwari_
@saicampustraining
2nd floor, above Apoorti Mall, Sector C, Indrapuri, Bhopal.
8319953369, 7987161229
DSA NOTES
DATA STRUCTURES :
Data Structure is a particular way of storing and organizing data in a computer’s memory
so that the data can be efficiently accessed.
What is the need of DATA STRUCTURE?
If we make any program using suitable Data Structure then it will be efficient in terms of
Time and Space complexity.
What are the various types of Data Structure ?
There are two types of Data Structure :
1. Primitive Data Structure.
2. Non-Primitive Data Structure.
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
PRIMITIVE DATA STRUCTURE :
Primitive Data Structures are those Data Structures which can
store only single value.
Example : int, float, bool, pointer, etc .
NON - PRIMITIVE DATA STRUCTURE :
Non-Primitive Data Structure are those Data Structures which are
not derived from Primitive Data Structures.
They are further categorized into two types:
1. Linear Data Structure.
2. Non-Linear Data Structure.
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
LINEAR DATA STRUCTURE :
Those Data Structure in which one element is only connected to
one other element are called Linear Data Structure.
Example : Array, Queue, Stack, Structure, linked list.
NON - LINEAR DATA STRUCTURE :
Those Data Structure in which one element is connected to multiple
element are called Non-Linear Data Structure.
Example : Tree, Graph.
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
ALGORITHM :
It is a step by step sequence to solve any problem, before writing any
program. We write various algorithm then we analysis those
algorithms on the basis of time and space complexity. The algorithm
which suits best approach is implemented using a suitable
programming language.
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
ASYMPTOTIC NOTATION :
These are the notations which determine the performance of an
algorithm in time and space complexity.
There are Three types of Asymptotic Notation :
1. Best Case (Omega, Ω)
2. Worst Case (Big Oh, Ο)
3. Average Case (Theta, )
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
CALCULATE TIME COMPEXITY
for(i=0;i<n;i++)
{
print(“Sai Campus Recruitment Training”)
}
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
CALCULATE TIME COMPEXITY
O(N)
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
CALCULATE TIME COMPEXITY
for(i=0;i<n/2;i++)
{
print(“Sai Campus Recruitment Training”)
}
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
CALCULATE TIME COMPEXITY
O(N)
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
CALCULATE TIME COMPEXITY
for(i=1;(i^2)<=n;i++)
{
print(“Sai Campus Recruitment Training”)
}
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
CALCULATE TIME COMPEXITY
O(Root n)
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
CALCULATE TIME COMPEXITY
for(i=1;i<=n;i=i*2)
{
print(“Sai Campus Recruitment Training”)
}
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
CALCULATE TIME COMPEXITY
O(log n)
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
CALCULATE TIME COMPEXITY
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
print(“Sai Campus Recruitment Training”)
}
}
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
CALCULATE TIME COMPEXITY
O(N^2)
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
CALCULATE TIME COMPEXITY DSA NOTES
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
for(k=0;k<n;k++)
{
print(“Sai Campus Recruitment Training”)
}
}
}
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
CALCULATE TIME COMPEXITY
O(N^3)
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
CALCULATE TIME COMPEXITY DSA NOTES
for(i=0;i<n;i++)
{
for(j=0;j<n;j=j*2)
{
print(“Sai Campus Recruitment Training”)
}
}
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
CALCULATE TIME COMPEXITY
O(n logn)
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
CALCULATE TIME COMPEXITY DSA NOTES
for(i=1;i<=n;i++)
{
sum=sum+i
}
print(sum)
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
CALCULATE TIME COMPEXITY
O(n)
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
CALCULATE TIME COMPEXITY DSA NOTES
n=somevalue
sum=n*(n+1)/2
print(sum)
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
CALCULATE TIME COMPEXITY
O(1)
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
CALCULATE TIME COMPEXITY DSA NOTES
a=5
b=6
a=a+b
b=a-b
a=a-b
print(a,b)
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
DSA NOTES
CALCULATE TIME COMPEXITY
O(1)
@gaurav._.tiwari_ Gauraverse 2nd floor, above Apoorti Mall,
@saicampustraining Sai Campus Recruitment Training Sector C, Indrapuri, Bhopal.
