Complete Syllabus Btech 2008-09

Department of Computer Science and Engineering
B. Tech. New Scheme FIRST YEAR 1ST SEMESTER
S.No
Course Code MA-101 C -101 ME-102 M-102 CE-101 M-103 I)-101 ME-103 M-104 C -102
Course Title
1. 2. 3. 4. #. '. (. +. .. 10.
Mathematics-I Chemistr! E"ements of Mechanica" Engg. Eng"ish Communication En$ironmenta" Science % &ech. Introduction to Management Manufacturing *rocesses Mechanica" Engg. ,a-. Eng"ish Communication ,a-. Chemistr! ,a-. T'TA
Teaching oad T % 3 1 0 3 3 3 2 2 1 0 0 0 1( 1 1 0 0 0 0 0 0 0 ) 0 0 0 0 0 4 2 2 2 1*
Contact !ours 4 4 4 3 2 2 # 2 2 2 )*
Credit
4 4 4 3 2 2 3 1 1 1 +,
E"am #uration T % 3 3 3 3 3 3 & 2 2 2 2
Total Mar$s 100 100 100 100 100 100 100 100 100 100 1***
+N# SEMESTER S.No Course Code MA-102 * -101 IC/EC101 CS-101 0&-101 M-101 ME-101 * -102 EC-102 CS-102 Course Title Teaching oad T 1 1 1 0 0 0 0 0 0 0 *) % 0 0 0 0 0 0 4 2 2 2 1* Contact !ours 4 4 4 2 3 2 # 2 2 2 )* Credit E"am #uration T % 3 3 3 3 3 3 & 2 2 2 2 Total Mar$s 100 100 100 100 100 100 100 100 100 100 1***
1. 2. 3. 4. #. '. (. +. .. 10.
Mathematics-II *h!sics E"ectrica" Sciences Computer *rogramming 0io Sciences *s!cho"og! of uman 0eha$ior Engineering 1raphics *h!sics ,a-. E"ectrica" Sciences ,a-. Computer *rogramming ,a-. T'TA
3 3 3 2 3 2 1 0 0 0 1(
4 4 4 2 3 2 3 1 1 1 +,
14
CS&1*1 C'M%-TER %R'.RAMMIN.
/+ * * +0
Introduction1 Computer s!stem2 soft3are and hard3are concepts. Introduction to 3ord processor and s!stem soft3are4s $i5. MS 6ffice. Ma2or elements o3 C44 5rogram2 Dec"arations of 7aria-"es2 0od! of Statements and functions2 Identifiers2 8e!3ords2 Data t!pes2 7aria-"es2 E9pressions2 Statements2 &!pe Con$ersions2 6perators2 Arithmetic operators2 :nar! operators2 0inar! operators2 Char t!pe2 Cast operator2 *recedence and Associati$e"! of operations2 Change of *recedence2 Assignment operators2 0it3ise operators2 Shift operators2 ;e"ationa" operators2 ,oops2 <or "oop and it4s $ariants2 =hi"e "oop2 do-3hi"e "oop2 if statement2 if > e"se statement2 S3itch function2 &ernar! operator2 ,ogica" operators2 0rea? function2 Continue function2 )u"" statement2 1oto <unction. #e3ining a 3unction2 &!pes of structure dec"arations2 :ser defined data t!pes2 )ested structure dec"aration2 Initia"i5ation of structures2 processing structures 3ith initia"i5ed $a"ues2 *rocessing Enumeration data t!pe2 :nions Function 5rotot65es2 *assing arguments to a function2 *assing arguments -! $a"ue2 ;eturning $a"ue2 Specif!ing arguments -! data t!pes2 *assing arguments -! reference2 ;eferences2 *assing arguments to a function -! reference2 <unction 6$er"oading2 In"ine functions2 ;ecursion2 Storage c"asses and scope Class2 6-@ects2 Data A-straction2 Data iding2 Encapsu"ation2 CAA o-@ects as data t!pes2 Scope reso"ution operator2 *u-"ic and pri$ate mem-er functions2 )esting of mem-er functions2 <riend functions2 Constructors2 Destructors2 Static data mem-ers and static mem-er functions. Arra6 and o5erator o7erloading1 Arra!2 6perations on Arra!s2 Mu"ti-Dimensiona" Arra!2 Arra!s as C"ass mem-er Data2 :se of Arra!s 3ithin a c"ass2 Arra! of o-@ects2 6perator o$er"oading2 6$er"oading :nar! operators2 mu"tip"e o$er"oading2 and 6$er"oading 0inar! operators. Inheritance1 0ase c"ass2 Deri$ed c"ass2 7isi-i"it! modes2 Deri$ation and friendship2 &!pes of Inheritance2 Containership2 7irtua" functions2 0inding2 *ure 7irtua" functions2 A-stract c"ass2 *ointers2 Accessing the pointer4s o-@ect2 *ointers and arra!s2 6perations on *ointers2 *ointers and functions2 structures and pointers2 *ointers to o-@ects2 this pointer. Stream class1 hierarch!2 Stream c"asses2 String I/62 ;eading and =riting Strings2 Character I/62 <i"e *ointers2 ;andom Access2 ;edirection2 Command "ine arguments2 *rinter output2 6$er"oading e9traction and insertion operators2 <i"e updating. B''8S REC'MMEN#E# 1. 2. 3. 4. #. 0@arne Stroustrup2 BCAA *rogramming ,anguageC2 3rd edition2 *earson Education Asia2 1..(. ,afore ;2 B6-@ect 6riented *rogramming in CAAC2 4th Ed.2 &echmedia2 )e3 De"hi 2002. Dash3ant ?anet?ar2 B,et :s CAAC2 1st Ed2 0*0 *u-"ication2 )e3 De"hi 1.... Soura$ Saha!2 B6-@ect 6riented *rogramming 3ith CAAC2 1st Ed.2 69ford :ni$ersit! *ress 200'. 0. A. <orou5an and ;. <. 1i"-erg2 Compi"er Science2 BA Structured approach using CAA 2C Cengage ,earning 2 )e3 De"hi. /* * + 10
CS& 1*+ C'M%-TER %R'.RAMMIN. AB'RAT'RY 1. 2. 3. 4. #. '. (. +. .. *rogram to ma?e use of the if e"se if structure. *rogram to ma?e use of the s3itch statement. *rogram to ma?e use of the nested for "oop. *rogram to ma?e use of the nested 3hi"e "oop. *rogram to imp"ement do-3hi"e "oop. *rogram to find the factoria" of a num-er using functions. *rogram to print the <i-onacci series using functions. *rogram to o$er"oad functions. *rogram to disp"a! the detai"s of a emp"o!ee record using nested structures.
10. *rogram to disp"a! the resu"t card of a student record using :nion.
1#
11. *rogram to ca"cu"ate the area of rectang"e and sEuare using c"asses. 12. *rogram to imp"ement Fdate c"ass4 containing data mem-ersG da!2 month and !ear. Imp"ement assignment operator and cop! constructor in this c"ass. 13. *rogram to perform insertion and de"etion operations on arra!s. 14. *rogram to merge to arra!s. 1#. *rogram to imp"ement Mu"tip"e Inheritance. 1'. *rogram to imp"ement Mu"ti "e$e" Inheritance. 1(. *rogram to demonstrate !-rid Inheritance. 1+. *rogram to demonstrate containership. 1.. *rogram to mu"tip"! t3o arra!s using pointers to the functions. 20. *rogram to gi$e the command "ine arguments and disp"a!ing those using fi"es. This is only the suggested list of Practicals. Instructor may frame additional Practicals relevant to the course contents
1'
#E%ARTMENT 'F C'M%-TER SCIENCE 9 EN.INEERIN. B. TEC!. NE: SC!EME +**;&*< )R# SEMESTER S. No 1. 2. 3. 4. #. '. (. +. .. Course Code CS-201 CS-203 MA-202 CS-20( CS-20. CS-211 CS-21( CS-21. CS-221 Course Title , Discrete Structures Information Coding &heor! )umerica" Methods 6-@ect 6riented *rogramming Data Structures and A"gorithms Digita" Circuits and ,ogic Design 6-@ect 6riented *rogramming ,a-orator! Data Structures and A"gorithm ,a-orator! Digita" Circuits and ,ogic Design ,aT'TA 3 3 3 3 3 3 0 0 0 1; Teaching oad & 1 0 1 0 1 0 0 0 0 ) * 0 0 0 0 0 0 2 2 2 > 4 3 4 3 4 3 1 1 1 +? Credit %re re=uisite
For ECE #e5tt. 1. CS-20( 2. CS-21(
6-@ect 6riented *rogramming 6-@ect 6riented *rogramming ,a-
3 0
0 0
0 2
3 1
1(
)R# SEMESTER CS&+*1 #ISCRETE STR-CT-RES /) 1 * ?0
Set Theor61 Definition of sets2 counta-"e and uncounta-"e sets2 7enn Diagrams2 proofs of some genera" identities on sets Set &heor!2 <unctions and ;e"ationsG Su-sets2 *o3er Set2 )u"" Set2 Sing"eton2 <inite Set2 Infinite Set2 :ni$ersa" Set2 Dis@oint Sets2 6peration on Sets2 7enn Diagrams2 Cartesian *roduct of Sets2 *artition of Sets2 Concept of ;e"ation % *roperties of ;e"ations2 Different t!pes of ;e"ations2 &a-u"ar and Matri9 ;epresentation of ;e"ations2 ;e"ations and Diagraphs2 Composition of ;e"ations2 <unctions and their different mappings2 Composition of <unction2 ;ecursion and ;ecurrence ;e"ations. Alge@raic Structures1 Definition2 *roperties2 t!pesG Semi 1roups2 Monoid2 1roups2 A-e"ian group2 properties of groups2 Su-group2 c!c"ic groups2 Cosets2 factor group2 *ermutation groups2 )orma" su-group2 omomorphism and isomorphism of 1roups2 e9amp"e and standard resu"ts2 ;ings and <ie"dsG definition and standard resu"ts. %osetsA !asse #iagram and attices1 Introduction2 ordered set2 asse diagram of partia""!2 ordered set2 isomorphic ordered set2 3e"" ordered set2 properties of ,attices2 -ounded I and comp"emented "attices. Boolean Alge@ra1 *artia" 6rdering2 &ota""! ordered Sets2 Dua" 6rder2 asse Diagram ,e9icographic 6rdering2 Co$er of an E"ement2 ,east and 1reatest E"ements2 Minima" and Ma9ima" E"ements 2:pper and ,o3er 0ound 2 =e""-6rder Set2 0inar! and n-Ar! 6perations2 ,attices2 Atoms of a 0oo"ean A"ge-ra2 0oo"ean E9pressions2 App"ications of 0oo"ean A"ge-ra to S3itching &heor!. TreeG Definition2 ;ooted tree2 properties of trees2 -inar! search tree2 tree tra$ersa". %ro5ositional ogic1 *roposition2 <irst order "ogic2 0asic "ogica" operation2 truth ta-"es2 tauto"ogies2 Contradictions2 A"ge-ra of *roposition2 "ogica" imp"ications2 "ogica" eEui$a"ence2 predicates2 :ni$ersa" and e9istentia" Euantifiers. Com@inatorics 9 .ra5hs1 ;ecurrence ;e"ation2 1enerating function.2 Simp"e graph2 mu"ti graph2 graph termino"og!2 representation of graphs2 0ipartite2 ;egu"ar2 *"anar and connected graphs2 connected components in a graph2 Eu"er graphs2 ami"tonian path and circuits2 1raph co"oring2 chromatic num-er2 isomorphism and omomorphism of graphs. B''8S REC'MMEN#E# 1. 2. 3. 4. #. ,iptschut52 Se!mour2 B Discrete MathematicsC2 Mc1ra3 i"". &rem-"e!2 H.* % ;. Manohar2 BDiscrete Mathematica" Structure 3ith App"ication to Computer ScienceC2 Mc1ra3 i"". 8enneth . ;osen2 BDiscrete Mathematics and its app"icationsC2 Mc1ra3 i"". Deo2 )arsingh2 B1raph &heor! =ith app"ication to Engineering and Computer.Science.C2 * I. 8rishnamurth!2 7.2 BCom-inatorics &heor! % App"icationC2 East-=est *ress *$t. ,td.2 )e3 De"hi. /) * * )0
CS&+*) INF'RMATI'N C'#IN. T!E'RY
In3ormation2 channe" capacit!2 the concept of amount of information2 entrop!2 Information rate2 Conditiona" and @oint entropies. Source coding 1 )oise "ess coding2 Shannon4s first fundamenta" theorem2 Discrete memor! "ess channe"2 Mutua" information2 Sources 3ith finite memor!2 Mar?o$ sources2 Shannon4s second fundamenta" theorem on coding2 uffman coding2 ,empe" > Ii$ a"gorithm2 Shannon-<ano a"gorithm. Channel coding 1 Error detecting codes2 amming distance2 Error correcting codes2 ;epitition codes2 ,inear -"oc? codes2 -inar! c!c"ic codes2 0C codes2 ;eed-So"eman codes2 1o"a! codes. Con7olution Coding1 Code tree2 state diagram2 &re""is diagram2 Ma9imum-,i?e"ihood decoding > 7iter-i4s a"gorithm2 seEuentia" decoding. Networ$ In3ormation theor6A Introduction to Cr65togra5h6
1+
B''8S REC'MMEN#E# 1. & M 1o$er2 H M &homos2 BE"ements of Information &heor!C2 =i"e! 2 1..1 2. a!?ins S2 BDigita" CommunicationsC2 =i"e! 3. H 1 *roa?is2 B Digita" CommunicationsC2 Mc 1ra3 i"". 4. 0a""ard and C.M.0ro3n2 Computer 7ision 2 *rentice a""2 Eng"e3ood C"iffs #. ;oman2 S. Coding and Information &heor!. )e3 Dor?G Springer-7er"ag2 1..2 MA&+*+ N-MERICA MET!'#S /) 1 * ?0
;oots of a"ge-raic and transcendenta" eEuations2 0isection method2 ;egu"a > <a"si method2 )e3ton >;aphson method2 0airsto34s method and 1raeffe4s root sEuaring method. So"ution of simu"taneous a"ge-raic eEuations2 matri9 in$ersion and eigen-$a"ue pro-"ems2 triangu"arisation method2 Haco-i4s and 1auss-Siede" iteration method2 partition method for matri9 in$ersion2 po3er method for "argest eigen$a"ue and Haco-i4s method for finding a"" eigen-$a"ues. <inite differences2 interpo"ation and numerica" differentiation2 for3ard2 -ac?3ard and centra" differences2 )e3ton4s for3ard2 -ac?3ard and di$ided difference interpo"ation formu"as2 ,agrange4s interpo"ation formu"a2 Stir"ing4s and 0esse"4s centra" difference interpo"ation formu"as2 numerica" differentiation using )e3ton4s for3ard and -ac?3ard difference formu"as and numerica" differentiation using Stir"ing4s and 0esse"4s centra" difference interpo"ation formu"as. )umerica" integration2 &rape5oida" ru"e2 Simpson4s one-third ru"e and numerica" dou-"e integration using &rape5oida" ru"e and Simpson4s one-third ru"e. &a!"or4s series method2 Eu"er4s and modified Eu"er4s methods2 ;unge-8utta fourth order methods for ordinar! differentia" eEuations2 simu"taneous first order differentia" eEuations and second order differentia" eEuations. 0oundar! $a"ue pro-"ems2 finite difference methods for -oundar! $a"ue pro-"ems. *artia" differentia" eEuations2 finite difference methods for e""iptic2 para-o"ic and h!per-o"ic eEuations. Boo$s Recommended1 1. S S Sastr!2 Introductionar! Methods of )umerica" Ana"!sis2 3rd Edition2 *rentice )e3 India -1... 2. S C Chapra and ; * Cana"e2 )umerica" Methods for Engineers2 2nd Edition2 Mc1ra3 Singapore 1..0. 3. 1re3a"2 0 S2 C)umerica" MethodsC2 8hanna *u-"ishers 2De"hi. 4. 8a"a$ath! S.2 B)umerica" MethodsC2 Cengage *u-"ishers2 )e3 De"hi. #. 0urden ;ichard ,. 2 <aires H. Doug"as2 B)umerica" An"a!sisC 2 Cengage ,earning 2 )e3 De"hi. i"" 0oo? Compan!2 a"" of India *$t.,td.2
CS&+*( 'BBECT 'RIENTE# %R'.RAMMIN.
/) * * )0
'@2ect oriented thin$ing1 )eed for oop paradigm2 A 3a! of $ie3ing 3or"d > Agents2 responsi-i"it!2 messages2 methods2 c"asses and instances2 c"ass hierarchies JInheritanceK2 method -inding2 o$erriding and e9ceptions2 summar! of oop concepts2 coping 3ith comp"e9it!2 a-straction mechanisms. Ba7a Basics1 istor! of Ha$a2 Ha$a -u553ords2 datat!pes2 $aria-"es2 scope and "ife time of $aria-"es2 arra!s2 operators2 e9pressions2 contro" statements2 t!pe con$ersion and costing2 simp"e @a$a program2 c"asses and o-@ects >
1.
concepts of c"asses2 o-@ects2 constructors2 methods2 access contro"2 this ?e!3ord2 gar-age co""ection2 o$er"oading methods and constructors2 parameter passing2 recursion2 string hand"ing. Inheritance1 ierarchica" a-stractions2 0ase c"ass o-@ect2 su-c"ass2 su-t!pe2 su-stituta-i"it!2 forms of inheritancespecia"i5ation2 specification2 construction2 e9tension2 "imitation2 com-ination2 -enefits of inheritance2 costs of inheritance. Mem-er access ru"es2 super uses2 using fina" 3ith inheritance2 po"!morphism- method o$erriding2 a-stract c"asses. %ac$ages and Inter3aces1 Defining2 Creating and Accessing a *ac?age2 :nderstanding C,ASS*A& 2 importing pac?ages2 differences -et3een c"asses and interfaces2 defining an interface2 imp"ementing interface2 app"!ing interfaces2 $aria-"es in interface and e9tending interfaces. E9p"oring pac?ages > Ha$a.io2 @a$a.uti". E"ce5tion handling and multithreading1 Concepts of e9ception hand"ing2 -enefits of e9ception hand"ing2 &ermination or resumpti$e mode"s2 e9ception hierarch!2 usage of tr!2 catch2 thro32 thro3s and fina""!2 -ui"t in e9ceptions2 creating o3n e9ception su- c"asses. Differences -et3een mu"ti threading and mu"titas?ing2 thread "ife c!c"e2 creating threads2 s!nchroni5ing threads2 daemon threads2 thread groups. E7ent !andling1 E$ents2 E$ent sources2 E$ent c"asses2 E$ent ,isteners2 De"egation e$ent mode"2 hand"ing mouse and ?e!-oard e$ents2 Adapter c"asses2 inner c"asses.&he A=& c"ass hierarch!2 user interface components- "a-e"s2 -utton2 can$as2 scro""-ars2 te9t components2 chec? -o92 chec? -o9 groups2 choices2 "ists pane"s > scro""pane2 dia"ogs2 menu-ar2 graphics2 "a!out manager > "a!out manager t!pes > -oarder2 grid2 f"o32 card and gri- -ag. A55lets1 Concepts of App"ets2 differences -et3een app"ets and app"ications2 "ife c!c"e of an app"et2 t!pes of app"ets2 creating app"ets2 passing parameters to app"ets. Swing1 Introduction2 "imitations of A=&2 M7C architecture2 components2 containers2 e9p"oring s3ing-HApp"et2 H<rame and HComponent2 Icons and ,a-e"s2 te9t fie"ds2 -uttons > &he H0utton c"ass2 Chec? -o9es2 ;adio -uttons2 Com-o -o9es2 &a--ed *anes2 Scro"" *anes2 &rees2 and &a-"es. Networ$ing1 0asics of net3or? programming2 addresses2 ports2 soc?ets2 simp"e c"ient ser$er program2 mu"tip"e c"ients2 Ha$a .net pac?age *ac?ages > @a$a.uti"2 B''8S REC'MMEN#E# 1. 2. 3. 4. #. An Introduction to programming and 66 design using Ha$a2 H.)ino and <.A. osch2 Hohn 3i"e! % sons. An Introduction to 66*2 second edition2 &. 0udd2 pearson education. Introduction to Ha$a programming 'th edition2 D. Danie" ,iang2 *earson education. An introduction to Ha$a programming and o-@ect oriented app"ication de$e"opment2 ;.A. Hohnson&homson. Core Ha$a 22 7o" 12 <undamenta"s2 Ca!.S. orstmann and 1ar! Corne""2 se$enth Edition2 *earson Education. /) 1 * ?0
CS&+*< #ATA STR-CT-RES AN# A .'RIT!MS
Introduction1 0asic &ermino"og!2 E"ementar! Data 6rgani5ation2 Structure operations2 A"gorithm Comp"e9it! and &ime-Space trade-off Arra6sG Arra! Definition2 ;epresentation and Ana"!sis2 Sing"e and Mu"tidimensiona" Arra!s2 address ca"cu"ation2 app"ication of arra!s2 Character String in CAA2 Character string operation2 Arra! as *arameters2 6rdered ,ist2 Sparse Matrices and 7ectors. Stac$s1 Arra! ;epresentation and Imp"ementation of stac?2 6perations on Stac?sG *ush % *op2 Arra! ;epresentation of Stac?2 ,in?ed ;epresentation of Stac?2 6perations Associated 3ith Stac?s2 App"ication of stac?G Con$ersion of Infi9 to *refi9 and *ostfi9 E9pressions2 E$a"uation of postfi9 e9pression using stac?. Recursion1 ;ecursi$e definition and processes2 recursion in C2 e9amp"e of recursion2 &o3er of anoi *ro-"em2 simu"ating recursion2 0ac?trac?ing2 recursi$e a"gorithms2 princip"es of recursion2 tai" recursion2 remo$a" of recursion.
20
Cueues1 Arra! and "in?ed representation and imp"ementation of Eueues2 6perations on LueueG Create2 Add2 De"ete2 <u"" and Empt!2 Circu"ar Eueues2 D-Eueues and *riorit! Lueues. in$ed listG ;epresentation and Imp"ementation of Sing"! ,in?ed ,ists2 &3o-3a! eader ,ist2 &ra$ersing and Searching of ,in?ed ,ist2 6$erf"o3 and :nderf"o32 Insertion and de"etion to/from ,in?ed ,ists2 Insertion and de"etion A"gorithms2 Dou-"! "in?ed "ist2 ,in?ed ,ist in Arra!2 *o"!nomia" representation and addition2 1enera"i5ed "in?ed "ist2 1ar-age Co""ection and Compaction. TreesG 0asic termino"og!2 0inar! &rees2 0inar! tree representation2 a"ge-raic E9pressions2 Comp"ete 0inar! &ree2 E9tended 0inar! &rees2 Arra! and ,in?ed ;epresentation of 0inar! trees2 &ra$ersing 0inar! trees2 &hreaded 0inar! trees2 &ra$ersing &hreaded 0inar! trees2 uffman a"gorithm . Binar6 Search TreesG 0inar! Search &ree J0S&K2 Insertion and De"etion in 0S&2 Comp"e9it! of Search A"gorithm2 *ath ,ength2 A7, &rees2 0-trees. Searching and !ashingG SeEuentia" search2 -inar! search2 comparison and ana"!sis2 Co""ision ;eso"ution Strategies2 ash &a-"e Imp"ementation. SortingG Insertion Sort2 0u--"e Sorting2 Luic? Sort2 &3o =a! Merge Sort2 *ractica" consideration for Interna" Sorting. ash &a-"e2 ash <unctions2
eap Sort2 Sorting on Different 8e!s2
.ra5hs1 &ermino"og! % ;epresentations2 1raphs % Mu"ti-graphs2 Directed 1raphs2 SeEuentia" ;epresentations of 1raphs2 Ad@acenc! Matrices2 &ra$ersa"2 Connected Component and Spanning &rees2 Minimum Cost Spanning &rees. File StructuresG *h!sica" Storage Media <i"e 6rgani5ation2 6rgani5ation of records into 0"oc?s2 SeEuentia" <i"es2 Inde9ing and ashing2 *rimar! indices2 Secondar! indices2 0A &ree inde9 <i"es2 0 &ree inde9 <i"es2 Inde9ing and ashing Comparisons. B''8S REC'MMEN#E# 1. oro3it5 and Sahani2 B<undamenta"s of data StructuresC2 1a"gotia *u-"ication *$t. ,td.2 )e3 De"hi. 2. ;. 8ruse eta"2 BData Structures and *rogram Design in CC2 *earson Education Asia2 De"hi-2002 3. A. M. &enen-aum2 BData Structures using C % CAAC2 *rentice- a"" of India *$t. ,td.2 )e3 De"hi. 4. 0runo ; *reiss2 BData Structures and A"gorithms 3ith 6-@ect 6riented Design *attern in CAAC2 Hhon =i"e! % Sons2 Inc. #. 1i"-erg <oro5an 2 BData Structure > A pseudo code approach 3ith CAAC2 Cengage ,earning2 )e3 De"hi. CS&+11 #I.ITA CIRC-ITS AN# '.IC #ESI.N /) * * )0
Binar6 S6stems1 Digita" S!stems2 0inar! )um-ers2 )um-er -ase con$ersions2 6cta" and e9adecima" )um-ers2 comp"ements2 Signed -inar! num-ers2 0inar! codes2 0inar! Storage and ;egisters2 0inar! "ogic. Boolean Alge@ra And ogic .ates1 0asic Definitions2 A9iomatic definition of 0oo"ean A"ge-ra2 0asic theorems and properties of 0oo"ean a"ge-ra2 0oo"ean functions canonica" and standard forms2 other "ogic operations2 Digita" "ogic gages2 integrated circuits. .ate D e7el MinimiEation1 &he map method2 <our-$aria-"e map2 <i$e-7aria-"e map2 product of sums simp"ification Don4t-care conditions2 )A)D and )6; imp"ementation other &3o-"e$e" imp"ementnations2 E9c"usi$e > 6r function2 ard3ard Description "anguage J D,K. Com@inational ogic1 Com-inationa" Circuits2 Ana"!sis procedure Design procedure2 0inar! Adder-Su-tractor Decima" Adder2 0inar! mu"tip"ier2 magnitude comparator2 Decoders2 Encoders2 Mu"tip"e9ers2 D, for com-inationa" circuits. S6nchronous Se=uential ogic1 SeEuentia" circuits2 "atches2 <"ip-<"ops Ana"!sis of c"oc?ed seEuentia" circuits2 D, for seEuentia" circuits2 State ;eduction and Assignment2 Design *rocedure .
21
Registers and Counters1 ;egisters2 shift ;egisters2 ;ipp"e counters s!nchronous counters2 other counters2 D, for ;egisters and counters. Memor6A C% #sA and F%.As1 Introduction2 ;andom-Access Memor!2 Memor! Decoding2 Error Detection and correction ;ead-on"! memor!2 *rogramma-"e "ogic Arra! programma-"e Arra! "ogic2 SeEuentia" *rogramma-"e De$ices. As6nchronous Se=uential ogic1 Introduction2 Ana"!sis *rocedure2 Circuits 3ith ,atches2 Design *rocedure2 ;educiton of state and <"o3 &a-"es2 ;ace-<ree state Assignment a5ards2 Design E9amp"e. B''8S REC'MMEN#E# 1. DI1I&A, DESI1) > &hird Edition 2 M.Morris Mano2 *earson Education/* I. 2. Digita" *rincip"es and Design > Dona"d D.1i$one2 &ata Mc1ra3 i""2 Edition. 3. Hohn < =a?er"!2 BDigita" Design *rincip"es and *ractices 3/eC2 *earson Education 2001. 4. H *. a!es2 BIntroduction to Digita" ,ogic DesignC2 Addison-=es"e! *u-"ishing Co #. Char"es . ;oth2 Hr. <undamenta"s of "ogic design2 Cengage ,earning2 )e3 De"hi CS&+1( 'BBECT 'RIENTE# %R'.RAMMIN. AB'RAT'RY 6-@ecti$esG &o ma?e the student "earn a o-@ect oriented 3a! of so"$ing pro-"ems. &o teach the student to 3rite programs in Ha$a to so"$e the pro-"ems 1. aK =rite a Ha$a program that prints a"" rea" so"utions to the Euadratic eEuation a92 A -9 A c M 0. ;ead in a2 -2 c and use the Euadratic formu"a. If the discriminant -2 -4ac is negati$e2 disp"a! a message stating that there are no rea" so"utions. -K &he <i-onacci seEuence is defined -! the fo""o3ing ru"eG &he fist t3o $a"ues in the seEuence are 1 and 1. E$er! su-seEuent $a"ue is the sum of the t3o $a"ues preceding it. =rite a Ha$a program that uses -oth recursi$e and non recursi$e functions to print the nth $a"ue in the <i-onacci seEuence. 2. aK =rite a Ha$a program that prompts the user for an integer and then prints out a"" prime num-ers up to that integer. -K =rite a Ha$a program to mu"tip"! t3o gi$en matrices. cK =rite a Ha$a *rogram that reads a "ine of integers2 and then disp"a!s each integer2 and the sum of a"" the integers J:se String&o?eni5er c"ass of @a$a.uti"K aK =rite a Ha$a program that chec?s 3hether a gi$en string is a pa"indrome or not. E9G MADAM is a pa"indrome. -K =rite a Ha$a program for sorting a gi$en "ist of names in ascending order. cK =rite a Ha$a program to ma?e freEuenc! count of 3ords in a gi$en te9t. aK =rite a Ha$a program that reads a fi"e name from the user2 then disp"a!s information a-out 3hether the fi"e e9ists2 3hether the fi"e is reada-"e2 3hether the fi"e is 3rita-"e2 the t!pe of fi"e and the "ength of the fi"e in -!tes. -K =rite a Ha$a program that reads a fi"e and disp"a!s the fi"e on the screen2 3ith a "ine num-er -efore each "ine. cK =rite a Ha$a program that disp"a!s the num-er of characters2 "ines and 3ords in a te9t fi"e. aK =rite a Ha$a program thatG iK Imp"ements stac? AD&. iiK Con$erts infi9 e9pression into *ostfi9 form iiiK E$a"uates the postfi9 e9pression aK De$e"op an app"et that disp"a!s a simp"e message. -K De$e"op an app"et that recei$es an integer in one te9t fie"d2 and computes its factoria" 7a"ue and returns it in another te9t fie"d2 3hen the -utton named BComputeC is c"ic?ed. =rite a Ha$a program that 3or?s as a simp"e ca"cu"ator. :se a grid "a!out to arrange -uttons for the digits and for the A2 -2N2 O operations. Add a te9t fie"d to disp"a! the resu"t. =rite a Ha$a program for hand"ing mouse e$ents. aK =rite a Ha$a program that creates three threads. <irst thread disp"a!s B1ood MorningC e$er! one second2 the second thread disp"a!s B e""oC e$er! t3o seconds and the third thread disp"a!s B=e"comeC e$er! three seconds. /* * + 10
3.
4.
#.
'. (. +. ..
22
10.
11.
12.
13.
-K =rite a Ha$a program that correct"! imp"ements producer consumer pro-"em using the concept of inter thread communication. =rite a program that creates a user interface to perform integer di$isions. &he user enters t3o num-ers in the te9tfie"ds2 )um1 and )um2. &he di$ision of )um1 and )um2 is disp"a!ed in the ;esu"t fie"d 3hen the Di$ide -utton is c"ic?ed. If )um1 or )um2 3ere not an integer2 the program 3ou"d thro3 a )um-er<ormatE9ception. If )um2 3ere Iero2 the program 3ou"d thro3 an ArithmeticE9ception Disp"a! the e9ception in a message dia"og -o9. =rite a Ha$a program that imp"ements a simp"e c"ient/ser$er app"ication. &he c"ient sends data to a ser$er. &he ser$er recei$es the data2 uses it to produce a resu"t2 and then sends the resu"t -ac? to the c"ient. &he c"ient disp"a!s the resu"t on the conso"e. <or e9G &he data sent from the c"ient is the radius of a circ"e2 and the resu"t produced -! the ser$er is the area of the circ"e. J:se @a$a.netK aK =rite a @a$a program that simu"ates a traffic "ight. &he program "ets the user se"ect one of three "ightsG red2 !e""o32 or green. =hen a radio -utton is se"ected2 the "ight is turned on2 and on"! one "ight can -e on at a time )o "ight is on 3hen the program starts. -K =rite a Ha$a program that a""o3s the user to dra3 "ines2 rectang"es and o$a"s. aK =rite a @a$a program to create an a-stract c"ass named Shape that contains an empt! method named num-er 6f Sides J K.*ro$ide three c"asses named &rape5oid2 &riang"e and e9agon such that each one of the c"asses e9tends the c"ass Shape. Each one of the c"asses contains on"! the method num-er 6f Sides J K that sho3s the num-er of sides in the gi$en geometrica" figures. -K Suppose that a ta-"e named &a-"e.t9t is stored in a te9t fi"e. &he first "ine in the fi"e is the header2 and the remaining "ines correspond to ro3s in the ta-"e. &he e"ements are seperated -! commas. =rite a @a$a program to disp"a! the ta-"e using H&a-"e component. /* * + 10
CS&+1< #ATA STR-CT-RES AN# A .'RIT!M AB'RAT'RY =rite *rogram in C or CAA for fo""o3ing. 1. 2. 3. 4. #. '.
(.
+. ..
=rite a CA program to the fo""o3ing operations on stac? of integersG aP push -Ppop cP disp"a! &he program shou"d print appropriate messages for stac? o$erf"o32 stac? :nderf"o3 % stac? empt!. =rite a CAA program to con$ert % print a gi$en $a"id parenthesi5ed in fi9 Arithmetic e9pression to postfi9 e9pression. &he e9pression consists of sing"e character operands % A 2 - 2N2/ operators . =rite a c program to e$a"uate a $a"id suffi9 / postfi9 e9pression using a Stac?2 assume that the suffi9 / postfi9 e9pression is read as a sing"e "ine consisting of non negati$e sing"e digit operands % -inar! arithmetic operands. &he arithmetic operators are A JADDK2 - Jsu-tractK2 NJmu"tip"!K % / Jdi$ideK. =rite a CAA program to simu"ate the 3or?ing a Eueue of integers using an arra!. *ro$ide the aK insert -K de"ete cK disp"a! =rite a CAA program to simu"ate the 3or?ing of a circu"ar Eueue of integers using an arra!. *ro$ide the fo""o3ing operationsG aK insert -K de"ete cKDisp"a! =rite a program to design a priorit! Eueue 3hich is maintained as a set of Eueue Jassume a ma9imum of 3 EueuesK. &he e"ements are inserted -ased upon the gi$en priorit!. &he de"etion of an e"ement is to -e done starting from the 1st Eueue2 if it is not empt! .If it is empt! 2&he e"ements from the 2nd Eueue 3i"" -e de"eted % so on. =rite a CAA program using d!namic $aria-"e % pointers to construct a sing"! "in?ed "ist consisting of the fo""o3ing information in each node. Student id JintegerK2 student nameJ character stringK % semesterJintegerK. &he operations to -e supported are aK inserting in front of "ist -K De"eting a node -ased on student id2 if the specified node is not present in the "ist2 error message shou"d -e disp"a!ed cK Searching a node -ased on student id 2 if the specified node is not present in the "ist2 error message shou"d -e disp"a!ed dK Disp"a!ing a"" the nodes in the "ist =rite a CAA program using d!namic $aria-"es % pointers to construct an orderedJascendingK sing"! "in?ed "ist -ased on the ran? of the student2 3here each node consists of the fo""o3ing information student idJ integerKstudent nameJcharacterK2 ran?JintegerK =rite a CAA program using d!namic $aria-"es % pointers to construct a sing"! "in?ed "ist to perform the operations of a stac? of integers aK *ush -K pop cK disp"a!
23
10. &he program shou"d print appropriate message for stac? o$erf"o3 % stac? empt! 11. =rite a CAA program to support the fo""o3ing operations on a dou-"! "in?ed 3here each node each node consists of integers aK Create a dou-"! "in?ed "ist -! adding each node front -K Insert a ne3 node to the "eft of the node 3hose ?e! $a"ue is read as a input cK De"ete the node of a gi$en data2 if it is found2 other3ise disp"a! appropriate message dK Disp"a! the content of the "ist 12. =rite CAA program aK &o construct a -inar! search tree of integers -K &o tra$erse the tree using a"" the methods i.e. inorder2 preorder % postorder to disp"a! the e"ements in the tree 13. =rite CAA program for the fo""o3ing searching techniEues o$er a "ist of integers. aP ,inear search2 -P 0inar! search 14. =rite a CAA program to sort a "ist of ) integers using the Euic? sort a"gorithm. 1#. =rite a CAA program to sort a "ist of ) strings using the insertion sort a"gorithm. 1'. =rite a CAA program to sort a "ist of ) integers using eap sort a"gorithm. CS&++1 #I.ITA AN# ANA '. CIRC-ITS AB'RAT'RY 1. /* * + 10
7erification of 0oo"ean &heorems - Imp"ementation of 0oo"ean <unction - Adders / Su-tractors - Decoders Encoders - Mu"tip"e9er - Demu"tip"e9ers - Comparators - *arit! Chec?er/1enerator. 2. ;egister Counters - Shift ;egisters - 1enera"-purpose shift registers - Data transmission. 3. *ro@ect - A mini pro@ect in$o"$ing c"oc?ed seEuentia" net3or?s design. 4. &o see the 3or?ing of a 0CD-to-( Segment decoder and to $erif! the truth ta-"e. #. &o stud! the operation of Arithmetic and "ogic unit using (41+1 IC. '. &o stud! the c?t. 6f 1' "ine-to-1 "ine Mu"tip"e9er using (41#0 and (4.3IC2 s 3ith DEM6 -oard. (. &o construct different t!pes of f"ip-f"ops and $erif! their truth ta-"es. <"ip-f"ops "i?e H-8 f"ip-f"ops. S-; f"ipf"op. And D-f"ip-f"ops etc. +. &o construct and $erif! a Master-S"a$e f"ip-f"op. .. Construction and stud! of Modu"o-) counter using IC4s (4.0 decade counter2 (4.3 -inar! counter. 10. Stud! of $arious Interfacing card Stepper motor 3ith $o"untar! unit. 12--it high-speed data acEuisition card. *C 0us E9tension unit. 1'--it channe" ;e"a! output card. Digita" IC tester. (-Segment disp"a! card. Amp"ifier and mu"tip"e9er card. IEEE 4++ 1*I0 card. Digita" I/6 and timer counter card. 11. E*;6M *rogramming 12. Stud! % 3or?ing of DMA contro""er. 13. Designing of &raffic contro" s!stem. &his is on"! the suggested "ist of *ractica"s. Instructor ma! frame additiona" *ractica"s re"e$ant to the course contents.
24
?T! SEMESTER
S. No Course Code CS-202 CS-204 EC-20' CS-20+ CS-210 CS-299 CS-214 EC-21' CS-21+ Course Title , Computer Architecture % 6rgani5ation S!stem *rogramming Microprocessor and *rogramming Data Communication *ro-a-i"it! and Lueuing &heor! DE-I S!stem *rogramming ,a-orator! Microprocessor and *rogramming ,a-orator! Data Communication ,a-orator! T'TA 3 3 3 3 3 3 0 0 0 1; Teaching oad & 0 0 0 1 0 0 0 0 0 1 * 0 0 0 0 0 0 2 2 2 > 3 3 3 4 3 3 1 1 1 ++ Credit %re re=uisite
1. 2. 3. 4. #. '. (. +. ..
#E%ARTMENTA E ECTIFE G#EH&I S. No 1. 2. 3. Course Code CS-222 CS-224 CS-22' Course Title =e- &echno"ogies Mu"timedia Communication =indo3s *rogramming , 3 3 3 Teaching oad & 0 0 0 * 0 0 0 Credit 3 3 3 %re re=uisite Computer *rogramming
For ECE #e5tt. 1. CS-20' 2. CS-21'
Data Structures and A"gorithms Data Structures and A"gorithm ,a-.
2 0
0 0
0 2
2 1
For IC 9 CB #e5tt. 1. CS-20( 6-@ect 6riented *rogramming 2. CS-21( 6-@ect 6riented *rogramming ,a-
3 0
0 0
0 2
3 1
2#
?T! SEMESTER CS&+*+ C'M%-TER ARC!ITECT-RE 9 'R.ANIIATI'N /) * * )0
Introduction1 istorica" o$er$ie32 economic trends2 under"!ing techno"ogies2 Data ;epresentation- Data &!pes2 Comp"ements. <i9ed-*oint ;epresentation2 <"oating-*oint ;epresentation. Error Detection and Correction. Addition2 Su-traction2 Mu"tip"ication and Di$ision a"gorithms and hard3are. Register Trans3er and Micro o5erationsG ;egister transfer "anguage2 Inter-;egister &ransfer2 Arithmetic Microoperations2 ,ogic and Shift micro-operations ,anguage2 Contro" functions. Arithmetic ogic -nit1 Arithmetic2 "ogic and shift micro operations. Constructing an arithmetic "ogic shift unit. Basic Com5uter Architecture and #esign1 Computer registers2 Computer Instructions-Instruction Set Comp"eteness. C"assif!ing Instruction Set Architecture. 0asic steps of Instruction E9ecution. ard3ired Contro". Micro programmed Contro". ori5onta" and 7ertica" Microprogramming. Interrupts. Central %rocessing -nit1 1enera" ;egister 6rgani5ation. Stac? 6rgani5ed C*:. Instruction <ormats2 Addressing Modes. Data &ransfer and Manipu"ation.;ISC 7s CISC. %i5elining1 *ara""e" and pipe"ine *rocessing2 *ipe"ine Contro"2 *ipe"ine Imp"ementations2 Conf"icts ;eso"ution2 and *ipe"ine a5ards. 7ector *rocessing2 and Arra! *rocessors. Memor6 'rganiEation1 Memor! S!stemsG princip"e of "oca"it!2 princip"es of memor! hierarch! Caches2 associati$e memor!2 main memor!2 7irtua" memor!2 *aging and Segmentation2 Memor! Inter"ea$ing. In5ut 'ut5ut 'rganiEation1 I/6 performance measures2 t!pes and characteristics of I/6 de$ices2 I/6 Modes*rogrammed I/62 Interrupt Initiated I/6 and DMA.0usesG connecting I/6 de$ices to processor and memor!2 interfacing I/6 de$ices to memor!2 processor2 and operating s!stem. %arallel Com5uters1 C"assification2 SIMD2 MIMD 6rgani5ations2 Connection )et3or?s2 Data <"o3 Machines2 and Mu"tithreaded Architectures. B''8S REC'MMEN#E# 1. 2. 3. 4. #. M Moris Mano2 BComputer S!stem ArchitectureC2 *earson Education2 3rd Edition 1..3. Da$id A. *atterson and Hohn ,. enness!2 BComputer 6rgani5ation % Design-&he ard3are/Soft3are InterfaceC2 Morgan 8aufmann2 2nd Edition 1..(. =i""iam Sta""ings2 BComputer 6rganisation and Architecture2 Designing for *erformanceC2 *earson Education Asia2 'th Edition 2003. arr! <. Hordan and 1ita A"agh-and2 B<undamenta"s of *ara""e" *rocessingC2 *earson Education2 1 st Edition 2003. 0arr! =i"?inson Michae" A""en2 B*ara""e" *rogrammingC2 prentice ha""2 1.... /) * * )0
CS&+*? SYSTEM %R'.RAMMIN. Introduction1 Introduction to Soft3are processors2 &rans"ators and ,oaders2 Interpreters Assem@lers1 E"ements of Assem-"! ,anguage *rogramming2 Design of &3o-*ass assem-"ers
Macros and Macro %rocessors1 Macro Instructions2 <eatures of a Macro faci"it!2 Imp"ementation of &3o pass Macro. Com5ilers1 Aspects of Compi"ation2 *hases of compi"ation2 Scanning and *arsing2 Compi"ation of E9pressions2 Compi"ation of Contro" Structures Code 1eneration and Code optimi5ation techniEues2 Compi"er =riting &oo"s oaders 9 in$age Editors1 ,oading ,in?ing and ;e"ocation2 6$er$ie3 of ,in?age Editing2 ,in?ing for *rogram 6$er"a!. Editors and de@uggersG introduction to editors2 t!pes of editor2 design of an editor2 de-ug monitors2 introduction to $arious de-ugging techniEues2 tur-o cAA de-uggers.
2'
.rammar and automationG introduction to grammar2 t!pes of grammar2 accepta-i"it! of grammar2 introduction to automation2 characteristics of automation2 finite contro"2 transition s!stem2 finite automation. Case stud! on ,EQ and DACC. Introduction to '5erating s6stems G Introduction2 6perating S!stem Structures2 *rocess Management2 Memor! management2 I/6 s!stems2 Distri-uted 6perating S!stems B''8S REC'MMEN#E# 1. 2. 3. 4. #. 0ec? , ,2 BS!stems Soft3areG An Introduction to S!stems *rogrammingC2 Addison-=es"e! 2001. Dono$an H H2 BS!stems *rogramming B2 )e3 Dor?2 Mc-1ra3 i"" 1.(2. Dhamdhere2 D M2 BIntroduction to S!stems Soft3areC2 &ata Mc-1ra3 i"" 2000. 1"ingaert *2 BAssem-"es ,oaders and Compi"ersC2 prentice a"" 1.(2. Aho A 7 and H D :""man2 B*rincip"es of compi"er DesignC2 Addison =es"e!/ )arosa 1.+#. /) * * )0
EC&+*> MICR'&%R'CESS'R AN# %R'.RAMMIN.
Introduction1 Microcomputer structure and 6peration2 Microprocessor E$o"ution and t!pes2 &he +0+' Microprocessor <ami"!- 6$er$ie32 Architecture of processor +0+# and +0+'. Assem@l6 anguage %rogramming1 Introduction to +0+# and +0+'2 *rogramming De$e"opment steps2 Constructing machine De$e"opment codes for +0+# and +0+' instructions2 Assem-"! ,anguage *rogram De$e"opment &oo"s2 Imp"ementation of +0+' Assem@l6 anguage1 Simp"e seEuence program Humps2 <"ags2 and Conditiona" @umps2 ,oops and Constructs2 Instruction &iming and De"a! ,oops StringsA %rocedure and Macros1 String instructions2 =riting and :sing *rocedures2 =riting and using Assem-"er Macros Instruction #escri5tion and Assem@ler #irecti7es1 Instruction Descriptions2 Assem-"er Directi$es S!stems Connections2 &iming and &rou-"e ShootingG 0asic +0+' Microcomputer s!stems connections2 "ogic Ana"!5er to 6-ser$e Microprocessor 0us Signa"s2 &rou-"eshooting a Simp"e +0+'-0ased Microcomputer Interru5ts1 +0+' Interrupts and &!pes2 +2#4 Soft3are-*rogramma-"e &imer/Counter2 +2#.A *riorit! Interrupt Contro""er2 Soft3are Interrupt App"ications #igital and Analog Inter3acing1 *rogramma-"e *ara""e" *orts and andsha?e Input/6utput2 Interfacing 8e!-oards and A"phanumeric Disp"a!s2 Interfacing Microcomputer *orts to De$ices2 De$e"oping the *rotot!pe of a Microcomputer 0ased Instrument MemoriesA Co5rocessorsA and E#A Tools1 +0+' Ma9imum Mode and DMA Data &ransfer2 Interfacing and ;efreshing D!namic ;AMs2 A Coprocessor- &he +0+( Math Coprocessor2 Computer 0ased Design and de$e"opment &oo"s Case studies1 Mu"ti-user/Mu"titas?ing 6S2 Concepts2 +02+' Microprocessor2 +03+' Microprocessor2 +04+' Microprocessor. B''8S REC'MMEN#E# 1. 2. 3. 4. ,. a"" Doug"as 72 BMicroprocessors and InterfacingC2 &ata Mc1ra3- i"" 1.+.. 0err! 0 0re! 2B&he Inte" MicroprocessorsG +0+'/+0++2 +01+'/+01++2 +02+'2 +03+' And +04+'2 *entium and *entium *ro*rocessor Architecture2 *rogramming and InterfacingC2 *earson Education 2003. Mathur Adit!a *2 BIntroduction to MicroprocessorsC &ata Mc1ra3- i"" 1.+.. ;a! A 8-hurchandi2 8 M2 BAd$anced microprocessors and periphera"sB2&ata Mc1ra3 i"" 2000. Hames , Antona?os2 BAn Introduction to the Inte" <ami"! of MicroprocessorsG A ands-6n Approach :ti"i5ing the +09+' Microprocessor <ami"!C2 <irst Edition. Cengage ,earning2 )e3 De"hi
2(
CS&+*; #ATA C'MM-NICATI'N
/) 1 * ?0
#ata TransmissionJThe %h6sical a6er1 Concepts and &ermino"og!2 Ana"og and Digita" Data &ransmission2 &ransmission Impairments2 1uided &ransmission Media2 =ire"ess &ransmission2 Communication Sate""ites2 &he *u-"ic S3itched &e"ephone )et3or?2 &he Mo-i"e &e"ephone S!stem2 Ca-"e &e"e$ision #ata Encoding1 Digita" DataG Digita" and Ana"og Signa"s2 Ana"og DataG Digita" and Ana"og Signa"s2 Spread Spectrum #ata Communication Inter3ace1 As!nchronous and S!nchronous &ransmission2 ,ine Configurations2 Interfacing Multi5le"ing1 <reEuenc!-Di$ision Mu"tip"e9ing2 S!nchronous &ime-Di$ision Mu"tip"e9ing2 Statistica" &imeDi$ision Mu"tip"e9ing Circuit %ac$et and Switching1 S3itched )et3or?s2 Circuit-S3itching )et3or?s2 S3itching Concepts2 ;outing in Circuit-S3itched )et3or?s2 Contro" Signa"ing2 *ac?et-S3itching *rincip"es2 ;outing2 Congestion Contro"2 Q.2# 2+2 Frame Rela61 <rame ;e"a! *rotoco" Architecture2 <rame ;e"a! Ca"" Contro"2 :ser Data &ransfer2 )et3or? <unction2 Congestion Contro" AN Technolog6 and S6stems1 ,A) Architecture2 0usI&ree ,A)s2 ;ing ,A)s2 Star ,A)s2 =ire"ess ,A)s2 Ethernet and <ast Ethernet JCSMAICDK2 &o?en ;ing and <DDI2 10071-An!,A)2 A&M ,A)s2 <i-re Channe"2 =ire"ess ,A)s2 0ridge 6peration2 ;outing 3ith 0ridges %rotocols and Architecture1 *rotoco"s2 6SI2 &C*/I* *rotoco" Suite E"am5les o3 networ$s1 )o$e"" )et3are2 Arpanet2 and Internet. E9amp"es of Data Communication Ser$icesG Q.2# )et3or?s2 <rame re"a!2 0road -and ISD) and A&M. *h!sica" ,a!erG &ransmission media- )arro3 -and ISD)G Ser$ices-Architecture- Interface2 0road -and ISD) and A&M- 7irtua" Circuits $ersus Circuit S3itching > &ransmission in A&M net3or?s. <DDI in$ a6er and ocal Area Networ$s #ata lin$ la6er1 Ser$ice pro$ided -! data "in? "a!er-Error detection and D,C2 correction &echniEues-E"ementar! data "in? "a!er protoco"s -S"iding =indo3 protoco"s - Data "in? "a!er in
Internet and A&M . Mu"tip"e Access protoco"sG Channe" partitioning protoco"sG &DM-<DM-Code Di$ision Mu"tip"e AccessJCDMAK .;andom Access protoco"s G A,6 ACSMA and CSMA/CD . ,oca" area )et3or?G ,A) addressesAddress ;eso"ution *rotoco"-;e$erse Address ;eso"ution *rotoco". EthernetG Ethernet &echno"ogies-IEEE standards- u-s-0ridges and S3itches B''8S REC'MMEN#E# 1. 2. 3. 4. #. Andre3 S. &anen-aum BComputer )et3or?sC Ed *earson Education 4th Edition2 2003. Hames <. 8urose and 8eith =. ;oss BComputer )et3or?ingC *earson Education2 2002. =i""iam Sta""ing2 BData and Computer CommunicationC2 *earson Education2 ( th Edition2 2nd Indian ;eprint 2004. Mi""er BData and )et3or? CommunicationC Ed &homson ,earning2 2001. Doug"as E Comer2 BComputer )et3or?s and InternetsC2 *earson Education 2 nd Edition2 #th Indian ;eprint 2001.
CS&+1* %R'BABI ITY AN# C-E-IN. T!E'RY
/) * * )0
%ro@a@ilit61 &he concept of pro-a-i"it!2 &he a9ioms of pro-a-i"it!2 Some important theorems on *ro-a-i"it!2 Assignment of *ro-a-i"ities2 Conditioa" *ro-a-i"it!2 &heorems on conditiona" pro-a-i"it!2 Independent E$ent4s2 0a!es4 &heorem.
2+
Random Faria@les and %ro@a@ilit6 #istri@utions1 ;andom $aria-"es2 Discrete pro-a-i"it! distri-utions2 Distri-ution functions for discrete random $aria-"es2 Continuous pro-a-i"it! distri-ution2 Distri-utions for continuous random $aria-"es2 @oint distri-utions2 Independent random $aria-"es. Mathematical E"5ectation1 Definition2 <unctions of random $aria-"es2 some theorems on E9pectation2 &he $ariance and Standard De$iation2 Moments2 Moment 1enerating <unctions2 Co$ariance2 Corre"ation Coefficient. S5ecial %ro@a@ilit6 #istri@utions1 &he 0inomia" Distri-ution2 &he )orma" Distri-ution2 &he *oisson Distri-ution2 ;e"ations -et3een different distri-ution2 Centra" "imit theorem2 :niform distri-ution2 Chi-sEuare Distri-ution2 E9ponentia" distri-ution. Sam5ling Theor61 *opu"ation and Samp"e2 Samp"ing 3ith and 3ithout rep"acement2 the samp"e mean2 Samp"ing distri-ution of means2 proportions2 differences and sums2 &he samp"e $ariance2 the samp"e distri-ution of $ariances. Tests o3 !65otheses and Signi3icance1 Statistica" Decisions2 Statistica" h!potheses2 )u"" !potheses2 &ests of h!potheses and significance2 &!pe I and &!pe II errors2 "e$e" of significance2 &ests in$o"$ing the )orma" distri-ution2 6ne-&ai"ed and &3o-tai"ed tests2 Specia" tests of significance for "arge and sma"" samp"es2 &he ChisEuare test for goodness of fit. Cur7e Fitting Regression and Correlation1 Cur$e <itting2 &he method of "east sEuares2 &he "east sEuares "ine2 mu"tip"e regression2 the "inear corre"ation coefficient2 ;an? corre"ation2 *ro-a-i"it! interpretation of regression and corre"ation. #iscrete&%arameter Mar$o7 Chains1 Introduction2 Computation of n-step &ransition *ro-a-i"ities2 State C"assification and ,imiting Distri-utions2 Distri-ution of times -et3een state changes2 Irreduci-"e finite chains 3ith aperiode states2 &he M/1/1 Lueuing S!stem2 Discrete-parameter2 0irth-Death processes2 <inite Mar?o$ chains 3ith a-sor-ing states. B''8S REC'MMEN#E# 1. 2. 3. 4. #. Murra! ;. Spiege"2 B*ro-a-i"it! and StatisticsC2 Mc1ra3 ""2 Schaum4s 6ut"ine Series JChaptersG 12223242#2(2+K 8ishor S &ri$edi2 B*ro-a-i"it! and Statistics 3ith ;e"ia-i"it!2 Lueuing and Computer App"icationsC2 *rentics a"" of India2 2000 JChapter (K A. *apou"is and S. :nni?rishna *i""ai2 B*ro-a-i"it!2 ;andom 7aria-"es and Stochastic *rocesses2 Mc1ra3 i""2 4th Edition ;ichard A Hohnson2 *ro-a-i"it! and Statistics for Engineers. *renticsha""2 India2 2002. Mondenha""2 BIntroduction to pro-a-i"it! and statisticsC2 Cengage ,earning2 )e3 De"hi /* * + 10
CS& +1? SYSTEM %R'.RAMMIN. AB'RAT'RY 1. 2. 3. 4. #. '. (. +. .. Design and Imp"ementation of an Editor in an! "anguage. Design and Imp"ementation of 6ne *ass Assem-"er in an! "anguage. Design and Imp"ementation of &3o *ass Assem-"er in an! "anguage. Imp"ementation of $arious search techniEuesG ,inear and 0inar! Search. Imp"ementation of $arious sorting techniEuesG 0uc?et sort2 Merge Sort2 eap Sort Imp"ementation of ,e9ica" Ana"!5er. Imp"ementation of &op Do3n *arser. Imp"ementation of 0ottom :p *arser. Design and Imp"ementation of &3o *ass Macro- *rocessor.
10. Stud! of ,EQ and DACC.
2.
EC&+1> MICR'&%R'CESS'R AN# %R'.RAMMIN. AB'RAT'RY
/* * + 10
I. Micro5rocessor ;*;>1 1. Introduction to MASM/&ASM. 2. Arithmetic operation > Mu"ti -!te Addition and Su-traction2 Mu"tip"ication and Di$ision > Signed and unsigned Arithmetic operation2 ASCII > arithmetic operation. 3. ,ogic operations > Shift and rotate > Con$erting pac?ed 0CD to unpac?ed 0CD2 0CD to ASCII con$ersion. 4. 0! using string operation and Instruction prefi9G Mo$e 0"oc?2 ;e$erse string2 Sorting2 Inserting2 De"eting2 ,ength of the string2 String comparison. #. D6S/0I6S programmingG ;eading ?e!-oard J0uffered 3ith and 3ithout echoK > Disp"a! characters2 Strings. II. Inter3acing1 1. +2#. > Interrupt Contro""erG 1enerate an interrupt using +2#. timer. 2. +2(. > 8e!-oard Disp"a!G =rite a sma"" program to disp"a! a string of characters. 3. +2## > **IG =rite A,* to generate sinusoida" 3a$e using **I. 4. +2#1 > :SA;&G =rite a program in A,* to esta-"ish Communication -et3een t3o processors. III. Microcontroller ;*,1 1. ;eading and =riting on a para""e" port. 2. &imer in different modes. 3. Seria" communication imp"ementation. This is only the suggested list of Practicals. Instructor may frame additional Practicals relevant to the course contents. CS&+1; #ATA C'MM-NICATI'N AB'RAT'RY 1. 2. 3. 4. #. '. (. +. .. 10. 11. 12. 13. 14. /* * + 10
Ma?ing Straight2 ;o""o$er and Cross-6$er ca-"es Ca-"e % ;H-4# Hac? out"et insta""ation Insta""ation of )IC Card % using &C*/I* Design2 -ui"d % test a simp"e communication s!stem 6$er$ie3 and -asic Configuration of ;outer ;outer sho3 Command 0asic ,A) Setup Designing % Imp"ementing ,A) using su-netting Stud! of Amp"itude Modu"ation Stud! of freEuenc! Modu"ation Stud! of AS8 Modu"ation Stud! of <S8 Modu"ation Simp"e point-to-point communication % error detection Imp"ementation of S&6* and =ait protoco" 1#. Imp"ementation of S"iding =indo3 protoco" This is only the suggested list of practicals. Instructor may frame additional practicals relevant to the course contents #E%ARTMENTA E ECTIFE G#EH DI /) * * )0
CS&+++ :EB TEC!N' '.IES
Introduction to !TM 1 &M, Common tags- ,ist2 &a-"es2 images2 forms2 <ramesR Cascading St!"e sheetsR Introduction to Ba7a1 Scripts2 6-@ects in Ha$a Script2 D!namic &M, 3ith Ha$a Script KM G Document t!pe definition2 QM, Schemas2 Document 6-@ect mode"2 *resenting QM,2 :sing QM, *rocessorsG D6M and SAQ Ba7a BeansG Introduction to Ha$a 0eans2 Ad$antages of Ha$a 0eans2 0D8 Introspection2 :sing 0ound properties2 0ean Info Interface2 Constrained properties *ersistence2 Customi5es2 Ha$a 0eans A*I2 Introduction to EH04s
30
:e@ Ser7ers and Ser7lets1 &omcat 3e- ser$er2 Introduction to Ser$e"etsG ,ifec!c"e of a Ser$er"et2 HSD82 &he Ser$e"et A*I2 &he @a$a9.ser$e"et *ac?age2 ;eading Ser$e"et parameters2 ;eading Initia"i5ation parameters. &he @a$a9.ser$e"et &&* pac?age2 and"ing ttp ;eEuest % ;esponses2 :sing Coo?ies-Session &rac?ing2 Securit! Issues2 Introduction to BS%G &he *ro-"em 3ith Ser$e"et. &he Anatom! of a HS* *age2 HS* *rocessing. HS* App"ication Design 3ith M7C Setting :p and HS* En$ironmentG Insta""ing the Ha$a Soft3are De$e"opment 8it2 &omcat Ser$er % &esting &omcat BS% A55lication #e7elo5ment1 1enerating D!namic Content2 :sing Scripting E"ements Imp"icit HS* 6-@ects2 Conditiona" *rocessing > Disp"a!ing 7a"ues :sing an E9pression to Set an Attri-ute2 Dec"aring 7aria-"es and Methods Error and"ing and De-ugging Sharing Data 0et3een HS* pages2 ;eEuests2 and :sers *assing Contro" and Date -et3een *ages > Sharing Session and App"ication Data > Memor! :sage Considerations #ata@ase Access 1 Data-ase *rogramming using HD0C2 Stud!ing Ha$a9.sE".N pac?age2 Accessing a Data-ase from a HS* *age2 App"ication > Specific Data-ase Actions2 Dep"o!ing HA7A 0eans in a HS* *age2 Introduction to struts frame3or?. B''8S REC'MMEN#E# 1. 2. 3. 4. #. =e- *rogramming2 -ui"ding internet app"ications2 Chris 0ates 2nd edition2 =I,ED Dreamtech &he comp"ete ;eference Ha$a 2 <ifth Edition -! *atric? )aughton and er-ert Schi"dt. &M JChaptersG 2#K Ha$a Ser$er *ages > ans 0ergsten2 S*D 64;ei""!. Internet and =or"d =ide =e- > o3 to program -! Diete" and )ieto * I/*earson Education Asia Hoc" S?"ar2 B=e- =arrier guide to 3e- design techno"ogiesC2 Cengage ,earning2 )e3 De"hi /) * * )0
CS&++? M- TIME#IA C'MM-NICATI'N
Introduction1 Mu"timedia E"ementsR Mu"timedia App"icationsR Mu"timedia S!stems ArchitectureR E$o"$ing &echno"ogies for Mu"timedia S!stemsR Defining 6-@ects for Mu"timedia S!stemsR Mu"timedia Data Interface StandardsR &he need for Data CompressionR Mu"timedia Data-ases Media and #ata Streams1 Media G *erception Media2 ;epresentation Media2 *resentation Media2 Storage Media2 &ransmission Media2 Information E9change Media2 *resentation spaces % 7a"ues2 and *resentation DimensionsR 8e! *roperties of a Mu"timedia S!stem G Discrete % Continuous Media Independence Media2 Computer Contro""ed S!stems2 IntegrationR Characteri5ing Data StreamsG As!nchronous &ransmission Mode2 S!nchronous &ransmission Mode2 Isochronous &ransmission ModeR Characteri5ing Continuous Media Data Streams. Audio Technolog61 SoundG <reEuenc!2 Amp"itude2 Sound *erception and *s!choacousticsR Audio ;epresentation on ComputersR &hree Dimensiona" Sound *ro@ectionR Music and MIDI StandardsR Speech Signa"sR Speech 6utputR Speech InputR Speech &ransmission. .ra5hics and Images1 Capturing 1raphics and Images Computer Assisted 1raphics and Image *rocessingR ;econstructing ImageR 1raphics and Image 6utput 6ptions. Fideo Technolog6 9 Com5uter&Based Animation1 0asicsR &e"e$ision S!stemsR Digita"i5ation of 7ideo Signa"sR Digita" &e"e$isionR 0asic ConceptsR Specification of AnimationsR Methods of Contro""ing AnimationR Disp"a! of AnimationR &ransmission of AnimationR 7irtua" ;ea"it! Mode"ing ,anguage. #ata Com5ression1 Storage SpaceR Coding ;eEuirementsR Source2 Entrop!2 and !-rid CodingR 0asic Compression &echniEuesR H*E1G Image *reparation2 ,oss! SeEuentia" DC&--ased Mode2 E9panded ,oss! DC&-ased Mode2 ,oss"ess Mode2 ierarchica" ModeR .2'1 J*9'4K and .2'3A and .2'3,R M*E1 G 7ideo Encoding2 Audio Coding2 Data Stream2 M*E1-22 M*E1G 7ideo Encoding2 Audio Coding2 Data Stream2 M*E1-22 M*E1-42 M*E1-(R <racta" Compression. '5tical Storage Media1 istor! of 6ptica" StorageR 0asic &echno"og!R $ideo Discs and other =6;MsR Compact Disc Digita" AudioR Compact Disc ;ead 6n"! Memor!R CD-;6M E9tended ArchitectureR <urther CD-;6M-0ased De$e"opmentsR compact Disc ;ecorda-"eR Compact Disc Magneto-6ptica"R Compact Disc ;ead/=riteR digita" 7ersati"e Disc.
31
Content Anal6sis1 Simp"e 7s Comp"e9 <eaturesR Ana"!sis of Indi$idua" ImagesR Ana"!sis of Image SeEuencesR Audio Ana"!sisR App"ications. #ata and File Format Standards1 ;ich-&e9t <ormatR &I<< fi"e <ormatR ;esource Interchange <i"e <ormat J;I<<KR MIDI <i"e <ormatR H*E1 DI0 <i"e <ormat for Sti"" and Motion ImagesR A7I Indeo <i"e <ormatR M*E1 StandardsR &=AI). Mutimedia A55lication #esign1 Mu"timedia App"ication C"assesR &!pes of Mu"timedia S!stemsR 7irtua" ;ea"it! DesignR Components of Mu"timedia S!stemsR 6rgani5ing Mu"timedia Data-asesR App"ication =or?f"o3 Design IssuesR Distri-uted App"ication Design Issues. B''8S REC'MMEN#E# 1. ;a"f Steinmet52 8"ara )arstedt2 BMu"timedia <undamenta"s G 7o" 1- Media Coding and Content *rocessingC2 * I2 2)D Edition2 2003.JChapters 223242#2'2(2+2.K 2. *ra-hat 8. And"eigh2 8iran &ha?rar2 BMu"timedia S!stems DesignC2 * I22003.JChapters 1232(K 3. 8.; ;ao2 Ioran S. 0o@?o$ic and Dragorad A. Mi"o$ano$ic2 BMu"timedia Communication S!stemsG &echniEues2 Standards2 and )et3or?sC2 *earson 2002. 4. )a"in 8 Sharad2 BMu"timedia information )et3or?ingC2 * I2 2002. #. Iain E.1. ;ichardson2 .2'4 and M*E1-4 7ideo Compression2 Hohn =i"e! CS&++> :IN#':S %R'.RAMMIN. /) * * )0
The :indows Architecture1 &he Concept of and"ers2 &he concept of =indo3s c"ass2 ;egistering a =indo3 c"ass2 St!"e "i?e CSS ;ED;A=2 Instance hand"ers2 Icon hand"ers2 Cursor hand"ers2 &he concept of =indo3s c"ass2 ;egistering a =indo3 c"ass2 St!"e "i?e CSS ;ED;A=2 Instance hand"ers2 Icon hand"ers2 Cursor hand"ers2 Menu name2 Create a =indo32 C"ass names-predefined and user defined2 =indo3 name2 Dra3 st!"es2 =idth eight etc.2 *arent-Chi"d =indo3s2 &he concept of =indo3 Messages2 Messages Lueue Com5iling and in$ing 3or :indows G Compi"ing for =indo3s2 Memor! mode"s in =indo3s2 ,in?ing2 &he stufi"e IJ' Techni=ues1 Dra3-ac?s of =indo3s2 Screen printing2 determining the si5e of =indo3s2 &he concept of de$ice conte9t2 De$ice conte9t hand"es2 &e9t formatting2 :sing fonts2 the concept of scro"" -ars2 setting scro"" -ar range and position 8e6@oardG 8e!-oard messages2 7irtua" ?e! codes2 *arameters "i?e repeat count2 scan code etc2 S!stem ?e!s "i?e A"t-&a-2 Ctr"-Esc etc. Mouse1 Mouse action2 Mouse messages2 Acti$ating =indo3s2 Change mouse cursors <i"e I/6G =in 3.1 fi"e functions2 0uffered fi"e I/62 Common dia"og -o9es2 6pen fi"e name structure Child :indowsG &he concept of chi"d =indo3s2 Chi"d =indo3 contro"2 Chi"d =indo3 contro" c"asses2 &he static c"ass2 &he -utton c"ass2 0utton messages2 *ush -uttons2 Chec? -o9es2 ;adio -uttons2 Edit c"ass2 Edit contro" messages2 Edit st!"es2 &he "ist -o9 c"ass. Menus1 Creating menus2 3or?ing of menus2 :sing menus Inputs2 Creating pop-ups to top "e$e" menus2 Menu messages2 Menu temp"ates2 :sing s!stem menus2 Messages from menus #ialog Bo"esG Concept2 Contro" state2 3or?ing 3ith dia"og -o9es. %rinting1 6-taining printer4s dri$er content2 determining the printer name2 )otif!ing the print @o-2 *age -rea?s2 determining de$ice capa-i"ities2 printing graphics2 a-out printing. .ra5hics1 <onts2 *ortrait of a character2 &!pes of fonts2 creating "ogica" fonts2 <ont hand"e. .ra5hical #e7ice Inter3aceG )eed2 &he de$ice conte9t2 determining de$ice capa-i"ities. #rawing .ra5hicsG *i9e"s2 ,ines2 ;ectang"es2 and Circ"es. Bitma5sG 0itmap hand"e2 6-taining hand"es2 interna" representation of -itmaps2 Creating -itmaps2 Memor! de$ice conte9t. Memor6 ManagementG Memor! hand"es and "oc?s2 *ro-"ems of =indo3s memor! hand"ing2 Inte"4s segmented memor! architecture2 +02+' protected mode2 the memor! A*I2 8erne" Macros
32
:indows ResourcesG Accessing resources2 "oading techniEues. :indows TimerG &ime?eeping on the *C2 =indo3s interaction 3ith +2#. chip2 the timer A*I function. :indows Chi5@oardG Concept2 &he c"ip-oard A*I2 =or?ing of c"ip-oard2 the concept of c"ip-oard $ie3ers2 C"ip-oard $ie3er message. B''8S REC'MMEN#E#1 1. 2. 3. 4. #. 0en E55e"" 3ith Him 0"ane!2 B)&4/=indo3s .# De$e"oper4s and-oo?C2 0*0 *u-"ications 1..(. Charies *et5o"d2 B*rogramming =indo3s .#C2 Microsoft *ress 1..'. ;ichard H Simson2 B=indo3s )& =in 322 A*I Super 0i-"eC2 SAMS 1..( Hames < 8urose and 8eith = ;oss2 BComputer )et3or?ingC2 *earson Education 2002. )ance2 BIntroduction to )et3or?ingC2 * I 4th Edition 2002.
For ECE #e5tt. CS&+*> #ata Structures and Algorithms G+ * * +H
Introduction1 0asic &ermino"og!2 E"ementar! Data 6rgani5ation2 Structure operations2 A"gorithm Comp"e9it! and &ime-Space trade-off Arra6sG Arra! Definition2 ;epresentation and Ana"!sis2 Sing"e and Mu"tidimensiona" Arra!s2 address ca"cu"ation2 app"ication of arra!s2 Character String in CAA2 Character string operation2 Arra! as *arameters2 6rdered ,ist2 Sparse Matrices and 7ectors. Stac$s1 Arra! ;epresentation and Imp"ementation of stac?2 6perations on Stac?sG *ush % *op2 Arra! ;epresentation of Stac?2 ,in?ed ;epresentation of Stac?2 6perations Associated 3ith Stac?s2 App"ication of stac?G Con$ersion of Infi9 to *refi9 and *ostfi9 E9pressions2 E$a"uation of postfi9 e9pression using stac?. Cueues1 Arra! and "in?ed representation and imp"ementation of Eueues2 6perations on LueueG Create2 Add2 De"ete2 <u"" and Empt!2 Circu"ar Eueues2 D-Eueues and *riorit! Lueues. in$ed listG ;epresentation and Imp"ementation of Sing"! ,in?ed ,ists2 &3o-3a! eader ,ist2 &ra$ersing and Searching of ,in?ed ,ist2 6$erf"o3 and :nderf"o32 Insertion and de"etion to/from ,in?ed ,ists2 Insertion and de"etion A"gorithms2 Dou-"! "in?ed "ist2 ,in?ed ,ist in Arra!2 *o"!nomia" representation and addition2 1enera"i5ed "in?ed "ist2 1ar-age Co""ection and Compaction. TreesG 0asic termino"og!2 0inar! &rees2 0inar! tree representation2 a"ge-raic E9pressions2 Comp"ete 0inar! &ree2 E9tended 0inar! &rees2 Arra! and ,in?ed ;epresentation of 0inar! trees2 &ra$ersing 0inar! trees2 &hreaded 0inar! trees2 &ra$ersing &hreaded 0inar! trees2 uffman a"gorithm . .ra5hs1 &ermino"og! % ;epresentations2 1raphs % Mu"ti-graphs2 Directed 1raphs2 SeEuentia" ;epresentations of 1raphs2 Ad@acenc! Matrices2 &ra$ersa"2 Connected Component and Spanning &rees2 Minimum Cost Spanning &rees. B''8S REC'MMEN#E# 1. oro3it5 and Sahani2 B<undamenta"s of data StructuresC2 1a"gotia *u-"ication *$t. ,td.2 )e3 De"hi. 2. ;. 8ruse eta"2 BData Structures and *rogram Design in CC2 *earson Education Asia2 De"hi-2002 3. A. M. &enen-aum2 BData Structures using C % CAAC2 *rentice- a"" of India *$t. ,td.2 )e3 De"hi. 4. 0runo ; *reiss2 BData Structures and A"gorithms 3ith 6-@ect 6riented Design *attern in CAAC2 Hhon =i"e! % Sons2 Inc. #. 1i"-erg <oro5an 2 BData Structure > A pseudo code approach 3ith CAAC2 Cengage ,earning2 )e3 De"hi. CS&+1> #ata Structures and Algorithm a@. 1. 2. ,iner Search for an arra! of $a"ues. 0inar! Search for an arra! of $a"ues. G* * + 1H
33
3. 4. #. '. (. +. .. 10. 11. 12. 13.
0u--"e Sort for an arra! of $a"ues. *ush. *op and Disp"a! operations of a Stac?. &o con$ert an e9pression in infi9 notation into postfi9 notation. &o e$a"uate an e9pression in postfi9 notation. Insert2 De"ete and Disp"a! operation on a simp"e Eueue. Insert2 De"ete and Disp"a! operation on a circu"ar Eueue. Insertion2 De"etion and Disp"a! of ,in?ed ,ist. Construction of 0inar! Search &ree J0S&K. *re-order tra$ersed of a 0S&. Inorder tra$ersed of a 0S&. *ostorder tra$ersed of a 0S&.
This is only the suggested list of practicals. Instructor may frame additional practicals relevant to the course contents
34
,T! SEMESTER S. No 1. 2. 3. 4. #. '. (. +. .. 10. Course Code CS-301 CS-303 CS-30# CS-399 CS-399 CS-999 CS-311 CS-313 CS-31# CS-399 Course Title Computer )et3or?s Data-ase Management S!stem 6perating S!stems DE-II DE-III 6E -I Computer )et3or?s ,a-orator! Data-ase Management S!stem ,a6perating S!stems ,a-orator! DE-III ,a-. T'TA Course Title Teaching oad , & * 3 0 0 3 0 0 3 0 0 3 1 0 3 0 0 3 0 0 0 0 2 0 0 2 0 0 2 0 0 2 1; 1 ; Credit 3 3 3 4 3 3 1 1 1 1 +) Credit 4 4 4 Credit 3 3 3 1 1 1 %re re=uisite -
S. No 1. 2. 3. S. No 1. 2. 3. 4. #. '.
Course Code CS-321 CS-323 CS-32# Course Code CS-32( CS-32. CS-331 CS-333 CS-33# CS-33(
#E%ARTMENTA E ECTIFE G#EH&II Teaching oad , & * *rincip"es of *rogramming 3 1 0 ,anguages S!stem Ana"!sis and Design 3 1 0 *ara""e" Computing 3 1 0 #E%ARTMENTA E ECTIFE G#EH&III Teaching oad , & * )et3or? *rogramming 3 0 0 S!m-o"ic ,ogic and ,ogic 3 0 0 *rogramming Computer 1raphics % Animations 3 0 0 )et3or? *rogramming ,a-. 0 0 2 S!m-o"ic ,ogic and ,ogic 0 0 2 *rogramming ,aComputer 1raphics % Animations 0 0 2 ,aCourse Title '%EN E ECTIFES G'EH&I Teaching oad , & * Management Information S!stems 3 0 0 :ni9 % She"" *rogramming 2 0 2 &C*/I* 3 0 0 S!m-o"ic ,ogic and ,ogic 3 0 0 *rogramming Computer 1raphics % Animations 3 0 0 Course Title
%re re=uisite %re re=uisite -
S. No 1. 2. 3. 4. #.
Course Code CS-001 CS-002 CS-003 CS-32. CS-331
Credit 3 3 3 3 3
%re re=uisite -
For ECE #e5tt 1. CS-30# 6perating S!stems 3 0 0 3
3#
,th SEMESTER
CS&)*1 C'M%-TER NET:'R8S Introduction1 Introduction to Computer )et3or? and *h!sica" ,a!er T65es o3 Networ$s1 0roadcast and *oint-to-point- ,A)-MA)-=A)- =ire"ess net3or?s. ,a!ered Architecture and Re3erence Models1 ,a!ered architecture- 6SI reference mode"2 &C*/I* reference mode" > Internet *rotoco" Stac? > )et3or? Entities in ,a!ers- Connection oriented and Connection "ess ser$ices2 ATM1 *rotoco" Architecture2 A&M ,ogica" Connections2 A&M Ce""s2 &ransmission of A&M Ce""s2 A&M Adaptation ,a!er2 &raffic and Congestion Contro"2 A&M ,A) Emu"ation Internetwor$ing1 *rincip"es of Internet3or?ing2 Connection"ess Internet3or?ing2 &he Internet *rotoco"2 ;outing *rotoco"2 I*$' JI*ngK2 ICM*$' #istri@uted A55lications1 A-stract S!nta9 )otation 6ne JAS)."K2 )et3or? Management-S)M*722 E"ectronic Mai"-SM&* and MIME2 :niform ;esource ,ocators J:;,K and :ni$ersa" ;esource Identifiers J:;IK2 !perte9t &ransfer *rotoco" J &&*K Networ$ a6er and Routing1 )et3or? Ser$ice mode" > Datagram and 7irtua" circuit ser$ice-;oting princip"es/) * * )0
,in? state routing-distant$ector routing-hierarchica" routing-mu"ticast routing-I1M* Internet *rotoco" JI*KG I*$4 addressing-routing and for3arding datagram-datagram format-datagram fragmentation- ICM*- D C*- )et3or? Address &rans"ators J)A&sK-I*$' pac?et format-transition from I*$4 to I*$'-Mo-i"e I*. ;outing in the InternetG Intra Autonomous S!stem ;outing G ;I* and 6S*<-Inter Autonomous S!stem ;outing G 01* > )et3or? "a!er in A&M. Trans5ort a6er1 &ransport ,a!er Ser$ices-;e"ationship -et3een &ransport ,a!er and )et3or? ,a!er-&ransport ,a!er in Internet-Mu"tip"e9ing and De mu"tip"e9ing. Connection"ess &ransportG :D*-Segment structure-Chec?sum Connection 6riented &ransportG &C*-&C* connection-&C* Segment Structure-;ound trip &ime estimation and &ime out-;e"ia-"e Data transfer-<"o3 contro"-&C* connection Management. Congestion Contro"G Causes and costs of congestion- Approaches to congestion contro"- &C* congestion contro"G <airness-&C* de"a! mode"ing. A&M A0; congestion contro". A&M AA, ,a!er protoco"s. A55lication a6er and Networ$ Securit61 App"ication ,a!er *rotoco"s - === and &&*-<i"e transfer *rotoco"G <&* Commands and ;ep"ies > Domain )ame S!stem JD)SK- SM&* - S)M*- mu"timedia. ;emote *rocedure Ca"". Securit! in Computer )et3or?sG *rincip"es of Cr!ptograph!-S!mmetric ?e!-*u-"ic ?e!-authentication protoco"s -Digita" Signatures > <ire3a ""s. Securit! in different ,a!ersG Secure E-mai"- SS, > I* securit!. B''8S REC'MMEN#E# 1. Hames <. 8urose and 8eith =. ;oss2 Computer )et3or?ing > A &op-Do3n Approach<eaturing the Internet2 2/e *earson Education 22003 2. S. 8esha$2 An Engineering Approach to Computer )et3or?ing2 *earson education 22002 3. <. a"sa""2 Data Communication2 Computer )et3or?s and 6pen S!stems2 Addison =es"e!2 1..' 4. Andre3 S. &anen-aum2 Computer )et3or?s 2 4/e2 *earson education2 2003 #. 0ehrou5 A. <ourou5an 2Data Communications and )et3or?ing2 2/e &at Mc1ra3hi""22000
3'
CS&)*) #ATABASE MANA.EMENT SYSTEM /) * * )0 Introduction1 An o$er$ie3 of data-ase management s!stem2 data-ase s!stem 7s fi"e s!stem2 Data-ase s!stem concepts and architecture2 data mode"s schema and instances2 data independence and data -ase "anguage and interfaces2 Data definitions "anguage2 DM,2 6$era"" Data-ase Structure. #ata Modeling using the Entit6 Relationshi5 Model1 E; mode" concepts2 notation for E; diagram2 mapping constraints2 ?e!s2 Concepts of Super 8e!2 candidate ?e!2 primar! ?e!2 1enera"i5ation2 aggregation2 reduction of an E; diagrams to ta-"es2 e9tended E; mode"2 re"ationships of higher degree. Relational data Model and anguage1 ;e"ationa" data mode" concepts2 integrit! constraintsG entit! integrit!2 referentia" integrit!2 8e!s constraints2 Domain constraints2 re"ationa" a"ge-ra2 re"ationa" ca"cu"us2 tup"e and domain ca"cu"us. Introduction to SC 1 Characteristics of SL,. Ad$antage of SL,. SL, data t!pes and "itera"s. &!pes of SL, commands. SL, operators and their procedure. &a-"es2 $ie3s and inde9es. Lueries and su- Eueries. Aggregate functions. Insert2 update and de"ete operations. Hoins2 :nions2 Intersection2 Minus2 Cursors in SL,. #ata Base #esign 9 NormaliEation1 <unctiona" dependencies2 norma" forms2 first2 second2 third norma" forms2 0C)<2 inc"usion dependences2 "oss "ess @oin decompositions2 norma"i5ation using <D2 M7D2 and HDs2 a"ternati$e approaches to data-ase design. Transaction %rocessing Conce5ts1 &ransaction s!stem2 &esting of seria"i5a-i"it!2 Seria"i5a-i"it! of schedu"es2 conf"ict % $ie3 seria"i5a-"e schedu"e2 reco$era-i"it!2 ;eco$er! from transaction fai"ures2 "og -ased reco$er!2 chec?points2 dead"oc? hand"ing. Crash Reco7er61 <ai"ure c"assification2 reco$er! concepts -ased on deferred update2 reco$er! concepts -ased on intermediate update2 shado3 paging2 chec? points2 on-"ine -ac?up during data-ase updates2 case stud! from a contemporar! data-ase management soft3are Concurrenc6 Control Techni=ues1 Concurrenc! contro"2 "oc?ing &echniEues for concurrenc! contro"2 &ime stamping protoco"s for concurrenc! contro"2 $a"idation -ased protoco"2 mu"tip"e granu"arit!2 Mu"ti $ersion schemes2 ;eco$er! 3ith concurrent transaction. ClientJSer7er #ata@ases1 C"ient/Ser$er concepts2 approach2 C"ient/Ser$er en$ironments2 characteri5ation of C"ient/Ser$er computing2 app"ication partitioning2 the t3o-"a!er2 and the &hree "a!er architecture2 C"ient/Ser$er communication2 A*Is in C"ient/Ser$er computing2 midd"e3are techno"og!2 app"ication de$e"opments2 design concepts2 C"ient app"ication de$e"opment too"s2 and data-ase ser$ers. Integrit6A Securit6 and Re5ositories1 )eeds for data-ase integrit!2 integrit! constraints2 non-procedura" integrit! constraints2 integrit! constraints specifications in SL,2 introduction to data-ase securit! mechanism2 securit! specification in SL,2 s!stem cata"ogues Case Studies1 'racle1 Data-ase Design and Luer!ing &oo"sR SL, 7ariations and E9tensionsR Storage and Inde9ingR Luer! *rocessing and 6ptimi5ationR Concurrenc! Contro" and ;eco$er!R S!stem ArchitectureR ;ep"ication2 Distri-ution and E9terna" DataR Data-ase Administration &oo"s. IBM #B+1 :ni$ersa" data-aseR Data-ase Design and Luer!ing &oo"sR SL, 7ariations and E9tensions Storage and Inde9ingR Luer! *rocessing and 6ptimi5ationR Concurrenc! Contro" and ;eco$er!R S!stem ArchitectureR ;ep"ication2 Distri-ution and E9terna" DataR Data-ase Administration &oo"s. B''8S REC'MMEN#E# 1. 2. 3. 4. Date C H2 BAn Introduction &o Data-ase S!stemC2 Addision =es"e! 8orth2 Si"-ert52 Sudarshan2 BData-ase ConceptsC2 Mc1ra3 i"" E"masri2 )a$athe2 B<undamenta"s 6f Data-ase S!stemsC2 Addision =es"e! 0ipin C. Desai2 BAn introduction to Data-ase S!stemsC2 1a"gotia *u-"ication
3(
#.
;o- and Corone"2 BData-ase S!stems #th EditionC2Cengage ,earning2 )e3 De"hi /) * * )0
CS&)*, '%ERATIN. SYSTEMS
'5erating s6stems o@2ecti7esA ser7ices and 3unctions1 Characteristics of Modern 6perating S!stems2 Characteristics of 0atch and mu"tiprogramming operating s!stems. Comparisons -et3een rea" time s!stems and time-sharing s!stems2 6perating s!stem ser$ices and ?erne" features. IJ' managementA IJ' de7ices1 Introduction to I/6 management2 I/6 de$ices2 Concepts of threading2 6rgani5ation of I/6 functions2 po""ing2 $arious modes of data transfer2 ard3are/Soft3are interface2 I/6 -uffering. #is$ scheduling 5olicies and 5rocesses1 Moti$ation for dis? schedu"ing po"icies2 Introduction to processes management2 operating s!stem $ie3s of processes2 $arious process transition states2 Introduction to *rocessor schedu"ing2 Introduction to $arious t!pes of schedu"ers2 *erformance criteria in schedu"ing a"gorithms2 Concept of <C<S schedu"ing a"gorithm2 Concept of priorit! schedu"ing a"gorithm "i?e SH<2 Concept of non-preempti$e and preempti$e a"gorithms2 Concept of round-ro-in schedu"ing a"gorithm2 2 Concept of mu"ti-"e$e" Eueues2 feed-ac? Eueues. Concurrenc6 control schemes1 7arious approaches to concurrenc! contro" schemes2 Concept of prouder/consumer pro-"em2 Mutua" E9c"usion2 Concept of mutua" e9c"usion first and second a"gorithm2 Concept of mutua" e9c"usion third a"gorithm inc"uding introduction and characteristics of semaphores2 Introduction to Mutua" e9c"usion 3ith semaphores2 Introduction to Interprocess Communication and S!nchroni5ation2 Critica" regions and Conditiona" critica" regions in a Semaphore. Introduction to monitors2 $arious modes of monitors2 Issues in message imp"ementation2 Concept of mutua" e9c"usion 3ith messages. #ead oc$s1 Concept of Dead"oc?s2 issues re"ated to its pre$ention2 a$oidance and detection/reco$er!2 Concept of dead"oc? pre$ention and its a$oidance2 Concept of dead"oc? detection and reco$er!. Memor6 Management1 )eed of Memor! management and its reEuirements2 paging2 segmentation2 concept of fragmentation. Characteristics of contiguous % non-contiguous a""ocation techniEues2 Detai" stud! of fragmentation2 7irtua" memor! management2 introduction to page-rep"acement2 )eed of $arious pagerep"acement po"icies2 Concept of <I<6 and optima" page-rep"acement a"gorithms2 Concept of ,;: appro9imation and its page-rep"acement a"gorithm2 Concept of a""ocation a"gorithms. File management S6stem1 )eed of fi"e management2 its reEuirements2 :ser4s and operating s!stem4s $ie3 of fi"e s!stem2 Concept of fi"e directories and fi"e sharing2 Moti$ation for dis? space management2 Characteristics of fi"e re"ated s!stem ser$ices2 1enera"i5ation of fi"e ser$ices . Boo$s Recommended 1. 2. 3. 4. #. *eterson and Si"-erschat52 B6perating S!stem ConceptsC2 Addison-=es"e! 4th Edition 1..4. Mi"en?o$iac2 B6perating S!stems Concepts and DesignC2 &ata Mc1ra3- i"" 1..2. Char"es Cro3"e!2 B6perating S!stems a Design 6riented ApproachC2 &ata Mc1ra3- i"" 1..'. Andre3s S. &anen-aum2 BModern 6perating S!stemsC2 *earson Education2 2nd edition 2001. = ;ichard Ste$ens2 B ,inu9 )et3or? *rogrammingC * I2 Ist Edition 2003 /* * + 10
CS&)11 C'M%-TER NET:'R8S AB'RAT'RY 1. 2. 3. 4. #. '. (.
Introduction to )et3or? Simu"ator 6*)E&/)S2. E$a"uate Ethernet De"a! and ,oad Statics of S3itched Ethernet Comparati$e in$estigation on u- and S3itch as Interconnecting De$ice for $erif!ing performance of ,A) 3ith $arious app"ications E$a"uate the comparati$e in$estigations on the performance issues of s3itched Ethernet 3ith 7,A) -ased on Emai" and <&* app"ications. E$a"uate Internet connection choice for *C )et3or? on different Data ;ate for =A) -ased on =e- 0ro3sing and Emai" app"ication Imp"ementation of <ire3a""R in a )et3or?. Simu"ation of =ire"ess data )et3or? 3ith different 3ith ph!sica" characteristics.
3+
+. A,6 A *rotoco". .. 10. 11. 12.
Imp"ementation of CSMA/CD *rotoco" and its comparati$e in$estigation 3ith Design and Imp"ementation of Simp"e &ransfer *rotoco" in C/ CAA. Design of su-stitution Cipher in C/ CAA. Design of &ransposition Cipher in C/ CAA. Design of *u-"ic 8e! A"gorithm in C/ CAA.
N Students are ad$ised to use '%NETJNS+ for a-o$e "isted e9periments. This is only the suggested list of Practicals. Instructor may frame additional Practicals relevant to the course contents. CS&)1) #ATABASE MANA.EMENT SYSTEM AB'RAT'RY 1. 2. 3. /* * + 10
=rite the Eueries for Data Definition and Data Manipu"ation "anguage. =rite SL, Eueries using ,ogica" operators JM2T2P2etc.K. =rite SL, Eueries using SL, operators J0et3eenU. A)D2 I)J,istK2 ,i?e2 IS):,, and a"so 3ith negating e9pressions K. 4. =rite SL, Euer! using character2 num-er2 date and group functions. #. =rite SL, Eueries for ;e"ationa" A"ge-ra J:)I6)2 I)&E;SEC&2 and MI):S2 etc.K. '. =rite SL, Eueries for e9tracting data from more than one ta-"e JEEui-Hoin2 )on-EEui-Hoin 2 6uter HoinK (. =rite SL, Eueries for su- Eueries2 nested Eueries. +. =rite programs -! the use of *,/SL,. .. Concepts for ;6,, 0AC82 C6MMI& % C EC8 *6I)&S. 10. Create 7IE=S2 C:;S6;S2 and &;I11;S % 3rite ASSE;&I6)S. 11. Create <6;MS and ;E*6;&S. 12. Creation2 a"tering and droping of ta-"es and inserting ro3s into a ta-"e Juse constraints 3hi"e creating ta-"esK e9amp"es using SE,EC& command. 13. Lueries Ja"ong 3ith su- LueriesK using A)D2 A,,2 I)2 EQIS&S2 )6&EQIS&S2 :)I6)2 I)&E;SE&2 Constraints. E9amp"eG- Se"ect the ro"" num-er and name of the student 3ho secured fourth ran? in the c"ass. 14. Lueries using Aggregate functions JC6:)&2 S:M2 A712 MAQ and MI)K2 1;6:* 0D2 A7I)1 and Creation and dropping of 7ie3s. 1#. Lueries using Con$ersion functions JtoSchar2 toSnum-er and toSdateK2 string functions JConcatenation2 "pad2 rpad2 "trim2 rtrim2 "o3er2 upper2 initcap2 "ength2 su-str and instrK2 date functions JS!sdate2 ne9tSda!2 addSmonths2 "astSda!2 monthsS-et3een2 "east2 greatest2 trunc2 round2 toSchar2 toSdateK 1'. iKCreation of simp"e *,/SL, program 3hich inc"udes dec"aration section2 e9ecuta-"e section and e9ception > and"ing section JE9. Student mar?s can -e se"ected from the ta-"e and printed for those 3ho secured first c"ass and an e9ception can -e raised if no records 3ere foundK iiKInsert data into student ta-"e and use C6MMI&2 ;6,,0AC8 and SA7E*6I)& in *,/SL, -"oc?. 1(. De$e"op a program that inc"udes the features )ES&ED I<2 CASE and CASE e9pression. &he program can -e e9tended using the ):,,I< and C6A,ESCE functions. 1+. *rogram de$e"opment using = I,E ,66*S2 numeric <6; ,66*S2 nested "oops using E;;6; and"ing2 0:I,& >I) E9ceptions2 :SE defined E9ceptions2 ;AISE- A**,ICA&I6) E;;6;. 1.. *rograms de$e"opment using creation of procedures2 passing parameters I) and 6:& of *;6CED:;ES. 20. *rogram de$e"opment using creation of stored functions2 in$o?e functions in SL, Statements and 3rite comp"e9 functions. 21. *rogram de$e"opment using creation of pac?age specification2 pac?age -odies2 pri$ate o-@ects2 pac?age $aria-"es and cursors and ca""ing stored pac?ages. 22. De$e"op programs using features parameters in a C:;S6;2 <6; :*DA&E C:;S6;2 = E;E C:;;E)& of c"ause and C:;S6; $aria-"es. 23. De$e"op *rograms using 0E<6;E and A<&E; &riggers2 ;o3 and Statement &riggers and I)S&EAD 6< &riggers N Students are ad$ised to use #e7elo5er +***J'racle&1*i or higher $ersion or other "atest $ersion for a-o$e "isted e9periments. o3e$er depending upon the a$ai"a-i"it! of soft3are4s2 students ma! use %ower Builder JSC SERFER. Mini *ro@ect ma! a"so -e p"anned % carried out through out the semester to understand the important $arious concepts of Data-ase. This is only the suggested list of Practicals. Instructor may frame additional Practicals relevant to the course contents.
3.
CS&)1, '%ERATIN. SYSTEMS AB'RAT'RY 1. 2. 3. 4. #. '. (. +. ..
/* * + 10
Simu"ation of the C*: schedu"ing a"gorithms aK ;ound ;o-in -K SH< cK <C<S dK *riorit! Simu"ation of M:&EQ and SEMA* 6;ES. Simu"ation of 0an?ers Dead"oc? A$oidance and *re$ention a"gorithms. Imp"ementation of *rocess S!nchroni5ation J;eader-=riter2 S"eeping 0ar-er and Dining *hi"osopher4s *ro-"emK Simu"ation of page ;ep"acement A"gorithms aK <I<6 -K ,;: cK ,<: Simu"ation of paging techniEues of memor! management. Simu"ation of fi"e a""ocation Strategies aK SeEuentia" -K Inde9ed cK ,in?ed Simu"ation of fi"e organi5ation techniEues aK Sing"e ,e$e" Director! -K &3o ,e$e" cK ierarchica" dK DA1 &o automate the a""ocation of I* addresses i.e. to set and configure the D C* ser$er and D C* c"ient.
10. &o share fi"es and directories -et3een ;ed at ,inu9 operating s!stems i.e. &o set and configure the )<S ser$er and )<S c"ients. 11. &o share fi"es and directories -et3een ;ed configure the sam-a ser$er. at ,inu9 and =indo3s operating s!stems i.e. &o set and
12. &o set and configure the D)S JDomain )ame Ser$erK. 13. &o set and configure the print ser$er and to share printers -et3een =indo3s and ;ed s!stems. contents. at ,inu9 operating
This is only the suggested list of Practicals. Instructor may frame additional Practicals relevant to the course
#E%ARTMENTA E ECTIFE G#EH&II CS&)+1 %RINCI% ES 'F %R'.RAMMIN. AN.-A.ES /) 1 * ?0
Introduction1 Characteristics of programming ,anguages2 <actors inf"uencing the e$o"ution of programming "anguage2 de$e"opments in programming methodo"ogies2 desira-"e features and design issues. *rogramming "anguage processorsG Structure and operations of trans"ators2 soft3are simu"ated computer2 s!nta92 semantics2 structure2 $irtua" computers2 -inding and -inding time. Elementar6 and Structured #ata T65es1 Data o-@ect $aria-"es2 constants2 data t!pes2 e"ementar! data t!pes2 dec"aration2 assignment and initia"i5ation2 enumeration2 characters2 strings. Structured data t!pe and o-@ectsG Specification of data structured t!pes2 $ectors and arra!s2 records2 $aria-"e si5e data structure2 pointers and programmer constructed data structure2 Sets fi"es. Su- *rogram and programmer defined data t!pesG E$o"ution of data t!pes2 a-stractions2 encapsu"ations2 information hiding2 su- programmes2 a-stract data t!pes. Se=uence ControlL Imp"icit and E9p"icit seEuence contro"2 seEuence contro" 3ith 3ithin e9pression and statements2 recursi$e su- programmes2 e9ception hand"ing2 co routines2 Schedu"ed su- programmes2 concurrent e9ecution. Data contro" referencing en$ironments2 static and d!namic scope2 "oca" data "oca" data referencing en$ironment2 shared dataG E9p"icit common en$ironment d!namic scope parameter passing mechanism. Storage Management1 Ma@or run time reEuirements2 storage management phases2 static storage management2 stac? -ased2 heap -ased storage management. S!nta9 and trans"ationG 1enera" s!ntactic criteria2 s!ntactic e"ement of a "anguage2 stages in trans"ation2 forma" s!nta9 and semantics. '5erating and %rogramming En7ironment1 0atch *rocessing En$ironments2 Em-edded s!stem reEuirements2 &heoretica" mode"s2 Introduction to <unctiona" *rogramming2 ,am-da ca"cu"us2 Data f"o3 "anguage and 6-@ect 6riented "anguage2 Comparison in $arious genera" and specia" purpose programming "anguages e.g. <ortran2 C2 *asca"2 ,isp2 etc. REFERENCES1 1. &errance = *ratt2 V*rogramming ,anguagesG Design and Imp"ementationV * I
40
2. 3. 4. #.
Se-esta2 VConcept of *rogramming ,anguageV2 Addison =es"e! E oro3it52 V*rogramming ,anguagesV2 2nd Edition2 Addison =es"e! V<undamenta"s of *rogramming ,anguagesV2 1a"gotia. ,ouden2 Bprogramming ,anguages-princip"es and practiceC2 Cengage ,earning2 )e3 De"hi /) 1 * ?0
CS&)+) SYSTEM ANA YSIS AN# #ESI.N S6stem de3inition and conce5ts1 Characteristics and t!pes of s!stem2 Manua" and automated s!stems Real&li3e Business su@&s6stems1 *roduction2 Mar?eting2 *ersona"2 Materia"2 <inance
S6stems models t65es o3 models1 S6stems en$ironment and -oundaries2 ;ea"time and distri-uted s!stems2 0asic princip"es of successfu" s!stems S6stems anal6st1 ;o"e and need of s!stems ana"!st2 Lua"ifications and responsi-i"ities 2S!stems Ana"!st as and agent of change2 Farious 5hases o3 s6stems de7elo5ment li3e c6cle1 Ana"!sis2 Design2 De$e"opment2 Imp"ementation2 Maintenance S6stems documentation considerations1 *rincip"es of s!stems documentation2 &!pes of documentation and their importance2 Enforcing documentation discip"ine in an organi5ation S6stem %lanning1 Data and fact gathering techniEuesG Inter$ie3s2 1roup communication2 *resentations2 Site $isits. <easi-i"it! stud! and its importance &!pes of feasi-i"it! reports S!stem2 Se"ection p"an and proposa" *rotot!ping Cost&Bene3it and anal6sis1 &oo"s and techniEues S6stems #esign and modeling1 *rocess mode"ing2 ,ogica" and ph!sica" design2 Design representation2 S!stems f"o3charts and structured charts2 Data f"o3 diagrams2 Common diagramming con$entions and guide"ines using D<D and E;D diagrams. Data Mode"ing and s!stems ana"!sis2 Designing the interna"sG *rogram and *rocess design2 Designing Distri-uted S!stems. Classi3ication o3 3orms1 Input/output forms design2 :ser-interface design2 1raphica" interfaces4 Modular and structured design1 Modu"e specifications2 Modu"e coup"ing and cohesion2 &op-do3n and -ottom-up design S6stem Im5lementation and Maintenance1 *"anning considerations2 Con$ersion methods2 producers and contro"s2 S!stem acceptance Criteria2 S!stem e$a"uation and performance2 &esting and $a"idation2 S!stems Eua"if! Contro" and assurance2 Maintenance acti$ities and issues. Com5uter s6stem as an e"5ensi7e resource1 Data and Strong media *rocedures and norms for uti"i5ation of computer eEuipment2 Audit of computer s!stem usage2 Audit trai"s T65es o3 threats to com5uter s6stem and control measures1 &hreat to computer s!stem and contro" measures2 Disaster reco$er! and contingenc! p"anning '@2ect 'riented Anal6sis and design1 Introduction to 6-@ect 6riented Ana"!sis and design "ife c!c"e2 o-@ect mode"ingG C"ass Diagrams2 D!namic mode"ingG state diagram2 D!namic mode"ingG seEuence diagramming. Case stud6 o3 the 3ollowing s6stems1 JIK In$entor! Contro" JIIK ;ai"3a! ;eser$ation S!stem JIIIK :ni$ersit! Management S!stem JI7K ospita" management S!stem B''8S REC'MMEN#E# 1. 2. 3. 4. *err! Ed3ards2 BS!stem Ana"!sis and DesignC2 Mc1ra3 i"" 1..3. E"ias M A3ad2 BS!stem Ana"!sis and DesignC2 Mc1ra3 i"" 2002. 8enda"" and 8enda""2 BS!stem Ana"!sis and DesignC *rentice a"" 'th Ed 200#. Hoseph S 7a"acich2 H < 1eorge2 1 offer2 BModern S!stem Ana"!sis and DesignC2 Addison =es"e! 1..+.
41
#.
Sat5inger2 CS!stem Ana"!sis and DesignC2 Cengage ,earning2 )e3 De"hi
CS&)+, %ARA
E C'M%-TIN.
/) 1 * ?0
Introduction1 *aradigms of para""e" computingG S!nchronous - $ector/arra!2 SIMD2 S!sto"icR As!nchronousMIMD2 reduction paradigm. !ardware ta"onom61 <"!nnWs c"assifications2 and"erWs c"assifications. So3tware ta"onom61 8ungWs ta9onom!2 S*MD. A@stract 5arallel com5utational models1 SeEuentia" mode"2 need of a"ternati$e mode"2 para""e" computationa" mode"s such as *;AM2 ,MCC2 !percu-e2 Cu-e Connected C!c"e2 0utterf"!2 *erfect Shuff"e Computers2 &ree mode"2 *!ramid mode"2 <u""! Connected mode"2 *;AM-C;E=2 E;E= mode"s2 simu"ation of one mode" from another one2 Sorting net3or?2 Interconnection ;AMs. *ara""e"ism approaches - data para""e"ism2 contro" para""e"ism. %er3ormance Metrices1 ,a3s go$erning performance measurements. Metrices - speedups2 efficienc!2 uti"i5ation2 communication o$erheads2 sing"e/mu"tip"e program performances2 -enchmar?s. %arallel %rocessors1 &a9onom! and topo"og! - shared memor! mut"iprocessors2 distri-uted memor! net3or?s. *rocessor organi5ation - Static and d!namic interconnections. Em-eddings and simu"ations. %arallel %rogramming1 Shared memor! programming2 distri-uted memor! programming2 o-@ect oriented programming2 data para""e" programming2 functiona" and dataf"o3 programming. Scheduling and %aralleliEation1 Schedu"ing para""e" programs. ,oop schedu"ing. *ara""e"i5ation of seEuentia" programs. *ara""e" programming support en$ironments. B''8S REC'MMEN#E# 1. 2. 3. 4. #. M. H. Luinn. *ara""e" ComputingG &heor! and *ractice 2 Mc1ra3 i""2 )e3 Dor?2 1..4. &. 1. ,e3is and . E"-;e3ini. Introduction to *ara""e" Computing 2 *rentice a""2 )e3 Herse!2 1..2. &. 1. ,e3is. *ara""e" *rogrammingG A Machine-Independent Approach 2 IEEE Computer Societ! *ress2 ,os A"amitos2 1..4. S.1. A?"2 BDesign and Ana"!sis of *ara""e" A"gorithmsC S.1. A?"2 C*ara""e" Sorting A"gorithmC -! Academic *ress #E%ARTMENTA E ECTIFE G#EH&III CS& )+( NET:'R8 %R'.RAMMIN. /) * * )0 Introduction to Networ$ %rogramming1 6SI mode"2 :ni9 standards2 &C* and :D* % &C* connection esta-"ishment and <ormat2 0uffer si5es and "imitation2 standard internet ser$ices2 *rotoco" usage -! common internet app"ication. Soc$ets1 Address structures2 $a"ue > resu"t arguments2 0!te ordering and manipu"ation function and re"ated functions E"ementar! &C* soc?ets > Soc?et2 connect2 -ind2 "isten2 accept2 for? and e9ec function2 concurrent ser$ers. C"ose function and re"ated function. TC% client ser7er1 Introduction2 &C* Echo ser$er functions2 )orma" startup2 terminate and signa" hand"ing ser$er process termination2 Crashing and ;e-ooting of ser$er host shutdo3n of ser$er host. IJ' Multi5le"ing and soc$et o5tions1 I/6 Mode"s2 se"ect function2 0atch input2 shutdo3n function2 po"" function2 &C* Echo ser$er2 getsoc?opt and setsoc?opt functions. Soc?et states2 1eneric soc?et option I*7' soc?et option ICM*7' soc?et option I*7' soc?et option and &C* soc?et options. Elementar6 -#% soc$etsG Introduction :D* Echo ser$er function2 "ost datagram2 summar! of :D* e9amp"e2 ,ac? of f"o3 contro" 3ith :D*2 determining outgoing interface 3ith :D*.
42
Elementar6 name and Address con7ersions1 D)S2 gethost -! )ame function2 ;eso"$er option2 <unction and I*7' support2 uname function2 other net3or?ing information. I%C1 Introduction2 <i"e and record "oc?ing2 *ipes2 <I<6s streams and messages2 )ame spaces2 s!stem I*C2 Message Eueues2 Semaphores. Remote ogin1 &ermina" "ine discip"ines2 *seudo-&ermina"s2 &ermina" modes2 Contro" &ermina"s2 r"ogin 6$er$ie32 ;*C &ransparenc! Issues. B''8S REC'MMEN#E# 1. 2. 3. 4. #. :)IQ )et3or? *rogramming2 7o". I2 Soc?ets A*I2 2nd Edition. - =.;ichard Ste$ens2 *earson Edn. Asia. :)IQ )et3or? *rogramming2 1st Edition2 - =.;ichard Ste$ens. * I. :)IQ SDS&EMS *;61;AMMI)1 :SI)1 CAA & C A)2 * I. :)IQ for programmers and :sers2 3;D Edition2 1;A AM 1,ASS2 8I)1 A0,ES2 *earson Education. Ad$anced :)IQ programming2 2nd edition2 M H ;och?ind pearson education.
CS&)+< SYMB' IC '.IC AN# '.IC %R'.RAMMIN.
/) * * )0
%re5ositional logicG s!nta9 and semanticsG 7a"idit! and conseEuence. )orma" forms. ;epresenting 3or"d ?no3"edge using prepositiona" "ogic. First order logicG =or"d ?no3"edge representation and the need for Euantifiers. S!nta92 semantics $a"idit! conseEuence c"ause norma" from. Introduction to 5rologG S!nta9 of pro"og2 Structured data representation. E9ecution mode" Introduction to *rogramming in *ro"og2 I""ustrati$e e9amp"es. &he connection -et3een "ogic and "ogic programming interpreting "ogic programs in terms of orn c"auses Deduction from c"ause form formu"as reso"ution for prepositiona" "ogic 1round reso"ution. :nification and first order reso"ution S,D reso"utionR the computation and search ru"es. S,D trees and interpretation of non-dec"arati$e features of *ro"og. Ad7anced 5rolog 3eaturesG programming techniEuesG Structura" Induction and ;ecursion2 E9tra ,ogica" featuresG Cut and )egation Case studies. Introduction to FuEE6 logic neural networ$s B''8S REC'MMEN#E#1 1. 2. 3. 4. #. Sto""2 set &heor! and "ogic2 Do$er pu-"ishers2 )e3 Dor?2 1.'3. C"oc?sin2 =.<. and Me""ish2 C.S.2 *rogramming in *ro"og 2nd edition2 Springer - 7er"ag2 1.+4 1ries2 &he Science of *rogramming2 )arosa *u-"ishers2 1.+# 6W 8eefe2 ;.2 &he Craft of *ro"og. &he MI& *ress2 1..1. ,"o!d2 H. =.2 <oundation of ,ogic *rogramming2 Springer2 1.+4. /) * * )0
CS&))1 C'M%-TER .RA%!ICS AN# ANIMATI'N
Introduction1 Introduction2 App"ication areas of Computer 1raphics2 o$er$ie3 of graphics s!stems2 $ideo-disp"a! de$ices2 raster-scan s!stems2 random scan s!stems2 graphics monitors and 3or? stations and input de$ices 'ut5ut 5rimiti7es1 *oints and "ines2 "ine dra3ing a"gorithms2 mid-point circ"e and e""ipse a"gorithms. <i""ed area primiti$esG Scan "ine po"!gon fi"" a"gorithm2 -oundar!-fi"" and f"ood-fi"" a"gorithms +&# geometrical trans3orms1 &rans"ation2 sca"ing2 rotation2 ref"ection and shear transformations2 matri9 representations and homogeneous coordinates2 composite transforms2 transformations -et3een coordinate s!stems.
43
+&# 7iewing1 &he $ie3ing pipe"ine2 $ie3ing coordinate reference frame2 3indo3 to $ie3-port coordinate transformation2 $ie3ing functions2 Cohen-Suther"and and C!rus--ec? "ine c"ipping a"gorithms2 Suther"and > odgeman po"!gon c"ipping a"gorithm. )&# o@2ect re5resentation1 *o"!gon surfaces2 Euadric surfaces2 sp"ine representation2 ermite cur$e2 0e5ier cur$e and 0-Sp"ine cur$es2 0e5ier and 0-Sp"ine surfaces. 0asic i""umination mode"s2 po"!gon rendering methods. )&# .eometric trans3ormations1 &rans"ation2 rotation2 sca"ing2 ref"ection and shear transformations2 composite transformations. )&# 7iewing1 7ie3ing pipe"ine2 $ie3ing coordinates2 $ie3 $o"ume and genera" pro@ection transforms and c"ipping. Fisi@le sur3ace detection methods1 C"assification2 -ac?-face detection2 depth--uffer2 scan-"ine2 depth sorting2 0S*tree methods2 area su--di$ision and octree methods. Com5uter animation1 Design of animation seEuence2 genera" computer animation functions2 raster animation2 computer animation "anguages2 ?e! frame s!stems2 motion specifications. B''8S REC'MMEN#E# 1. 2. 3. 4. #. BComputer 1raphicsC2 second Edition2 Dona"d earn and M.*au"ine 0a?er2 * I/*earson Education. BComputer 1raphics Second editionC2 Ihigand 9iang2 ;o! *"astoc?2 Schaum4s out"ines2 &ata Mc- 1ra3 hi"" edition. *rocedura" e"ements for Computer 1raphics2 Da$id < ;ogers2 &ata Mc 1ra3 hi""2 2nd edition. B*rincip"es of Interacti$e Computer 1raphicsC2 )euman and Sprou"2 &M .2 BComputer 1raphics *rincip"es % practiceC2 second edition in C2 <o"e!2 7anDam2 <einer and ughes2 *earson Education NET:'R8 %R'.RAMMIN. AB /* * + 10
CS&))) '@2ecti7es1
&o teach students $arious forms of I*C through :ni9 and soc?et *rogramming 1. Imp"ement the fo""o3ing forms of I*C. aK *ipes -K <I<6 1. Imp"ement fi"e transfer using Message Lueue form of I*C 2. =rite a programme to create an integer $aria-"e using shared memor! concept and increment the $aria-"e simu"taneous"! -! t3o processes. :se senphores to a$oid race conditions 3. Design &C* iterati$e C"ient and ser$er app"ication to re$erse the gi$en input sentence 4. Design &C* iterati$e C"ient and ser$er app"ication to re$erse the gi$en input sentence #. Design &C* c"ient and ser$er app"ication to transfer fi"e '. Design a &C* concurrent ser$er to con$ert a gi$en te9t into upper case using mu"tip"e9ing s!stem ca"" Bse"ectC (. Design a &C* concurrent ser$er to echo gi$en set of sentences using po"" functions +. Design :D* C"ient and ser$er app"ication to re$erse the gi$en input sentence .. Design :D* C"ient ser$er to transfer a fi"e 10. Design using po"" c"ient ser$er app"ication to mu"tip"e9 &C* and :D* reEuests for con$erting a gi$en te9t into upper case. 11. Design a ;*C app"ication to add and su-tract a gi$en pair of integers This is only the suggested list of Practicals. Instructor may frame additional Practicals relevant to the course contents
44
CS&)), SYMB' IC '.IC AN# '.IC %R'.RAMMIN. AB'RAT'RY 1. 2. 3. 4. #. '. (. +. .. 10. 11. 12. 13. 14. 1#. 1'. 1(. 1+.
/* * + 10
Stud! of *ropositiona" ,ogic Stud! of <irst 6rder *redicate ,ogic Introduction to pro"og programming -! a simp"e pro"og program *rogram to chec? 3hether input is a"pha-et or not *rogram to find if gi$en num-er is positi$e or negati$e. =rite a program to chec? 3hether a gi$en person is a mem-er of C"u*rogram in pro"og sho3ing mapping that is constructing ne3 structure simi"ar to o"d one. *rogram i""ustrating the use of recursion that is finding sum of first ) integers. *rogram to find the "ength of a "ist using F;ecursion4 and then using Brecursion and Accumu"ators4R *rogram to find the factoria" of a num-er using recursion and accumu"ators and cut. *rogram to ca"cu"ate a$erage ta9 i""ustrating cut-fai" com-ination usage. *rogram sho3ing use of cut in &erminating a Fgenerate and test4. *rogram to p"a! B&ic &ac &oeC =rite a program to generate fi-onacci series upto the gi$en no. =rite a program 3hich accepts an! num-er and chec?s 3hether it is prime or not. &o descri-e some -asic predicates that are usefu" for manipu"ating "ists. .*rogram for 0u--"e Sort *rogram for Insertion Sort
This is only the suggested list of Practicals. Instructor may frame additional Practicals relevant to the course contents CS&))( C'M%-TER .RA%!ICS AN# ANIMATI'N AB'RAT'RY 1. 2. 3. 4. #. '. (. +. .. &o dra3 a "ine using DDA A"gorithm. &o dra3 a "ine using 0resenham4s A"gorithm. &o dra3 a circ"e using trigonometric A"gorithm. &o dra3 a circ"e using 0resenham4s A"gorithm. &o dra3 a circ"e using Midpoint A"gorithm. &o dra3 an e""ipse using &rigonometric A"gorithm. &o dra3 an e""ipse using Midpoint A"gorithm. &o trans"ate an o-@ect 3ith trans"ation parameters in Q and D directions. &o sca"e an o-@ect 3ith sca"ing factors a"ong Q and D directions. /* * + 10
10. &o rotate an o-@ect 3ith a certain ang"e. 11. &o perform composite transformations of an o-@ect. 12. &o c"ip "ine segments against 3indo3s. 13. Demonstrate the properties of 0e5ier Cur$e. 14. ;un a samp"e session on Microsoft =indo3s inc"uding the use of *aint-rush. 1#. Imp"ementation of simp"e graphics animation. This is only the suggested list of Practicals. Instructor may frame additional Practicals relevant to the course contents
4#
'%EN E ECTIFES G'EH&I CS&**1 MANA.EMENT INF'RMATI'N SYSTEMS /) * * )0
Management In3ormation S6stems1 A Framewor$1 Importance of MISR Management Information S!stem G A Concept J Management2 Information2 S!stemKR MIS G A Definition JInformation &echno"og! and MISKR )ature and Scope of MIS J MIS Characteristics2 MIS <unctionsK. Structure and Classi3ication o3 MIS 1 Structure of MIS JMIS Structure 0ases on *h!sica" Components2 Information S!stem *rocessing <unctions2 Decision Support2 ,e$e"s of Management Acti$ities2 6rganisationa" <unctionsKR MIS C"assification J&ransaction *rocessing S!stem2 Management Information S!stem JMISK2 Decision Support S!stem JDSSK2 E9ecuti$e Support S!stem2 6ffice Automation S!stems J6ASsK2 0usiness E9pert S!stems J0ESsKR <unctiona" Information S!stem J<inancia" Information S!stem2 Mar?eting Information S!stem2 *roduction/Manufacturing Information S!stem2 uman ;esource Information S!stem. #ecision Ma$ing and MIS 1 Decision-Ma?ing2 Simon4s Mode" of Decision-Ma?ing2 &!pes of Decisions J*urpose of Decision-Ma?ing2 ,e$e" of *rogramma-i"it!2 8no3"edge of 6utcomesKR Methods for Choosing Among A"ternati$es JDecision &heor! or Decision Ana"!sis2 :ti"it!2 Decision &ree2 6ptimi5ation &echniEuesKR Decision Ma?ing and MIS. In3ormation and S6stem Conce5ts 1 Information G A DefinitionR &!pes of Information JStrategic Information2 &actica" Information2 6perationa" InformationKR Information Lua"it!R Dimensions of Information JEconomic Dimension2 0usiness Dimension2 &echnica" DimensionKR S!stem G Definition JMu"tip"e Meaning of the =ord FS!stem4KR 8inds of S!stems JA-stract and *h!sica" S!stems2 Deterministic and *ro-a-i"istic S!stems2 6pen and C"osed S!stems2 :ser-Machine S!stemsKR S!stem ;e"ated Concepts J0oundar!2 Interface and 0"ac? 0o92 S!stem Decomposition2 Integration of Su--S!stemsKR E"ements of a S!stemR uman as an Information *rocessing S!stem JInformation <i"tering2 uman Differences in Information *rocessing2 Imp"ications for Information S!stemsK. S6stem #e7elo5ment A55roaches 1 S!stem De$e"opment Stages JS!stem In$estigation2 S!stem Ana"!sis2 S!stem Design2 Construction and &esting2 Imp"ementation2 MaintenanceKR S!stem De$e"opment Approaches J=aterfa"" Mode"2 *rotot!ping2 Iterati$e Enhancement Mode"2 Spira" Mode". S6stem Anal6sis 1 IntroductionR ;eEuirement Determination J:nderstand the *rocess2 Identif! Data :sed and Information 1enerated2 Determine <reEuenc!2 &iming and 7o"ume2 8no3 the *erformance Contro"sKR Strategies for reEuirement Determination JInter$ie32 Luestionnaire2 ;ecord ;e$ie32 6-ser$ationKR Structured Ana"!sis &oo"s JData <"o3 Diagram2 Data Dictionar!2 Decision &ree and Structured Eng"ish2 Decision &a-"eK. S6stem #esign 1 Design o-@ecti$esR Conceptua" Design JDefine *ro-"em2 Set S!stem 6-@ecti$es2 Identif! constraints2 determine information needs2 determine information sources2 de$e"op $arious designs2 documentation of the conceptua" design2 report preparationKR Design MethodsR Detai"ed S!stem Design J*ro@ect *"anning and Contro"2 In$o"$e the user2 detai"ed su-s!stem definition2 output/input design2 feed-ac? from the user2 data-ase design2 procedure design2 design documentationK. Im5lementation and E7aluation o3 MIS 1 Imp"ementation process Jp"anning and imp"ementation2 acEuisition of faci"ities and space p"anning2 MIS 6rgani5ation and procedure de$e"opment2 :ser training2 acEuisition of hard3are and soft3are2 Creation of forms and data-ase2 &esting2 Change 6$erKR ard3are and Soft3are Se"ection J;eEuirements ana"!sis2 *reparation of &ender Specifications2 In$iting &enders2 &echnica" scrutin! and short-"isting2 Detai"ed E$a"uation2 )egotiations and *rocurement Decisions2 De"i$er! and Insta""ation2 *ost Insta""ation ;e$ie3KR E$a"uation of MIS JE$a"uation Approaches2 E$a"uation C"asses2 *roduct 0ased MIS E$a"uation2 Cost/0enefit 0ased E$a"uationKR S!stem Maintenance JCorrecti$e Maintenance2 Adapti$e Maintenance2 *erfecti$e MaintenanceK. In3ormation S6stem %lanning 1 Information S!stem *"anningR *"anning &ermino"og! JMission2 6-@ecti$es2 Strategies2 *o"iciesKR &he )o"an Stage Mode"R &he <our Stage Mode" of IS *"anning JStrategic *"anning2 Information ;eEuirement Ana"!sis2 ;esource A""ocation2 *ro@ect *"anningKR Se"ecting a Methodo"og!R Information ;esource Management JI;MKR 6rgani5ation Structure and ,ocation of MIS. In3ormation S6stem as an Ena@ler 1 IntroductionR Changing Concepts of IS JInformation as a necessar! E$i"2 Information for 1enera" Management Support2 Information for decision ma?ing2 Information as a Strategic ;esourceKR IS as an Ena-"er JCompetiti$e ad$antage2 6rgani5ationa" Change2 6rgani5ationa" ,earningK. B''8S REC'MMEN#E#
4'
1. 2. 3. 4. #.
D. 0odd!2 A. 0oonstra2 and 1. 8enned!.2C Managing Information S!stemsG An 6rgani5ationa" *erspecti$eC2 2nd Edition2 *rentice a""2 2004. D. 8.C. ,audon. and H.*. ,audon.2C Management Information S!stemsG Managing the Digita" <irmC2 +th Edition2 *rentice a""2 2004. E. &ur-an2 E. Mc,ean and H. =ether-e2C Information &echno"og! for ManagementG &ransforming 6rgani5ations in the Digita" Econom!C2 4th edition2 =i"e!2 2004. Mudricm2 ; 1 2 ;oss H E 2 C"ogget H ;2BInformation s!stem for Modern ManagementC2 *rintce a"" Eff!o52 BManagement Information S!stemBCengage ,earning2 )e3 De"hi
CS&**+ -NIK AN# S!E
%R'.RAMMIN.
/+ * + )0
Introduction to -ni"1& Architecture of :ni92 <eatures of :ni9 2 :ni9 Commands > *A& 2 man2 echo2 printf2 script2 pass3d2 uname2 3ho2 date2 stt!2 p3d2 cd2 m?dir2 rmdir2 "s2 cp2 m$2 rm2 cat2 more2 3c2 "p2 od2 tar2 g5ip. -ni" -tilities1& Introduction to uni9 fi"e s!stem2 $i editor2 fi"e hand"ing uti"ities2 securit! -! fi"e permissions2 process uti"ities2 dis? uti"ities2 net3or?ing commands2 un"in?2 du2 df2 mount2 umount2 find2 unmas?2 u"imit2 ps2 32 finger2 arp2 ftp2 te"net2 r"ogin.&e9t processing uti"ities and -ac?up uti"ities 2 detai"ed commands to -e co$ered are tai"2 head 2 sort2 n"2 uniE2 grep2 egrep2 fgrep2 cut2 paste2 @oin2 tee2 pg2 comm2 cmp2 diff2 tr2 a3?2 Cpio Introduction to Shells1 :ni9 Session2 Standard Streams2 ;edirection2 *ipes2 &ee Command2 Command E9ecution2 Command-,ine Editing2 Luotes2 Command Su-stitution2 Ho- Contro"2 A"iases2 7aria-"es2 *redefined 7aria-"es2 6ptions2 She""/En$ironment Customi5ation. Filters 1 <i"ters and *ipes2 Concatenating fi"es2 Disp"a! 0eginning and End of fi"es2 Cut and *aste2 Sorting2 &rans"ating Characters2 <i"es 3ith Dup"icate ,ines2 Count characters2 =ords or ,ines2 Comparing <i"es. .re5 1 6peration2 grep <ami"!2 Searching for <i"e Content. Sed 1 Scripts2 6peration2 Addresses2 commands2 App"ications2 grep and sed. aw$1 E9ecution2 <ie"ds and ;ecords2 Scripts2 6perations2 *atterns2 Actions2 Associati$e Arra!s2 String <unctions2 String <unctions2 Mathematica" <unctions2 :ser > Defined <unctions2 :sing S!stem commands in a3?2 App"ications2 a3? and grep2 sed and a3?. Interacti7e 8orn Shell1 8orn She"" <eatures2 &3o Specia" <i"es2 7aria-"es2 6utput2 Input2 E9it Status of a Command2 e$a" Command2 En$ironmenta" 7aria-"es2 6ptions2 Startup Scripts2 Command istor!2 Command E9ecution *rocess. 8orn Shell %rogramming1 0asic Script concepts2 E9pressions2 DecisionsG Ma?ing Se"ections2 ;epetition2 specia" *arameters and 7aria-"es2 changing *ositiona" *arameters2 Argument 7a"idation2 De-ugging Scripts2 Script E9amp"es. Interacti7e C Shell1 C she"" features2 &3o Specia" <i"es2 7aria-"es2 6utput2 Input2 E9it Status of a Command2 e$a" Command2 En$ironmenta" 7aria-"es2 6n-6ff 7aria-"es2 Startup and Shutdo3n Scripts2 Command istor!2 Command E9ecution Scripts. C Shell %rogramming1 0asic Script concepts2 E9pressions2 DecisionsG Ma?ing Se"ections2 ;epetition2 specia" *arameters and 7aria-"es2 changing *ositiona" *arameters2 Argument 7a"idation2 De-ugging Scripts2 Script E9amp"es. File Management1 <i"e Structures2 S!stem Ca""s for <i"e Management > create2 open2 c"ose2 read2 3rite2 "see?2 "in?2 s!m"in?2 un"in?2 stat2 fstat2 "stat2 chmod2 cho3n2 Director! A*I > opendir2 readdir2 c"osedir2 m?dir2 rmdir2 umas?.
4(
B''8S REC'MMEN#E# 1. 2. 3. 4. #. :ni9 and she"" *rogramming 0ehrou5 A. <orou5an2 ;ichard <. 1i"-erg.&homson Dour :ni9 the u"timate guide2 Sumita-ha Das2 &M . 2nd Edition. :ni9 for programmers and users2 3rd edition2 1raham 1"ass2 8ing A-"es2 *earson Education. :ni9 programming en$ironment2 8ernighan and *i?e2 * I. / *earson Education 0eginning she"" scripting2 E. <oster > Hohnson % other2 =i"e D- India. %R'.RAMMIN. AB
-NIK AN# S!E
&o teach students $arious uni9 uti"ities and she"" scripting 1. aK ,ogin to the s!stem -K :se the appropriate command to determine !our "ogin she"" cK :se the /etc/pass3d fi"e to $erif! the resu"t of step -. dK :se the 3ho command and redirect the resu"t to a fi"e ca""ed m!fi"e1. :se the more command to see the contents of m!fi"e1. eK :se the date and 3ho commands in seEuence Jin one "ineK such that the output of date 3i"" disp"a! on the screen and the output of 3ho 3i"" -e redirected to a fi"e ca""ed m!fi"e2. :se the more command to chec? the contents of m!fi"e2. 2K aK =rite a sed command that de"etes the first character in each "ine in a fi"e. -K =rite a sed command that de"etes the character -efore the "ast character in each "ine in a fi"e. cK =rite a sed command that s3aps the first and second 3ords in each "ine in a fi"e. 3. aK *ipe !our /etc/pass3d fi"e to a3?2 and print out the home director! of each user. -K De$e"op an interacti$e grep script that as?s for a 3ord and a fi"e name and then te""s ho3 man! "ines contain that 3ord. cK ;epeat dK *art using a3? 4. aK =rite a she"" script that ta?es a command >"ine argument and reports on 3hether it is director!2 a fi"e2 or something e"se. -K =rite a she"" script that accepts one or more fi"e name as arguments and con$erts a"" of them to uppercase2 pro$ided the! e9ist in the current director!. cK =rite a she"" script that determines the period for 3hich a specified user is 3or?ing on the s!stem. #. aK =rite a she"" script that accepts a fi"e name starting and ending "ine num-ers as arguments and disp"a!s a"" the "ines -et3een the gi$en "ine num-ers. -K =rite a she"" script that de"etes a"" "ines containing a specified 3ord in one or more fi"es supp"ied as arguments to it. '. aK =rite a she"" script that computes the gross sa"ar! of a emp"o!ee according to the fo""o3ing ru"esG iK If -asic sa"ar! is T 1#00 then ;A M10O of the -asic and DA M.0O of the -asic. iiK If -asic sa"ar! is PM1#00 then ;A M;s#00 and DAM.+O of the -asic. &he -asic sa"ar! is entered interacti$e"! through the ?e! -oard. -K =rite a she"" script that accepts t3o integers as its arguments and computers the $a"ue of first num-er raised to the po3er of the second num-er. (. aK =rite an interacti$e fi"e-hand"ing she"" program. ,et it offer the user the choice of cop!ing2 remo$ing2 renaming2 or "in?ing fi"es. 6nce the user has made a choice2 ha$e the program as? the user for the necessar! information2 such as the fi"e name2 ne3 name and so on. -K =rite she"" script that ta?es a "ogin name as command > "ine argument and reports 3hen that person "ogs in cK =rite a she"" script 3hich recei$es t3o fi"e names as arguments. It shou"d chec? 3hether the t3o fi"e contents are same or not. If the! are same then second fi"e shou"d -e de"eted. +. aK =rite a she"" script that disp"a!s a "ist of a"" the fi"es in the current director! to 3hich the user has read2 3rite and e9ecute permissions. -K De$e"op an interacti$e script that as? for a 3ord and a fi"e name and then te""s ho3 man! times that 3ord occurred in the fi"e.
4+
cK =rite a she"" script to perform the fo""o3ing string operationsG iK &o e9tract a su--string from a gi$en string. iiK &o find the "ength of a gi$en string. .. =rite a C program that ta?es one or more fi"e or director! names as command "ine input and reports the fo""o3ing information on the fi"eG iK <i"e t!pe iiK )um-er of "in?s iiiK ;ead2 3rite and e9ecute permissions i$K &ime of "ast access J)oteG :se stat/fstat s!stem ca""sK 10. =rite C programs that simu"ate the fo""o3ing uni9 commandsG aK m$ -K cp J:se s!stem ca""sK 11. =rite a C program that simu"ates "s Command J:se s!stem ca""s / director! A*IK CS&**) TC%JI% /) * * )0
TC%JI% Fundamentals 1 6$er$ie3 of 6SI and &C*/I* ;eference Mode"2 :nderstand the functioning of &C*/I* "a!ers and protoco"s. Concept of *h!sica"2 Internet % *ort addresses .:nderstanding I* addressing scheme2 6$er$ie3 of emergence of su- net3or?s and CID;. AR% and RAR%1 A;* *ac?et format2 Encapsu"ation % 6peration2 Design of a simp"e A;* *ac?age. ;A;* *ac?et <ormat2 Encapsu"ation and a"ternati$e so"utions to ;A;*. Internet %rotocol1 *osition of I* in the &C*/I* stac?2 I* Datagram format2 Datagram <ragmentation2 6ptions2 Chec?sum2 Design of a simp"e I* *ac?age. Internet Control Message %rotocol 1 *osition of ICM* in the net3or? "a!er2 Different t!pes of ICM* Messages2 Message format2 Error ;eporting2 Different t!pes of Luer! Messages2 Chec?sum2 Design of a simp"e ICM* *ac?age. Internet .rou5 Management %rotocol1 1roup Management2 I1M* Messages2 I1M* 6peration2 Encapsu"ation2 Design of a simp"e I1M* *ac?age. -ser #atagram %rotocol1 *osition of :D* in the &C*/I* stac?2 *rocess to *rocess Communication2 :ser Datagram2 Chec?sum2 :D* 6peration2 :se of :D*2 Design of a simp"e :D* *ac?age. Transmission Control %rotocol1 Difference -et3een host-to-host and process-to-process communication2 &C* Ser$ices2 <"o3 Contro"2 Si""! =indo3 S!ndrome2 Error Contro"2 &C* &imers2 Congestion Contro"2 6ptions2 Chec?sum2 &C* Connection2 :se of state transition diagram2 &C* operation2 Design of a simp"e &C* *ac?age. Routing %rotocols1 Detai"ed stud! of Interior and E9terior ;outing protoco"s "i?e ;I*26S*< % 01*2 Mu"ticasting and mu"ticast routing protoco"s "i?e D7M;*2M6S*<2C0&2*IM2M06)E B''T% and #!C%1 066&* *ac?et format2 6perationR D C* *ac?et format 2D C* &ransition Diagram. #omain Name S6stem1 <"at )ame Space % ierarchica" )ame Space2 Domain )ame Space2 Distri-ution of )ame Space2 D)S in the Internet2 )ame Address ;eso"ution2 D)S Messages2 &!pes of records used in D)S2 E9amp"es of D)S Eueries and responses2 DD)S TE NET and Rlogin1 Concept of "oca" and remote "ogin2 )et3or? 7irtua" &ermina"2 )7& Character Set2 &E,)E& 6ptions2 6ption )egotiation2 Mode of operation2 Some e9amp"es of &E,)E& interaction -et3een the c"ient and the ser$er. Difference -et3een &E,)E& % ;"ogin . FT% and TFT% 1 )eed of <&* and &<&* and difference -et3een them2 0asic mode" of <&*2 <&* connections and command processing2 Different t!pes of &<&* messages2 &<&* Connection and data transfer.
4.
SMT% and SNM% 1 SM&* Concept 2 :ser agents and mai" transfer agents2 format of an e-mai"2 Comp"ete process of sending and recei$ing mai"2 :se of A"iases2 Mai" &ransfer *hases2 Mai" Access *rotoco"s "i?e *6*3 and IMA*4.Mu"tipurpose Internet Mai" E9tension *rotoco". ;o"e and detai"s of S)M*2 SMI % MI0 in net3or? management protoco" . !TT% and !TM 1 &&* &ransaction 2 ;eEuest and ;esponse Messages2 &&* eaders and simp"e e9amp"es of &&* reEuest and response messages. =or"d =ide =e-2 !perte9t and !permedia 0ro3ser Architecture2 Static Documents2 !perte9t Mar?up ,anguage2 D!namic Documents2 Common 1ate3a! Interface2 Acti$e Documents2 &M, Document. B''8S REC'MMEN#E# 1. 2. 3. 4. #. 8aran@it and &im *ar?er2 BTCP/IP UnleashedC2 Ed *earson Education J2002K Doug"as E Comer2 BTCP/IP Principles, Protocols, and ArchitectureC2 Ed * I J2000K Doug"as E Comer2 BTCP/IP Design, Implementation and InternalsC2 Ed * I J2000K Hames < 8urose and 8eith = ;oss2 BComputer Net or!ingC2 *earson Education J2002K 0ehrou5 A. <orou5an B &C*/I* *rotoco" SuiteC2 &ata Mc1;A=- I,, J2004K
For ECE #e5tt CS&)*, '5erating S6stems G) * * )H
'5erating s6stems o@2ecti7esA ser7ices and 3unctions1 Characteristics of Modern 6perating S!stems2 Characteristics of 0atch and mu"tiprogramming operating s!stems. Comparisons -et3een rea" time s!stems and time-sharing s!stems2 6perating s!stem ser$ices and ?erne" features. IJ' managementA IJ' de7ices1 Introduction to I/6 management2 I/6 de$ices2 Concepts of threading2 6rgani5ation of I/6 functions2 po""ing2 $arious modes of data transfer2 ard3are/Soft3are interface2 I/6 -uffering. #is$ scheduling 5olicies and 5rocesses1 Moti$ation for dis? schedu"ing po"icies2 Introduction to processes management2 operating s!stem $ie3s of processes2 $arious process transition states2 Introduction to *rocessor schedu"ing2 Introduction to $arious t!pes of schedu"ers2 *erformance criteria in schedu"ing a"gorithms2 Concept of <C<S schedu"ing a"gorithm2 Concept of priorit! schedu"ing a"gorithm "i?e SH<2 Concept of non-preempti$e and preempti$e a"gorithms2 Concept of round-ro-in schedu"ing a"gorithm2 2 Concept of mu"ti-"e$e" Eueues2 feed-ac? Eueues. Concurrenc6 control schemes1 7arious approaches to concurrenc! contro" schemes2 Concept of prouder/consumer pro-"em2 Mutua" E9c"usion2 Concept of mutua" e9c"usion first and second a"gorithm2 Concept of mutua" e9c"usion third a"gorithm inc"uding introduction and characteristics of semaphores2 Introduction to Mutua" e9c"usion 3ith semaphores2 Introduction to Interprocess Communication and S!nchroni5ation2 Critica" regions and Conditiona" critica" regions in a Semaphore. Introduction to monitors2 $arious modes of monitors2 Issues in message imp"ementation2 Concept of mutua" e9c"usion 3ith messages. #ead oc$s1 Concept of Dead"oc?s2 issues re"ated to its pre$ention2 a$oidance and detection/reco$er!2 Concept of dead"oc? pre$ention and its a$oidance2 Concept of dead"oc? detection and reco$er!. Memor6 Management1 )eed of Memor! management and its reEuirements2 paging2 segmentation2 concept of fragmentation. Characteristics of contiguous % non-contiguous a""ocation techniEues2 Detai" stud! of fragmentation2 7irtua" memor! management2 introduction to page-rep"acement2 )eed of $arious pagerep"acement po"icies2 Concept of <I<6 and optima" page-rep"acement a"gorithms2 Concept of ,;: appro9imation and its page-rep"acement a"gorithm2 Concept of a""ocation a"gorithms. File management S6stem1 )eed of fi"e management2 its reEuirements2 :ser4s and operating s!stem4s $ie3 of fi"e s!stem2 Concept of fi"e directories and fi"e sharing2 Moti$ation for dis? space management2 Characteristics of fi"e re"ated s!stem ser$ices2 1enera"i5ation of fi"e ser$ices .
#0
Boo$s Recommended 1. 2. 3. 4. #. *eterson and Si"-erschat52 B6perating S!stem ConceptsC2 Addison-=es"e! 4th Edition 1..4. Mi"en?o$iac2 B6perating S!stems Concepts and DesignC2 &ata Mc1ra3- i"" 1..2. Char"es Cro3"e!2 B6perating S!stems a Design 6riented ApproachC2 &ata Mc1ra3- i"" 1..'. Andre3s S. &anen-aum2 BModern 6perating S!stemsC2 *earson Education2 2nd edition 2001. = ;ichard Ste$ens2 B ,inu9 )et3or? *rogrammingC * I2 Ist Edition 2003
#1
>T! SEMESTER S. No 1. 2. 3. 4. #. '. (. +. .. Course Code CS-302 CS-304 M-201 CS-30' CS-999 CS-999 CS-314 CS-31' CS-399 Course Title &heor! of Computation Information Securit! S!stems Engineering Economics and Industria" Management Soft3are Engineering DE- I7 6E-II Information Securit! S!stems ,a-orator! Soft3are Engineering ,a-. DE-I7 ,a-. T'TA Course Title , 3 3 3 3 3 3 0 0 0 1; Teaching oad & * 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 4 2 2 ; Credit 4 3 3 3 3 3 2 1 1 +) Credit 3 3 3 1 1 1 %re re=uisite %re re=uisite -
S. No 1. 2. 3. 4. #. '.
Course Code CS-322 CS-324 CS-32' CS-32+ CS-330 CS-332
#E%ARTMENTA E ECTIFE G#EH&IF Teaching oad , & * Data Mining and Data 3 0 0 =arehousing =ire"ess )et3or?s 3 0 0 igh *erformance Communication )et3or?s Data Mining and Data =arehousing ,a-. =ire"ess )et3or?s ,a-. igh *erformance Communication )et3or?s ,a-. Course Title 3 0 0 0 0 0 0 0 0 2 2 2
S. No 1. 2. 3. 4. #.
Course Code CS-004 CS-00# CS-00' CS-30' CS-32+
'%EN E ECTIFES G'EH&II Teaching oad , & * Decision support S!stems 3 0 0 )eura" )et3or?s And <u55! ,ogic 3 0 0 *er$asi$e Computing 3 0 0 Soft3are Engineering 3 0 0 Data Mining and Data 3 0 0 =arehousing
Credit 3 3 3 3 3
%re re=uisite -
#2
>th SEMESTER
CS&)*+ T!E'RY 'F C'M%-TATI'N /) 1 * ?0
Basics in Theor6 o3 Com5utations1 0asic concepts of strings2 a"pha-ets2 "anguages2 *rincip"es of Mathematica" Induction. anguages and .rammars1 Construct of a "anguage2 1rammar2 Choms?! C"assification of <orma" ,anguages. Finite Automata1 Automata and App"ications of Automata &heor!2 Deterministic and )on-Deterministic <A2 Comparison and EEui$a"ence of D<A and )<A. Regular E"5ressions1 ;egu"ar E9pression2 EEui$a"ence of ;egu"ar E9pression and <inite Automata2 EEui$a"ence of ;egu"ar 1rammar and <inite Automata2 ;egu"ar and )on- ;egu"ar ,anguages2 *umping ,emma for ;egu"ar Sets Finite State Machines1 Moore and Mea"! Machines 2 EEui$a"ence of Moore and Mea"! Machines. Conte9t <ree ,anguageG Conte9t <ree 1rammar2 Deri$ation trees2 Conte9t <ree 1rammar Simp"ification2 Choms?! % 1rei-ach )orma" forms2 Am-iguities. *ushdo3n AutomataG Definition2 EEui$a"ence of *DA -! Empt! Store and *DA -! <ina" State. Construction of *DA for C<,s. Turing Machines1 Introduction and &uring Machine Mode"2 Computa-"e functions and "anguages. &echniEues for construction of &uring machines2 Church4s !pothesis. -ndecida@ilit61 ;ecursi$e and recursi$e"! enumera-"e "anguages2 ;ice theorem2 *ost4s correspondence pro-"em. B''8S REC'MMEN#E# 1. H E opcroft And H D :""man2 BIntroduction to Automata &heor!2 ,anguages and ComputationC2 )arosa *u-"ishers 2002. 2. 8 , * Mishra and ) Chandrase?aran2 B&heor! of Computer ScienceC2 *rentice a"" Inc2 .2002 3. arr! ; ,e3is and Chritos *apadimitriou2 BE"ements of the &heor! of ComputationC2 *earson Education 2001. 4. *eter ,in52 BAn Introduction to <orma" ,anguages and AutomataC2 )arosa *u-"ishers 2002. #. Michae" Sipser2 BIntroduction to the theor! of computation C2 Cengage ,earning2 )e3 De"hi CS&)*? INF'RMATI'N SEC-RITY SYSTEMS /) * * )0
'7er7iew1 Ser$ices2 Mechanisms2 and Attac?s2 the 6SI Securit! Architecture2 A Mode" for )et3or?2 Securit!. Classical Encr65tion Techni=ues1 S!mmetric Cipher Mode"2 Su-stitution &echniEues2 &ransposition &echniEues2 ;otor Machines2 Stegnograph!. Bloc$ Ci5hers And The #ata Encr65tion Standard1 Simp"ified DES2 0"oc? Cipher *rincip"es2 &he Data Encr!ption Standard2 &he Strength of DES2 Differentia" and ,inear Cr!ptana"!sis2 0"oc? Cipher Design *rincip"es2 0"oc? Cipher Modes of 6peration. Introduction To Finite Fields1 1roups2 ;ings2 and <ie"ds2 Modu"ar Arithmetic2 Euc"id4s A"gorithm2 <inite <ie"ds of the <orm 1<JpK2 *o"!nomia" Arithmetic2 <inite <ie"ds of the <orm 1<J2nK. Ad7anced Encr65tion Standard1 E$a"uation Criteria for AES2 &he AES Cipher. Contem5orar6 S6mmetric Ci5hers1 &rip"e DES2 0"o3fish2 ;C#2 Characteristics of Ad$anced S!mmetric 0"oc? Ciphers2 ;C4 Stream Cipher.
#3
Con3identialit6 -sing S6mmetric Encr65tion1 *"acement of Encr!ption <unction2 &raffic Confidentia"it!2 8e! Distri-ution2 ;andom )um-er 1eneration. %u@lic&8e6 Encr65tion and !ash Functions1 Introduction to )um-er &heor!G *rime )um-ers2 <ormat4s and Eu"erWs &heorems2 &esting for *rima"it!2 &he Chinese ;emainder &heorem2 Discrete ,ogarithms. %u@lic&8e6 Cr65togra5h6 and RSA1 *rincip"es of *u-"ic-8e! Cr!ptos!stems2 the ;SA A"gorithm2 ;ecommended ;eading and =e- Site2 8e! &erms2 ;e$ie3 Luestions2 and *ro-"ems. 8e6 Management and 'ther %u@lic&8e6 Cr65tos6stems1 8e! Management2 Diffie- e""man 8e! E9change2 E""iptic Cur$e Arithmetic2 E""iptic Cur$e Cr!ptograph!. Message Authentication and !ash Functions1 Authentication ;eEuirements2 Authentication <unctions2 Message Authentication Codes2 ash <unctions2 Securit! of ash <unctions and MACs. !ash Algorithms1 MD# Message Digest A"gorithm2 Secure ash A"gorithm2 ;I*EMD-1'02 and MAC. #igital Signatures and Authentication %rotocols1 Digita" Signatures2 Authentication *rotoco"s2 Digita" Signature Standard. Networ$ Securit6 %ractice1 Authentication App"icationsG 8er-eros2 Q.#0. Authentication Ser$ice2 E"ectronic Mai" Securit!G *rett! 1ood *ri$ac!2 S/MIME. I* Securit!G I* Securit! 6$er$ie32 I* Securit! Architecture2 Authentication eader2 Encapsu"ating Securit! *a!"oad2 Com-ining Securit! Associations2 8e! Management2 =eSecurit!G =e- Securit! Considerations2 Secure Soc?ets ,a!er and &ransport ,a!er Securit!2 Secure E"ectronic &ransaction. S6stem Securit61 IntrudersG Intruders2 Intrusion Detection2 *ass3ord Management2 Ma"icious Soft3areG 7iruses and ;e"ated &hreats2 7irus Countermeasures2 <ire3a""sG <ire3a"" Design *rincip"es2 &rusted S!stems. B''8S REC'MMEN#E# 1. =i""iam Sta""ings2 BCr!ptograph! and net3or? Securit!C2 *earson Education 2003. 2001 D Stinson2 BCr!ptograph!G &heor! and *racticeC2 Second Edition Chapman % a"" 2002. 8aufman2 *er"man2 and Speciner2 B)et3or? Securit!C2 *rentice- a"" Second Edition 2001. Michae" E. =hitman2 B*rincip"es of information Securit!C 2 Cengage ,earning2 )e3 De"hi /) * * )0
2. &rappe % =ashington2 BIntroduction to Cryptography with Coding Theory C2 *rentice- a""

3. 4. #.
CS&)*> S'FT:ARE EN.INEERIN.
Introduction to So3tware Engineering1 &he e$o"$ing ro"e of soft3are2 Changing )ature of Soft3are2 Soft3are m!ths. A .eneric 7iew o3 5rocess1 Soft3are engineering- A "a!ered techno"og!2 a process frame3or?2 &he Capa-i"it! Maturit! Mode" Integration JCMMIK2 *rocess patterns2 process assessment2 persona" and team process mode"s. %rocess models1 &he 3aterfa"" mode"2 Incrementa" process mode"s2 E$o"utionar! process mode"s2 &he :nified process. So3tware Re=uirements1 <unctiona" and non-functiona" reEuirements2 :ser reEuirements2 S!stem reEuirements2 Interface specification2 the soft3are reEuirements document. Re=uirements engineering 5rocess1 <easi-i"it! studies2 ;eEuirements e"icitation and ana"!sis2 ;eEuirements $a"idation2 ;eEuirements management. S6stem models1 Conte9t Mode"s2 0eha$iora" mode"s2 Data mode"s2 6-@ect mode"s2 structured methods. #esign Engineering1 Design process and Design Eua"it!2 Design concepts2 the design mode". Creating an architectural design1 Soft3are architecture2 Data design2 Architectura" st!"es and patterns2 Architectura" Design. '@2ect&'riented #esign1 6-@ects and o-@ect c"asses2 An 6-@ect-6riented design process2 Design e$o"ution.
#4
%er3orming -ser inter3ace design1 1o"den ru"es2 :ser interface ana"!sis and design2 interface ana"!sis2 interface design steps2 Design e$a"uation. Testing Strategies1 A strategic approach to soft3are testing2 test strategies for con$entiona" soft3are2 0"ac?-0o9 and =hite-0o9 testing2 7a"idation testing2 S!stem testing2 the art of De-ugging. %roduct metrics1 Soft3are Lua"it!2 Metrics for Ana"!sis Mode"2 Metrics for Design Mode"2 Metrics for source code2 Metrics for testing2 Metrics for maintenance. Metrics 3or %rocess and %roducts1 Soft3are Measurement2 Metrics for soft3are Eua"it!. Ris$ management1 ;eacti$e $s. *roacti$e ;is? strategies2 soft3are ris?s2 ;is? identification2 ;is? pro@ection2 ;is? refinement2 ;MMM2 ;MMM *"an. Cualit6 Management1 Lua"it! concepts2 Soft3are Eua"it! assurance2 Soft3are ;e$ie3s2 <orma" technica" re$ie3s2 Statistica" Soft3are Eua"it! Assurance2 Soft3are re"ia-i"it!2 &he IS6 .000 Eua"it! standards. CASE Tools1 &!pes of CASE too"s2 ad$antages and components of CASE too"s2 :nified Mode""ing ,anguage J:M,K B''8S REC'MMEN#E# 1. 2. 3. 4. #. Soft3are Engineering- 8.8. Agar3a" % Dogesh Singh2 )e3 Age Internationa" *u-"ishers Soft3are Engineering2 an Engineering approach- Hames <. *eters2 =ito"d *edr!c52 Hohn =ie"!. Soft3are Engineering princip"es and practice- =aman S Ha3ade?ar2 &he Mc1ra3- i"" Companies. Soft3are Engineering2 A practitioner4s Approach- ;oger S. *ressman2 'th edition. Mc1ra3 i"" Internationa" Edition. Soft3are Engineering- Sommer$i""e2 (th edition2 *earson education. /) * * )0
!M&+*1 EN.INEERIN. EC'N'MICS AN# IN#-STRIA MANA.EMENT
#e3inition and Sco5e o3 Engineering Economics1 Concept of re$enue and costs2 -rea?-e$en ana"!sis. ,a3 of demand % supp"!2 time $a"ue of mone!2 present and future 3orth methods. #ecision Ma$ing1 Decision ma?ing process2 decision ma?ing under ris? certaint!2 uncertaint! and conf"ict. Re5lacement and maintenance Anal6sis1 &!pes of maintenance2 determination of economic "ife of an asset2 rep"acement of items that fai" sudden"! and that fai" o$er a period of time. Methods o3 de5reciation1 straight "ine method2 sum-of-the !ear4s digest method2 dec"ining -a"ance method2 sin?ing fund method and ser$ice output method of depreciation. In7entor6 control1 Introduction and o-@ecti$e of in$entor! contro"2 purchase mode" 3ith instantaneous rep"enishment2 mode" 3ith shortages2 price -rea? mode"2 A0C ana"!sis. Forecasting1 Demand forecasting -! Euantitati$e and Eua"itati$e techniEues2 app"ications of demand forecasting. Ma$e or Bu6 #ecision1 Criteria for ma?e or -u!2 approaches for ma?e or -u! decision. Falue Engineering Anal6sis1 7a"ue ana"!sis $s. $a"ue engineering function2 aims and $a"ue engineering procedure2 ad$antages % app"ications. inear %rogramming1 ,inear programming as a too" of decision ma?ing2 graphica" and Simp"e9 Methods and app"ications in decision ma?ing. Boo$s Recommended 1. *anaeerse"$am2 ;.2 J2001K2 FEngineering Economics42 *rentice a"" of IndiaG )e3 De"hi
##
2. 3. 4. #.
1rant2 E.,.2 Ire$an2 =.1. and ,eanen3orh2 ;.S.2 J1.('K2 F*rincip"es of Engineering Econom!4. ;ona"d *ressG )e3 Dor? Haha2 .A 2 J200#K2 F6perations ;esearchG An Introduction42 *rentice- a"" of IndiaG )e3 De"hi 7ohra 2 ).D.2 J200'K2 FLuantitati$e &echniEues in Manageria" Decision Ma?ing4. &ata Mc1ra3 i""G )e3 De"hi Doughert!2 Christopher J200(K2 FIntroduction to Econometrics42 69ford :ni$ersit! *ressG )e3 De"hi.
CS& )1? INF'RMATI'N SEC-RITY SYSTEMS AB'RAT'RY Imp"ementation of the fo""o3ings in an! igh ,e$e" *rogramming ,anguageG 1. 2. 3. 4. #. '. (. +. &ransposition &echniEues2 Stegnograph!. 0"oc? Ciphers And &he Data Encr!ption Standard ;andom )um-er 1eneration. &esting for *rima"it!2 &he Chinese ;emainder &heorem &he ;SA A"gorithm. E""iptic Cur$e Cr!ptograph!. ash A"gorithmsG MD# Message Digest A"gorithm2 Authentication *rotoco"s. S!stem Securit!G <ire3a""sG <ire3a"" Design *rincip"es
/* * ? +0
CS&)1> S'FT:ARE EN.INEERIN. a@. S6lla@us
/* * + 10
S!stem ;eEuirement Specification JS;SK and re"ated ana"!sis documents Design documents representing the comp"ete design of the soft3are s!stem. :se of CASE &oo"s Ana"!sis and design for the same pro-"em shou"d -e done using 6-@ect-6riented approach. Simp"e e9ercises in effort and cost estimation in C6C6M6 mode". App"ication of C6C6M6 and <unction *oint J<*K mode" for the actua" pro@ect that has -een chosen. <ami"iari5ation of SCM too"s 3ith some pu-"ic domain soft3are . <ami"iari5ation of some re$erse engineering too"s a$ai"a-"e in the pu-"ic domain.
#'
#E%ARTMENTA E ECTIFE G#EH&IF

CS&)++ #ATA MININ. AN# :ARE!'-SIN. /) * * )0
Introduction1 Data Mining Concepts2 Input2 Instances2 Attri-utes and 6utput2 8no3"edge ;epresentation % ;e$ie3 of 1raph &heor!2 ,attices2 *ro-a-i"it! % Statistics Machine learning conce5ts and a55roaches1 Super$ised ,earning <rame3or?2 concepts % h!pothesis2 &raining % ,earning2 0oo"ean functions and formu"ae2 Monomia"s2 Dis@uncti$e )orma" <orm % Con@uncti$e )orma" <orm2 A "earning a"gorithm for monomia"s #ata %re5aration1 Data C"eaning2 Data Integration % &ransformation2 Data ;eduction Mining Association Rules1 Associations2 Ma9ima" <reEuent % C"osed <reEuent item sets2 Co$ering A"gorithms % Association ;u"es2 ,inear Mode"s % Instance-0ased ,earning2 Mining Association ;u"es from &ransactiona" data-ases2 Mining Association ;u"es from ;e"ationa" data-ases % =arehouses2 Corre"ation ana"!sis % Constraint-ased Association Mining. Classi3ication and %rediction1 Issues regarding C"assification % *rediction2 C"assification -! Decision &ree induction2 0a!esian c"assification2 C"assification -! 0ac? *ropagation2 ?-)earest )eigh-or C"assifiers2 1enetic a"gorithms2 ;ough Set % <u55! Set approaches Cluster Anal6sis1 &!pes of data in C"ustering Ana"!sis2 Categori5ation of Ma@or C"ustering methods2 methods2 Densit!--ased methods2 1rid--ased methods2 Mode"--ased C"ustering methods ierarchica"
Mining Com5le" T65es o3 #ata1 Mu"tidimensiona" ana"!sis % Descripti$e mining of Comp"e9 data o-@ects2 Mining Spatia" Data-ases2 Mining Mu"timedia Data-ases2 Mining &ime-series % SeEuence data2 Mining &e9t data-ases2 Mining =or"d -=ide =e#ata Mining A55lications and Trends in #ata Mining1 Massi$e Datasets/&e9t mining2 Agent-0ased Mining B''8S REC'MMEN#E# 1. Hia3ei an and Miche"ine 8am-er2 BData MiningG Concepts and &echniEuesC2 Morgan 8aufmann *u-"ishers2 2000 JIS0)G 1-##+'0-4+.-+K. 2. Ian . =itten and Ei-e <ran?2 BData MiningG *ractica" Machine ,earning &oo"s and &echniEues 3ith Ha$a imp"ementationsC2 Morgan 8aufmann *u-"ishers2 San <ransisco2 CA J2000K. 3. Dorian *!"e2 BData *reparation for Data MiningC2 Morgan 8aufmann2 J1...K 4. 8orth2 Si"-ert52 Sudarshan2 BData-ase ConceptsC2 Mc1ra3 i"" #. E"masri2 )a$athe2 B<undamenta"s 6f Data-ase S!stemsC2 Addision =es"e! CS&)+? :IRE ESS NET:'R8S /) * * )0
Networ$ing Fundamentals1 Ana"og $s. digita" data2 Data representation2 6pen S!stems Interconnecti$it! J6SIK2 E"ements of net3or?s Jhard3are % soft3areK2 )et3or? topo"og!2 )et3or? protoco"s2 *erformance Metric Basis o3 :ireless Communications1 =hat is mo-i"e computingX2 Y&he dri$ing forces to 3ire"ess2 Ad$antages $s. disad$antages of 3ire"ess2 8e! e"ements of 3ire"ess net3or?s or s!stems2 Spectrum of mo-i"e techno"ogies > mo-i"e phone 2/3/4 1R pa"mR poc?et *CR ta-"et2 *otentia" app"ications of mo-i"e computing2 Mo-i"e cha""enges and "imitations2 Determinants of successfu" app"ications. '7er7iew o3 Mo@ile Technolog61 &!pes of 3ire"ess transmission2 0asic components > fi"ter2 mi9er2 amp"ifier2 antenna2 Infrared "ight transmission2 ;adio freEuenc! transmission > AM / <M / *M2 <actors impact radio transmission2 0"uetooth techno"og!2 IEEE +02.11 a/-/g techno"og!2 Comparison and se"ection of techno"og! Com5arison o3 Mo@ile Technologies1 Spread spectrum transmission - < SS J<reEuenc! opping Spread SpectrumK - DSSS JDirect SeEuence Spread SpectrumK2 <DMA - <reEuenc! Di$ision Mu"tip"e Access2 &DMA > &ime Di$ision Mu"tip"e Access2 CDMA > Code Di$ision Mu"tip"e Access2 Comparison of 3ire"ess techno"og! > AM*S2 &DMA2 1SM2 1*;S2 :M&S2 etc.
#(
:ireless A55lication %rotocols G:A%H J0riefKG2 0earsers > SMS2 :SSD2 CSD2 IS-13'2 CDMA2 CD*D2 *DC2 etc.2Y=*D > 3ire"ess datagram protoco"2 =&,S > 3ire"ess transport "a!er securit!2 =&* > 3ire"ess session protoco"2 =S* > =ire"ess session protoco"2 =AE - =ire"ess App"ication en$ironment2 7ersions of =A* > =A* 1.12 =A* 1.22 =A* 2.02 =A* net3or? architectureZYMAC - Media Access Contro"2 ,,C > ,ogica" ,in? Contro"ZY* D > *h!sica" ,a!er2 IrDA standards and protoco"2 0"uetooth standards and protoco"2 +02.119 standards and protoco" i3e C6cle o3 :ireless Networ$ #esign ,ife C!c"e of )et3or? Design > *"anning2 Ana"!sis2 Design2 Imp"ementation2 * Y "anning > 3ire"ess strategic p"anning2 Y*"anning > cha""enges2 threats2 and trends2 YAna"!sis > current net3or? / s!stems status Jstrengths and 3ea?nessesK2 YAna"!sis > mar?et gap ana"!sis2 YAna"!sis > reEuirements ana"!sis2 YAna"!sis > costs / -enefits ana"!sis2 YImp"ementation > pro@ect management2 YImp"ementation > change management %eer to %eer GAd !ocH Networ$ #esign &!pe of 3ire"ess net3or?2 * Y -* net3or? topo"og!2 YIrDA net3or? design and configuration2 Y0"uetooth net3or? design and configuration2 Y+02.119 net3or? design and configuration2 YComparison of *-* net3or?2 YImp"ementation re"ated issues In3rastructure Networ$ #esign Mo-i"e 3a$e propagation2 Y<actors impact 3a$e propagation2 * Y ropagation mode"s2 YSite sur$e!ing techniEues2 Y6ptima" net3or? design Jnum-er and "ocation of A*K2 Y+02.119 net3or? design and configuration2 YImp"ementation re"ated issues :ireless :ide Area Networ$ #esign J0riefK Design of mesh net3or?2 YDigita" ce""u"ar te"ephon!2 YMo-i"e gate3a!2 YMo-i"e -ridge2 Y<i9ed 3ire"ess2 Y7*) > $irtua" pri$ate net3or? B''8S REC'MMEN#E# 1. 2. 3. 4. #. *ah"a$an and 8rishnamurth!2C *rincip"es of =ire"ess )et3or?sC2 *rentice a""2 2002. Schi""er H2C Mo-i"e CommunicationsC2 Addison-=es"e!2 2000. Herr! D. 1i-son2C &heMo-i"eCommunications and-oo?C2 C;C*ress2 1.... 1. e"d2C Data o$er =ire"ess )et3or?sC2 Mc1ra3- i""2 2001 0"a?e2 B=ire"ess Communication S!stemsC2 Cengage ,earning2 )e3 De"hi /) * * )0
CS&)+> !I.! %ERF'RMANCE C'MM-NICATI'N NET:'R8S
Basics o3 Networ$s1 &e"ephone 2computer2 Ca-"e te"e$ision and =ire"ess net3or?2 net3or?ing princip"es 2Digiti"i5ationG Ser$ice intergration 2net3or? ser$ices and "a!ered architecture 2traffic characteri5ation and L6S 2net3or?s ser$ices Gnet3or? e"ements and net3or? mechanisms. %ac$et Switched Networ$s1 6SI and I* mode"sG Ethernet JIEEE +02.3KRto?en ringJI EEE +02.#K2<DD I2DL D02fra me re"a!2G SMDS GInternet3or?ing 3ith SMDS. Internet and TC%JI% Networ$s1 6$er$ie3R internet protoco"R &C* and 7D*R performance of &C*/I* net3or?s circuit s3itched net3or?sG S6)E&R D=DM2 <i-re to home2 DS,. Inte""igent net3or?s2 CA&7. ATM and :ireless Networ$s1 Main features-adressing2 signa""ing and routing RA&M header structure-adaptation "a!er2 management and contro"R0ISD)RI nter3or?ing 3ith A&M 2=ire"ess channe "2"in? "e$e" design2 channe" accessR)et3or? designn and 3ire"ess net3or?s. '5tical Networ$s and Switching1 6ptica" "in?s- =DM s!stems2cross-connects 2optica" ,A)Ws2 optica" paths and net3or?sR&DS and SDSGmodu"ar s3itch designs-*ac?et s3itching2distri-uted2shared2input and output -uffers. B''8S REC'MMEN#E# 1. 2. 3. 4. #. Hean 3ar"and and *ra$in 7arai!a2 V igh *erformance Communication )et3or?s V2 2nd Edition2 arcourt and Morgan 8auffman2 ,ondon2 2000. ,eon 1racia2 =id@a@a2 V Communication net3or?s V2 &ata Mc1ra3- i""2 )e3 De"hi2 2000. Sumit 8asera2 *an?a@ Sethi2 V A&M )et3or?s V2 &ata Mc1ra3- i""2 )e3 De"hi2 2000. 0ehrou5.a. <orou5an2 V Data Communication and )et3or?ing V2 &ata Mc1ra3- i""2 )e3 De"hi2 2000
#+
CS&)+; #ata Mining and #ata :arehousing a@.
/* * + 10
Students are reEuired to perform practica"4s in 6rac"e/MS SL, Ser$er and "TATI"TICA Data #iner
0ui"ding a Data-ase Design using E; Mode"ing and )orma"i5ation &echniEues Imp"ementation of functions 2*rocedures2 &riggers and Cursors ,oad Data from heterogenous sources inc"uding te9t fi"es into a predefined 3arehouse schema. Design a data mart for a -an? to store the credit histor! of customers in a -an? .:se this credit profi"ing to process future "oan app"ications. Feature Selection and Variable Filtering (for very large data sets) Association ining in "arge data sets Interactive !rill"!own# $oll up# Slice and !ice operations %enerali&ed ' ( k" eans Cluster Analysis %enerali&ed Additive odels (%A ) %eneral Classification and $egression Trees (%Trees) %eneral C)AI! (Chi"s*uare Auto+atic Interaction !etection) odels Interactive Classification and $egression Trees %oodness of Fit Co+putations CS&))* :ireless Networ$s a@. 1. /* * + 10
Design an +02.11 net3or? of mesh topo"og!2 using set of suita-"e inputs chec? the performance parameters "i?eG 0atter! Energ! consumed2 0it error ;ate2 0us!2 Signa" to )oise ratio2 &hroughput2 :ti"i5ation. 2. Design =ire"ess net3or? using Carrier Sensing Mu"tip"e Access &echniEue2 Chec? the performance parameters "i?eG Channe" &hroughput2 Signa" to )oise ;atio etc. 3. Design a *ro@ect ha$ing t3o scenariosG JaK Star &opo"og! =ire"ess )et3or? using rapid configuration method. J-K ;ing &opo"og! =ire"ess net3or? a"so using rapid configuration method2 Compare the performance parameters "i?eG End to End De"a! for data2 &raffic ;ecei$ed2 Lueue si5e etc. 4. Design a Star shaped =ire"ess net3or?2 and suggest a 3a! to configure a *h!sica" "a!er of se"ected nodes. #. Design a *ro@ect ha$ing t3o scenariosG JaK 0us &opo"og! =ire"ess )et3or? J-K ;ing &opo"og! =ire"ess net3or?2 ma?e use of the =e- ;eporting to compare the resu"t of t3o different scenarios. '. Design a =ire"ess mode" ha$ing four net3or?s 3hich are ten meters apart from each other2 connected to each other 3ire"ess"! and are suscepti-"e to de"a!s etc. (. Create a radio net3or? and o-ser$e $ariations in the Eua"it! of recei$ed signa" that resu"ts from radio noise at the recei$ing node in a d!namic net3or? topo"og!. +. Designs a Star shaped =ire"ess topo"og! and suggest a suita-"e 3a! to import traffic. .. *erformance ana"!sis of 3ire"ess mesh -ac?hau" net3or? 3ith +02.11 a/-/g techno"ogies using 6*)E&. 10. *erformance ana"!sis of 3ire"ess mesh -ac?hau" net3or? 3ith +02.11 a/p techno"ogies using 6*)E&. 11. De$e"opment of a ne3 CDMA -ased MAC on top of +02.11p *h!sica" "a!er
CS&))+ !igh %er3ormance Communication Networ$s a@. 1. 2.
/* * + 10
Design an +02.3 net3or? of mesh topo"og!2 using set of suita-"e inputs chec? the performance parameters "i?eG 0atter! Energ! consumed2 0it error ;ate2 0us!2 Signa" to )oise ratio2 &hroughput2 :ti"i5ation. Design +02.# net3or? using Carrier Sensing Mu"tip"e Access &echniEue2 Chec? the performance parameters "i?eG Channe" &hroughput2 Signa" to )oise ;atio etc.
#.
3.
Design a *ro@ect ha$ing t3o scenariosG JaK Star &opo"og! +02.3 )et3or? using rapid configuration method. J-K ;ing &opo"og! +02.3 net3or? a"so using rapid configuration method2 Compare the performance parameters "i?eG End to End De"a! for data2 &raffic ;ecei$ed2 Lueue si5e etc. 4. Design a Star shaped A&M net3or?2 and suggest a 3a! to configure a *h!sica" "a!er of se"ected nodes. #. Design a *ro@ect ha$ing t3o scenariosG JaK 0us &opo"og! &C*/I* )et3or? J-K ;ing &opo"og! &C*/I* net3or?2 ma?e use of the =e- ;eporting to compare the resu"t of t3o different scenarios. '. Design a =ire"ess mode" ha$ing four net3or?s2 3hich are ten meters apart from each other2 connected to each other 3ire"ess"! and are suscepti-"e to de"a!s etc. (. Create a radio net3or? and o-ser$e $ariations in the Eua"it! of recei$ed signa" that resu"ts from radio noise at the recei$ing node in a d!namic net3or? topo"og!. +. Designs a <rame ;e"a! )et3or? and suggest a suita-"e 3a! to import traffic. .. *erformance ana"!sis of <DDI net3or?s using 6*)E&. 10. *erformance ana"!sis of Enterprise )et3or? 3ith A&M using 6*)E&. 11. Emu"ate ,A) o$er A&M using 6*)E&.
'%EN E ECTIFES G'EH&II
CS&**? #ECISI'N S-%%'RT SYSTEMS Introduction1 =hat is a DSSX &he Components of a DSS.
/) * * )0
#ecision Ma$ing1 ;ationa" Decisions2 Definitions of ;ationa"it!2 0ounded ;ationa"it! and Mudd"ing &hrough2 &he )ature of Managers2 Appropriate Data Support2 Information *rocessing Mode"s2 1roup Decision Ma?ing #ecisions and #ecision Modeling1 &!pes of Decisions2 Decisions2 Components of Decision Mode"s uman Hudgment and Decision Ma?ing2 Mode"ing
Normati7e S6stems1 )ormati$e and Descripti$e Approaches2 Decision-Ana"!tic Decision Support S!stems2 EEuation-0ased and Mi9ed S!stems #ata Com5onent1 Characteristics of Information2 Data-ases to Support Decision Ma?ing2 Data-ase Management S!stems2 Data =arehouses2 Data Mining and Inte""igent Agents Model Com5onent1 Mode"s2 ;epresentation2 Methodo"og!2 Mode" 0ased Management S!stems2 Access to Mode"s2 :nderstanda-i"it! of ;esu"ts2 Integrating Mode"s2 Sensiti$it! of a Decision Intelligence and #ecision Su55ort S6stems1 *rogramming ;easoning - 0ac?3ard Chaining ;easoning and <or3ard Chaining ;easoning2 8no3"edge ;epresentation for Decision Support S!stems2 Computationa" Inte""igence for Decision Support2 E9pert S!stems and Artificia" Inte""igence in Decision Support S!stems -ser Inter3aces to #ecision Su55ort S6stems1 Support for Mode" Construction and Mode" Ana"!sis2 Support for ;easoning a-out the *ro-"em Structure in Addition to )umerica" Ca"cu"ations2 Support for 0oth Choice and 6ptimi5ation of Decision 7aria-"es2 1raphica" Interface2 &he Action ,anguage2 Menus Mail Com5onent1 Integration of Mai" Management2 Imp"ications for DSS Design. B''8S REC'MMEN#E# 1. Mara?as2 1.M. Decision Support S!stems in the 21st Centur!. *rentice 2003. a""2 :pper Sadd"e ;i$er2 )H2
'0
2. 3. 4. #.
Moore2 H. .2and M.1.Chang.Design of Decision Support S!stemsV Data 0ase27o".122 )os.1 and 2. <a""2 1.+0. *o3er2 D. H. Decision support s!stemsG concepts and resources for managers. =estport2 Conn.2 Luorum 0oo?s2 2002. *o3er2 D. H. =e---ased and mode"-dri$en decision support s!stemsG concepts and issues. *roceedings of the Americas Conference on Information S!stems2 ,ong 0each2 Ca"ifornia2 2000. Si"$er2 M. S!stems that support decision ma?ersG description and ana"!sis. Chichester R )e3 Dor?2 =i"e!2 1..1. /) * * )0
CS&**, NE-RA NET:'R8S AN# F-IIY '.IC
Neural networ$s 1 introduction2 neura" net3or?s2 super$ised or unsuper$ised "earning2 feed for3ard net3or?2 opfie"d net3or? Neural networ$ models1 neura" net3or? mode"s2 "a!ers in neura" net3or? and their connections. Instar 2 outstar2 3eights on connections2 thresho"d function2 app"ication- Ada"ine and mada"ine Bac$5ro5agation1 feed for3ard -ac? propagation net3or?- mapping2 "a!out2 training2 0*) app"ications earning and training1 o-@ecti$es of "earning2 e--4s ru"e2 de"ta ru"e2 super$ised "earning2 unsuper$ised net3or?s2 "earning $ector Euanti5er2 associati$e memor! mode"s 2 one-shot "earning2 resonance2 sta-i"it!2 training and con$ergence FuEE6 ogic1 Introduction2 fu55! sets2 fu55! operations2 fu55iness in neura" net3or?s2 neura" trained fu55! s!stem BAM& -idirectiona" associati$e memor!2 inputs and outputs2 3eights and training. <AM-fu55! associati$e memor!2 association2 <AM neura" net3or?s2 encoding Ada5ti7e Resource theor6- net3or? for A;& 2 processing in A;& 8ohen Sel3 'rganiEing Ma5- Competiti$e "earning 2 "atera" inhi-ition2 training "a3 for 8ohen net3or?2 imp"ementation2 app"ications to pattern recognition A55lication o3 3uEE6 ogic1 <u55! data-ases and Euantification2 fu55! contro" 2 designing fu55! "ogic contro""er B''8S REC'MMEN#E# 1. 2. 3. 4. #. ;ao2 7a""inu 0.2and ;ao2 a!agri$a . )eura" net3or?s and fu55! ,ogic2 second edition2 0*0 *u-"ication 0er?an C. ;i5a2 &ru-atch ,2 She"don2 <u55! S!stems design *rincip"ea. IEEE *ress 2 standard pu-"ishers distri-uters <reeman A. Hames2 S?apura M. Da$id- neura" net3or?s a"gorithms2 app"ications and programming &echniEues2 *earson Education Introduction to neura" )/= G Hames A. Anderson * I )eura" )/= G <reeman *u-"isher JAddison =es"e!K
CS&))* %ERFASIFE C'M%-TIN.
/) * * )0
Introduction1 *er$asi$e Computing2 "ocation pri$ac! in *er$asi$e Computing2 ;e"ationship -et3een Conte9t and pri$ac!2 *er$asi$e Ser$ices Disco$er! J:*n* and HI)IK and *ersona" Ser$er Concept. Architectures 3or %er7asi7e Com5uting1 Soft3are architecture and techno"og! for *er$asi$e computing2 8no3"edge of state-of-the-art per$asi$e computing architectures2 =eara-"e Computing Architectures %er7asi7e Com5uting #e7ices and '5erating S6stem1 De$ices and communications2 0iometrics in *er$asi$e Computing2 6perating S!stem issues in *er$asi$e Computing2 De$ice Connecti$it! Issues and *rotoco"s2 De$ice Connecti$it! Securit! Issues %ersonal #igital Assistants in %er7asi7e Com5uting1 *DA 6perating S!stems2 *DA De$ice Characteristics2 *DA Soft3are Components2 Standards
'1
Integrating the 5h6sical and the 7irtual world1 :ser Interface in *er$asi$e Computing2 Sensing and actuationR Interactions -et3een humans and per$asi$e computers2 A3areness and *erception %er7asi7e S6stems #e7elo5ment1 &oo"s and techniEues used in the de$e"opment of per$asi$e computing app"ications2 Designing Distri-uted App"ications 3ith Mo-i"e Code *aradigms2 Appreciation of "imitations in communication net3or? protoco"s for per$asi$e computing2 Ha$a in *er$asi$e Computing2 =e--ena-"ed *er$asi$e Computing App"ication De$e"opment Issues and Mechanisms B''8S REC'MMEN#E# 1. 2. 3. 4. #. :3e ansmann2 et a"2 B*er$asi$e Computing 2003. and-oo? B2 Second Edition2 Springer-7er"ag2 0er"in2
0ur?hardt H.2 enn .2 epper S.2 ;intdorff 8.2 Schac? &2C*er$asi$e ComputingG &echno"og! and Architecture of Mo-i"e Internet app"icationsC 2 Addison =es"e! 2002. &he ;ace to Mo-i"it!2 ;. 8a"a?ota2 M. ;o-inson2C M--usinessC2 Mc1ra3- i""2 2002 <ran? Ade"stein2 S 8 S 1upta2 1 1 ;ichard % , Sch3ie-ertG <undamenta"s of Mo-i"e and *er$asi$e Computing2 &ata Mc1ra3- i""2 )e3 De"hi2 200#. Hochen 0ur?hardt2 orst enn2 Stefan epper2 &homas Schaec % 8"aus ;indtorff2C *er$asi$e ComputingG &echno"og! and Architecture of Mo-i"e Internet App"icationsC2 *earson Education2 )e3 De"hi2 2004
'2
(T! SEMESTER S. No 1. 2. 3. 4. #. '. (. +. .. Course Code CS-401 CS-403 CS-499 CS-499 CS-499 CS-999 CS-411 CS-300 CS-400 Course Title S!stem simu"ation % Mode"ing Compi"er Design DE-7 DE-7I DE-7II 6E-III S!stem simu"ation % Mode"ing ,a-orator! Industria" *ractica" &raining *ro@ect J*hase-IK T'TA , 3 3 3 3 3 3 0 0 0 1; Teaching oad & * 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 2 4 > Credit 3 3 3 3 4 3 1 4N 2 +> %re re=uisite Computer *rogramming -
M Industria" practica" &raining 3i"" -e he"d during summer $acation after si9th semester
#E%ARTMENTA E ECTIFE G#EH&F Teaching oad , & * )atura" "anguage processing 3 0 0 Information ;etrie$a" S!stems 3 0 0 Data Compression 3 0 0 Course Title #E%ARTMENTA E ECTIFE G#EH&FI Teaching oad , & * Soft3are Lua"it! Engineering 3 0 0 0io Informatics 3 0 0 Mu"timedia Data-ases 3 0 0 Course Title #E%ARTMENTA E ECTIFE G#EH&FII Teaching oad , & * Soft3are *ro@ect Management 3 1 0 Mo-i"e Computing 3 1 0 igh speed and 0road-and 3 1 0 net3or?s =ire"ess Sensor )et3or?s 3 1 0 Course Title '%EN E ECTIFES G'EH &III Teaching oad , & * Em-edded S!stems 3 0 0 )et3or? Management S!stems 3 0 0 6-@ect 6riented Ana"!sis and 3 0 0 Design )atura" "anguage processing 3 0 0 0io Informatics 3 0 0 Course Title
S. No 1. 2. 3. S. No 1. 2. 3. S. No 1. 2. 3. 4.
Course Code CS-421 CS-423 CS-42# Course Code CS-42( CS-42. CS-431 Course Code CS-433 CS-43# CS-43( CS-43.
Credit 3 3 3 Credit 3 3 3 Credit 4 4 4 4
%re re=uisite Computer programming %re re=uisite %re re=uisite Computer )et3or?s Computer )et3or?s
S. No 1. 2. 3. 4. #.
Course Code CS-00( CS-00+ CS-00. CS-421 CS-42.
Credit 3 3 3 3 3
%re re=uisite
'3
(th SEMESTER
CS&?*1 SYSTEM SIM- ATI'N AN# M'#E IN. /) * * )0
Introduction to Simulation1 S!stem % S!stem En$ironment2 Components of a S!stem2 Discrete and Continuous S!stems2 Mode" of a S!stem and &!pes of Mode"s2. Discrete E$ent S!stem Simu"ation2 Ad$antages and Disad$antages of Simu"ation2 Areas of App"ication Techni=ues o3 Simulation1 Monte Car"o Method2 &!pes of S!stem Simu"ations2 ;ea" &ime Simu"ation2 Stochastic 7aria-"es2 Discrete *ro-a-i"it! <unctions .eneral %rinci5lesG Concepts in Discrete E$ent Simu"ation2 E$ent Schedu"ing /&ime Ad$ance A"gorithm2 ,ist *rocessing2 :sing D!namic A""ocation % ,in?ed ,ist Simulation So3twareG istor! of Simu"ation Soft3are2 Se"ection of Simu"ation Soft3are2 Simu"ation in CAA2 1*SS2 Simu"ations *ac?ages2 &rends in simu"ation Soft3are. Statistical Models in Simulation1 :sefu" Statistica" Mode"s2 Discrete Distri-ution s2 Continuous Distri-utions2 *oisson *rocess2 Empirica" Distri-utions Cueuing Models1 Characteristics of Lueuing s!stems2 Lueuing )otation2 ,ong ;un Measures of performance of Lueuing S!stems2 Stead! State 0eha$ior of infinite *opu"ation Mar?o$ian Mode"s2 Stead! State 0eha$ior of finite *opu"ation Mode"s2 )et3or?s of Lueues Random Num@er .enerationG *roperties of ;andom )um-ers2 1eneration of *seudo-;andom )um-ers2 &echniEues for 1enerating ;andom )um-ers2 &ests for ;andom )um-ers2 In$erse transform &echniEues2 Con$o"ution Methods2 and Acceptance >;e@ection &echniEues In5ut Modeling1 Data Co""ection2 Identif!ing the Distri-ution 3ith Data2 *arameter Estimation2 Chi > SEuare &est2 Se"ecting Input Mode"s 3ith Data Feri3ication 9 Falidation o3 simulation Modeling1 Mode" 0ui"ding2 7erification % 7a"idation2 7erification of simu"ation Mode"s2 Ca"i-ration % 7a"idation of Mode"s B''8S REC'MMEN#E# 1. 2. 3. 4. #. 1ordon 12 BS!stem Simu"ationC2 * I 2nd Edition 1..+. Deo )arsingh2 BS!stem Simu"ation 3ith Digita" ComputersC2 * I2 )e3 De"hi 1..3. 8 S &ri$edi2 B*ro-a-i"it! and Statistics 3ith ;e"ia-i"it!2 Lueuing and Computer Science App"icationC2 * I Su-ranranian2 8 ; 7 and Sudaresan ; 8ada!am2 BS!stem simu"ationG Introduction to 1*SSC2 C0S2 )e3 De"hi 1..3. = <e""er2 CAn introduction to *ro-a-i"it! &heor! and its App"ications2C 7a" 1+22 =i"e! Eastern ,td. )D. /) * * )0
CS&?*) C'M%I ER #ESI.N
Com5iler structure1 ana"!sis-s!nthesis mode" of compi"ation2 $arious phases of a compi"er2 too" -ased approach to compi"er construction. e"ical anal6sisG interface 3ith input2 parser and s!m-o" ta-"e2 to?en2 "e9eme and patterns. Difficu"ties in "e9ica" ana"!sis. Error reporting. Imp"ementation. ;egu"ar definition2 &ransition diagrams2 ,EQ. S6nta" anal6sis1 C<1s2 am-iguit!2 associati$it!2 precedence2 top do3n parsing2 recursi$e descent parsing2 transformation on the grammars2 predicti$e parsing2 -ottom up parsing2 operator precedence grammars2 ,; parsers JS,;2 ,A,;2 ,;K2 DACC. S6nta" directed de3initions1 inherited and s!nthesi5ed attri-utes2 dependenc! graph2 e$a"uation order2 -ottom up and top do3n e$a"uation of attri-utes2 ,- and S-attri-uted definitions. T65e chec$ing1 t!pe s!stem2 t!pe e9pressions2 structura" and name eEui$a"ence of t!pes2 t!pe con$ersion2 o$er"oaded functions and operators2 po"!morphic functions. Run time s6stem1 storage organi5ation2 acti$ation tree2 acti$ation record2 parameter passing2 s!m-o" ta-"e2 d!namic storage a""ocation.
'4
Intermediate code generation1 intermediate representations2 trans"ation of dec"arations2 assignments2 contro" f"o32 -oo"ean e9pressions and procedure ca""s. Imp"ementation issues. Code generation and instruction selection1 issues2 -asic -"oc?s and f"o3 graphs2 register a""ocation2 code generation2 dag representation of programs2 code generation from dags2 peep ho"e optimi5ation2 code generator generators2 specifications of machine. B''8S REC'MMEN#E# 1. 2. 3. 4. #. 7. Aho2 ;. Sethi2 and H. D. :""man. Compi"ersG *rincip"es2 &echniEues and &oo"s 2 Addison-=es"e!2 1.++. <ischer and ;. ,e0"anc. Crafting a Compi"er 2 0en@amin Cummings2 1..1.. C. o"u-. Compi"er Design in C 2 *rentice- a"" Inc.2 1..3. Appe". Modern Compi"er Imp"ementation in CG 0asic Design 2 Cam-ridge *ress. <raser and anson. A ;etargeta-"e C Compi"erG Design and Imp"ementation 2 Addison-=es"e!. AB'RAT'RY /* * + 10 ,anguage
CS&?11 SYSTEM SIM- ATI'N AN# M'#E IN. 1. 2. 3. 4. #. '. (. Computer 1eneration of ;andom )um-ers. &esting ;andom )um-er 1enerators. Monte-Car"o Simu"ation. Simu"ation of Sing"e Ser$er Lueuing S!stem. Simu"ation of &3o-Ser$er Lueuing S!stem. Simu"ation of In$entor! S!stem. Simu"ation of &e"ephone S!stem.
Imp"ementation of the fo""o3ings Simu"ation pro-"ems in 1*SS or an! igh ,e$e" *rogramming
CS&?** MAB'R %R'BECT G%hase&IH &his is pro@ect 3or? Jphase-IK to -e done -! the students in the se$enth semester. &he e$a"uation committee of the department sha"" e$a"uate the pro@ect for 2 credits assigned for the pro@ect. A report of the pro@ect 3or? carried out during the semester sha"" -e su-mitted at the end of the semester appro$ed -! the pro@ect guide and 6D.
#E%ARTMENTA E ECTIFE G#EH&F

CS&?+1 NAT-RA AN.-A.E %R'CESSIN. /) * * )0 Introduction to Natural anguage -nderstanding1 &he stud! of ,anguage2 App"ications of ),*2 E$a"uating ,anguage :nderstanding S!stems2 Different "e$e"s of ,anguage Ana"!sis2 ;epresentations and :nderstanding2 6rgani5ation of )atura" "anguage :nderstanding S!stems2 ,inguistic 0ac?groundG An out"ine of Eng"ish s!nta9. Introduction to semantics and ?no3"edge representation2 Some app"ications "i?e machine trans"ation2 data-ase interface. .rammars and %arsing1 1rammars and sentence Structure2 &op-Do3n and 0ottom-:p *arsers2 &ransition )et3or? 1rammars2 &op-Do3n Chart *arsing. <eature S!stems and Augmented 1rammarsG 0asic <eature s!stem for Eng"ish2 Morpho"ogica" Ana"!sis and the ,e9icon2 *arsing 3ith <eatures2 Augmented &ransition )et3or?s. .rammars 3or Natural anguage1 Au9i"iar! 7er-s and 7er- *hrases2 Mo$ement *henomenon in ,anguage2 and"ing Euestions in Conte9t-<ree 1rammars. uman preferences in *arsing2 Encoding uncertaint!2 Deterministic *arser. Com5utational mor5holog61 ,emmati5ation2 *art-of-Speech &agging2 <inite-State Ana"!sis. Am@iguit6 Resolution1 Statistica" Methods2 *ro-a-i"istic ,anguage *rocessing2 Estimating *ro-a-i"ities2 *art-ofSpeech tagging2 6-taining ,e9ica" *ro-a-i"ities2 *ro-a-i"istic Conte9t-<ree 1rammars2 0est <irst *arsing. Semantics and ,ogica" <orm2 =ord senses and Am-iguit!2 Encoding Am-iguit! in ,ogica" <orm.
'#
A55lication o3 N %1 Inte""igent =or? *rocessorsG Machine &rans"ationR :ser InterfacesR Man-Machine InterfacesG )atura" "anguage Luer!ing &utoring and Authoring S!stems. Speech ;ecognition Commercia" use of ),*. B''8S REC'MMEN#E# 1. 2. 3. 4. #. A?shar 0harti2 7ineet Chaitan!a and ;a@ee$ Sanga"2 ),*G A *aninian *erspecti$e2 *rentice De"hi Hames A""en2 )atura" ,anguage :nderstanding2 2/e2 *earson Education2 2003 D. Hurafs?!2 H. . Martin2 Speech and ,anguage *rocessing2 *earson Education2 2002 ,.M. I$ansca2 S. C. Shapiro2 )atura" ,anguage *rocessing and ,anguage ;epresentation &. =inograd2 ,anguage as a Cogniti$e *rocess2 Addison-=es"e! a""2 )e3
CS&?+) INF'RMATI'N RETRIEFA SYSTEMS
/) * * )0
Introduction1 Definition2 6-@ecti$es2 <unctiona" 6$er$ie32 ;e"ationship to D0MS2 Digita" "i-raries and Data =arehouses. In3ormation Retrie7al S6stem Ca5a@ilities1 Search2 0ro3se2 Misce""aneous Cataloging and Inde"ing1 6-@ecti$es2 Inde9ing *rocess2 Automatic Inde9ing2 Information E9traction. #ata Structures1 Introduction2 Stemming A"gorithms2 In$erted fi"e structures2 )-gram data structure2 *A& data structure2 Signature fi"e structure2 !perte9t data structure. Automatic Inde"ing1 C"asses of automatic inde9ing2 Statistica" inde9ing2 )atura" "anguage2 Concept inde9ing2 !perte9t "in?ages #ocument and Term Clustering1 Introduction2 &hesaurus generation2 Item c"ustering2 ierarch! of c"usters. -ser Search Techni=ues1 Search statements and -inding2 Simi"arit! measures and ran?ing2 ;e"e$ance feed-ac?2 Se"ecti$e dissemination of information search2 =eighted searches of 0oo"ean s!stems2 Searching the Internet and h!perte9t. Information 7isua"i5ationG Introduction2 Cognition and perception2 Information $isua"i5ation techno"ogies. Te"t Search Algorithms1 Introduction2 Soft3are te9t search a"gorithms2 ard3are te9t search s!stems. In3ormation S6stem E7aluation1 Introduction2 Measures used in s!stem e$a"uation2 Measurement e9amp"e > &;EC resu"ts. B''8S REC'MMEN#E# 1. 2. 3. 4. #. 8o3a"s?i2 1era"d2 Mar? & Ma!-ur!G Information ;etrie$a" S!stemsG &heor! and Imp"ementation2 8"u3er Academic *ress2 1..(. <ra?es2 =.0.2 ;icardo 0ae5a-DatesG Information ;etrie$a" Data Structures and A"gorithms2 *rentice a""2 1..2. Modern Information ;etri$a" 0! Dates *earson Education. Information Storage % ;etie$a" 0! ;o-ert 8orfhage > Hohn =i"e! % Sons. Soumen Chara-arti2 Mining the =e-2 Morgan-8aufmann
CS&?+, #ATA C'M%RESSI'N
/) * * )0
Introduction1 Compression &echniEuesG ,oss "ess compression2 ,oss! Compression2 Measures of prefonnance2 Mode"ing and coding2 Mathematica" Preliminaries for ,oss"ess compressionG A -rief introduction to information theor!2 Mode"sG *h!sica" mode"s2 *ro-a-i"it! mode"s2 Mar?o$ mode"s2 composite source mode"2 CodingG uniEue"! decoda-"e codes2 *refi9 codes.
''
!u33man coding1 &he uffman coding a"gorithmG Minimum $ariance uffman codes2 Adapti$e uffman codingG :pdate procedure2 Encoding procedure2 Decoding procedure. 1o"om- codes2 ;ice codes2 &unsta"" codes2 App"ications of offman codingG ,oss "ess image compression2 &e9t compression2 Audio Compression. Arithmetic Coding1 Coding a seEuence2 1enerating a -inar! code2 Comparison of 0inar! and uffman coding2 App"icationsG 0i-"e$e" image compression-&he H0I1 standard2 H0I122 Image compression. Dictionar! &echniEuesG Introduction2 Static Dictionar!G Diagram Coding2 Adapti$e Dictionar!. &he ,I(( Approach2 &he ,I(+ Approach2 App"icationsG <i"e Compression-:)IQ compress2 Image CompressionG &he 1raphics Interchange <ormat J1I<K2 Compression o$er ModemsG 7.42 -its2 *redicti$e CodingG *rediction 3ith *artia" match JppmKG &he -asic a"gorithm2 &he ESCA*E SDM06,2 "ength of conte9t2 &he E9c"usion *rincip"e2 &he 0urro3s-=hee"er &ransformG Mo$e-tofront coding2 CA,IC2 H*E1-,S2 Mu"ti-reso"ution Approaches2 <acsimi"e Encoding2 D!namic Mar?o! Compression. Mathematical %reliminaries 3or oss6 Coding1 Distortion criteria2 Mode"s2 Sca"ar 6uanti5ationG &he Luanti5ation pro-"em2 :niform Luanti5er2 Adapti$e Luanti5ation2 )on uniform Luanti5ation. Fector CuantiEation1 Ad$antages of 7ector Luanti5ation over Sca"ar Luanti5ation2 &he ,inde-0u5o-1ra! A"gorithm2 &ree structured 7ector Luanti5ers. Structured $ector Luanti5ers. B''8S REC'MMEN#E# 1. 2. 3. 4. 8ha"id Sa!ood2 Introduction to Data Compression2 Morgan 8aufmann *u-"ishers Mar? )e"son2C &he data compression -oo?G <eaturing fast2 efficient data compression techniEues in CC2 M%& 0oo?s Mar? )e"son and Hean-"oup 1ai""!2C &he Data Compression 0oo? 2nd edition B2M%& 0oo?s D. an?erson2 *. D. Hohnson2 and 1. A. arris2 Introduction to Information &heor! and Data Compression 1. e"d and &. ;. Marsha""2 Data and Image CompressionG &oo"s and &echniEues .
#.
#E%ARTMENTA E ECTIFE G#EH&FI

CS&?+( S'FT:ARE C-A ITY EN.INEERIN.
/) * *
)0
Introduction1 Defining Soft3are Lua"it!2 Soft3are Lua"it! Attri-utes and Specification2 Cost of Lua"it!2 Defects2 <au"ts2 <ai"ures2 Defect ;ate and ;e"ia-i"it!2 Defect *re$ention2 ;eduction2 and Containment2 6$er$ie3 of Different &!pes of Soft3are ;e$ie32 Introduction to Measurement and Inspection *rocess2 Documents and Metrics. So3tware Cualit6 Metrics1 *roduct Lua"it! MetricsG Defect Densit!2 Customer *ro-"ems Metric2 Customer Satisfaction Metrics2 <unction *oints2 In-*rocess Lua"it! MetricsG Defect Arri$a" *attern2 *hase-0ased Defect ;emo$a" *attern2 Defect ;emo$a" Effecti$eness2 Metrics for Soft3are MaintenanceG 0ac?"og Management Inde92 <i9 ;esponse &ime2 <i9 Lua"it!2 Soft3are Lua"it! Indicators. So3tware Cualit6 Management and Models1 Mode"ing *rocess2 Soft3are ;e"ia-i"it! Mode"sG &he ;a!"eigh Mode"2 E9ponentia" Distri-ution and Soft3are ;e"ia-i"it! 1ro3th Mode"s2 Soft3are ;e"ia-i"it! A""ocation Mode"s2 Criteria for Mode" E$a"uation2 Soft3are Lua"it! Assessment Mode"sG ierarchica" Mode" of Soft3are Lua"it! Assessment. So3tware Cualit6 Assurance1 Lua"it! *"anning and Contro"2 Lua"it! Impro$ement *rocess2 E$o"ution of Soft3are Lua"it! Assurance JSLAK2 Ma@or SLA Acti$ities2 Ma@or SLA Issues2 Iero Defect Soft3are2 SLA &echniEues2 Statistica" Lua"it! Assurance2 &ota" Lua"it! Management2 Lua"it! Standards and *rocesses. So3tware Feri3icationA Falidation 9 Testing1 7erification and 7a"idation2 E$o"utionar! )ature of 7erification and 7a"idation2 Impractica"it! of &esting a"" Data and *aths2 *roof of Correctness2 Soft3are &esting2 <unctiona"2 Structura" and Error-6riented Ana"!sis % &esting2 Static and D!namic &esting &oo"s2 Characteristics of Modern &esting &oo"s.
'(
B''8S REC'MMEN#E# 1. 2. 3. 4. #. Heff &ian2 Soft3are Lua"it! Engineering JSLEK2 =i"e!-Interscience2 200#R IS0) 0-4(1-(134#-(. Metrics and Mode"s in Soft3are Lua"it! Engineering2 Stephen . 8an2 Addison-=es"e! J2002K2 IS0)G 0201(2.1#' Soft3are Engineering2 A practitioner4s Approach- ;oger S. *ressman2 'th edition. Mc1ra3 i"" Internationa" Edition. Soft3are Engineering- Sommer$i""e2 (th edition2 *earson education. 1i""ies2 BSoft3are Lua"it! &heor! and *racticeC 2 Cengage ,earning2 )e3 De"hi /) * * )0
CS&?+< BI'INF'RMATICS
Fundamentals o3 Bioin3ormatics and In3ormation Technolog61Introduction to -ioinformatics2 E9perimenta" sources of -io"ogica" data2 pu-"ic"! a$ai"a-"e data-ases2 6perating s!stems - inc"uding =indo3s and :)IQ2 )et3or?s - inc"uding the Intranets and the Internet Anal6tical Science and Bioin3ormatics G igh throughput seEuencing2 E9perimenta" determination of protein structures2 1ene e9pression monitoring2 *roteomics2 Meta-o"omics Statistical Methods in Bioin3ormatics1 0asic mathematics2 7ectors and matrices2 Mu"ti$ariate statistics particu"ar"! e9p"orator! methods and pattern recognition Bioin3ormatics Algorithms and Tools1 7isua"i5ation of seEuence data2 SeEuence a"ignment2 omo"og! searching inc"uding 0,AS&2 1ene e9pression informatics2 Introduction to gene finding A55lications and Commercial As5ects o3 Bioin3ormatics1 7isua"i5ation of seEuence data2 Drug disco$er!2 1enetic -asis of disease2 *ersona"i5ed medicine and gene--ased diagnostics2 ,ega"2 ethica" and commercia" ramifications of -ioinformatics Bioin3ormatics1 The Business o3 Research1 ;esearch methodo"og! Jfocusing on computer--ased researchK2 Case studies of areas of current -ioinformatics research ;outes to research funding Jacademic and commercia"K2 0ioinformatics -usiness mode"s2 Inte""ectua" propert! rights So3tware Engineering in Bioin3ormatics G Ad$anced programming using Ha$a and 0ioHa$a2 Ad$anced data-ase 3or? using SL,2 Interfacings programs 3ith data-ases. Data interopera-i"it! using QM, %rinci5les o3 %rogramming and #ata@ases using Ba7a and SC 1 <undamenta" princip"es of programming2 6-@ect-oriented programming using Ha$a2 Introduction to data-ases using 6rac"e. %ER 5rogramming1 Data manipu"ation2 <i"e maintenance2 *ipe"ining *ac?aging and interfacing s!stem faci"ities B''8S REC'MMEN#E# 1. 2. 3. 4. #. 0ioinformatics for Dummies2 Hean-Miche" C"a$erie2 Cedric )otredame2 20032 Hohn =i"e! % Sons 0ioinformatics Computing2 0r!an *. 0ergeron2 20022 *rentice a"" Introduction to 0ioinformatics2 &eresa Att3ood2 Da$id *arr!-Smith2 20012 *rentice a"" 0eginning *er" for 0ioinformatics2 Hames &isda""220012 64rei""! De$e"oping Computer S?i""s 2 C!nthia 1i-as2 *erHam-ec?2 20012 64rei""! /) * * )0
CS&?)1 M- TIME#IA #ATABASES
Introduction1 An introduction to 6-@ect-oriented Data-asesR Mu"tidimensiona" Data StructuresG ?-d &rees2 *oint Luadtrees2 &he MQ-Luadtree2 ;-&rees2 comparison of Different Data Structures Image #ata@ases1 ;a3 Images2 Compressed Image ;epresentations2 Image *rocessingG Segmentation2 Simi"arit!0ased ;etrie$a"2 A"ternati$e Image D0 *aradigms2 ;epresenting Image D0s 3ith ;e"ations2 ;epresenting Image D0s 3ith ;-&rees2 ;etrie$ing Images 0! Spatia" ,a!out2 Imp"ementations Te"tJ#ocument #ata@ases1 *recision and ;eca""2 Stop ,ists2 =ord Stems2 and <reEuenc! &a-"es2 ,atent Semantic Inde9ing2 &7-&rees2 6ther ;etrie$a" &echniEues Fideo #ata@ases1 6rgani5ing Content of a Sing"e 7ideo2 Luer!ing Content of 7ideo ,i-raries2 7ideo Segmentation2 $ideo Standards
'+
Audio #ata@ases1 A 1enera" Mode" of Audio Data2 Capturing Audio Content through Discrete &ransformation2 Inde9ing Audio Data Multimedia #ata@ases1 Design and Architecture of a Mu"timedia Data-ase2 6rgani5ing Mu"timedia Data 0ased on &he *rincip"e of :niformit!2 Media A-stractions2 Luer! ,anguages for ;etrie$ing Mu"timedia Data2 Inde9ing SMDSs 3ith Enhanced In$erted Indices2 Luer! ;e"a9ation/E9pansion Creating #istri@uted Multimedia %resentations1 6-@ects in Mu"timedia *resentations2 Specif!ing Mu"timedia Documents 3ith &empora" Constraints2 Efficient So"ution of &empora" *resentation Constraints2 Spatia" Constraints. S5atial Conce5ts and #ata Models1 Mode"s of spatia" information2 Design e9tending the E; mode" 3ith spatia" concepts2 E9tending the E; mode" pictograms2 6-@ect oriented data mode" 3ith :M,. S5atial Cuer6 anguages1 E9tending the SL, for spatia" data2 E9amp"es of Eueries that emphasis spatia" data2 6-@ect re"ationa" schema e9amp"es Euerries. B''8S REC'MMEN#E# 1. 2. 3. 4. #. *rincip"es of Mu"timedia Data-ase S!stems2 7.S. Su-rahmanian2 E"se$eirJMorgan 8auffmanK. Spatia" Data-ases2 Shashi She?har2 San@i$ Cha3"a2 *earson Education. Mu"timedia Data-asesG An o-@ect re"ationa" approach2 ,!nne Dunc?"e!2 *earson Education. Mu"timedia Data-ase S!stems2 *ra-ha?aram2 Springer. Mahesh3ari Hain2 BD0MSG Comp"ete *ractica" ApproachC2 <ire3a"" Media2 )e3 De"hi
#E%ARTMENTA E ECTIFE G#EH&FII

CS& ?)) S'FT:ARE %R'BECT MANA.EMENT /) 1 * ?0 Con7entional So3tware Management1 &he 3aterfa"" mode"2 con$entiona" soft3are Management performance. E7olution o3 So3tware Economics1 Soft3are Economics2 pragmatic soft3are cost estimation. Im5ro7ing So3tware Economics1 ;educing Soft3are product si5e2 impro$ing soft3are processes2 impro$ing team effecti$eness2 impro$ing automation2 Achie$ing reEuired Eua"it!2 peer inspections. The old wa6 and the new1 &he princip"es of con$entiona" soft3are Engineering2 princip"es of modern soft3are management2 transitioning to an iterati$e process. i3e c6cle 5hases1 Engineering and production stages2 inception2 E"a-oration2 construction2 transition phases. Arti3acts o3 the 5rocess1 &he artifact sets2 Management artifacts2 Engineering artifacts2 programmatic artifacts. Model @ased so3tware architectures1 A Management perspecti$e and technica" perspecti$e. :or$ Flows o3 the 5rocess1 Soft3are process 3or?f"o3s2 Iteration 3or?f"o3s2 Chec$5oints o3 the 5rocess1 Ma@or mi"e stones2 Minor Mi"estones2 *eriodic status assessments. Iterati7e %rocess %lanning1 =or? -rea?do3n structures2 p"anning guide"ines2 cost and schedu"e estimating2 Iteration p"anning process2 *ragmatic p"anning. %ro2ect 'rganiEations and Res5onsi@ilities1 ,ine-of-0usiness 6rgani5ations2 *ro@ect 6rgani5ations2 e$o"ution of 6rgani5ations. %rocess Automation1 Automation 0ui"ding -"oc?s2 &he *ro@ect En$ironment. %ro2ect Control and %rocess instrumentation1 &he se$en core Metrics2 Management indicators2 Eua"it! indicators2 "ife c!c"e e9pectations2 pragmatic Soft3are Metrics2 Metrics automation. Tailoring the %rocess1 *rocess discriminants.
'.
Standards1 Introduction to standards - IS6 .002 and IS6 .003 - Lua"it! s!stem de$e"opment2 S6 .000 standard for soft3are2 :nderstanding IS6 .00-3 c"auses2 SEI mode" > capa-i"it! Maturit! mode" - <i$e "e$e"s 0ootstrap method2 Imp"ementing IS6 .0002 Ana"!sis the Lua"it! s!stem2 Documenting % Auditing Eua"it! s!stem2 IS6 .000 registration process % Accreditation S!stem2 &ota" Lua"it! Management Future So3tware %ro2ect Management1 Modern *ro@ect *rofi"es2 )e9t generation Soft3are economics2 modern process transitions. Case Stud61 &he command Center *rocessing and Disp"a! s!stem- ;ep"acement JCC*DS-;K B''8S REC'MMEN#E# 1. 2. 3. 4. #. Soft3are *ro@ect Management2 =a"?er ;o!ceG *earson Education2 200#. Soft3are Engineering > Somer$ i""e JAddison =es"e!K Soft3are *ro@ect Management2 0o- ughes and Mi?e Cottere""G &ata Mc1ra3- i"" Edition. Soft3are *ro@ect Management2 Hoe" enr!2 *earson Education. Soft3are *ro@ect Management in practice2 *an?a@ Ha"ote2 *earson Education.200#. /) 1 * ?0
CS&?), M'BI E C'M%-TIN.
Introduction to Mo@ile Communications and Com5uting1 Mo-i"e Computing JMCKG Introduction to MC2 no$e" app"ications2 "imitations2 and architecture. .SM1 Mo-i"e ser$ices2 S!stem architecture2 ;adio interface2 *rotoco"s2 ,oca"i5ation and ca""ing2 Securit!2 and )e3 data ser$ices. ando$er2
G:irelessH Medium Access Control1 Moti$ation for a specia"i5ed MAC J idden and e9posed termina"s2 )ear and far termina"sK2 SDMA2 <DMA2 &DMA2 CDMA. Mo@ile Networ$ a6er1 Mo-i"e I* J1oa"s2 assumptions2 entities and termino"og!2 I* pac?et de"i$er!2 agent ad$ertisement and disco$er!2 registration2 tunne"ing and encapsu"ation2 optimi5ationsK2 D!namic ost Configuration *rotoco" JD C*K. Mo@ile Trans5ort a6er1 &raditiona" &C*2 Indirect &C*2 Snooping &C*2 Mo-i"e &C*2 <ast retransmit/ fast reco$er!2 &ransmission /time-out free5ing2 Se"ecti$e retransmission2 &ransaction oriented &C*. #ata@ase Issues1 oarding techniEues2 caching in$a"idation mechanisms2 c"ient ser$er computing 3ith adaptation2 po3er-a3are and conte9t-a3are computing2 transactiona" mode"s2 Euer! processing2 reco$er!2 and Eua"it! of ser$ice issues. #ata #issemination1 Communications as!mmetr!2 c"assification of ne3 data de"i$er! mechanisms2 push-ased mechanisms2 pu""--ased mechanisms2 h!-rid mechanisms2 se"ecti$e tuning Jinde9ingK techniEues. Mo@ile Ad hoc Networ$s GMANETsH1 6$er$ie32 *roperties of a MA)E&2 spectrum of MA)E& app"ications2 routing and $arious routing a"gorithms2 securit! in MA)E&s. %rotocols and Tools1 =ire"ess App"ication *rotoco"-=A*. JIntroduction2 protoco" architecture2 and treatment of protoco"s of a"" "a!ersK2 0"uetooth J:ser scenarios2 ph!sica" "a!er2 MAC "a!er2 net3or?ing2 securit!2 "in? managementK and H2ME. B''8S REC'MMEN#E# 1. 2. 3. Hochen Schi""er2BMo-i"e CommunicationsC2Addison-%esley. JChapters 42(2.210211K2second edition2 2004. Sto@meno$ic and Cacute2 B and-oo? of =ire"ess )et3or?s and Mo-i"e ComputingC2 %iley2 20022 IS0) 04(141.02+. JChapters 112 1#2 1(2 2' and 2(K ;e5a 0ehra$anfar2 BMo-i"e Computing *rincip"esG Designing and De$e"oping Mo-i"e App"ications 3ith :M, and QM,C2 IS0)G 0#21+1(3312 Cam-ridge :ni$ersit! *ress2 6cto-er 20042
(0
4. #.
Ade"stein2 <ran?2 1upta2 Sandeep 8S2 ;ichard III2 1o"den 2 Sch3ie-ert2 ,oren2 B<undamenta"s of Mo-i"e and *er$asi$e ComputingC2 IS0)G 00(14123(.2 Mc1ra3- i"" *rofessiona"2 200#. ansmann2 Mer?2 )ic?"ous2 Sto-er2 B*rincip"es of Mo-i"e ComputingC2 "pringer2 second edition2 2003.
(1
CS&?)( !I.! S%EE# AN# BR'A#BAN# NET:'R8S
/) 1 * ?0
Introduction1 Introduction to modern net3or?ing trends '5tical networ$ing1 princip"es and cha""engesR e$o"ution of optica" net3or?s2 3a$e"ength routed net3or?2 3a$e"ength di$ision mu"tip"e9ing J=DMK net3or? techno"og!2 su--carrier mu"tip"e9ing optica" net3or?s. Ena-"ing techno"ogiesG optica" transmitter2 optica" fi-er2 optica" recei$ers2 optica" amp"ifiers2 optica" s3itching e"ements2 optica" cross-connects J6QCK2 mu"tip"e9ers/demu"tip"e9ers2 3a$e"ength routers2 optica" 3a$e"ength con$erters2 =DM net3or? test -eds. )et3or? architecture2 I* o$er =DM. Broadcast o5tical networ$s1 sing"e and mu"tip"e hop net3or?s2 channe" sharing and mu"ti-casting2 shared channe" mu"ticasting net3or?-1EM)E&2 performance e$a"uation for unicast and mu"ticast traffic2 e9perimenta" =DM net3or?s. :a7elength routed networ$s1 $irtua" topo"og! design2 routing and 3a$e"ength assignment2 circuit s3itched and pac?et s3itched approaches2 performance e$a"uation. Recon3iguration in :#M networ$2 net3or? contro" and management2 net3or? optimi5ation2 design considerations. Mu"ti 3a$e"ength star and ring net3or?s. *hotonic s3itching2 optica" &DM J6&DMK and optica" CDMA J6-CDMAK net3or?s2 ne9t generation optica" net3or?s. %rotection and Restoration on :#M networ$s Networ$ Flow 5ro@lem and Simulations Control and signaling schemes in :#M networ$s .M% S #ee5er %rotectionJRestoration issues on :#M networ$s '5tical Networ$ Securit6 B''8S REC'MMEN#E# 1. 2. 3. 4. #. CS&?)< Mu"ti3a$e"ength 6ptica" )et3or?sG A ,a!ered Approach -! &homas E. Stern2 8rishna 0a"a 6ptica" )et3or?ing -! De-ra Cameron2 =i"e!2 Decem-er 2001 6ptica" )et3or? Design and Imp"ementation -! 7i$e? A"3a!n2 Cisco *ress D=DM )et3or? Designs and Engineering So"utions -! Ash3in 1umaste2 &on! Anton!2 &on! Anthon!2 *earson Education. Mohan 1urusam!2 C. Si$a Murth!2 =DM &echno"og! and Issues in =DM 6ptica" )et3or?s2 *rentice a"" *u-"ications2 2002. :ireless Sensor Networ$s G) 1 * ?H
Introduction Introduction to =ire"ess sensor net3or?s2 Sing"e-sin? sing"e-hop =S)2 Sing"e-sin? mu"ti-hop =S)2 Mu"ti-sin? mu"ti-hop =S)2 Ad$antages of ad-hoc/sensor net3or?s2 )ode and )et3or? Architectures2 =ire"ess Sensor De$ice Architecture2 )et3or? Architectures2 Main features of =SA)s2 Current and future research on =SA)s A55lications o3 :SNs *ositioning and anima"s trac?ing2 Entertainment2 ,ogistics2 &ransportation2 Industria" Contro" and Monitoring2 ome Automation and Consumer E"ectronics2 Securit! and Mi"itar! Sensing2 Asset &rac?ing and Supp"! Chain Management2 Inte""igent Agricu"ture and En$ironmenta" monitoring2 ea"th Monitoring. Technologies 3or :SNs Iig0ee techno"og!2 :"tra3ide -and3idth techno"og!2 0"uetooth techno"og!2 Comparison among techno"ogies :SN %ro5agation Models Introduction2 =ire"ess *ropagation Mode"sG &he <ree Space *ropagation Mode"2 &he &3o-;a! 1round Mode"2 &he ,og-Distance *ath Mode"2 Energ! Dissipation Mode"2 Error Mode"sG &he Independent Error Mode"2 the &3o-State Mar?o$ Error Mode"2 Sensing Mode"sG &he 0inar! Sensing Mode"2 the *ro-a-i"istic Sensing Mode" Communication 5rotocols 3or :SNs MAC 5rotocols1 Schedu"ed protoco"s2 ,EAC protoco"2 1uo protoco"2 &;AMA protoco"2 Contention--ased protoco"s2 Ihong protoco"2 DMAC protoco"2 *AMAS protoco"2 SMAC protoco" Routing 5rotocols1 Issues in designing routing protoco"s2 C"assification of routing protoco"s2 <"at routing2 <"ooding and gossiping2 S*I) protoco"2 Directed diffusion protoco"2 ;umour routing2 1radient--ased routing2 ierarchica"
(2
routing2 ,EAC protoco"2 *E1ASIS protoco"2 &EE) protoco"2 MEC) protoco"2 S*A) protoco"2 ,ocation--ased routing protoco"s2 1A< protoco"2 1EA; protoco"2 1e;a< protoco"2 ;ugin protoco" Recommended Boo$s1 1. 2. 3. 4. #. ;o-erto 7erdone2 Da$ide Dardari2 1ian"uca Ma55ini and Andrea Conti2 B=ire"ess Sensor Actuators and )et3or?sC. Academic *ress. Migue" A. ,a-rador and *edro M. =ightman2 B&opo"og! Contro" in =ire"ess Sensor )et3or?sC-3ith a companion simu"ation too" for teaching and research2 Springer Science2 200. Edgar . Ca""a3a! =ire"ess Sensor )et3or?sG Architectures and *rotoco"s2 C;C *ress 2 2004 Qiang!ang ,i2 =ire"ess Ad oc and Sensor )et3or?sG &heor! and App"ications2 Cam-ridge :ni$ersit! *ress 200+. <eng Ihao and ,eonidas H. 1ui-as2 =ire"ess Sensor )et3or?sG An Information *rocessing Approach2 Morgan 8aufmann *u-"ishers is an imprint of E"se$ier2 200+. '%EN E ECTIFES G'EH &III CS&**( EMBE##E# SYSTEMS /) * * )0
Introduction1 Introduction to Em-edded S!stems2 C"assification of Em-edded S!stem2 Concept of Em-edded S!stem Design2 and Design cha""engesG *rocessor techno"og!2 IC techno"og!2 Design techno"og! and &rade-offs. !ardware and So3tware Co&#esign in Em@edded S6stem1 0uffers and "atches2 ;eset circuit2 Chip2 &imers and counters and 3atch dog timers2 :ni$ersa" as!nchronous recei$er2 transmitter J:A;&K2 *u"se 3idth modu"ators2 ,CD contro""ers. De$e"opment of fi9ed ;6M image2 Code generation too"sG Emu"ator2 Simu"ator and De-ugger. Em@edded so3tware de7elo5ment en7ironments G Cha""enges and issues in em-edded soft3are de$e"opment2 De$ice dri$ers2 S!stem ca""s and *rogramming "anguagesG assem-"! "anguages2 high "e$e" "anguages "i?e C/CAA2 Source Code Engineering too" for Em-edded C/CAA. Introduction to Em-edded Ha$a. %rocessor and memor6 'rganiEation1 Custom Sing"e *urpose *rocessor ard3are2 1enera"-*urpose *rocessorG Introduction2 0asic Architecture2 App"ication Specific Instruction Set *rocessors JASI*SK2 Microcontro""ers and Digita" Signa" *rocessors. Memor! 3rites a-i"it!2 Storage performance2 &radeoff s2 Memor! hierarch! and cache. So3tware Engineering in Em@edded S6stem1 Soft3are Engineering practice in the em-edded Soft3are de$e"opment process. Soft3are mode"s used in designing2 :nified Mode"ing "anguage2 Soft3are maintenance. Em@edded '5erating S6stem1 6perating s!stem ser$ices2 Em-edded 6perating s!stem2 ;ea" &ime 6perating s!stem2 Interrupt "atenc! and ;esponse time2 Interrupts ;outines in ;&6S2 Introduction to 79=or?s and Micro 6SII. B''8S REC'MMEN#E# 1. 2. 3. 4. #. Da$id E Simon2 BAn Em-edded Soft3are *rimerC2 1/e *earson Education 1.... ;a@ 8ama"2 BEm-edded S!stemsC2 &ata Mc1ra3- i"" 2004. 0ruce *o3e" Doug"ass2 B;ea"-&ime :M,G De$e"oping Efficient 6-@ects for Em-edded S!stemsC2 2/E Addison =es"e! 2004. Muhammad A"i Ma5idi2 Hanice 1i""ispie Ma5idi2 B&he +0#1 Micro contro""er % Em-edded S!stemsC2 1/e *earson Education 2000. 7a"$ano2 BEm-edded Microcomputer S!stems G A rea" time interfacingC2Cengage ,earning2 )e3 De"hi /) * * )0
CS&**; NET:'R8 MANA.EMENT SYSTEMS
#ata communications and Networ$ Management '7er7iew1 Ana"og! of &e"ephone )et3or? Management2 Communications protoco"s and Standards2 Case istories of )et3or?ing and Management2 Cha""enges of Information &echno"og! Managers2 )et3or? ManagementG 1oa"s2 6rgani5ation2 and <unctions2 )et3or? and S!stem Management2 )et3or? Management S!stem *"atform2 Current Status and future of )et3or? Management.
(3
SNM%F1 Networ$ Management1 6rgani5ation and Information and Information Mode"s. Managed networ$G Case istories and E9amp"es2 &he istor! of S)M* Management2 &he S)M* Mode"2 &he 6rgani5ation Mode"2 S!stem 6$er$ie32 &he Information Mode". SNM%71 Networ$ Management1 Communication and <unctiona" Mode"s. &he S)M* Communication Mode"2 <unctiona" mode" SNM% Management1 SNM%7+1 Ma@or Changes in S)M*$22 S)M*$2 S!stem Architecture2 S)M*$2 Structure of Management Information2 &he S)M*$2 Management Information 0ase2 S)M*$2 *rotoco"2 Compati-i"it! =ith S)M*$1 SNM% Management1 RM'N1 =hat is ;emote MonitoringX 2 ;M6) SMI and MI02 ;M6)12 ;M6)22 A&M ;emote Monitoring2 A Case Stud! of Internet &raffic :sing ;M6) Telecommunications Management Networ$1 =h! &M)X2 6perations S!stems2 &M) Conceptua" Mode"2 &M) Standards2 &M) Architecture2 &M) Management Ser$ice Architecture2 An Integrated 7ie3 of &M)2 Imp"ementation Issues. Networ$ Management Tools and S6stems1 )et3or? Management &oo"s2 )et3or? Statistics Measurement S!stems2 istor! of Enterprise Management2 )et3or? Management s!stems2 Commercia" )et3or? management S!stems2 S!stem Management2 Enterprise Management So"utions. :e@&Based Management1 )MS 3ith =e- Interface and =e--0ased Management2 =e- Interface to S)M* Management2 Em-edded =e--0ased Management2 Des?top management Interface2 =e--0ased Enterprise Management2 =0EMG =indo3s Management Instrumentation2 Ha$a management E9tensions2 Management of a Storage Area )et3or?G 2 <uture Directions B''8S REC'MMEN#E# 1. 2. 3. 4. #. )et3or? Management2 *rincip"es and *ractice2 Mani Su-rahmanian2 *earson Education. *rincip"es of )et3or? S!stem Administration2 Mar? 0urges2 =i"e! Dreamtech. Distri-uted )et3or? Management2 *au"2 Hohn =i"e!. =i""iam Sta""ings2 Data and Computer Communication2 *rentice a"" of India Sat5inger2 Hac?son and 0urd2 B6-@ect oriented ana"!sis and design 3ith the unified process C2Cengage ,earning2 )e3 De"hi
(4
CS&**<
1 'BBECT&'RIENTE# ANA YSIS AN# #ESI.N
/) * * )0
IntroductionGIntroduction to the Design *rocess Impro$ement Mode" 2Si9-,e$e" Impro$ement *rocess -M Structural Modeling Techni=uesG0asic 0ui"ding 0"oc?s -- o-@ects and c"asses2Structura" Composition &echniEues2Design Sca"ing Issues -M Beha7ioral Modeling Techni=ues G:se Case Diagrams2Interaction Diagrams2E$ent State Diagrams2Action Matrices20usiness ,ifec!c"e Diagrams2Acti$it! Diagrams2Co""a-oration Diagrams2;u"e Specification &echniEues20eha$iora" Mode"-0ased ;eference Architecture for Component Specification #esign Standards GArchitectura" *atterns 2Design *atterns2*rogram *atterns20eha$iora" Design :nits2Component-0ased Specification &echniEues #%IM & e7el 'neG;eEuirements Ana"!sis &echniEues2Ad oc Approach to Design #%IM & e7els Two2 &hree and <ourGDesign Methodo"og! Dep"o!ment #esign Cualit6 Control %ro5erties and Anal6sis Techni=uesGAutomatic Con$erta-i"it!2&racea-i"it!2Standardi5a-i"it! JDesign :nits/;eusa-"e *atternsK Modu"arit!2Changea-i"it! JChange ManagementK2Sca"a-i"it! of Design2;e"ia-i"it! #%IM & e7els Fi7e and Si"GDesign *rocess Management and 6ptimi5ation2Design Metric Mode"s2&esting Maturit! Mode"2E9tended 7-Mode" 2&esting &echniEues
B''8S REC'MMEN#E# 1. 3. 4. #. 1rad! 0ooch2 B6-@ect 6riented Ana"!sis and Design *rincip"es C2 Addison =es"e! *rofessiona" A"i 0ahrami2 B6-@ect 6riented S!stem De$e"opment B2 Mc1ra3 i"". H. ;am-augh2 eta"22 B6-@ect 6riented Mode"ing and DesignC Andre3 aigh2 B6-@ect 6riented Ana"!sis and DesignC2 &ata Mc1ra3 i""
2. Case Studies in 6-@ect-6riented Ana"!sis and Design -! Ed3ard Dourdon2 Car" Argi"a
(#
;T! SEMESTER S. No 1. 2. 3. 4. #. '. Course Code CS-499 CS-499 CS-499 CS-499 CS-999 CS-400 Course Title Teaching oad , & * DE-7III 3 1 0 DE-IQ 3 1 0 DE-Q 3 0 0 DE-QI 3 1 0 6E-I7 3 0 0 *ro@ect J*hase-IIK 0 0 + T'TA 1, ) ; #E%ARTMENTA E ECTIFE G#EH&FIII Course Title Teaching oad , & * S!stem Design using IC4s 3 1 0 Internet3or?ing &echno"ogies 3 1 0 Mode"ing and Simu"ation of 3 1 0 )et3or?s #E%ARTMENTA E ECTIFE G#EH&IK Course Title Teaching oad , & * Soft3are &esting Methodo"ogies 3 1 0 Distri-uted S!stems 3 1 0 6ptica" )et3or? Design and 3 1 0 Imp"ementation #E%ARTMENTA E ECTIFE G#EH&K Course Title Teaching oad , & * Data-ase Administration 3 0 0 uman Computer Interaction 3 0 0 1rid Computing Course Title 3 0 0 #E%ARTMENTA E ECTIFE G#EH&KI Teaching oad , & * Ad$anced 6perating S!stem 3 1 0 7irtua" ;ea"it! 3 1 0 I& for <orensic Science 3 1 0 '%EN E ECTIFES G'E H&IF Course Title Teaching oad , & * Computer 7ision 3 0 0 Soft Computing 3 0 0 Image *rocessing and *attern 3 0 0 ;ecognition Internet3or?ing &echno"ogies Data-ase Administration 3 3 0 0 0 0 Credit 4 4 3 4 3 4 ++ Credit 3 3 3 Credit 4 4 4 Credit 3 3 3 Credit 4 4 4 Credit 3 3 3 3 3 %re re=uisite -
S. No 1. 2. 3. S. No 1. 2. 3. S. No 1. 2. 3. S. No 1. 2. 3. S. No 1. 2. 3. 4. #.
Course Code CS-422 CS-424 CS-42' Course Code CS-42+ CS-430 CS-432 Course Code CS-434 CS-43' CS-43+ Course Code CS-440 CS-442 CS-444 Course Code CS-010 CS-011 CS-012 CS-424 CS-434
%re re=uisite %re re=uisite %re re=uisite Computer Architecture % 6rgani5ation %re re=uisite 6perating s!stem %re re=uisite -
('
;th SEMESTER #E%ARTMENTA E ECTIFE G#EH&FIII

CS&?++ SYSTEM #ESI.N -SIN. ICNS /) 1 * ?0
#esigning with Analog ICs G Designing 3ith op-ampsG Iero-crossing detector2 "ogarithmic amp"ifier2 7C62 Instrumentation amp"ifier 3ith 1 and 3 op-amps2 Designing of timing circuits 3ith IC ### for sin?ing % sourcing "oad current2 Design of temperature contro""ers and sma"" DC motor speed contro""ers using ICs such as S, 4402 CA 30#.2 *A 43'. Com@inational logic design 1 :sing gatesG "o3est chip count design2 comparison of reduced S6* % *6S forms for gi$en function2 gate sharing in mu"ti-function minimi5ation2 :sing MSI chips and programma-"e de$icesG re$ie3 of mu"tip"e9ers2 ShannonWs e9pansion theorem2 mu9 trees2 t!pe 1 % t!pe 2 mu9--ased design techniEues2 proper choice of se"ect inputs using 8-maps for "o3est chip count2 designing 3ith decoders using additiona" A)D/)A)D gates for "o3est chip count2 imp"ementation of "ogic functions using *;6M2 *A, and *,A. S6nchronous se=uential logic design G Moore2 Mea"! % mi9ed s!nchronous state machines2 ana"!sis of s!nchronous seEuentia" circuits2 timing diagrams2 state diagrams2 present state / ne9t state ta-"es2 state reduction2 state assignment2 design steps "eading to ne9t-state decoders2 use of D2 H82 & f"ip-f"ops2 con$ersion of one f"ip-f"op t!pe to another2 Design of sing"e- and mu"ti- mode counters. #esigning with shi3t registers1 uni$ersa" diagrams2 design of counters and seEuence generators using shift registers. Introduction to Controller #esign 1 Concept of mu"ti-input state m/c2 f"o3 and MDS diagrams2 design concept and steps2 use of com-inationa" MSI/,SI circuits and programma-"e de$ices in the design of seEuentia" mu"tip"e-input state machines. B''8S REC'MMEN#E# 1. =i""iam <"etcher2 BAn Engineering Approach to Digita" DesignV2 Morris Mano. 2. VDigita" DesignV ).8. Hog -- V,ogic CircuitsV2 other -oo?s -! S.;. 0huti!ani2 i"" % *eterson2 Samue" ,ee2 1a!a?3ad2 etc... 3. Austin &e9as2 BDesign-<or-&est <or Digita" ICWs and Em-edded Core S!stemsC2 *earson Education 4. *a"nit?ar2 BDesign 7erification 3ith eC2 *earson Education #. Crouch2 BDesign-<or-&est <or Digita" ICWs and Em-edded Core S!stemsC2 *earson Education CS&?+? INTERNET:'R8IN. TEC!N' '.IES /) 1 * ?0
Introduction to Internetwor$ing1 Internet3or?ing 0asics2 Ethernet *rotoco"2 <DDI *rotoco"2 &o?en ;ing / IEEE +02.# *rotoco" :AN Technologies1 <rame ;e"a!2 igh Speed Seria" Interface2 *oint to *oint *rotoco"2 S3itched Mu"timega-it Data Ser$ice2 As!mmetric Digita" Su-scri-er ,ine2 S!nchronous Data ,in? Contro" % Deri$ati$es Bridging and Switching1 A&M S3itching2 Data-,in? S3itching2 ,A) S3itching2 &ag S3itching2 Mi9ed Media 0ridging2 Source- ;oute 0ridging2 &ransparent 0ridging Networ$ %rotocols1 App"e &a"?2 DEC)E&2 S)A2 )E&=A;E2 0an!an 7ines2 Qero9 )et3or? S!stems Routing %rotocols1 0order 1ate3a!2 I1;* % Enhanced I1;*2 Internet *rotoco" Mu"ticast2 ),S*2 6S*<2 ;esource ;eser$ation *rotoco"2 ;I*2 Simp"e Mu"ticast ;outing *rotoco" Networ$ Management Basics1 I0M )et3or? Management2 ;emote Monitoring2 Simp"e )et3or? Management *rotoco" Introduction to Trou@leshooting1 S!mptoms2 *ro-"ems and So"utions2 1enera" *ro-"em So"$ing Mode"s2 *reparing for )et3or? <ai"ures2 :se of Some &rou-"eshooting &oo"s !andling Trou@leshooting 3or Some Im5ortant Com5onents1 Ethernet2 <DDI and &o?en ;ing2 &C*/I*2 App"e ta"?2 DEC)E&2 S)A % )E&=A;E2 0an!an 7ines % Q)S2 Seria" "ines % =A) Connections2 0ridging and S3itching. B''8S REC'MMEN#E# 1. 2. 3. 4. Meri"ee <ord2 BInternet3or?ing &echno"ogies and-oo?C2 Ed Cisco *ress J2004K 8e$in Do3nes2 BInternet3or?ing &rou-"eshooting and-oo?C2 Ed Cisco *ress J2004K Andre3 S. &anen-aum2 BComputer )et3or?sC2 *earson Education 4th Edition J2003K Hames < 8urose and 8eith = ;oss2 BComputer )et3or?ingC2 *earson Education J2002K
((
#.
)ance2 BIntroduction to )et3or?ingC2 * I 4th Edition J2002K
(+
CS&?+> M'#E IN. AN# SIM- ATI'N 'F NET:'R8S
/) 1 * ?0
#ela6 Models in #ata Networ$s1 Lueuing Mode"s2 M/M/12 M/M/m2 M/M/[Z M/M/m/m and other Mar?o$ S!stem2 M/1/1 S!stem2 )et3or?s of &ransmission ,ines2 &ime ;e$ersi-i"it!2 )et3or?s of Lueues. Multi&access Communication1 S"otted Mu"ti-access and the A"oha S!stem2 Sp"itting A"gorithms2 Carrier Sensing2 Mu"ti-access ;eser$ations2 *ac?et ;adio )et3or?s. Routing in #ata Networ$s1 Introduction2 )et3or? A"gorithms and Shortest *ath ;outing2 0roadcasting ;outing InformationG Coping 3ith ,in? <ai"ures2 <"o3 mode"s2 6ptima" ;outing2 and &opo"ogica" Design2 Characteri5ation of 6ptima" ;outing2 <easi-"e Direction Methods for 6ptima" ;outing2 *ro@ection Methods for 6ptimum ;outing2 ;outing in the Code9 )et3or?. Flow Control1 Introduction2 =indo3 <"o3 Contro"2 ;ate Contro" Schemes2 6$er$ie3 of <"o3 Contro" *ractice2 ;ate Ad@ustment A"gorithms. B''8S REC'MMEN#E# 1. 2. 3. Dimitri 0ertse?as and ;o-ert 1a""ager2 BData )et3or?s2V 2nd edition2 *rentice a"" of India2 2003. =i""iam Sta""ings2 B igh-Speed )et3or?s and Internets2C *earson Education JAsiaK *te. ,td2 2004. H. =a"rand and *. 7ara!a2C igh *erformance Communication )et3or?s2C 2nd edition2 arcourt India *te. ,td. % Morgan 8aufman2 2000. Hean =a"rand2 8a""o" 0agchi21eorge =. Io-rist B)et3or? performance mode"ing and simu"ationC2 1ordon and 0reach Science *u-"ishers2 Inc. )e3ar?2 )H2 :SA )ader <. Mir2 BComputer and CommunicationC2 *rentice ha"".
4.
#.
#E%ARTMENTA E ECTIFE G#EH&IK

CS&?+; S'FT:ARE TESTIN. MET!'#' '.IES Introduction1 *urpose of testing2 Dichotomies2 mode" for testing2 conseEuences of -ugs2 ta9onom! of -ugs Flow gra5hs and %ath testing1 0asics concepts of path testing2 predicates2 path predicates and achie$a-"e paths2 path sensiti5ing2 path instrumentation2 app"ication of path testing. Transaction Flow Testing1 &ransaction f"o3s2 transaction f"o3 testing techniEues. Dataf"o3 testingG 0asics of dataf"o3 testing2 strategies in dataf"o3 testing2 app"ication of dataf"o3 testing. #omain TestingG domains and paths2 )ice % ug"! domains2 domain testing2 domains and interfaces testing2 domain and interface testing2 domains and testa-i"it!. %athsA %ath 5roducts and Regular e"5ressions1 % ath products % path e9pression2 reduction procedure2 app"ications2 regu"ar e9pressions % f"o3 anoma"! detection. ogic Based Testing1 6$er$ie32 decision ta-"es2 path e9pressions2 ?$ charts2 specifications. StateA State .ra5hs and Transition testing1 State graphs2 good % -ad state graphs2 state testing2 &esta-i"it! tips. .ra5h Matrices and A55lication1 Moti$ationa" o$er$ie32 matri9 of graph2 re"ations2 po3er of a matri92 node reduction a"gorithm2 -ui"ding too"s. :sage of HMeter and =inrunner too"s for functiona" / ;egression testing2 creation of test script for unattended testing2 s!nchroni5ation of test case2 ;apid testing2 *erformance testing of a data -ase app"ication and &&* connection for 3e-site access. B''8S REC'MMEN#E# 1. 2. 3. Soft3are testing techniEues - 0aris 0ei5er2 Dreamtech2 second edition. &he craft of soft3are testing - 0rian Maric?2 *earson Education. Soft3are &esting &echniEues > S*DJ6rei""eK /) 1 * ?0
(.
4. #.
Soft3are &esting in the ;ea" =or"d > Ed3ard 8it2 *earson. Soft3are &esting > Doroth! 1raham2 Cengage ,earning2 )e3 De"hi /) 1 * ?0
CS&?)* #ISTRIB-TE# SYSTEMS
CharacteriEation o3 #istri@uted S6stemsG Introduction2 E9amp"es of distri-uted S!stems2 ;esource sharing and the =e- Cha""enges. S6stem Models1 Architectura" mode"s2 <undamenta" Mode"s Theoretical Foundation 3or #istri@uted S6stem G ,imitation of Distri-uted s!stem2 a-sence of g"o-a" c"oc?2 shared memor!2 ,ogica" c"oc?s2 ,amport4s % $ectors "ogica" c"oc?s2 Causa" ordering of messages2 g"o-a" state2 and termination detection. #istri@uted Mutual E"clusionG C"assification of distri-uted mutua" e9c"usion2 reEuirement of mutua" e9c"usion theorem2 &o?en -ased and non to?en -ased a"gorithms2 performance metric for distri-uted mutua" e9c"usion a"gorithms. #istri@uted #eadloc$ #etectionG s!stem mode"2 resource 7s communication dead"oc?s2 dead"oc? pre$ention2 a$oidance2 detection % reso"ution2 centra"i5ed dead "oc? detection2 distri-uted dead "oc? detection2 path pushing a"gorithms2 edge chasing a"gorithms. Agreement %rotocolsG Introduction2 S!stem mode"s2 c"assification of Agreement *ro-"em2 0!5antine agreement pro-"em2 Consensus pro-"em2 Interacti$e consistenc! *ro-"em2 So"ution to 0!5antine Agreement pro-"em2 App"ication of Agreement pro-"em2 Atomic Commit in Distri-uted Data-ase s!stem. #istri@uted '@2ects and Remote In7ocationG Communication -et3een distri-uted o-@ects2 ;emote procedure ca""2 E$ents and notifications2 Ha$a ;MI case stud!. Securit6G 6$er$ie3 of securit! techniEues2 Cr!ptographic a"gorithms2 Digita" signatures Cr!ptograph! pragmatics2 Case studiesG )eedham Schroeder2 8er-eros2 SS, % Mi""icent. #istri@uted File S6stems G <i"e ser$ice architecture2 Sun )et3or? <i"e S!stem2 &he Andre3 <i"e S!stem2 ;ecent ad$ances. Transactions and Concurrenc6 ControlG &ransactions2 )ested transactions2 ,oc?s2 6ptimistic Concurrenc! contro"2 &imestamp ordering2 Comparison of methods for concurrenc! contro". #istri@uted TransactionsG <"at and nested distri-uted transactions2 Atomic Commit protoco"s2 Concurrenc! contro" in distri-uted transactions2 Distri-uted dead"oc?s2 &ransaction reco$er!. ;ep"icationG S!stem mode" and group communication2 <au"t -to"erant ser$ices2 high"! a$ai"a-"e ser$ices2 &ransactions 3ith rep"icated data. #istri@uted AlgorithmsG Introduction to communication protoco"s2 0a"anced s"iding 3indo3 protoco"2 ;outing a"gorithms2 Destination -ased routing2 A** pro-"em2 Dead"oc? free *ac?et s3itching2 Introduction to 3a$e % tra$ersa" a"gorithms2 E"ection a"gorithm. C'RBA Case Stud6G C6;0A ;MI2 C6;0A ser$ices. B''8S REC'MMEN#E# 1. 2. 3. 4. #. Singha" % Shi$aratri2 VAd$anced Concept in 6perating S!stemsV2 Mc1ra3 i"" Cou"ouris2 Do""imore2 8ind-erg2 VDistri-uted S!stemG Concepts and DesignC2 *earson Ed. 1era"d &e"2 VDistri-uted A"gorithmsV2 Cam-ridge :ni$ersit! *ress )anc! ,!nch2 Distri-uted A"gorithms2 Morgan 8aufmann. Andre3 S. &anen-aum2 Distri-uted 6perating S!stems2 ACM *ress. /) 1 * ?0
CS&?)+ '%TICA NET:'R8 #ESI.N AN# IM% EMENTATI'N
Introduction to o5tical networ$ing 1 Introduction to S6)E&/SD 2 S6)E&/SD 2 ,egac! S6)E&/SD Mu"tiser$ice *ro$isioning *"atforms2 Impro$ing S6)E&/SD 0and3idth Efficienc!2 Los2 S6)E&/SD
+0
Encapsu"ation of Ethernet2 *ac?et ;ing &echno"ogies2 *ro$isioning2 Signa"ing2 Dense =a$e"ength-Di$ision Mu"tip"e9ing2 &he future of S6)E&/SD and D=DM. Time #i7ision Multi5le"ing 1 An Introduction to &ime-Di$ision Mu"tip"e9ing2 Ana"og Signa" *rocessing2 Ana"og Signa" 1eneration and ;eception2 Ana"og &o Digita" Con$ersion - <i"tering2 Samp"ing2 Luanti5ation2 \"a3 and A-,a3 coding2 Echo Cance""ation R Circuit-S3itched )et3or?s - &DM Signa"ing2 Channe" >Associated Signa"ingJCASK2 Common Channe" Signa"ingJCCSK R &he &-carrier - DS <raming2 DS Mu"tiframing2 D4 Superframe2 D# e9tended Superframe2 S< and ES< A"arms R &he E-carrier - E1 <rame A"ignment Signa"2 E1 Mu"tiframe A"ignment Signa"2 E1 C;C Error Chec?ing2 E1 Errors and A"arms R ISD) - ISD) 0;I2 ISD) *;I2 ISD) ,a!er 12 ISD) ,a!er 22 ISD) ,in? ,a!er Esta-"ishment R ISD) ,a!er 3 - ISD) Ca"" setup R &DM net3or?s E"ements - ;epeaters2 CS:/DS:2 Digita" Access and Cross-Connect S!stems2 Channe" 0an? R Fi@er D'5tic Technologies 1 A -rief histor! of <i-er 6ptics CommunicationsR <i-er 6ptic App"icationsR *erformance ConsiderationsR 6ptica" >*o3er Measurement 21"ass fi-er-optic ca-"e2 *"astic fi-er optic ca-"e2 *"astic c"ad Si"ica <i-er-optic ca-"e2 Mu"tifi-er ca-"e s!stemsR *ropagation Modes 2 <i-er-optic Characteristics GInterference2 ,inear Characteristics - Attenuation2 Chromatic Dispersion2 *o"ari5ation Mode Dispersion2 6ptica" Signa" to noise ;atio R )on-"inear characteristics - Se"f >phase Modu"ation2 Cross- phase Modu"ation2 <our- =a$e Mi9ing2 Stimu"ating ;aman Scattering2 Stimu"ating -ri""ouin ScatteringR :a7elength #i7ision Multi5le"ing 1 &he need for =a$e"ength-Di$ision Mu"tip"e9ingR =a$e"ength-Di$ision Mu"tip"e9ingR =a$e"ength-Di$ision Mu"tip"e9ing <undamenta"sR :nidirectiona" =DMR 0idirectiona" =DM G0and-Separation Method2 Inter"ea$ing ><i"ter Method2 Circu"ator Method2 Channe" spacingR Coarse =a$e"engthDi$ision Mu"tip"e9ingR Dense 3a$e"ength-Di$ision Mu"tip"e9ingR &he I&: 1ridR =a$e"ength- Di$ision Mu"tip"e9ing S!stemsR &ransmitter G- Distri-uted <eed-ac? ,asers2 Distri-uted 0ragg ;ef"ector2 &una-"e ,asers2 7ertica" Ca$it! Surface Emitting ,asersR ChirpR Modu"atorsR 6ptica" Mu"tip"e9ers and Mu"tip"e9ers G- &hin fi"m <i"ter2 <i-er 0ragg 1rating2 Arra!ed =a$eguide2 <a-r! *erot Ca$it! <i"ter2 Acousto 6ptica" &una-"e <i"ter2 MachIehnder Interferometers2 Coup"ers2circu"ators and Iso"ators2 *eriodic <i"ters2 <reEuenc! S"icers and Inter"ea$ersR Amp"ifiers G- Er-ium-Doped <i-er Amp"ifiers2 ;aman fi-er Amp"ifiers2 !-rid and Distri-uted Amp"ifiersR 6ptica"-fi-er MediaR ;ecei$ers :#M characteristics and Im5airments to transmission 1 <or3ard Error Correction2 In--and <EC2 6ut-of--and <ECR 6ptica" Signa"-to-noise ratio G- 6S); Ca"cu"ationsR Dispersion and Compensation in =DM G- Chromatic Dispersion2 Chromatic Dispersion Compensation2 *o"ari5ation Mode Dispersion2 *o"ari5ation Mode Dispersion CompensationR B''8S REC'MMEN#E#
1. 2. 3. 4.
#.
A"3a!n2C 6ptica" )et3or? Design and Imp"ementationC2 Cisco *ress. Dutton2 B:nderstanding 6ptica" CommunicationC2 I0M pu-"ications. M!nea$2 B6ptica" <i-re &echno"og!C2 *earson. 1.*. Agar3a"2 V <i-er optic communication s!stems V2 2nd Edition2 Hohn =i"e! % Sons2 )e3 Dor?. 1.8eiser2 V 6ptica" fi-er communication V2 S!stems2 Mc1ra3- i""2 )e3 Dor?2 2000.
#E%ARTMENTA E ECTIFE G#EH&K

CS&?)? #ATABASE A#MINISTRATI'N /) * * )0
Introduction to #ata@ase and SC Ser7er +***1 C"ient/Ser$er Concept2 &!pes of Data-ases2 ;e"ationa" 7s. <"at <i"e Data-ase. 0ac?ground of SL, Ser$er2 7ersions of SL, Ser$er and C"ients Supported -! SL, Ser$er. Insta""ation % Configuring SL, Ser$erG Insta""ing SL, Ser$er 20002 :nattended Insta""ations2 SL, Ser$er Ser$ices. Configuring SL, Ser$er )et3or? *rotoco" Settings. Insta""ing SL, Ser$er C"ients. SC Ser7er Tools and -tilities G Managing SL, Ser$er 3ith Enterprise Manager2 Luer! Ana"!ser2 SL, Ser$er 1roups. &oo"s Menu2 Action Menu. Introduction to &ransact > SL,J&-SL,K Managing #ata@ase1 Creating Data-ase2 Data-ase <i"e *"acementJ;AID 02 ;AID 1 ;AID #K2 Creating Data-ase using &-SL, and Enterprise Manager. A"tering2 ;enaming2 Dropping Data-ase. Creating 6-@ects in Data-aseG &a-"es2 7ie3s2 Constraints2 Inde9es. Managing Securit61 :nderstanding Securit! Modes2 =indo3s Authentication Modes2 Mi9ed Mode2 SL, Ser$er ,ogins2 =indo3s ,ogins2 <i9ed Ser$er ,ogins2 Creating :sers2 Data-ase ;o"es2 J1rant2;e$o?e 2Den!K )-&ier Securit!. Data-ase 0ac?ups and ;estoreG Cop!ing Data-ase 3ith Cop! Data-ase =i5ard. SL, Data-ase 0ac?up
+1
ModesJ<u""2 Differentia"2 &ransactiona" ,og 0ac?upK. 0ac?ing :p of the Data-ase. ;estoring Data-ase. D&SG Its meaning2 D&S *ac?ages. D&S Storage and Designer. SC Ser7er Agent1 Configuring :nderstanding A"erts2 Ho-s and E$ents. Creating Ho-sG Mu"ti Ser$er Ho-s2 Creating2 Editing and De"eting of Ho-s. SL, Ser$er and IIS. :nderstanding the Static *age and D!namic *ages of the Internet. Internet Data-ase Connector. ;ep"ication and *erformance 6ptimi5ationG 6$er$ie3 of ;ep"ication. Insta""ing. &!pes of ;ep"ication G Merge ;ep"ication2 Snapshot ;ep"ication2 &ransactiona" ;ep"ication. :sing =indo3s S!stem MonitorG Monitor 3ith SL, *rofi"er and Luer! Ana"!ser. 6ptimi5ation &echniEuesG Lueries and Stored *rocedure2 *roper Inde9ing2 ,oc?s and Defragmentation. B''8S REC'MMEN#E# 1.
2. 3.
4. #.
Da$id C. 8reines2 0rian ,as?e!2C 6rac"e Data-ase Administration B2 6rei""! Media Craig S Mu""ins2C Data-ase AdministrationG &he Comp"ete 1uide to *ractices and *roceduresC2*o3e""4s -oo?s C"aire ;a@an2C 6rac"e 10g Data-ase Administrator IIG 0ac?up/reco$er! % )et3or? AdministrationC2-! &homson Sam ;. A"apati2C E9pert 6rac"e.i Data-ase AdministrationC2 Apress Dan 3ood2 B0egininig SL, Ser$er 200# AdministrationC2 =ro9 pu-"iction /) * * )0
CS&?)> !-MAN C'M%-TER INTERACTI'N
Interacti7e s6stemsG defining the pro-"emR identif!ing tas?s2 acti$ities and processesR defining usa-i"it!R e9amp"es. The human userG channe"s of communication J$isua"2 auditor!2 manipu"ati$eKR theories of human memor! Jshortterm2 "ong- termKR $aria-i"it! and "imits of human capa-i"itiesR theories of human reasoning and pro-"em-so"$ingR tas?s and strategies. Interacti7e de7ices and technologiesG sur$e! of current techno"ogies J?e!-oards2 pointing de$ices2 disp"a!s2 hardcop!2 audio2 etcKR use of graphics2 co"or2 presentation of te9t. #esign o3 inter3aces1 s!stem structure Japp"ications2 interface management2 presentation or de$ice contro"KR design methodsR dia"ogue design and st!"es Jmenu s!stems2 direct manipu"ation2 command "anguages2 etcKR 3indo3ing s!stemsR ne3 ideas in interfaces Jeg $irtua" rea"it!K. &oo"s and techniEues for the construction of interfaces. E7aluationG testing and e$a"uating interacti$e s!stemsR e$a"uation and the design processR methods of e$a"uation Jo-ser$ation and monitoring2 inter$ie3s and Euestionnaires2 -enchmar?ing2 etcK. 'rganiEational issuesG users and their en$ironmentR design methodo"ogies Juser participationKR cooperati$e 3or?R case studies. B''8S REC'MMEN#E# 1. 2. 3. Di92 <in"a!2 A-oud % 0ea"e2 uman-Computer Interaction. *earson *rentice- a""2 2004 *reece et a"2 uman-Computer Interaction2 Addison-=es"e!2 1..4. ans-Horg 0u""inger2C uman-Computer InteractionC2 ,a3rence Er"-aum Associates2 *u-"ishers Ha?o- )ie"sen2C Ad$ances in uman-computer InteractionC2A-"e9 *u-"ishing Corporation &homas S. uang2C ;ea"-&ime 7ision for uman-Computer InteractionC2 Springer /) * * )0
4. #.
CS&?); .RI# C'M%-TIN.
Introduction1 <undamenta"s of 1rid Computing2 &!pes of resources2 *ro-"ems in 1rid computing2 1"o-a" Distri-ution S!stem for 1rid Computing2 Ecos!stem of the 1rid2 Ear"! 1rid Acti$ities .rid Architecture1 Autonomic Computing2 Ser$ice-6riented Architecture and 1rid2 Semantic 1rids2 Merging the 1rid Ser$ices Architecture 3ith the =e- Ser$ices Architecture. 6pen 1rid Ser$ices Architecture J61SAK .rid Com5uting in Business1 1rid-specia"i5ing $endors and niche $endors2 1rid resource pro$iders2 Departmenta" grids2 Enterprise grids2 *artner grids2 6pen grids. .rid so3tware com5onents1 Management components2 Donor soft3are2 Su-mission soft3are2 Distri-uted grid management2 Schedu"ers2 Enro""ing and insta""ing grid soft3are2 ,ogging onto the grid2 ,ogging onto the grid
+2
.rid administration1 *"anning2 Insta""ation2 Managing enro""ment of donors and users2 Certificate authorit!2 ;esource management2 Data sharing Technical and Management Issues1 0ui"ding and se""ing 1rid -usiness case2 transition period management2 ;o"e of consu"tants2 ;is? Mitigation2 6rgani5ationa" securit! reEuirements and fire3a""s2 Authori5ation sca"a-i"it! and federations Case Stud61 &he MC)C Enterprise 1ridG Ser$ice2 Customers2 <inancia"s2 ;esources2 ,ocation B''8S REC'MMEN#E#
1. Hosh! Hoseph2 Craig <e""enstein2C 1rid ComputingC2 I0M *ress 2. Mao5hen ,i2 Mar? 0a?er2C &he 1ridG Core &echno"ogiesC2 Hohn =i"e! % SonWs *u-"isher
3. 4. Ahmar A--as 2C1rid ComputingG *ractica" guide to techno"og! and app"icationsC2*u-"isherGChar"es ;i$er Media *a3e" *"as5c5a? and ;ich =e""ner2C 1rid ComputingG &he Sa$$! ManagerWs 1uide Morgan 8aufmann *u-"ishers Marios D. Di?aia?os2C 1rid ComputingC2 Spinger
#.
#E%ARTMENTA E ECTIFE G#EH&KI

CS&??* A#FANCE# '%ERATIN. SYSTEM /) 1 *?)0
%rocess S6nchroniEation1 Concepts of processes2 Concurrent processes2 &hreads2 6$er$ie3 of different c"assica" s!nchroni5ation pro-"ems2 Monitors2 Communicating SeEuentia" processes JCS*K %rocess deadloc$s1 Introduction2 causes of dead"oc?s2 Dead"oc? hand"ing strategies2 Mode"s of dead"oc? #istri@uted o5erating s6stem1 Architectures2 Issues in Distri-uted operating s!stems2 ,imitations of Distri-uted S!stems2 ,amport4s "ogica" c"oc?2 1"o-a" states2 Chand!-,ampert4s g"o-a" state recording a"gorithm20asic concepts of Distri-uted Mutua" E9c"usion 2,amport4s A"gorithm2 ;icart-Agra3a"a A"gorithmR 0asic concepts of Distri-uted dead"oc? detection2 Distri-uted <i"e s!stem2 Architecture2 Design issues2 S:) )et3or? <i"e s!stem 0asic concepts of Distri-uted shared memor!2 0asic concepts of Distru-uted Schedu"ing2 ,oad -a"ancing2 ,oad sharing. #istri@uted 'S Im5lementation1 Mode"s2 )aming2 *rocess migration2 ;emote *rocedure Ca""s. Multi5rocessor S6stem1 Moti$ation2 C"assification2 Mu"tiprocessor Interconnections2 &!pes2 Mu"tiprocessor 6S functions % reEuirementsR Design % Imp"ementation IssueR Introduction to para""e" programmingR Mu"tiprocessor S!nchroni5ation. %er3ormanceA Co5rocessorsA RISC 9 data 3low1 Introduction2 )ecessit!2 Measures2 &echniEues2 0ott"enec?s % Saturation2 <eed-ac? "oops2 Coprocessors2 ;ISC. Anal6tic Modeling1 Introductions2 Lueuing &heor!2 Mar?o$ *rocess. Securit6 9 %rotection1 Securit!-threats % goa"s2 *enetration attempts2 Securit! *o"icies % mechanisms2 Authentication2 *rotections % access contro" <orma" mode"s of protection2 Cr!ptograph!2 3orms % $iruses. B''8S REC'MMEN#E# 1. 2. 3. 4. #. 6perating S!stems Concepts % design - Mi"an Mi"en?o$ic2 &M 6perating S!stem - .M. Deite"2 *earsons. Ad$anced Concepts in operating S!stems - Mu?esh Singha" and )iran@an 1. Shi$aratri2 &M Maurice 0ach2 Design of the :ni9 6perating S!stems2 *rentice- a"" of India. Char"es Cro3"e!2 6perating S!stemG A Design-oriented Approach2 Ir3in *u-"ishing
+3
CS&??+ FIRT-A REA ITY
/) 1 * ?0
Introduction1 &he three I4s of $irtua" rea"it!2 commercia" 7; techno"og! and the fi$e c"assic components of a 7; s!stem. In5ut #e7ices1 J&rac?ers2 )a$igation2 and 1esture InterfacesKG &hree-dimensiona" position trac?ers2 na$igation and manipu"ation2 interfaces and gesture interfaces. 'ut5ut #e7ices1 1raphics disp"a!s2 sound disp"a!s % haptic feed-ac?. Modeling1 1eometric mode"ing2 ?inematics mode"ing2 ph!sica" mode"ing2 -eha$iour mode"ing2 mode" management. !uman Factors1 Methodo"og! and termino"og!2 user performance studies2 7; hea"th and safet! issues. A55lications1 Medica" app"ications2 mi"itar! app"ications2 ro-otics app"ications. FR %rogramming&I1 Introducing Ha$a 3D2 "oading and manipu"ating e9terna" mode"s2 using a "athe to ma?e shapes. FR %rogramming&II1 3D Sprites2 animated 3D sprites2 partic"e s!stems. B''8S REC'MMEN#E# 1. 2. 3. 4. #. 7irtua" ;ea"it! &echno"og!2 Second Edition2 1regor! C. 0urdea % *hi"ippe Coiffet2 Hohn =i"e! % Sons2 Inc.2 :nderstanding 7irtua" ;ea"it!2 interface2 App"ication and Design2 =i""iam ;.Sherman2 A"an Craig2 E"se$ierJMorgan 8aufmannK. 3D Mode"ing and surfacing2 0i"" <"eming2 E"se$ierJMorgan 8auffmanK. 3D 1ame Engine Design2 Da$id .E-er"!2 E"se$ier. 7irtua" ;ea"it! S!stems2 Hohn 7ince2 *earson Education. /) 1 * ?0
CS&??? IT F'R F'RENSIC SCIENCE
'7er7iew1 6$er$ie3 of 0iometrics2 0iometric Identification2 0iometric 7erification2 0iometric Enro""ment2 0iometric2 S!stem Securit!. Authentication and Biometrics G Secure Authentication *rotoco"s2 Access Contro" Securit! Ser$ices2 Authentication Methods2 Authentication *rotoco"s2 Matching 0iometric Samp"es2 7erification -! humans. Common @iometrics1 <inger *rint ;ecognition2 <ace ;ecognition2 Spea?er ;ecognition2 Iris ;ecognition2 1eometr!2 Signature 7erification2 *ositi$e and )egati$e of 0iometrics. and
Matching1 &3o ?inds of errors2 Score distri-ution2 Estimating Errors from Data2 Error ;ate of Match Engines2 Definition of <A; and <;;. Introduction to In3ormation !iding1 &echnica" Steganograph!2 ,inguistic Steganograph!2 Cop! ;ight Enforcement2 =isdom from Cr!ptograph! %rinci5les o3 Steganogra5h61 <rame3or? for Secret Communication2 Securit! of Steganograph! S!stem2 Information iding in )ois! Data 2 Adapti$e $ersus non-Adapti$e A"gorithms2 Acti$e and Ma"icious Attac?ers2 Information hiding in =ritten &e9t. A Sur7e6 o3 Steganogra5hic Techni=ues1 Su-stitution s!stems and 0it *"ane &oo"s2 &ransform Domain &echniEuesG - Spread Spectrum and Information hiding2 Statistica" Steganograph!2 Distortion &echniEues2 Co$er 1eneration &echniEues. Steganal6sis1 ,oo?ing for SignaturesG - E9tracting hidden Information2 Disa-"ing idden Information.
+4
:atermar$ing and Co56right %rotection1 0asic =atermar?ing2 =atermar?ing App"ications2 ;eEuirements and A"gorithmic Design Issues2 E$a"uation and 0enchmar?ing of =atermar?ing s!stem. Trans3orm Methods1 <ourier &ransformation2 <ast <ourier &ransformation2 Discrete Cosine &ransformation2 Me""in-<ourier &ransformation2 =a$e"ets2 Sp"it Images in *erceptua" 0ands. App"ications of &ransformation in Steganograph!. B''8S REC'MMEN#E# 1. 2. 3. 4. #. 8at5end-isser2 *etitco"as2 V Information iding &echniEues for Steganograph! and Digita" =atermar?ingV2 Artech ouse. *eter =a!ner2 VDisappearing Cr!ptograph!G Information iding2 Steganograph! and =atermar?ing 2/eV2 E"se$ier 0o""e2 Conne"" et. a".2 V1uide to 0iometricsV2 Sp ringer
INTER #ISC%I INARY GI#H&IF

CS&*1* C'M%-TER FISI'N /) * * )0
Recognition Methodolog61 Conditioning2 ,a-e"ing2 1rouping2 E9tracting2 Matching. Edge detection2 1radient -ased operators2 Morpho"ogica" operators2 Spatia" operators for edge detection. &hinning2 ;egion gro3ing2 region shrin?ing2 ,a-e"ing of connected components. Binar6 Machine Fision1 &hresho"ding2 Segmentation2 Connected component "a-e"ing2 Spatia" c"ustering2 Sp"it % merge2 ;u"e--ased Segmentation2 Motion--ased segmentation. Area E"traction1 Concepts2 Data-structures2 Edge2 ,ine-,in?ing2 J,east-sEuare fittingK. ierarcha" segmentation2
ough transform2 ,ine fitting2 Cur$e fitting
Region Anal6sis1 ;egion properties2 E9terna" points2 Spatia" moments2 Mi9ed spatia" gra!-"e$e" moments2 0oundar! ana"!sisG Signature properties2 Shape num-ers. Facet Model Recognition1 ,a-e"ing "ines2 :nderstanding "ine dra3ings2 C"assification of shapes -! "a-e"ing of edges2 ;ecognition of shapes2 Consisting "a-e"ing pro-"em2 0ac?-trac?ing2 *erspecti$e *ro@ecti$e geometr!2 In$erse perspecti$e *ro@ection2 *hotogrammetr! > from 2D to 3D2 Image matching G Intensit! matching of ID signa"s2 Matching of 2D image2 ierarchica" image matching. '@2ect Models and Matching1 2D representation2 1"o-a" $s. ,oca" features. .eneral Frame :or$s 3or Matching1 Distance re"ationa" approach2 6rdered- structura" matching2 7ie3 c"ass matching2 and Mode"s data-ase organi5ation. .eneral Frame :or$s1 Distance >re"ationa" approach2 6rdered >Structura" matching2 7ie3 c"ass matching2 Mode"s data-ase organi5ation. 8nowledge Based Fision1 8no3"edge representation2 Contro"-strategies2 Information integration. B''8S REC'MMEN#E# 1. 2. 3. 4. #. Da$id A. <ors!th2 Hean *once2 &Computer $ision' A #odern Approach( ;. Hain2 ;. 8asturi2 and 0. 1. Schun?2 &#achine $ision(2 Mc1ra3- i"". Mi"an Son?a27ac"a$ "a$ac2 ;oger 0o!"e2 BImage Processing, Analysis, and #achine $isionC &homson ,earning ;o-ert ara"ic? and ,inda Shapiro2 &Computer and )o*ot $ision(2 7o" I2 II2 Addison-=es"e!2 1..3. 0a""ard and C.M.0ro3n2 Computer 7ision 2 *rentice a""2 Eng"e3ood C"iffs /) * * )0
CS&*11 S'FT C'M%-TIN.
Arti3icial Neural Networ$s1 0asic concepts - Sing"e "a!er perception - Mu"ti"a!er *erception - Super$ised and :nsuper$ised "earning > 0ac? propagation net3or?s - 8ohnenWs se"f organi5ing net3or?s - opfie"d net3or?.
+#
FuEE6 S6stems1 <u55! sets and <u55! reasoning - <u55! matrices - <u55! functions - Decomposition -<u55! automata and "anguages - <u55! contro" methods - <u55! decision ma?ing. Neuro & FuEE6 Modeling1 Adapti$e net3or?s -ased <u55! interface s!stems - C"assification and ;egression &rees -Data c"ustering a"gorithms - ;u"e -ased structure identification - )euro-<u55! contro"s -Simu"ated annea"ing > E$o"utionar! computation. .enetic Algorithms1 Sur$i$a" of the <ittest - <itness Computations - Cross o$er - Mutation - ;eproduction -;an? method - ;an? space method. So3tcom5uting And Con7entional AI1 AI search a"gorithm - *redicate ca"cu"us - ;u"es of interference > Semantic net3or?s -<rames - 6-@ects - !-rid mode"s - App"ications.
B''8S REC'MMEN#E#
1. 2. 3. 4. #.
Hang H.S.;.2 Sun C.&. and Mi5utani E2 V)euro-<u55! and Soft computingV2 *rentice a"" 1..+. ,aurene <ausett2 V<undamenta"s of )eura" )et3or?sV2 *rentice a""2 1..4. 1eorge H. 8"ir and 0o Duan2 V<u55! sets and <u55! ,ogicV2 *rentice a""2 :SA 1..#. ). H. )e"sson2 VArtificia" Inte""igence - A )e3 S!nthesisV2 arcourt Asia ,td.2 1..+. D.E. 1o"d-erg2 V1enetic A"gorithmsG Search2 6ptimi5ation and Machine ,earningV2 Addison =es"e!2 ).D2 1.+.. /) * * )0
CS&*1+ IMA.E %R'CESSIN. AN# %ATTERN REC'.NITI'N
Fundamentals1 Introduction2 6rigin2 Areas of Image *rocessing2 steps in Digita" Image *rocessing2 Components of Image *rocessing S!stem2 Image Sensing2 Samp"ing and Luanti5ation2 )eigh-oring of *i9e"s2 Mathematica" and perceptua" pre"iminaries2 human $isua" s!stem mode"2 image signa" representation2 imaging s!stem specification -ui"ding image Eua"it!2 ro"e of computers2 image date formats. Image Enhancement and Restoration1 EnhancementG Spatia" <i"tering2 Introduction to <ourier &ransformation2 ;estorationG A mode" of the Image Degradation/ ;estoration *rocess. !ardware architecture 3or image 5rocessing1 Co"or image signa" representation2 co"or s!stem transformations2 e9tension of processing techniEues to co"or domain. :a7elets1 =a$e"et functions2 =a$e"et transformations in one and t3o dimensions2 fast 3a$e"et transform. Image Com5ression1 Image compression mode"s2 Error free compression2 ,oss! compression. Image segmentationG ,ine detection2 Edge Detection2 Edge "in?ing and 0oundar! Detection2 and ;egion--ased segmentation '@2ect Recognition1 *attern and pattern c"asses2 ;ecognition -ased on Decision &heoretic Methods2 Structura" Methods. A55lications o3 Image 5rocessing1 *icture data archi$a"2 machine $ision2 medica" image processing. B''8S REC'MMEN#E# 1. 2. 3. 4. #. *ratt2 =. 8. Digita" Image *rocessing2 Hohn =i"e!2 ). D. Hain2 A.8. fundamenta"s of Digita" Image *rocessing2 Eng"e3ood C"iffs2 *rentice a"" ;osenfie"d2 A and 8a?2 A.C.2 *icture *rocessing2 Academic *ress ). D. Digita" Image *rocessing -! ;afae" C. 1on5a"e52 ;ichard E. =oods Digita" Image *rocessing -! 8enneth ;. Cast"eman
+'

Complete Syllabus Btech 2008-09

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Complete Syllabus Btech 2008-09

Загружено:

Авторское право:

Доступные форматы

Department of Computer Science and Engineering

B. Tech. New Scheme FIRST YEAR 1ST SEMESTER

E"am #uration T % 3 3 3 3 3 3 & 2 2 2 2

Department of Computer Science and Engineering

CS&1*1 C'M%-TER %R'.RAMMIN.

Department of Computer Science and Engineering

Department of Computer Science and Engineering

For ECE #e5tt. 1. CS-20( 2. CS-21(

6-@ect 6riented *rogramming 6-@ect 6riented *rogramming ,a-

Department of Computer Science and Engineering

)R# SEMESTER CS&+*1 #ISCRETE STR-CT-RES /) 1 * ?0

CS&+*) INF'RMATI'N C'#IN. T!E'RY

Department of Computer Science and Engineering

CS&+*( 'BBECT 'RIENTE# %R'.RAMMIN.

Department of Computer Science and Engineering

CS&+*< #ATA STR-CT-RES AN# A .'RIT!MS

Department of Computer Science and Engineering

eap Sort2 Sorting on Different 8e!s2

Department of Computer Science and Engineering

Department of Computer Science and Engineering

Department of Computer Science and Engineering

Department of Computer Science and Engineering

For ECE #e5tt. 1. CS-20' 2. CS-21'

Data Structures and A"gorithms Data Structures and A"gorithm ,a-.

Department of Computer Science and Engineering

?T! SEMESTER CS&+*+ C'M%-TER ARC!ITECT-RE 9 'R.ANIIATI'N /) * * )0

Department of Computer Science and Engineering

EC&+*> MICR'&%R'CESS'R AN# %R'.RAMMIN.

Department of Computer Science and Engineering

CS&+*; #ATA C'MM-NICATI'N

CS&+1* %R'BABI ITY AN# C-E-IN. T!E'RY

Department of Computer Science and Engineering

10. Stud! of ,EQ and DACC.

Department of Computer Science and Engineering

EC&+1> MICR'&%R'CESS'R AN# %R'.RAMMIN. AB'RAT'RY

CS&+++ :EB TEC!N' '.IES

Department of Computer Science and Engineering

CS&++? M- TIME#IA C'MM-NICATI'N

Department of Computer Science and Engineering

Department of Computer Science and Engineering

For ECE #e5tt. CS&+*> #ata Structures and Algorithms G+ * * +H

Department of Computer Science and Engineering

3. 4. #. '. (. +. .. 10. 11. 12. 13.

Department of Computer Science and Engineering

%re re=uisite %re re=uisite -

Course Code CS-001 CS-002 CS-003 CS-32. CS-331

For ECE #e5tt 1. CS-30# 6perating S!stems 3 0 0 3

Department of Computer Science and Engineering

Department of Computer Science and Engineering

Department of Computer Science and Engineering

CS&)*, '%ERATIN. SYSTEMS

CS&)11 C'M%-TER NET:'R8S AB'RAT'RY 1. 2. 3. 4. #. '. (.

Department of Computer Science and Engineering

+. A,6 A *rotoco". .. 10. 11. 12.

Department of Computer Science and Engineering

CS&)1, '%ERATIN. SYSTEMS AB'RAT'RY 1. 2. 3. 4. #. '. (. +. ..

#E%ARTMENTA E ECTIFE G#EH&II CS&)+1 %RINCI% ES 'F %R'.RAMMIN. AN.-A.ES /) 1 * ?0

Department of Computer Science and Engineering

Department of Computer Science and Engineering

Sat5inger2 CS!stem Ana"!sis and DesignC2 Cengage ,earning2 )e3 De"hi

Department of Computer Science and Engineering

CS&)+< SYMB' IC '.IC AN# '.IC %R'.RAMMIN.

CS&))1 C'M%-TER .RA%!ICS AN# ANIMATI'N

Department of Computer Science and Engineering

6-@ect 6riented rogramming 6-@ect 6riented rogramming ,a-

)R# SEMESTER CS&+1 #ISCRETE STR-CT-RES /) 1 ?0

?T! SEMESTER CS&++ C'M%-TER ARC!ITECT-RE 9 'R.ANIIATI'N /) * )0

For ECE #e5tt. CS&+> #ata Structures and Algorithms G+ * +H

For ECE #e5tt CS&), '5erating S6stems G) * )H