Birla Institute of Technology And Science, Pilani

Work-Integrated Learning Programmes Division

irst Semester !"#!-!"#$
%ourse &andout
%ourse 'o( ) IS *%$+#
%ourse Title ) Data Structures and Algorithms
Instructor ) ,A-&./'D,A -(S(
%ourse Descri0tion
Introduction to software design principles, modularity; ADTs, Data structures and algorithms;
Algorithm analysis; Linear Data Structures stacks, arrays, lists, queues; refi!, infi! and post fi!
e!pressions; "ecursion; Set operations; #ashing; $inary and other trees, tra%ersal algorithms;
#uffman codes; Search trees, priority queues, heaps and &alanced trees; Sorting techniques; 'raphs
and digraphs; Algorithmic design techniques; Data structures for e!ternal storage, multi way search
trees and $ trees(

Sco0e and 123ectives
ro%iding a sound conceptual understanding of the fundamental concepts of Data Structures and
efficient implementation of %arious algorithms, keeping the data a&straction and modularity
principles in mind(
)mphasi*e the concepts and constructs rather than on language features(
The practical implementation aspects of the algorithms, the detailed analysis and synthesis of the
same in the light of space-time tradeoff.
Prescri2ed Te4t Book)
T+( 'oodrich, ,ichael T - "o&erto Tamassia, and Algorithm Design. /oundations, Analysis -
Internet )!amples, 0iley Student )dition, 1221(
,eference Books)
"+( ,ark Allen 0eiss. Data Structures and Algorithms Analysis in 3, earson, 1222
"1( 3ormen T(#( et al(, Introduction to Algorithms, 1
nd
)d(, #I 122+(
"4( San5ay Dasgupta, 3hristos (, 6mest 7a*irani, Algorithms, T,#, 1228(
IS *%$+# 5%ourse &andout6 irst Semester !"#!-!"#$ Page !

Plan of Self-Study
Week
'o(
Learning 123ectives To0ic %ha0ter ,eference
to Te4t2ook
+ To learn the nature and
significance of comple!ity
classes
,athematical "e%iew9 Analy*ing
the algorithms, 3omple!ity
estimates; Asymptotic :otation
T+93h(+. +(+9+(4
1 3ase Studies Amorti*ation,
)!perimentation
T+93h(+. +(;9+(<
4 To learn a&out linear data
structures stacks and queues,
implementation and application(
Stacks - =ueues T+93h(1. 1(+
; To learn a&out linear data
structures linked list ,
implementation and application(
Linked Lists T+93h(1. 1(1
> To learn the representation of
non linear data structure,
operations performed on it
and its application(
'raphs - Trees, Tree Tra%ersal T+93h(1. 1(4
$inary Search Tree - ?perations
on $inary Search Tree
T+93h(4. 4(+94(1
< A7L Trees - ?perations on A7L
Tree
T+93h(4. 4(1
#ash Ta&les T+93h(1. 1(>
@ To learn different algorithms for
sorting their design, efficiency
and limitations(
Insertion Sort - ,erge Sort T+93h(1. 1(> - T+9
3h(;. ;(+
#eaps, - #eap sort T+93h(1. 1(;
8 =uick Sort, Lower $ounds on
Sorting
T+93h(;. ;(+9;(;
$ucket Sort, "adi! Sort,
3omparison of Sorting Algorithms
T+93h(;. ;(>9;(@
A ,evie7 Session
Syllabus for Mid-Semester Test (Closed Book): Topics in Week No. to !
+2 To learn algorithm design
techniques, their applications
and limitations;
Algorithm Design Techniques9Di%ide and
3onquer Technique
T+93h(>. >(+
Algorithm Design Techniques9'reedy
Approach
T+93h(>. >(1
++ Algorithm Design Techniques9Dynamic
rogramming
T+93h(>. >(4
+1
To learn the use of graphs for
capturing non9linear relations
and to learn the design of
algorithms for computing
properties of those relations(
Longest 3ommon Su&sequence T+93h(A. A(;
'raphs, 'raph ADT, Data Structures for
'raphs
T+93h(<. <(+9<(1
+4 'raph Tra%ersals T+93h(<. <(4
+; Directed 'raphs T+93h(<. <(;
+> 0eighted 'raphs9 Single Source Shortest
aths Di5kstraBs and $ellman9/ordBs
Algorithms
T+93h(@. @(+(+9@(+(1
+< ,inimum Spanning Trees . CruskalBs
Algorithm
T+93h(@. @(4
+@ rimBs Algorithm T+93h(@. @(4
+8
Syllabus for Compre"ensi#e $%am (&pen Book): 'll topics (i#en in )lan of Self Study
IS *%$+# 5%ourse &andout6 irst Semester !"#!-!"#$ Page $
Programming La2s)
The programming e!ercises are to &e implemented in 3 Language.
La& D Topic Learning ?&5ecti%e
+( A&stract Data Type, Linked Lists To understand the concept of ADT using a
implementation of an ADT &ased on some Lists
1( Stacks and =ueues Implement Stack ADT and =ueue ADT and implement
some applications that use Stack ADT and =ueue ADT(
4( Sorting and Searching Implement and analy*e the performances of sorting and
searching applications(
;( $inary Search Trees Implement $inary Search Tree, and perform search
operations on it(
>( 'raphs Implement Directed E 6ndirected 'raphs and to
implement tra%ersals
<( #ash Ta&les Implement #ash ta&les
@ Algorithm Design Techniques Study and implement standard algorithm design
approaches to sol%e certain programming pro&lems(
Note: *ab s"eet on eac" topic +ill be pro#ided separately +it" sol#ed and unsol#ed pro(rammin(
e%ercises.
Access to La2 ,esources )

#6 La2 Sheets . 7isit 3ourse age on Ta!ila for La& Sheets
!6 La2 Server 8 Source to Soft7ares . '33 E Access 0IL La& Ser%ers with the
access credentials pro%ided in 3ourse age on Ta!ila
$6 Instructions to install 5if any6 . :IL(
/valuation Scheme)
/%
'o(
/valuation
%om0onent 9
Ty0e of /4amination
Duration Weigh-
tage
Day, Date, Session,Time
/%-# AssignmentE=ui* FF Details to &e announced
on L,S Ta!ila we&site &y
Instructor
+>G FF Details to &e announced on
L,S Ta!ila we&site &y
Instructor &y 1;
th
Huly, 12+1
/%-! ,id9Semester Test
5%losed Book6:
1 #ours 4>G Sunday, 2AE2AE12+1 IA:JF
1 , ; ,
/%-$ 3omprehensi%e )!am
510en Book6:
4 #ours >2G Sunday, 2;E++E12+1 IA:JF
1 , > ,
IS *%$+# 5%ourse &andout6 irst Semester !"#!-!"#$ Page ;
:: )lease c"eck t"e details by ,-
t"
.uly/ ,0, on *MS Ta%ila +eb site.
1 Legend)
A') After:oon Session< ') /ore:oon Session
%losed Book Test) :o reference material of any kind will &e permitted inside the e!am hall(
10en Book /4am) 6se of any printed E written reference material I&ooks and note&ooksJ will &e permitted
inside the e!am hall( Loose sheets of paper will not &e permitted( 3omputers of any kind will not &e allowed
inside the e!am hall( 6se of calculators will &e allowed in all e!ams( :o e!change of any material will &e
allowed(
'ote)
It shall &e the responsi&ility of the indi%idual student to &e regular in maintaining the self study schedule as
gi%en in the course handout, attend the onlineEon demand lectures as per details that would &e put up in the
BITS L=S Ta4ila we&site 777(ta4ila(2its-0ilani(ac(in and take all the prescri&ed components of the
e%aluation such as Assignment 5%ourse Page on L=S Ta4ila6, ,id Semester Test and 3omprehensi%e
)!amination according to the )%aluation Scheme gi%en in the respecti%e 3ourse #andout( If the student is
una&le to appear for the "egular TestE)!amination due to genuine e!igencies, the student must refer to the
procedure for applying for ,ake9up TestE)!amination, which will &e a%aila&le through the Important
Information link on the $ITS 0IL we&site on the date of the "egular TestE)!amination( The ,ake9up
TestsE)!ams will &e conducted only at selected e!am centres on the dates to &e announced later(
Instructor-in-%harges