SOFTWARE ENGINEERING Subject Code: 12SSE11 Tot !

Hours : "2 E% & Hours: 0' Hours/Week : 04 I#A# $ rks : "0 E% & $ rks: 100

1# I(troduct)o( (d Re*)e+ o, So,t+ re -rocess $ode!s : FAQs about Software Engineering; Professional and ethical responsibility;Software process models; Process iteration; Process activities; Computer-Aided Software Engineering 2# R .)d So,t+ re /e*e!o.&e(t0 So,t+ re Reuse: Agile methods; E!treme programming; "apid application development "euse landscape; #esign patterns; $enerator-based reuse; Application framewor%s; Application system reuse '# C1SE: Components and component models; Component-&ased Software Engineering 'C&SE( 4# So,t+ re E*o!ut)o(: Program evolution dynamics; Software maintenance; Evolution processes; )egacy system evolution "# 2er),)c t)o( (d 2 !)d t)o(: Planning verification and validation; Software inspections; System testing; Component testing; *est case design; *est automation 3# Cr)t)c ! S4ste&s0 S.ec),)c t)o(s o, Cr)t)c ! S4ste&s: +hat are critical systems, E!amples; System dependability- availability and reliability "is%-driven specification; Safety specification; Security specification; Software reliability specification 5# Cr)t)c ! S4ste&s /e*e!o.&e(t0 2 !)d t)o(: #ependable processes; #ependable programming; Fault tolerance and fault tolerant architectures "eliability validation; Safety assurance; Security assessment; Safety and dependability cases 6# /)str)buted S4ste&s Arc7)tecture: .ultiprocessor architectures; Client-Server architectures; #istributed ob/ect architectures; 0nter-1rgani2ational distributed computing 8# Re !9T)&e So,t+ re /es):(: "eal-time systems; System design; .onitoring and control systems; #ata ac3uisition systems TE;T 1OO<: 0an Sommerville4 Software Engineering- 5th Edition- Pearson Education- 6778 REFERENCE 1OO<S: "oger S Pressman4 Software Engineering-A Practitioners approach- 8th Edition- .c$raw-9ill- 6778

A/2ANCE/ A=GORITH$S Subject Code: 12SSE12 Tot ! Hours : "2 E% & Hours: 0' Hours/Week : 04 I#A# $ rks : "0 E% & $ rks: 100

1# Re*)e+ o, A( !4s)s Tec7()>ues: $rowth of Functions4 Asymptotic notations; Standard notations and common functions; "ecurrences and Solution of "ecurrence e3uations- *he substitution method- *he recurrence : tree method- *he master method; Amorti2ed Analysis4 Aggregate- Accounting and Potential .ethods 2# Gr .7 A!:or)t7&s: &ellman - Ford Algorithm; Single source shortest paths in a #A$; ;ohnson<s Algorithm for sparse graphs; Flow networ%s and Ford-Ful%erson method; .a!imum bipartite matching '# I(ter(et A!:or)t7&s: Search engines; "an%ing web pages; 9ashing; Caching- content delivery- and consistent hashing 4# Nu&ber 9T7eoret)c A!:or)t7&s: Elementary notions; $C#; .odular Arithmetic; Solving modular linear e3uations; *he Chinese remainder theorem; Powers of an element; "SA cryptosystem; Primality testing; 0nteger factori2ation "# Str)(:9$ tc7)(: A!:or)t7&s: =a>ve string .atching; "abin - ?arp algorithm; String matching with finite automata; ?nuth-.orris-Pratt algorithm; &oyer : .oore algorithms 3# -rob b)!)st)c (d R (do&)?ed A!:or)t7&s: Probabilistic algorithms; "andomi2ing deterministic algorithms.onte Carlo and )as @egas algorithms; Probabilistic numeric algorithms = bor tor4 Work: A #esign- develop- and run a program in any language to implement the &ellman-Ford algorithm and determine its performance 6 #esign- develop- and run a program in any language to implement ;ohnson<s algorithm and determine its performance B #esign- develop- and run a program in any language to implement a .onte Carlo algorithm to test the primality of a given integer and determine its performance C #esign- develop- and run a program in any language to solve the string matching problem using na>ve approach and the ?.P algorithm and compare their performances D #esign- develop- and run a program in any language to solve modular linear e3uations E #esign- develop- and run a program in any language to implement a Page "an%ing algorithm TE;T 1OO<S: A * 9 Cormen- C E )eiserson- " ) "ivest and C Stein4 0ntroduction to Algorithms- Brd Edition- Prentice-9all of 0ndia- 67A7 6 ?enneth A &erman- ;erome ) Paul4 Algorithms- Cengage )earning- 6776 REFERENCE 1OO<S: Ellis 9orowit2- Sarta/ Sahni- S "a/ase%haran4 Fundamentals of Computer Algorithms- 6nd Edition- Fniversities press- 6778

A/2ANCES IN /ATA1ASE $ANAGE$ENT S@STE$S Subject Code: 12SSE1' Hours/Week : 04 Tot ! Hours : "2 I#A# $ rks : "0 E% & Hours: 0' E% & $ rks: 100 1# Re*)e+ o, Re! t)o( ! / t $ode! (d Re! t)o( ! / t b se Co(str )(ts: "elational model concepts; "elational model constraints and relational database schemas; Fpdate operations- transactions and dealing with constraint violations 2# Object (d Object9Re! t)o( ! / t b ses: 1verview of 1b/ect-1riented Concepts : 1b/ects- Encapsulation*ype and class hierarchies- comple! ob/ects; 1b/ect model of 1#.$- 1b/ect definition )anguage 1#); 1b/ect Query )anguage 1Q); 1verview of CGG language binding; Conceptual design of 1b/ect database 1verview of ob/ect relational features of SQ); 1b/ect- relational features of 1racle; 0mplementation and related issues for e!tended type systems; *he nested relational model '# - r !!e! (d /)str)buted / t b ses: Architectures for parallel databases; Parallel 3uery evaluation; Paralleli2ing individual operations; Parallel 3uery optimi2ations; 0ntroduction to distributed databases; #istributed #&.S architectures; Storing data in a #istributed #&.S; #istributed catalog management; #istributed Query processing; Fpdating distributed data; #istributed transactions; #istributed Concurrency control and "ecovery 4# / t W re7ous)(:0 /ec)s)o( Su..ort (d / t $)()(:: 0ntroduction to decision support; 1)APmultidimensional model; +indow 3ueries in SQ); Finding answers 3uic%ly; 0mplementation techni3ues for 1)AP; #ata +arehousing; @iews and #ecision support; @iew materiali2ation; .aintaining materiali2ed views 0ntroduction to #ata .ining; Counting co-occurrences; .ining for rules; *ree-structured rules; Clustering; Similarity search over se3uences; 0ncremental mining and data streams; Additional data mining tas%s "# $ore Rece(t A..!)c t)o(s: +eb #atabase Programming using P9P- #eductive databases; .obile databases; $eographical 0nformation Systems; $enome data management- basic concepts = bor tor4 Work: AT7e ,o!!o+)(: t sks c ( be )&.!e&e(ted o( Or c!e or (4 ot7er su)t b!e R/1$S +)t7 su..ort ,or Object ,e turesB A #emonstrate ob/ect relational features of SQ) 6 #emonstrate ob/ect relational features of SQ) B #evelop a database application to demonstrate storing and retrieving of &)1& and C)1& ob/ects C #evelop a database application to demonstrate the representation of multivalued attributes- and the use of nested tables to represent comple! ob/ects +rite suitable 3ueries to demonstrate their use D #esign and develop a suitable Student #atabase application 1ne of the attributes to me maintained is the attendance of a student in each sub/ect for which heHshe has enrolled Fsing *"0$$E"S- write active rules to do the following4 a +henever the attendance is updated- chec% if the attendance is less than 5DI; if so- notify the 9ead of the #epartment concerned b +henever- the mar%s in an 0nternal Assessment *est are entered- chec% if the mar%s are less than C7I; if so- notify the 9ead of the #epartment concerned E #esign- develop- and e!ecute a program in a language of your choice to implement any one algorithm for mining association rules "un the program against any large database available in the public domain and discuss the results TE;T 1OO<S: A Elmasri and =avathe4 Fundamentals of #atabase Systems- Pearson Education- 6778 6 "aghu "ama%rishnan and ;ohannes $ehr%e4 #atabase .anagement Systems- Brd Edition- .c$raw-9ill- 677B REFERENCE 1OO<S: Abraham Silberschat2- 9enry F ?orth- S Sudarshan4 #atabase System Concepts- Eth Edition- .c$raw 9ill- 67A7