CS3501 Dat

aSt
ruct
ure L-
T-P:3-
0-0;
Tot
al42Lect
ures
Pr
e-r
equi
sit
es:None
Obj
ect
ives:
 Tounder st
andt hedif
ferentdat astruct
ures.
 Tol earnwhi chdatastruct ureshouldbeusedt omaketheal
gori
thm si
mpler
,
easiert
omai ntain,
andf aster.
 Toi mprovet heprofi
ciencyofst udent sin appl
yi
ngt
hebasicknowledgeof
programmingt osolvedifferentproblems.
Cour
seOut comes:
Att
heendoft
hecour
se,
ast
udentshoul
dhav
e:
Sl
.No. Out
come
1. Under
standi
ngt
hef
undament
alsofdat
ast
ruct
ures.
2. Learni
ngthesetofoper
ati
onst
hatcanbeper
for
medont
hegi
ven
datastr
uctur
e.
3. Toimprovet
heprofi
ciencyofpr
ogrammersbyenhanci
ngt
hei
rski
l
l
ofchoosi
ngther
ightdatastr
uct
ureforapr
obl
em.
4. Tounderst
andwhichsear
chi
ngandsor
ti
ngt
echni
quebestsui
tsi
n
thegi
venscenar
io.
Uni
t1:Int
roducti
on:Char
acter
ist
icsofdat
ast r
uctures,Creati
ng,manipul
ati
ngand
operat
ingondatastr
uctur
es,Ty
pesofdat astr
uctures–l i
nearandnonl
inear
.
I
ntroduct
iontoal
gori
thms:Asymptotic notati
ons,Analysi
s of al
gori
thms:
Time complexi
tyand Space complexi
ty.
10Lect ures
Uni
t2:Arrays:1-Dar r
ays,multi
-di
mensi
onalarrays,oper ati
ng onar r
ays,Dynamic
memor yall
ocat i
on,Stor
age–Col umn maj oror derandRow maj ororder,
Addr esscal cul
ati
onof1- D,2-D,dif
ferentform ofmat ri
x,SparseMat r
ix.
Linkedlists–si ngly
,doublyandcir
cularl
ylinkedl i
sts,oper
ati
onsonl i
nked
li
sts.8Lect ures
Uni
t3:Stacks:BasicsofSt ackdatastr
ucture,Implementat
ionofstackusingarr
ay
andlinkedl
ist,Operati
onsonstacks,Applicat
ionsofStacks,
Notat
ions–infi
x,
prefi
xandpost fi
x,Conversi
onandev aluati
onofarit
hmet i
cexpr
essionsusi
ng
Stacks.5Lectures
Uni
t4:Queues:Basi
csofQueuedatastr
uct
ure,
Implementati
onofqueueusingar
ray
andlinkedli
st,Operat
ionsonqueues,Typesofqueues– queue,doubl e
endedqueue,pri
ori
tyqueueandI
mplement
ationofthese.3Lect
ures
Uni
t5:Trees&Gr aph:Bi narytree,Binar
ysear cht r
ee,Thr eadedbi narytr
ee,AVL
Tree,B Tr ee,Tries,Heaps,Hasht abl
es. Gr aphandi t
si mplementati
on,
Graphtraver sal
s:Br eadthFirstSearch,DepthFirstSear ch,SpanningTree–
Prim’
salgor i
thm andKr uskal
’salgori
thm,Shor t
estpat h-Dijkstr
a'sal
gori
thm
and Bell
man For d algorit
hm.Uni on-fi
nd data structureand appl i
cati
ons,
Topological sor
ti
ngf orDirectedAcycli
cGr aph.8Lect ures
Uni
t6:Sear
chi
ngandSor
ti
ng:Li
nearsear
ch,Bi
nar
ysear
ch,Hashi
ng.Al
gor
it
hms
 anddat
astr
ucturesf
orsort
ing:I
nser
ti
on Sort
,Bubbl
esort
,Select
ion Sor
t,
Mergesor
t,Quick Sort, Heap sort,Bucket sor
t. 8Lectur
es
TextBooks:
1.Fundamental
sofDataStr
uct
uresbyE.Hor
owi
tz,S.Sahni
,Comput
erSci
ence
Press,
2ndEdi
tion,
2008
2.DataSt
ruct
ureandPr
ogr
am Desi
gnbyR.LKr
use,Pr
ent
iceHal
l
,2ndEdi
ti
on,
1996