Institute / School Name Chitkara Institute of Engineering & Technology/ School of Computer

Sciences
Program Name BE CSE
Course Code CSL521
Course Name !ata Structures
Lecture / Tutorial (per
week)
"#1# Course Credits "$5
Course Coordinator
Name
Er$ Su%ha &oyal
1. Scope and !"ecti#es o$ the Course
1$ The course aims at 'uil%ing the foun%ation of 'asic %ata structures that acts as a preliminary
step for programming$
2$ The course attempts to prepare the stu%ents to 'e familiar (ith 'asic techni)ue of algorithm
analysis$
*$ +t the en% of this course, stu%ents shoul% 'e a'le to %e-elop the logics 'y using the concepts
of %ata structures in real life situations$
"$ Stu%ents (oul% 'e a'le to analy.e pro'lems an% (riting program solutions to pro'lems$
%. Te&t!ooks
T'1( )!ata Structures/ 'y Schaums/ 0utlines In%ian +%apte% E%ition 21 'y Seymour Lipschut.,
2u'lishe% By Tata 3c&ra(#4ill E%ition$

*. +e$erence 'ooks
+'1( Tanen'aum, +ugenstein, & Langsam, ,ata Structures using C and C--, 2rentice 4all of
In%ia, Secon% e%ition
+'%( 5ichar% &il'erg, Behrou. 6orou.an, !ata Structures, Secon% e%ition
.. ther readings and rele#ant we!sites
S$7o$ Link o$ /ournals0 1aga2ines0 we!sites and +esearch Papers
1$ http8//nptel$iitm$ac$in/-i%eo$php9su':ectI%;11121"
2$ http8//%l$acm$org/citation$cfm9
i%;21**<*&picke%;pro=&C6I!;1212>**&C6T0?E7;<@1"5**

Page 1 of 5
3. Course Plan
Lecture
Num!er
Topics Te&t 'ook /
+e$erence
'ook /
ther
reading
material
Page
num!ers o$
Te&t 'ook(s)
1 Intro%uction8 Basic Terminology, Elementary !ata
0rgani.ation,
TB1
Link2
1$1#1$2
2#* !ata Structures an% 0perations, +lgorithm 8 Comple=ity,
Time#Space Tra%eoff, +symptotic 7otations for
Comple=ityA B ,C, 0D,
TB1 1$*#1$12
2$1"#2$1>
"#5 +rray8 Intro%uction, 5epresentation of Linear +rrays in
3emory, Tra-ersing Linear +rrays, +rrays8 Inserting an%
!eleting Aat Beginning, mi%%le an% at the en%D
TB1
5B1
"$1#"$<
"#55
1#@ Searching8 Linear an% Binary Search (ith their
Comple=ity
TB1
5B1
"$12#"$1@
1*<#1"1
< Sorting8 Bu''le Sort & its Comple=ity, TB1 "$>#"$11
>#1 Linke% List8 Intro%uction & its memory representation,
Tra-ersing a Linke% List,
TB1
5B1
Link1
5$1#5$>
22#21
11#12 Insertion into Linke% List Asorte% an% unsorte% Linke%
ListD
I4C51
TB1 5$1@#5$2*
1* !eleting from Linke% List, TB1 5$2"#5$*1
1" 0perations on !ou'ly Linke% List, TB1 5$*5#5$"
15 Circular linke% List & its applications, TB1 5$*1#5$*5
11#1@ Stacks & Eueues8 +rray an% Linke% representation of
Stacks,
TB1
5B1
Link1
1$1#1$<
>*#11
1<#1> Implementations of recursi-e an% non recursi-e
proce%ures 'y Stacks,
TB1
5B1
1$21#1$*1
12#111
2 +pplications8 +rithmetic E=pressions TB1
5B1
1$>#1$11
111#11*
ST51
21 2olish 7otation8 E-aluation of +rithmetic E=pressions TB1
5B1
1$>#1$11
111#11*
22 Transforming Infi= E=pressions into 2ostfi= E=pressions TB1
5B1
1$11#1$1"
11"#125
2*#2" Eueues 8 5epresentation as +rray an% Linke% List,
!e)ues, 2riority Eueues
I4C5%
TB1
5B1
1$*2#1$"*
1>#2
25#2< Sorting Techni)ues#Euick sort , 3erge Sort , 5a%i= Sort,
Selection Sort, Insertion Sort & their comple=ity,
TB1
5B1
1$1"#1$1<
>$2#>$1<
*5<#*11
*<1#*<2
*<>#*>@
Page 2 of 5
2> Trees8 Binary trees, complete 'inary trees, TB1
Link1
@$1#@$"
* Binary Search Trees, !ata structures for representing
'inary trees$
TB1 @$5#@$>
*1#*2 Insertion, %eletion an% searching in these trees$ TB1 @$2"#@$*5
**#*" Tree Tra-ersal8 preor%er, In or%er, 2ost or%er an% their
algorithms,
TB1 @$>#@$1>
*5#*1 Balance% 'inary Trees, +FL trees, TB1 @$*5#@$*1
ST5%
*@#*< insertion an% !eletion in +FL tree, 4eaps TB1
5B2
@$*1#@$"@
*"<#*51
*> !ifference 'et(een heap an% +rray, insertion an%
%eletion in heap$
TB1 @$55#@$12
" 4eap sort an% its applications, TB1 @$1*#@$15
"1#"2 &raphs8 Basic terminology, %irecte% an% un%irecte%
graphs, notion of path$
TB1 <$1#<$5
"* 5epresentation of graphs8 e%ge list structures, a%:acency
list structures, a%:acency matri=$
TB1 <$5#<$<
""#"5 Linke% List representation of &raph, 0perations on &raph
I4C5*
TB1 <$12#<$2
"1#"@ &raph tra-ersals8 !6S, B6S, TB1 <$21#<$25
"< 4ashing8 Techni)ues, Collision an% its resol-ing$ TB1 >$2#>$25
ST5*
6. Tutorial Plan
Tutorial
Num!er
Topics
1 2ro'lem sol-ing on +symptotic notation of comple=ity
2 6in%ing comple=ity of search an% 'u''le sort algorithms
* 5eal life pro'lems relate% to linke% list an% %esign an algorithm to insert a no%e into the
linke% list
" I4C51
5 Implementation of stack an% )ueue using array an% Linke% list (ith the help of
e=amples
1 !iscuss on the usage of stack for E-aluating +rithmetic E=pressions
@ I4C5%
< Implementation of 'inary an% 'inary search tree an% insertion an% %eletion of no%es
using linke% list
> Tra-ersal of Binary search tree (ith e=ample
1 E=amples 'ase% on %ifferent sorting techni)ues
Page 3 of 5
11 I4C5*
12 Tra-ersal of graph (ith suita'le e=ample
7. 4#aluation Scheme(
Component 1 Eui..es /+ssignments/ Class Test 2
Component 2G Sessional Tests ASTsDG 2
Component *GG En% Term E=aminationGG 1
Total 188
9 There are three Sessional Tests ASTsD for all theory papers$ The a-erage of 'est t(o (ill 'e
consi%ere%$
99 The En% Term Comprehensi-e e=amination (ill 'e hel% at the en% of semester$ The man%atory
re)uirement of @5H atten%ance in all theory classes is to 'e met for 'eing eligi'le to appear in this
component$
:. ,etails o$ 4#aluation Component 1
,escription ,uratio
n
1arks To !e held in
week
+emarks
Test 2 3in 2 "
th
Ieek Euestions (ill 'e of +nalytical type
Eui. 15 3in 2 <
th
(eek 3CEs
+ssignment
Test
" 3in 2 11
th
(eek !escripti-e / Short J long ans(er
S;LL<'=S
Contents Lectures >eightage(?age)
Intro%uction8 Basic Terminology, Elementary !ata 0rgani.ation, 1
*
!ata Structures an% 0perations, +lgorithm 8 Comple=ity, Time#
Space Tra%eoff, +symptotic 7otations for Comple=ityA B ,C, 0D,
2
+rray8 Intro%uction, 5epresentation of Linear +rrays in 3emory,
Tra-ersing Linear +rrays,
1
+rrays8 Inserting an% !eleting Aat Beginning, mi%%le an% at the en%D 1
Searching8 Linear an% Binary Search (ith their Comple=ity 2
Sorting8 Bu''le Sort & its Comple=ity, 1
Linke% List8 Intro%uction & its memory representation, Tra-ersing a
Linke% List, Insertion into Linke% List Asorte% an% unsorte% Linke%
ListD, !eleting from Linke% List, 0perations on !ou'ly Linke% List,,
Circular linke% List & its applications,
@
Stacks & Eueues8 +rray an% Linke% representation of Stacks,
Implementations of recursi-e an% non recursi-e proce%ures 'y
Stacks,
* *
+pplications8 +rithmetic E=pressions, 2olish 7otation, Transforming
Infi= E=pressions into 2ostfi= E=pressions,
"
Eueues 8 5epresentation as +rray an% Linke% List !e)ues, 2riority
Eueues, Sorting Techni)ues#Euick sort , 3erge Sort , 5a%i= Sort,
1
Page 4 of 5
Selection Sort, Insertion Sort & their comple=ity,
Trees8 Binary trees, complete 'inary trees, Binary Search Trees,
!ata structures for representing 'inary trees$ Insertion, %eletion an%
searching in these trees$
"
25
Tree Tra-ersal8 preor%er, In or%er, 2ost or%er an% their algorithms, 2
Balance% 'inary Trees, +FL trees, insertion an% !eletion in +FL
tree, 4eaps, !ifference 'et(een heap an% +rray, insertion an%
%eletion in heap$
4eap sort an% its applications
5
&raphs8 Basic terminology, %irecte% an% un%irecte% graphs, notion
of path$
2
15
5epresentation of graphs8 e%ge list structures, a%:acency list
structures, a%:acency matri=$
1
Linke% List representation of &raph, 0perations on &raph, 2
&raph tra-ersals8 !6S, B6S, 2
4ashing8 Techni)ues, Collision an% its resol-ing$ 1
This ,ocument is appro#ed !@(
,esignation Name Signature
Course Coor%inator Er$ Su%ha &oyal
2rogram In charge Er$ Su%ha &oyal
!eputy !ean Er$ 3eenu ?hurana
!ate !ecem'er 12, 212
Page 5 of 5