Birla Institute of Technology & Science, Pilani Distance Learning Programmes Division Second Semester 201 !

201" #$%&S' ()*D$%T #ourse *o+ #ourse Title Instructor , SS -./10 , Data Structure and )lgorithms Design ,

#ourse Descri1tion Introduction to Abstract Data Types, Data structures and Algorithms; Analysis of Algorithms Time and Space Complexity, Complexity Notation, Sol ing !ecurrence !elations"; Di ide#and#Con$uer as a Design Techni$ue; !ecursion Design of !ecursi e %unctions & 'rocedures, Tail !ecursion, Con ersion of !ecursi e %unctions to Iterati e %orm" (inear data structures (ists, Access !estricted (ists )Stac*s and +ueues, Implementation using Arrays and (in*ed (ists; Searching and -rder +ueries" Sorting Sorting Algorithms )-nline s" -ffline, In#memory s" .xternal, In#space s" -ut# of#space, +uic*Sort and !andomi/ation," 0nordered Collections1 2ashtables )Separate Chaining s" -pen Addressing, 'robing, !ehashing," 3inary Trees Tree Tra ersals" 'artially -rdered Collections1 Search Trees and 2eight 3alanced Search Trees, 2eaps and 'riority +ueues" Algorithm Design1 4reedy Algorithms and Dynamic 'rogramming" 4raphs and 4raph Algorithms1 !epresentation schemes, 'roblems on Directed 4raphs ) !eachability and Strong Connecti ity, Tra ersals,

Transiti e Closure" Directed Acyclic 4raphs # Topological Sorting,, 'roblems on 5eighted 4raphs )Shortest 'aths" Spanning Trees," Introduction to Complexity Classes )' and N', and N'#completeness" N'#2ard problems" Designing Algorithms for 2ard 'roblems 3ac*trac*ing, 3ranch#and#3ound, and Approximation Algorithms"
Sco1e and $23ective To enable the student to de elop different algorithms for a gi en situation, to test their alidity, measure their complexity and analy/e the performance )if necessary by simulation," To introduce techni$ues for designing data structures and algorithms" Prescri2ed Te4t Boo5 T1 Sahni, Sarta6, Data Structures, Algorithms and Application in C77, 8c4ra9 2ill International .dition, :;;; 6)lso in Boo5s 2" 4 7 $nline Digital Li2rary8 &eference Boo5s !<" !:" !>" !?" 2oro9it/ ., Sarta6 Sahni and ! Sanguthe ar, Computer Algorithms/C++ , Second edition, Silicon 'ress, :;;= 6Boo5s 2" 4 7 $nline Digital Li2rary8 4oodrich 8 T, Tamassia, !, Data Structures and Algorithms in JAVA, John Wiley & Sons Inc, 1 !" Corman T 2, (eiserson, C ., and !i est, ! (, 1 &'Indian reprint( %rentice)*all+" Introduction to Algorithms , #I$ %ress,

Aho, A @, 2opcraft, A . and 0llman, A D, $he Design and Analysis o, Computer Algorithms , Addison 5esley, )Indian !eprint1 'earson .ducation, :;;:,"

SS ZG519

Course Handout

Second Semester 2013-2014

Page 2

Plan of Self!Study

S+*o+ 1+

To1ics

:" >" ?" B" C" D" ="

Introduction to Abstract Data Type)ADT,, Data structures and Algorithms; (inear Data structures ## Array and (in*ed list representations Stac* E +ueue; Analysis of Algorithms ## T< Ch =,F,:,>, !< Ch :"<, <"> space and time complexity -rdered (ists; 3inary search; !ecursionG T< Ch <,>"?, !< Ch >"> !ecursi e %unctions Sorting##Sorting Algorithms)-nline s" T< Ch :">">,<=":":, !< Ch >"B -ffline, In#memory s" external, In#space s" out#of#space ,; Insertion sort; 8erge sort +uic* Sort Analysis, !andomi/ation; T< Ch <=":">,C"B":, !< Ch >"C 0nordered Collections1 2ashing 2ash Tables)Separate Chaining, -pen T< Ch <;"B Addressing, 'robing, 3inary TreesGTree Tra ersals T< Ch <<, C"< 'artially -rdered Collections1 3inary Search T< Ch <?,<B"<,<:"?, !< Ch :"?, B"B Trees; A@( Trees, 2eaps, 'riority +ueues Sylla2us for :id!Semester Test 6#losed Boo58, To1ics in S+ *o+ 1 to ;

#ha1ter9Section &eference to Te4t Boo5s T< Ch B,C,D

F"

Di ide and Con$uer, applications in sorting; T< Ch <=,<F, !< Ch >,B 8emoi/ation )Top#Do9n s" 3ottom up,; Dynamic 'rogramming <;" 4reedy Algorithms T< Ch <D,!< Ch ? <<" 4raphs and 4raph Algorithms1 !epresentation schemes; Directed 4raphsG !eachability T< Ch <C <:" Directed 4raphsGStrong Connecti ity, !< Ch :"C, B">#?, C":, C"?, ?"C, ?"F tra ersals, transiti e closure" <>" All pair Shortest 'aths)%loyd#5arshall, <?" 8inimal Spanning Trees" <B" Complexity Classes)' and N',; N'# !< Ch << Completeness; N'#2ard <C" Designing Algorithms for 2ard problems1 T< Ch :;,:<,!< Ch D,= 3ac*trac*ing ; 3ranch and 3ound Sylla2us for #om1rehensive '4am 6$1en Boo58, )ll to1ics given in Plan of Self Study

SS ZG519

Course Handout

Second Semester 2013-2014

Page 3

Programming La2s 6only for Practice8 The programming exercises are to be implemented in C (anguage1

(ab H <" :" >" ?" B" C D"

Topic Abstract Data Type, (in*ed (ists Sorting and Searching Stac*s and +ueues 2ash Tables 3inary Search Trees Algorithm Design Techni$ues 4raphs

(earning -b6ecti e To understand the concept of ADT using a implementation of an ADT based on some (ists Implement and analy/e the performances of sorting and searching applications" Implement Stac* ADT and +ueue ADT and implement some applications that use Stac* ADT and +ueue ADT" Implement 2ash tables Implement 3inary Search Tree, and perform search operations on it" Study and implement standard algorithm design approaches to sol e certain programming problems" Implement Directed & 0ndirected 4raphs and to implement tra ersals

Note: La s!eet on eac! to"#c $#%% e "ro&#ded se"arate%' $#t! so%&ed and unso%&ed "rogramm#ng e(erc#ses) 'valuation Scheme, '# *o+ '#!1 'valuation #om1onent & Ty1e of '4amination Assignment&+ui/ Duration II Details to be announced on (8S Taxila 9ebsite by Instructor : 2ours > 2ours <eigh! tage <BJ Day, Session,Time Date,

II Details to be announced on (8S Taxila 9ebsite by Instructor Saturday, <B&;:&:;<? )%N,I <; A8 <: Noon Saturday, ;B&;?&:;<? )%N,I F A8 <: Noon

'#!2 '#!

8id#Semester Test 6#losed Boo58= Comprehensi e .xam 6$1en Boo58=

>BJ B;J

== P%ease c!ec* t!e deta#%s ' +anuar' 10, 2014 on L,S -a(#%a $e s#te)
)*, AfterNoon Session> ?*, %oreNoon Session #losed Boo5 Test, No reference material of any *ind 9ill be permitted inside the exam hall" $1en Boo5 '4am, 0se of any printed & 9ritten reference material )boo*s and noteboo*s, 9ill be permitted inside the exam hall" (oose sheets of paper 9ill not be permitted" Computers of any *ind 9ill not be allo9ed inside the exam hall" 0se of calculators 9ill be allo9ed in all exams" No exchange of any material 9ill be allo9ed" *ote, It shall be the responsibility of the indi idual student to be regular in maintaining the self study schedule as gi en in the course handout, attend the online&on demand lectures as per details that 9ould be put up in the BITS L:S Ta4ila 9ebsite @@@+ta4ila+2its!1ilani+ac+in and ta*e all the prescribed components of the e aluation such as Assignment 6#ourse Page on L:S Ta4ila8, 8id Semester Test and Comprehensi e .xamination according to the . aluation Scheme gi en in the respecti e Course 2andout" If the student is unable to appear for the !egular Test&.xamination due to genuine exigencies, the student must refer to the procedure for applying for 8a*e#up Test&.xamination, 9hich 9ill be a ailable through the Important Information lin* on the BITS L:S Ta4ila 9ebsite @@@+ta4ila+2its!1ilani+ac+in on the date of the !egular Test&.xamination" The 8a*e#up Tests&.xams 9ill be conducted only at selected exam centres on the dates to be announced later" Instructor!in!#harge