M.Sc.

IT syllabus
Admission criterion for MSc. Part I by papers:
For admission to MSc. IT, the following conditions will apply:
1. There will be 20 seats per batch. ll the admissions will be on merit !i.e., percentage
of aggregate mar"s sec#red for the $#alifying e%amination&. 'eser(ation criterion
sho#ld be followed as prescribed by go(ernment at the time of admission.
2. St#dents sec#ring minim#m )* percent mar"s at the three year +Sc degree in
Information Technology of M#mbai #ni(ersity or any recogni,ed #n
for theory and *0 mar"s for practical-case st#dy-seminars.
a& For MSc part I all the papers will be comp#lsory.
b& MSc. .art II will ha(e two s#b/ects comp#lsory and two electi(e s#b/ects
0ach paper will ha(e minim#m ) Theory lect#res per wee" each lect#re is of 1 hr d#ration.
The lect#res sho#ld be organi,ed in s#ch a way that each paper will ha(e minim#m 100 hrs
contact sessions for the year.
Standard of passing:
For MSc part I: To pass e%amination a candidate will ha(e to sec#re
1& Minim#m 201 mar"s in each theory paper and minim#m )01 mar"s in aggregate for all
the s#b/ects.
For MSc part II: To pass e%amination a candidate will ha(e to sec#re
1& Minim#m 201 mar"s in each theory paper and minim#m )01 mar"s in aggregate
incl#ding dissertation wor" on the pro/ect..
2& The s#bmission of dissertation wor" is comp#lsory and st#dent sho#ld appear for (i(a for
the same.
The candidate is allowed to "eep terms for ma%im#m of all the s#b/ects for the .art I b#t can
ta"e admission .art II. 2owe(er the res#lt of s#ch st#dent for part II e%amination will not be
declared till candidate s#ccessf#lly completes part I e%amination.
Award of class: s per the pre(ailing norms for other science s#b/ects.
M Sc IT First Year
Subects !ect" Pract" Paper Pract Total
#ee$ #ee$ %ours Mar$s
I 3ear 4 I Term
1 5omp#ter Sim#lation and Modeling ) ) 6 100 *0 1*0
I 3ear 4 II Term
.rogramming with 5omponents ) ) 6 100 *0 1*0
I 3ear 4 I Term
2 Mobile 5omp#ting ) ) 6 100 *0 1*0
I 3ear 4 II Term
d(anced 5omp#ter 7etwor"s ) ) 6 100 *0 1*0
I 3ear 4 I Term
6 Image .rocessing ) ) 6 100 *0 1*0
I 3ear 4 II Term
Speech 'ecognition ) ) 6 100 *0 1*0
I 3ear 4 I Term
) 8ata 9areho#sing and Mining ) ) 6 100 *0 1*0
I 3ear 4 II Term
d(anced 8atabase Systems ) ) 6 100 *0 1*0
Total , I 3ear 4 I Term 1: 1: ; )00 200 :00
Total , I 3ear 4 II Term 1: 1: ; )00 200 :00
.age 1 of 2<
M Sc IT Second Year
Subects !ect" Pract" Paper Pract Total
#ee$ #ee$ %ours Mar$s
II 3ear 4 I Term
1 Software Testing ) ) 6 100 ;; 100
II 3ear 4 II Term
Information Sec#rity ) ) 6 100 ;; 100
II 3ear 4 I Term
2 rtificial Intelligence ) ) 6 100 ;; 100
II 3ear 4 II Term
'obotics ) ) 6 100 ;; 100
II 3ear 4 I Term
6 0lecti(e I
I Term ) ) 100 *0 1*0
II Term ) ) 100 *0 1*0
) 0lecti(e II
I Term ) ) 100 *0 1*0
II Term ) ) 100 *0 1*0
* .ro/ect, I Term ; ; ; 100 100
.ro/ect, II Term ; ; ; 100 100
Total , II 3ear 4 I Term 1: 1: ; )00 200 :00
Total , II 3ear 4 II Term 1: 1: ; )00 200 :00
&lecti'e(I &lecti'e(II
1 .arallel .rocessing, !I Term& 1 .attern 'ecognition, !I Term&
8istrib#ted 5omp#ting, !II Term& 5omp#ter =ision, !II Term&
2 Intelligent Systems, !I Term& 2 System Sec#rity, !I Term&
7e#ral 7etwor"s and F#,,y Systems !II
Term&
=irt#al 'eality and =irt#al
0n(ironment
6 8igital Signal .rocessing, !I Term& 6 M#ltimedia systems and
con(ergence of technologies
0nterprise 7etwor"ing !II Term& >a(a Technology, !II Term&
M Sc Information Tec)nology Year I
M Sc Information Technology Year I, Paper I, Term I
SUBJECT: COMPUTE SIMU!"TIO# "#$ MO$E!I#%
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term #or$ " Practical: -, Mar$s
.becti'e: In the last fi(e decades digital comp#ter sim#lation has de(eloped from
infancy to a f#ll;fledged discipline. The field of modeling and sim#lation is as di(erse as of
man. The application of sim#lation contin#es to e%pand, both in terms of e%tent to which
sim#lation is #sed and the range of applications. This co#rse gi(es a comprehensi(e and
state of art treatment of all the important aspects of a sim#lation st#dy, incl#ding modeling,
sim#lation software, model (erification and (alidation, inp#t modeling.
DETAILED SYLLABUS
1. Introduction to Simulation: System and System en(ironment, 5omponents of system,
Type of systems, Type of models, Steps in sim#lation st#dy, d(antages and
8isad(antages of sim#lation.
2. Simulation &/amples: Sim#lation of ?#e#eing systems, @ther e%amples of
sim#lation.
.age 2 of 2<
6. 0eneral Principles: 5oncepts of discrete e(ent sim#lation, Aist processing,
). Simulation Software: 2istory of sim#lation software, 8esirable software feat#res,
Beneral;p#rpose sim#lation pac"ages, @b/ect oriented sim#lation, Trends in sim#lation
software.
*. Statistical Models in Simulation: Csef#l statistical model, 8iscrete distrib#tion,
5ontin#o#s distrib#tion, .oisson process, 0mpirical distrib#tion.
:. 1ueueing Models: 5haracteristics of ?#e#eing systems, ?#e#eing notations, Aong r#n
meas#res of performance of ?#e#eing systems, Steady state beha(ior of infinite
pop#lation Mar"o(ian models, Steady state beha(ior finite pop#lation model, 7etwor"
of ?#e#es.
D. 2andom 3umber 0eneration: .roperties of random n#mbers, Beneration of pse#do
random n#mbers, Techni$#es for generating random n#mbers, Tests for random
n#mbers.
E. 2andom 4ariate 0eneration: In(erse transform techni$#e, 5on(ol#tion method,
cceptance re/ection techni$#es
<. Input Modeling: 8ata 5ollection, Identifying the 8istrib#tion of data, .arameter
estimation, Boodness of fit tests, Selection inp#t model witho#t data, M#lti(ariate and
Time series inp#t models.
10. 4erification and 4alidation of Simulation Model: Model b#ilding, =erification, and
=alidation, =erification of sim#lation models, 5alibration and =alidation of models.
11. .utput Analysis for a Single Model: Types of sim#lations with respect to o#tp#t
analysis, Stochastic nat#re of o#tp#t data, Meas#re of performance and their
estimation, @#tp#t analysis of terminating sim#lators, @#tp#t analysis for steady state
sim#lation
12. 5omparison and &'aluation of Alternati'e System 6esign: 5omparison of two
system design, 5omparison of se(eral system design, Meta modeling, @ptimi,ation (ia
sim#lation.
16. 5ase Studies: Sim#lation of man#fact#ring systems, Sim#lation of comp#ter systems,
Sim#lation of s#per mar"et, Sim#lation of pert networ"
BOOKS
Te/t 7oo$s:
1. >erry +an"s, >ohn 5arson, +arry 7elson, 8a(id 7icol, FDiscrete Event System
SimulationG
2. (erill Aaw, 9. 8a(id Helton, FSimulation Modeling and Analysis, McB'9;2IAA
2eferences:
1. Beffery Bordon, System Simulation, .2I
2. +ernard Ieigler, 2erbert .raehofer, Tag Bon Him, FTheory of Modeling and
SimulationG, cademic .ress
6. 7arsing 8eo, System Simulation with Digital Computer, .2I
). 8onald 9. +ody, FSystem Analysis and ModelingG, cademic .ress 2arco#rt India
*. 9 8a(id Helton, 'andall Sadows"i, 8eborah Sadows"i, FSimulation with ArenaG,
McB'9;2IAA.
TERM WORK
1. Term wor" sho#ld consist of at least 10 practical e%periments-ssignments co(ering
the topics of the syllab#s.
ORAL EXAMINATION
n oral e%amination is to be cond#cted based on the abo(e syllab#s.
.age 6 of 2<
M Sc Information Technology Year I, Paper I, Term II
SUBJECT: PO%"MMI#% &IT' COMPO#E#TS
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term wor$" Practical: -, Mar$s
.becti'es of t)e course: 5@M addresses software design in a (ery pragmatic way.
Instead of pro(iding a sol#tion based on almost religio#s academic dogma of ob/ect
oriented programming, 5@MJs design ta"es into acco#nt both h#man nat#re and
capitalism. 5@M is mostly widely #sed ob/ect model for de(eloping distrib#ted and
conc#rrent systems. im of this s#b/ect to st#dy and learn 5@M and #se 5@M to deploy
s#ch systems s#ccessf#lly.
Pre(re8uisites: 5KK, >a(a .rogramming, @@8
DETAILED SYLLABUS
1. Introduction to obect oriented systems: .re(iew of @b/ect;orientation, 5oncept of
distrib#ted ob/ect systems, 'easons to distrib#te for centrali,ed ob/ects. Mapping
ob/ects to locations. @b/ect oriented system architect#re, client;ser(er system
architect#re, m#lti tier system architect#res. 8esign of ob/ect oriented system
architect#re and component technology compo#nd doc#ment.
2. Introduction to distributed obects: 5omp#ting standards, @MB, @(er(iew of
5@'+, @(er(iew of 5@M-85@M and of an open doc, @(er(iew of @b/ect 9eb,
@(er(iew of /a(a, 0nterprise /a(a beans.
6. 5omponent .bect Model 95.M: introduction: 5om as better 5KK software
distrib#tion, 8ynamic lin"ing, Separating interface and 5@M implementation, '#n
time polymorphism, Introd#ction to 85@M.
). Interface in 5.M(65.M: Introd#ction to interfaces, Interface definition lang#age
!I8A&, Interface and I8A, Csing 5@M interface pointers, @ptimi,ing $#ery interface,
5ode sharing and re#se.
*. 5lasses and .bects in 5.M(65.M: Introd#ction, 5lasses and ser(ers,
@ptimi,ations, 5lasses and I8A, 5lass em#lation, ?#ery interface types and properties,
@b/ect ser(ices and dynamic composition.
:. Apartments: 5ross;apartments access, lifecycle management.
D. 5.27A: Introd#ction and concepts, distrib#ted ob/ects in 5@'+, 5@'+
components, architect#ral feat#res, method in(ocations static and dynamic: I8A
!Interface 8efinition Aang#age& models and interfaces. Str#ct#re of 5@'+ I8A,
5@'+Js self;describing dataL 5@'+ interface repository.
E. 5.27A Ser'ices: Ser(ices for ob/ect naming, @b/ect lifecycle, 0(ent, Transaction
ser(ice feat#res, conc#rrency control ser(ices, persistent ob/ect ser(ice and 5@'+
sec#rity ser(ice.
;. &nterprise <a'a 7eans
10. <A4A Interface: >7I interface with 5KK, =5KK.
11. .bect #eb: web technologies interfacing with distrib#ted ob/ects o(er client ser(er
and distrib#te architect#re.
BOOKS
Te/t 7oo$s:
1. +ooch, >acobson, 'amb#g, FEssential CMG, .earson 0d#cation
2. 8on +o%, FEssential CMG, .earson 0d#cation.
6. >ason .ritchard, FCM and C!"A side #y sideG, .earson 0d#cation.
2eferences:
1. Tom =ales"y, FEnterprise $ava "eansG, .earson 0d#cation
.age ) of 2<
TERM WORK
1. Term wor" sho#ld consist of at least 10 practical e%periments co(ering the topics of the
syllab#s #sing 5@M- 0>+ Technologies
ORAL EXAMINATION
n oral e%amination is to be cond#cted based on the abo(e syllab#s.
M Sc Information Technology Year I, Paper II, Term I
SUBJECT: MOBI!E COMPUTI#%
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term wor$ " Practical: -, Mar$s
.becti'e: 'ecent de(elopments in portable de(ices and high;bandwidth, #bi$#ito#s
wireless networ"s has made mobile comp#ting a reality. Indeed, it is widely predicted that
within the ne%t few yearsJ access to Internet ser(ices will be primarily from wireless
de(ices, with des"top browsing the e%ception. S#ch predictions are based on the h#ge
growth in the wireless phone mar"et and the s#ccess of wireless data ser(ices. This co#rse
will help in #nderstanding f#ndamental concepts, c#rrent de(elopments in mobile
comm#nication systems and wireless comp#ter networ"s.
Pre(re8uisites: 5omp#ter 7etwor"s.
DETAILED SYLLABUS
1. Introduction: pplications, short history of wireless comm#nication
2. #ireless Transmission: Fre$#ency for radio transmission, Signals, ntennas, Signal
propagation, M#ltiple%ing, Mod#lation, Spread spectr#m, 5ell#lar systems.
6. Medium Access 5ontrol: Moti(ation for a speciali,ed M5: 2idden and 0%posed
terminals. 7ear and Far terminalsL S8M, F8M, T8M: Fi%ed T8M, 5lassical
loha, Slotted loha, 5arrier sense m#ltiple access, 8emand assigned m#ltiple access,
.'M pac"et reser(ation m#ltiple access, 'eser(ation T8M, M#ltiple access with
collision a(oidance, .olling, Inhibit sense m#ltiple accessL 58M: Spread loha
m#ltiple access.
). Telecommunication Systems: BSM: Mobile ser(ices, System architect#re, 'adio
interface, .rotocols, Aocali,ation nd 5alling, 2ando(er, Sec#rity, 7ew data ser(icesL
805T: System architect#re, .rotocol architect#reL T0T', CMTS and IMT;2000:
CMTS +asic architect#re, CT' F88 mode, CT' T88 mode
*. Satellite Systems: 2istory, pplications, +asics: B0@, A0@, M0@L 'o#ting,
Aocali,ation, 2ando(er, 0%amples
:. 7roadcast Systems: @(er(iew, 5yclic repetition of data, 8igital a#dio
broadcasting: M#ltimedia ob/ect transfer protocolL 8igital (ideo broadcasting
D. #ireless !A3: Infrared (s. 'adio transmission, Infrastr#ct#re and d hoc 7etwor"s,
I000 E02.11: System architect#re, .rotocol architect#re, .hysical layer, Medi#m access
control layer, M5 management, F#t#re de(elopmentL 2I.0'A7: .rotocol
architect#re, .hysical layer, 5hannel access control. S#blayer, Medi#m access control
S#blayer, Information bases nd 7etwor"ingL +l#etooth: Cser scenarios, .hysical layer,
M5 layer, 7etwor"ing. Sec#rity, Ain" management.
E. #ireless ATM: Moti(ation for 9TM, 9ireless TM wor"ing gro#p, 9TM ser(ices,
'eference model: 0%ample config#rations, Beneric reference modelL F#nctions:
9ireless mobile terminal side, Mobility s#pporting networ" sideL 'adio access layer:
'e$#irements, +'7L 2ando(er: 2ando(er reference model, 2ando(er re$#irements,
Types of hando(er, 2ando(er scenarios, +ac"ward hando(er, Forward hando(erL
Aocation management: 'e$#irements for location management, .roced#res and 0ntitiesL
ddressing, Mobile $#ality of ser(ice, ccess point control protocol
<. Mobile 3etwor$ !ayer: Mobile I.: Boals, ass#mptions and re$#irements, 0ntities and
Terminology, I. pac"et deli(ery, gent ad(ertisement and disco(ery, 'egistration,
.age * of 2<
T#nneling and 0ncaps#lation , @ptimi,ations, 'e(erse t#nneling, Ip(:L 8ynamic host
config#ration protocol, d hoc networ"s: 'o#ting, 8estination se$#ence distance (ector,
8ynamic so#rce ro#ting, 2ierarchical algorithms, lternati(e metrics
10. Mobile Transport !ayer: Traditional T5.: 5ongestion control, Slow start, Fast
retransmit-fast reco(ery, Implications on mobilityL Indirect T5., Snooping T5., Mobile
T5., Fast retransmit-fast reco(ery, Transmission-time;o#t free,ing, Selecti(e
retransmission, Transaction oriented T5.
11. Support for Mobility: File systems: 5onsistency, 0%amplesL 9orld 9ide 9eb:
2yperte%t transfer protocol, 2yperte%t mar"#p lang#age, Some approaches that might
help wireless access, System architect#resL 9ireless application protocol: rchitect#re,
9ireless datagram protocol, 9ireless transport layer sec#rity, 9ireless transaction
protocol, 9ireless session protocol, 9ireless application en(ironment, 9ireless mar"#p
lang#age, 9MA script, 9ireless telephony application, 0%amples Stac"s with 9ap,
Mobile databases, Mobile agents
BOOKS
Te/t 7oo$s:
1. >ochen Schiller, FMo#ile communications, ddison wisely , .earson 0d#cation
2. 9iiliam Stallings, F%ireless Communications and &etwor'sG
2eferences :
1. 'appaort, F%ireless Communications .rincipals and (racticesG
2. 3I +ing Ain , F%ireless and Mo#ile &etwor' ArchitecturesG, >ohn 9iley
6. .. 7icopolitidis , F%ireless &etwor'sG, >ohn 9iley
). H .ahla(an, .. Hrishnam#rthy , F(rinciples of %ireless &etwor'sG
*. M. 'ichharia , FMo#ile Satellite Communication) (rinciples and TrendsG, .earson
0d#cation
TERM WORK
2. Term wor" sho#ld consist of at least 10 practical e%periments and two assignments
co(ering the topics of the syllab#s.
ORAL EXAMINATION
n oral e%amination is to be cond#cted based on the abo(e syllab#s.
M Sc Information Technology Year I, Paper II, Term II
SUBJECT: "$("#CE$ COMPUTE #ET&O)S
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term wor$ " Practical: -, Mar$s
.becti'es: In first part, d(anced technologies li"e 2igh speed 8e(ices etc. are to be
considered. Second part 7etwor" programming is to be st#died. 7ot /#st S@5H0TS b#t
also protocols, 8ri(ers, Sim#lation .rogramming. In third part we sho#ld st#dy 7etwor"
8esign, .rotocols designs and analysis considering deterministic and non;deterministic
approach. 9e e%pect nat#ral thin"ing from st#dent. For e%ample he sho#ld able to consider
different constraints and ass#me s#itable data and sol(e the problems.
Pre(re8uisites: 5omp#ter networ"s
DETAILED SYLLABUS
1. 6ata 5ommunications: +#siness 8ri(ers and 7etwor"ing 8irections : 8ata
comm#nication .ast and f#t#re.
2. =nderstanding t)e standards and t)eir ma$er: 5reating standards: players and
.rocess, 5#rrent for#ms, Standard protocols, Aayered reference models: The @SI'M,
Standard comp#ter architect#res.
6. Introduction to Transmission Tec)nologies: 2ardware selection in the design
.age : of 2<
process.
). .ptical 3etwor$ing: S@70T-S82 standards, 8ense wa(elength di(ision
m#ltiple%ing !898M&, .erformance and 8esign considerations.
*. P)ysical !ayer Protocols and Access Tec)nologies: .hysical Aayer .rotocols and
Interfaces, ccessing the 7etwor", 5opper access technologies, 5able ccess
Technologies, Fiber ccess Technologies, ir ccess Technologies.
:. 5ommon Protocols and Interfaces in t)e !A3 en'ironment: 8ata lin" layers
protocols, AA5 and M5 s#b layer protocol, 0thernet, To"en 'ing, To"en +#s and
F88I, +ridge protocols, Switching in the A7 en(ironment.
D. Frame 2elay: F' specification and design, =oF': .erformance and 8esign
considerations, d(antages and disad(antages of F'.
E. 5ommon #A3 Protocol: TM: Many faces of TM, TM protocol operation !TM
cell and Transmission&, TM networ"ing basics, Theory of operations, +;IS87
protocol reference model, .23 layer, TM layer !.rotocol model&, TM layer and cell
!8efinition&, Traffic descriptors and parameters, Traffic and 5ongestion control
defined, A .rotocol model, Traffic contract and ?oS, Cser plane o(er(iew, 5ontrol
plane A, Management plane, S#b;8S6 TM, TM p#blic ser(ices.
<. 5ommon Protocols and Interfaces in t)e =pper !ayers9T5P"IP:: +ac"gro#nd
!'o#ting protocols&, T5.-I. s#ite, 7etwor" layer !Internetwor" layer&, Transport layer,
pplication layer, ddressing and ro#ting design.
10. Mature Pac$et Switc)ed Protocol: ITC 'ecommendation M.2*, Cser connecti(ity,
Theory of @peration, 7etwor" layer f#nctions, M.D* Internetwor"ing protocol,
switched m#ltimegabit data ser(ice !SM8S&, SM8S and I000 E02.:, S#bscriber
Interface and ccess protocol, ddressing and Traffic control.
11. 2e8uirements 6efinition: Cser re$#irements,
e traffic matri%, 5apacity planning and 7etwor" (ision, 8esign tool, 5ategories of
tools, 5lasses of design tool, 5omponents of design pro/ects, Types of design pro/ects.
12. Tec)nology 5omparisons: 5irc#its;message;pac"et and cell switching methods,
.ac"et switching ser(ice aspects, Beneric pac"et switching networ" characteristics,
.ri(ate (erses p#blic networ"ing, .#blic networ" ser(ice selection, +#siness aspects of
.ac"et;Frame and cell switching ser(ices, 2igh speed A7 protocols comparisons,
pplication performance needs.
16. Access 3etwor$ 6esign: 7etwor" design layers, ccess layer design, ccess networ"
capacity, networ" topology and hardware, completing the access networ" design.
1). 7ac$bone 3etwor$ 6esign: +ac"bone re$#irements, 7etwor" capacities, Topologies,
Topologies strategies, T#ning the networ".
BOOKS
Te/t 7oo$s:
1. 8arren A Spohn, F8ata 7etwor" 8esignG, TM2
2. 8. +ertse"as, '. Ballager, FData &etwor'sG, .2I
2eferences:
1. 9.'. Ste(ens, F*ni+ &etwor' (rogrammingG, =ol.1, .earson 0d#cation
2. >.9alrand, .. =araiya, F2igh .erformance 5omm#nication 7etwor"sG, Morgan
Ha#fmann
6. 3. Iheng, S. "htar, F7etwor"s for 5omp#ter Scientists and 0ngineersG, @%ford
). .S. Tanenba#m, F5omp#ter 7etwor"sG
*. .eterson N 8a(ie, F5omp#ter 7etwor"sG, 2arco#rt sia.
:. >ames 8. Mc5abe , F.ractical 5omp#ter nalysis and 8esignG, 2arco#rt sia.
TEM &O)
6. Term wor" sho#ld consist of at least 10 practical e%periments and two assignments
co(ering all the topics of the syllab#s.
.age D of 2<
.2A! &>AMI3ATI.3
n oral e%amination is to be cond#cted based on the abo(e syllab#s.
M Sc Information Technology Year I, Paper III, Term I
SUBJECT: IM"%E POCESSI#%
!ectures: * %rs per wee$
Practical: ? %rs per wee$
T)eory: +,, Mar$s
Term #or$ " Practical: ?- Mar$s
.becti'e: 8igital Image .rocessing is a rapidly e(ol(ing field with growing applications
in science and engineering. Image processing holds the possibility of de(eloping the
#ltimate machine that co#ld perform the (is#al f#nctions of all li(ing beings. There is an
ab#ndance of image processing applications that can ser(e man"ind with the a(ailable and
anticipated technology in the near f#t#re.
DETAILED SYLLABUS
1. Introduction to 5omputer 0rap)ics: Beometry and line generation, Braphics
primiti(es, Transformations
2. 6igital Image Processing Systems: Introd#ction, Str#ct#re of h#man eye, Image
formation in the h#man eye, +rightness adaptation and discrimination, Image sensing
and ac$#isition, Storage, .rocessing, 5omm#nication, 8isplay. Image sampling and
$#anti,ation, +asic relationships between pi%els
6. Image Transforms 9Implementation:: Introd#ction to Fo#rier transform, 8FT and 2;
8 8FT, .roperties of 2;8 8FT, FFT, IFFT, 9alsh transform, 2adamard transform,
8iscrete cosine transform, Slant transform, @ptim#m transform: Harh#nen ; Aoe(e
!2otelling& transform.
). Image &n)ancement in t)e Spatial 6omain: Bray le(el transformations, 2istogram
processing, rithmetic and logic operations, Spatial filtering: Introd#ction, Smoothing
and sharpening filters
*. Image &n)ancement in t)e Fre8uency 6omain: Fre$#ency domain filters:
Smoothing and Sharpening filters, 2omomorphic filtering
:. #a'elets and Multiresolution Processing: Image pyramids, S#bband coding, 2aar
transform, Series e%pansion, Scaling f#nctions, 9a(elet f#nctions, 8iscrete wa(elet
transforms in one dimensions, Fast wa(elet transform, 9a(elet transforms in two
dimensions
D. Image 6ata 5ompression: F#ndamentals, 'ed#ndancies: 5oding, Interpi%el, .sycho;
(is#al, Fidelity criteria, Image compression models, 0rror free compression, Aossy
compression, Image compression standards: +inary image and 5ontin#o#s tone still
image compression standards, =ideo compression standards.
E. Morp)ological Image Processing: Introd#ction, 8ilation, 0rosion, @pening, 5losing,
2it;or;Miss transformation, Morphological algorithm operations on binary images,
Morphological algorithm operations on gray;scale images
<. Image Segmentation: 8etection of discontin#ities, 0dge lin"ing and +o#ndary
detection, Thresholding, 'egion based segmentation
10. Image 2epresentation and 6escription: 'epresentation schemes, +o#ndary
descriptors, 'egional descriptors
.age E of 2<
BOO)S
Te/t 7oo$s:
1. '.5.Bonsales '.0.9oods@ ADigital ,mage (rocessingG, Second 0dition, .earson
0d#cation
2. nil H. >ain, F-undamentals of ,mage (rocessingG, .2I
2eferences:
1. 9illiam .ratt, FDigital ,mage (rocessingG, >ohn 9iley
2. S. 2arrrington, F5omp#ter BraphicsG, McBraw 2ill
6. Milan Son"a,=acla( 2la(ac, 'oger +oyle, F,mage (rocessing, Analysis, and
Machine .isionG Thomson Aearning
6. 7 hmed N H.'. 'ao, Frthogonal Transforms for Digital Signal (rocessingG
Springer
*. +. 5handa, 8. 8#tta Ma/#mder, FDigital ,mage (rocessing and AnalysisG, .2I
TERM WORK
). Term wor" sho#ld consist of at least 10 practical e%periments and two assignments
co(ering the topics of the syllab#s.
ORAL EXAMINATION
n oral e%amination is to be cond#cted based on the abo(e syllab#s.
M Sc Information Technology Year I, Paper III, Term II
SUBJECT: SPEEC' ECO%#ITIO#
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term wor$ " Practical: ?- Mar$s
.becti'es: 8e(elop an #nderstanding of the relationship of (ocal tract shapes and
physical aco#stics to the aco#stic speech signal. Cse a spectr#m analy,er to relate the
aco#stic speech signal to aco#stical processes. 8esign and implement digital filters to
synthesi,e speech and code speech at a low bit rate. Implement speech analysis and speech
synthesis mod#les #sing ob/ect;oriented software programs, #sing techni$#es s#ch as class
deri(ation, the #se of software ob/ects as components in a larger software system.
$ET"I!E$ SY!!"BUS
1. Fundamentals .f Speec) 2ecognition: Introd#ction, The paradigm for speech
'ecognition, o#t line, +rief history of speech recognition research.
2. T)e Speec) Signal: .rod#ction, reception, and co#stic;phonetic characteri,ation:
The speech prod#ction system, 'epresenting speech in time and fre$#ency domains,
Speech So#nds and feat#res, pproaches to a#tomatic speech recognition by machine.
6. Signal Processing And Analysis Met)ods For Speec) 2ecognition: The ban";of;
filters front;end processor. Ainear predicti(e model for speech recognition, =ector
$#anti,ation, #ditory based Spectral analysis model.
). Pattern 5omparison Tec)ni8ues: Speech detection, 8istortion Meas#res;
Mathematical 5onsiderations, 8istortion Meas#res;.ercept#al 5onsiderations,
Spectral;8istortion Meas#res, Incorporation of spectral dynamic feat#res into distortion
meas#res, Time lignment and 7ormali,ation.
*. Speec) 2ecognition System 6esign And Implementation Issues: pplication of
so#rce coding techni$#es to recognition, Template training methods, .erformance
analysis and recognition enhancements, Template adoption to new tal"ers,
8iscriminati(e methods in speech recognition, Speech recognition in ad(erse
en(ironment.
:. T)eory And Implementation .f %idden Mar$o' Models: 8iscrete time Mar"o(
processes, 0%tensions to hidden Mar"o( Models, The three basic problems for 2MMs,
.age < of 2<
Types of 2MMs, Implementation iss#es for 2MMs, 2MM system for isolated word
recognition
D. Speec) 2ecognition 7ased .n 5onnected #ords Models: Beneral notations for the
connected 9ord;'ecognition problem, The two le(el dynamic programming algorithm,
The le(el b#ilding algorithm, The one pass algorithm, M#ltiple candidate strings,
Brammar networ"s for connected digit recognition, Segmental H;Means training
proced#re, 5onnected digit recognition implementation.
B. !arge 4ocabulary 5ontinuous Speec) 2ecognition.
<. Tas" @riented pplications @f #tomatic Speech 'ecognition
BOO)S
Te/t 7oo$s:
1. A. 'abiner and +. >#ang, F-undamentals of Speech !ecognitionG, .earson 0d#cation.
2. A ' 'abiner and '9 Schafer, FDigital (rocessing of Speech SignalsG, .earson
0d#cation.
2eferences:
1. +. Bold and 7. Morgan, FSpeech and Audio Signal (rocessingG, >ohn 9iley.
2. 8. >#rafs"y and >.2. Martin, FSpeech and /anguage (rocessingG, .earson 0d#cation.
TEM &O)
*. Term wor" sho#ld consist of at least 10 practical e%periments and two assignments
co(ering the topics of the syllab#s.
O"! E*"MI#"TIO#
n oral e%amination is to be cond#cted based on the abo(e syllab#s.
.becti'es of t)e course: The data wareho#sing part of mod#le aims to gi(e st#dents a
good o(er(iew of the ideas and techni$#es which are behind recent de(elopment in the
data wareho#sing and online analytical processing !@A.& fields, in terms of data models,
$#ery lang#age, concept#al design methodologies, and storage techni$#es. 8ata mining
part of the model aims to moti(ate, define and characteri,e data mining as processL to
moti(ate, define and characteri,e data mining applications.
Pre(re8uisites: 8+MS
$ET"I!E$ SY!!"BUS
6ata #are)ousing:
+. .'er'iew And 5oncepts: 7eed for data wareho#sing, +asic elements of data
wareho#sing, Trends in data wareho#sing.
?. Planning And 2e8uirements: .ro/ect planning and management, 5ollecting the
re$#irements.
C. Arc)itecture And Infrastructure: rchitect#ral components, Infrastr#ct#re and
metadata.
*. 6ata 6esign And 6ata 2epresentation: .rinciples of dimensional modeling,
8imensional modeling ad(anced topics, data e%traction, transformation and
loading, data $#ality.
-. Information Access And 6eli'ery: Matching information to classes of #sers,
@A. in data wareho#se, 8ata wareho#sing and the web.
D. Implementation And Maintenance: .hysical design process, data wareho#se
.age 10 of 2<
M Sc Information Technology Year I, Paper I(, Term I
SUBJECT: $"T" &"E'OUSI#% "#$ MI#I#%
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term wor$"Practical: -, Mar$s
deployment, growth and maintenance.
6ata Mining:
+. Introduction: +asics of data mining, related concepts, 8ata mining techni$#es.
?. 6ata Mining Algorit)ms: 5lassification, 5l#stering, ssociation r#les.
C. Enowledge 6isco'ery : H88 .rocess
*. #eb Mining: 9eb 5ontent Mining, 9eb Str#ct#re Mining, 9eb Csage mining.
-. Ad'anced Topics: Spatial mining, Temporal mining.
D. 4isualisation : 8ata generali,ation and s#mmari,ation;based characteri,ation,
nalytical characteri,ation: analysis of attrib#te rele(ance, Mining class
comparisons: 8iscriminating between different classes, Mining descripti(e
statistical meas#res in large databases
F. 6ata Mining Primiti'es@ !anguages@ and System Arc)itectures: 8ata mining
primiti(es, ?#ery lang#age, 8esigning BCI based on a data mining $#ery
lang#age, rchitect#res of data mining systems
B. Application and Trends in 6ata Mining: pplications, Systems prod#cts and
research prototypes, dditional themes in data mining, Trends in data mining
BOO)S
Te/t 7oo$s:
1. .a#lra/ .onnian, FData %arehousing -undamentalsG, >ohn 9iley.
2. M.2. 8#nham, FData Mining ,ntroductory and Advanced TopicsG, .earson 0d#cation.
6. 2an, Hamber, FData Mining Concepts and Techni0uesG, Morgan Ha#fmann
2eferences:
1. 'alph Himball, FThe Data %arehouse /ifecycle tool'itG, >ohn 9iley.
2. M +erry and B. Ainoff, FMastering Data MiningG, >ohn 9iley.
6. 9.2. Inmon, F"uilding the Data %arehousesG, 9iley 8reamtech.
). '. Himpall, FThe Data %arehouse Tool'itG, >ohn 9iley.
*. 0.B. Mallach, FDecision Support and Data %arehouse systemsG, TM2.
TEM &O)
:. Term wor" sho#ld consist of at least 10 practical e%periments and two assignments
co(ering the topics of the syllab#s.
O"! E*"MI#"TIO#
n oral e%amination is to be cond#cted based on the abo(e syllab#s.

M Sc Information Technology Year I, Paper I(, Term II
SUBJECT: "$("#CE$ $"T"B"SE SYSTEMS
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term wor$" Practical: -, Mar$s
.becti'es: To st#dy the f#rther database techni$#es beyond which co(ered in the second
year, and th#s to ac$#aint the st#dents with some relati(ely ad(anced iss#es. t the end of
the co#rse st#dents sho#ld be able to: gain an awareness of the basic iss#es in ob/ected
oriented data models, learn abo#t the 9eb;8+MS integration technology and MMA for
Internet database applications, familiari,e with the data;wareho#sing and data;mining
techni$#es and other ad(anced topics, apply the "nowledge ac$#ired to sol(e simple
problems
Pre(re8uisites: 8atabase Systems, @@8.
$ET"I!E$ SY!!"BUS
1. T)e &/tended &ntity 2elations)ip Model and .bect Model: The 0' model
.age 11 of 2<
re(isited, Moti(ation for comple% data types, Cser defined abstract data types and
str#ct#red types, S#bclasses, S#per classes, Inheritance, Speciali,ation and
Benerali,ation, 5onstraints and characteristics of speciali,ation and Benerali,ation,
'elationship types of degree higher than two.
2. .bect(.riented 6atabases: @(er(iew of @b/ect;@riented concepts, @b/ect identity,
@b/ect str#ct#re, and type constr#ctors, 0ncaps#lation of operations, Methods, and
.ersistence, Type hierarchies and Inheritance, Type e%tents and $#eries, 5omple%
ob/ectsL 8atabase schema design for @@8+MSL @?A, .ersistent programming
lang#agesL @@8+MS architect#re and storage iss#esL Transactions and 5onc#rrency
control, 0%ample of @8+MS
6. .bect 2elational and &/tended 2elational 6atabases: 8atabase design for an
@'8+MS ; 7ested relations and collectionsL Storage and access methods, ?#ery
processing and @ptimi,ationL n o(er(iew of S?A6, Implementation iss#es for
e%tended typeL Systems comparison of '8+MS, @@8+MS, @'8+MS
). Parallel and 6istributed 6atabases and 5lient(Ser'er Arc)itecture: rchitect#res
for parallel databases, .arallel $#ery e(al#ationL .aralleli,ing indi(id#al operations,
Sorting, >oinsL 8istrib#ted database concepts, 8ata fragmentation, 'eplication, and
allocation techni$#es for distrib#ted database designL ?#ery processing in distrib#ted
databasesL 5onc#rrency control and 'eco(ery in distrib#ted databases. n o(er(iew of
5lient;Ser(er architect#re
*. 6atabases on t)e #eb and Semi Structured 6ata: 9eb interfaces to the 9eb,
@(er(iew of MMAL Str#ct#re of MMA data, 8oc#ment schema, ?#erying MMA dataL
Storage of MMA data, MMA applicationsL The semi str#ct#red data model,
Implementation iss#es, Inde%es for te%t data
:. &n)anced 6ata Models for Ad'anced Applications: cti(e database concepts.
Temporal database concepts.L Spatial databases, 5oncepts and architect#reL 8ed#cti(e
databases and ?#ery processingL Mobile databases, Beographic information systems.
BOOKS
Te/t 7oo$s:
1. 0lmasri and 7a(athe, F-undamentals of Data#ase SystemsG, .earson 0d#cation
2. 'agh# 'ama"rishnan, >ohannes Behr"e, FData#ase Management SystemsG, McBraw;
2ill
2eferences:
1. Horth, Silberchat,, S#darshan , FData#ase System ConceptsG, McBraw;2ill.
2. .eter 'ob and 5oronel, FData#ase Systems, Design, ,mplementation and
ManagementG, Thomson Aearning.
6. 5.>.8ate, Aongman, F,ntroduction To Data#ase SystemsG, .earson 0d#cation
TERM WORK
D. Term wor" sho#ld consist of at least 10 practical e%periments and two assignments
co(ering the topics of the syllab#s.
ORAL EXAMINATION
n oral e%amination is to be cond#cted based on the abo(e syllab#s.
.age 12 of 2<
M Sc Information Tec)nology Year II
M Sc Information Technology Year II, Paper I, Term I
SUBJECT: SO+T&"E TESTI#%
!ectures: * %rs per wee$ T)eory: +,, Mar$s
.becti'es To impro(e yo#r #nderstanding of software testing ; its p#rpose and nat#re ;
and raise yo#r awareness of iss#es and constraints aro#nd testing. To pro(ide a professional
$#alification widely recogni,ed by employers, c#stomers and peers. To learn standard
terminology. 8isco(er good so#rces of information. To pro(ide a complete pict#re of the
test acti(ities and processes from re$#irements re(iew to system implementation.
Pre(re8uisites: Software 0ngineering, @@8
DETAILED SYLLABUS
1. Introduction: 8efect, 8efect =s fail#res, .rocess problems and defect rates, The
b#siness perspecti(e for testing
2. 7uilding a Software Testing Strategy: 5omp#ter system strategic ris", 0conomics of
testing, 5ommon comp#ter problems, 0conomics of S8A5 testing, Testing; an
organi,ational iss#e, 0stablishing a testing policy, Str#ct#red approach to testing, Test
strategy, Testing methodology
6. &stablis)ing a Software Testing Met)odology: Introd#ction, =erification and
(alidation, F#nctional and str#ct#ral testing, 9or"bench concept, 5onsiderations in
de(eloping testing methodologies
). 6etermining Software Testing Tec)ni8ues: Testing techni$#es-tool selection process,
Selecting techni$#es-tools, Str#ct#ral system testing techni$#es, F#nctional system
testing techni$#es, Cnit testing techni$#es, F#nctional testing and analysis
*. Selecting and Installing Software Testing Tools: Testing tools;2ammers of testing,
Selecting and #sing the test tools, ppointing managers for testing tools
:. Software Testing Process: 5ost of comp#ter testing, Aife cycle testing concept,
=erification and (alidation in the software de(elopment process, Software testing
process, 9or"bench s"ills
D. Software Testing Process: ccess .ro/ect Management 8e(elopment 0stimate and
Stat#s, Test .lan, 'e$#irements .hase Testing, 8esign .hase Testing, .rogram .hase
Testing, 0%ec#te Test and 'ecord 'es#lts, cceptance Test, 'eport Test 'es#lt, Testing
Software Installation, Test Software 5hange, 0(al#ate Test 0ffecti(eness
E. Testing SpecialiGed Systems and Applications: 5lient-Ser(er systems, '8, System
doc#mentation, 9eb based systems, @ff;the;self software, M#lti platform en(ironment,
Sec#rity, 8ata 9areho#se
<. 7uilding Test 6ocument: Cses, Types, 'esponsibility, Storage, Test plan
doc#mentation, Test analysis report doc#mentation
Books
Te/t 7oo$s:
1. 9.0. .erry, FEffective Methods for Software TestingG, >ohn 9iley.
2. Haner 5., 7g#yen 2., Fal" >., FTesting Computer Software, >ohn 9iley.
2eferences :
1. +oris +ei,er, Software Testing Techni0ues, 8reamtech
2. Ao#ise Tamres, ,ntroducing Software Testing, .earson 0d#cation.
Assignments: 10 assignments o!e"ing t#e s$%%a&'s #as to &e s'&mitte(
M Sc Information Technology Year II, Paper I, Term II
SUBJECT: I#+OM"TIO# SECUITY
!ectures: * %rs per wee$ T)eory: +,, Mar$s
.becti'es of t)e course: Aearn abo#t the threats in comp#ter sec#rity. Cnderstand what
.age 16 of 2<
p#ts yo# at a ris" and how to control it. 5ontrolling a ris" is not eliminating the ris" b#t to
bring it to a tolerable le(el.
Pre(re8uisites: 5omp#ter 7etwor"s, @perating system.
DETAILED SYLLABUS
1. Introduction: Sec#rity, ttac"s, 5omp#ter criminals, Method of defense
2. Program Security: Sec#re programs, 7on;malicio#s program errors, =ir#ses and
other malicio#s code, Targeted malicio#s code, 5ontrols against program threats
6. .perating System Security: .rotected ob/ects and methods of protection, Memory
address protection, 5ontrol of access to general ob/ects, File protection mechanism,
#thentication: #thentication basics, .assword, 5hallenge;response, +iometrics.
). 6atabase Security: Sec#rity re$#irements, 'eliability and integrity, Sensiti(e data,
Interface, M#ltile(el database, .roposals for m#ltile(el sec#rity
*. Security in 3etwor$s: Threats in networ"s, 7etwor" sec#rity control, Firewalls,
Intr#sion detection systems, Sec#re e;mail, 7etwor"s and cryptography, 0%ample
protocols: .0M, SSA, I.sec
:. Administrating Security: Sec#rity planning, 'is" analysis, @rgani,ational sec#rity
policies, .hysical sec#rity.
D. !egal@ Pri'acy@ and &t)ical Issues in 5omputer Security: Protecting programs and
data, Information and law, 'ights of employees and employers, Software fail#res,
5omp#ter crime, .ri(acy, 0thical iss#es in comp#ter society, 5ase st#dies of ethics
7oo$s
Te/t 7oo$s:
1. 5. .. .fleeger, and S. A. .fleeger, FSecurity in ComputingG, .earson 0d#cation.
2. Matt +ishop, FComputer Security) Art and ScienceG, .earson 0d#cation.
2eferences :
1. Stallings@ ACryptography And &etwor' Security) (rinciples and practiceG
2. Ha#fman, .erlman, Speciner, F&etwor' SecurityG
6. 0ric Maiwald, F&etwor' Security ) A "eginner1s 2uideG, TM2
). Macro .istoia, F$ava &etwor' Security F, .earson 0d#cation
*. 9hitman, Mattord, F(rinciples of information security, Thomson
",,ignment,: -. a,,ignment, co/ering the ,ylla01, ha, to 0e ,10mitte2
M Sc Information Technology Year II, Paper II, Term I
SUBJECT: "rtificial Intelligence
!ectures: * %rs per wee$ T)eory: +,, Mar$s
+ AI and Internal 2epresentation
rtificial Intelligence and the 9orld, 'epresentation in I, .roperties of Internal
'epresentation, The .redicate 5alc#l#s, .redicates and rg#ments, 5onnecti(es =ariables
and ?#antification, 2ow to Cse the .redicate 5alc#l#s, @ther Hinds of Inference Inde%ing,
.ointers and lternati(e 7otations, Inde%ing, The Isa 2ierarchy, Slot;ssertion 7otation,
Frame 7otation
? !isps
Aisps, Typing at Aisp, 8efining .rograms, +asic Flow of 5ontrol in Aisp, Aisp Style, toms
and Aists, +asic 8eb#gging, +#ilding Cp Aist Str#ct#re, More on .redicates, .roperties,
.ointers, 5ell 7otation and the Internals !lmost& of Aisp, 8estr#cti(e Modification of Aists,
The for F#nction ,'ec#rsion, Scope of =ariables, Inp#t-@#tp#t, Macros
C. 3eural 3etwor$s and FuGGy systems
7e#ral and f#,,y machine Intelligence, F#,,iness as M#lti(alence, The 8ynamical Systems
approach to Machine Intelligence, The brain as a dynamical system, 7e#ral and f#,,y
systems as f#nction 0stimators, 7e#ral 7etwor"s as trainable 8ynamical system, F#,,y
.age 1) of 2<
systems and applications, Intelligent +eha(ior as dapti(e Model free 0stimation,
Benerali,ation and creati(ity, Aearning as change, Symbol (s 7#mbers, '#les (s .rinciples,
0%pert system Hnowledge as r#le trees, Symbolic (s 7#meric .rocessing, F#,,y systems as
Str#ct#red 7#merical estimators, Benerating F#,,y r#les with prod#ct space 5l#stering,
F#,,y Systems as .arallel associators, F#,,y systems as .rinciple based Systems
+. 3eural 3etwor$ T)eory
7e#ronal 8ynamics: cti(ations and signals@ 7e#rons as f#nctions, signal monotonicity,
+iological cti(ations and signals, 7e#ron Fields, 7e#ron 8ynamical Systems, 5ommon
signal f#nctions, .#lse;5oded Signal f#nctions
?. 0enetic Algorit)ms
simple genetic algorithm, sim#lation by hands, similarity templates!Schemata&,
Mathematical fo#ndations, Schema .rocessing at wor", The two; armed and ";armed +andit
.roblem, The b#ilding bloc" hypothesis, The minimal 8ecepti(e .roblem
5omp#ter implementation of Benetic algorithm, 8ata Str#ct#res, 'eprod#ction , 5ross o(er
and M#tation, Time to reprod#ce and time to 5ross Mapping ob/ecti(e f#nction to fitness
form, Fitness scaling
pplications of genetic algorithm, 8e >ong and F#nction @ptimi,ation, Impro(ement in basic
techni$#es, Introd#ction to Benetics based machine learning, applications of genetic based
machine leaning
C. 6ata Mining
Introd#ction to 8ata Mining, 5omp#ter systems that can learn, Machine learning and
methodology of science, 5oncept learning, 8ata ware ho#se, designing decision s#pport
systems, 5lient ser(er and data wareho#sing, Hnowledge 8isco(ery .rocess, =is#ali,ation
Techni$#es, H; nearest neighbor, 8ecision trees, @A. tools, 7e#ral networ"s, Benetic
algorithm, Setting #p a H88 en(ironment, 'eal life applications, 5#stomer profiling,
8isco(ering foreign "ey relationships
Assignments
10 assignments co(ering the syllab#s has to be s#bmitted
Te3t 0oo4
1. Introd#ction to rtificial Intelligence +y 0#gene 5harnia", 8rew Mc8ermott;
ddison 9esley
2. 7e#ral 7etwor"s and f#,,y systems dynamical systems approach to machine
Intelligence by +art Hos"o; .2I
6. Benetic lgorithms in search, @ptimi,ation N Machine Aearning by 8a(id 0
Boldberg;ddison wesley
). 8ata Mining by .ieter driaans and 8olf Iantinge 4 .earson 0d#cation sia
*. 8ata 9areho#sing in the 'eal 9orld by Sam nahory and 8ennis M#rray, ddison
;9esley
M Sc Information Technology Year II, Paper II, Term II
SUBJECT: OBOTICS
!ectures: * %rs per wee$ T)eory: +,, Mar$s
.becti'e: The goal of the co#rse is to familiari,e the st#dents with the concepts and
techni$#es in robot manip#lator control, eno#gh to e(al#ate, chose, and incorporate robots
in engineering systems.
Pre(re8uisite: 0%pos#re to linear algebra and matri% operations. 0%pos#re to
programming in a high le(el lang#age
$ET"I!E$ SY!!"BUS
+. 2obotic Manipulation: #tomation and 'obots, 5lassification, pplication,
.age 1* of 2<
Specification, 7otations.
?. 6irect Einematics: 8ot and cross prod#cts, 5o;ordinate frames, 'otations,
2omogeneo#s, 5o;ordinates, Ain" co;ordination arm e$#ation, !Fi(e;a%is robot, Fo#r
a%is robot, Si% a%is robot&.
C. In'erse Einematics: Beneral properties of sol#tions tool config#ration Fi(e a%is
robots, Three;Fo#r a%is, Si% a%is robot !In(erse "inematics&.
*. 9or"space analysis and tra/ectory planning wor" en(elop and e%amples, wor"space
fi%t#res, .ic" and place operations, 5ontin#o#s path motion, Interpolated motion,
Straight;line motion.
-. 2obot 4ision: Image representation, Template matching, .olyhedral ob/ects, Shane
analysis, Segmentation !Thresholding, region labeling, Shrin" operators, Swell
operators, 0#ler n#mbers, .erspecti(e transformation, Str#ct#red Ill#mination, 5amera
calibration&.
D. Tas$ Planning: Tas" le(el programming, Cncertainty, 5onfig#ration, Space, Bross
motion, .lanning, Brasp planning, Fine;motion .lanning, Sim#lation of .laner motion,
So#rce and goal scenes, Tas" planner sim#lation.
F. Moments of Inertia.
B. .rinciples of 75 and 575 Machines.
BOO)S
Te/t 7oo$s:
1. 'obert Shilling, F-undamentals of !o#otics3Analysis and control, .2I.
2. F#, Bon,ales and Aee, !o#otics, McBraw 2ill
6. >.>, 5raig, ,ntroduction to !o#otics, .earson 0d#cation
2eferences:
1. Sta#ghard, !o#otics and A,, .2I.
2. Bro(er, 9iess, 7agel, @derey, FInd#strial 'oboticsG, McBraw 2ill
6. 9alfram Stdder, !o#otics and Mecatronics, TM2.
). 7i"#, F,ntroduction to !o#oticsG, .earson 0d#cation
*. Hlafter, 5hmielews"i, 7egin, F!o#ot EngineeringG, .2I
:. Mittal, 7agrath, F!o#otics and ControlG, TM2
Assignments: 10 assignments o!e"ing t#e s$%%a&'s #as to &e s'&mitte(
M S ) In*o"mation Te#no%og$ Yea" II+ E%eti!e I+ Te"m I
SUBJECT: P""!!E! POCESSI#%
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term #or$ " Practical: -, Mar$s
.becti'e: Cpon completion of this co#rse st#dents will be able to #nderstand and employ
the f#ndamental concepts and mechanisms which form the basis of the design of parallel
comp#tation models and algorithms, recogni,e problems and limitations to parallel
systems, as well as possible sol#tions
Pre(re8uisite: 5omp#ter architect#re, 8ata str#ct#res
$ET"I!E$ SY!!"BUS
1. Introduction: .arallel .rocessing rchitect#res: .arallelism in se$#ential machines,
bstract model of parallel comp#ter, M#ltiprocessor architect#re, .ipelining, rray
processors.
2. Programmability Issues: n o(er(iew, @perating system s#pport, Types of operating
systems, .arallel programming models, Software tools
6. 6ata 6ependency Analysis: Types of dependencies loop and array dependences, Aoop
.age 1: of 2<
dependence analysis, Sol(ing diophantine e$#ations, .rogram transformations
). S)ared Memory Programming: Beneral model of shared memory programming,
.rocess model #nder C7IM
*. Algorit)ms for Parallel Mac)ines: Speed#p, 5omple%ity and cost, 2istogram
comp#tation, .arallel red#ction, ?#adrat#re problem, Matri% m#ltiplication, .arallel
sorting algorithms, Sol(ing linear systems, .robabilistic algorithms
:. Message Passing Programming: Introd#ction, Model, Interface, 5irc#it satisfiability,
Introd#cing collecti(e, +enchmar"ing parallel performance
D. Parallel Programming languages: Fortran<0, n5C+0 5, @ccam, 5;Ainda
E. 6ebugging Parallel Programs: 8eb#gging techni$#es, 8eb#gging message passing
parallel programs, 8eb#gging shared memory parallel programs
<. Memory and I". Subsystems: 2ierarchical memory str#ct#re, =irt#al memory
system, Memory allocation and management, 5ache allocation and management,
5ache memories and management, Inp#t o#tp#t s#bsystems
10. .t)er Parallelism Paradigms: 8ata flow comp#ting, Systolic architect#res,
F#nctional and logic paradigms, 8istrib#ted shared memory
11. Performance of Parallel Processors: Speed#p and efficiency, mdahlJs law,
B#stafson;+arsisJs law, Harf;Flatt metric, Isoefficiency metric
BOO)S
Te/t 7oo$s:
1. 2awang Hai and +riggs F. ., FComputer Architecture and (arallel (rocessing,
McBraw 2ill
2. >orden 2. F. and laghaband B., F-undamentals of (arallel (rocessingG
6. M.>. ?#inn, F(arallel (rogrammingG, TM2
2eferences:
1. Shasi"#mar M., F,ntroduction to (arallel (rocessing, .2I
2. 9ilson B.=., F(ractical (arallel (rogrammingG, .2I
6. 8. 0. 5#ller, >... Singh, . B#pta, (arallel Computer ArchitectureG, Morgan Ha#fman
TEM &O)
E. Term wor" sho#ld consist of at least 10 practical e%periments and two assignments
co(ering the topics of the syllab#s.
O"! E*"MI#"TIO#
n oral e%amination is to be cond#cted based on the abo(e syllab#s.
M Sc Information Technology Year II, Electi/e I, Term II
SUB,E-T: DISTRIBUTED -OM.UTIN/
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term wor$ " Practical: -, Mar$s
.becti'e: This co#rse aims to b#ild concepts regarding the f#ndamental principles of
distrib#ted systems. The design iss#es and distrib#ted operating system concepts are
co(ered.
Pre(re8uisites: @perating Systems and 5omp#ter 7etwor"s
DETAILED SYLLABUS
1. Introduction to 6istributed System: Boals, 2ardware concepts, Software concepts,
and 5lient;Ser(er model. 0%amples of distrib#ted systems.
2. 5ommunication: Aayered protocols, 'emote proced#res call, 'emote ob/ect
in(ocation, Message;oriented comm#nication, Stream;oriented comm#nication.
6. Processes: Threads, 5lients, Ser(ers, 5ode Migration, Software agent.
). 3aming: 7aming entities, Aocating mobile entities, 'emo(ing #n;referenced entities.
.age 1D of 2<
*. Sync)roniGation: 5loc" synchroni,ation, Aogical cloc"s, Blobal state, 0lection
algorithms, M#t#al e%cl#sion, 8istrib#ted transactions.
:. 5onsistency and 2eplication: Introd#ction, 8ata centric consistency models, 5lient
centric consistency models, 8istrib#tion protocols, 5onsistency protocols.
D. Fault Tolerance: Introd#ction, .rocess resilience, 'eliable client ser(er
comm#nication, 'eliable gro#p comm#nication. 8istrib#ted commit, 'eco(ery.
E. Security: Introd#ction, Sec#re channels, ccess control, Sec#rity management.
<. 6istributed File System: S#n networ" file system, 5@8 files system.
10. 5ase Study: 5@'+, 8istrib#ted 5@M, Blobe, 5omparison of 5@'+, 85@M, and
Blobe.
BOO)S
Te/t 7oo$s:
+. . Ta#nenba#m, ADistri#uted Systems) (rinciples and (aradigmsH
?. B. 5o#lo#ris, >. 8ollimore, and T. Hindberg, FDistri#uted Systems) Concepts and
DesignG, .earson 0d#cation
2eferences:
1. M. Singhal, 7. Shi(aratri, FAdvanced Concepts in perating SystemsG, TM2
TEM &O)
<. Term wor" sho#ld consist of at least 10 practical e%periments and two assignments
co(ering the topics of the syllab#s.
O"! E*"MI#"TIO#
n oral e%amination is to be cond#cted based on the abo(e syllab#s.
M Sc Information Tec)nology Year II@ &lecti'e I@ Term I
SUBJECT: I#TE!!I%E#T SYSTEMS
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term #or$" Practical: -, Mar$s
.becti'es: To #nderstand and apply principles, methodologies and techni$#es in design
and implementation of intelligent system.
Prere8uisite: 8ata Str#ct#res, .rogramming Aang#ages, and lgorithms
$ET"I!E$ SY!!"BUS
1. Artificial Intelligence: n o(er(iew, Intelligent Systems: 0(ol#tion of the concept.
2. Intelligent Agents: 2ow agent sho#ld act, Str#ct#re of intelligent agents,
0n(ironments
6. Problem Sol'ing: Sol(ing problems by searching, Informed search methods, Bame
playing
). Enowledge and 2easoning: "nowledge based agent, The w#mp#s world
en(ironment, 'epresentation, 'easoning, Aogic, .roportional logic, First order logic:
Synta% and Semantics, 0%tensions and 7otational (ariation, Csing first order logic
*. 7uilding a Enowledge 7ase: .roperties of good and bad "nowledge base, Hnowledge
engineering, Beneral ontology
:. Interfacing First .rder !ogic: Interface r#les in(ol(ing $#antifiers, n e%ample
proof, Forward and bac"ward chaining, 5ompleteness
D. Acting !ogically: .lanning, .ractical planning: .ractical planners, 2ierarchical
decomposition, 5onditional planning
E. =ncertain Enowledge and 2easoning: Cncertainty, 'epresenting "nowledge in an
#ncertain domain, The semantics of belief networ"s, Inference in belief networ"s
<. !earning: Aearning from obser(ations: Beneral model of learning agents, Ind#cti(e
.age 1E of 2<
learning, learning decision trees, Aearning in ne#ral and belief networ"s: Introd#ction
to ne#ral networ"s, .erceptrons, M#ltilayer feed;forward networ", pplication of
77, 'einforcement learning: .assi(e learning in a "nown en(ironment,
Benerali,ation in reinforcement learning, Benetic algorithms
10. Agents t)at 5ommunicate: 5omm#nication as action, Types of comm#nicating
agents, formal grammar for a s#bset of 0nglish
11. &/pert system: Introd#ction to e%pert system, 'epresenting and #sing domain
"nowledge, 0%pert system shells, 0%planation, Hnowledge ac$#isition
12. Applications: 7at#ral lang#age processing, .erception, 'obotics
BOO)S
Te/t 7oo$s:
1. Str#art '#ssell and .eter 7or(ig, FArtificial ,ntelligence) A Modern ApproachG
2. Beorge F.A#ger, Artificial ,ntelligence) Structures and Strategies for Comple+
(ro#lem Solving, .earson 0d#cation
2eferences:
1. 7ils >. 7illson, Artificial ,ntelligence) A &ew Synthesis, 2arco#rt sia
2. 0laine 'ich and He(in Hnight, FArtificial ,ntelligence, TM2
6. .atric" 9inston, FArtificial ,ntelligence, .earson 0d#cation
). I(an +ra"to, F(rolog (rogramming for Artificial ,ntelligenceG, .earson 0d#cation
*. 0fraim T#rban >ay 0.ronson, FDecision Support Systems and ,ntelligent SystemsG
:. 0d. M. Sasi"#mar and @thers, Artificial ,ntelligence ) Theory and (ractice
.roceedings of the International 5onference H+5S;2002, =i"as .#blishing 2o#se
TEM &O)
10. Term wor" sho#ld consist of at least 10 practical e%periments and two assignments
co(ering the topics of the syllab#s.
O"! E*"MI#"TIO#
n oral e%amination is to be cond#cted based on the abo(e syllab#s.
M Sc Information Technology Year II, Electi/e I, Term II
SUBJECT: #EU"! #ET&O)S 5 +U66Y SYSTEMS
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term #or$"Practical: -, Mar$s
.becti'e: This co#rse co(ers basic concepts of artificial ne#ral networ"s, f#,,y logic
systems and their applications. Its foc#s will be on the introd#ction of basic theory,
algorithm form#lation and ways to apply these techni$#es to sol(e real world problems.
Pre(re8uisite: Hnowledge of calc#l#s, and basic probability and statistics are re$#ired.
+ac"gro#nd in the following s#b/ects desirable: n#merical analysis !incl#ding
optimi,ation&. .rogramming s"ills in one of the following wo#ld be desirable: Matlab,
Math5ad, 5, >a(a, 5KK
$ET"I!E$ SY!!"BUS
1. Introduction: +iological ne#rons, Mc5#lloch and .itts models of ne#ron, Types of
acti(ation f#nction, 7etwor" architect#res, Hnowledge representation. Aearning
process: 0rror;correction learning, S#per(ised learning, Cns#per(ised learning,
Aearning '#les.
2. Single !ayer Perceptron: .erceptron con(ergence theorem, Method of steepest
descent ; least mean s$#are algorithms.
6. Multilayer Perceptron: 8eri(ation of the bac";propagation algorithm, Aearning
Factors.
.age 1< of 2<
). 2adial 7asis and 2ecurrent 3eural 3etwor$s: '+F networ" str#ct#re, theorem and
the reparability of patterns, '+F learning strategies, H;means and AMS algorithms,
comparison of '+F and MA. networ"s, 2opfield networ"s: energy f#nction, sp#rio#s
states, error performance .
*. Simulated Annealing: The +olt,mann machine, +olt,mann learning r#le,
+idirectional ssociati(e Memory.
:. FuGGy logic: F#,,y sets, .roperties, @perations on f#,,y sets, F#,,y relations,
@perations on f#,,y relations, The e%tension principle, F#,,y meas#res, Membership
f#nctions, F#,,ification and def#,,ification methods, F#,,y controllers.
BOO)S
Te/t 7oo$s:
1. Simon 2ay"in, F&eural &etwor' a 3 Comprehensive -oundation, .earson 0d#cation
2. I#rada >.M., F,ntroduction to Artificial &eural Systems, >aico p#blishers
6. Thimothy >. 'oss, -u44y /ogic with Engineering Applications, McBraw 2ill
). hmad Ibrahim, F,ntroduction to Applied -u44y ElectronicsG, .2I
2eferences:
1. 3egnanarayana +., FArtificial &eural &etwor's, .2I
2. 8rian"o( 8., 2ellendoorn 2. N 'einfran" M., FAn ,ntroduction to -u44y ControlG,
7orosa .#blishing 2o#se
6. +er"an '.5., and Tr#batch S.A., F-u44y Systems Design (rinciplesG, I000 .ress
TEM &O)
11. Term wor" sho#ld consist of at least 10 practical e%periments and two assignments
co(ering the topics of the syllab#s.
O"! E*"MI#"TIO#
n oral e%amination is to be cond#cted based on the abo(e syllab#s.
M Sc Information Technology Year II, Electi/e I, Term I
SUBJECT: $I%IT"! SI%#"! POCESSI#%
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term #or$"Practical: ?- Mar$s
.becti'e: 8igital Signal .rocessing contin#es to play an increasingly important role in
the fields that range literally from !astronomy& to I !,e#gmatography, or magnetic
resonance imaging& and encompass applications s#ch as 5ompact 8isc player, Speech
'ecognition, echo cancellations in comm#nication systems, image 0nhancement,
geophysical e%ploration, and nonin(asi(e medical imaging. This co#rse aims to b#ild
concepts regarding the f#ndamental principles and applications of Signals, System
Transforms and Filters.
Pre(re8uisites: 7il
DETAILED SYLLABUS
1. 6iscrete Time Signals I System: 8iscrete4time signals, 8iscrete4time systems,
nalysis of discrete;time ATI systems, 8iscrete;time systems described by differential
e$#ations, Implementation of discrete;time systems, 5orrelation of discrete;time
systems
2. J(Transform: 8efinition and .roperties of I;transform, 'ational I;transforms,
In(erse I;transform, one;sided I;transform, nalysis of ATI systems in I;domain
6. Fre8uency Analysis of Signals and Systems: Fre$#ency analysis: 5ontin#o#s time
signals and 8iscrete;time signals, .roperties of the Fo#rier transform for discrete;time
signals, Fre$#ency domain characteristics of ATI systems, ATI system as a fre$#ency
selecti(e filter, In(erse systems and decon(ol#tion
.age 20 of 2<
). 6iscrete Fourier Transform: Fre$#ency domain sampling, .roperties of 8FT, Ainear
filtering method based on 8FT, Fre$#ency analysis of signals #sing 8FT, FFT
algorithm, pplications of FFT, Boert,el algorithm, ?#antisation effects in the
comp#tation of 8FT
*. Implementation of 6iscrete Time Systems: Str#ct#re of FI' systems, Str#ct#re of
II' systems, $#anti,ation of filter coefficients, ro#nd;off effects in digital filters
:. 6esign of 6igital Filters: 8esign of FI' filters, 8esign of II' filters from analog
filters, fre$#ency transformations, 8esign of digital filters based on least;s$#ares
method digital filters from analog#e filters, .roperties of FI' digital filters, 8esign of
FI' filters #sing windows, 5omparison of II' and FI' filters, and Ainear phase filters.
D. Introduction to 6SP co(processors: TMS 6205)0-*0, nalog 8e(ices.
E. Applications : Image processing, 5ontrol, Speech, #dio, Telecomm#nication
BOO)S
Te/t 7oo$s:
1. >.B. .roa"is, F,ntroduction to Digital Signal (rocessingG, .2I
2. @ppenhiem and Schaffer, FDiscrete Time Signal (rocessingG
2eferences:
1. S.H. Mitra, FDigital Signal (rocessingG, TM2.
2. T.>. 5a(icchi, FDigital Signal (rocessingG, >ohn 9iley.
6. A.5. A#deman,G -undamentals f Digital Signal (rocessingG, >ohn 9iley.
). 0.5. Ifeachor, +.9. >er(is, FDigital Signal (rocessingG, .earson 0d#cation.
*. S Salli(ahanan, Digital Signal (rocessingG, TM2.
:. sho" mbardar, FAnalog and Digital Signal (rocessingG, Thompson Aearning.
TEM &O)
12. Term wor" sho#ld consist of at least 10 practical e%periments and two assignments
co(ering the topics of the syllab#s.
O"! E*"MI#"TIO#
n oral e%amination is to be cond#cted based on the abo(e syllab#s.
M Sc Information Technology Year II, Electi/e I, Term I
SUBJECT: Enterpri,e #et7or4ing
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term #or$"Practical: ?- Mar$s
Introduction
Browth of 5omp#ter 7etwor"ing, 5omple%ity in 7etwor" Systems, Mastering the
5omple%ity, 'eso#rce Sharing, Browth of the Internet, .robing the Internet, Interpreting
.ing 'esponse
PA2T I 6ATA T2A3SMISSI.3
Transmission Media
5opper 9ires, Blass Fibers, 'adio, Satellites, Beosynchrono#s Satellites, Aow 0arth @rbit
Satellites, Aow 0arth @rbit Satellite rrays, Microwa(e, Infrared, Aight Form a Aaser
!ocal Async)ronous 5ommunication
The 7eed for synchrono#s 5omm#nication, Csing 0lectric 5#rrent to Send +its, Standards
for 5omm#nication, +a#d 'ate, Framing, and 0rrors, F#ll 8#ple% synchrono#s
5omm#nication, Aimitations of 'eal 2ardware, 2ardware +andwidth and the Transmission
of +its, The 0ffect of 7oise @n 5omm#nication, Significance for 8ata 7etwor"ing
!ong(6istance 5ommunication 95arriers@ Modulation and Modems:
.age 21 of 2<
Sending Signals across Aong 8istances, Modem 2ardware Csed for Mod#lation and
8emod#lation, Aeased nalog 8ata 5irc#its, @ptical, 'adio Fre$#ency, nd 8ial#p
Modems, 5arrier Fre$#encies and M#ltiple%ing, +ase band nd +roadband Technologies
9a(e 8i(ision M#ltiple%ing, Spread Spectr#m, Time 8i(ision M#ltiple%ing
PA2T II PA5E&T T2A3SMISSI.3
Pac$ets@ Frames and &rror 6etection
The 5oncept of .ac"ets, .ac"ets and Time;8i(ision M#ltiple%ing, .ac"ets and 2ardware
Frames, +yte St#ffing, Transmission 0rrors, .arity +its and .arity 5hec"ing, .robability,
Mathematics nd 0rror 8etection, 8etecting 0rrors 9ith 5hec"s#ms, 8etecting 0rrors 9ith
5yclic 'ed#ndancy 5hec"s, 5ombining +#ilding +loc"s, +#rst 0rrors, Frame format nd
0rror 8etection Mechanisms
!A3 Tec)nologies and 3etwor$ Topology
8irect .oint;To;.oint 5omm#nication, Shared 5omm#nication 5hannels, Significance of
A7s and Aocality of 'eference, A7 Topologies, +#s 7etwor": 0thernet 5arrier Sense on
M#lti;ccess 7etwor"s !5SM&, 5ollision 8etection and +ac" off 9ith 5SM-58,
9ireless A7s nd 5SM-5, +#s 7etwor": Aocal Tal"
%ardware Addressing and Frame Type Identification
Specifying a 'ecipient, 2ow A7 2ardware Cses ddresses to Filter .ac"ets Format of a
.hysical ddress, +roadcasting, M#lticasting, M#lticast ddressing, Identifying .ac"et
5ontents, Frame 2eaders nd Frame Format, Csing 7etwor"s That 8o 7ot 2a(e Self;
Identifying Frames, 7etwor" naly,ers
!A3 #iring@ P)ysical Topology@ and Interface %ardware
Speeds of A7s and 5omp#ters, 7etwor" Interface 2ardware, the 5onnection between
7I5 and 7etwor", @riginal Thic" 0thernet 9iring, 5onnection M#ltiple%ing, Thin
0thernet 9iring
Twisted .air 0thernet, the Topology .arado%, 7etwor" Interface 5ards and 9iring Schemes,
&/tending !A3s: Fiber Modems@ 2epeaters@ 7ridges and Switc)es
8istance Aimitation and A7 8esign, Fiber @ptic 0%tensions, 'epeaters, +ridges, Frame
Filtering
Start#p and Steady State +eha(ior of +ridged 7etwor"s, .lanning a +ridged 7etwor",
+ridging +etween +#ildings, +ridging cross Aonger 8istances, 5ycle @f +ridges,
8istrib#ted Spanning Tree, Switching, 5ombining Switches nd 2#bs, +ridging nd
Switching 9ith @ther Technologies
!ong(6istance 6igital 5onnection Tec)nologies
8igital Telephony, Synchrono#s 5omm#nication, 8igital 5irc#its and 8SC, Telephone
Standards
8S Terminology and 8ata 'ates, Aower 5apacity 5irc#its, Intermediate 5apacity 8igital
5irc#its
2ighest 5apacity 5irc#its, @ptical 5arrier Standards, the 5 S#ffi%, Synchrono#s @ptical
7etwor" !S@70T&, the Aocal S#bscriber Aoop, IS87, symmetric 8igital S#bscriber Aine
Technology
@ther 8SA Technologies, 5able Modem Technology, Cpstream 5omm#nication, 2ybrid
Fiber 5oa%
#an Tec)nologies and 2outing
Aarge 7etwor"s and 9ide reas, .ac"et Switches, Forming 97, Store and Forward
.hysical ddressing In 97, 7e%t;2op Forwarding, So#rce Independence, 'elationship
of 2ierarchical ddresses to 'o#ting, 'o#ting In 97, Cse of 8efa#lts 'o#tes, 'o#ting
Table 5omp#tation, Shortest .ath 5omp#tation in a Braph, 8istrib#ted 'o#te 5omp#tation,
8istance =ector 'o#ting
.age 22 of 2<
3etwor$ .wners)ip@ Ser'ice Paradigm@ and Performance
7etwor" @wnership, =irt#al .ri(ate 7etwor"s, Ser(ice .aradigm, 5onnection 8#ration and
.ersistence, 0%amples of Ser(ice .aradigms, ddresses and 5onnection Identifiers, 7etwor"
.erformance 5haracteristics
Protocols and !ayering
The 7eed for .rotocols, .rotocol S#ites, .lan for .rotocol 8esign, the Se(en Aayers,
Stac"s: Aayered Software, 2ow Aayered Software 9or"s, M#ltiple, 7ested 2eaders, the
Scientific +asis for Aayering,
T&2M #.2E
Term wor" sho#ld consist of at least 10 assignments from the aforementioned topics.
Seminar to be presented by each st#dent as part of term wor"s carrying 1* mar"s.
2&F&2&35&
5omp#ter 7etwor", T#e"e#n, .2I
7etwor"ing Technology, >aiswal, Balgotia.
8ata 7etwor"ing, +ertse"as, .2I
5omp#ter 7etwor"s and Internets, 8o#glas 0. 5omer .earson 0d#cation sia
M Sc Information Technology Year II, Electi/e II, Term I
SUBJECT: P"TTE# ECO%#ITIO#
!ectures: * %rs per wee$
Practical: ? %rs per wee$
T)eory: +,, Mar$s
Term #or$: ?- Mar$s
.ral: ?- Mar$s
.becti'e: This co#rse teaches the f#ndamentals of techni$#es for classifying m#lti;
dimensional data, to be #tili,ed for problem;sol(ing in a wide (ariety of applications, s#ch
as engineering system design, man#fact#ring, technical and medical diagnostics, image
processing, economics, psychology.
Pre(re8uisite: Ainear lgebra, .robability and Statistics
$ET"I!E$ SY!!"BUS
1. Introduction: Machine perception, .attern recognition systems, 8esign cycle,
Aearning and daptation
2. 7ayesian 6ecision T)eory: +ayesian decision theory: 5ontin#o#s feat#res, Minim#m;
error rate classification, classification, 5lassifiers, 8iscriminant f#nctions and 8ecision
s#rfaces, 7ormal density, 8iscriminant f#nctions for normal density, +ayes 8ecision
theory: discrete feat#res
6. Ma/imum(!i$eli)ood and 7ayesian Parameter &stimation: Ma%im#m li"elihood
estimation, +ayesian estimation, +ayesian parameter estimation: Ba#ssian caseand
Beneral theory, .rolems of dimentionality, 2idden Mar"o( Model
). 3onparametric Tec)ni8ues: 8ensity estimation, .ar,en windows, '
n
;7earest;
7eighbor estimation, 7earest;7eighbor r#le, Matrics and 7earest;7eighbor
classification
*. !inear 6iscriminants Functions: Ainear discriminant f#nctions and decision s#rfaces,
Beneralised linear discriminant f#nctions, 2;5ategory linearly separable case,
Minimising the .erceptron criterion f#nction, 'ela%ation proced#re, 7on;separable
beha(ior, Minim#m s$#ared error proced#re, 2o;Hashyap proced#res, M#lticategory
generali,ations
:. 3onmetric Met)ods: 8ecision tree, 5'T, I86, 5).*, Bramatical methods,
Bramatical interfaces
D. Algorit)m Independent Mac)ine !earning: Aac" of inherent s#periority of any
classifier, +ias and =ariance, 'esampling for estimating statistic, 'esampling for
classifier design, 0stimating and comparing classifiers, 5ombining classifiers
.age 26 of 2<
E. =nsuper'ised !earning and 5lustering: Mi%t#re densities and Identifiability,
Ma%im#m;Ai"elihood estimations, pplication to normal mi%t#res, Cns#per(ised
+ayesian learning, 8ata description and cl#stering criterion f#nction for cl#stering,
2ierarchical cl#stering
;. Applications of Pattern 2ecognition
BOO)S
Te/t 7oo$s:
1. 8#da, 2art, and Stoc", F(attern ClassificationG, >ohn 9iley and Sons.
2. Bose, >ohnsonba#gh and >ost, F.attern 'ecognition and Image analysisG, .2I
TEM &O)
16. Term wor" sho#ld consist of at least 10 practical e%periments and two assignments
co(ering the topics of the syllab#s.
O"! E*"MI#"TIO#
n oral e%amination is to be cond#cted based on the abo(e syllab#s.
M Sc Information Technology Year II, Electi/e II, Term II
SUBJECT: COMPUTE (ISIO#
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term #or$"Practical: -, Mar$s
.becti'e: To introd#ce the st#dent to comp#ter (ision algorithms, methods and concepts
which will enable the st#dent to implement comp#ter (ision systems with emphasis on
applications and problem sol(ing
Pre(re8uisite: Introd#ction to Image .rocessing.
$ET"I!E$ SY!!"BUS
;. 2ecognition Met)odology: 5onditioning, Aabeling, Bro#ping, 0%tracting, Matching.
0dge detection, Bradient based operators, Morphological operators, Spatial operators
for edge detection. Thinning, 'egion growing, region shrin"ing, Aabeling of connected
components.
+,. 7inary Mac)ine 4ision: Thresholding, Segmentation, 5onnected component labeling,
2ierarchal segmentation, Spatial cl#stering, Split N merge, '#le;based Segmentation,
Motion;based segmentation.
++. Area &/traction: 5oncepts, 8ata;str#ct#res, 0dge, Aine;Ain"ing, 2o#gh transform,
Aine fitting, 5#r(e fitting !Aeast;s$#are fitting&.
+?. 2egion Analysis: 'egion properties, 0%ternal points, Spatial moments, Mi%ed spatial
gray;le(el moments, +o#ndary analysis: Signat#re properties, Shape n#mbers.
+C. Facet Model 2ecognition: Aabeling lines, Cnderstanding line drawings,
5lassification of shapes by labeling of edges, 'ecognition of shapes, 5onsisting
labeling problem, +ac";trac"ing, .erspecti(e .ro/ecti(e geometry, In(erse perspecti(e
.ro/ection, .hotogrammetry 4 from 28 to 68, Image matching : Intensity matching of
I8 signals, Matching of 28 image, 2ierarchical image matching.
+*. .bect Models And Matc)ing: 28 representation, Blobal (s. Aocal feat#res.
+-. 0eneral Frame #or$s For Matc)ing: 8istance relational approach, @rdered;
str#ct#ral matching, =iew class matching, Models database organi,ation.
+D. 0eneral Frame #or$s: 8istance 4relational approach, @rdered 4Str#ct#ral matching,
=iew class matching, Models database organi,ation.
+F. Enowledge 7ased 4ision: Hnowledge representation, 5ontrol;strategies, Information
integration.
.age 2) of 2<
BOO)S
Te/t 7oo$s:
56 8a(id . Forsyth, >ean .once, Computer .ision) A Modern Approach
76 '. >ain, '. Hast#ri, and +. B. Sch#n", Machine .ision, McBraw;2ill.
2eferences:
1. Milan Son"a,=acla( 2la(ac, 'oger +oyle, F,mage (rocessing, Analysis, and
Machine .isionG Thomson Aearning
2. 'obert 2aralic" and Ainda Shapiro, Computer and !o#ot .ision, =ol I, II, ddison;
9esley, 1<<6.
TEM &O)
1). Term wor" sho#ld consist of at least 10 practical e%periments and two assignments
co(ering the topics of the syllab#s.
O"! E*"MI#"TIO#
n oral e%amination is to be cond#cted based on the abo(e syllab#s.
M Sc Information Technology Year II, Electi/e II, Term I
SUBJECT: SYSTEM SECUITY
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term wor$"Practical: -, Mar$s
.becti'es of t)e course: Aearn abo#t the threats in comp#ter sec#rity. Cnderstand what
p#ts yo# at a ris" and how to control it. 5ontrolling a ris" is not eliminating the ris" b#t to
bring it to a tolerable le(el.
Pre(re8uisites: 5omp#ter 7etwor"s, @perating system.
$ET"I!E$ SY!!"BUS
E. Introduction: Sec#rity, ttac"s, 5omp#ter criminals, Method of defense
<. 5ryptograp)y: +asic 5ryptography: 5lassical 5ryptosystems, .#blic "ey
5ryptography, 5ryptographic chec"s#m, Hey Management: Hey e%change, Hey
generation, 5ryptographic "ey infrastr#ct#re, Storing and re(o"ing "eys, 2ash
algorithm, 8igital signat#re, 5ipher Techni$#es: .roblems, Stream and bloc" ciphers:
0S, 80S, '5).
10. Program Security: Sec#re programs, 7on;malicio#s program errors, =ir#ses and
other malicio#s code, Targeted malicio#s code, 5ontrols against program threats
11. .perating System Security: .rotected ob/ects and methods of protection, Memory
address protection, 5ontrol of access to general ob/ects, File protection mechanism,
#thentication: #thentication basics, .assword, 5hallenge;response, +iometrics.
12. 6atabase Security: Sec#rity re$#irements, 'eliability and integrity, Sensiti(e data,
Interface, M#ltile(el database, .roposals for m#ltile(el sec#rity
16. Security in 3etwor$s: Threats in networ"s, 7etwor" sec#rity control, Firewalls,
Intr#sion detection systems, Sec#re e;mail, 7etwor"s and cryptography, 0%ample
protocols: .0M, SSA, I.sec
1). Administrating Security: Sec#rity planning, 'is" analysis, @rgani,ational sec#rity
policies, .hysical sec#rity.
1*. !egal@ Pri'acy@ and &t)ical Issues in 5omputer Security: Protecting programs and
data, Information and law, 'ights of employees and employers, Software fail#res,
5omp#ter crime, .ri(acy, 0thical iss#es in comp#ter society, 5ase st#dies of ethics
7oo$s
Te/t 7oo$s:
6. Stallings@ ACryptography And &etwor' Security) (rinciples and practiceG
). 5. .. .fleeger, and S. A. .fleeger, FSecurity in ComputingG, .earson 0d#cation.
*. Matt +ishop, FComputer Security) Art and ScienceG, .earson 0d#cation.
.age 2* of 2<
2eferences :
:. Ha#fman, .erlman, Speciner, F&etwor' SecurityG
D. 0ric Maiwald, F&etwor' Security ) A "eginner1s 2uideG, TM2
E. +r#ce Schneier, FApplied CryptographyG, >ohn 9iley.
<. Macro .istoia, F$ava networ' security F, .earson 0d#cation
10. 9hitman, Mattord, F(rinciples of information security, Thomson
TEM &O)
1*. Term wor" sho#ld consist of at least 10 practical e%periments and two assignments
co(ering the topics of the syllab#s.
O"! E*"MI#"TIO#
n oral e%amination is to be cond#cted based on the abo(e syllab#s.
M Sc Information Technology Year II, Electi/e II, Term II
S108ect: (irt1al eality an2 (irt1al En/ironment
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term wor$"Practical: -, Mar$s
'eal time comp#ter graphics, Flight sim#lation, (irt#al en(ironment, +enefits of (irt#al
reality, 0(ol#tion of =irt#al 'eality, 2istorical perspecti(e, scientific land mar"s
C6 5omputer grap)ics
The (irt#al world space, positioning the (irt#al obser(er, the perspecti(e pro/ection, 2#man
(ision, Stereo perspecti(e pro/ection, 68 clipping, colo#r theory, simple 68 modelling,
ill#mination models, shading algorithms, radiosity, hiddens#rface remo(al, realism,
stereographic images
0eometric modelling
From 28 to 68, 68 space c#r(es, 68 bo#ndary representation,
0eometrical Transformations
Frames of reference, Modelling transformations, instances, pic"ing flying, Scaling the =0,
5ollision detection
A generic 42 Systems
The (irt#al 0n(ironment, The comp#ter en(ironment, =' Technology, Modes of Interaction,
=' systems
Animating t)e 4irtual &n'ironment
8ynamics of n#mbers, the animation of ob/ects, shape and ob/ect inbetweening, free;form
deformation, particle systems
P)ysical Simulation
@b/ects falling in a gra(itational field, rotating wheels, 0lastic collisions, .ro/ectiles, simple
pend#l#ms, springs, flight dynamics of an aircraft
%uman factors
The eye, The ear, the somatic senses, 0$#ilibri#m
4irtual 2eality %ardware
Sensor hardware, 2ead;co#pled displays, co#stic hardware, Integrated =' Systems
4irtual 2eality Software
Modelling =irt#al worlds, .hysical sim#lation, =' tool "its
4irtual 2eality Applications
0ngineering, 0ntertainment, science, 0d#cation, training
F#t#re
=irt#al 0n(ironment, Modes of Interaction
Te/t 7oo$s
.age 2: of 2<
=irt#al 'eality Systems >ohn =ince; .earson 0d#cation sia
M Sc Information Technology Year II, Electi/e III, Term I
S'&0et: M'%time(ia s$stems an( on!e"gene o* te#no%ogies
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term wor$"Practical: -, Mar$s
Multimedia systems and con'ergence of tec)nologies
8efining the scope of m#ltimedia, 2yperte%t and 5ollaborati(e research, M#ltimedia and
personalised comp#ting, M#ltimedia on the map, 0merging applications, The challenges
T)e con'ergence of computers@ 5ommunications@ and entertainment products
The technology trends, M#ltimedia appliances, 2ybrid 8e(ices, 8esigners perspecti(e,
ind#stry perspecti(e of the f#t#re, Hey challenges ahead, Technical, reg#latory, Social
Arc)itectures and issues for 6istributed Multimedia systems
8istrib#ted M#ltimedia systems, Synchroni,ation, and ?@S rchitect#re, The role of
Standards, frame wor" for M#ltimedia systems
6igital Audio 2epresentation and processing
Cses of #dio in 5omp#ter pplications, .sychoaco#stics, 8igital representation of so#nd,
transmission of digital so#nd, 8igital #dio signal processing, 8igital m#sic ma"ing, Speech
recognition and generation, digital a#dio and the comp#ters
=ideo Technology
'aster Scanning .rinciples, Sensors for T= 5ameras, 5olo#r F#ndamentals, 5olo#r =ideo,
=ideo performance Meas#rements, nalog (ideo rtifacts, (ideo e$#ipments, 9orld wide
tele(ision standards
6igital 4ideo and Image 5ompression
=ideo compression techni$#es, standardi,ation of lgorithm, The >.0B Image 5ompression
Standard, ITC;T 'ecommendations, The 0.0B Motion =ideo 5ompression Standard, 8=I
Technology
.perating System Support for 5ontinuous Media Applications
Aimitation of 9or" station @perating system, 7ew @S s#pport, 0%periments Csing 'eal
Time Mach
Middleware System Ser'ices Arc)itecture
Boals of M#ltimedia System ser(ices, M#ltimedia system ser(ices rchitect#re, Media
stream protocol
Multimedia 6e'ices@ Presentation Ser'ices@ and t)e =ser Interface
5lient control of contin#o#s m#ltimedia, 8e(ice control, Temporal coordination and
composition, tool"its, hyperapplications
Multimedia File systems and Information Models
The case for m#ltimedia information systems, The file system s#pport for contin#o#s Media,
8ata models for m#ltimedia and 2ypermedia information, 5ontent; based 'etrie(al of
Cnstr#ct#red 8ata
Multimedia presentation and Aut)oring
8esign paradigms and Cser interface, barriers to wide spread #se, research trends
Multimedia Ser'ices o'er t)e Public 3etwor$s
'e$#irements, rchitect#re, and protocols, 7et wor" ser(ices, applications
Multimedia Interc)ange
?#ic" time Mo(ie File Format, ?MFI, M20B !M#ltimedia and 2ypermedia Information
0ncoding 0%pert Bro#p&, Format F#nction and representation, Trac" model and @b/ect
model, 'eal Time Interchange
Multimedia conferencing
.age 2D of 2<
Teleconferencing Systems, 'e$#irements of M#ltimedia 5omm#nications, Shared
pplication rchitect#re and embedded 8istrib#ted ob/ects, M#ltimedia 5onferencing
rchitect#re
Multimedia 0roupware
5omp#ter and =ideo f#sion approach to open shared wo" place, 2igh 8efinition Tele(ision
and des"top comp#ting, 28T= standards, Hnowledge based M#ltimedia systems, natomy
of an Intelligent M#ltimedia system
Te/t 7oo$
M#ltimedia Systems by >ohn F. Hoegel +#ford; .earson 0d#cation
M S ) In*o"mation Te#no%og$ Yea" II+ E%eti!e II+ Te"m I
SUB,E-T: ,a!a Te#no%og$
!ectures: * %rs per wee$
Practical: * %rs per wee$
T)eory: +,, Mar$s
Term wor$"Practical: -, Mar$s
Ja/a Programming
@b/ect oriented programming re(isited, >8H, >a(a =irt#al machine;.latform independent;
portability;scalability @perators and e%pressions;decision ma"ing, branching, looping,
5lasses, @b/ects and methods, rrays Strings and =ectors, Interfaces, .ac"ages, M#lti;
Threading, managing errors and e%ceptions, pplet programming, Managing files and
streams
<a'a Tec)nology for Acti'e #eb 6ocuments
n 0arly Form of 5ontin#o#s Cpdate, cti(e 8oc#ments and Ser(er @(erhead, cti(e
8oc#ment 'epresentation and Translation, >a(a Technology, the >a(a '#n;Time
0n(ironment, The >a(a Aibrary
Braphics Tool"it, Csing >a(a Braphics on a .artic#lar 5omp#ter, >a(a Interpreters and
+rowsers
5ompiling a >a(a .rogram, In(o"ing an pplet, 0%ample of Interaction with a +rowser
2P5 and Middleware
.rogramming 5lients and Ser(ers, 'emote .roced#re 5all .aradigm, '.5 .aradigm,
5omm#nication St#bs, 0%ternal 8ata 'epresentation, Middleware and @b/ect;@riented
Middleware
3etwor$ Management 9S3MP:
Managing an Internet, The 8anger of 2idden Feat#res, 7etwor" Management Software,
5lients, Ser(ers, Managers and gents, Simple 7etwor" Management .rotocol, Fetch;Store
.aradigm, The MI. and @b/ect 7ames, The =ariety of MI+ =ariables, MI+ (ariables that
correspond to arrays
<a'a tec)nologies
Braphics, >F5;>= fo#ndation classes, swing, images, /a(a 2d graphics,
internationali,ation, 5omm#nication and 7etwor"ing, T5. Soc"ets, C8. Soc"ets, 8a/a9net,
/a(a sec#rity, @b/ect seriali,ation, 'emote method seriali,ation, >8+5: >a(a 8ata +ase
5onnecti(ity, >a(a beans, >a(a interface to 5@'+, >=; 5@M Integration, >a(a Media
Framewor", commerce and /a(a wallet, 8ata str#ct#res and /a(a #tilities, >a(aScript,
Ser(elets
T&2M #.2E
Term wor" sho#ld consist of at least 0: assignments incl#ding deb#gged /a(a so#rce code for
the applications from the aforementioned topics. Seminar to be presented by each st#dent
as part of term wor" carrying 1* mar"s.
2&F&2&35&
Csing >= 2, >oseph A weber, .2I
>= 2 complete, Sybe%, +.+
.age 2E of 2<
>a(a2 The complete 'eference, .atric" 7a#ghton, T M 2
5omp#ting concepts 9ith >=2, 5ay 2orstmann, 9IA03
>S. >a(a Ser(er .ages, +arry +#rd, I8B +oo"s India!p& Atd
>a(a2 .rogramming +ible, aron 9alsh, I8B +oo"s India!p& Atd
>a(a2, swing, ser(lets, >8+5 N >= +eans .rogramming +lac" +oo" Ste(en 2ol,ner
dreamtech press
.age 2< of 2<