Anda di halaman 1dari 81

SCHEME AND SYLLABI FOR EIGHTH SEMESTER

OF

BACHELOR OF TECHNOLOGY IN

COMPUTER SCIENCE AND ENGINEERING


FROM 2009 ADMISSION ONWARDS

CALICUT UNIVERSITY (P.O), THENHIPALAM

Semes e! /III Code CS!" 0!# CS!" 0!% CS!" 0!& CS!" 0!( C&09 (0*(P) C&09 (0-(P) C&09 (0'(P)
Subject

Hours / Week
L T D/P

Marks

Internal &! &! &! &!

Com2uter 7rchitecture and Parallel Processin$ Data minin$ and Warehousin$ Electi.e I4 Electi.e 4 Pro.ect &eminar /i%a 0 /oce To $% To $% M$!-s

( % & &

# # # # ## &

S emes terend '! '! '! '!

Semesterend durationhours & & & &

Credits

* & ( ( ' % & 2,

)2

)1

Code CS!" L!# CS!" L!% CS!" L!& CS!" L!( CS!" L!* CS!" L!+ CS!" L!' CS!" L!0 CS!" L!" CS!" L#! CS!" L## CS!" L#% CS!" L#& CS!" L#( CS!" L#* CS!" L#+ CS!" L#' CS!" L#0 CS!" L#"

E%e& i2e I In-ormation Securit) Com2utational Intelli$ence 8ueuin$ Theor) 5bject 5riented Modelin$ and Desi$n Mana$ement In-ormation S)stems E%e& i2es #o! 0 ' $nd , ' semes e! 7rti-icial eural et3orks Distributed S)stems 9u66) Lo$ic and 722lications S2eech and Lan$ua$e Processin$ 7d.anced To2ics in 52eratin$ S)stems 7d.anced Database Desi$n Di$ital Ima$e Processin$ 4LSI Desi$n In-ormation Theor) and Codin$ Multimedia Web Pro$rammin$ 1ra2h Theor) and Combinatorics Machine Learnin$ So-t Com2utin$

CS!" L%! CS!" L%# CS!" L%% CS!" L%& CS!" L%( CS!" L%* EE!" L%& EE!" L%* ME!" L%( 7 !" L%( EC!" L%* IC!" L%& PE!" L%& CE!" L%( CE!" L%* ,T!" L%(

In-ormation :etrie.al Di$ital Desi$n ;sin$ 4HDL Com2utational 1eometr) Simulation and Modelin$ "G%ob$% E%e& i2e ) #!om CSE( Com2uter ,ased umerical Methods "G%ob$% E%e& i2e 2 #!om CSE( Pattern :eco$nition "G%ob$% E%e& i2e + #!om CSE( G%ob$% E%e& i2es #!om o 'e! de3$! men s Process Control and Instrumentation :obotics < 7utomation Marketin$ Mana$ement Project Mana$ement ,iomedical Instrumentation ,io-In-ormatics Total 8ualit) Mana$ement :emote Sensin$ and 1IS 9inite Element Methods ,io-ethics and Intellectual Pro2ert) :i$hts

CS!" 0!# = Com2uter 7rchitecture and Parallel Processin$


Te$&'in8 s&'eme ( hours lecture and # hour tutorial 2er 3eek C!edi s5 *

Objectives

To teach ideas on parallel computing based computer architectures with a quantitative

approach. To impart concepts in new design paradigms to achieve parallelism memory hierarchy design and inter&connection networks.

Mod4%e I "). 'o4!s( 9undamentals - task o- a com2uter desi$ner - trends in technolo$) usa$e and cost - 2er-ormance measurement - Buantitati.e 2rinci2les o- com2uter desi$n - instruction set architectures - classi-ication addressin$ and o2erations - encodin$ an instruction set - role o- com2ilers - case stud) - the DLN architecture - 2i2elinin$ - 2i2eline -or DLN - 2i2eline ha6ards - data and control ha6ards - im2lementation di--iculties - 2i2elinin$ 3ith multic)cle o2erationsE Mod4%e II ")* 'o4!s( Instruction le.el 2arallelism - conce2ts and challen$es - d)namic schedulin$ -d)namic hard3are 2rediction multi2le issue o- instructions - com2iler and hard3are su22ort -or ILP - .ector 2rocessin$ - .ector architecture A .ector len$th and stride - com2iler .ectori6ation - enhancin$ .ector 2er-ormance Mod4%e III ")0 'o4!s( Memor) hierarch) desi$n - reducin$ cache misses and miss 2enalt)/ reducin$ hit time - main memor) .irtual memor) and its 2rotection - case stud) - 2rotection in the Intel Pentium - crosscuttin$ issues - I/5 s)stems - 2er-ormance measures - reliabilit) and a.ailabilit) - desi$nin$ an I/5 s)stem - case stud) 2er-ormance o- ;ni@ -ile s)stemE Mod4%e I/ ")0 'o4!s( Interconnection net3orks - sim2le net3orks - connectin$ more than t3o com2uters - 2ractical issues multi2rocessors - introduction A a22lication domains - centralised-shared memor) and distributed-shared memor) architectures - s)nchronisation - models o- memor) consistenc)

Text Books
#E Hennes) HELE < Pattersen DE7E/ $omputer Architecture, A Iuantitative approach/ Harcourt

7sia Pte LtdE >Mor$an Gau-man?E Re#e!en&e Boo-s #E CE Pattersen DE7E < Hennes) HELE/ $omputer Drganisation and 5esign, The <ardware.-oftware "nterface/ Harcourt 7sia P.tE LtdE >Mor$an Gau-man? %E H3an$ GE/ Advanced $omputer Architecture, *arallelism -calability and *rogrammability/ Mc1ra3 Hill

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" 0!%= Data Minin$ and Warehousin$


Te$&'in8 s&'eme % hours lecture and # hour tutorial 2er 3eek C!edi s5 &

Objectives

To give only a broad yet in&depth overview of the field of data mining and warehousing a multi& disciplinary field of study.

Mod4%e I ")0 'o4!s( Introduction= 3hat is Data Minin$/ 3hich data/ 3hat kinds o- 2atterns can be mined-Data Warehouse and 5L7P technolo$) -or Data Minin$/Data Warehouse 7rchitectureE Data 2re2rocessin$= data cleanin$/ data inte$ration and trans-ormation/ data reduction/ discreti6ation and conce2t - hierarch) $enerationE Mod4%e II ")0 'o4!s( Data Minin$ Primiti.es/ Lan$ua$es and S)stem 7rchitecturesE - Conce2t Descri2tions= Characteristic and Discriminant rulesE Data 1enerali6ationE - Minin$ 7ssociation :ules in Lar$e Databases - Transactional databasesE Mod4%e III ")0 'o4!s( Conce2t Descri2tions= Characteristic and Discriminant rules/ Data 1enerali6ation/ E@am2le o- decision tables and :ou$h SetsE Classi-ication and 2rediction/ Decision Tree Induction >ID&/ C(E*?/ ,a)esian Classi-icationE Cluster 7nal)sisE 7 Cate$ori6ation o- major Clusterin$ methods Mod4%e I/ "9 'o4!s( Introduction to Data 3arehousin$= eed -or 3arehousin$/ Data 3arehouse 7rchitecture and desi$n/ Hard3are and o2erational desi$n/ Tunin$ and testin$E Trends / De.elo2ments and 722licationsE

Text Books #E HE Han and ME Gamber/ 5ata mining, $oncepts and Techniques/ Else.ier Science/ %!!'E Re#e!en&e Boo-s #E GEPESoman/ Sh)am Di3akar/ and 4E 7ja)/ "nsight into 5ata Mining, Theory and *ractice/ Prentice Hall o- India/ %!!+E %E SE Sumathi/ SE E Si.anandam/ "ntroduction to data mining and its applications %"llustrated Edn)/ S2rin$er Publishers/ %!!+ &E PEMETan/ EStenbach and 4EGumar/ "ntroduction to 5ata Mining/ Pearson Education/ London/ %!!' (E GEMehmed/ 5ata Mining, $oncepts Models Methods and Algorithms/ Hohn Wile) and Sons/ %!!&E *E Paulraj Ponniah/ 5ata Carehousing Fundamentals, A $omprehensive 8uide for "T *rofessional/ Wile) Student Edition/ %!!' +E SE 7nahar) and DE Murra)/ 5ata Carehousing in the +eal Corld ,A *ractical 8uide for 3uilding 5ecision -upport -ystems/ Pearson Education/ %!!!E 'E MEHE Dunham/ 5ata mining, "ntroductory and Advanced Topics/ Pearson Education/ %!!(E

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class No e5 5ne o- the assi$nments shall be simulation o- continuous s)stems usin$ an) technical com2utin$ so-t3are

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" 0!* >P? = Project


Te$&'in8 s&'eme & hours 2ractical 2er 3eek C!edi s5 %

Objectives This 2roject 3ork is the continuation o- the 2roject initiated in se.enth semesterE The 2er-ormance othe students in the 2roject 3ork shall be assessed on a continuous basis b) the 2roject e.aluation committee throu$h 2ro$ress seminars and demonstrations conducted durin$ the semesterE Each 2roject $rou2 should maintain a lo$ book o- acti.ities o- the 2rojectE It should ha.e entries related to the 3ork done/ 2roblems -aced/ solution e.ol.ed etcE There shall be at least an Interim E.aluation and a -inal e.aluation o- the 2roject in the 0th semesterE Each 2roject $rou2 has to submit an interim re2ort in the 2rescribed -ormat -or the interim e.aluationE Each 2roject $rou2 should com2lete the 2roject 3ork in the 0th semesterE Each student is e@2ected to 2re2are a re2ort in the 2rescribed -ormat/ based on the 2roject 3orkE Members o- the $rou2 3ill 2resent the rele.ance/ desi$n/ im2lementation/ and results o- the 2roject be-ore the 2roject e.aluation committee com2risin$ o- the $uide/ and three/-our -acult) members s2ecialised in com2uter science and en$ineerin$E

*!I o- the marks is to be a3arded b) the $uide and *!I b) the e.aluation committeeE

In e!n$% Con in4o4s Assessmen (!I - Desi$n and de.elo2ment/Simulation and anal)sis &!I - Presentation < demonstration o- results %!I - :e2ort #!I - :e$ularit) in the class

CS!" 0!+ >P? = Seminar


Te$&'in8 s&'eme & hours 2ractical 2er 3eek C!edi s5 %

Objectives To assess the ability of the student to study and present a seminar on a topic of current relevance in computer science engineering or allied areas

It enables the students to $ain kno3led$e in an) o- the technicall) rele.ant current to2ics and acBuire the con-idence in 2resentin$ the to2icE The student 3ill undertake a detailed stud) on the chosen to2ic under the su2er.ision o- a -acult) member/ b) re-errin$ 2a2ers 2ublished in re2uted journals and con-erencesE Each student has to submit a seminar re2ort/ based on these 2a2ersM the re2ort must not be re2roduction o- an) ori$inal 2a2erE 7 committee consistin$ o- three/-our -acult) members 3ill e.aluate the seminarE

In e!n$% Con in4o4s Assessmen %!I - :ele.ance o- the to2ic and literature sur.e) *!I - Presentation and discussion %!I - :e2ort #!I - :e$ularit) in the class and Partici2ation in the seminar

CS!" 0!' >P? = 4i.a 4oce


C!edi s5 &

Objectives To examine the knowledge acquired by the student during the 3.Tech. course through an oral examination The students shall 2re2are -or the oral e@amination based on the theor) and laborator) subjects studied in the ,ETechE Course/ mini 2roject/ seminar/ and 2rojectE There is onl) uni.ersit) e@amination -or .i.a-.oceE ;ni.ersit) 3ill a22oint t3o e@ternal e@aminers and an internal e@aminer -or .i.a-.oceE These e@aminers shall be senior -acult) members ha.in$ minimum -i.e )ears teachin$ e@2erience at en$ineerin$ de$ree le.elE 9or -inal .i.a-.oce/ candidates should 2roduce certi-ied re2orts o- mini 2roject/ seminar/ and 2roject >t3o interim re2orts and main re2ort?E I- he/she has under$one industrial trainin$/industrial .isit/educational tour or 2resented a 2a2er in an) con-erence/ the certi-ied re2ort/technical 2a2er shall also be brou$ht -or the .i.a-.oceE 7llotment o- marks -or .i.a-.oce shall be as $i.en belo3E

Assessmen in /i2$92o&e (!I - Subjects &!I - Project and Mini Project %!I - Seminar #!I - Industrial trainin$/industrial .isit/educational tour or Pa2er 2resented at ational-le.el

CS!" L!# = In-ormation Securit)


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To teach the fundamentals of information security which deals with protecting information and information systems from unauthoriBed access use disclosure disruption modification or destruction. To teach the various threats to storage of secure information.

Mod4%e I ")* 'o4!s( Introduction A basics o- cr)2to$ra2h) A re.ie3 o- cr)2to$ra2h) A s)mmetric cr)2to$ra2h)/ stream ci2hers/ block ci2hers/ inte$rit) A 2ublic ke) cr)2to$ra2h)/ kna2sack/ :S7/ Di--ie-Helman A hash -unctions A Linear and di--erential cr)2toanal)sisE Mod4%e II ")2 'o4!s( 7uthentication A Methods o- authentication A Pass3ords A ,iometrics A T3o--actor authentication A Sin$le si$n-in A 3eb cookies A 7uthori6ation A 7ccess control matri@ A Multile.el securit) models A Multilateral securit) A co.ert channel A in-erence control A C7PTCH7 A 9ire3alls A Intrusion detectionE Mod4%e III ")) 'o4!s( Sim2le securit) 2rotocols A authentication 2rotocols A 7uthentication and TCP A Cero kno3led$e 2rotocols A secure socket la)er A IPSec A Gerberos A 1SME Mod4%e I/ ")1 'o4!s( So-t3are 9la3s A Mal3are A so-t3are based attacks A so-t3are reco.er) en$ineerin$ A so-t3are tam2er resistance A di$ital ri$hts mana$ement A so-t3are de.elo2ment A o2eratin$ s)stem securit) -unctions A trusted o2eratin$ s)stems A ne@t $eneration secure com2utin$ baseE

Text Books
#E Mark Stam2/ "nformation -ecurity , *rinciples and *ractice/ Wile) India P.tE Ltd/ %!!+E

Re#e!en&e Boo-s #E 1ur2reet Dhillon/ *rinciples of "nformation -ystems -ecurity, text and casesE P= Hohn Wile) < Sons/ %!!'E %E Chris Mc abE >etwork -ecurity AssessmentE Sebasto2ol/ C7= 5K:eill)/ %!!(E &E ,ruice Schneier/ 722lied Cr)2to$ra2h)/ Wile) India P.tE Ltd/ %!!+E (E Timoth) La)ton P/ "nformation -ecurity, 5esign "mplementation Measurement and $omplianceE ,oca :aton/ 9L= 7uerbach 2ublications/ %!!'E *E Thomas : PeltierE/ "nformation -ecurity *olicies *rocedures and -tandards, guidelines for effective information security managementE ,oca :aton/ 9L= 7uerbach 2ublications/ %!!%E

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L!% = Com2utational Intelli$ence


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives To teach how to create cognitive systems that could compete with humans in large number of areas. To teach fundamental heuristic algorithms such as those found in fuzzy systems, neural networks and evolutionary computation

Mod4%e I ")+ 'o4!s( :ecursion and Mathematical Induction - 4eri-ication and Limitations - 4eri-ication o- Lo$ic Pro$rams Limitations - 722lications in atural Lan$ua$e Processin$ - ;sin$ De-inite Clauses -or Conte@t-9ree 1rammars - 7u$mentin$ the 1rammar - ,uildin$ Structures -or onterminals - Canned Te@t 5ut2ut En-orcin$ Constraints - ,uildin$ a atural Lan$ua$e Inter-ace to a Database Mod4%e II ")1 'o4!s( Searchin$ - 1ra2h Searchin$ - ,lind Search Strate$ies - Heuristic Search - :e-inements to Search Strate$ies/ C)cle Checkin$ - Multi2le-Path Prunin$/ Iterati.e Dee2enin$/ Direction o- Search/ ,idirectional Search/ Island-Dri.en Search/ Searchin$ in a Hierarch) o- 7bstractions - D)namic Pro$rammin$ - Constraint Satis-action Problems - :e2resentin$ Gno3led$e - Choosin$ a :e2resentation Lan$ua$e - Ma22in$ -rom Problem to :e2resentation - In-erence Procedure - Gno3led$e En$ineerin$ / Introduction - Gno3led$e,ased S)stem 7rchitecture - Meta-Inter2reters - 8uer)in$ the ;ser - Debu$$in$ Gno3led$e ,ases - MetaInter2reter 3ith Search A ;ni-ication Mod4%e III ")2 'o4!s( EBualit) - Inte$rit) Constraints - Com2lete Gno3led$e 7ssum2tion - Disjuncti.e Gno3led$e - E@2licit 8uanti-ication - 9irst-5rder Predicate Calculus - Modal Lo$ic - 7ctions and Plannin$ - :e2resentin$ Time/ :elations/ 7ctions/ Chan$e - :easonin$ 3ith World :e2resentations - 7ssum2tion-,ased :easonin$ 9rame3ork - De-ault :easonin$ - De-ault Prediction - 7bduction - E.idential and Causal :easonin$ 7l$orithms -or 7ssum2tion-,ased :easonin$ Mod4%e I/ ")+ 'o4!s( ;sin$ ;ncertain Gno3led$e - :andom 4ariables - Probabilit) - In-ormation Theor) - Inde2endence 7ssum2tions - ,elie- et3orks - :easonin$ in a ,elie- et3ork - Im2lementin$ ,elie- et3orks - Makin$ Decisions ;nder ;ncertaint) - Decision 4ariables - Decision et3orks - The 4alue o- In-ormation Learnin$ - Issues - Learnin$ Decision Trees - Searchin$ -or a 1ood Decision Tree - eural et3orks Case-,ased :easonin$ - Learnin$ as :e-inin$ the H)2othesis S2ace - Learnin$ ;nder ;ncertaint) E@2lanation-,ased Learnin$ - ,uildin$ Situated :obots - The 7$ent 9unction - :obot 7rchitectures Im2lementin$ a Controller - :easonin$ in Situated :obots Text Books
#E :ussel Ebenhart/ Puhui Shi/ $omputational "ntelligence G $oncepts to "mplementations

Mor$ran Gau-mann Publishers/ %!!"E Re#e!en&e Boo-s #E 7EPE En$elbrecht/ $omputational "ntelligence , An "ntroduction Hohn Wile)/ %!!& %E 7E Gonar/ $omputational "ntelligence , *rinciples Techniques and Applications/ S2rin$er %!!*E &E 7E Gusiak/ Com2utational Intelli$ence in 5esign and Manufacturing/ Wile)-Interscience/ %!!!E (E DE Lind/ ,E Marcus/ -ymbolic 5ynamics and $oding/ Cambrid$e ;ni.ersit) Press/ #""*E

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L!&= 8ueuin$ Theor)


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To teach the fundamental queueing models and the various parameters involved with performance of the individual disciplines.

Mod4%e I ")1 'o4!s( Descri2tion o- the 8ueuein$ 2roblem - Characteristics o- 8ueuein$ 2rocesses - otation - Measurin$ S)stem Per-ormance - Some 1eneral :esults - Sim2le ,ookkee2in$ -or 8ueues - Poisson 2rocess and the E@2onential Distribution - Marko.ian 2ro2ert) o- the E@2onential Distribution - Stochastic Processes and Marko. Chains - Stead)-state ,irth-Death Processes - Sim2le Marko.ian ,irth-Death 8ueuein$ Models Mod4%e II ")* 'o4!s( Stead)-state solution -or the M/M/# Model - Methods o- Sol.in$ Stead)-state Di--erence EBuations 8ueues 3ith 2arallel channels >M/M/c? - 8ueues 3ith Parallel Channels and Truncation >M/M/c/G? Erlan$Ks 9ormula >M/M/c/c? - 8ueues 3ith ;nlimited Ser.ice - 8ueues 3ith Im2atience - Transient ,eha.iour - ,us)-Period anal)ses -or M/M/# and M/M/c - ,ulk in2ut >MR@S/M/#? - ,ulk Ser.ice >M/MRPS/#? - Erlan$Ks Models >M/Ek/#/ Ek/M/#/ Ej/Ek/#? - Priorit) 8ueue disci2lines Mod4%e III ")2 'o4!s( Series 8ueues - 52en Hackson et3orks - Closed Hackson et3orks - C)clic 8ueues - E@tensions oHackson et3orks - on-Hackson et3orks - Sin$le-ser.er 8ueues 3ith Poisson In2ut and 1eneral Ser.ice >M/1/#? - Multi ser.er 8ueues 3ith Poisson in2ut and 1eneral Ser.ice - 1eneral In2ut and E@2onential ser.ice Mod4%e I/ ")+ 'o4!s( 1/Ek/#/ 1>k?/M/# and 1/PHk/# - 1eneral In2ut/ 1eneral Ser.ice >1/1/#? - Multichannel 8ueues 3ith Poisson in2ut and Constant Ser.ice >M/D/c? - Semi-Marko. and Marko. :ene3al Processes in 8ueuein$ 5ther 8ueuein$ Disci2lines - Desi$n and Control o- 8ueues - Statistical In-erence in 8ueuein$ - ,ounds/ 722ro@imations/ umerical TechniBues and SimulationE - ,ounds and IneBualitites - 722ro@imations umerical TechniBues - Discrete-E.ent Stochastic Simulation ProblemsE Text Books
#E Donald 1ross < Carl M Harris/ Fundamentals of Iueuing Theory 'rd edition/ Wile) India/

#""'E Re#e!en&e Boo-s #E Tri.edi G S/ *robability and -tatistics with +eliability Iueueing and $omputer -cience Applications/ Prentice Hall o- India/ #"0(E %E 7llen 7 5/ Probabilit)/ -tatistics and Iueueing Theory/ 7cademic Press/ #"0#E &E ,ala$urus3am) E/ +eliability Engineering / Tata Mc1ra3 Hill Publishers/ e3 Delhi/ #"0(E (E Sanja) G ,ose/ An "ntroduction to Iueueing -ystems/ Gul3er 7cademic Plenum PublishersE

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L!( = 5bject 5riented Modellin$ and Desi$n


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To impart ideas on building systems through the ob:ect oriented modelling approach using the @nified Modelling #anguage.

Mod4%e I ")1 'o4!s( Introduction to ;ML and ;ni-ied Process - ;se case modelin$= 7ctors and ;se cases/ ;se case s2eci-ication/ 7ctor $enerali6ation/ ;se case $enerali6ation - 5bjects and classes/ :elationshi2s/ Inheritance and Pol)mor2hism/ Packa$esE Mod4%e II ")1 'o4!s( ;se case reali6ation= Interactions/ SeBuence dia$rams/ Communication dia$rams/ Interaction occurrencesE 7cti.it) dia$rams= 7cti.it) semantics/ acti.it) 2artitions/ Sendin$ si$nals and acce2tin$ e.ents/ Interaction o.er.ie3 dia$ramsE Mod4%e III ")+ 'o4!s( Desi$n= Desi$n 3ork-lo3/ 3ell--ormed desi$n classes/ :e-inin$ anal)sis relationshi2sE Inter-aces and com2onents - State machine dia$rams/ Com2osite states/ submachine states Mod4%e I/ ")+ 'o4!s( Im2lementation 3ork-lo3/ De2lo)ment/ Introduction to 5CL= Wh) 5CLT 5CL e@2ression s)nta@/ T)2es o5CL e@2ressionsE Introduction to So-t3are 7rchitecture/ 7rchitecture descri2tion lan$ua$e >7DL?

#E Him 7rlo3 and Ila

Text Books eustadt/ @M# 0 and the @nified *rocess, *ractical Db:ect oriented Analysis and 5esign -econd Edition/ Pearson EducationE

Re#e!en&e Boo-s #E Crai$ Larman/ Applying @M# and *atterns 'rd Edition Pearson EducationE %E 1rad) ,ooch/ Hames:ambau$h/I.ar Hacobson E7EW / The @nified Modeling #anguage @ser 8uide &E ,rue$$e/ Db:ect Driented -oftware Engineering using @M# patterns and Hava/ Pearson Education (E Hames :ambau$h etE alE/ Db:ect Driented Modelling and 5esign/ Prentice Hall India *E I.ar Hacobson/ 1rad) ,ooch/ Hames :ambau$h 7EW/ The @nified -oftware 5evelopment *rocessE +E DeLillo/ Db:ect Driented 5esign in $==/ Thomson Learnin$

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L!* = Mana$ement In-ormation S)stems


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To introduce the methods and the influence of the information systems in management

milieu
To enable the students to use M"- as an effective tool in management and decision making Mod4%e I ")1 'o4!s( Information Systems-functions of management-le,els of management-framework for information systems-systems approach-systems concepts-systems and their en,ironment-effects of systems approach in information systems design-using systems approach in problem sol,ing - strategic uses of information technology0 Mod4%e II ")1 'o4!s( Computer 1undamentals2 "elecommunication and &etworks - Communication2 /edia2 /odems Channels - 3A&2 /A& 4A& - &etwork "opologies2 Internet2 Intranet and E%tranet0 4ireless technologies like 4i-1i2 5luetooth and 4i-/a%0 Mod4%e III ")0 'o4!s( 'inds of Information Systems - "ransaction !rocessing System 6"!S7 - 8ffice Automation System 68AS7 - /anagement Information System 6/IS7 - Decision Support System 6DSS7 and -roup Decision Support System 6-DSS7 - E%pert System 6ES7 E%ecuti,e Support System 6EIS or ESS70 Mod4%e I/ ")1 'o4!s( Information systems planning - critical success factor - business system planning ends.means analysis - organi9ing the information systems plan - system analysis and design - alternati,e application de,elopment approaches - organi9ation of data processing - security and ethical issues of information systems0

Re#e!en&e Boo-s #E Schultheis #0

/ary Summer2 Management Information Systems !he

Manager"s #iew2 "ata /c-raw $ill0


%E 'enneth : 3audon2 :ane !03audon2 Management Information Systems

Organization and !echnology2 !earson.!$I2;*.e2 <**=


&E 40 S0 :awadekar2 Management Information Systems, "ata /c-raw $ill

Edition2 >.e2 <**?0

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L!+ = 7rti-icial eural et3orks


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives To teach the fundamental building blocks of >eural networks and to promote their widespread use in the current day scientific research environment.

Mod4%e I ")1 'o4!s( Introduction A Historical de.elo2ment A ,iolo$ical net3orks A Com2arison A et3ork architecture A 7cti.ation -unction A Learnin$ methods A McCullo$h Pitts euron Model A architecture A Learnin$ rules A Hebbian learnin$ rules A Perce2tron Learnin$ rule A Delta learnin$ rule A Com2etiti.e A 5ut star rule A ,oltsman learnin$ A Memor) based learnin$E Mod4%e II ")1 'o4!s( 9eed-or3ard net3orks A Introduction A Sin$le la)er 2erce2tron architecture A Perce2tron al$orithm -or se.eral in2ut classes A Perce2tron con.er$ence theorem A Multila)er 2erce2tron net3orks A ,ack2ro2a$ation net3orks A 1eneralised delta learnin$ rule A back2ro2a$ation rule A 7rchitecture and trainin$ A Learnin$ in back2ro2o$ation A Local minima and $lobal minima A merits and demerits o- back 2ro2o$ation net3orks A :adial ,asis 9unction >:,9? et3orks A 7l$orithm -or an :,9 3ith -i@ed centres A 7daline and Madaline net3orks Mod4%e III ")+ 'o4!s( Counter 2ro2a$ation net3orks A Winner take-all learnin$ A out star learnin$ A Gohonen sel- or$ani6in$ net3ork A 9ull counter 2ro2a$ation net3orks A Trainin$ 2hases A 9or3ard onl) counter 2ro2a$ation net3ork A Learnin$ 4ector 8uanti6er Mod4%e I/ ")+ 'o4!s( 7ssociati.e memor) A Continuous and Discrete Ho2-ield net3orks A Ener$) anal)sis A Stora$e and retrie.al al$orithm A ,olt6man machine A ,idirectional 7ssociati.e memor) A 7da2ti.e :esonance Theor) net3orks A 722lications o- eural net3orks A Sol.in$ o2timi6ation 2roblems A Sol.in$ Linear EBuations A Sol.in$ Tra.ellin$ Salesman Problem A 722lications in Pattern :eco$nition/ Ima$e Processin$E Text Books Shi.anandam/ S Sumati/ S Dee2a/ "ntroduction to >eural >etworks using MAT#A3 Tata Mc1ra3 HillE %E HEME Curada/ "ntroduction to Artificial >eural >etworks 'rd edition Haico PublishersE
#E S

Re#e!en&e Boo-s #E Gishan Mehrotra/ Chelkuri G Mohan/ Sanja) :anka/ Elements of Artificial >eural >etworks Penram InternationalE %E Simon Ha)kin/ Artificial >eural >etwork Pearson EducationE &E Laurene 9ausett/ 9undamentals o- eural et3orks/ %nd edition/ Pearson EducationE (E ,E Pen$anara)ana/ Artificial >eural >etworks Prentice Hall IndiaE

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L!' = Distributed S)stems


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To impart basic knowledge of the issues concerning distributed systems from both software and hardware viewpoints.

Mod4%e I ")0 'o4!s( 52eratin$ s)stem -undamentals - distributed s)stem conce2ts and architectures - major desi$n issues distributed com2utin$ en.ironments >DCE?E Mod4%e II ")+ 'o4!s( Concurrent 2rocesses and 2ro$rammin$ - threads and 2rocesses - client ser.er model - time ser.ices lan$ua$e mechanisms -or s)nchroni6ation - concurrent 2ro$rammin$ lan$ua$esE Mod4%e III ")+ 'o4!s( Inter-2rocess communication and coordination - messa$e 2assin$ communication - reBuest/re2l) communication - transaction communication -name and director) ser.ices - distributed mutual e@clusion leader electionE Mod4%e I/ ")+ 'o4!s( Distributed 2rocess schedulin$ - static 2rocess schedulin$/ d)namic load sharin$ and balancin$ - distributed 2rocess im2lementation - real-time schedulin$ - conce2ts o- distributed -ile s)stems - distributed shared memor) - distributed com2uter securit)E

Text Books #E Cho3 :E < Hohnson T/ 5istributed Dperating -ystems and Algorithms/ 7ddison Wesle)E Re#e!en&e Boo-s #E Sinha PEGE/ 5istributed Dperating -ystems $oncepts and 5esign/ PHI %E Tanenbaum SE/ 5istributed Dperating -ystems/ Pearson EducationE &E Coulouris 1/ Dollimore HE < Gindber$ TE/ 5istributed-ystems $oncepts and 5esign/ 7ddison Wesle) (E Sin$hal ME < Shi.aratri/ Advanced $oncepts in Dperating -ystems 5istributed 5atabases And Multiprocessor Dperating -ystems/ Mc1ra3 HillE

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L!0 = 9u66) Lo$ic and 722lications


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To impart the basic concepts of fuBBy set theory. To understand the applications of fuBBy logic in various fields.

Mod4%e I ")1 'o4!s( Cris2 sets and -u66) sets A introduction A cris2 sets an o.er.ie3 A the notion o- -u66) sets A basic conce2ts o- -u66) sets A classical lo$ic an o.er.ie3 A -u66) lo$icE 52erations on -u66) sets A -u66) com2lement A -u66) union A -u66) intersection A combinations o- o2erations A $eneral a$$re$ation o2erationsE Mod4%e II ")1 'o4!s( 9u66) relations A cris2 and -u66) relations A binar) relations A binar) relations on a sin$le setA eBui.alence and similarit) relations A com2atibilit) or tolerance relations A orderin$s A membershi2 -unctions A methods o- $eneration A de-u66i-ication methodsE Mod4%e III ")+ 'o4!s( 9u66) measures A $eneral discussion A belie- and 2lausibilit) measures A 2robabilit) measures A 2ossibilit) and necessit) measures A relationshi2s amon$ classes o- -u66) measuresE Mod4%e I/ ")+ 'o4!s( 9u66) Lo$ic and 722lications A a22lications o- -u66) lo$ic A 9u66) Controllers >o.er.ie3 < an e@am2le? A -u66) s)stems and neural net3orks A -u66) eural net3orksE 9u66) Clusterin$ A -u66) 2attern reco$nition A -u66) Ima$e Processin$ A -u66) databases A -u66) in-ormation retrie.alE Text Books #E 1EHE Glir and TE7E 9ol$er/ FuBBy sets @ncertainty and "nformation/ Prentice Hall o- India/ #""0E %E TEHE :oss/ FuBBy #ogic with Engineering applications/ Mc1ra3 Hill IntE Ed Re#e!en&e Boo-s #E HEHE Cimmerman/ FuBBy set theory and its Applications 4th Ed./ Glu3er 7cademic Publishers/ %!!#E %E 1EHE Glir and ,EPuan/ FuBBy sets and fuBBy logic, Theory and Applications / Prentice Hall oIndia/ #""'E &E HE $u)en and EEWalker/ A first course in FuBBy logic 0nd Ed./ Cha2man and Hall/C:C/ #"""E (E HE Pen and :E Len$ari/ FuBBy #ogic, "ntelligence $ontrol and "nformation/ Pearson Education/ #"""E In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L!" = S2eech and Lan$ua$e Processin$


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To teach the fundamental concepts in speech processing and natural language processing through which human&computer dialog systems may be developed. -$rams/ Part-o--S2eech

Mod4%e I ")+ 'o4!s( Introduction= Words/ :e$ular E@2ressions and 7utomata/ Words and Transducers/ Ta$$in$/ Hidden Marko. and ma@imum Entro2) Models

Mod4%e II ")+ 'o4!s( S2eech= Phonetics/ S2eech S)nthesis/ 7utomatic S2eech/ :eco$nition/ S2eech :eco$nition = 7d.anced To2ics/ Com2utational Phonolo$) Mod4%e III ")+ 'o4!s( S)nta@= 9ormal 1rammars o- En$lish/ S)ntactic Parsin$/ Statistical Parsin$/ 9eatures and ;ni-ication/ Lan$ua$e and Com2le@it) Mod4%e I/ ")+ 'o4!s( Semantics and Pra$matics= The :e2resentation o- Meanin$/ Com2utational Semantics/ Le@ical Semantics/ Com2utational Le@ical Semantics/ Com2utational Discourse 722lications = In-ormation E@traction/ 8uestion 7ns3erin$ and Summari6ation/ Dialo$ and Con.ersational 7$ents/ Machine Translation Text Books
#E Daniel Hura-sk) and Hames HE Martin/ -peech and #anguage *rocessing , An "ntroduction to

>atural #anguage *rocessing/ Com2utational Lin$uistics/ and S2eech :eco$nition >Second Edition?/ Prentice Hall/ %!!" Re#e!en&e Boo-s #E CEDEMannin$ and HE Schut6e/ Foundations of -tatistical >atural #anguage *rocessing/ MIT Press/ London/ %!!#E %E Hames 7llen/ >atural #anguage @nderstanding/ %nd Edn/ ,enjamin/Cummin$s PubE CoE/ #""(E

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L#! = 7d.anced To2ics in 52eratin$ S)stems


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To teach advanced concepts related to operating systems including various categories and the complex algorithms in their management functions.

Mod4%e I ")1 'o4!s( Introduction A 9unctions A Desi$n a22roaches A T)2es o- ad.anced o2eratin$ s)stems A S)nchroni6ation mechanisms A conce2t o- a 2rocess A threads A critical section 2roblems A s)nchroni6ation 2roblemsE Mod4%e II ")1 'o4!s( 7rchitecture A mutual e@eclusion A deadlock detection A resource mana$ement A -ile s)stems A shared memor) A schedulin$ A -ailure reco.er) A -ault toleranceE Mod4%e III ")+ 'o4!s( Multi2rocessor s)stem architecture A intercommunication net3orks A cachin$ A h)2ercube architectures A structure o- multi2rocessor o2eratin$ s)stem A desi$n issues A threads A 2rocess s)nchroni6ation A 2rocessor schedulin$ A memor) mana$ement A reliabilit) A -ault tolerance Mod4%e I/ ")+ 'o4!s( Introduction to database o2eratin$ s)tesms and realtime o2eratin$ s)stems A concurrenc) control A distribted database s)stems A concurrenc) control A distributed database s)stems A concurrenc) control al$orithms A basic s)nchroni6ation 2rimiti.es A lock based A time stam2 basedE Text Books #E Mukesh Sin$al/ Advanced Topics in Dperating -ystems/ Tata Mc1ra3 HillE Re#e!en&e Boo-s #E utt 1EH/ Dperating -ystems G A Modern *erspective/ 7ddison Wesle)E %E Schilberschat6 < 1al.in/ Dperating -ystem $oncepts/ 7ddison Wesle)E &E Tanenbaum 7ESE/ Modern Dperating -ystems/ Pearson EducationE

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L## = 7d.anced Database Desi$n


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives To impart knowledge on the advancements in database management systems. This covers ideas on the latest methodologies such as ob:ect oriented distributed and deductive database systems along with comparisons and some case studies. to enable the student to analyBe design and implement modern database systems especially for a distributed environment..

Mod4%e I ")) 'o4!s( 5.er.ie3 o- relational database conce2t - object oriented database - o.er.ie3 o- object oriented conce2ts object de-inition lan$ua$e - object Buer) lan$ua$es - object database conce2tional desi$n A 5bject relational and e@tended relational s)stemsE Mod4%e II ")+ 'o4!s( Distributed database conce2ts - data -ra$mentation re2lication and allocation - t)2es o- distributed database s)stem - Buer) 2rocess - concurrenc) control -or distributed database - o.er.ie3 o- client - ser.er architecture and its relationshi2 to distributed database Mod4%e III ")+ 'o4!s( Deducti.e database - introduction to deduction database 2rolo$/datalo$ notation - inter2retation o- rules basic in-erence mechanism -or lo$ic 2ro$rams - datalo$ 2ro$rams and their e.aluation - deduction database s)stems - data Warehousin$ and data minin$ - database on World Wide Web - multimedia database - mobile database - $eo$ra2hic in-ormation s)stem - di$ital libraries Mod4%e I/ ")* 'o4!s( 5racle and microso-t access - basic structure o- the oracle s)stem - database structures and its mani2ulation in oracle - stora$e or$ani6ation 2ro$rammin$ oracle a22lications - oracle tools - an o.er.ie3 o- Microso-t access -eatures and -unctionalit) o- access - distributed databases in oracle Text Books a.athe/ Fundamentals of 5atabase -ystems/ Pearson Education/ -ourth editionE

#E Elmasri <

Re#e!en&e Boo-s #E :amakrishnan :E < 1ehrke HE/ 5atabase Management -ystems/ Mc1ra3 Hill %E 5Kneil PE < 5Kneil EE/ 5atabase *rinciples *rogramming And *erformance/ Harcourt 7sia >Mor$an Gau-man? &E Silberschat6/ Gorth HE9E < Sudarshan SE/ 5atabase -ystem $oncepts/ Tata Mc1ra3 Hill (E Theor) TEHE/ 5atabase Modelling And 5esign/ Harcourt 7sia >Mor$an Gau-man?

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L#% = Di$ital Ima$e Processin$


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To impart the introductory concepts of image processing To understand all the elements of image processing beginning from formation and digitiBation to enhancement restoration edge detection segmentation and compression .

Mod4%e I ")* 'o4!s( Introduction - di$ital ima$e re2resentation - -undamental ste2s in ima$e 2rocessin$ - elements o- di$ital ima$e 2rocessin$ s)stems - di$ital ima$e -undamentals - elements o- .isual 2erce2tion - a sim2le ima$e model - sam2lin$ and Buanti6ation - basic relationshi2 bet3een 2i@els - ima$e $eometr) - ima$e trans-orms - introduction to 9ourier trans-orm - discrete 9ourier trans-orm >D9T? - 2ro2erties D9T- other se2arable ima$e trans-orms - Walsh/ Hadamard and Discrete Cosine trans-ormsE Hotellin$ trans-ormE Mod4%e II ")2 'o4!s( Ima$e enhancement - basic $re) le.el trans-ormation - histo$ram eBuali6ation - ima$e subtraction - Ima$e a.era$in$ s2atial -ilterin$ - smoothin$/ shar2enin$ -ilters - La2lacian -iltersE Enhancement in the -reBuenc) domain - -reBuenc) domain -ilters - smoothin$/ shar2enin$ -ilters - homomor2hic -ilterin$E Mod4%e III ")2 'o4!s( Ima$e restoration - model o- Ima$e de$radation/restoration 2rocess - noise models - in.erse -ilterin$ - least mean sBuare -ilterin$ - constrained least mean sBuare -ilterin$E Ed$e detection - thresholdin$ - re$ion based se$mentation ,oundar) re2resentation Mod4%e I/ ")+ 'o4!s( Ima$e com2ression - -undamental conce2ts o- ima$e com2ression - com2ression models - in-ormation theoretic 2ers2ecti.eE Lossless com2ression - Hu--man codin$ - arithmetic codin$ - bit 2lane codin$ - run len$th codin$E Loss) com2ression - trans-orm codin$ - Ima$e com2ression standardsE

Text Books
#E :ECE 1on6ale6 and :EEE Woods/ 5igital "mage *rocessing & 0nd ed./ Prentice Hall o- India/

e3

DelhiE Re#e!en&e Boo-s #E ,E Chanda and DEDE Majumder/ 5igital "mage *rocessing and Analysis/ PHI %E 7EGE Hain/ Fundamentals of 5igital "mage *rocessing/ PHI &E WEGE Pratt/ 5igital "mage *rocessing/ Hohn Wile)/ %!!+ (E ME Sonka/ 4E Hla.ac and :E ,o)le/ "mage *rocessing Analysis and Machine 7ision/ ,rooks/colic/ Thom2son Learnin$/ #"""E

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L#& = 4LSI Desi$n


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To impart the required skills to the students in design of 7#-" components.

Mod4%e I ")1 'o4!s( Introduction to M5S technolo$) - IC technolo$) - M5S and 4LSI - M5S and QCM5S -abrication thermal as2ects - M5S circuits tub ties and latch u2 - 3ire 2arasitic - desi$n rules and la)outs - multila)er CM5S 2rocess - la)out dia$rams stick dia$rams - hierarchical stick dia$rams - la)out desi$n anal)sis toolsE Mod4%e II ")1 'o4!s( Lo$ic $ates - re.ie3 o- combinational lo$ic circuits - basic $ate la)outs A dela) - 2o3er Consum2tion s2eed 2o3er 2roduct - 3ires and dela) A combinational lo$ic net3orks - la)out desi$n methods -net3ork dela) - cross talk A 2o3er o2timi6ation - s3itch lo$ic net3orksE Mod4%e III ")2 'o4!s( SeBuential machines - latches and -li2 -lo2s - seBuential s)stem desi$n -subs)stem desi$n - 2i2elinin$ - data 2aths - adders - 7L; - :5M - :7M -9P17 - PL7 A multi2liersE Mod4%e I/ ")2 'o4!s( 9loor 2lannin$ - methods - -loor 2lan o- a ( bit 2rocessor - o-- chi2 connections Aarchitecture desi$n re$ister trans-er desi$n - architecture -or lo3 2o3er - architecture testin$ - cad s)stems and al$orithms simulation - la)out s)nthesisE

#E

Text Books eil HE EE Weste/ Gamran Eshra$hian/ *rinciples of $MD- 7#-" 5esign/ 7ddison Wesle)E

Re#e!en&e Boo-s #E CE Puck ell DE 7E < Eshra$hian GE/ 3asic 7#-" 5esign & -ystems and $ircuits %E Mead C/ Con3a) LE/ "ntroduction to 7#-" -ystem/ 7ddison Wesle) &E Wa)ne Wol-/ Modern 7#-" 5esign/ Phi2eE

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L#( = In-ormation Theor) and Codin$


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To teach the fundamentals of information quality error control in communication process and various systems of coding information for reliable communications.

Mod4%e I ")1 'o4!s( In-ormation theor) - in-ormation and entro2) - 2ro2erties o- entro2) o- a binar) memor) less source e@tension o- a discrete memor) less source -source codin$ theorem - Shannon-9ano codin$ - Hu--man codin$ - Lem2el Ci. codin$ - discrete memor) less source - binar) s)mmetric channel - mutual in-ormation 2ro2erties - channel ca2acit) - channel codin$ theorem -in-ormation ca2acit) theoremE Mod4%e II ")1 'o4!s( Codin$ - linear block codes - $enerator matrices - 2arit) check matrices - encoder-s)ndrome and error detection - minimum distance - error correction and error detection ca2abilities - c)clic codes - codin$ and decodin$E Mod4%e III ")+ 'o4!s( Introduction to al$ebra - $rou2s - -ields - binar) -ield arithmetic - construction o- $alois -ield - basic 2ro2erties - com2utations - .ector s2aces - matrices - ,CH codes - descri2tion - decodin$ - reed **eneral codes Mod4%e I/ ")+ 'o4!s( Codin$ - con.olutional codes - encoder - $enerator matri@ - trans-orm domain re2resentation - state dia$ram - distance 2ro2erties - ma@imum likelihood decodin$ - 4iterbi decodin$ - seBuential decodin$ - interlea.ed con.olutional codesE Text Books

#E Simon Ha)kin/ $ommunication -ystems/ Hohn Wile) %E Shu Lin < Costello DEHE/ Error $ontrol $oding & Fundamentals and Applications/ Prentice Hall
IncE En$le3ood Cli--sE Re#e!en&e Boo-s #E CE Das HE/ Malik SEGE < Chatterje PEGE/ *rinciples of 5igital $ommunication/ e3 7$e International Limited %E Sam Shanmu$ham/ 5igital and Analog $ommunications/ Hohn Wile) &E Simon Ha)kin/ 5igital $ommunications/ Hohn Wile) (E Taub < Shillin$/ *rinciples of $ommunication -ystems/ Tata Mc1ra3 Hill *E :ichrd WE Hammin$/ Codin$ and In-ormation Theor)/ Prentice Hall IncE/#"0!E

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L#* = Multimedia


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To impart the fundamental concepts of multimedia.

Mod4%e I ")+ 'o4!s( Multimedia s)stem or$ani6ation and architecture - 85S architecture - multimedia distributed 2rocessin$ models multimedia con-erencin$ model - stora$e or$ani6ationE Mod4%e II ")+ 'o4!s( Ps)choacoustics - di$ital audio and com2uter - di$ital re2resentation o- sound - audio si$nal 2rocessin$ >editin$ and sam2lin$? - audio 2roduction - di$ital music - musical instrument s)nthesi6er - MIDI 2rotocol Mod4%e III ")+ 'o4!s( :aster scannin$ 2rinci2le - color -undamental - color .ideo 2er-ormance measurement - analo$ audio - stereo e--ect MPE1 and D4I technolo$) - multimedia a22lications - toolkit and h)2er a22licationE Mod4%e I/ ")+ 'o4!s(

Multimedia in-ormation s)stem - o2eratin$ s)stem su22ort middle3are s)stem ser.ice architecture 2resentation ser.ices - user inter-ace - -ile s)stem and in-ormation and in-ormation model - 2resentation and anchorin$ -ile - Multimedia standards - role o- standards - standardi6ation issues - distributed multimedia s)stemsE

Text Books #E PE GE ,u-ord/ Multimedia -ystems/ 7WLE Re#e!en&e Boo-s #E WEIE 1rosk)/ :E Hain and :E Mehrotra/ The <andbook of Multimedia "nformation -ystem/ Prentice Hall IndiaE %E PE GE 7ndlei$h and GE Thakrar/ Multimedia -ystems 5esign/ Prentice Hall IndiaE &E ME HE ,un6al and SE GE Morriec/ Multimedia Application 5evelopment/ Tata Mc1ra3 Hill (E :ao/ ,ojko.ic and Milo.ano.ic/ Multimedia $ommunication -ystems/ *E :E Steinmet6 and GE ahrstedt/ Multimedia $omputing $ommunication and Application/ Pearson Education

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L#+ = Web Pro$rammin$


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To teach the various technologies available for programming the web applications.

Mod4%e I ")1 'o4!s( Introduction to Web 2ro$rammin$ A Introduction to S1ML -eatures A HTML/ NHTML/ DHTML/ NML A HTML 4s NML A Creatin$ NML documents A Parsin$ an NML document A Writin$ 3ell -ormed documents A 5r$ani6in$ elements 3ith names2aces A De-inin$ elements in a DTD A Declarin$ elements and attributes in a DTDE Mod4%e II ")1 'o4!s( C1I/Perl= Creatin$ link to a C1I Scri2t A ;sin$ a link to send data to a C1I Scri2t A 2arsin$ data sent to a Perl C1I scri2t A ;sin$ C1I scri2t to 2rocess -orm data A ;sin$ scalar .ariables in Perl A ;sin$ .ariables in Perl A ;sin$ arithmetic o2erators in Perl A 7ssociatin$ a -orm 3ith a scri2tE Mod4%e III ")+ 'o4!s( E.ent dri.en 2ro$rammin$ usin$ Ha.a a22lets A Ha.a Ser.er Pa$es A HSP scri2tin$ elements A Linkin$ to e@ternal -iles A HSP declarations A HSP E@2ressions A HSP Scri2lets A Processin$ client reBuests A Ha.a ,eans = -eatures A desi$nin$ Ha.a ,eans A Pro2erties o- beans A creation o- e.ents A EH, basics A t)2es o- beans A de.elo2ment o- session beans A ste2s in creation and im2lementin$ inter-aces A 7ccessin$ a database -rom HSPE Mod4%e I/ ")+ 'o4!s( PHP = De-inin$ PHP .ariables A .ariable t)2es A o2erators A control -lo3 constructs in PHP A Establishin$ connection 3ith M)S8L database A mana$in$ s)stem data A 2arsin$ data bet3een 2a$es A Introduction to 7H7N 2ro$rammin$E

Text Books
#E :obert WE Sebesta/ *rogramming with Corld Cide Ceb/ (th edition/ Pearson Education/ %!!"E

Re#e!en&e Boo-s #E Nue ,al etE al/ The Ceb Carrior 8uide to Ceb programming/ Thomson Learnin$E %E Chris ,ates/ Ceb *rogramming , 3uilding "nternet Applications 'rd ed/ Wile) 7cademic Catalo$E &E HEME Deitel/ PEHE Deitel/ 7E,E 1oldber$/ "nternet and Corld Cide Ceb , <ow to *rogram 'rd edition/ Pearson EducationE (E Galata/ "nternet *rogramming with 73-cript and Hava-cript/ Thomson Learnin$E *E Hose2h L Weber/ @sing HA7A 0 *latform G -pecial Edition/ Prentice Hall IndiaE +E Larne Peko3sk)/ Hava -erver *ages/ Pearson 7siaE 'E ,arr) ,urd/ H-*/ ID1 ,ooks IndiaE 0E Ed :oman/ Mastering Enterprise Hava 3eans and the Hava 0 platform Enterprise Edition/ Wile) Com2uter Publishin$E "E 9lo)d Marinescu/ EH3 5esign *atterns/ #!E Ste.en Hol6ner/ A:ax 3ible/ Wile) Student EditionE

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L#' = 1ra2h Theor) and Combinatorics


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To introduce the basics of graph theory as a modelling and analysis tool in computer science and engineering. To introduce the structures such as graphs and trees and several combinatorial techniques which are needed in number theory based computing and network security studies in $omputer -cience.

Mod4%e I ")+ 'o4!s( Introduction to $ra2hs - de-initions - sub$ra2hs - 2aths and c)cles - matri@ re2resentation o- $ra2hs - Euler tours - Chinese 2ostman 2roblem - 2lanar $ra2hs -EulerKs -ormula - 2latonic bodies - a22lications oGurato3skiKs theorem - Hamiltonian $ra2hs - $ra2h colourin$ and chromatic 2ol)nomials - ma2 colourin$E Mod4%e II ")1 'o4!s( Trees - de-initions and 2ro2erties - rooted trees - trees and sortin$ - 3ei$hted trees and 2re-i@ codes biconnected com2onents and articulation 2oints - the ma@--lo3 min-cut theorem - ma@imum bi2artite matchin$ - Matchin$s -matchin$s and au$mentin$ 2aths -the 2ersonal assi$nment 2roblem A et3orks -lo3s and cuts - -ord and 9ulkerson al$orithm - se2aratin$ setsE Mod4%e III ")) 'o4!s( 9undamental 2rinci2les o- countin$ - 2ermutations and combinations - binomial theorem - combinations 3ith re2etition - combinatorial numbers - 2rinci2le o- inclusion and e@clusion - deran$ements arran$ements 3ith -orbidden 2ositions Mod4%e I/ ")1 'o4!s( 1eneratin$ -unctions - 2artitions o- inte$ers - the e@2onential $eneratin$ -unction - the summation o2erator recurrence relations - -irst order and second order - non-homo$eneous recurrence relations - method o$eneratin$ -unctions

Text Books

#E 1rimaldi :EPE/ 5iscrete and $ombinatorial Mathematics, An Applied "ntroduction/ 7ddison


Wesle)E %E Clark HE < Holton DE 7E/ A First #ook at 8raph Theory/ 7llied Publishers >World Scienti-ic?E Re#e!en&e Boo-s #E Corman TEHE/ Leiserson CEEE < :i.est :ELE/ "ntroduction to Algorithms/ Prentice Hall IndiaE %E Mott HELE/ Gandel 7E < ,aker TEP/ 5iscrete Mathematics for $omputer -cientists And Mathematicians/ Prentice Hall o- IndiaE &E Liu CELE/ Elements of 5iscrete Mathematics/ Mc1ra3 HillE (E :osen GEHE/ 5iscrete Mathematics and "ts Applications/ Mc1ra3 HillE

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L#0 = Machine Learnin$


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To teach the fundamental concepts of Machine #earning To equip the learners with techniques and methods using which machines mimic the human learning process.

Mod4%e I ")0 'o4!s( Preliminaries - Introduction - Learnin$ In2ut-5ut2ut 9unctions - Learnin$ and ,ias - Sam2le a22lications ,oolean 9unctions - :e2resentation - Classes o- ,oolean 9unctions - Introduction to eural et3orks Mod4%e II ")1 'o4!s( ;sin$ 4ersion S2aces -or Learnin$ - 4ersion S2aces and Mistake ,ounds - 4ersion 1ra2hs - Learnin$ as Search o- a 4ersion S2ace - The Candidate Elimination Method - eural et3orks - Threshold Lo$ic ;nits Linear Machines - et3orks o- TL;s - Trainin$ 9eed-or3ard et3orks b) ,ack2ro2o$ation - S)ner$ies ,et3een eural et3ork and Gno3led$e-,ased Methods - Statistical Learnin$ - ;sin$ Statistical Decision Theor) - Learnin$ ,elie- et3orks - ei$hest- ei$hbor Methods Mod4%e III ")1 'o4!s( Decision Trees - De-initions - Su2er.ised Learnin$ o- ;ni.ariate Decision Trees - et3orks EBui.alent to Decision Trees - 5.er-ittin$ and E.aluation - The Problem o- :e2licated Subtrees - The 2roblem o- Missin$ 7ttributes - Com2arisions - Inducti.e Lo$ic Pro$rammin$ - otations and De-initions - 7 1eneric ILP 7l$orithm - Inducin$ :ecursi.e Pro$rams - Choosin$ Literals to 7dd - :elationshi2 ,et3een ILP and Decision Tree Induction - Com2utational Learnin$ Theor) - otation and 7ssum2tions -or P7C Learnin$ Theor) - P7C Learnin$ - The 4a2nik-Cher.onenkis Dimension - 4C Dimension and P7C Learnin$ Mod4%e I/ ")1 'o4!s( ;nsu2er.ised Learnin$ - Clusterin$ Methods - Hierarchical Clusterin$ Methods - Tem2oral-Di--erence Learnin$ - Tem2oral Patterns and Prediction Problems - Su2er.ised and Tem2oral-Di--erence Methods Incremental com2utation o- the >delta 3?i - 7n e@2eriment 3ith TD Methods - Theoretical :esults - IntraSeBuence Wei$ht ;2datin$ - Dela)ed-:ein-orcement Learnin$ - The 1eneral Problem - Tem2oral Discountin$ and 52timal Policies - 8-Learnin$ - Discussion/ Limitations/ and E@tensions o- 8-Learnin$ E@2lanation-,ased Learnin$ - Deducti.e Learnin$ - Domain Theories - E.aluable Predicates - More 1eneral Proo-s - ;tilit) o- E,L - 722lications Text Books
#E

Ethem Alpayd@n2 Introduction to Machine $earning %&daptive Computation and Machine $earning'2 /I" !ress2 <**?0

Re#e!en&e Boo-s
#E %E

/itchell0 "2 Machine $earning2 /c-raw $ill2 ;++=0 Christopher /0 5ishop2 (attern )ecognition and Machine $earning2 Springer2 <**A0 #ys9ard S0 /ichalski2 :aime -0 Carbonell2 "om /0 /itchell2 Machine $earning * &n &rtificial Intelligence &pproach2 "ioga !ublishing

&E

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L#" = So-t Com2utin$


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To introduce the ideas of fuBBy sets fuBBy logic and use of heuristics based on human experience. To become familiar with neural networks that can learn from available examples and generaliBe to form appropriate rules for inferencing systems. To provide the mathematical background for carrying out the optimiBation associated with neural network learning. To familiariBe with genetic algorithms and other random search procedures useful while seeking global optimum in self&learning situations . To introduce case studies utiliBing the above and illustrate the intelligent behavior of programs based on soft computing.

Mod4%e I ")1 'o4!s( Introduction to 1enetic 7l$orithm/ 1enetic 52erators and Parameters/ 1enetic 7l$orithms in Problem Sol.in$/ Theoretical 9oundations o- 1enetic 7l$orithms/ Im2lementation Issues - s)stems Mod4%e II ")1 'o4!s( eural Model and et3ork 7rchitectures/ Perce2tron Learnin$/ Su2er.ised Hebbian Learnin$/ ,ack2ro2a$ation/ 7ssociati.e Learnin$/ Com2etiti.e et3orks/ Ho2-ield et3ork/ Com2utin$ 3ith eural ets and a22lications o- eural et3orkE Mod4%e III ")+ 'o4!s( Introduction to 9u66) Sets/ 52erations on 9u66) sets/ 9u66) :elations/ 9u66) Measures/ 722lications o9u66) Set Theor) to di--erent branches o- Science and En$ineerin$E Mod4%e I/ ")+ 'o4!s( 7d.anced To2ics= Su22ort 4ector Machines/ E.olutionar) com2utation >EC?- E.olutionar) al$orithms/ Harmon) search/ S3arm intelli$ence Text Books
#E HESE:EHan$/ CETESun and EEMi6utani/ >euro&FuBBy and -oft $omputing/ Pearson Education/

%!!(E Re#e!en&e Boo-s #E ME Mitchell/ An "ntroduction to 8enetic Algorithms/ Prentice-Hall/ #""0E %E DE EE 1oldber$/ 8enetic Algorithms in -earch DptimiBation and Machine #earning/ 7ddisonWesle)/ #"0"E &E SE 4E Gartalo2oulos/ @nderstanding >eural >etworks and FuBBy #ogic, 3asic $oncepts and Applications/ IEEE Press - PHI/ %!!(E (E SE :ajasekaran < 1E 7E 4ija)alakshmi Pai/ >eural >etworks FuBBy #ogic and 8enetic Algorithms, -ynthesis ; Applications/ PHI/ %!!&E

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L%! = In-ormation :etrei.al


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives To familiariBe the students with tools and techniques for deriving the right information at the right time in the current scenario of information explosion To present the techniques for storage of many forms of information such as text image audio and video formats and to present several issues related to different "+ tasks.

Mod4%e I ")0 'o4!s( Introduction= In-ormation .ersus Data :etrie.al/ I:= Past/ 2resent/ and -utureE ,asic conce2ts= The retrie.al 2rocess/ lo$ical .ie3 o- documentsE Modelin$= 7 Ta@onom) o- I: models/ ad-hoc retrie.al and -ilterin$E Classic I: models= Set theoretic/ al$ebraic/ 2robabilistic I: models/ models -or bro3sin$E Mod4%e II ")2 'o4!s( :etrie.al e.aluation= Per-ormance e.aluation o- I:= :ecall and Precision/ other measures/ :e-erence Collections/ such as T:EC/ C7CM/ and ISI data setsE 8uer) Lan$ua$es= Ge)3ord based Bueries/ sin$le 3ord Bueries/ conte@t Bueries/ ,oolean 8ueries/ 8uer) 2rotocols/ Buer) o2erationsE Mod4%e III ")2 'o4!s( Te@t and Multimedia Lan$ua$es and 2ro2erties/ Metadata/ Te@t -ormats/ Marku2 lan$ua$es/ Multimedia data -ormats/ Te@t 52erationsE Inde@in$ and searchin$= In.erted -iles/ Su--i@ trees/ Su--i@ arra)s/ si$nature -iles/ seBuential searchin$/ Pattern matchin$E Mod4%e I/ "). 'o4!s( Multimedia I:= S2atial access methods/ 1eneric multimedia Inde@in$ a22roach/ Distance -unctions/ -eature e@traction/ Ima$e -eatures and distance -unctionsE Searchin$ the Web= Characteri6in$ and measurin$ the WebE Search En$ines= Centrali6ed and Distributed architectures/ user Inter-aces/ :ankin$/ Cra3lin$ the Web/ Web directories/ D)namic search and So-t3are 7$entsE Text Book eto/ Modern "nformation +etrieval/ Pearson Education/ %!!(E

#E :E ,ae6a-Pates and ,E :E

Re#e!en&e Boo-s #E CEHE .an :ijsber$en/ "nformation +etrieval/ ,utter3orths/ #"'"E %E :E:EGor-ha$e/ In-ormation Stora$e and :etrie.al/ Wile) Student Edn/ %!!+E &E CEDE Mannin$ and HE Schut6e/ Foundations of -tatistical natural #anguage *rocessing >Cha2ters #&/ #(/ and #* onl)?/ The MIT Press/ Cambrid$e/ LondonE%!!#E (E DE Hand/ HE Mannila/ PE Sm)th/ 5ata Mining/ Prentice Hall o- India/ %!!(E

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L%# = Di$ital Desi$n usin$ 4HDL


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To teach the various aspects in the design of digital circuits using 7<5# including the language elements.

Mod4%e I ")+ 'o4!s( 4HDL Desi$n methodolo$) - :eBuirements anal)sis and s2eci-ication - 4HDL Desi$n Descri2tion 4eri-ication usin$ simulation A Test benches A 9unctional >,eha.ioral? Simulation - Lo$ic s)nthesis -or the Tar$et - Place-and-:oute and Timin$ simulation - 4HDL Desi$n Methodolo$) ad.anta$es - 4HDL -or s)nthesis .ersus 4HDL -or simulation - Desi$n ;nits/ Librar) units and Desi$n entities - Entit) declaration 4HDL S)nta@ de-initions - 7rchitecture bod) - Codin$ st)les - 5bject classes and object t)2es - Si$nal objects - Scalar t)2es - T)2e StdUlo$ic - Scalar literals and Scalar constants - Com2osite t)2es - 7rra)s T)2es unsi$ned and si$ned - Com2osite literals and Com2osite constants - Inte$er t)2es - Port T)2es -or S)nthesis - 52erators and e@2ressions Mod4%e II ")+ 'o4!s( Lo$ical o2erators - Si$nal assi$nments in data-lo3 st)le architectures - Selected si$nal assi$nment - T)2e ,oolean and the :elational o2erators - Conditional si$nal assi$nment - 2riorit) encoders - DonKt care in2uts and out2uts - Decoders - Table looku2 - Three state bu--ers - 7.oidin$ conditional loo2s - ,eha.ioral st)le architecture - 2rocess statement - SeBuential statements - Case statement - I- statement - Loo2 statement A 4ariables - Simulator 722roaches - Elaboration - Si$nal Dri.ers - Simulator Gernel Process - Simulation Initiali6ation - Simulation C)cles - Si$nals 4ersus 4ariables - Delta Dela)s - Delta Dela)s and combinational -eedback - Multi2le Dri.ers - Si$nal 7ttributes - Desi$n 4eri-ication - Sin$le 2rocess testbench - Wait statements - 7ssertion and :e2ort statements - :ecords and Table looku2 test benches Prede-ined shi-t o2erators - Stimulus order based on ;;T -unctionalit) Mod4%e III ")+ 'o4!s( Latches and 9li2-lo2s - D Latch - Detectin$ clock ed$es - D 9li2--lo2s - Enabled >1ated? 9li2--lo2 - 5ther 9li2--lo2 t)2es - PLD Primiti.e memor) elements - Timin$ reBuirements and S)nchronous in2ut data Multibit latches and re$isters - shi-t re$isters - Shi-t re$ister counters - Counters - Detectin$ non-clock si$nal ed$es A Memories - 9inite state machines - 9SM state dia$rams - Three 2rocess 9SM 4HDL tem2late - State dia$ram de.elo2ment - State encodin$ and state assi$nment - su22osedl) state 9SMs - Counters as Moore 9SMs - 7l$orithmic State Machine charts 7SM charts to 4HDL - S)stem architecture - Successi.e a22ro@imation re$ister desi$n e@am2le - SeBuential Multi2lier Desi$n - Sub2ro$rams - 9unctions Procedures - 7rra) attributes and unconstrained arra)s A 5.erloadin$ Sub2ro$rams and o2erators A T)2e con.ersions Mod4%e I/ ")+ 'o4!s( Packa$es and 2acka$e bodies - Standard and De -actor standard 2acka$es - Packa$es -or 4HDL te@t out2utSim2le seBuential test benches - S)stems clock - S)stem reset - S)nchroni6in$ stimulus $eneration and monitorin$ A Test bench -or successi.e a22ro@imation re$ister - 5ut2ut .eri-ication in stimulus 2rocedures ,us -unctional models A :es2onse monitors - Modular desi$n/ 2artitionin$ and hierarch) - Desi$n units and librar) units - Desi$n libraries - Direct desi$n entit) instantiation - Con-i$uration declarations - Com2onent connections - Parameteri6ed desi$n entities - Librar) o- 2arameteri6ed modules >LPM? - 1enerate statement Text Books
#E Peter H 7shenden/ The 5esigner?s 8uide to 7<5# 'rd edition/ Mor$an Gau--man Publishers/

%!!0E Re#e!en&e Boo-s #E Genneth L Short/ 7<5# for Engineers/ Prentice HallE %E SESE Lima)e/ 5igital design with 7<5#/ CM: Desi$n 7utomation >P? Ltd/ #"""E &E Ian 1rout/ 5igital -ystems 5esign with F*8As and $*#5s/ e3ness/Else.ier/ %!!"E (E Peter H 7shenden/ 5igital 5esign, An Embedded -ystems Approach using 7<5#/ Mor$an Gau--man Publishers/ %!!0E

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L%% = Com2utational 1eometr)


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives To teach the al$orithms concerned 3ith $eometric sha2es and -i$ures/ 2articularl) related to s2ace mani2ulationE

Mod4%e I ")+ 'o4!s( Introduction - 7n e@am2le = con.e@ hull - de$eneracies and robustness - a22lication domains - line se$ment intersection - the doubl)-connected ed$e list - com2utin$ the o.erla) o- t3o subdi.isions - boolean o2erations - $uardin$ and 2ol)$on trian$ulations - 2artitionin$ a 2ol)$on into monotone 2ieces trian$ulatin$ a monotone 2ol)$on - Linear 2ro$rammin$ - the $eometr) o- castin$ - hal--2lane intersection incremental linear 2ro$rammin$ - randomi6ed linear 2ro$rammin$ - unbounded linear 2ro$rams - linear 2ro$rammin$ in hi$her dimensions - smallest enclosin$ discs Mod4%e II ")+ 'o4!s( ortho$onal ran$e searchin$ - #-dimensional ran$e searchin$ - Gd-Trees - ran$e trees - hi$her dimensional ran$e trees - $eneral sets o- 2oints - -ractional cascadin$ - 2oint location and tra2e6oidal ma2s - a randomi6ed incremental al$orithm - dealin$ 3ith de$enerate cases - a tail estimate - .oronoi dia$rams com2utin$ the .oronoi dia$ram - .oronoi dia$rams o- line se$ments - -arthese-2oint .oronoi dia$rams arran$ements and dualit) - com2utin$ the discre2anc) - dualit) - arran$ements o- lines - le.els and discre2anc) Mod4%e III ")+ 'o4!s( Delauna) trian$ulations - trian$ulations o- 2lanar 2oint sets - com2utin$ the delauna) trian$ulation - the anal)sis - a -rame3ork o- randomi6ed al$orithms - $eometric data structures - inter.al trees - 2riorit) search trees - se$ment trees - con.e@ hulls - com2le@it) in &-s2ace - com2utin$ con.e@ hulls in &-s2ace - anal)sis con.e@ hulls and hal--s2ace intersection - binar) s2ace 2artitions - determination o- ,SP trees - ,SP trees and the 2ainterKs al$orithm - construction o- ,SP tree - the si6e o- ,SP tree in &-s2ace - ,SP trees -or lo3densit) scenes Mod4%e I/ ")+ 'o4!s( robot motion 2lannin$ - 3ork s2ace and con-i$uration s2ace - a 2oint robot - minko3ski sums translational motion 2lannin$ - motion 2lannin$ 3ith rotations - Buadtrees >non-uni-orm mesh $eneration? uni-orm and non-uni-orm meshes - Buadtrees -or 2oint sets - -rom Buadtrees to meshes - .isibilit) $ra2hs shortest 2aths -or a 2oint robot - com2utin$ the .isibilit) $ra2h - shortest 2aths -or a translatin$ 2ol)$onal robot - sim2le@ ran$e searchin$ - 2artition trees - multi-le.el 2artition trees - cuttin$ trees

Text Books

#E Mark de ,er$/ Mark .an Gre.eld/ Mark 5.ermars/ 5t-ried Sch3art6ko2-/ $omputational 8eometry , Algorithms and Applications/ S2rin$er/ e3 Pork/ #""'E
Re#e!en&e Boo-s

9ranco Pre2arata and Michael IE Shamos/ $omputational 8eometry , an "ntroduction S2rin$er/ e3 Pork/ #"0*E %E Hean-Daniel ,oissonnat and Mariette P.inec/ Algorithmic 8eometry/ Cambrid$e ;ni.ersit) Press/ #""0E
#E

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L%& = Simulation and Modellin$


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To teach the students how to reproduce real&world events or process under controlled

laboratory conditions using mainly mathematical models.


Mod4%e I ")0 'o4!s( Introduction - s)stems and models - com2uter simulation and its a22lications -continuous s)stem simulation - modelin$ continuous s)stems - simulation o- continuous s)stems - discrete s)stem simulation methodolo$) A e.ent schedulin$ and 2rocess interaction a22roaches - random number $eneration -testin$ orandomness - $eneration o- stochastic .ariates - random sam2les -rom continuous distributions - uni-orm distribution - e@2onential distribution m-Erlan$ distribution - $amma distribution - normal distribution - beta distribution - random sam2les -rom discrete distributions - ,ernoulli - discrete uni-orm -binomial $eometric and 2oisson Mod4%e II ")2 'o4!s( E.aluation o- simulation e@2eriments - .eri-ication and .alidation o- simulation e@2eriments - statistical reliabilit) in e.aluatin$ simulation e@2eriments -con-idence inter.als -or terminatin$ simulation runs simulation lan$ua$es -2ro$rammin$ considerations - $eneral -eatures o- 1PSS - SIM SC:IPT and SIM;L7E Mod4%e III ")* 'o4!s( Simulation o- Bueuein$ s)stems - 2arameters o- Bueue - -ormulation o- Bueuein$ 2roblems - $eneration oarri.al 2attern - $eneration o- ser.ice 2atterns -Simulation o- sin$le ser.er Bueues - simulation o- multiser.er Bueues -simulation o- tandom BueuesE Mod4%e I/ ")* 'o4!s( Simulation o- stochastic net3ork - simulation o- PE:T net3ork - de-inition o- net3ork dia$rams - -or3ard 2ass com2utation - simulation o- -or3ard 2ass -back3ard 2ass com2utations - simulation o- back3ard 2ass determination o- -loat and slack times determination o- critical 2ath - simulation o- com2lete net3ork merits o- simulation o- stochastic net3orksE

Re#e!en&e Boo-s #E CE Deo E/ -ystem -imulation And 5igital $omputer/ Prentice Hall o- IndiaE %E 1ordan 1E/ -ystem -imulation/ Prentice Hall o- IndiaE &E La3 7EME < Getton WEDE/ -imulation Modelling and Analysis/ Mc1ra3 HillE

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class No e5 5ne o- the assi$nments shall be com2uter based simulation o- continuous s)stems usin$ an) technical com2utin$ so-t3are 5ne o- the tests must be com2uter based >2ractical?E

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L%( = Com2uter ,ased umerical Methods


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To impart the basic concepts of mathematical modelling of problems in science and engineering and to know procedures for solving different kinds of problems. To understand the various numerical techniques which provide solutions to non linear equations partial differential equations etc that describe the mathematical models of problems.

Mod4%e I ")+ 'o4!s( Errors in numerical com2utation - mathematical 2reliminaries - errors and their anal)sis - machine com2utations com2uter so-t3areE 7l$ebraic and Transcendental EBuations - bisection method - iteration method - method o- -alse 2osition - rate o- con.er$ence - method -or com2le@ root - MullerFs method - Buotient di--erence method - e3ton:a2hson methodE Mod4%e II ")+ 'o4!s( Inter2olation A introduction - errors in 2ol)nomial inter2olation - -inite di--erences - decision o- errors - e3tonFs -ormula -or inter2olationE 1auss/ Sterlin$/ ,esselFs/ E.erettFs 9ormula - inter2olation b) une.enl) s2aced 2oints La$ran$e inter2olation -ormula - di.ided di--erence - e3tonFs $eneral inter2olation -ormulaE Mod4%e III ")+ 'o4!s( umerical Inte$ration and Di--erentiation A introduction - numerical di--erentiation - numerical inte$ration tra2e6oidal rule - Sim2son #/& rule - Sim2son &/0 rule - ,ooleFs and WeddleFs rules - Euler-Maclariaun -ormula 1aussian -ormula - numerical e.aluation o- sin$ular inte$ralsE Mod4%e I/ ")+ 'o4!s( Statistical Com2utations - -reBuenc) Chart - method o- least sBuare cur.e -ittin$ 2rocedures - -ittin$ a strai$ht line cur.e -ittin$ b) sum o- e@2onential - data -ittin$ 3ith cubic s2lines - a22ro@imation o- -unctionsE :e$ression 7nal)sis - linear and nonlinear re$ression - multi2le re$ression - statistical Bualit) control methodsE Text Books
#E EE ,ala$urusam)/ >umerical Methods/ Tata Mc1ra3-Hill PubECoELtd/ e3 Delhi/ #"""E %E CE9E 1erald and PE5E Wheatle)/ Applied >umerical Analysis Eth Ed./ Pearson Education 7sia/

e3 Delhi/ %!!%E Re#e!en&e Boo-s #E PE Gandasam)/ GE Thila$a.ath) and GE 1una.ath)/ >umerical Methods/ SEChand CoE LtdE/ e3 Delhi/ %!!&E %E :ELE ,urden and TEDE 9aires/ >umerical Analysis 6th EdE/ Thomson 7sia P.tE LtdE/ Sin$a2ore/ %!!%E &E Shastri/ "ntroductory methods of numerical analysis/ Prentice Hall InternationalE (E 4E :ajaraman/ "ntroduction to >umerical Methods/ Tata Mc1ra3 HillE In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

CS!" L%* = Pattern :eco$nition


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To impart a basic knowledge on pattern recognition and to give a sound idea on the topics of parameter estimation and supervised learning linear discriminant functions and syntactic approach to *+. To provide a strong foundation to students to understand and design pattern recognition systems.

Mod4%e I ")2 'o4!s( Introduction - introduction to statistical - s)ntactic and descri2ti.e a22roaches - -eatures and -eature e@traction - learnin$ - ,a)es Decision theor) - introduction - continuous case - %-cate$or) classi-ication minimum error rate classi-ication - classi-iers - discriminant -unctions - and decision sur-aces - error 2robabilities and inte$rals - normal densit) - discriminant -unctions -or normal densit) Mod4%e II ")2 'o4!s( Parameter estimation and su2er.ised learnin$ - ma@imum likelihood estimation - the ,a)es classi-ier learnin$ the mean o- a normal densit) - $eneral ,a)esian learnin$ - non2arametric technic - densit) estimation - 2ar6en 3indo3s - k-nearest nei$hbour estimation - estimation o- 2osterior 2robabilities nearest-nei$hbour rule - k-nearest nei$hbour rule Mod4%e III ")2 'o4!s( Linear discriminant -unctions - linear discriminant -unctions and decision sur-aces - $eneralised linear discriminant -unctions - %-cate$or) linearl) se2arable case - non-se2arable beha.iour - linear 2ro$rammin$ 2rocedures - clusterin$ - data descri2tion and clusterin$ - similarit) measures - criterion -unctions -or clusterin$ Mod4%e I/ "). 'o4!s( S)ntactic a22roach to P: - introduction to 2attern $rammars and lan$ua$es - hi$her dimensional $rammars tree/ $ra2h/ 3eb/ 2le@/ and sha2e $rammars - stochastic $rammars - attribute $rammars - 2arsin$ techniBues - $rammatical in-erence Text Books #E Duda < Hart PEE/ *attern $lassification And -cene Analysis/ Hohn Wile) %E 1on6ale6 :ECE < Thomson ME1E/ -yntactic *attern +ecognition & An "ntroduction/ 7ddison Wesle)E Re#e!en&e Boo-s #E 9u GESE/ -yntactic *attern +ecognition And Applications/ Prentice Hall/ Ea$le3ood cli--s %E :ajjan Shin$hal/ *attern +ecognition, Techniques and Applications/ 5@-ord ;ni.ersit) Press/ %!!0E

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

EE09 72+ ;ROCESS CONTRO7 AND INSTRUMENTATION


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek
Objectives

C!edi s5 (

To create an awareness of the different transducers used in industry and signal conditioning To familiariBe the process control elements and their control characteristics

Mod4%e I ", 'o4!s( Si$nal Conditionin$ A 7nalo$ A Di$ital - Si$nal con.ersions - Process Control Princi2les 9 Identi-ication o- elements/ block dia$ram/ the loo2/ control s)stem e.aluation stabilit)/ re$ulation/ e.aluation criteria/ and c)clic res2onseE Mod4%e II ")0 'o4!s( Fin$% Con !o% E%emen 5 9inal control o2eration/ si$nal con.ersions/ analo$ electrical si$nal/ di$ital electrical si$nals/ Direct action A 2neumatic si$nals/ 7ctuators A electrical actuators/ 2neumatic actuators/ control elements A -luid .al.esE Si$nal Conditionin$ o- Transducers- Tem2erature Transducers - -lo3 transducers Mod4%e III ")2'o4!s( Controller Princi2les - Process characteristics/ control s)stem 2arameters/ controller modes/ discontinuous controller modes/ continuous controller modes/ com2osite controller modesE 7nalo$ Controllers - Electronic controller A Direct action/ re.erse action/ 2ro2ortional mode/ inte$ral mode/ deri.ati.e mode/ com2osite controller modesE Pneumatic controllers A im2lementation o- PI/ PID/ PDE Desi$n considerationE Mod4%e I/ ")1'o4!s( Con !o% 7oo3 C'$!$& e!is i&s5 Control s)stem con-i$urations/ cascade control/ multi.ariable control/ -eed -or3ard control/ S2lit ran$e control/ in-erential control/ 7da2ti.e control/ control s)stem Bualit) A loo2 disturbance/ o2timum control/ measure o- Bualit)/ Stabilit)/ 2rocess loo2 tunin$

Te6 Boo-s #E Curtis DE Hohnson/ *rocess $ontrol "nstrumentation Technology Pearson EducationE Re#e!en&e Boo-s #E Curtis DE Hohnson/ Microprocessors in *rocess $ontrol PHI %E 1eor$e Ste2hano2oulis/ $hemical *rocess $ontrol &E Cau$hner/ *rocess Analysis and $ontrol (E Desh2ande and 7sh/ Elements of computer process control of "ndustrial processes IS7 *E Ha)antha GE Paul/ +eal& Time microcomputer control of "ndustrial processes/ Glu3er Publications/ etherlandsE +E SE GE Sin$h/ $omputer Aided *rocess $ontrol/ PHI% 'E Dale EE Sebor$/ Thomas 9E Ed$ar/ Duncan 7E Mekkicham2/ *rocess 5ynamics and $ontrol Wile) India

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class ;ni.ersit) E@amination Pattern

*A+T A, -hort answer questions %one.two sentences) / x 0 marks12( marks 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each Module and not more than t3o Buestions -rom an) ModuleE *A+T 3, Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each Module and not more than t3o Buestions -rom an) ModuleE *A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each Module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

EE09 7 2* ROBOTICS AND AUTOMATION


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek
Objectives

C!edi s5 (

To give an introduction of industrial robotics and automation

Mod4%e I ")1 Ho4!s( 7utomation and :obotics - :obotics in Science 9iction - 7 ,rie- Histor) o- :obotics - The :obot and Its Peri2herals-:obot 7cti.ation and 9eedback Com2onents - Position Sensors - 4elocit) Sensors - 7ctuators - Po3er Transmissions S)stems - :obot Hoint Control Desi$n- Introduction to Mani2ulator Ginematics - Homo$eneous Trans-ormations and :obot Ginematics -Mani2ulator Path Control - :obot D)namics - Con-i$uration o- a :obot ControllerE Mod4%e II ")+ Ho4!s( T)2es o- End E--ectors - Mechanical 1ri22ers - 5ther T)2es o- 1ri22ers - Tools as End E--ectors The :obot/End E--ector Inter-ace - Considerations in 1ri22er Selection and Desi$n - Sensors in :obotics - Tactile Sensors - Pro@imit) and :an$e Sensors - Miscellaneous Sensors and Sensor,ased S)stems - ;ses o- Sensors in :obotics - Introduction to Machine 4ision - The Sensin$ and Di$iti6in$ 9unction in Machine 4ision - Ima$e Processin$ and 7nal)sis - Trainin$ and 4ision S)stem - :obotic 722licationsE Mod4%e III ")1 Ho4!s(
Methods o- :obot Pro$rammin$ A Lead throu$h Pro$rammin$ Methods - 7 :obot Pro$ram as a Path in S2ace - Motion Inter2olation - W7IT/ SI1 7L/ and DEL7P Commands - ,ranchin$ - ca2abilities and Limitations o- Lead throu$h Methods - The Te@tual :obot Lan$ua$es - 1enerations o- :obot Pro$rammin$ Lan$ua$es - :obot Lan$ua$e Structure - Constants/ 4ariables/ and 5ther Data 5bjects - Motion Commands - End E--ector and Sensor Commands - Com2utations and o2erations - Pro$ram Control and Subroutines Communications and Data Processin$ - Monitor Mode CommandsE

Mod4%e I/ ")+ Ho4!s(


Introduction to robot intelli$ence and task 2lannin$- state s2ace search-2roblem reduction-use o- 2redicate lo$ic-means Aend anal)sis-2roblem-sol.in$ Arobot learnin$-robot task 2lannin$-e@2ert s)stems and kno3led$e learnin$E

Te6 Boo-s #E Mikell PE 1roo.er- etE 7l/ "ndustrial robotics Technology programming and Applications/ Mc1ra3 Hill %E GE SE 9u/ :E CE 1on6ale6/ CE SE 1E Lee/ +obotics $ontrol -ensing and "ntelligence Mc1ra3 Hill

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

;ni.ersit) E@amination Pattern

*A+T A, -hort answer questions %one.two sentences) / x 0 marks12( marks 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each Module and not more than t3o Buestions -rom an) ModuleE *A+T 3, Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each Module and not more than t3o Buestions -rom an) ModuleE *A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each Module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

ME09 7215 M$!-e in8 M$n$8emen


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives To impart knowledge on fundamentals of marketing marketing environment market oriented strategic planning marketing research and marketing communications.

;!e9!e>4isi es5 3asic knowledge of principles of management

Mod4%e I ")+ 'o4!s( Introduction to marketin$ = De-inin$ marketin$ -or the t3ent) -irst centur)/ marketin$ A sco2e/ tasks/ conce2t o- market and marketin$/ com2an) orientations to3ards the market 2lace A 2roduction / 2roduct/ sellin$/ marketin$/ customer and societal marketin$ conce2tsE Marketin$ en.ironment = Controllable -actors/ identi-)in$ and res2ondin$ to the major macro en.ironment A uncontrollable -actors A demo$ra2hic/ economic/ natural technolo$ical/ 2oliticalle$al and social A cultural en.ironmentE
Mod4%e II ")+ 'o4!s(

Market 5riented strate$ic 2lannin$ A ke) areas/ or$ani6ational le.els/ cor2orate and di.ision strate$ic 2lannin$ A cor2orate mission/ strate$ic business units/ The ,oston consultin$ $rou2 a22roach/ The $eneral electric model/ Plannin$ ne3 businesses A 1ro3th A Intensi.e/ inte$rati.e/ di.ersi-ication/ Marketin$ mi@ A .ariables/ marketin$-mi@ strate$)E Market-se$mentation A le.els/ 2atterns/ 2rocedure/ e--ecti.enessE Market tar$etin$ A E.aluation/ tar$et market selectionE
Mod4%e III ")+ 'o4!s(

Marketin$ research A eed/ sco2e A Marketin$ research 2rocessE Consumer beha.iour A -actors in-luencin$ bu)er beha.iour A Cultural/ social 2ersonal/ 2s)cholo$ical -actorsE De-inin$ customer .alue and satis-actionE Product li-e c)cles A marketin$ strate$ies -or di--erent sta$es o- 2roduct li-e c)cleE Mod4%e I/ ")* 'o4!s( Marketin$ communications A 2rocess A de.elo2in$ e--ecti.e communications A Identi-ication o- the tar$et audience/ determination o- communication objecti.es/ Desi$nin$ the messa$e/ select the communication channels/ establishin$ the total marketin$ communications bud$et A Decidin$ on the marketin$ communications mi@ A 2romotional tools an o.er .ie3 A ad.ertisin$/ sales 2romotion/ 2ublic relations and 2ublicit)/ sales -orce and direct marketin$- de.elo2in$ and mana$in$ an ad.ertisin$ 2ro$ram A settin$ objecti.es/ decidin$ bud$et/ choosin$ messa$e A an o.er.ie3 on measurin$ e--ecti.eness o- a media A sales 2romotion A 2ur2ose/ major decisionsE

Text Books

#E PE Gotler/ Marketing Management ##th Edition A Pearson Eductation >Sin$a2ore? P.t Ltd/ e3 Delhi >%!!(?
Re#e!en&e Boo-s

#E 4E SE :amas3am)/ SE amkumari/ Marketing Management/ Mc Millan India Ltd/ e3 Delhi >#""'?E %E Sa@ena/ Marketing Management/ %nd Edition/ Tata Mc 1ra3 Hill >%!!%?E

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %?

&!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ Literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE
#!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n

*A+T A, -hort answer questions %one.two sentences) / x 0 marks12( marks 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE *A+T 3, Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE *A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

AN09 721 ;RO?ECT MANAGEMENT


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek

&!edi s 1

Ob@e& i2es5
To give an exposure to the ma:or aspects of pro:ect viB. *ro:ect *lanning Analysis -election "mplementation and review. Mod4%e I ")+ 'o4!s( Plannin$ -Ca2ital E@2enditures -Phases o- Ca2ital ,ud$etin$ -Le.els o- decision Makin$ -9acets o- Project anal)sis-9easibilit) Stud) -5bjecti.es o- Ca2ital ,ud$etin$ -:esource 7llocation -rame3ork Ge) CriteriaElementar) In.estment strate$ies -Port-olio 2lannin$ tools -1eneration o- RK2roject Ideas Monitorin$ the en.ironment -Cor2orate a22raisal -Scoutin$ -or 2roject ideas -Preliminar) Screenin$ Project ratin$ inde@ -Sources o- Positi.e net 2resent .alue

Mod4%e II ")1'o4!s( 7nal)sis -Market and demand anal)sis -Situational anal)sis and s2eci-ication o- objecti.es -Collection osecondar) in-ormation -Conduct o- market sur.e) -Characteri6ation o- Market -demand 9orecastin$ -Market 2lannin$ -Technical anal)sis-Material in2uts and utilities -Manu-acturin$ 2rocess/technolo$) -Product Mi@ -Plant ca2acit) -Location and site -machineries and eBui2ments -Structures and ci.il 3orks -Project charts and la)outs -Work schedule -9inancial 7nal)sis -Cost o- 2roject -means o- -inance -Estimates o- sales and Production -Cost o- 2roduction -Workin$ ca2ital reBuirements and its -inancin$ -Pro-itabilit) 2rojections -,reak e.en 2oint -2rojected cash -lo3 statements and balance sheets Mod4%e III ")+'o4!s( Project Cash -lo3s -,asic I sin$le amount -9uture .alue o- an annuit) -Present .alue o- a sin$le amount -Present 4alue o- an annuit)-Cost o- ca2ital -Cost o- debt ca2ital -cost o- 2re-erence ca2ital -:ate o- return -Cost o- e@ternal eBuit) and retained earnin$s -Determination o- 3ei$hts -722raisal criterion - et 2resent .alue Cost bene-it ratio-Internal rate o- return-;r$enc) -2a)back 2eriod Mod4%e I/ ")1'o4!s( Im2lementation-9orms o- Project or$ani6ation -Project 2lannin$ -Project control -Human 7s2ects o- Project mana$ement - et3ork TechniBues -De.elo2ment oet3ork -Time estimation -Critical 2ath determination -Schedulin$ under limited resources -PE:T Model-CPM Model - et3ork Cost S)stem -Project re.ie3InitialM re.ie3 -Per-ormance e.aluation-7bandonment $n$%:sis

Te6 Boo-5 Prasanna Chandra/ *ro:ects *lanning Analysis -election "mplementation and +eviewJ. Fourth Edition Tata Mc1ra3-HillE Re#e!en&e boo-s IE Dennis Lock/ *ro:ect Management 1ro3er Publications %E Prasanna Chandra/ Financial Management Theory and *ractice Tata Mc1ra3 Hill Publishers &E Parames3ar P I)er/ Engineering *ro:ect management 4ikas 2ublishers (E 1ido < Clements/ -uccess.iii *ro:ect Management 4ikas Publishers *E HaroldETEE7mrine HohnE7E:itche)/ Manufacturing Drganisation and Management Pearson Education

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() + +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) / x 0 marks12( marks 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T 3,

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

EC09 72*5 Biomedi&$% Ins !4men $ ion


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives To im2art kno3led$e about the 2rinci2le and 3orkin$ o- di--erent t)2es o- bio-medical electronic eBui2ments/de.ices

Mod4%e I ")1 'o4!s( Electrical acti.it) o- e@citable cells-SD cur.e--unctional or$ani6ation o- the 2eri2heral ner.ous s)stem-electrocardio$ram >in detail 3ith all lead s)stems?-electroence2halo$ram-electrom)o$ram A electroneuro$ram- electrode Aelectrol)te inter-ace-2olarisation-2olarisable and non 2olarisable electrodes- sur-ace electrodes Aneedle electrodes-micro electrodes- 2ractical hints -or usin$ electrodes-Vskin- electrodesF eBui.alent circuit-characteristics o- Vbio-am2li-iersF Mod4%e II ")1 'o4!s( ,lood 2ressure-direct measurements-harmonic anal)sis o- blood 2ressure 3a.e-orm-s)stem -or measurin$ .enous 2ressure-heart sounds- 2honocardio$ra2h)-cardiac catheteri6ation-indirect blood 2ressure measurement Aelectroma$netic blood -lo3 meters-ultrasonic blood -lo3 meters-im2edance 2leth)smo$ra2h) A2hoto 2leth)smo$ra2h)-Vindicator- dilutionFmethod -or blood -lo3 determination As2irometr)-measurement o- .arious res2irator) 2arameters- res2irator) 2leth)smo$ra2h)chamber 2leth)smo$ra2h) Mod4%e III ")+ 'o4!s( Measurement o- $as -lo3 rate cardiac 2acemakers and other electric stimulators-de-brillators and cardio con.erters Ablood 2lum2s Ahemodial)sis-.entilators Ain-ant incubators-dru$ deli.er) de.ices-lithotri2s)-thera2eutic a22lications o- laser Mod4%e I/ ")+ 'o4!s( Ph)siolo$ical e--ects o- electricit)-im2ortant susce2tibilit) 2arameters-macro shock ha6ards-micro shock ha6ards-2rotection a$ainst shock-electrical isolation- electrical sa-et) anal)6ers-measurements o- 2H/2C%/ and P5%

Text Books

#E Webster H/F Medical Instrumentation-722lication and Desi$nF/ Hohn Wile) %E Handbook o- ,iomedical Instrumentation/ Tata-Mi$ra3 Hill/ e3 Delhi
Re#e!en&e Boo-s #E 1eddes< ,aker/FPrinci2les o- 722lied ,iomedical InstrumentationF/ Wile) %E Enc)clo2edia o- Medical De.ices and Instumentation Wile) &E ,ron6ino/Hand book o- ,iomedical En$ineerin$/IEEE 2ress book

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

IC09 72+ Bioin#o!m$ i&s


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek Ob@e& i2es5 To get the students acquainted with the interdisciplinary field of bioinformatics To expose the students to the biological database resources and tools To provide an introduction to the important problems and algorithms in bioinformatics.
;!e!e>4isi es

C!edi s5 (

Familiarity with internet resources and an aptitude for learning algorithms along with high school level knowledge in biologyE Mod4%e I ")1'o4!s( T'e bio%o8i&$% b$&-d!o3= Cells-Prokar)otes and Eukar)otes-D 7 double heli@- central do$ma A D 7/ : 7/ aminoacids/ Proteins -strin$ re2resentations- di--erent le.els o- 2rotein structures-D 7 clonin$- :9LP-S P-Pol)merase chain reaction >PC:?-$el electro2horesis-h)bridi6ation-7 brie- introduction to di--erent ma22in$s techniBues o$enomes- $enome seBuencin$ methods-D 7 micro arra)s AHuman 1enome Project-7 $lossar) obiolo$ical termsE Mod4%e II ")1'o4!s( Bioin#o!m$ i&s9 'e bi8 3i& 4!e $nd 'e bio%o8i&$% d$ $b$se !eso4!&es5 Sco2e o- bioin-ormatics-1enomics and Proteomics- 7 .er) brie- introduction to major 2roblems in bioin-ormatics like seBuence ali$nment/ 2h)lo$en)/ $ene -indin$/ microarra) anal)sis/ secondar) structure 2rediction/ 2rotein structure 2rediction/ com2arati.e $enomics and dru$ desi$nE 7n introduction to the major re sources at C,I/ E,I and E@P7S)- ucleic acid seBuence databases= 1en,ank/ EM,L/ DD,H -Protein seBuence databases= SWISS-P:5T/ TrEM,L/ PI:UPSD - 1enome Databases at C,I/ E,I/ TI1:/ S7 1E: A Ho3 to access these databases and to make use o- the tools a.ailableE 4arious -ile -ormats -or bio-molecular seBuences like $enbank and -astaE The conce2t o- 2ro-iles- The deri.ed databases- Prosite/ P-am/ P:I TS/ C7TH/ SC5P Mod4%e III ")+ 'o4!s( Se>4en&e $%i8nmen $%8o!i 'ms $nd Too%s5 ,asic conce2ts o- seBuence similarit)/ identit) and homolo$)/ de-initions o- homolo$ues/ ortholo$ues/ 2aralo$uesE Scorin$ matrices= basic conce2t o- a scorin$ matri@/ P7M and ,L5S;M matrices/ di--erences bet3een distance < similarit) matri@E Pair3ise seBuence ali$nments= basic conce2ts o- seBuence ali$nment/ eedleman < Wuncsh/ Smith < Waterman al$orithms -or 2air3ise ali$nmentsE ,L7ST and 97ST7 and their .ersionsE Multi2le seBuence ali$nments >MS7?= the need -or MS7/ basic conce2ts o- .arious a22roaches -or MS7 >eE$E 2ro$ressi.e/ hierarchical etcE?E 7l$orithm o- CL;ST7LWE Mod4%e I/ ")+ 'o4!s( ;':%o8en:A 8ene #indin8 $nd mo%e&4%$! 2is4$%iB$ ion5 Ph)lo$en)= ,asic conce2ts o- 2h)lo$en)M molecular e.olutionM De-inition and descri2tion o- 2h)lo$enetic treesE Ph)lo$enetic anal)sis al$orithms - Ma@imum Parsimon)/ ;P1M7 and ei$hbour-Hoinin$E 1ene 9indin$= The si@ readin$ -rames-Com2utational $ene -indin$ in 2rokar)otes and eukar)otes ,asic si$nals Astart and sto2 codons/ 2romoters etc- im2ortant codin$ measures- :e$ular e@2ressions- Introduction to Hidden Marko. models- Introduction to $enomic si$nal 2rocessin$ Molecular .isuali6ation= 4isuali6ation o- 2rotein structures usin$ :asmol or :asto2

Text Books

#E Dan EE Grane and Michael LE :a)mer/ Fundamental concepts of 3ioinformatics/ Pearson Education %E TE GE 7tt3ood and DE HE Parr)-Smith/ "ntroduction to 3ioinformatics/ Pearson Education/ %!!&E
&E Cla.erie < otredame/ 3ioinformatics & A 3eginners 8uide/ Wile)-Dreamtech India P.t (E eil CE Hones and Pa.el7E Pe.6ner/ An introductin to bioinformatics algorithms/ 7ne ,ooks *E 1ar) ,enson and :oderic Pa$e/ Alogorithms in 3ioinformatics/ S2rin$erE +E :E Durbin etEalE/ 3iological -equence Analysis/ Cambrid$e ;ni.ersit) PressE 'E 1authm/ 3ioinformatics databases and algorithms/ arosa Publishers Re#e!en&es #E Dan 1us-ield/ Algorithms Dn -trings Trees And -equences/ Cambrid$e ;ni.ersit) Press %E :esources at 3eb sites o- C,I/ E,I/ S7 1E:/ PD, etc In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE

*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6(

PE!" L%&= Total 8ualit) Mana$ement


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives To impart knowledge on the concept of quality tools for analysing quality statistical tools in quality acceptance sampling life tests Mod4%e I ")1 'o4!s( De-inition o- Bualit)-internal and e@ternal customers- .ision statement A mission statements A objecti.es A $oals A tar$ets- e.olution o- T8M A De-inin$ T8M A sta$es in T8 M im2lementation-T8M models Mod4%e II ")1 'o4!s( SW5T anal)sis-strate$ic 2lannin$-customer -ocus-Bualit) -unction de2lo)ment-customer satis-action measurement-se.en ne3 mana$ement tools-Demin$ 3heel-6ero de-ect conce2t-bench markin$-si@ si$ma conce2ts--ailure mode and e--ect anal)sis-2oke )oke Mod4%e III ")+ 'o4!s( 9i.e S -or Bualit) assurance-Bualit) circle 2hiloso2h)--ailure rate anal)sis-mean -ailure rate-mean time to -ailure >MTT9?-Mean time bet3een -ailure >MT,9?-ha6ard models-s)stem reliabilit)-a.ailabilit)- maintenance Mod4%e I/ ")+ 'o4!s( 8ualit) and cost-characteristics o- Bualit) cost-micro anal)sis o- Bualit) cost-measurement o- Bualit)-T8M road ma2- IS5 "!!! series certi-ication-IS5 "!!#=%!!! certi-ication-IS5 #(!!! certi-ication-8S "!!! auditin$8ualit) auditin$- Bualit) a3ards

Text Books #E L Su$anthi/ 7nand 7 Samuel/ Total Iuality Management/ PHI %E LtE1enE Lal H/ Total Iuality Management/ Wile) Eastern Limited Re#e!en&e Boo-s #E 1re$ ,ounds/ 3eyond Total Iuality Management/ Mc1ra3 Hill Publishers %E Menon H 1/ TIM in >ew *roduct Manufacturing/ Mc1ra3 Hill Publishers In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I &!I #!I Tests >minimum %? 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE :e$ularit) in the class

Uni2e!si : E6$min$ ion ;$ e!n *A+T A, -hort answer questions %one.two sentences) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE *A+T 3, Analytical.*roblem solving questions Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE *A+T $, 5escriptive.Analytical.*roblem solving questions T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total Marks, 6( 4 x 2( marks14( marks 4 x / marks10( marks / x 0 marks12( marks

CE09 7215 REMOTE SENSING AND GIS


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Ob@e& i2es To make the students aware of the technological developments in the geographical database management and its advantages Mod4%e I ")1 Ho4!s( :emote sensin$= de-inition A com2onents o- remote sensin$- ener$) sensor/ interactin$ bod) A acti.e and 2assi.e remote sensin$ A 2lat-orms A arial and s2ace 2lat-orms A balloons /helico2ters/ aircra-ts and satellites A s)no2ti.it) and re2eati.it) A electroma$netic radiation >EM:? A EM: s2ectrum A .isible/ in-rared >I:? near I:/ middle I:/ thermal I: and micro3a.e A black bod) radiation A Plancks La3 A Ste-an A,olt6man la3E 7tmos2heric characteristics A scatterin$ o- EM: A :alie$h/ Mie/ on-selecti.e and :aman scatterin$ A EM: interaction 3ith 3ater .a2ur and o6one A atmos2heric 3indo3s A si$ni-icance o- atmos2heric 3indo3s A EM: interaction 3ith earth sur-ace material/ radiance/ irradiance/ incident/ re-lected/ absorbed and transmitted ener$) A re-lectance A s2ecular and di--used re-lection sur-aces A s2ectral si$nature A s2ectral si$nature cur.es A EM: interaction 3ith 3ater/ soil and earth sur-aceE Mod4%e II ")1 Ho4!s( 52ticaa and Micro3a.e :emote sensin$= Satellites A classi-ication A based on orbits A sun s)nchronous and $eo s)nchronous A based on 2ur2ose A earth resources satellites / communication satellites/ 3eather satellites/ s2) satellites A satellite sensors A resolution A s2ectral/ s2atial/ radiometric and tem2oral resolution A descri2tion o- multi-s2ectral scannin$ A alon$ and across track scanners- descri2tion o- sensors in I:S series A current satellites A radar A s2eckle A back scatterin$- side lookin$ air borne radar A s)nthetic a2erture radar A radiometer radar A $eometrical characteristicsE Princi2les o- thermal remote sensin$E Princi2les o- micro3a.e remote sensin$E Mod4%e III ")+ Ho4!s( 1eo$ra2hic in-ormation s)stem A com2onents o- 1IS A hard3are/ so-t3are and or$anisational conte@t A data A s2atial and non s2atial ma2s A t)2es o- ma2s A 2rojection- t)2es o- 2rojection A data in2ut- di$itiser/ scanner/ editin$ A raster and .ector data structures A com2arison o- raster and .ector data structure A anal)sis usin$ raster and .ector data A retrie.al/ reclassi-ication/ o.erla)in$/ bu--erin$ - data out2ut A 2rinters and 2lottersE Mod4%e I/ ")+ Ho4!s( Miscellaneous to2ics= inter2retation o- satellite ima$es- elements o- inter2retation A .isual inter2retation A di$ital ima$e 2rocessin$ techniBues A ima$e enhancement A -ilterin$ A ima$e classi-ication A 9CC com2osites - su2er.ised and unsu2er.ised inte$ration o- 1IS and remote sensin$ Aa22lication o- remote sensin$ and 1IS A urban a22lications A 3ater resources A urban anal)sis A 3atershed mana$ement A resources in-ormation s)stem A ha6ard miti$ationE Te6 boo-s5 #E 7nji :edd)/ :emote sensin$ and 1eo$ra2hical s)stems/ ,S Publications %E M 1 Srini.as >Edited b)?/ remote sensin$ a22lications/ erusa 2ublishin$ house &E Lillesand T M and Gue-er : WE/ :emote sensin$ and ima$e inter2retation/ Hohn Wile) and sons (E Hensan H :/ Introductor) di$ital ima$e 2rocessin$/ Prentice Hall o- India *E Sabins/ 9l)od/ 9E/ :emote sensin$ 2rinci2les and Inter2retation/ W H 9reman and CoE/ e3Pork

Re#e!en&es5 #E Han6a 9 H/ ,lue H M and Hohnston/ H EE/ Manual o- remote sensin$ .olE IE/ 7merican Societ) oPhoto$rammetr)/ #"'* %E ,urrou$h P 7E/ Princi2les o- 1IS -or land resource assessment/ 5@-ord &E Star He--re) L >Ed?/ Ests Hoh E and Mc13ire Genneth/ Inte$ration o- $eo$ra2hical s)stems and remote sensin$/ Cambrid$e uni.ersit)E (E De Merse/ Michael E/ 9undamentals o- $eo$ra2hic in-ormation s)stem/ %nd ednE/ Hohn Wile) and sonsE

CE09 72* FINITE E7EMENT METHODS


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Ob@e& i2e5 To make the back ground basic concepts and basic formulation of finite element method clear to the students Mod4%e I ")1 'o4!s( In !od4& ion o Fini e E%emen Me 'ods5 Ph)sical 2roblems/ mathematical models and -inite element solutions A Mathematical model o- Discrete s)stems A elements and assembla$e - matri@ -ormulation A EBuations o- eBuilibrium - element assembl) and solution -or unkno3ns A1auss elimination method/ LDL-T Method - ,asic eBuations o- elasticit) A stressAstrain and strain-dis2lacement relations - theor) o- stress and de-ormation - stress-strain-tem2erature relations Re2ieC o# di!e& s i##ness me 'od5 Descreti6ation A element and structure sti--ness matrices D59 relationshi2- assembl) o- $lobal sti--ness matri@ and load .ector - solution o- eBuations -or unkno3ns dis2lacement boundar) conditions - com2utation o- stress - su22ort reactionsE Mod4%e II ")+ 'o4!s( Con in4o4s s:s ems5 Practical E@am2les Amathematical models- di--erential -ormulation A limitations A 4ariational -ormulation A Total 2otential ener$) - 2rinci2le o- stationar) 2otential ener$) - 2roblems ha.in$ man) dEoE- - 2otential ener$) o- an elastic bod) - the :a)lei$h-:it6 method - 2iece3ise 2ol)nomial -ield -inite element -orm o- :a)lei$h-:it6 method - -inite element -ormulations deri.ed -rom a -unctional inter2olation - sha2e -unctions -or C! and C# elements - La$ran$ian inter2olation -unctions -or t3o and three dimensional elements Mod4%e III ")+ 'o4!s( Dis3%$&emen b$sed e%emen s #o! s !4& 4!$% me&'$ni&s5 -ormulas -or element sti--ness matri@ and load .ector - o.er.ie3 o- element sti--ness matrices - consistent element nodal .ector - eBuilibrium and com2atibilit) in the solution - con.er$ence reBuirements - 2atch test - stress calculation - other -ormulation methods S !$i8' sided !i$n8%es $nd e !$'ed!$%5 natural coordinates -or lines - trian$les and tetrahedral inter2olation -ields -or 2lane trian$les - linear and Buadratic trian$le - Buadratic tetrahedron Mod4%e I/ ")1 'o4!s( T'e iso3$!$me !i& #o!m4%$ ion5 introduction - an iso2arametric bar element - 2lane bilinear element summar) o- $auss Buadrature - Buadratic 2lane elements - direct construction o- sha2e -unctions -or transition elements - trian$ular iso2arametric elements - consistent element nodal loads - .alidit) oiso2arametric elements - a22ro2riate order o- Buadrature - element and mesh instabilities - remarks on stress com2utation Coo!din$ e !$ns#o!m$ ion5 trans-ormation o- .ectors - trans-ormation o- stress/ strain and material 2ro2erties - trans-ormation o- sti--ness matrices - trans-ormation o- -le@ibilit) to sti--ness - inclined su22ort joinin$ dissimilar elements to one another- ri$id links - ri$id elements

Te6 boo-s5 #E ,athe GEHE/ 9inite Element Procedures in En$ineerin$ 7nal)sis/ Prentice Hall o- India %E Cook :EDE/ Malkus DESE < Plesha ME9E/ Conce2ts < 722lications o- 9inite Element 7nal)sis/ Hohn Wile) &E :edd)/ HE E/ 7n Introduction to the 9inite Element Method/ Mc1ra3 Hill/ %!!+E

Re#e!en&e boo-s5 #E Desai CESE/ Elementar) 9inite Element Method/ Prentice Hall o- India %E Chandru2atla TE:E < ,ele$undu 7EDE/ Introduction to 9inite Elements in En$ineerin$/ Prentice Hall oIndia &E Cook/ :EDE/ 9inite Element Modellin$ -or Structural 7nal)sis/ Hohn Wile) and sonsE (E 1alla$har :EHE/ 9inite Element 7nal)sis= 9undamentals/ Prentice Hall IncE *E :ajasekaran SE/ 9inite Element 7nal)sis in En$ineerin$ Desi$n/ Wheeler PubE +E Grishnamoorth) CE SE/ 9inite Element 7nal)sis - Theor) and Pro$rammin$/ Tata Mc1ra3 Hill 'E Cienkie3ics 5ECE < Ta)lor :ELE/ The 9inite Element Method/ 4ol I < II/ Mc1ra3 Hill 0E Se$relindE/ The 9inite Element MethodE In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion 3$ e!n P7:T 7= -hort answer questions /K0 marks12( Marks 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE P7:T ,= Analytical . *roblem solving questions 4K/ marks10( Marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE P7:T C= *roblem solving questions.4K2( marks1 4( Marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total marks, 6(

BT09 721 BIOETHICS & INTE77ECTUA7 ;RO;ERTD RIGHTS


Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek Ob@e& i2es5 1o impart "no,le$ge on bioethics an$ intellectual property rights 1o stu$y the %arious ethical issues in biotechnology C!edi s5 (

Mod4%e I ,iotechnolo$) and ,ioethicsE 3hat is Ethical ,iotechnolo$)T >:i$hts/ Con-identialit)/ 7nimal :i$hts/ En.ironmental Ethics/ Decision Makin$? A Ethical 7s2ects o- Desi$ner ,abies/ $enetic screenin$ and 2renatal testin$ A issues o- ethics in biomedicineE Trans$enic 2lantsE The debates o- 1M -oodsE Terminator technolo$)/ Ethical/ issues o- the Human 1enome ProjectE Ethical issues in 2harmaceutical dru$ researchE 5r2han dru$sE Mod4%e II Intellectual Pro2ert) :i$hts A De.elo2ment and need -or IP: in kno3led$e based industriesE 4arious t)2es o- intellectual Pro2ert) :i$hts 3ith e@am2les >Trademarks/ co2)ri$hts/ Industrial Desi$ns/ Patents/ 1eo$ra2hical Indicators etc? A 5bjecti.es o- the 2atent s)stem A ,asic Princi2les and 1eneral :eBuirements o- Patents > o.elt)/ ;tilit) on ob.iousnessE Etc? and tenets o- 2atent la3 A Product and 2rocess Patents? Mod4%e III The 2atentin$ 2rocess in India A E@ercisin$ and En-orcin$ o- intellectual Pro2ert) :i$htsE :i$hts o- IP: o3ner ,rie- o.er.ie3 o- Patent -ilin$ in IndiaE Criteria -or Patent in-rin$ement A 4arious 7mendments to Patent La3 in IndiaE Com2arison o- Patent La3 in India and the ;SE In e!n$ ion$% Con2en ions $nd !e$ ies= T:IPSE E.olution and 2resent statusE WIP5 and its -unctionin$E C,D Treat)E Paris and ,erne Con.entions En-orcement and Dis2ute Settlement in WT5 A Patent Coo2eration Treat) IP: and WT5 re$imeE Mod4%e I/ ,iotechnolo$ical in.entions and 2atent la3 A 2atentable subjects and 2rotection in biotechnolo$)E The 2atentabilit) o- microor$anisms A Diamond .s Chakrabart) Case A ,io2ros2ectin$ < ,io2irac) >Case studies o- eem / Turmeric / 7ro$)a2acha o- Gani Tribals in Gerala/:os) Peri3inkle o- Mada$ascar?Traditional kno3led$e S)stems >TGS? A 52tions -or 2rotection o- Traditional kno3led$e S)stemsE eed -or Sui 1enerics S)stemsE TGS and the ational and International 7renaE ,iodi.ersit) and 9armers ri$hts A IP: and Plant 1enetic :esources A Plant ,reeder :i$hts E;P54 Treat)E

Te6 Boo-s #E Ethical Issues in ,iotechnolo$)E Edited b) :ichard Sherlock and Hohn DEMorre)E %!!% Publishers Lanham/ Md= :o3man and Little-ieldE %E HE:ehm and 1E:eed/ ,iotechnolo$)/ Second Edition/ Multi 4olume Treatise/ 4olume #% Le$al Economic and Ethical Dimensions/ 4CHPublishersE &E Prabuddha 1an$uli Intellectual Pro2ert) :i$hts - ;nleashin$ the Gno3led$e Econom)E Tata McE1ra3 Hill Publishin$ Com2an) Limited/ e3 DelhiE (E ,eier/ 9EG/ Cres2i/:ES and Straus/ TE,iotechnolo$) and Patent 2rotection A 5@-ord and I,H Publishin$ CoE e3 DelhiE *E Sasson 7/ ,iotechnolo$ies and De.elo2ment/ ; ESC5 PublicationsE

+E He--re) ME1imble/ 7cademia to ,iotechnolo$)/ Else.ier/ 7cademic PressE

In e!n$% Con in4o4s Assessmen %Maximum Marks&'() +!I - Tests >minimum %? &!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!I - :e$ularit) in the class

Uni2e!si : E6$min$ ion 3$ e!n P7:T 7= -hort answer questions /K0 marks12( Marks 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE P7:T ,= Analytical . *roblem solving questions 4K/ marks10( Marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE P7:T C= *roblem solving questions.4K2( marks1 4( Marks T3o Buestions -rom each module 3ith choice to ans3er one BuestionE Maximum Total marks, 6(

Anda mungkin juga menyukai