You are on page 1of 139

SCHEME AND SYLLABI

FOR

THIRD TO EIGHTH SEMESTERS

OF

BACHELOR OF TECHNOLOGY
IN

INFORMATION TECHNOLOGY

FROM 2009 ADMISSION ONWARDS

CALICUT UNIVERSITY (P.O), THENHIPALAM

SCHEME OF STUDIES AND EXAMINATION FOR B. TECH DEGREE COURSE 2009 ADMISSION INFORMATION TECHNOLOGY Co !"#$% I & II S$ $'($)' (Co o# *o) +,, !)+#-.$') Code
E !" #!# E !" #!% E !" #!& EN09 103(P) E !" #!( EN09 104(P) E !" #!* E !" #!+ E !" #!' E !" #!0 EN09 109(P) EN09 110A(P) EN09 110#(P)

Hours / Week
L T D/P

Marks

Subject
En$ineerin$ Mathematics I En$ineerin$ Mathematics II En$ineerin$ Ph)sics Physics Lab En$ineerin$ Chemistr) Chemistry lab En$ineerin$ Mechanics ,asics o- Ci.il and Mechanical En$ineerin$ ,asics o- Electrical/ Electronics and Communication En$ineerin$ En$ineerin$ 1ra2hics Computer Programming in C echanical !or"shop Electrical an$ Ci%il !or"shops

Internal
&! &! &! *! &! *! &! &! &!

S emend
'! '! '! *! '! *! '! '! '! '! *! *! *!

Sem-end durationhours
& & & & & & & & & & & & &

Credits

% % % %

# # # #

% % % #

# # # & # % %

( ( & # & # ( ( ( & & % %

&! *! *! *!

To(+, /0 To(+, M+)3' /100

/0

12

T.")% S$ $'($) Code


E !" &!# E !" &!% IT!" &!& IT!" &!( IT!" &!* IT!" &!+ &'09 30((P) &'09 30*(P)

Hours / 3eek
L T P/D

Marks
Internal &! &! &! &! &! &! *! *! Semend '! '! '! '! '! '! *! *!

Sem - End Duration


Hours & & & & & & & &

Credits
( & * ( ( ( % %

Subject
En$ineerin$ Mathematics III Humanities and Communication Skills Data Structures Discrete Com2utational Structures Electronic Circuits S3itchin$ Theor) 4 Lo$ic Desi$n )igital Electronics Lab Programming Lab

& % ( & & & -

# # # # # # -

& &

To(+, /2 4 To(+, M+)3' 200

220

020

25

22

Fo6)(. S$ $'($) Code


E !" (!#5,6 E !" (!% IT!" (!& IT!" (!( IT!" (!* IT!" (!+ &'09 40((P) &'09 40*(P)

Hours/ Week
L T P/D

Marks Internal &! &! &! &! &! &! *! *! Semend '! '! '! '! '! '! *! *!

Subject
En$ineerin$ Mathematics I7 En.ironmental Studies Com2uter 8r$ani9ation 4 Desi$n Princi2les o- Communication En$ineerin$ Data Modelin$ :nd Desi$n Micro2rocessor ,ased Desi$n )ata +tructures Lab Programming En%ironments Lab

Sem-end Duration Hours & & & & & & & &

Credits

& % ( & & & -

# # # # # # -

& &

( & * ( ( ( % %

To(+, /2 4 To(+, M+)3' 200

220

020

25

22

I F"*(. S$ $'($) Code


IT!" *!# IT!" *!% IT!" *!& IT!" *!( IT!" *!* IT!" *!+ &'09 ,0((P) &'09 ,0*(P)

Hours / 3eek
L T P/D

Marks
Internal &! &! &! &! &! &! *! *! Semend '! '! '! '! '! '! *! *!

End- Sem Duration


Hours & & & & & & & &

Credits

Subject
So-t3are :rchitecture 4 Project Mana$ement Industrial Economics and 2rinci2les o- mana$ement Embedded s)stems 82eratin$ s)stems Di$ital data Communication Theor) o- Com2utation +ystems Lab -ar$.are Lab

( % & & & & -

# # # # # # -

& &

* & ( ( ( ( % %

To(+,

/2

220

020

25

22

To(+, M+)3' 200

S"7(. S$ $'($) Code


IT!" +!# IT!" +!% IT!" +!& IT!" +!( IT!" +!* IT!" +!+ &'09 /0((P) &'09 /0*(P)

Hours/Week
L T P/D

Marks Internal
&! &! &! &! &! &! *! *!

Subject
So-t3are ;ualit) mana$ement Com2iler Desi$n Com2uter et3orks Database Mana$ement S)stems Human Com2uter Interaction Electi.e I )atabase anagement Lab

Semend
'! '! '! '! '! '! *! *!

Sem-end Duration
Hours

Credits
* ( ( ( & ( % %

( & & & % & -

# # # # # # -

& &

& & & & & & & &

ini Pro0ect

To(+, /2 4 To(+, M+)3' 200

220

020

25

22

S$8$#(. S$ $'($) Code


IT!" '!# IT!" '!% IT!" '!& IT!" '!( IT!" '!* IT!" '!+ &'09 (0((P) &'09 (0*(P) &'09 (09(P)

Hours / 3eek
L T P/D

Marks
Internal &! &! &! &! &! &! & & # *! *! #!! Semend '! '! '! '! '! '! *! *! -

Subject
Com2uter 1ra2hics atural Lan$ua$e Processin$ :nd <no3led$e ,ased S)stems Internet Technolo$) Cr)2to$ra2h) and et3ork securit) Electi.e II Electi.e III Net.or" Programming Lab Computer 1raphics an$ $ia Lab Pro0ect ultime2

Sem-end duration Hours


& & & & & & & & -

Credits
* & & ( ( ( % % #

( % % & & & -

# # # # # # -

To(+,

/9

120

020

25

22

E":.(. S$ $'($) Code


IT!" 0!# IT!" 0!% IT!" 0!& IT!" 0!( &'09 *0,(P) &'09 *0/(P) &'09 *0((P)

Hours / 3eek
L T P/D

Marks
Internal &! &! &! &! #!! #!! Endsem '! '! '! '! #!!

Subject
Mobile Communication S)stem Hi$h S2eed et3orks Electi.e I7 Electi.e 7 +eminar Pro0ect 3i%a 3oce

Sem-end durationhours
& & & & -

Credits

( % & & -

# # # # -

& ## -

* & ( ( % ' &

To(+,

/2

/5

120

120

/2

22

L"'( O* E,$-("8$'
VI S$ $'($)
# % & ( * # % & ( * + ' 0 " #! ## #% #& #( #* #+ #' #0 #" %! # % & ( * + ' 0 " #! IT!" L!# IT!" L!% IT!" L!& IT!" L!( IT!" L!* IT!" L!+ IT!" L!' IT!" L!0 IT!" L!" IT!" L#! IT!" L## IT!" L#% IT!" L#& IT!" L#( IT!" L#* IT!" L#+ IT!" L#' IT!" L#0 IT!" L#" IT!" L%! IT!" L%# IT!" L%% IT!" L%& IT!" L%( IT!" L%* EE!" L%& EE!" L%* ME!" L%& EC!" L%* PE!" L%& CE!" L%& CE!" L%( ,T!" L%( CH!" L%& CH!" L%( Di$ital Si$nal Processin$ 82timi9ation Techni;ue In-ormation Theor) and codin$ Linear s)stem :nal)sis In-ormation =etrie.al

VII & VIII S$ $'($)


=eal Time Com2uter Control S)stems So-t Com2utin$ Di$ital Ima$e Processin$ 7LSI Desi$n Intelli$ent Com2utin$ 82tical Communication et3orks >ault Tolerant S)stems et3ork :dministration :nd Mana$ement e- ,usiness Pattern =eco$nition ,io- In-ormatics Parallel :rchitecture :nd :l$orithms Desi$n 4 :nal)sis o- :l$orithms eural et3orks :nd >u99) lo$ic 1rid Com2utin$ ,luetooth technolo$) Industrial Ps)cholo$) Distributed S)stems (G,o!+, E,$-("8$;I *)o IT ) Mana$ement In-ormation S)stems (G,o!+, E,$-("8$;II *)o IT) 1ra2h theor) and Combinatorics (G,o!+, E,$-("8$;III *)o IT)

G,o!+, E,$-("8$'
Process Control and Instrumentation =obotics 4 :utomation Industrial Sa-et) En$ineerin$ ,iomedical Instrumentation Total ?ualit) Mana$ement E@2erimental Stress :nal)sis =emote Sensin$ and 1IS ,io-ethics and Intellectual Pro2ert) =i$hts ano materials and anotechnolo$) Industrial Pollution Control

EN09 10/< E#:"#$$)"#: M+(.$ +("-' III


5Common -or all branches6 T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives This course provides a quick overview of the concepts and results in complex analysis that may be useful in engineering. Also it gives an introduction to linear algebra and Fourier transform which are wealths of ideas and results with wide area of application

Mo%6,$ I< F6#-("o#' o* + Co =,$7 V+)"+!,$ (/1 .o6)') >unctions o- a Com2le@ 7ariable A Limit A Continuit) A Deri.ati.e o- a Com2le@ -unction A :nal)tic -unctions A Cauch)-=iemann E;uations A La2lace e;uation A Harmonic >unctions A Con-ormal Ma22in$ A E@am2lesB Cn/ sin9/ cos9/ sinh9/ cosh9/ 59D#/C 6 A Mobius Trans-ormationE Mo%6,$ II< F6#-("o#' o* + Co =,$7 V+)"+!,$ (/1 .o6)') De-inition o- Line inte$ral in the com2le@ 2lane A Cauch)Fs inte$ral theorem 5Proo- o- e@istence oinde-inite inte$ral to be omitted6 A Inde2endence o- 2ath A Cauch)Fs inte$ral -ormula A Deri.ati.es oanal)tic -unctions 5Proo- not re;uired6 A Ta)lor series A Laurent series A Sin$ularities and Ceros A =esidues A =esidue Inte$ration method A =esidues and =esidue theorem A E.aluation o- real inte$ralsE Mo%6,$ III< L"#$+) A,:$!)+ (/1 .o6)') ; Proo-s not re;uired 7ector s2aces A De-inition/ E@am2les A Subs2aces A Linear S2an A Linear Inde2endence A Linear De2endence A ,asis A Dimension A 8rdered ,asis A Coordinate 7ectors A Transition Matri@ A 8rtho$onal and 8rthonormal Sets A 8rtho$onal and 8rthonormal ,asis A 1ram-Schmidt ortho$onolisation 2rocess A Inner 2roduct s2aces AE@am2lesE Mo%6,$ IV< Fo6)"$) T)+#'*o) ' (/1 .o6)') >ourier Inte$ral theorem 5Proo- not re;uired6 A >ourier Sine and Cosine inte$ral re2resentations A >ourier Trans-orms A >ourier Sine and Cosine Trans-orms A Pro2erties o- >ourier Trans-ormsE

T$7( Boo3' Mo%6,$ I< Er3in <re)si$/ Advanced Engineering Mathematics !e Gohn Wile) and Sons/ IncE SectionsB #%E&/ #%E(/ #%E*/ #%E+/ #%E'/ #%E" Mo%6,$ II< Er3in <re)si$/ Advanced Engineering Mathematics !e Gohn Wile) and Sons/ IncE SectionsB #&E#/ #&E%/ #&E&/ #&E(/ #(E(/ #*E#/ #*E%/ #*E&/ #*E( Mo%6,$ III< ,ernaed <olman/ Da.id = Hill/ "ntroductory #inear Algebra An Applied First $ourse Pearson EducationE SectionsB +E#/ +E%/ +E&/ +E(/ +E'/ +E0/ :22endi@E,E# Mo%6,$ IV< W)lie CE= and LECE ,arrett/ Advanced Engineering Mathematics/ Mc1ra3 HillE SectionsB "E#/ "E&/ "E*

R$*$)$#-$ !oo3' #E H S <asana/ $omplex 7ariables Theory and Applications %e/ Prentice Hall o- IndiaE %E Gohn M Ho3ie/ $omplex Analysis S2rin$er International EditionE &E Shahna9 bathul/ Textbook of Engineering Mathematics -pecial functions and $omplex
7ariables Prentice Hall o- IndiaE

(E 1erald Dennis Mahan/ Applied mathematics/ S2rin$er International EditionE *E Da.id To3ers/ 8uide to #inear Algebra/ MacMillan Mathematical 1uidesE +E Ho3ard :nton/ Chris =orres/ Elementary #inear Algebra Applications 7ersion 9e/ Gohn Wile)
and SonsE 'E :nthon) Cro-t/ =obert Da.ison/ Martin Har$rea.es/ Engineering Mathematics/ &e/ Pearson EducationE 0E H Parthasarath)/ Engineering Mathematics A *ro:ect ; *roblem based approach :ne ,ooks IndiaE "E , 7 =amana/ <igher Engineering Mathematics Mc1ra3HillE #!E Sar.es3ara =ao <oneru/ Engineering Mathematics/ Ini.ersities PressE ##E G < Sharma/ 3usiness Mathematics Theory and Applications :ne ,ooks IndiaE #%E Gohn bird/ <igher Engineering Mathematics/ Else.ier/ e3nesE #&E M Chandra Mohan/ 7ar$hese Phili2/ Engineering Mathematics&7ol. " "" """ ; "7./ San$uine Technical PublishersE #(E ,ali/ M 1o)al/ C Watkins/ Advanced Engineering Mathematics A $omputer Approach 6e In-init) Science Press/ >ire Wall MediaE #*E 7 = Lakshm) 1ort)/ Advanced Engineering Mathematics&7ol. " ""./ :ne ,ooks IndiaE #+E Sastr) SESE/ Advanced Engineering Mathematics&7ol. " and ""E/ Prentice Hall o- IndiaE #'E Lar) C :ndre3s/ ,himsen < Shi.amo$$i/ "ntegral Transforms for Engineers/ Prentice Hall oIndia I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

EN09 102< H6 +#"("$' +#% Co


T$+-."#: '-.$ $ % hours lecture and # hour tutorial 2er 3eek

6#"-+("o# S3",,'
C)$%"('< &

5Common -or all branches6

Objectives To identify the most critical issues that confronted particular periods and locations in history To identify stages in the development of science and technology To understand the purpose and process of communication To produce documents reflecting different types of communication such as technical descriptions proposals and reports To develop a positive attitude and self&confidence in the workplace and To develop appropriate social and business ethics.

Mo%6,$ I (2 .o6)') Humanities/ Science and Technolo$)B Im2ortance o- humanities to technolo$)/ education and societ)Im2act o- science and technolo$) on the de.elo2ment o- modern ci.ili9ationE- Contributions o- ancient ci.ili9ationB Chinese/ Indian/ E$)2tian and 1reekE -Cultural/ Industrial/ Trans2ortation and Communication re.olutionsE :d.ances in modern IndiaB :chie.ements in in-ormation/ communication and s2ace technolo$iesE Mo%6,$ II (// .o6)') Conce2t o- communicationB The s2eaker/3riter and the listener/reader/ medium o- communication/ barriers to communication/ accurac)/ bre.it)/ clarit) and a22ro2riateness =eadin$ com2rehensionB =eadin$ at .arious s2eeds/ di--erent kinds o- te@t -or di--erent 2ur2oses/ readin$ bet3een linesE Listenin$ com2rehensionB Com2rehendin$ material deli.ered at -ast s2eed and s2oken material/ intelli$ent listenin$ in inter.ie3s S2eakin$B :chie.in$ desired clarit) and -luenc)/ mani2ulatin$ 2aralin$uistic -eatures o- s2eakin$/ task oriented/ inter2ersonal/ in-ormal and semi -ormal s2eakin$/ makin$ a short classroom 2resentationE 1rou2 discussionB Ise o- 2ersuasi.e strate$ies/ bein$ 2olite and -irm/ handlin$ ;uestions and takin$ in criticisms on sel-/ turn-takin$ strate$ies and e--ecti.e inter.ention/ use o- bod) lan$ua$eE Mo%6,$ III (// .o6)') Written CommunicationB ote makin$ and takin$/ summari9in$/ notes and memos/ de.elo2in$ notes into te@t/ or$ani9ation o- ideas/ cohesion and coherence/ 2ara$ra2h 3ritin$/ orderin$ in-ormation in s2ace and time/ descri2tion and ar$ument/ com2arison and contrast/ narratin$ e.ents chronolo$icall)E Writin$ a rou$h dra-t/ editin$/ 2roo- readin$/ -inal dra-t and st)lin$ te@tE Technical re2ort 3ritin$B S)no2sis 3ritin$/ -ormats -or re2ortsE Introductor) re2ort/ Pro$ress re2ort/ Incident re2ort/ >easibilit) re2ort/ Marketin$ re2ort/ >ield re2ort and Laborator) test re2ort Project re2ortB =e-erence 3ork/ 1eneral objecti.e/ s2eci-ic objecti.e/ introduction/ bod)/ illustrations usin$ $ra2hs/ tables/ charts/ dia$rams and -lo3 chartsE Conclusion and re-erences Pre2aration o- lea-lets/ brochure and CE7E Mo%6,$ IV (9 .o6)') Human relations and Pro-essional ethicsB :rt o- dealin$ 3ith 2eo2le/ em2ath) and s)m2ath)/ hearin$ and listenin$E Tension and stress/ Methods to handle stress =es2onsibilities and ri$hts o- en$ineers- colle$ialit) and lo)alt) A =es2ect -or authorit) A Con-identialit) A con-licts o- interest A Pro-essional ri$hts/ =i$hts o- in-ormation/ Social res2onsibilit)E Senses o- ethics A .ariet) o- moral issues A Moral dilemma A Moral autonom) A :ttributes o- an ethical 2ersonalit) A ri$ht action A sel- interest

R$*$)$#-$ Boo3' #E Meenakshi =aman and San$eeta Sharma/ Technical $ommunication & *rinciples and *ractice 8@-ord Ini.ersit) 2ress/ %!!+ %E Ga)ashree Suresh and , S =a$ha.an/ *rofessional Ethics/ S Chand and Com2an) Ltd/ %!!* &E Subra)a22a/ <istory of -cience in "ndia/ ational :cadem) o- Science/ India (E = C ,hatia/ 3usiness $ommunication/ :ne ,ooks P.tE Ltd/ %!!" *E Sunita Mishra and C Muralikrishna/ $ommunicatin -kils for Engineers/ Pearson Education/ %!!'E +E Go.an .an Emden and Lucinda ,ecker/ Effective $ommunication for Arts and <umanities -tudents/ Pal$ra.e macmillam/ %!!" 'E W C Dam2ier/ <istory of -cience/ Cambrid$e Ini.ersit) Press 0E 7esilind/ Engineering Ethics and the Environment/ Cambrid$e Ini.ersit) Press "E Larson E/ <istory of "nventions/ Thom2son Press India LtdE #!E ,ernal GED/ -cience in <istory/ Pen$uin ,ooks Ltd ##E Enc)clo2edia ,ritannica/ <istory of -cience <istory of Technology #%E ,ro3noski G/ -cience and <uman 7alues/ Har2er and =o3 #&E Schrodin$er/ =ature and 8reeks and -cience and <umanism/ Cambrid$e Ini.ersit) Press

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 101< D+(+ S()6-(6)$'


T$+-."#: '-.$ $ ( hours lecture and # hour tutorial 2er 3eek C)$%"('< *

Objectives To impart the basic concepts of continuous data structures To develop understanding about fundamental searching and sorting techniques.

Mo%6,$ I (// .o6)') =e.ie3 o- Data T)2es- Scalar T)2es - Primiti.e t)2es - Enumerated t)2es-Subran$es - :rra)s- s2arse matrices - re2resentation - =ecords - Com2le@it) o- :l$orithms - Time 4 S2ace Com2le@it) o- :l$orithms -=ecursionB =ecursi.e al$orithms - :nal)sis o- =ecursi.e al$orithms Mo%6,$ II (/2 .o6)') Linear Data Structures - Stacks - ?ueues-Lists - De;ueus - Linked List - sin$l)/ doubl) and circular lists :22lication o- linked lists - Pol)nomial Mani2ulation - Stack 4 ?ueue im2lementation usin$ :rra) 4 Linked List - T)2ical 2roblems - Con.ersion o- in-i@ to 2ost-i@ - E.aluation o- 2ost-i@ e@2ression - 2riorit) ;ueues Mo%6,$ III (/2 .o6)') on Linear Structures - 1ra2hs - Trees - 1ra2h 4 Tree im2lementation usin$ arra) 4 Linked List - ,inar) trees - ,inar) tree tra.ersals - 2re-order/ in-order 4 2ostorder - Threaded binar) trees - ,inar) Search trees :7L trees - , trees and ,D trees-1ra2h tra.ersals - D>S/ ,>S - shortest 2ath - DijkstraFs al$orithm/ Minimum s2annin$ tree - <ruskal :l$orithm/ 2rims al$orithm Mo%6,$ IV (/2 .o6)') Searchin$ - Se;uential Search - Searchin$ :rra)s and Linked Lists - ,inar) Searchin$ - Searchin$ arra)s and ,inar) Search Trees - Hashin$ - 82en 4 Closed Hashin$-Hash -unctions - =esolution o- Collision -Sortin$-n% Sorts - ,ubble Sort - Insertion Sort - Selection Sort - n lo$ n Sorts - ?uick Sort - Hea2 Sort Mer$e Sort - E@ternal Sort - Mer$e >iles

Text Books #E :ho :E7/ Ho2cro-t GEEE 4 Illman GED/ 5ata -tructures and Algorithms/ :ddison Wesle) R$*$)$#-$ Boo3' #E Sahni S/ 5ata -tructures Algorithms ; Applications in $>> Mc1ra3Hill %E Wirth / Algorithms > 5ata -tructures1*rograms Prentice HallE &E Cormen TEH/ Leiserson CEE 4 =i.est =EL/ "ntroduction to Algorithms in $>>/ Thomson ,rooksE (E Desh2ande PES/ <akde 8E1/ $ and 5ata -tructures/ Dream- tech India P.tE LtdE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 105< D"'-)$($ Co =6(+("o#+, S()6-(6)$'


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives

This course provides the mathematical foundations required in any stream of study in $omputing. The material covered is essential for most of the subsequent semesters for a sound understanding of the various algorithms and methods. At the end of the course the student is expected to be familiar with the essential proof techniques logic and useful mathematical ob:ects.

Mo%6,$ I (/1 .o6)') Lo$ic - Lo$ical connecti.es and Truth tables A Lo$ical e;ui.alence and la3s o- lo$ic A Lo$ical im2lication and rules o- in-erence- ?uanti-iers A Proo-s o- theorems usin$ rules o- uni.ersal s2eci-ication and uni.ersal $enerali9ationE Mo%6,$ II (/1 .o6)') =elational Structures - Cartesian 2roducts A =elations A =elation matrices A Pro2erties o- relations A Com2osition o- relations- E;ui.alence relations and 2artitions- >unctions A 8ne-to-one/ onto -unctions A Com2osition o- -unctions and in.erse -unctions- Partial orders- Hasse dia$ramsE Mo%6,$ III (/1 .o6)') 1rou2 Theor) - De-inition and elementar) 2ro2erties- C)clic $rou2s- Homomor2hisms and Isomor2hisms Sub$rou2s- Cosets and La$ran$eFs theorem-Elements o- codin$ theor)- Hammin$ metric-1enerator matrices-1rou2 codes- Hammin$ matricesE Mo%6,$ IV (/1 .o6)')

=ecurrence =elations-Introduction/ Linear recurrence relations 3ith constant coe--icients-Homo$eneous solutions-Particular solutions-Total solutions 1eneratin$ >unction-solutions o- recurrence relations b) the method o- $eneratin$ -unctionsE

Text Books #E =al2h P 1rimaldi/ 5iscrete and $ombinatorial Mathematics, An applied introduction %Fourth Edition) Pearson Education/ %!!(E R$*$)$#-$ Boo3' #E Thomas <osh)/ Discrete Mathematics 3ith :22lications/ :cademic Press/Else.ier/ %!!* %E Trembla)/ G P 4 Manohar/=/ 5iscrete and Mathematical -tructures with Applications to &E $omputer -cience/ Mc1ra3 Hill ,ook Com2an)E (E <olman , 4 ,usb) = C/ 5iscrete and Mathematical -tructures for $omputer -cience/ Prentice Hall o- IndiaE *E CELE Liu/ Elements of 5iscrete Mathematics Tata Mc1ra3 Hill/ %!!% +E Donald > Stanat 4 Da.id > Mc :llister/ 5iscrete and Mathematical -tructures in $omputer -cience/ Prentice HallE 'E Truss G </ 5iscrete Mathematics for $omputer -cientists/ Pearson Education/ %!!#E

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 100< E,$-()o#"- C")-6"('


5Common 3ith CS!" &!*6 T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives

To introduce the concepts and working principles of electronic circuits essential for the computing field.

Mo%6,$ I (/5 .o6)') Diode s3itch/ cli22in$ and clam2in$ circuits A T)2es o- Diodes - li$ht emittin$ diodes - 2hoto diode - o2to cou2ler - laser diode - the schottk) diode - .aractor diodes - .aristors - current-re$ulator diodes - ste2 reco.er) diodes - back diodes - tunnel diodes - 2in diodes A Transistors - Transistor s3itch and am2li-ier circuits A ,istable multi.ibrator - Schmitt tri$$er - Monostable and astable multi.ibrator Mo%6,$ II (/0 .o6)') M8S>ETs - De2letion mode M8S>ET - De2letion mode M8S>ET :m2li-iers - Dual 1ate D-M8S>ETs Enhancement-mode M8S>ET - Drain characteristics o- E-M8S>ET - Di$ital s3itchin$ - CM8S circuits A on-linear 82-am2 circuits - Com2arators 3ith Cero =e-erence 7olta$e - Com2arators 3ith on-9ero re-erences - Com2arator 3ith h)sterisis - Windo3 com2arator - Inte$rator - Wa.e-orm con.ersion 3ith o2am2 - 3a.e-orm $eneration usin$ o2-am2 Mo%6,$ III (/0 .o6)') Lo$ic le.els - Conce2ts o- SSI/ MSI/ LSI and 7LSI - Lo$ic -amiliesB Inter-acin$ - Com2arison o- lo$ic -amilies - TTL and/ M8S -li2--lo2sE 8T $ate/ TTL/ ECL/ CM8S lo$ic -

Mo%6,$ IV (/1 .o6)') MemoriesB ,asic conce2ts - =ead onl) memories - Pro$rammable =8Ms - Static and d)namic random access memories - Memor) e@2ansion - Ma$netic bubble memories - Ma$netic sur-ace stora$e de.ices CD-=8Ms - S2ecial memories -# Sam2le and hold circuit - D/: con.erters - :/D con.erters - Timin$ circuitsE

Text Books attarasu/ Electronic $ircuits, $omputer Engineer?s *erspective/ San$uine Technical Publishers/ %!!0 5Module I 4 II6 %E Taub HE 4 Schillin$ DE/ 5igital "ntegrated Electronics/ Mc1ra3 Hill 5Modules III 4 I76
#E Mahade.as3am) IE, 4 7E

R$*$)$#-$ Boo3' #E a$arath IE GE/ Electronics Analog ; 5igital Prentice Hall India %E >lo)d TELE/ 5igital Fundamentals/ Ini.ersal ,ook Stall &E Schillin$ DELE 4 ,elo.e C/ Electronic $ircuits, 5iscrete ; "ntegrated/ Mc1ra3 HillE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 104< S?"(-."#: T.$o)> +#% Lo:"- D$'":#


5Common 3ith CS!" &!+6 T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives To introduce the principles features and properties of digital devices and circuits. This course provides the basic concepts of computations and logic designs of Arithmetic #ogic @nit %A#@) of a $omputer. 3ooks have been carefully chosen to get examples from diverse computing application for practice along with theory.

Mo%6,$ I (/1 .o6)') umber S)stems and codes - ,oolean al$ebra - Postulates and theorems -Constants/ .ariables and -unctions - S3itchin$ al$ebra - Electronic $ates and mechanical contacts ,oolean -unctions and lo$ical o2erations ormal and canonical -orms - Sel--dual -unctions - Lo$ical o2erations - <arnau$h ma2 - 2rime cubes Minimum sum o- 2roducts and 2roduct o- sums - ?uine-McClusk) al$orithmE Mo%6,$ II (/1 .o6)') Combinational Lo$ic - :nal)sis and desi$n o- combinational lo$ic circuits -Ini.ersal 2ro2ert) o- the : D and 8= $ates - :dders - Parallel adders and look-ahead adders - Com2arators -Decoders and encoders - Code con.ersion -Multi2le@ers and demulti2le@ers - Parit) $enerators and checkers - =8Ms/ PL:sE Mo%6,$ III (/1 .o6)') >ault dia$nosis and tolerance - >ault classes and models - >ault dia$nosis and testin$ - Test $eneration >ault table method - Path sensiti9ation method -,oolean di--erence method - >ault-tolerance techni;uesE

Pro$rammable lo$ic arra)s - PL: minimi9ation - Essential 2rime cube theorem - PL: -oldin$ A Desi$n -or testabilit)E Mo%6,$ IV (/1 .o6)') Counters and shi-t re$isters - S=/ G</ D and T -li2--lo2s - E@citation tables -Tri$$erin$ o- -li2--lo2s - >li2-lo2 a22lications - Latches - =i22le counters - S)nchronous counters - I2-do3n counters - Desi$n ose;uential circuits - Counter decodin$ - Counter a22lications - Shi-t re$isters and their a22lications - Clock mode se;uential machine - State tables and dia$ramsE Text Books
#E ,is3as E E/ #ogic 5esign Theory/ Prentice Hall o- India 5Modules I/ II 4 III6 %E >lo)d TELE/ 5igital Fundamentals/ Ini.ersal ,ook Stall 5module I76E

R$*$)$#-$ Boo3' #E <oha.i CE/ -witching ; Finite Automata Theory/ Tata Mc1ra3 Hill %E Millman GE 4 Halkias CECE/ "ntegrated Electronics, Analog ; 5igital $ircuits ; -ystems/ Tata Mc1ra3 HillE &E MEMorris Mano/ Charles =E <ime/ Lo$ic and $omputer 5esign Fundamentals/ Pearson EducationE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 109(P)< D":"(+, $,$-()o#"-' L+!


T$+-."#: '-.$ $ & hours 2ractical 2er 3eek

C)$%"('< %

Objectives This course gives hands on experience on digital electronics components and systems which are fundamental building blocks of the $omputer systems. Experiments are structured to cover extensively the characteristics and features of indispensable digital electronic circuits and systems

#E Combinational circuits :ddress/ MIK- DEMIK/ Encoders Decoders/ and Desi$n usin$ =8ME %E Stud) o- >li2 >lo2s usin$ $ates and >li2 >lo2 ICsE &E =i22le counters - Desi$n o- di--erent se;uencesE (E Clocked se;uential circuits - Desi$nE *E S)nchronous counters - Desi$nE +E Shi-t =e$isters - =i$ht/ Le-t/ Serial/ ParallelE 'E ' - Se$ment dis2la) s)stems 5With Counters and Decoders6E 0E Desi$n o- combinatorial and se;uential circuits usin$ PL:s and P:LsE

"E :stable M7 and Schmitt Tri$$er usin$ $ates/ :22lications o- *** as :M7/ MM7 and >re;uenc)
di.iderE

R$*$)$#-$ Boo3' #E <E a3as / Electronics #ab Manual

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&/() +!H-Laborator) 2ractical and record &!H- Tests #!H- =e$ularit) in the class

IT09 102(P)< P)o:)+


T$+-."#: '-.$ $ & hours 2ractical 2er 3eek

"#: L+!
C)$%"('< %

5Common 3ith CS!" &!05P66

Objectives To give a strong foundation for developing the art of programming to the students of computing streams. For adequacy this has to be complemented by exercises appearing in the references.

S$( / (1 ,+! '$''"o#') HC> 5EuclidLs al$orithm6 and LCM o- $i.en numbers - >ind mean - Median and mode o- a $i.en set onumbers - Con.ersion o- numbers -rom binar) to decimal/ he@adecimal/ octal and back - E.aluation o-unctions like e@/ sin5@6 and cos5@6 -or a $i.en numerical 2recision usin$ Ta)lorLs series - Testin$ 3hether a $i.en number is 2rimeE S$( 2 (2 ,+! '$''"o#') Strin$ mani2ulation 2ro$ramsB sub-strin$ search/ deletion - Le@ico$ra2hic sortin$ o- a $i.en set o- strin$s 1eneration o- all 2ermutations o- the letters o- a $i.en strin$ usin$ recursionE S$( 1 (2 ,+! '$''"o#') Matri@ o2erationsB Pro$rams to -ind the 2roduct o- t3o matrices - In.erse and determinant 5usin$ recursion6 o- a $i.en matri@ - Solution to simultaneous linear e;uations usin$ Gordan elimination S$( 5 (1 ,+! '$''"o#') >ilesB Ise o- -iles -or storin$ records 3ith 2ro.ision -or insertion - Deletion/ search/ sort and u2date o- a record

R$*$)$#-$ Boo3' #E Schildt HE/ $ The $omplete +eference/ Tata Mc1ra3 Hill %E TanHEHE 4DL8ra9ioTE,E/ $ *rogramming for Engineering ; $omputer -cience/ Mc1ra3 Hill &E Cormen TEHE et al/ "ntroduction to Algorithms/ Prentice Hall o- India

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&/() +!H-Laborator) 2ractical and record &!H- Tests #!H- =e$ularit) in the class

EN09 50/B< E#:"#$$)"#: M+(.$ +("-' IV


5Common -or IC/ EC/ EE/ :I/ ,M/ CS/ and IT6 T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives

To inculcate the students an adequate understanding of the basic concepts of probability theory to make them develop an interest in the area which may find useful to pursue their studies. To stimulate the students understanding of the A&transform. A study of some important partial differential equations is also included to make the student get acquainted with the basics of *5E.

Mo%6,$ I @ P)o!+!","(> D"'()"!6("o#' ; (/2 .o6)') =andom .ariables A Mean and 7ariance o- 2robabilit) distributions A ,inomial Distribution A Poisson Distribution A Poisson a22ro@imation to ,inomial distribution A H)2er 1eometric Distribution A 1eometric Distribution A Probabilit) densities A ormal Distribution A Ini-orm Distribution A 1amma DistributionE Mo%6,$ II @ A ()+#'*o) ' ; (/5 .o6)') Introduction A The C trans-orm A C trans-orm and =e$ion o- Con.er$ence 5=8C6 o- -inite duration se;uences A Pro2erties o- =8C A Pro2erties o- C-Trans-ormsB Linearit)/ Time Shi-tin$/ Multi2lication b) e@2onential se;uence/ Time re.ersal/ Multi2lication b) n/ Con.olution/ Time E@2ansion/ Conju$ation/ Initial 7alue Theorem/ >inal 7alue Theorem A Methods to -ind in.erse trans-orms A lon$ di.ision method A 2artial -raction method A residue method A Solutions o- di--erence e;uations usin$ C Trans-ormsE Mo%6,$ III ; S$)"$' 'o,6("o#' o* %"**$)$#("+, $B6+("o#' ; (/5 .o6)') Po3er series method -or sol.in$ ordinar) di--erential e;uations A Le$endreFs e;uation A Le$endre 2ol)nomials A =odri$ueFs -ormula A 1eneratin$ -unctions A =elation bet3een Le$endre 2ol)nomials A 8rtho$onalit) 2ro2ert) o- Le$endre 2ol)nomials 5Proo- not re;uired6 A >robenius method -or sol.in$ ordinar) di--erential e;uations A ,esselFs e;uation A ,essel -unctions A 1eneratin$ -unctions A =elation bet3een ,essel -unctions A 8rtho$onalit) 2ro2ert) o- ,essels -unctions 5Proo- not re;uired6E Mo%6,$ IV ; P+)("+, D"**$)$#("+, EB6+("o#' ; (/2 .o6)') Introduction A Solutions o- e;uations o- the -orm >52/;6 M! N >5@/2/;6 M! N >5)/2/;6 M! N >59/2/;6 M! N >#5@/;6 M >%5)/;6 N ClairautFs -orm/ 9 M 2@ D ;. D >52/;6 N Le$ran$eFs -orm/ P2 D ?; M = A Classi-ication o- Linear PDEFs A Deri.ation o- one dimensional 3a.e e;uation and one dimensional heat e;uation A Solution o- these e;uation b) the method o- se2aration o- .ariables A DF:lembertFs solution oone dimensional 3a.e e;uationE

Text Books T$7( Boo3' Mo%6,$ IB =ichard : Gohnson/ C, 1u2ta/ Miller and Freund?s *robability and statistics for Engineers 6e/ Pearson Education - SectionsB (E#/ (E%/ (E&/ (E(/ (E+/ (E0/ *E#/ *E%/ *E*/ *E' Mo%6,$ IIB P =amesh ,abu/ = :nanda atarajan/ -ignals and S)stems/ %e/ Scitech PublicationsE SectionsB #!E#/ #!E%/ #!E&/ #!E(/ #!E*E#/ #!E*E%/ #!E*E&/ #!E*E(/ #!E*E*/ #!E*E+/ #!E*E'/ #!E*E0/ #!E*E#%/ #!E*E#&/ #!E+/ #!E#! Mo%6,$ IIIB Er3in <re)si$/ Advanced Engineering Mathematics !e Gohn Wile) and Sons/ IncE SectionsB (E#/ (E&/ (E(/ (E* Mo%6,$ IVB ,ali/ M 1o)al/ C Watkins/ Advanced Engineering Mathematics A $omputer Approach 6e In-init) Science Press/ >ire Wall MediaE SectionsB #+E#/ #+E%/ #+E&/ #+E(/ #+E*/ #+E+/ #+E'/ #+E0/ #+E" Er3in <re)si$/ Advanced Engineering Mathematics !e Gohn Wile) and Sons/ IncE #E SectionsB ##E%/ ##E&/ ##E(/ "E0 E@E&/ ##E* R$*$)$#-$ !oo3' #E William Hines/ Dou$las Mont$omer)/ a.id 1oldman/ Connie ,orror/ *robability and -tatistics in Engineering (e Gohn Wile) and Sons/ IncE %E Sheldon M =oss/ "ntroduction to *robability and -tatistics for Engineers and -cientists &e/ Else.ier/ :cademic PressE &E :nthon) Cro-t/ =obert Da.ison/ Martin Har$rea.es/ Engineering Mathematics/ &e/ Pearson EducationE (E H Parthasarath)/ Engineering Mathematics A *ro:ect ; *roblem based approach :ne ,ooks IndiaE *E , 7 =amana/ <igher Engineering Mathematics Mc1ra3HillE +E Sar.es3ara =ao <oneru/ Engineering Mathematics/ Ini.ersities PressE 'E G < Sharma/ 3usiness Mathematics Theory and Applications :ne ,ooks IndiaE 0E Gohn bird/ <igher Engineering Mathematics/ Else.ier/ e3nesE "E M Chandra Mohan/ 7ar$heese Phili2/ Engineering Mathematics&7ol. " "" """ ; "7./ San$uine Technical PublishersE #!E W)lie CE= and LECE ,arret/ Advanced Engineering Mathematics/ Mc1ra3 HillE ##E 7 = Lakshm) 1ort)/ Advanced Engineering Mathematics&7ol. " ""./ :ne ,ooks IndiaE #%E Sastr) SESE/ Advanced Engineering Mathematics&7ol. " and ""E/ Prentice Hall o- IndiaE #&E Michael D 1reenber$/ Advanced Engineering Mathematics/ Pearson EducationE #(E Lar) C :ndre3s/ ,himsen < Shi.amo$$i/ "ntegral Transforms for Engineers/ Prentice Hall oIndiaE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

EN09 502< E#8")o# $#(+, S(6%"$'


T$+-."#: '-.$ $ % hours lecture and # hour tutorial 2er 3eek C)$%"('< &

Objectives To understand the problems of pollution loss of forest solid waste disposal degradation of environment loss of biodiversity and other environmental issues and create awareness among the students to address these issues and conserve the environment in a better way.

Mo%6,$ I (/0 .o6)') The Multidisci2linar) nature o- en.ironmental science/ De-inition-sco2e and im2ortance-need -or 2ublic a3arenessE atural resources/ =ene3able and non-rene3able resourcesB atural resources and associated 2roblems--orest resourcesB Ise and o.er e@2loitation/ de-orestation/ case studiesE Timber e@traction/ minin$/ dams and their de-ects on -orests and tribal 2eo2leE- 3ater resources B Ise and o.er utili9ation o- sur-ace and $round 3ater/ -loods/ drou$ht/ con-licts o.er 3ater/ dams-bene-its and 2roblems - Mineral resourcesB Ise and e@2loitation/ en.ironmental e--ects o- e@tractin$ and usin$ mineral resources/ case studies - >ood resourcesB World -ood 2roblems/ chan$es caused b) a$riculture o.er $ra9in$/ e--ects o- modern a$riculture/ -ertili9er-2esticide 2roblems/ 3ater lo$$in$/salinit)/case studies -Ener$) resourcesB 1ro3in$ ener$) needs/ rene3able and non-rene3able ener$) resources/ use o- alternate ener$) resources/ Land resourcesB Land as a resource/ land de$radation/ man induced land slides/ soil erosion and deserti-icationE

Mo%6,$ II (/0 .o6)') Ecos)stems-Conce2t o- an ecos)stem-structure and -unction o- an ecos)stem A 2roducers/ consumers/ decom2osers-ener$) -lo3 in the ecos)stem-Ecolo$ical succession- >ood chains/ -ood 3ebs and Ecolo$ical 2)ramids-Introduction/ t)2es/ characteristics -eatures/ structure and -unction o- the -ollo3in$ ecos)stem>orest ecos)stem- 1rassland ecos)stem ADesert ecos)stem-:;uatic ecos)stem 52onds/ streams/ lakes/ ri.ers/ oceans/ estuaries6 ,iodi.ersit) and its consideration Introduction- De-initionB $enetic/ s2ecies and ecos)stem di.ersit)-,io$eo$ra2hicalN classi-ication o- India A .alue o- biodi.ersit)B consum2ti.e use/ 2roducti.e use/ social ethical/ aesthetic and o2tion .alues ,iodi.ersit) at 1lobal/ national/ and local le.el-India at me$a Adi.ersit) nation- Hot s2ot o- biodi.ersit)Threats to biodi.ersit)B habitat loss/ 2oachin$ o- 3ild li-e/ man/ 3ild li-e con-licts AEndan$ered and endemic s2ecies o- India-Conser.ation o- biodi.ersit)B In-situ and E@-situ conser.ation o- biodi.ersit)E Mo%6,$ III (/0 .o6)') En.ironmental 2ollution De-inition-Causes/ e--ects and control measures o- :ir 2ollution-m Water 2ollution Asoil 2ollution-Marine 2ollution- oise 2ollution-Thermal 2ollution- uclear ha9ards-Solid 3aste mana$ementB Causes/ e--ects and control measures o- urban and industrial 3astes-=ole o- an indi.idual in 2re.ention o- 2ollution-2ollution case studies-Disaster mana$ementB -loods/ earth ;uake/ c)clone and landslides-En.ironmental im2act assessment Mo%6,$ IV (9 .o6)') En.ironment and sustainable de.elo2ment-Sustainable use o- natural resources-Con.ersion o- rene3able ener$) resources into other -orms-case studies-Problems related to ener$) and Ener$) auditin$-Water conser.ation/ rain 3ater har.estin$/ 3ater shed mana$ement-case studies-Climate chan$e/ $lobal 3armin$/ acid rain/ o9one la)er de2letion/ nuclear accidents and holocaust-Waste land reclamation-Consumerism and 3aste 2roducts-=educe/ reuse and rec)clin$ o- 2roducts-7alue educationE Text Books Clark/=ESE/ Marine pollution/ Clanderson Press 8@-ordE Mhaskar :E <E/ Matter <aBrdous/ Techno-science PublicationsE Miller TE 1E GrE/ Environmental -cience/ Wads3orth Publishin$ CoE To3nsend CE/ Har2er G/ Michael ,e$on/ Essential of Ecology/ ,lack3ell Science Tri.edi =E <E/ 1oel PE <E/ "ntroduction to Air *ollution/ Techno-Science PublicationsE

#E %E &E (E *E

R$*$)$#-$ Boo3' #E =a$ha.an ambiar/</ Text book of Environmental -tudies/ al2at Publishers <ochiE %E ,harucha Erach/ 3iodiversity of "ndia/ Ma2in Publishin$ P.tE LtdE/ :hmedabadE &E Cunnin$ham/ WEPE/ Coo2er/ TEHE/ 1orhani/ E 4 He23orth/ METE %!!# Environmental encyclopedia/ Gaico 2ublishin$ House Mumbai ##"+2 (E 5own to Earth/ Centre -or Science and En.ironment *E Ha3kins/ =EEE Encyclopedia of "ndian =atural <istory/ ,omba) atural Histor) Societ)/ ,omba) +E Mckinne)/ MELE 4 School/ =EME #""+E Environmental -cience system ; -olutions/ Web enhanced edition/ +&"2E 'E 8dum/ EEPE #"'#E Fundamentals of EcologyE WE,ESaunders CoE IS:/ *'(2 0E =ao/ ME E 4 Datta/ :E< #"0'/ Caste Cater treatment/ 8@-ord 4 I,H PublE CoE P.tE LtdE/ &(*2 "E -urvey of the Environment/ The Hindu Ma$a9ine #!E Wa$nerE<EDE #""0/ Environmental Management/ WE,E Saunders CoE Philadel2hia/ IS: (""2

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class No($< 8ne o- the assi$nments shall be simulation o- continuous s)stems usin$ an) technical com2utin$ so-t3are

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 501< Co =6($) O):+#"C+("o# +#% D$'":#


5Common 3ith CS!" (!&6 T$+-."#: '-.$ $ ( hours lecture and # hour tutorial 2er 3eek C)$%"('< *

Objectives To lay the foundation for the study of hardware organiBation of digital computers. "t brings out the interplay between various building blocks of computers without being specific to any particular computer. At the end of the course the student is expected to gain a fair idea about the functional aspects of each building block in computer design.

Mo%6,$ I (/2 .o6)') Com2uter abstraction and technolo$)B ,elo3 )our 2ro$ram - Inder the co.ers -Historical 2ers2ecti.e Measurin$ 2er-ormance - =elatin$ the metrics - e.aluatin$/ com2arin$ and summari9in$ 2er-ormance - Case stud)B SPEC"* bench mark - Instructions - 82erations and o2erands o- the com2uter hard3are =e2resentin$ instructions - Makin$ decision - Su22ortin$ 2rocedures A ,e)ond numbers - 8ther st)les oaddressin$ - Startin$ a 2ro$ram - Case stud)B 0!@0+ instructionsE Mo%6,$ II (/0 .o6)') Com2uter arithmetic - Si$ned and unsi$ned numbers - :ddition and subtraction -Lo$ical o2erations Constructin$ an :LI - Multi2lication and di.ision - >loatin$ 2oint - Case stud)B -loatin$ 2oint in 0!@0+ Mo%6,$ III (/0 .o6)') The 2rocessorB ,uildin$ a data 2ath - Sim2le and multi-c)cle im2lementations - Micro2ro$rammin$ E@ce2tions - Case stud)B Pentium Pro im2lementationE Mo%6,$ IV (/9 .o6)')

Memor) hierarch) - Caches - Cache 2er-ormance - 7irtual memor) - Common -rame3ork -or memor) hierarchies - Case stud) - Pentium Pro memor) hierarch)E In2ut/8ut2ut - I/8 2er-ormance measures - T)2es and characteristics o- I/8 de.ices - ,uses - Inter-aces in I/8 de.ices - Desi$n o- an I/8 s)stem

Text Books
#E Pattersen DE:E 4 Hennes) GELE/ $omputer Drganisation ; 5esign, The <ardware.-oftware

"nterface/ Harcourt :siaE R$*$)$#-$ Boo3' #E Heurin$ 7EPE 4 Gordan HE>E/ $omputer -ystem 5esign ; Architecture :ddison Wesle) %E Hamacher/ 7ranesic 4 Cak)/ $omputer Drganisation Mc1ra3 Hill

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 505< P)"#-"=,$' o* Co


T$+-."#: '-.$ $ ( hours lecture and # hour tutorial 2er 3eek

6#"-+("o# E#:"#$$)"#:
C)$%"('< (

Objectives To familiariBe the basic principles underlying the operation and design of a communication system concept of communication principles and various communication systems. At the end of the course the student will be equipped with the ability to analyse and design a communication system.

Mo%6,$ I (/0 .o6)') I#()o%6-("o#< Communication 2rinci2les A block dia$ram o- modem communication s)stem A stud) oelectroma$netic s2ectrum - use o- di--erent s2ectra -or di--erent a22lications Mo%6,+("o# $(.o%'< eed -or modulation A am2litude and modulations 5>M and PM6 A mathematical e;uations A s2ectra A side bands A band3idth A 2o3er relations A modulation inde@- 2hase dia$ram A com2arison o- :M/ >M/ PME Sam2lin$ theorem A analo$ 2ulse modulations- P:M and PTM 5PPM/ PDM or PWM6 A di$ital 2ulse or coded modulations A PCM/ 2ro2erties like s2ectra / 3a.e-orm/ ,W and S =E CW modulation -or di$ital si$nals A :S</ >S</ PS< A multi2le@in$ s)stems -or 2ulsed and CW modulations A TDM and >DM A com2arison ote@tures and merits Mo%6,$ II (/1 .o6)') Mo%6,+(o)'B 1eneration o- :M 3a.es A linear modulations/ collector/ base emitter modulationE S;uare la3 modulations A diode and balanced modulators A su22ression o- carrierE 1eneration o- >M 3a.es A =eactance modulator method A :rmstron$ method A con.ersion o- >M to PM and PM to >M 3a.esE 1eneration oP:M/ PPM/ and PWM 3a.es- con.ersion o- PWM 3a.e to PPM 3a.e Mo%6,$ III (/1 .o6)') Demodulation methods / DetectorsB Demodulation o- :M 3a.es A Linear detectors A s)nchronous and en.elo2e detectors A 2er-ormance com2arison A Demodulation o- >M 3a.es A slo2e detector A balanced slo2e detector A >oster A Seel) discriminator A =atio detector A demodulation o- P:M/ PPM/ PWM/ PCM 4 PDM A errors Mo%6,$ IV (// .o6)') Communication s)stemsB Transmitters and recei.ers A class => am2li-ier A class , 2ush 2ull linear am2li-ier A lo3le.el and hi$h le.el modulation s)stems A their com2arison A :M transmitter A >M transmitter A Direct and as)nchronous transmitter A strai$ht recei.er A su2erheterod)ne :M recei.er A communication recei.er A di.ersit) rece2tion A >M recei.ers Text Books Desh2ondeE ED etalE/ $ommunication Electronics / TMHE <enned) Da.is/ Electronic $ommunication systems TMH

#E %E

R$*$)$#-$ Boo3' #E =odd) D and Coolen EG/ Electronic $ommunications PHI %E :nokh Sin$h/ *rinciples of $ommunication Engineering SE Chand 4 co

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 500< DATA MODELLING & DESIGN


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives =otations introduced in Db:ect Driented design is powerful enough to be used as a notation for expressing a software design. The @nified Modelling #anguage is a combination of several earlier notations and is being promoted as a universal standard for ob:ect&oriented design.

Mo%6,$ I (/4 .o6)'6 8bject 8riented Pro$rammin$ Lan$ua$es A 8.er .ie3 o- Ga.a A 8bject oriented 2ro$rammin$ A Data t)2es/ .ariables and :rra)s A o2erators A control statements A classes A methods A inheritance A 2acka$es and inter-aces A e@ce2tion handlin$ A multithreaded 2ro$rammin$ Mo%6,$ II (/5 .o6)') IML A 8.er.ie3 o- the IML A :rchitecture A Structural model A classes A attributes A and o2erations A =elationshi2s A Dia$rams A Class dia$rams - Inter-aces / t)2es/ roles A 2acka$es A instances A object dia$rams Mo%6,$ III (/2 .o6)') ,eha.ioural modelin$ A interactions A use cases A use case dia$rams A interaction dia$rams/ acti.it) dia$rams A E.ents and si$nals A State machine Mo%6,$ IV (/0 .o6)') :rchitectural modelin$ A com2onents A de2lo)ments A collaborations A com2onent dia$rams - de2lo)ment dia$rams A s)stems and models

Text Books

#E Herbert Schildt/The $omplete +eference Eava Mc1ra3 Hill %E ,ooch 1E/ =umbau$h GE 4 Gacobsons I/ The @nified Modeling #anguage @ser 8uide/ :ddison
Wesle) R$*$)$#-$ Boo3' #E Pa$e Gones M/ Fundamentals of Db:ect& Driented 5esign in @M# :ddison Wesle)

&E ,ahrami :/ The @nified Modeling #anguage @ser 8uide Mc1ra3 Hill (E =umbau$h GE/ Gacobson IE 4 ,ooch 1/ The @nified Modeling #anguage +eference Manual
:ddison Wesle)

*E Larman CE/ :22l)in$ IML 4 Patterns/ An "ntroduction to Db:ect&Driented Analysis ; 5esign


:ddison Wesle) +E Poole) =E 4 Ste.ens PE/ Isin$ IML/ -oftware Engineering Cith Db:ects ; $omponents :ddison Wesle) I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 504< M"-)o=)o-$''o) B+'$% D$'":#


5Common 3ith CS!" (!+6 T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives To familiariBe the student with the internals of a microprocessor with a wide range of processing capabilities. Also to give a fair idea of various interfacing methods and devices along with a detailed treatment of important design issues.

Mo%6,$ I (/2 .o6)') Historical back$round o- micro2rocessors - Inside the PCB Motherboard - 1ra2hic ada2ters and monitors Dri.e controllers - >lo22) and hard disk dri.es - Streamers and other dri.es - Parallel inter-aces and 2rinters - Serial inter-aces and modems - et3ork ada2ters and L: s - CM8S =:M and real clock - <e)board/ mouse and other rodents - The 2o3er su22l) - 82eratin$ s)stem - ,I8S and memor) or$ani9ation 0!0+/0!00 Hard3are s2eci-icationB Clock $enerator - ,usE ,u--erin$ and latchin$ - bus timin$ - =ead) and 3ait states - Minimum and ma@imum modes -:d.anced 2rocessors - >eatures o- 0!&0+/ 0!(0+ and Pentium 2rocessorsE Mo%6,$ II (/1 .o6)') Micro2rocessor architectureB =eal mode and 2rotected mode memor) addressin$ - Memor) 2a$in$ :ddressin$ modes - Data addressin$ - Pro$ram memor) addressin$ - Stack memor) addressin$ - Data mo.ement instructions - :rithmetic and lo$ic instructions - Pro$ram control instructions - Pro$rammin$ the micro2rocessorB modular 2ro$rammin$ - Isin$ ke)board and dis2la) - Data con.ersions - disk -iles interru2t hooksE Mo%6,$ III (/2 .o6)') Memor) inter-aceB Memor) de.ices - :ddress decodin$/ 0 bit 50!006/ #+ bit 50!0+6/ &% bit 50!(0+6 and +( bit 5Pentium6 memor) inter-aces - D)namic =:ME #/ 8 inter-ace- Port address decodin$ - PPI/ 0%'" inter-ace - 0%*( timer inter-ace -#+* *! I:=T inter-ace - :DC/D:C inter-acesE Mo%6,$ IV (/0 .o6)') Interru2tsB Interru2t 2rocessin$ - Hard3are interru2ts - E@2andin$ the interru2t - 0%*": 2ro$rammable interru2t controller - DM:B DM: o2eration - 0%&' DM: controller - Shared bus o2eration - Disk memor) s)stems - 7ideo dis2la)s - ,us inter-aceB IS: bus - EIS: and 7ES: buses - PCI busE

Text Books
#E ,re) ,E,E/ The "ntel Microprocessors !(!F to *entium, Architecture *rogramming and

"nterface/ Prentice Hall o- India


%E Messmer HEPE/ The "ndispensable *$ <ardware 3ook/ :ddison Wesle)E

R$*$)$#-$ Boo3' #E =a) <E 4 ,hurchandi <EME/ Advanced Microprocessors ; *eripherals/ Tata Mc1ra3 HillE %E Hall DE7E/ Microprocessors ; "nterfacing, *rogramming ; <ardware/ Tata Mc1ra3 HillE &E Miller <E/ An Assembly #anguage "ntroduction to $omputer Architecture using the "ntel *entium/ 8@-ord Ini.ersit) PressE (E ,i$elo3 SGE/ Troubleshooting Maintaining ; +epairing *$s/ Tata Mc1ra3 HillE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 509(P)< D+(+ S()6-(6)$ L+!


5Common 3ith CS!" (!'5P66 T$+-."#: '-.$ $ & hours 2ractical 2er 3eek C)$%"('< %

Objectives To give hands on experience in viewing data as the central resource in computing process and to visualiBe the importance of structuring data. To demonstrate the impact of organiBing data on the efficiency of algorithms that process the data including static and dynamic data structures as well as linear and nonlinear data structures.

#E Stack and ?ueueB Im2lementation usin$ arra)s and Linked lists %E Searchin$ MethodsB ,inar) search and Hashin$ &E Sortin$B =ecursi.e im2lementation o- ?uick Sort and Mer$e Sort (E ,inar) Search TreeE Im2lementation 3ith insertion/ deletion and tra.ersal *E In-i@ E@2ression E.aluationB Isin$ e@2ression tree +E 1ra2h Search :l$orithmsB D>S and ,>S on : connected directed $ra2h 'E Minimal S2annin$ TreeE Im2lementation o- <ruskalLs and PrimLs :l$orithms 0E Shortest Path :l$orithmE Dijkstra and >lo)d Warshall :l$orithms "E Disjoint Set o2erationsB Inion and >ind usin$ rank and 2ath com2ression #!E :22lications o- Hea2B Priorit) ?ueue and Hea2 SortE

R$*$)$#-$ Boo3' #E Cormen TEHE/ Lieserson CEEE 4 =i.est =ELE/ "ntroduction to Algorithms/ Prentice Hall o- IndiaE %E Sahni SE/ 5ata structures Algorithms ; Applications in $>>/ Mc1ra3 HillE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&/() +!H-Laborator) 2ractical and record &!H- Tests #!H- =e$ularit) in the class

S$ $'($) E#% E7+ "#+("o# %Maximum Marks&/() '!H - Procedure/ conductin$ e@2eriment/ results/ tabulation/ and in-erence %!H - 7i.a .oce #!H - >air record

IT09 502 (P) PROGRAMMING ENVIRONMENTS LAB


T$+-."#: '-.$ $ & hours 2ractical 2er 3eek
& hours 2ractical 2er 3eek

C)$%"('< %

Objectives To teach the relevance and characteristics of different programming environments. To introduce the tools used for program development maintenance debugging etc.

>amiliari9ation 3ith -eatures o- an editor 5-or e@am2le 7i/ Emacs6 Shell 2ro$rammin$/ usa$e o- tools like $re2/ a3k etc Isa$e o- Pro$ram de.elo2ment 4 maintenance tools 5-or e@am2le OmakeP6 Isa$e o- debu$$in$ tools 5-or e@am2le O$dbP6 >amiliari9ation 3ith scri2tin$ lan$ua$es 5-or e@am2le Perl/ Tcl/Tk6 Isa$e o- le@ical 2rocessin$ tools 5-or e@am2le Le@6 Introduction to document -ormats 5-or e@am2le HTML/ PD>6E Scri2tin$ and $eneration o- d)namic 2a$esE Scri2tin$ lan$ua$es and interaction Introduction to the tools 2ro.idin$ 1II based human com2uter interaction 5-or e@am2le ?tE6E :utomatic $eneration o- code -or interaction usin$ .isual 2ro$rammin$ 5-or e@am2le ?t Desi$ner6

Introduction to tools -or 2re2arin$ documents 5-or e@am2le Word/Late@6 R$*$)$#-$ Boo3' #E ,ehrou9 >orou9an/ @nix and -hell *rogramming/ Tata Mc1ra3 HillE %E Martin C ,ro3n/ The $omplete +eference *erl "" edition Tata Mc1ra3 HillE &E >E Mittelbach/ ME 1oossens/ GE ,raams/ DE Carlisle/ CE =o3le)/ The #aTeG $ompanion 0nd Edition/ :ddison-Wesle) Pro-essionalE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&/() +!H-Laborator) 2ractical and record &!H- Tests #!H- =e$ularit) in the class

S$ $'($) E#% E7+ "#+("o# %Maximum Marks&/() '!H - Procedure/ conductin$ e@2eriment/ results/ tabulation/ and in-erence %!H - 7i.a .oce #!H - >air record

IT09 00/< So*(?+)$ A)-."($-(6)$ +#% P)oD$-( M+#+:$ $#(


5Common 3ith CS!" *!#6 T$+-."#: '-.$ $ ( hours lecture and # hour tutorial 2er 3eek C)$%"('< *

Objectives To impart the basic concepts of software architecture and design patterns. To develop an understanding about development of complex software systems in a methodical manner.

Mo%6,$ I (/4 .o6)') So-t3are :rchitecture - >oundations - So-t3are architecture in the conte@t o- the o.erall so-t3are li-e c)cle :rchitectural St)les - C:SE stud) o- :rchitectures Desi$nin$/ Describin$/ and Isin$ So-t3are :rchitecture - IS%!!!B The :d.anced Ima$in$ Solution - 1lobal :nal)sis - Conce2tual :rchitecture 7ie3 - Module :rchitecture 7ie3 - St)les o- the Module 7ie3t)2e - E@ecution :rchitecture 7ie3/ Code :rchitecture 7ie3E Com2onent-and-Connector 7ie3t)2e - St)les o- Com2onent-and-Connector 7ie3t)2e - :llocation 7ie3t)2e and St)les - Documentin$ So-t3are Inter-aces/ Documentin$ ,eha.ior - ,uildin$ the Documentation Packa$eE Mo%6,$ II (/4 .o6)') :rchet)2es and :rchet)2e Patterns/ Model Dri.en :rchitecture 3ith :rchet)2e PatternsE Literate Modelin$/ :rchet)2e PatternE / Customer =elationshi2 Mana$ement 5C=M6 :rchet)2e Pattern/ Product :rchet)2e Pattern/ ?uantit) :rchet)2e Pattern/ =ule :rchet)2e PatternE Desi$n Patterns/ Creational Patterns/ Patterns -or 8r$ani9ation o- Work/ :ccess Control Patterns/ Ser.ice 7ariation Patterns/ Ser.ice E@tension Patterns Mo%6,$ III (/4 .o6)') 8bject Mana$ement Patterns :da2tation Patterns/ Communication Patterns/ :rchitectural Patterns/ Structural Patterns/ Patterns -or Distribution/ Patterns -or Interacti.e S)stems :da2table S)stems/ >rame3orks and Patterns/ :nal)sis PatternsB Patterns -or Concurrent and et3orked 8bjects/ Patterns -or =esource Mana$ement/ Pattern Lan$ua$es/ Patterns -or Distributed Com2utin$E Mo%6,$ IV (/9.o6)') De-inin$ E:I/ Data-Le.el E:I/ :22lication Inter-ace-Le.el E:IE/ Method- Le.el E:IE/ Iser Inter-ace-Le.el E:I/ The E:I Process - :n Introduction to E:I and Middle3are/ Transactional Middle3are and E:I/ =PCs/ Messa$in$/ and E:I/ Distributed 8bjects and E:I/ Database- 8riented Middle3are and E:I/ Ga.a Middle3are and E:I/ Im2lementin$ and Inte$ratin$ Packa$ed :22licationsQThe 1eneral Idea/ KML and E:I/ Messa$e ,rokersQThe Pre-erred E:I En$ine/ Process :utomation and E:IE La)erin$/ 8r$ani9in$ Domain Lo$ic/ Ma22in$ to =elational Databases/ Web Presentation/ Domain Lo$ic Patterns/ Data Source :rchitectural Patterns/ 8bject-=elational ,eha.ioral Patterns/ 8bject-=elational Structural Patterns/ 8bject=elational Metadata Ma22in$ Patterns/ Web Presentation Patterns/ Distribution Patterns/ 8--line Concurrenc) PatternsE

R$*$)$#-$ Boo3' #E Ian 1orton S2rin$er/ Essential -oftware Architecture/ #st edition/ %!!+E %E ,ob Hu$hes/ Mike Cotterell/ -oftware *ro:ect Management 4th edition Tata Mc1ra3 Hill/ %!!+E &E Christine Ho-meister/ =obert ord/ Deli Soni / Applied -oftware Architecture/ :ddisonWesle) Pro-essionalN #st edition/ #"""E (E Erich 1amma/ =ichard Helm/ =al2h Gohnson/ Gohn 7lissides/ 5esign *atterns, Elements of +eusable Db:ect&Driented -oftware/ :ddison-Wesle) Pro-essionalN #st editionE *E Martin >o3ler/ *atterns of Enterprise Application Architecture/ :ddison- Wesle) Pro-essional/ %!!&E

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 002< I#%6'()"+, E-o#o "-' +#% P)"#-"=,$' o* M+#+:$ $#(


5Comman -or CSand IT6 T$+-."#: '-.$ $ % hours lecture and # hour tutorial 2er 3eek C)$%"('< &

Section A: Ind st!i"# Econo$ics Objectives To provide knowledge on fundamentals of economics forms of business organisations trade and taxation.

Mo%6,$ I (/0 .o6)') ature and sco2e o- economics A de-initions o- macro and micro economics A basic terminolo$ies A $oods A utilit) A .alue A 3ealth A -actors o- 2roduction A land A labour A di.ision o- labour A ca2ital and ca2ital -ormation A consum2tion A 3ants A characteristics and classi-ication A la3 o- diminishin$ mar$inal utilit) A demand A la3 o- demand A elasticit) o- demand A t)2es o- elasticit) A -actors determinin$ elasticit) A measurement A its si$ni-icance A su22l) A la3 o- su22l) A market 2rice A 2er-ect com2etition A mono2ol) A mono2olistic com2etitionE Mo%6,$ II (9 .o6)') >orms o- business A 2ro2rietorshi2 A 2artnershi2 A joint stock com2an) A coo2erati.e sector A state enter2risesE ational income A conce2ts A 1 P A theor) o- mone) A nature and -unctions o- mone) A in-lation and de-lation A ta@ation A theor) o- international trade A -ree trade ./s 2rotection A balance o- trade and balance o- 2a)ments A trade o- 2olic) o- the 1o.ernment o- IndiaE

Section B: %!inci&#es o' M"n"(e$ent Objectives To provide knowledge on principles of management decision&making techniques accounting principles and basic management streams.

Mo%6,$ III (/0 .o6)') Princi2les o- Mana$ement A E.olution o- mana$ement theor) and -unctions o- mana$ement 8r$ani9ational structure A Princi2les and t)2esE Decision makin$ A Strate$ic/ tactical and o2erational decisions/ decision makin$ under certaint)/ risk and uncertaint) and multista$e decisions and decision treeE Human resource mana$ement A ,asic conce2ts o- job anal)sis/ job e.aluation/ merit ratin$/ 3a$es/ incenti.es/ recruitment/ trainin$ and industrial relationsE Mo%6,$ IV (/0 .o6)') >inancial mana$ement A Time .alue o- mone) and com2arison o- alternati.e methodsE Costin$ A Elements and com2onents o- cost/ allocation o- o.erheads/ 2re2aration o- cost sheet A break e.en anal)sis

,asics o- accountin$ A Princi2les o- accountin$/ basic conce2ts o- journal/ led$er/ trade/ 2ro-it and loss and balance sheetE Marketin$ mana$ement A ,asic conce2ts o- marketin$ en.ironment/ marketin$ mi@/ ad.ertisin$ and sales 2romotionE Project mana$ement A Phases/ or$ani9ation/ 2lannin$/ estimatin$/ 2lannin$ usin$ PE=T 4 CPME

Text Books
#E <E<E De3tt/ GEDE 7arma/ Elementary Economic Theory/ SE Chand Publishers %E ,arth3al =E=E/ "ndustrial Economics H An "ntroductory Text 3ook/ e3 :$e 2ublishersE &E 7enkata =atnam CE SE 4 Sri.ast.a ,E<E/ *ersonnel Management and <uman +esources/ Tata

Mc1ra3 HillE
(E >E Ma9da/ Engineering Management/ :ddison Wesle) Lon$man LtdE/ #""0E *E PE <otler/ Marketing Management, Analysis *lanning "mplementation and $ontrol/ Prentice

Hall/ e3Gerse)/ %!!#E +E Prasanna Chandra/ Financial Management, Theory and *ractice/ Tata Mc1ra3 HillE R$*$)$#-$ Boo3' #E 1E arendrababu/ Elements of Economic Analysis %E <E PE ME Sundaran/ Money 3anking Trade ; Finance &E MELE Ghin$an/ Micro Economic Theory/ <onarkE (E Luc) C Morse and Daniel L ,obcock/ Managing engineering and technology/ Pearson Prentice HallE *E 8EPE <hanna/ "ndustrial Engineering and Management/ Dhan2at =ai and Sons/ Delhi/ %!!&E +E ,hattachar)a :E<E/ *rinciples and *ractice of $ost Accounting/ Wheeler Publishin$E 'E Weist and Le.)/ A Management guide to *E+T and $*M/ Prentice Hall o- IndiaE 0E <oont9 H/ 8FDonnel C 4 Weihrich H/ Essentials of Management/ Mc1ra3 Hill "E =amas3am) 7ES 4 amakumari S/ Marketing Management, *lanning "mplementation and $ontrol/ MacMillanE I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 001< E !$%%$% S>'($ '


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives Db:ective of the course is to teach students about architecture hardware and software elements programming models and practice and tools on embedded system design and implementation common to computing streams. Thrust is on the available hardware and real time operating systems for the embedded systems design. *ro:ect works in the concerned field will supplement the learning process.

Mo%6,$ ; I< (/0 .o6)') IntroductionB De-inition - Classi-ication - Processors in the s)stem - 8ther h/3 unitsE So-t3are com2onents - T)2ical a22lications - Embedded s)stems on a chi2 5SoC6 and use o- 7LSI circuitsE Mo%6,$ ; II< (/2 .o6)') Hard3are or$ani9ationB Structured units o- a 2rocessor - Processor selection -actors Common memor) de.ices - Memor) selection - Memor) ma2 - Internal de.ices 4 I/8 de.ices ma2 - Direct memor) access - Inter-acin$ the abo.eE T)2es o- I/8 de.ices - Serial de.ices - Parallel 2ort de.ices - So2histicated -eatures - Timer and Countin$ de.ices - :d.anced serial bus 4 I/8 - Hi$h s2eed ,uses - Common t)2es - :d.anced ,usesE Mo%6,$ ; III< (/0 .o6)') Pro$rammin$B Com2ilin$/ cross-com2ilin$ - 82timi9ed use o- memor) - Ise o- D>1 -or 2ro$ram anal)sis - Control Data >lo3 $ra2h - Ise o- -inite state machines model - Ise o- Petrinet models - Ise o- Petri table -or =eal time 2ro$rammin$ - Issues in multi2rocessor s)stemsE =eal time 2ro$rammin$ issues durin$ so-t3are de.elo2ment 2rocess - Distinction bet3een -unctions/ IS= and tasks - Problems o- sharin$ data in =T8S - Inter2rocess communication in =T8SE De.ice dri.ers - Parallel 2ort dri.er - Dri.er -or internal 2ro$rammable timin$ de.ices - Interru2t ser.icin$ mechanism - Conte@t and 2eriods -or conte@t s3itchin$ - Deadline and Interru2t latenc)E Mo%6,$ ; IV< (/0 .o6)') =eal Time 82eratin$ S)stemsB T)2ical 8S structure - =T8S structure - The conte@t o- its use - Schedule mana$ement -or multi2le tasks Schedulin$ in real time - Interru2t routines in =T8S en.ironment - =T8S task schedulin$ models - List obasic actions in 2re-em2ti.e scheduler and e@2ected time taken - Strate$) -or s)nchroni9ation - Discussion usin$ Linu@ - 8S securities issues - Mobile 8SE Case stud) o- =T8S usin$ MIC8SE Case stud) -or =T8S based 2ro$rammin$ - Codin$ -or :utomatic Chocolate .endin$ machine usin$ MIC8SE

Text Books #E =aj <amal/ Embedded s)stems - architecture/ 2ro$rammin$ and desi$n/ Tata Mc1ra3Hill R$*$)$#-$ Boo3' #E GE,E Peatman/ 5esign with Microcontrollers and Microcomputers Mc1ra3-hill %E Da.id EE Simon/ An embedded software primer Pearson Education :sia &E Daniel WE Le3is/ Fundamentals of Embedded -oftware where $ and assembly meet Pearson Education :siaE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 005< O=$)+("#: S>'($ '


5Common 3ith CS!" *!(6 T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives To impart the knowledge on the need and requirement of an interface between Man and Machine to enable the learners to identify the difference between the system software and the application software and their design requirements. To teach the features of operating systems and the fundamental theory associated with process memory and file management components of operating systems.

Mo%6,$ I (/1 .o6)') =e.ie3 o- o2eratin$ s)stem strate$ies - resources - 2rocesses - threads - objects/ -o2eratin$ s)stem or$ani9ation - desi$n -actors - -unctions and im2lementation considerations - de.ices - characteristics controllers - dri.ers A de.ice mana$ement - a22roaches - bu--erin$ - de.ice dri.ers - t)2ical scenarios such as serial communications - stora$e de.ices etcE Mo%6,$ II (/1 .o6)') Process mana$ement - s)stem .ie3 - 2rocess address s2ace - 2rocess and resource abstraction - 2rocess hierarch) - schedulin$ mechanisms - .arious strate$ies - s)nchroni9ation - interactin$ 4 coordinatin$ 2rocesses - sema2hores - deadlock - 2re.ention - a.oidance - detection and reco.er)E Mo%6,$ III (/1 .o6)') Memor) mana$ement - issues - memor) allocation - d)namic relocation .arious mana$ement strate$ies .irtual memor) - 2a$in$ - issues and al$orithms se$mentation - t)2ical im2lementations o- 2a$in$ 4 se$mentation s)stemsE Mo%6,$ IV (/1 .o6)') >ile mana$ement - -iles - im2lementations - stora$e abstractions - memor) ma22ed -iles - directories and their im2lementation - 2rotection and securit) - 2olic) and mechanism - authentication - authori9ation - case stud) o- Ini@ kernel and Microso-t 3indo3s T 5conce2ts onl)6E

#E

Text Books utt 1EGE/ Dperating -ystems & A Modern *erspective/ :ddison Wesle)E

R$*$)$#-$ Boo3' #E Silberschat9 4 1al.in/ Dperating -ystem $oncepts/ :ddison Wesle) %E Cro3le) C/ Dperating -ystems& A 5esign Driented Approach/ Tata Mc1ra3-Hill &E Tanenbaum :ESE/ Modern Dperating -ystems/ Prentice Hall/ Pearson EducationE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 000< D":"(+, D+(+ Co


5Common 3ith CS!" *!*6 T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek

6#"-+("o#
C)$%"('< (

Objectives To introduce the concepts of communication of digital data by looking at the various aspects of generation transmission and reception. To introduce the various protocols involved in communication of digital content.

Mo%6,$ I (/1 .o6)') Data and Si$nals A :nalo$ and Di$ital A Data transmission A ,asics A Transmission im2airments A Data rate limits A 2er-ormance A Di$ital transmission A :nalo$ transmission A ,and3idth utili9ation A channel ca2acit) A multi2le@in$ A s2read s2ectrum A as)nchronous transmission A s)nchronous transmission A si$nal 2ro2a$ation dela) A transmission media - $uided media A un$uided media Mo%6,$ II (/1 .o6)') Di$ital to analo$ con.ersion A analo$ to di$ital con.ersion A transmission modes A error detection and correction A introduction A block codin$ A c)clic codes A checksum A data com2ressionE Mo%6,$ III (/1 .o6)') Tele2hone net3ork A dial u2 modems A di$ital subscriber line A cable T7 net3orks -or data trans-er s3itchin$ A s3itchin$ A circuit s3itched net3orks A data$ram net3orks A .irtual circuit net3orks A structure o- a s3itchE Mo%6,$ IV (/1 .o6)') Data link control A -ramin$ A -lo3 control A error control A 2rotocol basics A character oriented 2rotocols A bit oriented 2rotocols A noiseless channels A nois) channels A HDLC A 2oint to 2oint 2rotocolE Text Books
#E ,ehrou9 >orou9an/ 5ata $ommunication and =etworking/ Tata Mc1ra3 HillE

R$*$)$#-$ Boo3' #E William Stallin$s/ 5ata and $omputer $ommunications/ Prentice Hall International P.tE LtdE %E >red Halsall/ 5ata $ommunication $omputer =etworks and Dpen -ystems/ Pearson EducationE &E Harold <olimbris/ 5igital $ommunication -ystems/ Pearson Education

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 004< T.$o)> o* Co =6(+("o#


5Common 3ith CS!" *!+6 T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives To teach the fundamentals on computational models and computability. To introduce the introductory concepts of languages and their classification To familiariBe the students on recogniBers and automata. To impart knowledge on classifying algorithms into the various computability classes and proofs of some standard algorithms.

Mo%6,$ I (/1 .o6)') Introduction to -ormal 2roo-- Inducti.e 2roo-s - Conce2ts o- automata theor) - Deterministic -inite automata - ondeterministic -inite :utomata - e;ui.alence o- deterministic and nondeterministic -inite automata ondeterministic >inite automata 3ith a transitions - =e$ular e@2ressions - >inite automata and re$ular e@2ressions - :l$ebraic la3s -or =e$ular e@2ressions - Pum2in$ lemma -or re$ular lan$ua$es - closure 2ro2erties o- re$ular lan$ua$es - Decision 2ro2erties o- re$ular lan$ua$es - E;ui.alence and minimi9ation oautomataE Mo%6,$ II (/1 .o6)') Conte@t -ree 1rammars - Deri.ations - sentential -orms - The lan$ua$e o- $rammar - Parse trees - :mbi$uit) in $rammar and lan$ua$es - Inherentl) ambi$uous lan$ua$es - Pushdo3n automata - >ormal de-inition 1ra2hical notation A The lan$ua$e o- a PD: - :cce2tance b) PD: - Em2t) stack - >inal state - PD:s to $rammars - Deterministic PD:s and C>Ls - on deterministic PD:s A Chomsk) ormal >orm - 1reibach ormal >orm - Pum2in$ lemma -or C>Ls A Closure 2ro2erties o- C>Ls - Decision 2ro2erties o- C>Ls CR< al$orithmE Mo%6,$ III (/5 .o6)') Turin$ Machines - otation - Instantaneous Descri2tion - Transition Dia$ram - The lan$ua$e o- a Turin$ Machine - Haltin$ o- TMs - Pro$rammin$ techni;ues -or Turin$ Machines - E@tension to basic TMs ondeterministic TMs - =estricted TMs - =ecursi.e and =ecursi.el) Enumerable Lan$ua$es A Haltin$ 2roblem o- TMs - Indecidable 2roblem about TMs - =iceLs Theorem - Post Corres2ondence 2roblem Indecidabilit) o- Post Corres2ondence Problem - Indecidable 2roblems on Lan$ua$esE Mo%6,$ IV (/2 .o6)') Intractable 2roblems - The classes P and P - Pol)nomial time reducibilit) - P-Com2lete 2roblems - The Satis-iabilit) 2roblem - P-Com2leteness o- the satis-iabilit) 2roblem - P-Com2leteness o- CS:T- PCom2leteness o- &S:T - ode co.er 2roblem - Directed Hamiltonian circuit 2roblem - The class olan$ua$es Co- P - Problems sol.able in 2ol)nomial s2aceE

Text Books
#E =a)mond 1reenla3 4 HE Games Hoo.er/ Fundamentals of the Theory of $omputation,

*rinciples and *ractice/ Mor$an <au-mann PublishersE R$*$)$#-$ Boo3' #E Ho2cro-t GEE/ Mot3ani = 4 Illman GE DE/ "ntroduction to Automata Theory #anguages and $omputation/ Pearson EducationE %E Ho2cro-t GE EE 4 Illman GE DE/ "ntroduction to Automata Theory #anguages and $omputation/ arosaE &E Lin9B PE/ An "ntroduction to Formal #anguages ; Automata/ arosaE (E Martin I C/ "ntroduction to #anguages and the Theory of $omputation/ Tata Mc1ra3 HillE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 009(P)< S>'($ ' L+!


T$+-."#: '-.$ $ & hours 2ractical 2er 3eek Objectives

C)$%"('< %

To make the learners understand the operating system structures and the implementation aspects of various D- functions and schedulers.

O=$)+("#: '>'($ ' #E Im2lementation o- dinin$ 2hiloso2hers 2roblem b) multi2ro$rammin$ usin$ threads/ sema2hores and shared memor) %E Im2lementation o- ls/dir command o- Ini@/Dos to dis2la) contents o- a $i.en -lo22) diskE &E Pro$ram to $enerate disk usa$e status re2ort -or a $i.en Ini@/Dos -ormatted -lo22) disk $i.in$ details like -ree s2ace a.ailabilit) etcE (E Im2lementation o- bankerLs al$orithm *E Inter-2rocess communication usin$ mailbo@es and 2i2es +E Pro$ram to -ind the least common ancestor o- t3o $i.en nodes in a binar) tree 5Concurrent Pro$rammin$6 'E Pro$ram -or the readers and 3riters 2roblem 5Concurrent Pro$rammin$6

R$*$)$#-$ Boo3' #E utt 1EGE/ Dperating -ystems & A Modern *erspective/ :ddison Wesle) %E ,ach MEGE/ The 5esign of the @nix Dperating -ystem/ Prentice Hall India

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&/() +!H-Laborator) 2ractical and record &!H- Tests #!H- =e$ularit) in the class

S$ $'($) E#% E7+ "#+("o# %Maximum Marks&/() '!H - Procedure/ conductin$ e@2eriment/ results/ tabulation/ and in-erence %!H - 7i.a .oce #!H - >air record

IT09 002(P) H+)%?+)$ L+!


5Common 3ith CS!" *!05P66 T$+-."#: '-.$ $ & hours 2ractical 2er 3eek C)$%"('< %

Objectives To teach the relevance and characteristics of hardware and operating system components of a digital computer system through various laboratory experiments. To enable the students to develop the ability to interface devices to computer systems through various interfacing techniques.

Lab #B Identi-ication o- com2onents/cards and PC assemblin$ -rom com2onents Lab %B :ssembl) lan$ua$e 2ro$ram -or im2lementin$ arithmetic o2erationsE Lab&/ (B Im2lementation o- a -ile mana$er usin$ D8S/,I8S interru2tsE Lab *B TS= 5Terminate and Sta) =esident6 Pro$rammin$E Lab +B :DC inter-aceE Lab 'B Ste22er Motor inter-ace usin$ D:CE Lab 0/"B Parallel Inter-aceB Printer and HEK ke)boardEE Lab #!B Serial Inter-aceB PC to PC serial inter-ace usin$ M8DEME

R$*$)$#-$ Boo3' #E Messmer HEPE/ The "ndispensable *$ <ardware 3ook/ :ddison Wesle) %E Hall DE 7E/ Microprocessors and "nterfacing/ Tata Mc1ra3 HillE &E orton PE/ 5D- "nternalsE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&/() +!H-Laborator) 2ractical and record &!H- Tests #!H- =e$ularit) in the class

S$ $'($) E#% E7+ "#+("o# %Maximum Marks&/() '!H - Procedure/ conductin$ e@2eriment/ results/ tabulation/ and in-erence %!H - 7i.a .oce #!H - >air record

IT09 40/< SOFTWARE EUALITY MANAGEMENT


rating components of a T$+-."#: '-.$ system $ ( hours lecture and # hour tutorial 2er 3eek

C)$%"('< *

Objectives

This course explains the role of standards and measurements used in accessing software quality. "t helps students to learn how to test a system and find the system defects and inconsistencies.

Mo%6,$ I (/2 .o6)')


INTRODUCTION< So-t3are Process assessment o.er.ie3 - ?ualit) mana$ement - ?ualit) assurance 2lan -

Considerations - 7eri-ication and 7alidation - Conce2ts o- ?ualit) Control/ ?ualit) :ssurance/ ?ualit) Mana$ement - Total ?ualit) Mana$ementN Cost o- ?ualit)N ?C tools - ' ?C Tools and Modern ToolsN 8ther related to2ics - ,usiness Process =e-en$ineerin$ - Cero De-ect/ Si@ Si$ma/ ?ualit) >unction De2lo)ment/ ,enchmarkin$/ Statistical 2rocess controlE Mo%6,$ II (/4 .o6)')
CONFIGURATION MANAGEMENT< The need -or con-i$uration Mana$ement - So-t3are 2roduct

nomenclature - ,asic con-i$uration mana$ement -unctions - ,aselines - =es2onsibilities - eed -or automated tools - Con-i$uration mana$ement 2lan A SCM su22ort -unctions - The re;uirement 2hase Desi$n control - The im2lementation 2hase - Test 2hase - SCM -or Tools - Con-i$uration accountin$ and auditE Mo%6,$ III (/4 .o6)')
SOFTWARE STANDARDS AND INSPECTION< De-initions - The =eason -or so-t3are standards - ,ene-its

o- standards - Establishin$ standards - 1uidelines A T)2es o- re.ie3s - Ins2ection o- objecti.es - ,asic ins2ection 2rinci2les - The conduct o- ins2ection - Ins2ection trainin$ Models -or ?ualit) :ssurance-IS8"!!! - Series/ CMM/ SPICE/ Malcolm ,aldri$e :3ard A ;ualit) mana$ement modelsE Mo%6,$ IV (/0 .o6)')
TESTING AND MANAGING SOFTWARE EUALITY< Testin$ 2rinci2les A T)2es o- tests - Test 2lannin$ -

Test de.elo2ment - Test e@ecution and re2ortin$ - Test tools and methods - =eal Time testin$ - ;ualit) mana$ement 2aradi$m - ?ualit) moti.ation - Measurement criteria - Establishin$ a so-t3are ;ualit) 2ro$ram - Estimatin$ so-t3are ;ualit)E
DEFECT PREVENTION< Princi2les o- so-t3are de-ect 2re.ention - Process chan$es -or de-ect 2re.ention -

De-ect 2re.ention considerations - Mana$ements role - >rame3ork -or so-t3are 2rocess chan$e - Mana$in$ resistance to so-t3are 2rocess chan$e - Case studies

#E %E &E (E

Text Books Watts SE Hum2hre)/ "ntroduction to the Team -oftware *rocess/ :ddison Wesle)/ %!!! Watts SE Hum2hre)/ "ntroduction to the *ersonal -oftware *rocess :ddison Wesle)/ %!!! Watts SE Hum2hre)/ Managing the -oftware *rocess :ddison-Wesle)/ #""" Ste2hen HE<an/ Metrics and models in software quality engineering %nd Edition/ :ddison Wesle)/ %!!&

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 402< Co =",$) D$'":#


5Common 3ith CS!" +!%6 T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives To introduce the various techniques involved in the translation of source programs into ob:ect programs by a compiler. To understand the inner working of a compiler using the various data structures used in the translation process.

Mo%6,$ I (/1 .o6)') Introduction - anal)sis o- the source 2ro$ram - 2hases o- a com2iler - com2iler construction tools - le@ical anal)sis - role o- the le@ical anal)9er - s2eci-ication o- tokens - reco$nition o- tokens - le@ical anal)9er $eneratorsE Mo%6,$ II (/1 .o6)') S)nta@ anal)sisB role o- the 2arser - conte@t--ree $rammars - to2-do3n 2arsin$ -bottom-u2 2arsin$ - o2erator 2recedence 2arsin$ - L= 2arsers 5SL=/ canonical L=/ L:L=6 - 2arser $eneratorsE Mo%6,$ III (/1 .o6)') S)nta@-directed translation - s)nta@-directed de-initions - S-attributed de-initions - L-attributed de-initions bottom-u2 and to2-do3n translation - t)2e checkin$ - t)2e s)stems - s2eci-ication o- a t)2e checker - runtime en.ironments - source lan$ua$e issues - stora$e or$ani9ation - stora$e allocation strate$ies - access to non-local names - 2arameter 2assin$ - s)mbol tablesE Mo%6,$ IV (/1 .o6)') Intermediate code $eneration - intermediate lan$ua$es - declarations -assi$nment statements - ,oolean e@2ressions - 2rocedure calls - introduction to code o2timi9ation - sources o- o2timi9ation - introduction to data--lo3 anal)sis introduction to code $eneration - issues in the desi$n o- a code $enerator A the tar$et machine - a sim2le code $enerator Text Books
#E :ho :E7E/ Sethi =E/ Illman GEDE/ $ompilers, *rinciples Techniques and Tools/ :ddison Wesle)E

R$*$)$#-$ Boo3' #E :ho :E 7E/ Illman GEDE *rinciples of $ompiler 5esign/ arosa %E Muchnick SESE/ Advanced $ompiler 5esign "mplementation/ Harcourt :sia 5Mor$an <au-man6 &E Holub :EIE/ $ompiler 5esign in $/ Prentice Hall India (E :22el :EWE/ Modern $ompiler "mplementation in $/ Cambrid$e Ini.ersit) Press *E <enneth C Lauden/ $ompiler $onstruction & *rinciples and practice/ Thomson ,rooks/Cole 7ikas Publishin$ HouseE +E Dick 1rune/ Henri E ,al/ Ceriel GEH Gacobs/ <oen 1 Lan$endoen/ Modern $ompiler design/ DreamtechE 'E <EDECoo2er and Linda Torc9on/ Engineering a $ompiler/ Mor$an <au-mann/Else.ier/ %!!0

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 401< Co =6($) N$(?o)3'


5Common 3ith CS!" +!&6 T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives To teach the mode of operation of different types of computer networks that is used to interconnect a distributed community of computers and various interfacing standards and protocols.

Mo%6,$ I (/1 .o6)') Local :rea et3orksB Ethernet/ Token =in$ Media :ccess Control/ Token =in$ Maintenance/ >DDI/ =esilient Packet =in$/ WirelessB ,luetooth/ Wi->i/ WiM:K/ Cell Phone Technolo$iesE Circuit s3itchin$/ Messa$e s3itchin$/ Packet S3itchin$ A Data$rams/ 7irtual circuit/ source routin$/ Cell S3itchin$ A Cells/ Se$mentation and =eassembl)/ 7irtual Paths/ :TM desi$n $oals/ Ph)sical La)ers -or :TME Mo%6,$ II (/1 .o6)') Internet3orkin$ - et3orkin$ de.ices - ,rid$es/ =outers/ 1ate3a)s/ =outin$- et3ork as a $ra2h/ distance .ector 5=IP6/ link state 58SP>6/ Metrics/ =outin$ -or mobile hosts/ 1lobal Internet - Subnettin$/ CID=/ ,1P/ =outin$ areasE Mo%6,$ III (/1 .o6)') Internet3orkin$ - IP.( and IP.+/ Multicast addresses/ Multicast routin$/ D7M=P/ PIM/ MSDP/ Multi2rotocol label s3itchin$- Destination based -or3ardin$/ E@2licit routin$/ .irtual 2ri.ate net3orks and tunnelsE Mo%6,$ IV (/1 .o6)') End-to-End ProtocolsB Trans2ort la)er A duties/ Sim2le Demulti2le@er 5IDP6/ =eliable b)te Stream 5TCP6E End-to-end issues - se$ment -ormat/ connection establishment and termination/ Tri$$erin$ transmission/ :da2ti.e retransmission/ record boundariesE TCP e@tensions/ :lternati.e desi$n choicesE =emote Procedure Call >undamentals/ =PC Im2lementation/ I22er 8SI la)ers - session la)er/ 2resentation la)er/ a22lication la)erE

Text Books
#E LE Peterson 4 ,ruce SE Da.ie/ $omputer =etworks& A systems approach/ (/e Mor$an <au-mann

2ublishers an im2rint o- Else.ier R$*$)$#-$ Boo3' #E ,ehrou9 >orou9an/ "ntroduction to data communication and networking/ Tata Mc1ra3- Hill Publishin$ Com2an) LtdE %E Halsall >E/ Data Communication/ $omputer =etworks and Dpen -ystems/ :ddison Wesle)E &E <esha. S/ An Engineering Approach to $omputer =etworking/ :WLE (E :ndre3 SE Tanenbaum/ $omputer =etworks/ PHIE *E Leon-1arcia :E 4 Widjaja IE/ $ommunication =etworks/ Tata Mc1ra3 HillE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 405< D+(+!+'$ M+#+:$ $#( S>'($ '


5Common 3ith CS!" +!(6 T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives To introduce the basic concepts of databases connected with software engineering techniques and background information useful for the management of databases. The syllabus includes the file organiBation database design and transaction processing techniques.

Mo%6,$ I (/5 .o6)') IntroductionB characteristics o- database a22roach - ad.anta$es o- usin$ D,MS - database conce2t and architecture - data models - schemes - instances - data inde2endence - database lan$ua$es and inter-aces database modelin$ usin$ entit) - relationshi2 5E=6 - entit) sets attributes and ke)s - relationshi2s - t)2e role and structural constraints - 3eak entit) t)2es - enhanced entit)-relationshi2 5EE=6 and object modelin$ - sub classes - su2er classes and inheritance - s2eciali9ation and $enerali9ation - modelin$ o- union t)2esE Mo%6,$ II (/2 .o6)') >ile or$ani9ation and stora$eB secondar) stora$e de.ices - =:ID technolo$) - o2erations in -iles - hea2 -iles and sorted -iles - hashin$ techni;ues - t)2es o- sin$le le.el ordered inde@/ multi-le.el inde@es - , - trees and , D trees - inde@es on multi2le ke)s - other t)2es o- inde@esE Mo%6,$ III (/1 .o6)') Database desi$nB -unctional de2endencies - normal -orms - $eneral de-inition o- second and third normal -orms - bo)ce-codd normal -orm - multi .alued de2endencies and -ourth normal -orm - join de2endencies and -i-th normal -orm - inclusion de2endencies - 2ractical database desi$n tunin$ - database desi$n 2rocess relational model conce2ts - relational al$ebra o2erations - ;ueries in S?L - insert - delete and u2date statements in S?L .ie3s in S?LE Mo%6,$ IV (/1 .o6)') Transaction 2rocessin$B desirable 2ro2erties o- transactions/ schedules and reco.erabilit) - seriali9abilit) oschedules concurrenc) control - lockin$ techni;ues - time stam2 orderin$ multi .ersion concurrenc) control - $ranularit) o- data items - database reco.er) techni;ues based on de-erred u2 data and immediate u2datin$ - shado3 2a$es - :=IES reco.er) al$orithm - database securit) and authori9ation - securit) issue access control based on $rantin$/re.okin$ o- 2ri.ile$es introduction to statistical database securit)E

#E Elmasri 4

Text Books a.athe/ Fundamentals of 5atabase -ystems/ Pearson Education/ -ourth editionE

R$*$)$#-$ Boo3' #E =amakrishnan =E 4 1ehrke GE/ 5atabase Management -ystems/ Mc1ra3 Hill %E 8Lneil PE 4 8Lneil EE/ 5atabase *rinciples *rogramming and *erformance/ Harcourt :sia/ Mor$an <au-man &E Silberschat9 :E/ <orth HE>E/ 4 Sudarshan SE/ 5atabase -ystem $oncepts/ Tata Mc1ra3 Hill (E Illman GEDE/ *rinciples of 5atabase -ystems/ 1al$otia Publications *E Date CEGE/ An "ntroduction to 5atabase -ystems/ :ddison Wesle)

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 400< H6 +# Co =6($) I#($)+-("o#


T$+-."#: '-.$ $ % hours lecture and # hour tutorial 2er 3eek C)$%"('< &

Objectives The course aims at how to take into account the human and contextual part of a system which is important in creating popular applications. <uman $omputer "nteraction teaches the right interaction and its implementation in fields like applied psychology industrial engineering ergonomics. Db:ective of the course is to introduce the well&developed models based on the cognitive and social constraints for a new "T application.

Mo%6,$ I (9 .o6)') Introduction to model human 2rocessor A In2ut-out2ut channel A Human memor) A Thinkin$ A Emotion A di--erence bet3een indi.iduals A Ps)cholo$) and the desi$n o- interacti.e s)stems/ T)2ical Com2uter A Te@t entr) de.ices A Positionin$B 2ointin$ and dra3in$ A Dis2la) de.ices A De.ices -or .irtual realit) 4 &D interaction A Ph)sical controls/ Sensors 4 S2ecial de.ices A Printin$ 4 scannin$ A Memor) A Processin$ 4 net3orksE Introduction to interaction A Model- -rame3orks 4 HCI A Er$onomics A interacti.e st)les elements o- WIMP inter-ace A interaction 4 its conte@tB E@2erience/ and en$a$ement A Paradi$ms -or interactionE Mo%6,$ II (// .o6)') Desi$n Process Introduction to interaction desi$n A Process o- desi$n A Iser -ocus A Scenarios A a.i$ational desi$n A Screen desi$n 4 la)out A Protot)2in$E HCI so-t3are/ 2rocess A Isabilit) en$ineerin$E So-t3are 2rotot)2in$ 4 techni;uesE Princi2les to su22ort usabilit) Standards A 1olden rules sam2le A =ule learnin$ -rom HCI 2atterns A Im2lementation A elements o- 3indo3in$ s)stems Pro$rammin$B - Isin$ toolkits Iser inter-ace mana$ement s)stemsE E.aluation - E@2ert anal)sis A e.aluate throu$h user 2artici2ation A Choosin$ Aan e.aluation methodE Ini.ersal desi$n 2rinci2les A Multi-modal interaction A Desi$n -or di.ersit) A :22roaches to user su22ort A :da2ti.e hel2 s)stemsE Mo%6,$ III (/0 .o6)') Models 4 theoriesB Co$niti.e models A Lin$uistic model A Ph)sical 4 de.ice model A socio-or$ani9ational issues A communication and collaboration model Ises o- task anal)sisE Dialo$ notation 4 desi$n A Dia$rammatic notation A Te@tual dialo$ notation A Dialo$ anal)sis and desi$nE Mo%6,$ IV (9 .o6)') 1rou2 Ware s)stems A com2uter mediated communication A Meetin$ 4 discussion su22ort s)stems A shared a22lications and arti-actsE >rame3ork -or 1rou2 WareE Ibi;uitous com2utin$ 4realities A Ibi;uitous com2utin$ a22lications research A .irtual and au$mented realit) A In-ormation and data .isuali9ationE Text Books

#E :lan Di@ Ganet >inla)/ 1re$or) D :bo3d/ =ussell ,eale Human / $omputer "nteractionN &rd
edition/ Pearson Education :siaE R$*$)$#-$ Boo3' #E Gohn M Carroll Hutran/ $omputer "nteraction in the =ew Millennium/ Pearson Education :sia %E ,en Shneinderman/ 5esigning the @ser "nterface, -trategies for Effective <uman computer Interaction/ &rd edition/ Pearson Education :sia

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 409(P) < DATABASE MANAGEMENT LAB


T$+-."#: '-.$ $ & hours 2ractical 2er 3eek # % & ( * + ' C)$%"('< %

Objectives
To teach data base technology and familiariBe them with issues related to data base design through hands on practice. To be able to design new and modify databases write queries and execute them.

Database Customi9ation Creatin$ Databases / Table s2aces Creatin$ 8bjects Mo.in$ Data =eco.er) Lockin$ Pre2arin$ :22lications -or E@ecution usin$ a -ront end tool :22lication Per-ormance ToolE

R$*$)$#-$ Boo3' #EElmasri/ a.athe/ Fundamentals of 5atabase -ystems/ :ddison Wesle)E %E=amakrishnan =E/ 1ehrke GE/ 5atabase Management -ystems/ Mc1ra3 Hill

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&/() +!H-Laborator) 2ractical and record &!H- Tests #!H- =e$ularit) in the class

S$ $'($) E#% E7+ "#+("o# %Maximum Marks&/() '!H - Procedure/ conductin$ e@2eriment/ results/ tabulation/ and in-erence %!H - 7i.a .oce #!H - >air record

IT09 402(P)< M"#" P)oD$-(


T$+-."#: '-.$ $ & hours 2ractical 2er 3eek C)$%"('< %

Objectives
To estimate the ability of the student in transforming the theoretical knowledge studied so far into a working model of a computer . information system. For enabling the students to gain experience in organisation and implementation of a small pro:ect and thus acquire the necessary confidence to carry out main pro:ect in the final year.

In this 2ractical course/ each $rou2 consistin$ o- three/-our members is e@2ected to desi$n and de.elo2 a moderatel) com2le@ com2uter / in-ormation s)stem 3ith 2ractical a22licationsN this should be a 3orkin$ modelE The basic conce2ts o- 2roduct desi$n ma) be taken into consideration 3hile desi$nin$ the 2rojectE : committee consistin$ o- minimum three -acult) members s2eciali9ed in In-ormation Technolo$) or com2uter science and en$ineerin$ 3ill 2er-orm assessment o- the mini 2rojectE Students ha.e to submit a re2ort on the mini 2roject and demonstrate the mini 2roject be-ore the e.aluation committeeE The di.ision o- the total marks is into t3o/ namel)/ +!H o- the total marks to be a3arded b) the $uide / Co-ordinator and the remainin$ (!H b) the e.aluation committeeE

I#($)#+, Co#("#6o6' A''$'' $#( %/( marks)


(!H - Desi$n and de.elo2ment &!H - >inal result and Demonstration %!H - =e2ort #!H - =e$ularit) in the class

S$ ;$#%$'($) E7+ "#+("o# %Maximum Marks&/() %!H *!H %!H #!H Demonstration o- mini 2roject Practical test connected 3ith mini 2roject 7i.a .oce >air record

IT09 90/< Co =6($) G)+=."-'


T$+-."#: '-.$ $ ( hours lecture and # hour tutorial 2er 3eek

C)$%"('< *

Objectives To teach the fundamentals of computer graphics including algorithms for drawing 05 and '5 primitives ob:ect transformations conics and curves.

Mo%6,$ I (/9 .o6)') Introduction - Dis2la) de.ices - =andom-scan and raster scan monitors - Color C=T - Plasma 2anel dis2la)s - LCD Panels - Plotters - >ilm =ecorders - 1ra2hics Workstations - Dis2la) 2rocessors - 1ra2hics so-t3are In2ut/8ut2ut De.ices - Touch Panels - Li$ht Pens - 1ra2hics Tablets - %D Dra3in$ 1eometr) - Mathematics -or Com2uter 1ra2hics - : ,rie- Conce2t o- Tri$onometr) - Polar Coordinates - Parametric >unctions 7ectors - Scalar Product - Cross Product - Matrices - Scalar Multi2lication - Matri@ :ddition and Multi2lication - Matri@ In.erse - %D Trans-ormation - Ise o- Homo$eneous Coordinate S)stems/ Translation/ Scalin$/ =otation/ Mirror =e-lection/ =otation about an arbitrar) 2oint - Coomin$ and Pannin$ =ubber ,and Methods - Dra$$in$ - Parametric =e2resentation o- a Line Se$ment Mo%6,$ II (/0 .o6)') 1ra2hic 82erations - Windo32ort and .ie32ort - Elimination o- totall) .isible and totall) in.isible lines 3ith res2ect to a rectan$ular 3indo3 usin$ line and 2oint codes - E@2licit line cli22in$ al$orithm Sutherland Cohen :l$orithm - Mid-2oint subdi.ision al$orithm - >illin$ - Stack based and ;ueue based seed -ill al$orithms - Scan line seed -ill al$orithm - 1eneration o- ,ar Charts - Pie Charts - Character 1eneration Mo%6,$ III (/0 .o6)') Conics and Cur.es - ,resenhamLs Circle Dra3in$ :l$orithm A Elli2se dra3in$ al$orithm - 1eneration oElli2ses throu$h trans-ormation on circles - Cur.e Dra3in$ - Parametric =e2resentation - Cubic Cur.es Dra3in$ Cubic ,e9ier and ,-S2line Cur.es - ,eta s2lines - =ational s2lines Mo%6,$ IV (/2 .o6)') &D 1ra2hics - Trans-ormations - =i$ht handed coordinate s)stem - trans-ormation Matrices -or translation Scalin$ and =otation around a@es - 2arallel 2rojection - multi.ie3s - -ront/ to2 and side .ie3s - 8bli;ue .ie3 - Projection on @) 2lane 3ith =a)s alon$ a $i.en direction - Pers2ecti.e 2rojection - Trans-ormation matri@ to )ield one .anishin$ 2oint - Pers2ecti.e .ie3 3ith .ie32oint l)in$ on 9-a@is - e--ect o- Translatin$ the object - Com2utin$ the 7anishin$ 2oint - umerical E@am2les - Hidden sur-ace remo.al - ,ack >ace remo.al - De2th ,u--er Method

Text Books #E Hearn DE/ ,aker PEM/ $omputer 8raphics/ Prentice Hall IndiaE R$*$)$#-$ Boo3' #E e3mann W 4 S2roull =E>E/ *rinciples of "nteractive $omputer 8raphics/ Mc1ra3-Hill %E =o$ers DE>E/ *rocedural Elements for $omputer 8raphics/ Mc1ra3-Hill &E >ole) GE DE/ 7an Dam :E/ >einer SE <E/ 4 Hu$hes GE >E/ $omputer 8raphics *rinciples and *ractice/ Second Edition/ :ddison Wesle)E

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 902 N+(6)+, L+#:6+:$ P)o-$''"#: A#% F#o?,$%:$ B+'$% S>'($ '
T$+-."#: '-.$ $ % hours lecture and # hour tutorial 2er 3eek

C)$%"('< &

Objectives The course is intended to impart the use of computers to process written and spoken language for the practical and useful purposes, to translate languages to get information from the web on text data .The course also gives a sound idea on knowledge based systems.

Mo%6,$ I (/0 .o6)') IntroductionB Issues and di--iculties in LP A E.aluatin$ Lan$ua$e understandin$ S)stems A The di--erent le.els o- lan$ua$e re2resentations A 8r$ani9ation o- LP S)stems A T)2es o- LP S)stemsE Mo%6,$ II (/0 .o6)') 1rammars and Parsin$B 1rammars and sentence structures A To2 do3n 2arser A,ottom u2 chart 2arser A To2 do3n chart 2arsin$ A :u$mented $rammars A : sim2le 1rammar 3ith -eatures A Parsin$ 3ith -eatures A :u$mented Transition et3orks 5:T 6A E--icient 2arsers A Shi-t reduce 2arsers A deterministic 2arsersE Mo%6,$ III (/0 .o6)') <no3led$e ,ased S)stemB Introduction - De-inition-:rchitecture A <no3led$e =e2resentation and >ormal Lo$icB <no3led$e com2onents ALe.els o- re2resentation A<no3led$e re2resentation schemes A-ormal lo$ic A <no3led$e en$ineerin$ and In-erence A Process A Semantic net3orks--rames A Scri2ts A Production s)stemsE Mo%6,$ IV (9 .o6)') Problem Sol.in$ Strate$iesB E@hausti.e search A Lar$e search s2aces A Plannin$ ALeast commitment A Princi2le and constraint 2ro2a$ation- Classi-ication and black board ModelsE

Text Books
#E =alston/ DEWE/ Princi2les o- :rti-icial and E@2ert S)stems De.elo2ment/ Mc1ra3 Hill ,ook %E Games :llen/

Com2an) International atural Lan$ua$e Inderstandin$/ Pearson Education IncE/ %!!&

R$*$)$#-$ Boo3' #E :E 1on9ale9 and DE Dankel/ The En$ineerin$ o- <no3led$e-,ased S)stems Second Edition/ Prentice Hall/ %!!(E

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the classE

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 901< I#($)#$( T$-.#o,o:>


T$+-."#: '-.$ $ % hours lecture and # hour tutorial 2er 3eek C)$%"('< &

Objectives This course demonstrates an in&depth understanding of the tools and Ceb technologies necessary for application design and development. The course covers client side scripting like <TM# Eava-cript and introduces GM# technologies.

Mo%6,$ I (9 .o6)') Princi2les o- :22lication La)er Protocols - The Web and HTTP/ >ile Trans-erB >TP/ Electronic Mail in the Internet/ D S-The InternetLs Director) Ser.ice - Socket Pro$rammin$ 3ith TCP/ Socket Pro$rammin$ 3ith IDP/ ,uildin$ a Sim2le Web Ser.er/ Content DistributionE Mo%6,$ II (2 .o6)') W$! P+:$';Static Web 2a$eB T)2es and Issues/ tiers/ com2arisons o- Microso-t and ja.a technolo$ies/ HTML- di--erent ta$s/ sections/ ima$e 4 2ictures/ listin$s/ tables/ -rame/ -rameset/ -ormE D)namic Web Pa$esB The need o- d)namic 3eb 2a$esN an o.er.ie3 o- DHTML/ cascadin$ st)le sheet 5css6/ com2arati.e studies o- di--erent technolo$ies o- d)namic 2a$e creationE :cti.e Web Pa$esB eed o- acti.e 3eb 2a$esN ja.a a22let li-e c)cleE Mo%6,$ III (/2 .o6)')
)"v" Sc!i&t : Data t)2es/ .ariables/ o2erators/ conditional statements/ arra) object/ date object/ strin$

objectE G+8+ S$)8,$( B Ser.let en.ironment and role/ HTML su22ort/ Ser.let :PI/ The ser.let li-e c)cle/ Cookies and SessionsE GSP BGSP architecture/ GSP ser.ers/ GSP ta$s/ understandin$ the la)out in GSP/ Declarin$ .ariables/ methods in GSP/ insertin$ ja.a e@2ression in GSP/ 2rocessin$ re;uest -rom user and $eneratin$ d)namic res2onse -or the user/ insertin$ a22lets and ja.a beans into GSP/ usin$ include and -or3ard action/ com2arin$ GSP and C1I 2ro$ram/ com2arin$ GSP and :SP 2ro$ramN Creatin$ 8D,C data source name/ introduction to GD,C/ 2re2ared statement and callable statementEG2EEB:n o.er.ie3 o- G%EE 3eb ser.ices/ basics o- Enter2rise Ga.a ,eans/ EG, .sE Ga.a ,eans/ basics o- =MI/G IE Mo%6,$ IV (/0 .o6)') I#()o%6-("o# (o W$! T$-.#o,o:>-KML Technolo$ies-HTML and Web Pa$es/ KML Documents/ a.i$atin$ KML Trees 3ith KP:TH/ Schema Lan$ua$es-DTD/KML Schema/ Trans-ormin$ KML Documents 3ith KSLT/KML Pro$rammin$ usin$ D8M :PIE

Text Books #E <urose GE>E 4 =oss <EW/ $omputer =etworking, A Top &5own Approach Featuring the "nternet/ Pearson Education
%E Godbole A. S. & Kahate A, Web Technologies,Tata McGraw Hill. &E Ka.ier C/Ceb technology ; 5esign/ e3 :$e PublicationE (E Java Server Programming, J !! edition. "#$% & and #$% &&', ()$* +,bli-her-. *E Dr :nders Moller/Dr Michael Sch3art9bach/ An introduction to GM# and Ceb Technologies

:ddison Wesle)E R$*$)$#-$ Boo3' #E Dou$las EE Comer/ $omputer =etworks and "nternets with "nternet Applications/ Pearson Education %E Stallin$s/ $omputer =etworking with "nternet *rotocols/ Pearson Education :siaE &E 1oncal.es ME/ Firewalls, A $omplete 8uide/ Tata Mc1ra3 HillE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 905< C)>=(o:)+=.> +#% N$(?o)3 S$-6)"(>


5Common 3ith CS!" '!(6 T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives To introduce the principles and practices of cryptography and network security. To discuss algorithms and schemes to handle the security issues. To introduce web security.

Mo%6,$ I (/0 .o6)') &ntrod,ction: Sec,rit. ba-ic- / A-+ect- o0 networ1 -ec,rit. / Attac1- / Di00erent t.+e- 2 Sec,rit. attac1- 2Securit) ser.ices and mechanismsE Cr)2to$ra2h)B ,asic Encr)2tion 4 Decr)2tion A Classical techni;ues - Trans2osition 4 substitution ci2hers ACaesar substitution A Pol)al2habetic substitutions A S)mmetric ke) al$orithms A >iestel et3orks A Con-usion - Di--usion - D!S Algorithm / Strength o0 D!S / 3om+ari-on & im+ortant 0eat,re- o0 modern -.mmetric 1e. algorithmMo%6,$ II (/5 .o6)') P,blic 1e. cr.+to-.-tem- / The )SA Algorithm / Di00ice Hellman 1e. e4change / com+ari-on o0 )SA & D!S / Elli2tic Cur.e Cr)2to$ra2h) A umber Theor) Conce2ts Mo%6,$ III (/5 .o6)') Hash >unctions A Di$est >unctions A Di$ital Si$natures A :uthentication 2rotocolsE A 5etwor1 & A++lication Sec,rit.: Kerbero- / *678 A,thentication -ervice / !lectronic mail -ec,rit. / Prett. Good +rivac. /S9M&M! / -ec,re !lectronic Tran-action-. Mo%6,$ IV (9 .o6)') IP securit) A architecture A -eatures A Web securit) A Socket la)er and trans2ort la)er securit) A Secure electronic transactions A :irewall-

Text Books
#E William Stallin$s/ =etwork -ecurity Essentials Applications ; -tandards/ Pearson Education

:siaE R$*$)$#-$ Boo3' #E Schneier ,E/ Applied $ryptography, *rotocols Algorithms and -ource $ode in $/ Gohn Wile) %E Wenbo Mao/ Modern cryptography & Theory and *ractice/ Pearson Education :sia &E i.en 4 Cuckerman HESE/ An "ntroduction to The Theory of =umbers/ Gohn Wile) (E P-lee$er CEPE/ P-lee$er SELE/ -ecurity in $omputing/ Pearson Education 5Sin$a2ore6 P.tE LtdE *E Michel EE Whiteman/ Herbert GEMattord/ *rinciples of "nformation -ecurity/ Thomson/ 7ikas Publishin$ HouseE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 909 (P)< N$(?o)3 P)o:)+


T$+-."#: '-.$ $ & hours 2ractical 2er 3eek Objectives

"#: L+!
C)$%"('< %

To teach the working of various networking protocols Im2lementation o- PC-to-PC -ile trans-er usin$ serial 2ort and M8DEME

L+! /B

L+! 2,1< So-t3are Simulation o- IEEE 0!%E&/ 0!%E( and 0!%E* 2rotocolsE L+! 5, 0< So-t3are Simulation o- Medium :ccess Control 2rotocols A #6 1o,ack / %6 Selecti.e =e2eat and &6 Slidin$ Windo3E L+! 4< Im2lementation o- a subset o- Sim2le Mail Trans-er Protocol usin$ IDPE

L+! 9,2< Im2lementation o- a subset o- >ile Trans-er Protocol usin$ TCP/IP L+! 9< Im2lementation o- S-in$erS utilit) usin$ =emote Procedure Call 5=PC6

L+! /0< 1eneration and 2rocessin$ o- HTML -orms usin$ C1IE

R$*$)$#-$ Boo3' #E S =ichard SEWE/ @nix =etwork *rogramming/ Prentice Hall India %E Comer DEEE/ "nternetworking with T$*."*/ 7olE #/% 4 &/ Prentice Hall India &E Cam2ione etE al ME/ The Eava Tutorial $ontinued/ :ddison Wesle)

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&/() +!H-Laborator) 2ractical and record &!H- Test/s #!H- =e$ularit) in the class

S$ $'($) E#% E7+ "#+("o# %Maximum Marks&/() '!H - Procedure/ conductin$ e@2eriment/ results/ tabulation/ and in-erence %!H - 7i.a .oce #!H - >air record

IT09 902(P) Co =6($) G)+=."-' A#% M6,(" $%"+ L+!


T$+-."#: '-.$ $ & hours 2ractical 2er 3eek Objectives

C)$%"('< %

To implement the algorithms for drawing 05 and '5 ob:ect generation and ob:ect transformation. "t also aims at familiariBation of basic multimedia tools.

LIST OF EXPERIMENTS

L+! /B ,asic raster dra3in$ al$orithms im2lementations 5lines/ circle/ elli2se/ 2ol)$ons etcE6 L+! 2< Im2lementation o- al$orithms -or %D/&D object $eneration/ trans-ormations L+! 1B 1enerate a &D object/ sa) a cube/ and tr) to im2lement the -ollo3in$ usin$ an) standard $ra2hic librar) set 5-or e@am2le 82en1L librar)6 on a selected 8S #E 7ie3in$ trans-ormations %E Modelin$ trans-ormations &E Projection trans-ormations (E Dra3in$ a scene 5%D 2icture o- &D s2ace or a shot b) camera6 in.ol.in$ object L+! 5B 1enerate a &D object/ sa) a s2here/ based on sur-aces or 2ol)$onal -aces or 3ire-rame a22roach and render it de-inin$ a material/ li$ht source and li$htin$ model 2ro2erties usin$ an) standard $ra2hic librar) set 5-or e@am2le 82en1L librar)6 on a selected 8S L+! 0B Model a scene containin$ se.eral &D objects/ sa) table to2 ha.in$ se.eral objects - each object ma) be modeled as $i.en in abo.e e@2eriment - also render the scene 3ith hidden sur-aces in mind - renderin$ considerin$ a li$ht source ma) also be 2racticed - this a$ain is usin$ standard $ra2hic librar) set on a selected 8S L+! 4< Ise source code o- an) -reel) a.ailable sound recordin$/ encodin$ / decodin$ so-t3are - encodin$ / decodin$ 2ortions ma) be remo.ed be-ore actual e@2erimentation - stud) an) three audio -ormats to learn about 5a6 -ile si9e 5b6 2o2ularit) 5c6 ;ualit) o- audio re2roducedE Do the -ollo3in$ in a chosen 8S #E =ecord sound -or #! secs %E Con.ert -rom one -ormat to other &E Pla)back both the -ormats and anal)9e the results L+! 9B Stud) an) * 2o2ular still ima$e -ormats 5GPE1/ ,MP included6 - do the -ollo3in$ in a chosen 8S #E Take a sna2 o- -ace o- a 2erson usin$ di$ital camera or a 3ebcam %E Ise an) 2hoto editin$ tools 5sa)/ :dobe Photosho26 to $et desired si9e/ desired resolution 2hoto 5both color and black and 3hite ma) be $enerated6E Paint touchin$ ma) also be 2racticed &E Create the ima$e o- a decorated $reetin$ card or an identit) card usin$ ima$e creation tools and insert the 2hoto and 2rint itE 7eri-) -or color matchin$ and si9e o- the ima$e L+! 2B Ise a MPE1 decoder source code -reel) a.ailable -rom internet and do the -ollo3in$ in a chosen 8S #E Pla) MPE1 .ideo %E Modi-) the source code so that 2la) can be done -rame b) -rame L+! 9B Ise an) 3eb animation-authorin$ toolN sa) macromedia -lash/ on a chosen 8S to create sim2le animations L+! /0B Learn to use ser.er and client so-t3are -or streamin$ media - 2ick an) -reel) a.ailable so-t3are on a chosen 8S - create a 3eb 2a$e 3ith multimedia content and 2ro.idin$ interaction in some -orm to a user

R$*$)$#-$ Boo3' #E >ole) GEDE/ Dam :E7E/ >einer SE<E 4 Hu$hes G/ $omputer 8raphics, *rinciples and *ractice/ :ddison Wesle) %E Ste.ens =ET/ 8raphics *rogramming "n $/ ,P, Publications &E Ste.ens =ETE 4 Watkins CED/ Advanced 8raphics *rogramming in $ ; $>>/ ,P, PublicationsE (E 82en1L :rchitecture =e.ie3 ,oard/ Dpen8# *rogramming 8uide Pearson Education :sia *E 82en1L :rchitecture =e.ie3 ,oard/ Dpen8# +eference Manual Pearson Education :sia +E :ddele Droblas 1reenber$ 4 Seith 1reenber$/ Fundamental *hotoshop Mc1ra3 Hill 'E Linda =ichards/ Ceb 8raphics for 5ummies ID1 ,ooks

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&/() +!H-Laborator) 2ractical and record &!H- Tests #!H- =e$ularit) in the class

S$ $'($) E#% E7+ "#+("o# %Maximum Marks&/() '!H - Procedure/ conductin$ e@2eriment/ results/ tabulation/ and in-erence %!H - 7i.a .oce #!H - >air record

IT09 909 (P)< P)oD$-(


T$+-."#: '-.$ $ # hour 2ractical 2er 3eek Objectives

C)$%"('< #

To :udge the capacity of the students in converting the theoretical knowledge into practical systems.investigative analysis.

Project 3ork is -or duration o- t3o semesters and is e@2ected to be com2leted in the ei$hth semesterE Each student $rou2 consistin$ o- not more than -i.e members is e@2ected to desi$n and de.elo2 a com2lete s)stem or make an in.esti$ati.e anal)sis o- a technical 2roblem in the rele.ant areaE The 2roject ma) be im2lemented usin$ so-t3are/ hard3are/ or a combination o- bothE The 2roject 3ork ma) be undertaken in In-ormation Technolo$) or allied areas like 8S 2lat-ormsB =ele.ant to the current state o- the art 3ith su22ort -or net3orked en.ironment/ distributed com2utin$ and de.elo2ment o- multi-2lat-orm a22lications/ Internet technolo$iesB :rchitectural conce2ts/ KML/ Scri2tin$ lan$ua$es/ Middle3are 5Com2onent6 technolo$ies/ >ront end / 1IIB Code de.elo2ment or de.elo2ment based on tools/ =D,MS/,ack EndB =ele.ant to current state 3ith database connecti.it) to di--erent 2lat-orms/ Lan$ua$esB ?t/ 1lade or an) similar (1Ls/ Scri2tin$ lan$ua$es and C 4 C-Linu@ 5under 1 I $cc6 etc/ Ini.ersal net3ork a22lications de.elo2ment 2lat-orms such as G:7:/ 8S internalsB De.ice dri.ers/ =PC/ Threads/ Socket 2ro$rammin$ etcE/ et3orkin$B Mechanisms/ 2rotocols/ securit) etcE/ Embedded s)stemsB =T8S/ Embedded hard3are 3ith so-t3are -or an a22lication/ Code o2timi9ation/ securit) etcE Project e.aluation committee consistin$ o- the $uide and three/-our -acult) members s2eciali9ed in biomedical/electronics/ in-ormation technolo$)/ com2uter science/instrumentation en$$E 5Please 3rite areas o- s2eciali9ations rele.ant to the concerned branch concerned6 3ill 2er-orm the screenin$ and e.aluation othe 2rojectsE Each 2roject $rou2 should submit 2roject s)no2sis 3ithin three 3eeks -rom start o- se.enth semesterE Project e.aluation committee shall stud) the -easibilit) o- each 2roject 3ork be-ore $i.in$ consentE Literature sur.e) is to be com2leted in the se.enth semesterE Students should e@ecute the 2roject 3ork usin$ the -acilities o- the instituteE Ho3e.er/ e@ternal 2rojects can be taken u2 in re2uted industries/ i- that 3ork sol.es a technical 2roblem o- the e@ternal -irmE Prior sanction should be obtained -rom the head o- de2artment be-ore takin$ u2 e@ternal 2roject 3ork and there must be an internal $uide -or such 2rojectsE Each student has to submit an interim re2ort o- the 2roject at the end o- the ' th semesterE Members othe $rou2 3ill 2resent the 2roject details and 2ro$ress o- the 2roject be-ore the committee at the end o- the 'th semesterE *!H o- the marks are to be a3arded b) the $uide and *!H b) the e.aluation committeeE

I#($)#+, Co#("#6o6' A''$'' $#(


%!H - Technical rele.ance o- the 2roject (!H - Literature sur.e) and data collection %!H - Pro$ress o- the 2roject and 2resentation #!H - =e2ort #!H - =e$ularit) in the class

IT09 20/ Mo!",$ Co


T$+-."#: '-.$ $ ( hours lecture and # hour tutorial 2er 3eek

6#"-+("o# S>'($ '


C)$%"('< *

Objectives This course is an introduction to the field of mobile communications and focuses on the aspects of digital data transfer in wireless and mobile environments. The students require a basic understanding of communication and a rough knowledge of the "nternet or networking in general.

Mo%6,$ I (/2 .o6)') :ntennas and Pro2a$ationB :ntennas/ Pro2a$ation models/ Line-o--si$ht communications/ >adin$ in the mobile en.ironment - Si$nal Encodin$ Techni;uesB Di$ital data and :nalo$ si$nals/ :nalo$ data and :nalo$ si$nals/ :nalo$ data di$ital si$nals/ Modulation techni;ues - S2read S2ectrumB Conce2t/ >re;uenc) ho22in$/ Direct Se;uence/ CDM: A Codin$ and Error ControlE Satellite CommunicationsB Parameters/ >DM/ TDM/ 1E8#&"/ LE8 #&"/ ME8 #(!/ =outin$/ Locali9ation A Cellular et3orksB Princi2les/ >irst $eneration :nalo$/ Second 1eneration TDM:/ Second $eneration CDM:/ Third $eneration s)stemsE Mo%6,$ II (/5 .o6)') Telecommunication S)stemsB 1SM/ :rchitecture/ =adio Inter-ace/ Protocols/ Hando.er/ Securit) A Cordless s)stems and WLLB IEEE 0!%E#+/ DECT A TET=: - IMTS and MIT %!!!E Mo%6,$ III (/0 .o6)') Wireless L: technolo$)B 8.er .ie3/ In-rared L: s/ S2read s2ectrum L: s/ arro3 band micro3a.e L: s A 0!%E## 2rotocolB :rchitecture/ Ser.ices/ Medium access control/ Ph)sical la)er A ,luetooth technolo$)B 8.er.ie3/ =adio S2eci-ication/ ,aseband S2eci-ication/ Link Mana$er S2eci-ication/ Lo$ical Link Control and :da2tation ProtocolE Mo%6,$ IV (/2 .o6)') Mobile IPB 1oals/ :ssum2tions/ re;uirements/ IP 2acket deli.er)/ :$ent ad.ertisement and disco.er)/ re$istration/ Tunnelin$ and enca2sulation/ 82timi9ation/ =e.erse tunnelin$/ IP.+/ D)namic host con-i$uration 2rotocol A :d hoc net3orkin$B =outin$/ destination se;uence distance .ector/ d)namic source routin$/ hierarchical routin$/ :lternati.e metrics A Mobile TCPB Traditional TCP/ Indirect TCP/ Snoo2in$ TCP/ >ast retransmit/ selecti.e retransmission/ Transaction oriented TCP A W:PB :rchitecture/ Protocol descri2tionE

Text Books
#E Schiller GE/ Mobile $ommunications/ :ddison Wesle)
R$*$)$#-$ Boo3' #E WE Stallin$s/ Cireless $ommunications and =etworks Prentice Hall/ %!!%

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 202 H":. S=$$% N$(?o)3'


T$+-."#: '-.$ $ % hours lecture and # hour tutorial 2er 3eek C)$%"('< &

Objectives This course covers all aspects of high&speed networking and their impact on the overall network performancesE

Mo%6,$ I (9 .o6)') Hi$h s2eed lansB -ast ethernet/ s3itched -ast ethernet A>ddi/ sonet / sdhB -rame structure/ architecture la)ers/ 2a) Loads A -rame rela)B 2rotocols and ser.ices/ con$estion ControlE Mo%6,$ II (9 .o6)') &SD5: $verview, Standard-, &nter0ace- and 0,nction-, &SD5 %a.er-: Ph.-ical, Data lin1, 5etwor1, 2 Service- / ;&SD5 Architect,re and Protocol-. Mo%6,$ III (// .o6)') :TM et3orksB Protocol :rchitecture/ :TM La)er/ Cell Structure/ Cell header/ :TM :da2tation La)er/ 7arious t)2es/ Se$mentation and =eassembl)/ Con.er$ence sub-la)ers :TM Tra--ic and Con$estion ControlB Ser.ice cate$ories/ Tra--ic related attributes/ Tra--ic mana$ement -rame3ork/ Tra--ic mana$ement/ :,= tra--ic mana$ement/ Si$nalin$/ Protocol si$nalin$/ Meta si$nalin$/ TCP/IP o.er :TME Mo%6,$ IV (/0 .o6)') 82tical et3orksB Wa.elen$th Di.ision Multi2le@in$/ 82tical et3orkin$ e.olution/ et3ork :rchitectures/ Enablin$ Technolo$ies/ 7arious issues in Wa.elen$th =outed et3orks/ 82tical Circuit s3itchin$/ IP o.er :TM o.er S8 ET o.er WDM/ IP o.er S8 ET o.er WDM/ IP o.er WDM A 7arious ModelsE Text Books #E William Stallin$s/ "-5= and broadband "-5= with Frame +elay and ATI >ourth edition/ Pearson Education %!!! %E =ainer Handel/ Man-red E Huber/ and Ste-an Schroder/ ATM =etworks H$oncepts *rotocols Applications/ Second edtion/ :ddison Wesle)/ #""( R$*$)$#-$ Boo3' #E CESi.a =am Murth) and 1E Mohan/ C5M optical =etworks H $oncepts 5esign and Algorithms/ Printice Hall India/ %!!%

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 200 (P) < S$ "#+)


T$+-."#: '-.$ $ & hours 2ractical 2er 3eek Objectives To assess the ability of the student to study and present a seminar on a topic of current relevance in computer science engineering information technology or allied areas C)$%"('< %

It enables the students to $ain kno3led$e in an) o- the technicall) rele.ant current to2ics and ac;uire 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 2a2ersN the re2ort must not be re2roduction o- an) ori$inal 2a2erE : committee consistin$ o- three/-our -acult) members 3ill e.aluate the seminarE

I#($)#+, Co#("#6o6' A''$'' $#( %!H - =ele.ance o- the to2ic and literature sur.e) *!H - Presentation and discussion %!H - =e2ort #!H - =e$ularit) in the class and Partici2ation in the seminar

IT09 204(P) < P)oD$-(


T$+-."#: '-.$ $ ## hours 2ractical 2er 3eek C)$%"('< '

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 s2eciali9ed in com2uter science and en$ineerin$E *!H o- the marks is to be a3arded b) the $uide and *!H b) the e.aluation committeeE

I#($)#+, Co#("#6o6' A''$'' $#( (!H - Desi$n and de.elo2ment/Simulation and anal)sis &!H - Presentation 4 demonstration o- results %!H - =e2ort #!H - =e$ularit) in the class

IT09 209 (P) < V"8+ Vo-$


C)$%"('< & 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 Ini.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 >or -inal .i.a-.oce/ candidates should 2roduce certi-ied re2orts o- mini 2roject/ seminar/ and 2roject 5t3o interim re2orts and main re2ort6E 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 :llotment o- marks -or .i.a-.oce shall be as $i.en belo3E A''$'' $#( "# V"8+;8o-$ (!H - Subjects &!H - Project and Mini Project %!H - Seminar #!H - Industrial trainin$/industrial .isit/educational tour or Pa2er 2resented at ational-le.el

ELECTIVES
IT09 L0/ < DIGITAL SIGNAL PROCESSING
T$+-."#: '-.$ $ & hours lecturer and # hour tutorial 2er 3eek C)$%"('< (

Objectives $urrent communication technology is based on digital signal processing. <ere the fundamental principles of various transforms and the tools used in analysis and design of discrete&time systems for signal processing are introduced.

Mo%6,$ I(/2 .o6)') Discrete time si$nals and s)stems - discrete si$nal se;uences - linear shi-t in.ariant s)stems - discrete si$nals - stabilit) and casualt) - di--erence e;uations - -re;uenc) domain re2resentations - -ourier trans-orm and its 2ro2erties - relationshi2 bet3een s)stem re2resentations/ re.ie3 o- C-trans-orms Mo%6,$ II (/0 .o6)') Discrete >ourier trans-orm - re2resentation o- discrete >ourier series - 2ro2erties o- discrete >ourier series 2eriodic con.olution - D>T - 2ro2erties o- D>T - com2utation o- D>T - circular con.olution - linear con.olution usin$ D>T - >>Ts - DIT->>T and DI>->>T - >>T al$orithm -or com2osite Mo%6,$ III (/1 .o6)') Desi$n o- di$ital -ilters - II= and >I= -ilters - lo3 2ass analo$ -ilter desi$n - ,utter3orth and Cheb)she. -ilters - desi$n e@am2les - bilinear trans-ormation and im2ulse in.ariant techni;ues - >I= -ilter desi$n linear 2hase characteristics - 3indo3 method Mo%6,$ IV (/2 .o6)') =eali9ation o- di$ital -ilters - discrete -orm I and II - cascade and 2arallel -orm - -inite 3ord len$th e--ects in di$ital -ilters - ;uanti9er characteristics - saturation o.er-lo3 - ;uanti9ation in im2lementin$ s)stems - 9ero in2ut limit c)cles - introduction to DSP 2rocessors Text Books R$*$)$#-$ Boo3' #E Proakis 4 Manolalus/ 5igital -ignal *rocessing *rinciples Algorithm ; Applications E Prentice HallE %E 822enheim 4 Scha-er/ 5iscrete Time -ignal *rocessing/ Prentice HallE &E Ludeman LEC/ Fundamentals of 5igital -ignal *rocessing Har2er 4 =o3 Publishers E (E 7an 7alkenbur$ MEE/ Analog Filter 5esign Holt SaundersE *E Terrel TEGE 4 Shark LE</ 5igital -ignal *rocessing/ Macmillan

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L02 < OPTIMIAATION TECHNIEUES


T$+-."#: '-.$ $ & hours lecturer and # hour tutorial 2er 3eek C)$%"('< (

Objectives To introduce different methods algorithms and solution procedures to solve optimiBation problems. To formulate and develop mathematical models for the solution for the real world problems in the area of $omputer related applications.

Mo%6,$ I (/1 .o6)') 8.er.ie3 o- 82erations =esearch - Conce2t o- Linear Pro$rammin$ Model - De.elo2ment o- LP Models 1ra2hical Method - Linear Pro$rammin$ Methods A Dualit) Trans2ortation Problem - :ssi$nment Problem - et3ork Techni;ues Mo%6,$ II (/1 .o6)') Inte$er Pro$rammin$ - >ormulations - Cuttin$-2lane :l$orithm - ,ranch-and-,ound Techni;ue - Cero-8ne Im2licit Enumeration Techni;ue Mo%6,$ III (/1 .o6)') In.entor) Control - ?ueuin$ Theor) - Decision Theor) - 1ame Theor) Mo%6,$ IV (/1 .o6)') D)namic Pro$rammin$ - :22lications o- D)namic Pro$rammin$ - Project Mana$ement Text Books #E =E Panneersel.am/ Dperations +esearch/ Prentice Hall o- India/ %!!%E Cha2ters # to #%E R$*$)$#-$ Boo3' #E SE <ala.ath)/ Dperations +esearch/ 7ikas Publishin$ House P.tE %E SE Dharani 7enkatakrishnan Dperations +esearch H *rinciples And *roblems/ <eerthi Publishin$ House/ #""% &E <anti S3aru2/ Manmohan/ PE<E 1u2ta/ Dperations +esearch E Sultan Chand 4 Sons/#""#E

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L01< INFORMATION THEORY & CODING


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives The sub:ect deals with the fundamentals of information quality error control in communication process and various systems of coding information for reliable communications. 3uilt on a sound mathematical basis the methods developed in this field of study are essential in a study of communication systems information technology and computing. A background in algebraic structures would prove helpful while learning this sub:ect.

Mo%6,$ I (/5 .o6)') 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->ano 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) theorem Mo%6,$ II (/5 .o6)') 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$ Mo%6,$ III (/5 .o6)') Introduction to al$ebra - $rou2s - -ields - binar) -ield arithmetic - construction o- $alois -ield - basic 2ro2erties - com2utations - .ector s2aces - matrices - ,CH codes - descri2tion - decodin$ - reed solomon codes Mo%6,$ IV (/0 .o6)') Codin$ - con.olutional codes - encoder - $enerator matri@ - trans-orm domain re2resentation - state dia$ram - distance 2ro2erties - ma@imum likelihood decodin$ - 7iterbi decodin$ - se;uential decodin$ - interlea.ed con.olutional codes

Text Books

#E Simon Ha)kin/ $ommunication -ystems/ Gohn Wile)E %E Shu Lin 4 Costello DEG/ Error $ontrol $oding & Fundamentals and Applications Prentice
Hall IncE En$le3ood Cli--s R$*$)$#-$ Boo3' #E Das GE/ Malik SE<E 4 Chatterje PE</ *rinciples of 5igital $ommunication e3 :$e International LimitedE %E Sam Shanmu$ham/ Di$ital and Analog $ommunications/ GohnE &E Simon Ha)kin/ 5igital $ommunications/ GohnE (E Taub 4 Shillin$/ *rinciples of $ommunication -ystems/ Tata Mc1ra3 HillE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L05< LINEAR SYSTEM ANALYSIS


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives This course material includes the analysis of the behaviour of linear systems and apply modern control theories to the synthesis of dynamical systems. Dn completion of this course students will be able to analyse and design complex signals and systems in the time and frequency domains.

Mo%6,$ I< S>'($ -o#-$=(' +#% o%$,"#: o* '>'($ ' (// .o6)') S)stems A sub s)stems A elements A s)stems a22roach A classi-ication o- s)stems A static and d)namic s)stems A sub s)stems A linear and non linear s)stems A distributed and lum2ed s)stems A time in.ariant and time .ar)in$ s)stems A stochastic A deterministic s)stems A s)stem modelin$ and a22ro@imations A su2er 2osition 2rinci2le A homo$eneit) and additi.it) A modelin$ o- electrical s)stems A acti.e and 2assi.e elements A resistance inductance and ca2acitance A d)namic e;uations usin$ <irchho--Fs current and .olta$e la3s A =L/ =C and =LC circuits and their d)namic e;uations A block dia$rams and si$nal -lo3 $ra2h A masons $ain -ormulaE Mo%6,$ II< Mo%$,"#: o* #o# $,$-()"-+, '>'($ ' (// .o6)') Modelin$ o- translation and rotational mechanical s)stems A di--erential e;uations -or mass s2rin$ dash2ot elements/ DFalembertFs 2rinci2le A rotational inertia A sti--ness and bearin$ -riction A $ear trains A e;ui.alent inertia and -riction re-erred to 2rimar) and secondar) sha-ts A d)namic e;uations -or t)2ical mechanical s)stems A electro mechanical analo$ues - -orce A current and -orce A .olta$e analo$ue A ca2acitance and resistance o- thermal/ h)draulic 2neumatic s)stems A d)namic e;uations -or sim2le s)stems A com2arison oelectrical/ electromechanical/ h)draulic and 2neumatic s)stemsE Mo%6,$ III< T)+#'*$) *6#-("o# +#% (" $ %o +"# +#+,>'"' (/0 .o6)') Ise o- la2lace trans-orms A conce2t o- trans-er -unction A im2ulse res2onse A con.olution inte$ral A res2onse to arbitrar) in2uts A trans-er -unction o- t)2ical s)stems discussed in module I A time domain anal)sis A test in2uts A ste2 - .elocit) and tram2 in2uts A transient and stead) state res2onse A -irst and second order A under dam2ed and o.er dam2ed res2onses A ma@imum o.ershoot A settlin$ time- rise time and time constant A hi$her order s)stems A stead) state error A error constants and error di--erent t)2es oin2uts A >ourier series e@2ansion o- 2eriodic -unctions A s)mmetric conditions A e@2onential -orm o- >ourier series A >ourier inte$rals and >ourier trans-orm A s2ectral 2ro2erties o- si$nals A anal)sis b) >ourier methodsE Mo%6,$ IV< S(+($ '=+-$ +#+,>'"' +#% '(+!","(> o* '>'($ ' (/0 .o6)') Conce2t o- state A state s2ace and state .ariables A ad.anta$e o.er trans-er -unction a22roach A state e;uations -or t)2ical electrical and mechanical and electro mechanical s)stems A re2resentation -or linear time .ar)in$ and time .ariant s)stems A solution o- state e;uation -or t)2ical test in2uts A 9ero sate and 9ero in2ut res2onse A conce2t o- stabilit) A bounded in2ut bounded out2ut stabilit) A L)a2uno.Fs de-inition ostabilit) A s)m2titic stabilit) A Stabilit) in the sense o- L)a2uno. A =outh Hur3it9 criterion o- stabilit) -or Sin$le In2ut Sin$le 8ut2ut linear s)stems described b) trans-er -unction modelE

R$*$)$#-$ Boo3' #E Chen$ D </ #inear -ystem Analysis :ddison Wesle)E %E Tri2ati G / #inear -ystem Analysis/ e3 :$e InternationalE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L00< INFORMATION RETRIEVAL


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives "n the current scenario of information explosion tools and techniques for deriving the right information at the right time will give a competitive edge to an organiBation. This paper examines this aspect in detail in the context of the Corld Cide Ceb. "t covers many forms of information such as text image audio and video formats and presents several research issues related to different "+ tasks.

Mo%6,$ I (/2 .o6)') IntroductionB In-ormation .ersus Data =etrie.al/ I=B Past/ 2resent/ and -utureE ,asic conce2tsB The retrie.al 2rocess/ lo$ical .ie3 o- documentsE Modelin$B Ta@onom) o- I= models/ ad-hoc retrie.al and -ilterin$E Classic I= modelsB Set theoretic/ al$ebraic/ 2robabilistic I= models/ models -or bro3sin$E Mo%6,$ II (/2 .o6)') =etrie.al e.aluationB Per-ormance e.aluation o- I=B =ecall and Precision/ other measures/ =e-erence Collections/ such as T=EC/ C:CM/ and ISI data setsE ?uer) Lan$ua$esB ke)3ord based ;ueries/ sin$le 3ord ;ueries/ conte@t ;ueries/ ,oolean ?ueries/ ?uer) 2rotocols/ ;uer) o2erationsE Mo%6,$ III (/2 .o6)') Te@t and Multimedia Lan$ua$es and 2ro2erties/ Metadata/ Te@t -ormats/ Marku2 lan$ua$es/ Multimedia data -ormats/ Te@t 82erationsE Inde@in$ and searchin$B In.erted -iles/ Su--i@ trees/ Su--i@ arra)s/ si$nature -iles/ se;uential searchin$/ Pattern matchin$E Mo%6,$ IV (/4 .o6)') Multimedia I=B S2atial access methods/ 1eneric multimedia Inde@in$ a22roach/ Distance -unctions/ -eature e@traction/ Ima$e -eatures and distance -unctionsE Searchin$ the WebB Characteri9in$ and measurin$ the

WebE Search En$inesB Centrali9ed and Distributed architectures/ user Inter-aces/ =ankin$/ Cra3lin$ the Web/ Web directories/ D)namic search and So-t3are :$entsE Text Books

#E =E ,ae9a-Rates and ,E =E eto/ Modern "nformation +etrieval/ Pearson Education/ %!!(E


R$*$)$#-$ Boo3' #E CEGE .an =ijsber$en/ "nformation +etrieval/ ,utter3orths/ #"'" %E CEDE Mannin$ and HE Schut9e/ Foundations of -tatistical natural #anguage *rocessing %$hapters 2' 24 and 2/ only)/ The MIT Press/ Cambrid$e/ LondonE%!!# &E Da.id Hand/ Heikki Mannila/ Padhraic Sm)th/ 5ata Mining/ Prentice hall o- IndiaE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L04< REAL TIME COMPUTER CONTROL SYSTEMS


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives The emphasis of the course will be primarily on abstract models of timed computation and the analysis of scheduling algorithms. The aim of the course is to bring students up to a point that they understand the motivation theoretical background and some of the work that has been done in the field of real&time systems.

Mo%6,$ I (/5 .o6)') :rchitectures -or Com2uter Control S)stemsB Centrali9ed :rchitecture/ Distributed Com2uter control architecture/ Data hi$h3a) s)stem/ >oreseable -uture trends/ Di$ital control al$orithmsB Introduction com2uter control/ sel- tunin$ and ada2ti.e al$orithms Su2er.isor) control s)stemsB Introduction/ Multila)er hierarchical Structures/ S)stem decom2osition/ 82en- loo2 coordination strate$ies/ Model realit) di--erences/ Closed - loo2 coordination strate$ies/ inte$rated s)stem o2timi9ation and 2arameter estimation 5IS8PE6/ Double iterati.e strate$ies/ Illustrati.e e@am2leE Mo%6,$ II (/1 .o6)') Construction o- so-t3are -or real-time com2uter control s)stemsB Introduction/ Problems o- real-time so-t3are construction/ Desi$n techni;ues and tools/ M:SC8T/ Structured De.elo2ment o- real- time s)stemsE De2endabilit)/ >ault detection and -ault toleranceB Ise o- redundanc)/ >ault tolerance in mi@ed hard3are- so-t3are s)stems/ >ault detection measures/ >ault detection mechanisms/ Dama$e containment and assessment/ Pro.ision o- -ault toleranceE Mo%6,$ III (/2 .o6)') Lan$ua$es -or real-time controlB ,asic re;uirements/ So-t3are com2onents/ Creation and mana$ement otasks/ Interru2ts and de.ice handlin$/ Communication bet3een so-t3are com2onents/ Mutual e@clusion/ E@ce2tion handlin$E Mo%6,$ IV (/1 .o6)') E@2ert s)stems in real-time controlB <no3led$e based 2rocess mana$ement/ =e2resentation o- kno3led$e/ =easonin$ in real-time/ :22lications o- kno3led$e based s)stems -or 2rocess mana$ementE =eal-time o2eratin$ s)stemsB =eal-time multitaskin$ o2eratin$ s)stems/ Task mana$ement/ task schedulin$ and dis2atch/ Task co-o2eration and communication/ Producer consumer 2roblemE Distributed 2rocessin$B Distributed data/ Distributed controlE

R$*$)$#-$ Boo3' #E SESE Lamba 4 REPESin$h/ Distributed Com2uter Control S)stems/ %E S)l.ia 1oldsmith/ +eal&time -ystmes 5evelopment/ Prentice Hall/ #""& &E Ian P)le/ Peter Hruschka/ etal/ *eter <ruschka etal +eal&Time -ystem/ Wile) Series/ #""&

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L09B SOFT COMPUTING


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

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 optimisation 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 behaviour of programs based on soft computing.

Mo%6,$ I (/1 .o6)') >u99) s)stemsB Cris2 sets A >u99) sets A 82eration and 2ro2ertiesE >u99) relations A E;ui.alence and tolerance relationsE >u99) membershi2 -unction- t)2es and de-initionsE Membershi2 .alue assi$nments A =ule based s)stemsE T)2e o- -u99) in-erenceE Structure and 2arameters o- a >u99) s)stem- com2uter assi$nmentE Mo%6,$ II (/1 .o6)') eural et3orksB ,iolo$ical ins2iration A euron model and et3ork architectures 2erce2tion A architecture/ learnin$ ruleE Limitations o- multi2la)er 2erce2tion- ,ack 2ro2a$ation al$orithm Alearnin$ rule A com2uter assi$nmentsE

Mo%6,$ III (/1 .o6)') 1enetic :l$orithmB 1oals o- o2timi9ation A Introduction to 1: A terminolo$iesE Sim2le 1:Data structureE 1enetic o2eration A crosso.er/ mutation/ -itness scalin$/ In.ersion- : Multi 2arameter ma22ed -i@ed 2oint codin$ A com2uter assi$nmentsE Mo%6,$ IV (/1 .o6)') E.olutionar) 2ro$rammin$B Sin$le and multi objecti.e o2timi9ation-$eneral al$orithm-,inar) 1:/ =eal 2arameter 1:/ constraint handlin$ in 1: E.olution strate$ies $eneral 2ro$rammin$ A com2uter assi$nmentsE :22lications to .arious branches o- En$ineerin$ and science- :22lication o- -u99)/ neural/ 1: and EP in com2uter science/ electrical/ communication/ instrumentation and control/ mechanical and ci.il en$ineerin$E

Text Books
#E Timoth) GE =oss T>u99) lo$ic 3ith En$ineer a22licationF Mc1ra3 HillE

R$*$)$#-$ Boo3' #E Martin TE Ha$am Ho3ard ,EDeruth/ Mark ,eale/ =eural =etwork 5esign
Thom-on 3om+,ter Pre-

&nternational

%E :le@ei >edoro./ =eural =etwork 5esign :ddison Wesle)/ %!!%E &E Da.id EE 1old ,er$/ 8enetic Algorithm Pearson Education %!!%E (E <al)anmo) Deb/ Multi ob:ective optimiBation using Evolutionary Algorithm Gohn Wile) and sons %!!% I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L02B DIGITAL IMAGE PROCESSING


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

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.

Mo%6,$ I (/1 .o6)') D":"(+, I +:$ F6#%+ $#(+,'< di$ital ima$e re2resentation A-undamental ste2s in.ol.ed in di$ital ima$e 2rocessin$ A com2onents o- ima$e 2rocessin$ s)stem A ima$e sensin$ and ac;uisition A ima$e sam2lin$ and ;uanti9ation A basic relationshi2s bet3een 2i@els A e@am2les o- -ields that use di$ital ima$e 2rocessin$E I +:$ T)+#'*o) '< introduction to >ourier trans-orm A D>T A >>T A cosine/ sine/ hadamard/ haar/ slant and <L trans-ormsE Mo%6,$ II (/1 .o6)') I +:$ E#.+#-$ $#(< basic $ra) le.el trans-ormations A histo$ram 2rocessin$ A enhancement usin$ arithmetic/lo$ic o2erations A basics o- s2atial and -re;uenc) domain -ilterin$ A smoothin$ s2atial and -re;uenc) domain -ilters - shar2enin$ s2atial and -re;uenc) domain -iltersE Co,o) I +:$ P)o-$''"#:< -undamentals A color models A 2seudo color ima$e 2rocessin$ A color trans-ormations A color ima$e smoothin$ and shar2enin$ A color se$mentation A noise in color ima$esE Mo%6,$ III (/1 .o6)') I +:$ R$'(o)+("o#< model o- the ima$e de$radation/restoration 2rocess A noise models A restoration in the 2resence o- noise onl)-s2atial -ilterin$ A 2eriodic noise reduction b) -re;uenc) domain -ilterin$ A linear/ 2osition-in.ariant de$radations A estimatin$ the de$radation -unction A in.erse/ 3iener/ constrained least s;uare and $eometric mean -ilterin$ A $eometric trans-ormationsE W+8$,$(' +#% M6,(" )$'o,6("o# =)o-$''"#:< back$round A Multi resolution e@2ansions A 3a.elet trans-orms in one dimension and t3o dimensions A -ast 3a.elet trans-orm A 3a.elet 2acketsE Mo%6,$ IV (/1 .o6)') I +:$ Co =)$''"o# & I +:$ S$: $#(+("o#< -undamentals A ima$e com2ression models A elements oin-ormation theor) A error--ree com2ression A Loss) com2ression A ima$e com2ression standardsE Mo)=.o,o:"-+, I +:$ P)o-$''"#:< 2reliminaries A dilation and erosion A o2enin$ and closin$ A hit-or-miss trans-orm A some basic mor2holo$ical al$orithmsE I +:$ S$: $#(+("o# B - detection o- discontinuities A ed$e linkin$ and boundar) detection A thresholdin$ A re$ion based se$mentationE =e2resentation and Descri2tionB re2resentation A boundar) descri2tors A re$ional descri2tors A relational descri2torsE

Text Books

#E =a-ael CE 1on9ale9 and =ichard EE Woods/ 5igital "mage *rocessingP/ %nd edition/ Pearson
Education P.tE Ltd/ %!!%E R$*$)$#-$ Boo3'

#E :nil <E Gain/ Fundamentals of 5igital "mage *rocessing/ Prentice Hall o- India/
%!!#

%E =a-ael CE 1on9ale9 and =ichard EE Woods/ 5igital "mage *rocessing/ :ddison Wesle)/
%!!!

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L09B VLSI DESIGN


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives
To impart the required skills to the students in design of 7#-" components Mo%6,$ I (/1 .o6)') M8S DE7ICES : D CI=CIITSB The M8S circuit -undamentals A De2letion and enhancement mode 2ullu2s A Transit times o- clock 2eriod A E--ects o- Scalin$ do3n its dimensions o- M8S circuits and s)stemsE M8S P=8CESSB Models o- anal)9e transistor circuits A The M8S -abrication 2rocess A M8S lambda based la)out A rules5+6E Mo%6,$ II (/2 .o6)') D:T: : D C8 T=8L >L8W I SRSTEM:TIC ST=ICTI=EB otation A T3o 2hase locks A Shi-t re$isters A Im2lementation A D)namic re$isters A Desi$nin$ subs)stems A =e$ister to re$ister trans-er A Combinational lo$ic A se;uential lo$ic -inite state machineE Mo%6,$ III (/2 .o6)')

SRSTEM LE7EL DESI1 B Desi$n o- an :LI Subs)stem A Carr) look ahead adders 2arallel multi2liers A PL: A decoders A encoders A Multi2le@ers A ,uses A Encodin$ and Control 82erators data 2ath chi2E Mo%6,$ IV (/0 .o6)') DESI1 SRSTEM C8 CEPTSB De-initions A Ste2s in the desi$n o- a 7LSI Part-Plannin$ Lo$ic desi$n and simulation A Ph)sical desi$n APlacement and 3irin$ ADe.elo2ment o- routin$ al$orithm A testin$ Desi$n database AC:D ToolsE :PPLIC:TI8 8> 7LSI T8 S8L7E C8MPIT:TI8 P=8,LEMB Concurrenc) in com2uters:l$orithms -or 7LSI 2rocess arra) A Matrices .ector multi2lication A Con.olution al$orithmE

Text Books #E Pucknell DEMshra$himEk/ 3asic 7#-" 5esign *rinciples and Applications/ Pretince Hall/#"0*E %E Car.er Meed and L)nn Con3a)/ "ntroduction to 7#-" -ystems :ddison Wesle)-#"0! cha2#-0E R$*$)$#-$ Boo3'

#E

acolm =EHaskard and Ian/C Ma)/ Analog 7#-" 5esign =MD- and $MD-/ Prentice Hall/#"0*E %E Thomas EEDillin$er/ 7#-" Engineering/ Prentice Hall/#"00E

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L/0< INTELLIGENT COMPUTING


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives
To expose students to a variety of intelligent system applications currently being explored in the field including agents and multi agent system data mining and information retrieval. To introduce concepts models algorithms and tools for development of intelligent systems. 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 computatation

Mo%6,$ I (/4 .o6)') Introduction< Histor) o- :I - Intelli$ent a$ents - ature o- en.ironments A structure o- a$ents and its -unctions - 2roblem sol.in$ a$ents - search strate$ies-sol.in$ 2roblems b) searchin$- ,readth--irst - De2th-irst - De2th-limited- Iterati.e dee2enin$- ,idirectional - In-ormed search methods- :U- :8U- :d.ersarial search - :l2ha-,eta Prunin$E F#o?,$%:$ R$=)$'$#(+("o#B <no3led$e-,ased :$ent- lo$ic -Pro2ositional Lo$ic - >irst-8rder Lo$ic 5>8L6 - ;uanti-iers - 1oal-,ased :$ent A kno3led$e en$ineerin$ - >rame S)stems and Semantic et3orks Scri2tsE Mo%6,$ II (/2 .o6)') R$+'o#"#:B =easonin$ 2atterns in 2re2ositional lo$ic - In-erence in >irst-8rder Lo$ic- Ini-ication >or3ard and ,ack3ard Chainin$ - =esolution - =easonin$ s)stems - Theorem Pro.ers - reasonin$ 3ith de-ault in-ormation - Truth Maintenance s)temsE Mo%6,$ III (/2 .o6)') P,+##"#:< Sim2le Plannin$ :$ent - -rom Problem Sol.in$ To Plannin$ A ,asic =e2resentations >or Plannin$ - Practical Planners- Hierarchical Decom2osition - =esource Constraints - Incertaint) Probabilistic =easonin$ S)stemsE Mo%6,$ IV (/2 .o6)') L$+)#"#:< 1eneral Model 8- Learnin$ :$ents - Inducti.e Learnin$ A Com2utational Learnin$ Theor) Learnin$ In eural :nd ,elie- et3orks - =ein-orcement Learnin$ - T)2es 8- Communicatin$ :$ents A roboticsB Tasks/ Parts/ Con-i$uration S2aces/ a.i$ation :nd Motion Plannin$E

Text Books #E Stuart GE=ussell and Peter or.i$/ Artificial "ntelligence, A Modern Approach/ Pearson Education :sia/ II edition/ %!!&E R$*$)$#-$ Boo3'

#E Elaine =ich and <e.in <ni$ht/ Artificial "ntelligence/ Tata Mc 1ra3 Hill 2ublisher A %nd
edition %E Dan WEPatterson/ "ntroduction to Artificial "ntelligence and Expert -ystems/ Prentice hall oIndia

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L//< OPTICAL COMMUNICATION NETWORFS


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives
The course aims at providing the students the fundamentals of present optical communication systems and 5iscusses both theoretical and applied issues of fiber optics operations. 3y the end of this course students will be able to analyBe and design optical networks by studying the optical network elements needed for the implementation of all optical network nodes.

Mo%6,$ I (/5 .o6)') Introduction/ >irst $eneration and second $eneration o2tical net3orks/ 82tical La)er/ :ll- 82tical et3orks/ Transmission ,asics/ >ibers and :m2li-iersE Wa.elen$th Di.ision Multi2le@in$ 5WDM6 et3ork ElementsB 82tical Line Terminals/ 82tical Line :m2li-iers/ 82tical :dd/dro2 Multi2le@ersE 82tical Cross Connects Enablin$ Technolo$ies - WDM 82tical et3ork :rchitecturesB ,roadcast and Select et3orks/ Wa.elen$th =outed et3orks A M:C 2rotocols -or ,roadcast and select net3orksE Mo%6,$ II (/5 .o6)') Wa.elen$th routin$ al$orithmsB Classi-ication/ =W: al$orithms/ >airness and :dmission control/ Distributed Protocols A Wa.elen$th Con.ertible et3orksB eed and Structure/ =outin$ in Con.ertible et3orks A =eroutin$ :l$orithmsB ,ene-its/ Issues/ Li$ht 2ath Mi$ration/ =eroutin$ Schemes/ :1 and MWP1 methodsE 7irtual To2olo$) Desi$nB Sub-2roblems/ Problem -ormulation/ Desi$n Heuristics/ =e$ular To2olo$) Desi$n/ 1ra2h colorin$ A 7irtual to2olo$) recon-i$urationB eed/ =econ-i$uration due to tra--ic chan$esE Mo%6,$ III (/2 .o6)') Control and Mana$ementB et3ork Mana$ement >unctions/ 82tical La)er Ser.ices/ La)ers/ >ault Mana$ement/ Con-i$uration Mana$ement/ Connection Mana$ement A et3ork Sur.i.abilit)B ,asic conce2ts/ Protection in S8 ET and IP et3orks/ 82tical La)er Protection Schemes/ Multi2le@in$ Techni;ues/ Pro.isionin$E Mo%6,$ IV (/2 .o6)') 82tical InternetsB 82tical Circuit S3itchin$/ ,urst S3itchin$/ Packet S3itchin$/ :ccess et3orksB >TTC/ 82tical Multicast =outin$B ode :rchitecture/ Source based and Steiner Tree based Multicast tree $enerationE Text Books #E =aji. =amas3ami and <umar E Si.arajan/ =etworks H A *ractical *erspective/ Mor$an <au--mann Publishers/ %!!%E %E CE Si.a =am Murth) and 1E Mohan/ C5M Dptical =etworks H $oncepts 5esign and Algorithms Printice Hall India/ %!!%E

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L/2< FAULT TOLERANT SYSTEMS


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives
To equip the students the knowledge of concepts and terminologies of fault tolerant systems system design including, +eliability 5ependability Error 5etection Error +ecovery Fault Treatment and +edundancy Management. Thos course addresses design modeling analysis and integration of hardware and software to achieve dependable computing system employing on&line fault tolerance

Mo%6,$ I (/1 .o6)') IntroductionB >ault Pre.ention ->ault tolerance A antici2ated and unantici2ated >aults- Test $eneration -or di$ital s)stems- Combinational lo$icE et3ork ,oolean di--erence method test $eneration -or se;uential circuits- -ault simulationE Mo%6,$ II (/0 .o6)') Error Model B 1eneral codin$ scheme A Parit) checkin$ code- arithmetic code A code -or com2uter memories Acheckin$ errors in lo$ical o2eration A communication codin$E >ault ToleranceB Codin$ techni;ue--ault tolerant sel- checkin$ and -ail sa-e circuits--ault tolerant in combinatorial and se;uential circuits- s)nchronous and as)nchronous -ail sa-e circuitsE Mo%6,$ III (/2 .o6)') :rchitecture B >ault tolerant com2uters - $eneral 2ur2ose commercial s)stems--ault tolerant multi2rocessor and 7LSI based communication architectureE Mo%6,$ IV (/2 .o6)') >ault Tolerant So-t3areB Desi$n- -.ersion 2ro$rammin$ reco.er) block - acce2tance tests--ault trees.alidation o- -ault tolerant s)stemsE

T$7( Boo3' #E <E<EPradhan/ Fault Tolerant computing theory and techniques volume """/ Prentice Hall/
%!!#E

%E :nderson and Lee/ Fault Tolerant principles and practice/ PH #"0"E R$*$)$#-$ Boo3' #E Para$ <E Lala/ S>ault Tolerant and >ault Testable/ Hard3are desi$nS PHI #"0*
%E L:L:/ S Di$ital s)stems desi$n usin$ PLDLs S/PHI #""! &E E E ,is3as/ SLo$ic Desi$n theor)S/ PHI #""! (E Shem / to) Le.ei / :shok <E:$ar3ala / S>ault Tolerant S)stem desi$nS/ Tata Mc1ra3 Hill/ #""(

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L/1< NETWORF ADMINISTRATION AND MANAGEMENT


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives
At the end of the course the student will understand ma:or functional areas of network management remote network monitoring web page management security network monitoring and control. The various topics in this course material covers the extend breadth and depth of a complete network management plan for a moderate to large network enterprise.

Mo%6,$ I (/1 .o6)') et3ork Mana$ement $oals/ or$ani9ation/ and -unctions- et3ork monitorin$- et3ork control- et3ork mana$ement tools-net3ork statistics measurement s)stems- et3ork mana$ement s)stems-Commercial net3ork mana$ement s)stems-S)stem mana$ement- Enter2rise mana$ement solutionsE Mo%6,$ II (/1 .o6)') S MP.# et3ork mana$ement or$ani9ation and communication -unction models structure o- S MP mana$ement in-ormation-stanadards-S MP.% s)stem architecture 2rotocol- 2rotocol s2eci-ication-S MP.& architectureE Mo%6,$ III (/1 .o6)') =emote net3ork monitorin$ conce2ts-1rou2 mana$ement-=M8 alarms-2ractical issues-:=M net3ork mana$ement-Telecommunication net3ork mana$ement-TM conce2tual model-architecture- et3ork mana$ement a22licationsE Mo%6,$ IV (/1 .o6)') :dministerin$ 3indo3s T s)stems- startu2-shutdo3n and ser.er con-i$uration-user accounts-mana$in$ 2rocess-risk and -ile s)stem-backu2s- et3ork con-i$uration-Print ser.ices-Securit)Linu@ :dministration- =outin$- et3ork hard3are-Domains ame S)stems-Sharin$ s)stem -iles-E-mailet3ork mana$ement and debu$$in$-Securit)

Text Books E.i emeth/ #inux Administration <andbook/ Prentice Hall %!!% %E :elean >risch/ Essential Cindows =T system Administration -irst edition/Gan #""0/ 8F=eille) 4 :ssociates Inc &E Mani Subramanian/ =etwork Management *rinciples and *ractice :ddison Wesle)/ %!!!E #E R$*$)$#-$ Boo3'

#E William Stallin$s/ =etwork -ecurity essentials Applications and -tandards Pearson


Education :sia/%!!#

%E Il)ess ,lack/ =etwork management standards/ Mc1ra3 Hill #""* &E William Stallin$s/ -=M* -=M* v0 -=M* v' and +MD=2P/ % and &rd Edition/ Pearson
Education :sia #"""E

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L/5 < $;B6'"#$''


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives
To familiariBe -tudents with the emerging trends and technologies defining the rules of business and to examine the business to consumer business to distribution and business to supply chain management.

Mo%6,$ I (/1 .o6)') e-Commerce and e-,usiness/ e-,usiness trends/ e-,usiness desi$nBA Construction/ Sel- dia$nosis/ =e.ersin$ the .alue chain/ Choosin$ a narro3 -ocusE e-,usiness :rchitectureB- Im2ortance o- :22lication Inte$ration/ e3 era o- Cross >unctional Inte$rated :22lications/ Inte$ratin$ :22lication Clusters into an e-,usiness :rchitecture/ :li$nin$ the e-,usiness Desi$n 3ith :22lication Inte$rationE Mo%6,$ II (/5 .o6)') Customer =elationshi2 Mana$ementB- eed -or Customer =elationshi2 Mana$ement/ De-inin$ C=M/ e3 C=M :rchitecture/ Su22ortin$ =e;uirements o- the e@t- 1eneration C=M In-rastructure/ 8r$ani9ational Challen$es in Im2lementin$ C=M/ e@t- 1eneration C=M TrendsE Sellin$-Chain Mana$ementB- De-inition/ ,usiness >orces 4 Technolo$) -orces dri.in$ the need -or Sellin$-Chain Mana$ement/ 8rder :c;uisition Process Mana$ement/ Elements o- Sellin$-Chain In-rastructureE Mo%6,$ III (/2 .o6)') Enter2rise =esource Plannin$B- De-inition/ E=P Decision/ E=P usa$e in the =eal World/ E=P Im2lementation/ >uture o- E=P :22licationE Su22l) Chain mana$ementB- De-inition/ ,asics o- Internet enabled SCM/ e-Su22l) Chain >usion/ e-Su22l) Chain >usion Mana$ement Issues/ e-Su22l) Chains in %!!KE Mo%6,$ IV (/1 .o6)') e-ProcurementB- Procurement as To2 Mana$ement Issue/ 82eratin$ =esource Procurement/ Procurement ,usiness Problem/ e@t 1eneration Inte$rated Procurement :22lications/ Elements o- ,u)-Side eProcurement Solutions/ ,u)-Side :22lications -or the Procurement Pro-essional/ Elements o- Sell-Side eProcurement SolutionsE De.elo2in$ the e-,usiness Desi$nB- <no3led$e ,uildin$/ Ca2abilit) E.aluation/ e- ,usiness Desi$n/ e,usiness Desi$n in :ction B The case o- EUT=:DEE Translatin$ e - ,usiness Strate$) into :ctionE

Text Books

#E =a.i <alakota and Marcia =obinson/ e&3usiness, A +oadmap for -uccess/ :ddison-Wesle)/
%!!!E R$*$)$#-$ Boo3' #E :mor/ E&3usiness %+)evolution/ Pearson Education/ %!!&E %E Schiller GE/ Mobile $ommunications/ :ddison Wesle) &E Shurte)/ e&3usiness with =et $ommerce/ Pearson Education/ %!!&E

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L/0 < PATTERN RECOGNITION


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

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

Mo%6,$ I (/2 .o6)') Introduction A introduction to statistical A s)ntactic and descri2ti.e a22roaches A -eatures and -eature e@traction A learnin$ A 3ayes 5ecision Theory A introduction A continuous case A % A cate$or) classi-ication A minimum error rate classi-ication A classi-iers A discriminant -unctions and decision sur-aces A error 2robabilities and inte$rals A normal densit) A discriminant -unctions -or normal densit) Mo%6,$ II (/2 .o6)') *arameter estimation supervised learning H ma@imum likel) hood estimation A the ,a)es classi-ier A learnin$ the mean o- a normal densit) A $eneral ,a)esian learnin$ A non parametric technique A densit) estimation A 2ar9en 3indo3s A k-nearest nei$hbour estimation A estimation o- 2osterior 2robabilities A nearest A nei$hbour rule A k-nearest nei$hbour rule Mo%6,$ III (/2 .o6)') #inear discriminant functions - Linear discriminant -unctions and decision sur-aces A $eneralised linear discriminant -unctions A %-cate$or) linearl) se2arable case non-se2arable beha.iour A linear 2ro$rammin$ 2rocedures A clusterin$ A data descri2tion and clusterin$ A similarit) measures A creation -unctions -or clusterin$E Mo%6,$ IV (/4 .o6)') -yntactic approach to *+ H introduction to 2attern $rammars and lan$ua$es A hi$her dimensional $rammars A tree/ $ra2h/ 3eb/ 2le@ and sha2e $rammars A stochastic $rammars A attribute $rammars A 2arsin$ techni;ues A $rammatical in-erenceE

Text Books Duda 4 Hart P E/ *atterns $lassification And -cene Analysis/ Gohn Wile) %E 1on9ale9 = C 4 Thomson M 1/ -yntactic *attern +ecognition :ddison Wesle) #E R$*$)$#-$ Boo3' #E >u < S/ Ea$le3ood Cli--s G/ -yntactic *attern +ecognition And Application/ Prentice Hall

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L/4 < BIO INFORMATICS


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives

The course teaches the science of storing extracting organiBing analysing and interpreting biological data. This course will emphasise how to use the computer as a tool for 3io Medical research which introduces 8enetic science Alignment techniques and 5ata generating technique.

Mo%6,$ I (/1 .o6)') Codin$ ;Common health care lan$ua$e - codin$ techni;ues A coded and ;uasi-coded data Medical .ocabular) A industr) 3ide communication standards HL' A uni-ied medical lan$ua$e s)stem A ;ualit) ocare 2aradi$ms/ risk mana$ement bioethicsE In-ormation net3orks - Internet A -acilities used in the internet 3eb bro3sers STTP */ HTTP/ HTML/ I=L A Euro2ean molecular biolo$) net3ork A national centre -or bio- technolo$) in-ormationE Mo%6,$ II (/2 .o6)') Patient record maintenance - Electronic 2atient record A models or E=P A en.ironmental ser.ices A metrics A telemedicine A communit) net3orks A telemedicine 2eri2herals and e;ui2ment selection A anatom) o- .ideo con-erencin$ technolo$)E Mo%6,$ III (/5 .o6)') ,asic 1enetic Science B Stud) o- cell/ nucleus/ chromosomes and their com2onents E.aluation ochromosomes/ Im2act o- chromosomes on $enes/ $ene stud)E Protein in-ormation resources - ,iolo$ical data basics A 2rimar) secondar) data basics A Protein 2attern data basics A D : se;uences data basics - D : anal)sis - 1enes structure and D : se;uences A inter2retation o- EST structures A di--erent a22roach to EST anal)sisE Mo%6,$ IV (/1 .o6)') :li$nment techni;ues ; Data base searchin$ - com2arison o- t3o se;uencesA identit) and similarit) A $lobal and $lobal similarit) A $lobal and local ali$nment- multi2le se;uence ali$nment A data basis o- multi2le ali$nment A secondar) data baseE E@2ert s)stem ; Princi2les o- e@2ert s)stem A statistical decision trees A inte$ration o- decision su22ort in clinical 2rocessorsE

Text Books

#E TE<E :tt3ood / DEGE Parr)-Smith/ "ntroduction to 3ioinformatics/ Pearson Education/ #"""E


R$*$)$#-$ Boo3'

#E Coiera E/ 8uide to medical informatics The internet and telemedicine $ha:sman ; <all
medical/ London #""'E

%E ,ernser/ EES/ $linical decision support systems Theory and practice -pringer&7erlag/ e3
Rork/ #""" &E Dan EE <rane / Michael LE=a)mer/ Fundamental $oncepts of 3ioinformatics/ Pearson Education/ %!!%E

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L/9< PARALLEL ARCHITECTURE AND ALGORITHMS


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives

$ourse material gives an introduction to parallel and distributed computing that studies problem solving using a large number of inter connected processors. This teaches the various models of parallel computation and also gives knowledge about the algorithms for merging sorting searching and FFT.

Mo%6,$ I(/1 .o6)') IntroductionB eed o- hi$h s2eed com2utin$ A increase the s2eed o- com2uters A histor) o- 2arallel com2uters and recent 2arallel com2utersN sol.in$ 2roblems in 2arallel A tem2oral 2arallelism A data 2arallelism A com2arison o- tem2oral and data 2arallel 2rocessin$ A data 2arallel 2rocessin$ 3ith s2eciali9ed 2rocessors A inter-task de2endenc) Mo%6,$ II(/2 .o6)') Instruction le.el 2arallel 2rocessin$B 2i2elinin$ o- 2rocessin$ elements A dela)s in 2i2eline e@ecution A di--iculties in 2i2elinin$ A su2erscalar 2rocessors A .er) lon$ instruction 3ord 57LIW6 2rocessor A commercial 2rocessors A multithreaded 2rocessors A -uture 2rocessor architecturesE Mo%6,$ III(/1 .o6)') Structure o- Parallel Com2utersB : $enerali9ed structure o- a 2arallel com2uter A classi-ication o- 2arallel com2uters A .ector com2uters A a t)2ical .ector su2er com2uter A arra) 2rocessors A s)stolic arra) 2rocessors A shared memor) 2arallel com2uters A interconnection net3orks A distributed shared memor) 2arallel com2uters A messa$e 2assin$ 2arallel com2uters A cluster o- 3orkstationsE Mo%6,$ IV(/5 .o6)') :nal)sis o- 2arallel al$orithms A mer$in$ on the C=EW/ E=EW models and better al$orithm -or E=EW model/ sortin$B a net3ork -or sortin$/ sortin$ on a linear arra)/ sortin$ on C=CW/ C=EW/ E=EW modelsN searchin$ a sorted se;uence A searchin$ a random se;uence on SM SIMDN searchin$ on a tree and on a meshE Matri@ o2erationsB trans2osition/ matri@-b)-matri@ multi2lication/ matri@-b)-.ector multi2licationN sol.in$ s)stems o- linear e;uations A -ast -ourier trans-orm/ discrete -ourier trans-ormN 1ra2h theor)B connecti.it) matri@/ connected com2onents/ all-2airs shortest 2aths/ minimum s2annin$ treeE

Text Books #E 7E =ajaraman and CE Si.a =am Murth)/ *arallel $omputers H Architecture and *rogramming/ PHI/ %!!!E %E Selim 1E :kl/ The 5esign and Analysis of *arallel algorithms PHI/ #""" &E Michael GE ?uinn/ *arallel $omputing H The Theory and *ractice Mc1ra3-Hill/ I C/ #""( R$*$)$#-$ Boo3'

#E Michael GE ?uinn/ *arallel $omputing H Theory and *ractice/ Mc1ra3-Hill/I C/ #""(

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L/2< DESIGN & ANALYSIS OF ALGORITHMS


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives

To introduce basic concepts and mathematical aspects of algorithms. To create analytical skills to enable the students to design algorithms for various applications and to analyBe the algorithms.

Mo%6,$ I (/0 .o6)') :nal)sisB =:M model - cost estimation based on ke) o2erations - bi$ 8h - bi$ ome$a - little 8h - little ome$a and theta notations - recurrence anal)sis - masterLs theorem - solution to recurrence relations 3ith -ull histor) 2robabilistic anal)sis - linearit) o- e@2ectations - 3orst and a.era$e case anal)sis o- ;uick-sort mer$e-sort - hea2-sort - binar) search - hashin$ al$orithms - lo3er bound 2roo-s -or the abo.e 2roblems amorti9ed anal)sis - a$$re$ate - accountin$ and 2otential methods - anal)sis o- <nuth-Morris-Pratt al$orithm - amorti9ed 3ei$ht balanced treesE Mo%6,$ II (/5 .o6)') Desi$nB di.ide and con;uer - StrassenLs al$orithm/ o5n6 median -indin$ al$orithm - d)namic 2ro$rammin$ o2timal binar) search trees - >lo)d-Warshall al$orithm - CR< al$orithm - $reed) - Hu--man codin$ <na2sack/ <ruskalLs and PrimLs al$orithmsE Mo%6,$ III (/0 .o6)') ,acktrackin$ A n-?ueenFs Problem A ,ranch and bound A :ssi$nment 2roblem A <na2sack 2roblem A Tra.elin$ salesman 2roblemE Mo%6,$ IV (/1 .o6)') Com2le@it)B com2le@it) classes - P/ P/ Co- P/ P-Hard and P-com2lete 2roblems - cookLs theorem 52roo- not e@2ected6 - P-com2leteness reductions -or cli;ue - .erte@ co.er - subset sum - hamiltonian c)cle - TSP - inte$er 2ro$rammin$ - a22ro@imation al$orithms - .erte@ co.er - TSP - set co.erin$ and subset sumE

Text Books

#E Corman TEHE/ Lieserson CEEE 4 =i.est =ELE/ "ntroduction to Algorithms/ Prentice Hall India/
Modules I/ II and IIIE

%E Mot3ani =E 4 =a$ha.an PE/ +andomiBed Algorithms Cambrid$e Ini.ersit) Press/ Module


I7E R$*$)$#-$ Boo3' #E ,asse SE/ $omputer Algorithms, "ntroduction to 5esign And Analysis/ :ddison Wesle) %E Manber IE/ "ntroduction to Algorithms, A $reative Approach/ :ddison Wesle)E &E :ho 7E/ Ho2cra-t GEEE 4 Illman GEDE/ The 5esign And Analysis of $omputer Algorithms/ :ddison Wesle)E (E :nan) Le.itin/ O"ntroduction to the 5esign and Analysis of AlgorithmP/ Pearson Education :sia/ %!!&E

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L/9< NEURAL NETWORFS & FUAAY LOGIC


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives This course is intended to introduce some of the methods and techniques by means of which it is possible to incorporate human like performance in machine. At the end of this course students will be able to design and develop such systems using neural networks and fuBBy logic.

Mo%6,$ I (/1 .o6)') I#()o%6-("o# (o +)("*"-"+, #$6)+, #$(?o)3' ; biolo$ical neurons - Mc Culloch and Pitts modals o- neuron t)2es o- acti.ation -unction - net3ork architectures - kno3led$e re2resentation - learnin$ 2rocess - errorcorrection learnin$ - su2er.ised learnin$ - unsu2er.ised learnin$ - sin$le unit ma22in$s and the 2erce2tron 2erce2tron con.er$ence theorem 53ith out 2roo-6 - method o- stee2est descent - least mean s;uare al$orithms - adaline/medaline units - multila)er 2erce2trons - deri.ation o- the back-2ro2a$ation al$orithm Mo%6,$ II (/1 .o6)') R+%"+, !+'"' +#% )$-6))$#( #$6)+, #$(?o)3' - =,> net3ork structure - co.ers theorem and the se2arabilit) o- 2atterns - =,> learnin$ strate$ies - <-means and LMS al$orithms - com2arison o- =,> and MLP net3orks - recurrent net3orks - Ho2-ield net3orks - ener$) -unction - s2urious states - error 2er-ormance - simulated annealin$ - the ,olt9man machine - ,olt9man learnin$ rule - the mean -ield theor) machine - M>T learnin$ al$orithm - a22lications o- neural net3ork - the K8= 2roblem - tra.elin$ salesman 2roblem - ima$e com2ression usin$ MLPs - character retrie.al usin$ Ho2-ield net3orks Mo%6,$ III (/1 .o6)') F6CC> ,o:"- ; -u99) sets - 2ro2erties - o2erations on -u99) sets - -u99) relations - o2erations on -u99) relations - the e@tension 2rinci2le - -u99) measures - membershi2 -unctions - -u99i-ication and de-u99i-ication methods - -u99) controllers - Mamdani and Su$eno t)2es - desi$n 2arameters - choice omembershi2 -unctions - -u99i-ication and de-u99i-ication methods A a22lications Mo%6,$ IV (/1 .o6)') I#()o%6-("o# (o :$#$("- +,:o)"(. +#% .>!)"% '>'($ ' ; $enetic al$orithms - natural e.olution - 2ro2erties - classi-ication - 1: -eatures - codin$ - selection - re2roduction - cross o.er and mutation o2erators basic 1: and structure I#()o%6-("o# (o H>!)"% '>'($ ' - conce2t o- neuro--u99) and neuro-$enetic s)stems

T$7( !oo3' #E #E Simon Ha)kins/ =eural =etwork A & $omprehensive Foundation/ Macmillan Colle$e/ %E Proc/ Con/ Inc
%E Curada GEM/ "ntroduction to Artificial =eural -ystems/ Gaico 2ublishersE

R$*$)$#-$ Boo3'
#E %E &E Drianko. DE/ Hellendoorn HE 4 =ein-rank M/ An "ntroduction to FuBBy $ontrol/ arosa =oss TEG/ FuBBy #ogic with Engineering Applications/ Mc1ra3 HillE ,art <osko/ =eural =etwork and FuBBy -ystems/ Prentice Hall/ IncE/ En$le3ood Cli--s (E 1oldber$ DEE/ 8enetic Algorithms in -earch Dptimisation and Machine #earning/ :ddison Wesle) *E Suran 1oonatilake 4 Sukhde. <hebbal 5EdsE6/ "ntelligent <ybrid -ystems/ Gohn Wile)

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L20 < GRID COMPUTING


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives This course introduce emerging computational and networking infrastructure. Also enable entirely new approaches to applications and problem solving.

Mo%6,$ I (/1 .o6)') IT In-rastructure E.olution - Producti.it) Parado@ and In-ormation Technolo$) - ,usiness 7alue o- 1rid Com2utin$ - 1rid Com2utin$ Technolo$)Q :n 8.er.ie3 - 1rids in 8ther Industries Mo%6,$ II (/1 .o6)') 1rid-Enablin$ et3ork Ser.ices - Mana$in$ 1rid En.ironments - 1rid-Enablin$ So-t3are :22lications 1rid Com2utin$ :do2tion in =esearch and Industr) Mo%6,$ III (/1 .o6)') Data 1rids - Deskto2 Su2ercom2utin$B $rids ati.e Pro$rammin$ -or 1rids - 1rids in Li-e Sciences A Deskto2

Mo%6,$ IV (/1 .o6)') 1rids in the Telecommunications Sector- Cluster 1rids - HPC 1rids - The 82en 1rid Ser.ices :rchitectureE Hi.e Com2utin$ -or Transaction Processin$ 1rids - Creatin$ and Mana$in$ 1rid Ser.ices - :22lication Inte$rationE

Text Books

#E :hmar :bbas/ 8rid $omputing , A *ractical 8uide to Technology and Applications/ Charles
=i.er Media/ %!!(E

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L2/< BLUETOOTH TECHNOLOGY


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives This is a course on the concepts architecture design and performance evaluation of bluetooth technology. At the conclusion of this course the student will have an understanding of these principles and be capable of implementing network protocols and applications for personal pervasive systems.

Mo%6,$ I (// .o6)') ,asic Conce2ts - 8ri$in/ ,lue tooth SI1/ Protocol Stack/ Securit)/ a22lications and Pro-iles/ Mana$ement/ Test / and ;uali-ication Technolo$) ,asicsE => and I= Wireless CommunicationE Mo%6,$ II (/5 .o6)')

,luetooth Module - :ntennas Patterns/ 1ain and lossesN T)2es o- antennasB on chi2 antennas/ =adio inter-aceB >H/ Modulation/ s)mbol timin$/ 2o3er emission and control /Per-ormance Parameters/ => architecture/ ,lur =>/ ,ase bandB- ,lue tooth De.ice address s)stem Timin$ /Ph)sical links / Packet/ structurin$ t)2es and construction/ channel codin$ and time base s)nchroni9ationE Mo%6,$ III (/1 .o6)') Link controller and mana$ement - LCP/ controller states/ Pico net and scattered o2erations/ Master/Sla.e =ole s3itchin$ LC :rchitectural 8.er.ie3/ LMC-Link set u2/ ?ualit) o- ser.ice/ LMP .ersion/ ame =e2resent/ Test ModeE Mo%6,$ IV (/5 .o6)') E,luetooth host- L LC and ada2tation Protocol L%ca2 si$nalin$ B ConnectionsB ,lue Tooth 2ro-ilesN 7ersion #E!N 1eneric Pro-iles/ Serial and 8bject e@chan$e Securit) Encr)2tion and securit) <e) $eneration /securit) Modes and architecture / Lo3 2o3er 82eration and ?8S Mana$ementE

Text Books

#E Genni-er ,ra)and cE-E stuntman/ 3lue tooth $onnect without cables/ Pearson Education %!!#E
R$*$)$#-$ Boo3' #E %E ,rent :E Miller and CE,isdikian/ 3lue Tooth +evealed/ Pearson Education %!!#E athan GEMiller/ 3luetooth 5emystified/ Tata Mc 1ra3 Hill %!!#/ LondonE%!!#

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L22 < INDUSTRIAL PSYCOLOGY


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< ( Objectives The course is expected to expose to the students various techniques in analyBing and improving relationships that are expected by people employed all industries while conducting within an organiBation. "t looks at various psychological issues and attempts to solve them.

Mo%6,$ I (/1 .o6)') Introduction A 2s)cholo$) as a science A areas o- a22lications A stead) o- indi.idual A indi.idual di--erences A stead) o- beha.ior A stimulus A res2onse beha.ior A heredit) and en.ironment A human mind A co$nition A character A thinkin$ A attention A memor) - emotion A traits A attitude A 2ersonalit)E Mo%6,$ II (/1 .o6)') 8r$ani9ational beha.ior A de-inition A de.elo2ment A -undamental conce2ts A nature o- 2eo2le A nature oor$ani9ation A an or$ani9ational beha.ior s)stem A models A autocratic model A h)brid model A understandin$ a social A s)stem social culture A mana$in$ communication A do3n3ard/ u23ard and other -orms o- communicationsE Mo%6,$ III (/1 .o6)') Moti.ation A moti.ation dri.er A human needs A beha.ior modi-ication A $oal settin$ A e@2ectanc) model A com2arison models A inter2retin$ moti.ational models A leadershi2 A 2ath $oal model A st)le A contin$enc) a22roach Mo%6,$ IV (/1 .o6)') S2ecial to2ic in industrial 2s)cholo$) A mana$in$ $rou2 in or$ani9ation A $rou2 and inter $rou2 d)namic A mana$in$ chan$e and or$ani9ational de.elo2ment A nature 2lanned chan$e A resistance A characteristic o8D-8D 2rocessesE

R$*$)$#-$ Boo3' #E Da.is < 4 e3strom G W/ <uman 3ehavior At Cork/ Mc1ra3 Hill InternationalE %E Schermerhorn GE= GrE/ Hunt GE1 4 8sborn =E / Managing DrganiBational 3ehavior/ Gohn Will)E &E Luthans/ DrganiBational behavior/ Mc1ra3 Hill InternationalE (E Mor$an CET/ <in$ =E:/ =3eis9 G 4 Scho2les G/ "ntroduction to *sychology/ Mc1ra3 HillE *E ,lum MEL 4 a)lor GEC/ "ndustrial *sychology C,S Publisher/ Hor2er 4 =o3

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L21< DISTRIBUTED SYSTEMS


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives The development of distributed systems followed the emergence of high&speed local area networks the availability of high performance *$s workstations and servers has resulted in a recent shift towards distributed systems and away from centraliBed multi user systems. This trend has been accelerated by the development of distributed system software designed to support the development of distributed applications. This course is to impart basic knowledge of the issues concerning distributed systems from both software and hardware viewpointsE

Mo%6,$ I(/0 .o6)') 82eratin$ s)stem -undamentals - distributed s)stem conce2ts and architectures - major desi$n issues distributed com2utin$ en.ironments 5DCE6 Mo%6,$ II (/1 .o6)') Concurrent 2rocesses and 2ro$rammin$ - threads and 2rocesses - client ser.er model - time ser.ices lan$ua$e mechanisms -or s)nchroni9ation - concurrent 2ro$rammin$ lan$ua$es Mo%6,$ III (/1 .o6)') Inter2rocess communication and coordination - messa$e 2assin$ communication - re;uest/re2l) communication - transaction communication - name and director) ser.ices - distributed mutual e@clusion leader election

Mo%6,$ IV (/4 .o6)') 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)

Text Books

#E Cho3 = 4 Gohnson T/ 5istributed Dperating -ystems and Algorithms/ :ddison Wesle)E


R$*$)$#-$ Boo3' #E Sinha PE</ 5istributed Dperating -ystems $oncepts and 5esign/ PHIE %E Tanenbaum S/ 5istributed -ystems $oncepts And 5esign/ Prentice Hall IncE &E Coulouris 1E/ Dollimore GE 4 <indber$ T/ 5istributed -ystems $oncepts And 5esign/ :ddison Wesle)E (E Sin$hal ME 4 Shi.aratri/ Advanced $oncepts "n Dperating -ystems 5istributed 5atabases and Multiprocessor Dperating -ystems Mc1ra3 HillE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L25< MANAGEMENT INFORMATION SYSTEMS


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek Objectives C)$%"('< (

This course will introduce the methods and the influence of the information systems in management milieu and use M"- as an effective tool in management and decision makingE

Mo%6,$ I (/2 .o6)') In-ormation s)stems - -unctions o- mana$ement - le.els o- mana$ement - -rame3ork -or in-ormation s)stems - s)stems a22roach - s)stems conce2ts - s)stems and their en.ironment - e--ects o- s)stem a22roach in in-ormation s)stems desi$n - usin$ s)stems a22roach in 2roblem sol.in$ - strate$ic uses o- in-ormation technolo$) Mo%6,$ II (/0 .o6)') :n o.er.ie3 o- com2uter hard3are and so-t3are com2onents - -ile and database mana$ement s)stems introduction to net3ork com2onents - to2olo$ies and t)2es - remote access - the reasons -or mana$ers to im2lement net3orks - distributed s)stems - the internet and o--ice communications Mo%6,$ III (/5 .o6)') :22lication o- in-ormation s)stems to -unctional - tactical and strate$ic areas o- mana$ement/ decision su22ort s)stems and e@2ert s)stems Mo%6,$ IV (/4 .o6)') In-ormation s)stems 2lannin$ - critical success -actor - business s)stem 2lannin$ - ends/means anal)sis or$ani9in$ the in-ormation s)stems 2lan - s)stems anal)sis and desi$n - alternati.e a22lication de.elo2ment a22roaches - or$ani9ation o- data 2rocessin$ - securit) and ethical issues o- in-ormation s)stems

Text Books

#E =obert Schultheis 4 Mar) Sumner/ Management "nformation -ystems&The ManagerIs 7iew/


Tata Mc1ra3 HillE R$*$)$#-$ Boo3'

#E Laudon <ECE 4 Laudon GEP/ Management "nformation -ystems & DrganiBation and
Technology/ Prentice Hall o- India %E Sada$o2an S/ Management "nformation -ystems/ Prentice Hall o- India &E ,asandra SE</ Management "nformation -ystems/ Wheeler Publishin$E (E :lter S/ "nformation -ystems, A Management *erspective/ :ddison Wesle)E *E E--) 89/ Management "nformation -ystems Thomson/ 7ikas Publishin$ HouseE I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

IT09 L20< GRAPH THEORY & COMBINATORICS


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives This course comprehends the graphs as a modeling and analysis tool in computer science ; Engineering. "t introduces the structures such as graphs ; trees and techniques of counting and combinations which are needed in number theory based computing and network security studies in $omputer -cience.

Mo%6,$ I (/1 .o6)') Introduction to $ra2hs - de-initions - sub$ra2hs - 2aths and c)cles - matri@ re2resentation o- $ra2hs - euler tours - chinese 2ostman 2roblem - 2lanar $ra2hs - EulerLs -ormula - 2latonic bodies - a22lications o<urato3skiLs theorem - hamiltonian $ra2hs - $ra2h colourin$ and chromatic 2ol)nomials - ma2 colourin$E Mo%6,$ II (/5 .o6)') Trees - de-initions and 2ro2erties - rooted trees - trees and sortin$ - 3ei$hted trees and 2re-i@ codes biconnected com2onents and articulation 2oints - <ruskalLs and PrimLs al$orithms -or minimal s2annin$ trees - DijkstraLs shortest 2ath al$orithm - bellman--ord al$orithm - all-2airs shortest 2aths - >lo)ed-Warshall al$orithm - the ma@--lo3 min-cut theorem - ma@imum bi2artite matchin$E Mo%6,$ III (// .o6)') >undamental 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 2ositionsE

Mo%6,$ IV (/5 .o6)') 1eneratin$ -unctions - 2artitions o- inte$ers - the e@2onential $eneratin$ -unction - the summation o2erator recurrence relations - -irst order and second order - nonhomo$eneous recurrence relations - method o$eneratin$ -unctionsE

Text Books

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


Wesle)E R$*$)$#-$ Boo3'

#E Clark GE 4 Holton DE:/ A First #ook at 8raph Theory/ :llied Publishers 5World Scienti-ic6E %E Corman TEHE/ Leiserson CEEE 4 =i.est =EL/ "ntroduction to Algorithms/ Prentice Hall India &E Mott GELE/ <andel :E 4 ,aker TEP/ 5iscrete Mathematics for $omputer -cientists and
Mathematicians/ Prentice Hall o- IndiaE (E Liu CEL/ Elements of 5iscrete Mathematics/ Mc1ra3 HillE *E =osen <EH/ 5iscrete Mathematics And "ts Applications Mc1ra3 Hill

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

GLOBAL ELECTIVES

EE09 L21 PROCESS CONTROL AND INSTRUMENTATION


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

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

Mo%6,$ I (2 .o6)')
Si$nal Conditionin$ A :nalo$ A Di$ital - Si$nal con.ersions - Process Control Princi2les ; Identi-ication oelements/ block dia$ram/ the loo2/ control s)stem e.aluation stabilit)/ re$ulation/ e.aluation criteria/ and c)clic res2onseE

Mo%6,$ II (/0 .o6)')


F"#+, Co#()o, E,$ $#(< >inal control o2eration/ si$nal con.ersions/ analo$ electrical si$nal/ di$ital electrical si$nals/ Direct action A 2neumatic si$nals/ :ctuators A electrical actuators/ 2neumatic actuators/ control elements A -luid .al.esE Si$nal Conditionin$ o- Transducers- Tem2erature Transducers - -lo3 transducers

Mo%6,$ III (/2.o6)')


Controller Princi2les - Process characteristics/ control s)stem 2arameters/ controller modes/ discontinuous controller modes/ continuous controller modes/ com2osite controller modesE :nalo$ 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

Mo%6,$ IV (/5.o6)')
Co#()o, Loo= C.+)+-($)"'("-'< Control s)stem con-i$urations/ cascade control/ multi.ariable control/ -eed -or3ard control/ S2lit ran$e control/ in-erential control/ :da2ti.e control/ control s)stem ;ualit) A loo2 disturbance/ o2timum control/ measure o- ;ualit)/ Stabilit)/ 2rocess loo2 tunin$

T$7( Boo3' #E Curtis DE Gohnson/ *rocess $ontrol "nstrumentation Technology Pearson EducationE R$*$)$#-$ Boo3' #E Curtis DE Gohnson/ Microprocessors in *rocess $ontrol PHI %E 1eor$e Ste2hano2oulis/ $hemical *rocess $ontrol &E Cau$hner/ *rocess Analysis and $ontrol (E Desh2ande and :sh/ Elements of computer process control of "ndustrial processes IS: *E Ga)antha <E Paul/ +eal& Time microcomputer control of "ndustrial processes/ <lu3er Publications/ etherlandsE +E SE <E Sin$h/ $omputer Aided *rocess $ontrol/ PHI% 'E Dale EE Sebor$/ Thomas >E Ed$ar/ Duncan :E Mekkicham2/ *rocess 5ynamics and $ontrol Wile) India

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

U#"8$)'"(> E7+ "#+("o# P+(($)# *A+T A, -hort answer questions %one.two sentences) :ll ;uestions are com2ulsor)E There should be at least one ;uestion -rom each module and not more than t3o ;uestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

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

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

EE09 L20 ROBOTICS AND AUTOMATION


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek
Objectives

C)$%"('< (

To give an introduction of industrial robotics and automation

Mo%6,$ I (/5 Ho6)') :utomation and =obotics - =obotics in Science >iction - : ,rie- Histor) o- =obotics - The =obot and Its Peri2herals-=obot :cti.ation and >eedback Com2onents - Position Sensors - 7elocit) Sensors - :ctuators Po3er Transmissions S)stems - =obot Goint Control Desi$n- Introduction to Mani2ulator <inematics Homo$eneous Trans-ormations and =obot <inematics -Mani2ulator Path Control - =obot D)namics Con-i$uration o- a =obot ControllerE Mo%6,$ II (/1 Ho6)') T)2es o- End E--ectors - Mechanical 1ri22ers - 8ther 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 - Ises oSensors in =obotics - Introduction to Machine 7ision - The Sensin$ and Di$iti9in$ >unction in Machine 7ision - Ima$e Processin$ and :nal)sis - Trainin$ and 7ision S)stem - =obotic :22licationsE

Mo%6,$ III (/5 Ho6)') Methods o- =obot Pro$rammin$ A Lead throu$h Pro$rammin$ Methods - : =obot Pro$ram as a Path in S2ace - Motion Inter2olation - W:IT/ SI1 :L/ and DEL:R 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/ 7ariables/ and 8ther Data 8bjects - Motion Commands - End E--ector and Sensor Commands - Com2utations and o2erations - Pro$ram Control and Subroutines Communications and Data Processin$ - Monitor Mode CommandsE Mo%6,$ IV (/1 Ho6)') 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

T$7( Boo3' #E Mikell PE 1roo.er- etE :l/ "ndustrial robotics Technology programming and Applications/ Mc1ra3 Hill %E <E SE >u/ =E CE 1on9ale9/ CE SE 1E Lee/ +obotics $ontrol -ensing and "ntelligence Mc1ra3 Hill

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

Ini.ersit) E@amination Pattern

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

ME09 L21< I#%6'()"+, S+*$(> E#:"#$$)"#:


T$+-."#: '-.$ $ & hours lecture and I hour tutorial 2er 3eek O!D$-("8$' C)$%"('< 5

To provide on concept of safety in industry principle of accident prevention ma:or haBards consequences and concept of reliability.

P)$;)$B6"'"($'< =il Mo%6,$ I 5#( Hours6 Introduction to the conce2t o- sa-et)- eed-sa-et) 2ro.isions in the -actor) :ct-La3s related to the industrial sa-et)-Measurement o- sa-et) 2er-ormance/ Sa-et) :udit/ Work 2ermit s)stem/ injur) and accidents-De-initions-Insa-e act Aunsa-e condition- causes/ in.esti$ations and 2re.ention oaccidents/ ha9ards/ t)2e o- industrial ha9ards-nature/ causes and control measures/ ha9ard identi-ications and control techni;ues-H:C8P/ >ME:/>MEC: etcE Mo%6,$ II 5#( Hours6 Conce2t o- Industrial h)$iene/ 2ro$rammes-=eco$nition AE.aluation- Control/ oise- source A e--ects and noise control/ e@2osure limits Astandards/ Hearin$ conser.ation 2ro$rammes/ >ire A-ire load-control and industrial -ire 2rotection s)stems/ >ire H)drant and e@tin$uishers/ Electrical Ha9ards/ 2rotection and interlock-Dischar$e rod and earthlin$ de.ice/ sa-et) in the use o- 2ortable toolsE Mo%6,$ III 5#& Hours6 Lo$ics o- conse;uence anal)sis-Estimation-To@ic release and to@ic e--ects-Threshold limit .alues/ Emer$enc) 2lannin$ and 2re2aredness/ :ir 2ollution-classi-ication- Dis2ersion modelin$ -2ollution source and e--ects- -control method and e;ui2ments-1ra.itational settlin$ chambers-c)clone se2arators->abric -ilter s)stems-scrubbers etcE Mo%6,$ IV 5#& Hours6 Conce2t o- reliabilit)-De-inition->ailure rate and Ha9ard -unction/ S)stem reliabilit) models-series/ 2arallel s)stems/ reliabilit) ha9ard -unction -or distribution -unctions-e@2onential-normal A lo$normal-3eibull and $amma distributionE T$7( !oo3'
<. Thomas GE :nton/ Dccupational -afety and <ealth Management/ Mc1ra3 Hill . Ian TECameron 4 =a$hu =aman/ *rocess -ystems +isk Management/ ELSE7IE= :cademic 2ressE =. CESE=ao/ Environmental *ollution $ontrol Engineering/ e3 :$e International Limited >. LE SE Srinath/ +eliability Engineering/ East 3est Press/ e3 DelhiE

R$*$)$#-$ !oo3'
<. >rank EE McErlo)/PEEN CESEP/ Accident *revention Manual for "ndustrial Dperations/ SC Chica$oE . Lees >EP/ #oss *revention in *rocess "ndustries/ ,utter3orths/ e3 DelhiE =. ,HEL/Dccupational -afety Manual/ Tiruchira22alliE

>. DrE :E<E 1u2ta/ +eliability Maintenance and -afety Engineering/ La@mi Publications/ e3 DelhiE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

Ini.ersit) E@amination Pattern

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

EC09 L020< B"o $%"-+, I#'()6 $#(+("o#


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

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

Mo%6,$ I (/5 .o6)') Electrical acti.it) o- e@citable cells-SD cur.e--unctional or$ani9ation o- the 2eri2heral ner.ous s)stem-electrocardio$ram 5in detail 3ith all lead s)stems6-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-Tskin- electrodesF e;ui.alent circuit-characteristics o- Tbio-am2li-iersF Mo%6,$ II (/5 .o6)') ,lood 2ressure-direct measurements-harmonic anal)sis o- blood 2ressure 3a.e-orm-s)stem -or measurin$ .enous 2ressure-heart sounds- 2honocardio$ra2h)-cardiac catheteri9ation-indirect blood 2ressure measurement Aelectroma$netic blood -lo3 meters-ultrasonic blood -lo3 meters-im2edance 2leth)smo$ra2h) A2hoto 2leth)smo$ra2h)-Tindicator- dilutionFmethod -or blood -lo3 determination As2irometr)-measurement o- .arious res2irator) 2arameters- res2irator) 2leth)smo$ra2h)chamber 2leth)smo$ra2h)

Mo%6,$ III (/1 .o6)') 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 Mo%6,$ IV (/1 .o6)') Ph)siolo$ical e--ects o- electricit)-im2ortant susce2tibilit) 2arameters-macro shock ha9ards-micro shock ha9ards-2rotection a$ainst shock-electrical isolation- electrical sa-et) anal)9ers-measurements o- 2H/2C%/ and P8%

Text Books #E Webster G/F Medical Instrumentation-:22lication and Desi$nF/ Gohn Wile) %E Handbook o- ,iomedical Instrumentation/ Tata-Mi$ra3 Hill/ e3 Delhi R$*$)$#-$ Boo3' #E 1eddes4 ,aker/FPrinci2les o- :22lied ,iomedical InstrumentationF/ Wile) %E Enc)clo2edia o- Medical De.ices and Instumentation Wile) &E ,ron9ino/Hand book o- ,iomedical En$ineerin$/IEEE 2ress book

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

Ini.ersit) E@amination Pattern

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

PE09 L21< To(+, E6+,"(> M+#+:$ $#(


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

Objectives To impart knowledge on the concept of quality tools for analysing quality statistical tools in quality acceptance sampling life tests

Mo%6,$ I (/5 .o6)') De-inition o- ;ualit)-internal and e@ternal customers- .ision statement A mission statements A objecti.es A $oals A tar$ets- e.olution o- T?M A De-inin$ T?M A sta$es in T? M im2lementation-T?M models Mo%6,$ II (/5 .o6)') SW8T anal)sis-strate$ic 2lannin$-customer -ocus-;ualit) -unction de2lo)ment-customer satis-action measurement-se.en ne3 mana$ement tools-Demin$ 3heel-9ero de-ect conce2t-bench markin$-si@ si$ma conce2ts--ailure mode and e--ect anal)sis-2oke )oke Mo%6,$ III (/1 .o6)') >i.e S -or ;ualit) assurance-;ualit) circle 2hiloso2h)--ailure rate anal)sis-mean -ailure rate-mean time to -ailure 5MTT>6-Mean time bet3een -ailure 5MT,>6-ha9ard models-s)stem reliabilit)-a.ailabilit)- maintenance Mo%6,$ IV (/1 .o6)') ?ualit) and cost-characteristics o- ;ualit) cost-micro anal)sis o- ;ualit) cost-measurement o- ;ualit)-T?M road ma2- IS8 "!!! series certi-ication-IS8 "!!#B%!!! certi-ication-IS8 #(!!! certi-ication-?S "!!! auditin$?ualit) auditin$- ;ualit) a3ards

Text Books #E L Su$anthi/ :nand : Samuel/ Total Juality Management/ PHI %E LtE1enE Lal H/ Total Juality Management/ Wile) Eastern Limited R$*$)$#-$ Boo3' #E 1re$ ,ounds/ 3eyond Total Juality Management/ Mc1ra3 Hill Publishers %E Menon H 1/ TJM in =ew *roduct Manufacturing/ Mc1ra3 Hill Publishers

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H &!H #!H Tests 5minimum %6 :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE =e$ularit) in the class

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

CE09 L21 EXPERIMENTAL STRESS ANALYSISH


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

O!D$-("8$ To make students aware of various measurement techniques and experimental planning and procedures adopted in laboratory

Mo%6,$ I (/5 .o6)') Strain $au$es - de-inition o- $au$e len$th - sensiti.it) and ran$e - characteristics o- an ideal strain $au$e di--erent t)2es o- mechanical strain $au$es/ o2tical strain $au$e - acoustic strain $au$e - 2neumatic strain $au$e - merits and demerits - electrical strain $au$es - inductance/ ca2acitance and 2ie9o electric $au$es bonded and unbonded resistance $au$es and their a22lication in stress anal)sis - -i@in$ techni;ues and measurement o- strains - rosettes - determination o- 2rinci2al stress - construction o- stress/ strain circles anal)tical solution Mo%6,$ II (/1 .o6)') Photo elasticit) - basics o- o2tics/ stress o2tic la3 - 2lane and circularl) 2olari9ed li$ht and their use in 2hotos elasticit) - 2olarisco2es - di--usion t)2e - lens t)2e 2olarisco2es - isoclinics and isochromatics Mo%6,$ III (/5 .o6)') Model materials - calibration methods -or -indin$ material -rin$e .alues - model -rin$e .alues - e@am2les obeam -le@ure and diametricall) loaded circular 2latesE on Destructi.e Testin$ Methods A Iltrasonic Methods A Hardness methods A =ebound Hammer A Detection o- embedded rein-orcementE Com2uter based data ac;uisition s)stemsE

Mo%6,$ IV (/1 .o6)') Model anal)sis - direct and indirect models - la3s o- structural similitude - choice o- scales - limitation omodel studies - buckin$ham 2i-theorem - dimensional anal)sis - model materials - ,e$$Fs de-ormater and its use - sim2le desi$n o- direct and indirect models

T$7( Boo3' #E Dall)/ GE WE and =alie) WE>E/ E@2erimental Stress :nal)sis/ Mc1ra3 HillE %E Srinath LESE/ E@2erimental Stress :nal)sis/ Tata Mc1ra3 Hill &E =o)/ TE<E/ E@2erimental :nal)sis o- stress and strain

R$*$)$#-$ Boo3' #E Do.e and :dams/ E@2erimental Stress :nal)sis and Motion measurement/ Prentice Hall %E Heten)i ME/ Hand book o- E@2erimental Stress :nal)sis/ Gohn Wile) &E ,entl) GP A Princi2les o- Measurement S)stems/ Lon$man/ #"0& (E akra 4 Cho3dhar) A Instrumentation Measurement 4 :nal)sis A Tata Mc1ra3 Hill/ #""*

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H - Tests 5minimum %6 &!H - :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE #!H - =e$ularit) in the class

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

CE09 L25< REMOTE SENSING AND GIS


T$+-."#: '-.$ $ & hours lecture and # hour tutorial 2er 3eek C)$%"('< (

O!D$-("8$ To make the students a3are o- the technolo$ical de.elo2ments in the $eo$ra2hical database mana$ement and its ad.anta$es Mo%6,$ I (/5 Ho6)') =emote sensin$B 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 5EM=6 A EM= s2ectrum A .isible/ in-rared 5I=6 near I=/ middle I=/ thermal I= and micro3a.e A black bod) radiation A Plancks La3 A Ste-an A,olt9man la3E :tmos2heric characteristics A scatterin$ o- EM= A =alie$h/ Mie/ on-selecti.e and =aman scatterin$ A EM= interaction 3ith 3ater .a2ur and o9one 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 Mo%6,$ II (/5 Ho6)') 82ticaa and Micro3a.e =emote sensin$B 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 Mo%6,$ III (/1 Ho6)') 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 Mo%6,$ IV (/1 Ho6)') Miscellaneous to2icsB inter2retation o- satellite ima$es- elements o- inter2retation A .isual inter2retation A di$ital ima$e 2rocessin$ techni;ues A ima$e enhancement A -ilterin$ A ima$e classi-ication A >CC 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 ha9ard miti$ationE

T$7( !oo3'< #E :nji =edd)/ =emote sensin$ and 1eo$ra2hical s)stems/ ,S Publications %E M 1 Srini.as 5Edited b)6/ remote sensin$ a22lications/ erusa 2ublishin$ house &E Lillesand T M and <ue-er = WE/ =emote sensin$ and ima$e inter2retation/ Gohn Wile) and sons (E Gensan G =/ Introductor) di$ital ima$e 2rocessin$/ Prentice Hall o- India *E Sabins/ >l)od/ >E/ =emote sensin$ 2rinci2les and Inter2retation/ W H >reman and CoE/ e3Rork

R$*$)$#-$'< #E Gan9a > G/ ,lue H M and Gohnston/ G EE/ Manual o- remote sensin$ .olE IE/ :merican Societ) oPhoto$rammetr)/ #"'* %E ,urrou$h P :E/ Princi2les o- 1IS -or land resource assessment/ 8@-ord &E Star Ge--re) L 5Ed6/ Ests Goh E and Mc13ire <enneth/ Inte$ration o- $eo$ra2hical s)stems and remote sensin$/ Cambrid$e uni.ersit)E (E De Merse/ Michael E/ >undamentals o- $eo$ra2hic in-ormation s)stem/ %nd ednE/ Gohn Wile) and sonsE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H &!H #!H Tests 5minimum %6 :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE =e$ularit) in the class

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

BT 09 L25
T$+-."#: S-.$ $ <

BIOETHICS & INTELLECTUAL PROPERTY RIGHTS


C)$%"(' < 5 O!D$-("8$' <

1 .o6)' ,$-(6)$ +#% / .o6) (6(o)"+, =$) ?$$3

To " =+)( 3#o?,$%:$ o# !"o$(."-' +#% "#($,,$-(6+, =)o=$)(> )":.(' To '(6%> (.$ 8+)"o6' $(."-+, "''6$' "# !"o($-.#o,o:>

Prere;uisite B o 2rere;uisite Mo%6,$ I ,iotechnolo$) and ,ioethicsE 3hat is Ethical ,iotechnolo$)V 5=i$hts/ Con-identialit)/ :nimal =i$hts/ En.ironmental Ethics/ Decision Makin$6 A Ethical :s2ects 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 8r2han dru$sE Mo%6,$ II Intellectual Pro2ert) =i$hts A De.elo2ment and need -or IP= in kno3led$e based industriesE 7arious t)2es o- intellectual Pro2ert) =i$hts 3ith e@am2les 5Trademarks/ co2)ri$hts/ Industrial Desi$ns/ Patents/ 1eo$ra2hical Indicators etc6 A 8bjecti.es o- the 2atent s)stem A ,asic Princi2les and 1eneral =e;uirements o- Patents 5 o.elt)/ Itilit) on ob.iousnessE Etc6 and tenets o- 2atent la3 A Product and 2rocess Patents6 Mo%6,$ 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 7arious :mendments to Patent La3 in IndiaE Com2arison o- Patent La3 in India and the ISE I#($)#+("o#+, Co#8$#("o#' +#% ()$+("$'B T=IPSE E.olution and 2resent statusE WIP8 and its -unctionin$E C,D Treat)E Paris and ,erne Con.entions En-orcement and Dis2ute Settlement in WT8 A Patent Coo2eration Treat) IP= and WT8 re$imeE Mo%6,$ IV ,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$ 4 ,io2irac) 5Case studies o- eem / Turmeric / :ro$)a2acha o- <ani Tribals in <erala/=os) Peri3inkle o- Mada$ascar6Traditional kno3led$e S)stems 5T<S6 A 82tions -or 2rotection o- Traditional kno3led$e S)stemsE eed -or Sui 1enerics S)stemsE T<S and the ational and International :renaE ,iodi.ersit) and >armers ri$hts A IP= and Plant 1enetic =esources A Plant ,reeder =i$hts EIP87 Treat)E

T$7( Boo3' #E Ethical Issues in ,iotechnolo$)E Edited b) =ichard Sherlock and Gohn DEMorre)E %!!% Publishers Lanham/ MdB =o3man and Little-ieldE %E GE=ehm and 1E=eed/ ,iotechnolo$)/ Second Edition/ Multi 7olume Treatise/ 7olume #% Le$al Economic and Ethical Dimensions/ 7CHPublishersE &E Prabuddha 1an$uli Intellectual Pro2ert) =i$hts-Inleashin$ the <no3led$e Econom)E Tata McE1ra3 Hill Publishin$ Com2an) Limited/ e3 DelhiE (E ,eier/ >E</ Cres2i/=ES and Straus/ TE,iotechnolo$) and Patent 2rotection A 8@-ord and I,H Publishin$ CoE e3 DelhiE *E Sasson :/ ,iotechnolo$ies and De.elo2ment/ I ESC8 PublicationsE +E Ge--re) ME1imble/ :cademia to ,iotechnolo$)/ Else.ier/ :cademic

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H &!H #!H Tests 5minimum %6 :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE =e$ularit) in the class

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

CH09 L21 NANOMATERIALS AND NANOTECHNOLOGY


T$+-."#: '-.$ $ ' hours lecture ; 2 hour tutorial per week O!D$-("8$' To impart the basic concepts of nanotechnology To develop understanding about application of nanomaterials. No P)$;)$B6"'"($'

C)$%"('< (

Mo%6,$ / 5#& Hours6 Introduction to nanotechnolo$)/ nanoscale/ electroma$netic s2ectrum/ to2 do3n and bottom u2 a22roach/ 2article si9e/ chemistr) and 2h)sics o- nanomaterials/ electronic 2henomenon in nanostructures/ o2tical absor2tion in solids/ ;uantum e--ectsE Mo%6,$ 2 5#& Hours6 anomaterials/ 2re2aration o- nanomaterials like $old/ sil.er/ di--erent t)2es o- nano-o@ides/ :l %8&/ Ti8%/ Cn8 etcE Sol-$el methods/ chemical .a2our de2osition/ ball millin$ etcE Carbon nanotubes/ 2re2aration 2ro2erties and a22lications like -ield emission dis2la)sE Di--erent t)2es o- characteri9ation techni;ues like SEM/ :>M/ TEM 4 STME Mo%6,$ 1 5#& Hours6 anocom2osites/ nano-illers/ hi$h 2er-ormance materials/ 2ol)mer nanocom2osites/ nanocla)s/ nano3ires/ nanotubes/ nanoclusters etcE Smart materials/ sel- assembl) o- materials/ sa-et) issues 3ith nanoscale 2o3dersE Mo%6,$ 5 5#& Hours6 anomani2ulation/ Micro and nano-abrication techni;ues/ Photolitho$ra2h)/ E-beam/ >I, etcE anolitho$ra2h)E/ so-tlitho$ra2h)/ 2hotoresist materialsE Introduction to MEMS/ EMS and nanoelectronicsE Introduction to bionanotechnolo$) and nanomedicinesE

T$7( Boo3' R$*$)$#-$'< #E anocom2osite science and technolo$)/ Pulikel ME :ja)an/ Wile)-7CH %!!* %E anolitho$ra2h) and 2atternin$ techni;ues in microelectronics/ Da.id 1E ,ucknall/ Wood head 2ublishin$ %!!* &E Trans2ort in anostructures/ DE<E >err) and SEME 1oodmick/ Cambrid$e uni.ersit) 2ress #""'E (E 82tical 2ro2erties o- solids/ >E Wooten/ :cademic 2ress #"'% *E Micro and ano-abrication/ Chen$ Cui/ S2rin$er %!!* +E anostructured materials/ Gackie RE Rin$/ :cademic 2ress %!!# 'E anotechnolo$) and nanoelectronics/ WE=/ >ahrner/ S2rin$er %!!* 0E anoen$ineerin$ o- structural/ -unctional and smart materials/ Mark GE Schul9/ Ta)lor 4 >rancis %!!+E "E Hand book o- anoscience/ En$ineerin$/ and Technolo$)/ William :E 1oddard/ C=C 2ress %!!&E #!E anoelectronics and In-ormation Technolo$)/ =ainer Waser/ Wile)-7CH %!!&E ##E The MEMS Handbook >rank <reith/ C=C 2ress %!!%E

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H &!H #!H Tests 5minimum %6 :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE =e$ularit) in the class

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

CH09 L25 INDUSTRIAL POLLUTION CONTROL


T$+-."#: '-.$ $ ' hours lecture ; 2 hour tutorial per week Objectives To impart the basic concepts of industrial pollution control To develop understanding about water air light pollution control No P)$;)$B6"'"($'

C)$%"('< (

Mo%6,$ / (/1.o6)') Classi-ication o- industrial 3aste3ater - t)2es o- 2ollutants and their e--ects - monitorin$ and anal)sis methods - 3ater 2ollution la3s and standards - industrial 3aste3ater treatment - 2rocesses and e;ui2ment Mo%6,$ II (/1.o6)') Water 2ollution control in industries - 2ul2 and 2a2er/ te@tile 2rocessin$/ tanner) 3astes/ dair) 3astes/ canner) 3astes/ bre3er)/ distiller)/ meet 2ackin$/ -ood 2rocessin$ 3astes/ 2harmaceutical 3astes/ chloralkali industries/ -ertili9er industr)/ 2etrochemical industr)/ rubber 2rocessin$ industr)/ starch industries/ metal industries/ nuclear 2o3er 2lant 3astes/ thermal 2o3er 2lant 3astesE

Mo%6,$ III (/1.o6)') :ir 2ollution control in industriesB source and classi-ication o- industrial air 2ollutants - monitorin$ e;ui2ment and method o- anal)sis - dama$es to health/ .e$etation and materials - air 2ollution la3s and standards - treatment method in s2eci-ic industries - thermal 2o3er 2lants - cement - -ertili9ers - 2etroleum re-ineries - iron and steel - chlor-alkali - 2ul2 and 2a2er Mo%6,$ IV (/1.o6)') Industrial odour control - sources and solutions - odour control b) adsor2tion and 3et scrubbin$ - industrial noise control methods - slud$e treatment and dis2osal - industrial ha9ardous 3aste mana$ement/ 3aste minimi9ationE En.ironmental Im2act :ssessment and risk assessment-En.ironmental :udit and En.ironmental mana$ement s)stem- Conce2t o- common e--luent treatment 2lantsE R$*$)$#-$'B #E elson 4 emero3/ Industrial Water 2ollution-8ri$in/ Characteristics and treatment/ :ddison/ Wesle) Publishin$ CoE %E 1erard <iel)/En.ironmental En$ineerin$/ Mc1ra3 Hill &E =ao ME E 4 =ao H/:ir Pollution/ Tata Mc1ra3 Hill (E Sincero :EPE4 Sincero 1E:E/ En.ironmental En$ineerin$/ : Desi$n :22roach/ Prentice Hall oIndia *E =ao CESE/ En.ironmental Pollution Control En$ineerin$/ e3 :$e IntE PubE +E Mahajan SEPE/ Pollution Control in Process Industries/ Tata Mc1ra3 Hill 'E ,abbitt HEE/ Se3a$e 4 Se3a$e Treatment/ Gohn Wile) 0E :bbasi SE:/ 4 =amasami E/ ,iotechnical Methods o- Pollution Control/ Ini.ersities Press5India6 LtdE

I#($)#+, Co#("#6o6' A''$'' $#( %Maximum Marks&'() +!H &!H #!H Tests 5minimum %6 :ssi$nments 5minimum %6 such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ ;ui9/ literature sur.e)/ seminar/ term-2roject/ so-t3are e@ercises/ etcE =e$ularit) in the class

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

You might also like