Sie sind auf Seite 1von 35

Department of Computer Science & Engineering

Revised Syllabi (Detailed) for BTech in Computer Science and Engineering


(!"! #dmission on$ards)
%#!!"& %#T'E%#T(CS (((
Pre-requisite: MA1001 Mathematics I
L T P C
3 1 0 3
Total Hours: 56 Hrs


%odule "& )robability distributions ("* 'ours)
Ranom !aria"les# $inomial istri"ution# H%&er- 'eometric istri"ution# Mean an !ariance o( a &ro"a"ilit%
istri"ution# Che"%she!)s theorem# Poisson istri"ution# *eometric istri"ution# +ormal ,istri"ution# -ni(orm
istri"ution# *amma istri"ution# $eta istri"ution# .ei"ull istri"ution/ 0oint istri"ution o( t1o ranom !aria"les

%odule & Sampling distributions and (nference concerning means ("+ 'ours)
Po&ulation an sam&les# The sam&lin' istri"ution o( the mean 2 3 4no1n an 3 un4no1n 5# 6am&lin' istri"ution o(
the !ariance# Ma7imum Li4elihoo 8stimation# Point estimation an inter!al estimation# &oint estimation an inter!al
estimation o( mean an !ariance# Tests o( h%&othesis# H%&othesis concernin' one mean# In(erence concernin' t1o
means/

%odule ,: (nference concerning variances proportions (",'ours)
8stimation o( !ariances # H%&othesis concernin' one !ariance# H%&othesis concernin' t1o !ariances # 8stimation o(
&ro&ortions # H%&othesis concernin' one &ro&ortion # H%&othesis concernin' se!eral &ro&ortions# Anal%sis o( r 7 c
ta"les# Chi 9 square test (or 'ooness o( (it/

%odule +& Regression #nalysis ("+ 'ours)
$i-!ariate +ormal istri"ution- :oint# mar'inal an conitional istri"utions/ Cur!e (ittin'# Metho o( least squares#
8stimation o( sim&le re'ression moels an h%&othesis concernin' re'ression coe((icients# Correlation coe((icient-
estimation o( correlation coe((icient# h%&othesis concernin' correlation coe((icient/ 8stimation o( cur!ilinear re'ression
moels#
Anal%sis o( !ariance:- *eneral &rinci&les# Com&letel% ranomi;e esi'ns# Ranomi;e "loc4 ia'ram# Latin square
esi'ns# Anal%sis o( co!ariance/

References &
1/ 0ohnson# R/ A/# Miller an <reun)s Pro"a"ilit% an 6tatistics (or 8n'ineers# 6
th
eition/# PHI# =00>/
=/ Le!in R/ I/ ? Ru"in ,/ 6/# 6tatistics (or Mana'ement# @
th
eition# PHI# +e1 ,elhi# =000/
3/ 6/M/ Ross# Introuction to Pro"a"ilit% an statistics (or 8n'ineers# 3
r
eition# Acaemic Press28lse!ier5#
,elhi# =005/
CS!!" -./(C DES(/0
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
+um"er s%stems an coes# $oolean al'e"ra: &ostulates an theorems# constants# !aria"les an (unctions# s1itchin'
al'e"ra# $oolean (unctions an lo'ical o&erations# Aarnau'h ma&: &rime cu"es# minimum sum o( &roucts an &rouct
o( sums
%odule ("! (T) 1 2()) 'ours)
Buine-McClus4% al'orithm# &rime im&licant chart# c%clic &rime im&licant chart# Petric4)s metho# Com"inational
Lo'ic: introuction# anal%sis an esi'n o( com"inational lo'ic circuits# &arallel aers an loo4-ahea aers#
com&arators# ecoers an encoers# coe con!ersion# multi&le7ers an emulti&le7ers# &arit% 'enerators an
chec4ers
%odule , ("! (T) 1 2()) 'ours)
Pro'ramma"le Lo'ic ,e!ices# RCMs# PALs# PLAs# PLA (olin'# esi'n (or testa"ilit%/ Introuction to sequential
circuits# memor% elements# latches
%odule + (" (T) 1 2()) 'ours)
<li&-(lo&s# anal%sis o( sequential circuits# state ta"les# state ia'rams# esi'n o( sequential circuits# e7citation ta"les#
Meal% an Moore moels# re'isters# shi(t re'isters# counters
References&
1/ T/ L/ <lo%# R/ P/ 0ain# ,i'ital <unamentals# DEe# Pearson 8ucation# =006
=/ C/ H/ Roth# 0r/# L/ L/ Ainne%# <unamentals o( Lo'ic ,esi'n# 6Ee# Cen'a'e Learnin'# =00F
3/ M M Mano# M , Ciletti# ,i'ital ,esi'n# >Ee# Pearson 8ucation# =00D
>/ +/ +/ $is1as# Lo'ic ,esi'n Theor%# Prentice Hall o( Inia# +e1 ,elhi# 1FF3
CS!! 3.40D#T(.0S .3 )R./R#%%(0/
Pre-requisite: +il
L T P C
> 0 0 >
Total Hours: 56 Hrs
%odule " ("+ 'ours)
Proceural A"straction: 87&ressions - +amin' an 8n!ironment - Com"inators - 8!aluation - Proceures - 6u"stitution
moel - Conitional e7&ression an &reicates/ Linear Recursion an Iteration - Tree recursion/ A"stractions 1ith
Hi'her Crer Proceures - Proceures as ar'uments - Constructin' &roceures 9 e7am&les/
%odule ("+ 'ours)
,ata A"straction: Hierarchical ,ata an Closure &ro&ert% - 6%m"olic ,ata - ,ata ,irecte Pro'rammin' - *eneric
C&erators - Com"inin' ata o( i((erent t%&es
%odule , ("+ 'ours)
Moularit%# C":ects# an 6tate: Local state - assi'nment# en!ironment moel (or e!aluation - (rames# Moelin' 1ith
muta"le ata/ Concurrenc% - mechanisms (or concurrenc%/ The stream &arai'm - moularit%/
%odule + ("+ 'ours)
Metalin'uistic A"straction: ,ata as Pro'rams - 6e&aratin' s%ntactic anal%sis (rom e7ecution/ La;% e!aluation - ,esi'n
o( inter&reter 1ith la;% e!aluation/
References&
1. H A"elson# * 0 6ussman an 0 sussman, Structure and Interpretation of Computer Programs (2/e), Universities
Press, 2005.
2. Companion Site to the Textbook. Available at http://mitpress.mit.edu/sicp/ Accessed on December 1, 2010.
EC!"+ S(/0#-S #0D S5STE%S
Pre-requisite: +il
L T P C
3 0 0 3
Total Hours: >= Hrs
%odule " ("" hours)
8lements o( si'nal theor%: ,i((erent t%&es o( si'nals# "asic o&erations on si'nalsG im&ulse (unctions an other
sin'ularit% (unctions - 6%stems : Time-omain re&resentation an anal%sis o( LTI an L6I s%stems 9 Con!olution -
Con!olution sum# con!olution inte'ral an their e!aluation - Causalit% an sta"ilit% consierations/
%odule (" hours)
6i'nal anal%sis: 6i'nals an !ectors 9 inner &rouct o( si'nals 9 norm- notion o( len'th o( si'nal an istance "et1een
si'nals9 ortho'onal si'nal s&ace 9 <ourier series re&resentation - <ourier Trans(orm an inte'ral 9 <ourier Trans(orm
theorems 9 &o1er s&ectral ensit% an ener'% s&ectral ensit% 9 Hil"ert Trans(orm 9 In-&hase an quarature
re&resentation o( "an&ass si'nals - <requenc% omain anal%sis o( LTI s%stems: <requenc% res&onse <unction 9 si'nal
transmission throu'h a linear s%stem 9 ieal (ilters 9 "an 1ith an rise time
%odule , ( 6 hours)
6am&lin': sam&lin' theorem 9 sam&lin' 1ith Hero Crer Hol an reconstruction 9 inter&olation
<requenc% anal%sis o( iscrete time si'nals an s%stems 9 ,iscrete time <ourier series an ,iscrete time <ourier
Trans(orm 9 <requenc% res&onse (unction 9 ,iscrete <ourier Trans(orm/
%odule + ("" hours)
La&lace trans(orm: Re'ion o( con!er'ence 9 Anal%sis o( continuous time s%stems 9 Trans(er (unction 9 <requenc%
res&onse (rom &ole 9 ;ero &lot
H-trans(orm: Re'ion o( con!er'ence 9 Pro&erties o( RCC an H trans(orm - Anal%sis o( L6I s%stems - Trans(er
(unction- <requenc% res&onse (rom &ole 9 ;ero &lot
References&
1/ $/ P/ Lathi# Linear 6%stems an 6i'nals# C7(or -ni!ersit% Press# =00=/
=/ C&&enheim A/I/# .ills4% A/6/ ? +a1a" 6/H/# 6i'nals an 6%stems# 6econ eition # Tata Mc*ra1 Hill
3/ Ha%4in 6/ ? Ieen $/I/# 6i'nals ? 6%stems#1FFF# 0ohn .ile%
>/ Ta%lor </H/# Princi&les o( 6i'nals ? 6%stems#1FF># Mc*ra1 Hill
CS!7" -./(C DES(/0 -#B.R#T.R5
Pre-requisite: +il
L T P C
1 0 3 3
Total Hours: 56 Hrs
Theory ("+ 'ours)
Lo'ic 'ates# aer an su"tractor circuits# &arit% 'enerators# coe con!erters# com&arators# multi&le7ers#
emulti&le7ers# (li&-(lo&s# shi(t re'isters# counters
)ractical (+ 'ours)
,esi'n an im&lementation o( lo'ic 'ates# aer an su"tractor circuits# &arit% 'enerators# coe con!erters#
com&arators# multi&le7ers# emulti&le7ers# (li&-(lo&s# shi(t re'isters# counters
References&
1/ C H Roth an 0r/# L L Ainne%# <unamentals o( Lo'ic ,esi'n# 6Ee# Cen'a'e Learnin'# =00F
=/ M M Mano an M , Ciletti# ,i'ital ,esi'n# >Ee# Pearson 8ucation# =00D
3/ + + $is1as# Lo'ic ,esi'n Theor%# Prentice Hall o( Inia# +e1 ,elhi# 1FF3
>/ T L <lo% an R P 0ain# ,i'ital <unamentals# DEe# Pearson 8ucation# =006
CS!7 )R./R#%%(0/ -#B.R#T.R5
Pre-requisite: +il
L T P C
1 0 3 3
Total Hours: 56 Hrs
Theory (14 Hours)
Introduction to the language of choice (recommended: Scheme). Overview of concepts and constructs.
Study of synchronization aspects. Interpreter specification.
Practical (42 Hours)
Programming Assignments
1. Simple programs in the language of choice - (recommended Scheme) - evaluating expressions.
2. Programming example with procedures - Operations.
3. Introduction to syntax, semantics and symbolic manipulation in the language.
4. Combining data and procedural abstractions Objects.
5. Synchronization and Concurrency examples.
6. Design of a simple language interpreter.
References&
1. H A"elson# * 0 6ussman an 0 sussman, Structure and Interpretation of Computer Programs (2/e),
Universities Press, 2005.
2. 6am&le Pro'rammin' Assi'nments (rom Re(erence 1/ Available at
http://mitpress.mit.edu/sicp/psets/index.html Accessed on December 1, 2010.
%#!! %#T'E%#T(CS (8
Pre-requisite: MA 1001 Mathematics I# MA 100= Mathematics II
L T P C
3 1 0 3
Total Hours: 56 Hrs
%odule "& Series Solutions and Special 3unctions ("* 'ours)
Po1er series solutions o( i((erential equations# Theor% o( &o1er series metho# Le'enre 8quation# Le'enre
Pol%nomials# <ro"enius Metho# $essel)s 8quation# $essel (unctions# $essel (unctions o( the secon 4in# 6turm-
Liou!ille)s Pro"lems# Crtho'onal ei'en(unction e7&ansions/
%odule & )artial differential E9uations (": 'ours)
$asic Conce&ts# Cauch%)s &ro"lem (or (irst orer equations# Linear 8quations o( the (irst orer# +onlinear Partial
,i((erential 8quations o( the (irst orer# Char&it)s Metho# 6&ecial T%&es o( (irst orer equations# Classi(ication o(
secon orer &artial i((erential equations# Moelin': Ii"ratin' 6trin'# .a!e equation# 6e&aration o( !aria"les# -se o(
<ourier 6eries# ,)Alem"ert)s 6olution o( the 1a!e equation# Heat equation: 6olution "% <ourier series# Heat equation:
solution "% <ourier Inte'rals an trans(orms# La&lace equation# 6olution o( a Partial ,i((erential 8quations "% La&lace
trans(orms/
%odule ,& Comple; 0umbers and 3unctions (", 'ours)
Com&le7 (unctions# ,eri!ati!e # Anal%tic (unction# Cauch%- Reimann equations# La&lace)s equation# *eometr% o(
Anal%tic (unctions: Con(ormal ma&&in'# Linear (ractional Trans(ormations# 6ch1ar; - Christo((el trans(ormation#
Trans(ormation "% other (unctions/
%odule +& Comple; (ntegration (" 'ours)
Line inte'ral in the Com&le7 &lane# Cauch%)s Inte'ral Theorem# Cauch%)s Inte'ral (ormula# ,eri!ati!es o( anal%tic
(unctions/Po1er series# <unctions 'i!en "% &o1er series# Ta%lor series an Maclaurin)s series/ Laurent)s series#
6in'ularities an Heros# Resiue inte'ration metho# 8!aluation o( real Inte'rals/
References&
1/ Are%s;i' 8# A!ance 8n'ineerin' Mathematics# D
th
8ition# 0ohn .ile% ? 6ons# +e1 Jor4# 1FFF /
=/ I/+/ 6neon# 8lements o( Partial ,i((erential 8quations# ,o!er Pu"lications# =006/
3 / .%lie C/ R/ ? $arret L/ C/# A!ance 8n'ineerin' Mathematics# 6
th
8ition# Mc *ra1 Hill# +e1 Jor4#1FF5/
>/ ,onal ./ Trim# A&&lie Partial ,i((erential 8quations# P.6 9 A8+T &u"lishin' com&an%# 1FF>/
CS!!+ C.%)4TER .R/#0(<#T(.0
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
Com&uter a"straction an technolo'%: "asic &rinci&les# har1are com&onents# Measurin' &er(ormance: e!aluatin'#
com&arin' an summari;in' &er(ormance/
Instructions: o&erations an o&erans o( the com&uter har1are# re&resentin' instructions# ma4in' ecision# su&&ortin'
&roceures# character mani&ulation# st%les o( aressin'# startin' a &ro'ram/

%odule ("! (T) 1 2()) 'ours)
Com&uter arithmetic: si'ne an unsi'ne num"ers# aition an su"traction# lo'ical o&erations# constructin' an AL-#
multi&lication an i!ision# (loatin' &oint re&resentation an arithmetic# Parallelism an com&uter arithmetic/

%odule , ("! (T) 1 2()) 'ours)
The &rocessor: "uilin' a ata &ath# sim&le an multic%cle im&lementations# micro&ro'rammin'# e7ce&tions#
Pi&elinin'# &i&eline ata &ath an Control # ha;ars in &i&eline &rocessors
%odule + (" (T) 1 2()) 'ours)
Memor% hierarch%: caches# cache &er(ormance# !irtual memor%# common (rame1or4 (or memor% hierarchies
In&utEout&ut: IEC &er(ormance measures# t%&es an characteristics o( IEC e!ices# "uses# inter(aces in IEC e!ices#
esi'n o( an IEC s%stem# &arallelism an IEC/
References&
1. ,/ A/ Pattersen an 0/ L/ Hennes%# Com&uter Cr'anisation an ,esi'n: The Har1areE 6o(t1are Inter(ace# >Ee#
Mor'an Aau(man# =00F/
2. I/ P/ Heurin' an H/ </ 0oran# Com&uter 6%stem ,esi'n an Architecture# Prentice Hall# =003/
CS!!* D#T# ST4RCT4RES #0D #-/.R(T'%S
Pre-requisite: +il
L T P C
> 0 0 >
Total Hours: 56 Hrs
%odule " ("+ 'ours)
Time an s&ace com&le7it% anal%sis o( al'orithms - As%m&totic anal%sis - $i' Ch - Cme'a - theta notations - 6earchin'
an 6ortin' - $inar% search - Buic4 sort - Hea& sort - &riorit% queue usin' hea& - com&le7it% anal%sis o( search an
sortin' al'orithms - a!era'e case anal%sis o( quic4 sort/
%odule ("+ 'ours)
Lin4e lists - 6tac4 an Bueue - $inar% tree - in-orer# &re-orer an &ost-orer tra!ersals - com&le7it% anal%sis -
re&resentation an e!aluation o( arithmetic e7&ressions usin' "inar% tree - $inar% 6earch trees - insertion# eletion an
search - a!era'e case com&le7it% anal%sis/
%odule , ("+ 'ours)
<ile structure - Mer'e sort - $ Tree - com&le7it% anal%sis - ,ata structures (or is:oint sets - union "% ran4 an &ath
com&ression - com&le7it% anal%sis - Hash ta"les/
%odule + ("+ 'ours)
*ra&h re&resentation- ,<6# $<6# minimum s&annin' tree &ro"lem - Arus4alKs al'orithm - im&lementation usin'
is:oint set ata structure - com&le7it% anal%sis 9 Prim)s al'orithm - 6hortest &ath &ro"lem - ,i:4straKs al'orithms -
im&lementation o( PrimKs an ,i:4straKs al'orithms usin' &riorit% queue ata structure - com&le7it% anal%sis/ <lo%-
.arshall al'orithm/
References&
1. T/ H/ Cormen# C/ 8/ Lieserson# R/ L/ Ri!est# C/ 6tein# Introuction to Al'orithms 23Ee5# MIT Press# =003
2. 6/ ,as'u&ta# C/ H/ Pa&aimitriou# -/ Ia;irani# Al'orithms# Mc*ra1 Hill# =006
3. A/ I/ Aho# 0/ ,/ -llman an 0/ 8/ Ho&cro(t# ,ata 6tructures an Al'orithms# Aison .esle%# 1FD3/
CS!!: D(SCRETE STR4CT4RES
Pre-requisite: +il
L T P C
> 0 0 >
Total Hours:56 Hrs
%odule " ("+ 'ours)
Com"inatorics: As%m&totic anal%sis o( recurrence - solution to linear recurrence relations - MasterKs theorem#
Recurrence relations 1ith (ull histor%/
%odule ("+ 'ours)
Pro"a"ilit%: ,iscrete &ro"a"ilit% s&aces# ranom !aria"les - $ernoulli# "inomial an 'eometric ranom !aria"les -
conitional &ro"a"ilit% - $a%es theorem - linearit% o( e7&ectations - Mar4o! an Che"%she! inequalities - 1ea4 la1 o(
lar'e num"ers
%odule , ("+ 'ours)
Al'e"ra: *rou&s# La'ran'eKs theorem# Homomor&hism theorem# Rin's an <iels# 6tructure o( the rin' Hn an the unit
'rou& HnL/
%odule + ("+ 'ours)
Lo'ic an 6et Theor%: Resolution in &ro&ositional lo'ic - introuction to (irst orer lo'ic - set theor% - counta"le an
uncounta"le sets - ia'onali;ation/
References&
1/ R/ P/ *rimali# ,iscrete an Com"inatorial Mathematics: An A&&lie Introuction# Aison .esle%# 1FFD/
=/ L/ Lo!as;# 0/ Peli4an an A/ Ies;ier'om"i# ,iscrete Mathematics# 6&rin'er# =003/
3/ I/ M/ Co&i# 6%m"olic lo'ic# Prentice Hall# 1F@F
CS!7, '#RD=#RE -#B.R#T.R5
Pre-requisite: +il
L T P C
1 0 3 3
Total Hours: 56 Hrs
Theory ("+ 'ours) 1 )ractical (+ 'ours)
6!>6: #ssembly language programming&
Inte'er o&erations# recursi!e su"routines# t1o imensional arra%s 232T5 M1=2P5 Hours5
6trin' mani&ulation# (loatin' &oint o&erations 2=2T5 M 62P5 Hours5
,C6 an $IC6 interru&ts/ 2=2T5 M 62P5 Hours5
8m"ee s%stem e7&eriments 2RTLinu75/ 232T5 M F2P5 Hours5
Cache simulator 9 Per(ormance e!aluation o( !arious cache or'ani;ations o&timi;ations 2=2T5 M62P5 Hours5
<amiliari;ation o( PC har1are an trou"le shootin' 2=2T5 M32P5 Hours5
References&
1/ Peter A"el I$M PC Assem"l% Lan'ua'e an Pro'rammin' 25Ee5# Prentice Hall# =001/
2. $arr% $ $re%# Intel Micro&rocessors: Architecture an Pro'rammin'# Prentice Hall# =00D/
CS!7+ D#T# STR4CT4RES -#B.R#T.R5
Pre-requisite: +il
L T P C
1 0 3 3
Total Hours: 56 Hrs
Theory ("+ 'ours)
Re!ie1 o( %namic memor% allocation - use o( &ointers - re!ie1 o( recursion/ <ile or'ani;ation/
)ractical (+ 'ours)
1/ 6earchin': $inar% search im&lementation
=/ 6ortin': Hea& sort# Buic4 sort an Mer'e sort im&lementation
3/ 6tac4 an Bueue im&lementation usin' lin4e list
>/ Arithmetic e7&ression to &ost(i7
5/ Post(i7 to e7&ression tree# tree tra!ersal an e!aluation
6/ $inar% search tree - insert# elete an search
@/ Linear time ,<6 an $<6 im&lementation 1ith a:acenc% list re&resentation
D/ Arus4alKs al'orithm im&lementation in C22nMe5lo' n5 com&le7it%/
F/ PrimKs al'orithm im&lementation in C22nMe5 lo' n5 com&le7it%/
10 ,i:s4straKs al'orithm im&lementation in C22nMe5 lo' n5 com&le7it%/
References&
1/ T/ H/ Cormen# C/ 8/ Lieserson an R/ L/ Ri!est# Introuction to Al'orithms# PHI# 1FFD
=/ 6/ 6ahni# ,ata structures# Al'orithms# an A&&lications in CMM# Mc*ra1 Hill# 1FFD
CS,!!" T'E.R5 .3 C.%)4T#T(.0
Pre-requisite: +il
L T P C
> 0 0 >
Total Hours: 56 Hrs
%odule " ("+ 'ours)
$asic conce&ts o( Lan'ua'es# Automata an *rammar/ Re'ular Lan'ua'es - Re'ular e7&ression - (inite automata
equi!alence# M%hill +eroe theorem an ,<A 6tate Minimi;ation# Pum&in' Lemma an &roo( (or e7istence o( non-
re'ular lan'ua'es/
%odule ("+ 'ours)
Conte7t <ree lan'ua'es# C<L-P,A equi!alence# Pum&in' Lemma an &roo( (or e7istence o( non- Conte7t <ree
lan'ua'es# CJA Al'orithm# ,eterministic C<Ls/
%odule , ("+ 'ours)
Turin' Machines: recursi!e an recursi!el% enumera"le lan'ua'es# -ni!ersalit% o( Turin' Machine# Church Thesis/
Choms4% Hierarch%# -necia"ilit%# Reuci"ilit% -necia"ilit%: Recursi!e an Recursi!el% enumera"le sets# Rice
Theorems/# Recursion Theorem# Turin' Reuci"ilit%# Hierarch% theorems#
%odule + ("+ 'ours)
Com&le7it%: P# +P# +P Com&leteness# P6PAC8 an Lo' s&ace/ Lo'ic: Pro&ositional lo'ic# com&actness# ,ecia"ilit%#
Resolution
References&
1. M/ 6i&ser# Introduction to the Theory of Computation# Thomson# =001/
2. C/ H/ Pa&aimitriou/# Com&utational Complexity# Aison .esle%# 1FF>/
3. 0erome Aeisler H/ 0oel Ro""in# Mathematical Lo'ic an Com&uta"ilit%# Mc*ra1-Hill International 8itions#
=000/
4. C/ H/ Pa&aimitriou# H/ Le1is# 8lements o( Theor% o( Com&utation# Prentice Hall# 1FD1/
5. 0/ 8/ Ho&cro(t R/ Mot1ani an 0/ ,/ -llman# Introuction to Automata Theor%# Lan'ua'es an Com&utation#
Aison .esle%# 3Ee# =006/
6. 0/ C/ Martin# Introuction to Lan'ua'es an the Theor% o( Com&utation# Mc *ra1 Hill# =00=/
7. M/ R/ *are% an ,/ 6/ 0ohnson/ Com&uters ? Intracta"ilit%# ./ H/ <reeman ? Co/# 6an <rancisco# 1F@F/
D/ 6/ M/ 6ri!asta!a# A Course on Mathematical Lo'ic# 6&rin'er# =00D/
CS,!! D#T#B#SE %#0#/E%E0T S5STE%S
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
,ata"ase 6%stem conce&ts an architecture# ,ata moelin' usin' 8ntit% Relationshi& 28R5 moel an 8nhance 8R
moel# 6&eciali;ation# *enerali;ation# ,ata 6tora'e an ine7in'# 6in'le le!el an multi le!el ine7in'# ,%namic
Multi le!el ine7in' usin' $ Trees an $M Trees/
%odule ("! (T) 1 2()) 'ours)
The Relational Moel# Relational ata"ase esi'n usin' 8R to relational ma&&in'# Relational al'e"ra an relational
calculus# Tu&le Relational Calculus# ,omain Relational Calculus# 6BL/
%odule , ("! (T) 1 2()) 'ours)
,ata"ase esi'n theor% an methoolo'%# <unctional e&enencies an normali;ation o( relations# +ormal <orms#
Pro&erties o( relational ecom&osition# Al'orithms (or relational ata"ase schema esi'n/
%odule + (" (T) 1 2()) 'ours)
Transaction &rocessin' conce&ts# 6cheules an seriali;a"ilit%# Concurrenc% control# T1o Phase Loc4in' Techniques#
C&timistic Concurrenc% Control# ,ata"ase reco!er% conce&ts an techniques# Introuction to ata"ase securit%/
References&
1/ Rame; 8lmasri an 6ham4ant $/ +a!athe# <unamentals o( ,ata"ase 6%stems 25Ee5# Pearson 8ucation# =00D/
=/ Ra'hu Rama4rishnan an 0ohannes *ehr4e# ,ata"ase Mana'ement 6%stems 23Ee5# Mc*ra1 Hill# =003/
3/ Peter Ro" an Carlos Coronel# ,ata"ase 6%stesm- ,esi'n# Im&lementation an Mana'ement 2@Ee5# Cen'a'e
Learnin'# =00@/
CS,!!, .)ER#T(0/ S5STE%S
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
Re!ie1 o( o&eratin' s%stem strate'ies - resources - &rocesses - threas - o":ects - o&eratin' s%stem or'ani;ation - esi'n
(actors - (unctions an im&lementation consierations - e!ices - characteristics - controllers - ri!ers - e!ice
mana'ement - a&&roaches - "u((erin' - e!ice ri!ers - t%&ical scenarios such as serial communications - stora'e
e!ices etc

%odule ("! (T) 1 2()) 'ours)
Process mana'ement - s%stem !ie1 - &rocess aress s&ace - &rocess an resource a"straction - &rocess hierarch% -
scheulin' mechanisms - !arious strate'ies - s%nchroni;ation - interactin' ? coorinatin' &rocesses - sema&hores -
ealoc4 - &re!ention - a!oiance - etection an reco!er%

%odule , ("! (T) 1 2()) 'ours)
Memor% mana'ement - issues - memor% allocation - %namic relocation - !arious mana'ement strate'ies - !irtual
memor% - &a'in' - issues an al'orithms - se'mentation - t%&ical im&lementations o( &a'in' ? se'mentation s%stems

%odule + (" (T) 1 2()) 'ours)
<ile mana'ement - (iles - im&lementations - stora'e a"stractions - memor% ma&&e (iles - irectories an their
im&lementation - &rotection an securit% - &olic% an mechanism - authentication - authori;ation - case stu% o( -ni7
4ernel an Microso(t .ino1s +T 2conce&ts onl%5

Iirtual machines 9 !irtual machine monitors 9 issues in &rocessor# memor% an IEC !irtuali;ation# har1are su&&ort
(or !irtuali;ation/
References&
1/ 6il"erschat;# *al!in an *a'ne# C&eratin' 6%stem Princi&les# @Ee# =006# 0ohn .ile%
=/ .illiam 6tallin's# C&eratin' 6%stems# 5Ee# Pearson 8ucation
3/ Cro1le% C/# C&eratin' 6%stems- A ,esi'n Criente A&&roach# Tata Mc*ra1 Hill# +e1 ,elhi
>/ Tanen"aum A/ 6/# Moern C&eratin' 6%stems# 3Ee Prentice Hall# Pearson 8ucation
5/ *ar% 0/ +utt# C&eratin' 6%stems - A Moern Pers&ecti!e#3Ee Aison .esle%

CS,!!+ S.3T=#RE E0/(0EER(0/
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " (6 (T) 1 2()) 'ours)
Introuction to 6o(t1are 8n'ineerin' 9 Reasons (or so(t1are &ro:ect (ailure 9 6imilarities an i((erences "et1een
so(t1are an other en'ineerin' &roucts/
6o(t1are ,e!elo&ment Li(e C%cle 26,LC5 9 C!er!ie1 o( Phases/
,etaile 6tu% o( Requirements Phase: Im&ortance o( Clear 6&eci(ication 9 <ormal s&eci(ication methos incluin'
al'e"raic s&eci(ication in etail/
%odule ("* (T) 1 2()) 'ours)
Pro"lem &artitionin' 2su"i!ision5 - Po1er o( A"straction
Conce&t o( (unctional ecom&osition 9 &rocess moelin' - ,<,s
Conce&t o( ata moelin' 9 8R ia'rams
Class an com&onent le!el esi'ns 9 C":ect Criente ,esi'n - -ML an ,esi'n Patterns 2onl% introuction5
%odule , (6 (T) 1 2()) 'ours)
Coin' an Testin' :
6tructure &ro'rammin' 9 internal ocumentation an nee (or stanars 9 Methos o( !ersion control -
Maintaina"ilit%/
Introuction to secure &ro'rammin'/
T%&es o( testin' 9 6&eci(ication o( test cases 9 Coe re!ie1 &rocess
%odule + ("" (T) 1 2()) 'ours)
6o(t1are Pro:ect Mana'ement: Introuction to metrics/ 6o(t1are Process Moels/ Costin'# 6cheulin' an Trac4in'
techniques/ 6o(t1are con(i'uration mana'ement - !ersionin'/ Reusa"le com&onents/ Mathematical methos o( ris4
assessment an mana'ement/ Methos o( so(t1are licensin' an introuction to (ree so(t1are/
References&
1. Ro'er 6 Pressman# 6o(t1are 8n'ineerin': A Practitioner)s A&&roach 26Ee/5# Mc*ra1 Hill# =00D/
=/ T C Leth"ri'e an R La'aniere# C":ect Criente 6o(t1are 8n'ineerin' 21Ee5# Tata Mc*ra1 Hill# =00>/
3. Pan4a: 0alote# 6o(t1are 8n'ineerin': A Precise A&&roach 21Ee5# .ile% Inia# =010/
>/ A 6hallo1a% an 0 Trott# ,esi'n Patterns 87&laine: A ne1 &ers&ecti!e on o":ect oriente esi'n 2=Ee5#
Pearson# =00>/
CS,!!* C.%)(-ER DES(/0
Pre-requisite: C6=005 ,ata 6tructures an Al'orithms
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " (: (T) 1 2()) 'ours)
Introuction to Pro'rammin' lan'ua'e translation/ Le7ical anal%sis: 6&eci(ication an reco'nition o( to4ens/
%odule (" (T) 1 2()) 'ours)
6%nta7 anal%sis: To&-o1n &arsin'-Recursi!e escent an Preicti!e Parsers/ $ottom-u& Parsin'- LR 205# 6LR# an LR
215 Parsers/
%odule , (": (T) 1 2()) 'ours)
6emantic anal%sis: T%&e e7&ression# t%&e s%stems# s%m"ol ta"les an t%&e chec4in'/
Intermeiate coe 'eneration: Intermeiate lan'ua'es/ Intermeiate re&resentation-Three aress coe an quaru&les/
6%nta7-irecte translation o( eclarations# assi'nments statements# conitional constructs an loo&in' constructs/
%odule + (6 (T) 1 2()) 'ours)
Runtime 8n!ironments: 6tora'e or'ani;ation# acti!ation recors/ Introuction to machine coe 'eneration an coe
o&timi;ations/
References&

1. Aho A/I/# Lam M/ 6/# 6ethi R/# an -llman 0/ ,/# Com&ilers: Princi&les# Techniques an Tools# Pearson
8ucation# =00@/
2. A&&el A/.# an Pals"er' 0/ # Moern Com&iler Im&lementation in 0a!a# Cam"ri'e -ni!ersit% Press# =00=/
CS,!!: C.%)4TER 0ET=.R?S
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
Com&uter +et1or4s an Internet# the net1or4 e'e# the net1or4 core# net1or4 access# ela% an loss# &rotocol la%ers
an ser!ices# A&&lication la%er &rotocols# .e" =/0# 6oc4et Pro'rammin'#
%odule ("! (T) 1 2()) 'ours)
Trans&ort la%er ser!ices# -,P# TCP# +e1 trans&ort la%er Protocols# con'estion control# ne1 !ersions o( TCP# +et1or4
la%er ser!ices# routin'# IP# routin' in Internet# router# IPI6# multicast routin'/
%odule , ("! (T) 1 2()) 'ours)
Lin4 la%er ser!ices# error etection an correction# multi&le access &rotocols# ARP# 8thernet# hu"s# "ri'es# s1itches#
1ireless lin4s# mo"ilit%# PPP# ATM# MPL6# ILA+/
%odule + (" (T) 1 2()) 'ours)
Multimeia net1or4in'# streamin' store auio an !ieo# real-time &rotocols# securit%# Cr%&to'ra&h%# authentication#
inte'rit%# 4e% istri"ution# net1or4 mana'ement/
References&
1. 0/ </ Aurose an A/ ./ Ross# Com&uter +et1or4in': A To&-,o1n A&&roach <eaturin' Internet# 3Ee# Pearson
8ucation# =005/
2. Peterson L/L/ ? ,a!ie $/6/# Com&uter +et1or4s# A s%stems a&&roach# 3E8# Harcourt Asia# =003/
3. Anre1 6/ Tanen"aum# Com&uter +et1or4s# 3E8# PHI# 1FF6/
>/ Arian <arrel# The Internet an its Protocols a Com&arati!e A&&roach# 8lse!ier# =005
5. I888EACM Transactions on +et1or4in'
CS+!!" E08(R.0%E0T#- ST4D(ES
Pre-requisite: +il
L T P C
3 0 0 3
Total Hours: >= Hrs
%odule " ("! 'ours)
,e(inition# sco&e an im&ortance - rene1a"le an non-rene1a"le resources - +atural resources - (orest# 1ater# mineral#
(oo an ener'% an lan resources - stu% o( &ro"lems - Role o( ini!iual in conser!ation - equita"le use o( resources
an sustaina"le li(est%les/
%odule ("! 'ours)
8co s%stems - structure an (unction - &roucer# consumer an ecom&oser - ener'% (lo1 - ecolo'ical succession- (oo
chains- (orest# 'rasslan# esert an aquatic ecos%stems - $ioi!ersit% an conser!ation/
%odule , ("! 'ours)
8n!ironmental &ollution - air# 1ater# soil# marine# thermal# nuclear an noise &ollution- methos o( &re!ention - 1aste
mana'ement - isaster mana'ement - en!ironmental ethics - sustaina"le e!elo&ment moels - 1ater conser!ation -
climate chan'e an 'lo"al 1armin' - o;one la%er e&letion - nuclear holocaust - case stuies - consumerism an 1aste
&roucts/
%odule + (" 'ours)
Human &o&ulation an en!ironment - (amil% 1el(are - human health an en!ironment - human ri'hts/
References&
1/ 8/ $harucha# 8n!ironmental 6tuies# -ni!ersities Press# =005/
=/ -*C 6%lla"us on en!ironmental stuies a!aila"le at htt&:EE111/u'c/ac/inEinsieEs%lla"us/html accesse on 01-
1=-=010
%S+!!, EC.0.%(CS
Pre-requisite: Nil
L T P C
3 0 0 3
Total Hours: 42 Hrs
Module 1 (11 hours)

General Foundations of Economics; Nature of the firm; Forms of organizations-Objectives of firms-Demand analysis
and estimation-Individual, Market and Firm demand, Determinants of demand, Elasticity measures and business
decision making, Theory of the firm-Production functions in the short and long run
Module 2 (9 hours)

Cost concepts- Short run and long run costs- economies and diseconomies of scale, real and pecuniary economies;
Product Markets; Market Structure- Competitive market; Imperfect competition (Monopoly, Monopolistic & Oligopoly)
and barriers to entry and exit -Pricing in different
Module 3 (11 hours)

Macro Economic Aggregates-Gross Domestic Product; Economic Indicators; Models of measuring national income;
Inflation ; Fiscal and Monetary Policies ; Monetary system; Money Market, Capital market; Indian stock market;
Development Banks; Changing role of Reserve Bank of India
Module 4 (11 hours)
International trade - Foreign exchange market- Balance of Payments (BOP) and Trade-Effects of disequilibrium in
BOP in business- Trade regulation- Tariff versus quotas- International Trade and development and role of international
institutions (World Bank, IMF and WTO) in economic development.

References
1. Bo Soderston,International Economics,
2. Gupta, S.B Monetary Economics,. (1994). S. Chand Co., !e" #elhi.
3. Gregory.N.Mankiw,Principles of Micro Economics, Cengage Publications,2007
4. Gregory.N.Mankiw ,Principles of Macro Economics, Cengage Publications,2007
5. Indian Economy Its Development Experience, Misra, S.$. and %.$. &uri ('((1))imalaya
&u*lishin+ )ouse, Mum*ai,'((9.
6. Microeconomics, R.S. Pindyck, D.L Rubinfield and P.L. Mehta ,Pearson Education, 2005. Advanced Economic
Theory, Micro Economics H.L. Ahuja,Chand Publications,2004.
7. Economics, Samuelson, &.,.- ..#. !ordhaus , /ata McGra" )ill,10 Ed.,'((1.
8. Public Finance , B.P.Tyagi,Jai PrakashNath & Co.,1997.
%E+"!+ )R(0C()-ES .3 %#0#/E%E0T
)rere9uisite& 0il
Total 'ours& + hours
%odule " (7 'ours)
Introuction to mana'ement theor%# Characteristics o( mana'ement# Mana'ement as an art 9 &ro(ession# 6%stems
a&&roach to mana'ement# Tas4 an res&onsi"ilities o( a &ro(essional mana'er# Le!els o( mana'ers an s4ill require/
L T P C
3 0 0 3

Mana'ement &rocess 9 &lannin' 9 mission 9 o":ecti!es 9 'oals 9 strate'% 9 &olicies 9 &ro'rammes 9 &roceures/
%odule (7 'ours)
Cr'ani;in' 9 &rinci&les o( or'ani;in' 9 or'ani;ation structures# ,irectin' 9 ele'ation 9 s&an o( control 9 leaershi& 9
moti!ation 9 communication# Controllin'/
%odule , (" 'ours)
,ecision ma4in' &rocess 9 ecision ma4in' uner certaint% 9 ris4 9 uncertaint% 9 moels o( ecision ma4in'# Pro:ect
mana'ement 9 critical &ath metho 9 &ro'ramme e!aluation an re!ie1 technique 9 crashin'/
%odule + (" 'ours)
Introuction to (unctional areas o( mana'ement# C&erations mana'ement# Human resources mana'ement# Mar4etin'
mana'ement# <inancial mana'ement/
References
1. Aoont;# H/# an .eihrich# H/# Essentials of Management: An International Perspective# D
th
e/# Mc*ra1 Hill#
=00F/
2. Hic4s# Management: Concepts and Applications# Cen'a'e Learnin'# =00@/
3. Mahae!an# $/# Operations Management, Theory and Practice# Pearson 8ucation Asia# =00F/
4. Aotler# P/# Aeller# A/L# Aosh%# A/# an 0ha# M/# Mareting Management# 13
th
e/# =00F/
5. Ahan# M/J/# an 0ain# P/A/# !inancial Management# Tata-Mc'ra1 Hill# =00D/
CS+!" 04%BER T'E.R5 #0D CR5)T./R#)'5
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " (6 (T) 1 2()) 'ours)
,i!isi"ilit% theor% in inte'ers/ 87tene 8ucli)s al'orithm/ Moular Arithmetic 9 e7&onentiation an in!ersion/
<ermat)s Little Theorem# 8uler)s Theorem/ 6olution to con'ruences# Chinese Remainer Theorem/
%odule (" (T) 1 2()) 'ours)
Re!ie1 o( a"stract al'e"ra 9 6tu% o( Rin' Hn# multi&licati!e 'rou& HnL an (inite (iel H& 9 *auss Theorem 2c%clicit%
o( H&L5 - Buaratic Reci&rocit%/
Primalit% Testin' 9 <ermat test# Carmichael num"ers# 6olo!a% 6trassen Test# Miller Ra"in Test - anal%sis/
%odule , (", (T) 1 2()) 'ours)
+otions o( securit%/ Introuction to one secret 4e% cr%&tos%stem 2,865 an one cr%&to'ra&hic hash scheme 26HA5/
Pu"lic Ae% Cr%&tos%stems 9 ,i((ie Hellman Ae% A'reement Protocol# Ana&sac4 cr%&to s%stems# R6A/ 8l'amal)s
encr%&tion an si'nature scheme/
%odule + (7 (T) 1 2()) 'ours)
Authentication Protocols: Cne 1a% an Mutual Authentication# Challen'e Res&onse &rotocols# Lam&ort)s scheme#
+eeham 6chroeer &rotocol/ Interacti!e &roo( s%stems# Hero Ano1le'e Proo( s%stems 9 sounness an com&leteness
9 <iat-6hamir ienti(ication scheme/
References&
1/ H/ ,el(s an H/ Ane"l# Introuction to Cr%&to'ra&h%: Princi&les an A&&lications# 6&rin'er-Ierla'# =00=/
=/ 6er'e Iaune%# A Classical Introuction to Cr%&to'ra&h%: A&&lications (or Communications 6ecurit%#
6&rin'er# =00F/
3/ $ernar Mene;es# +et1or4 6ecurit% an Cr%&to'ra&h%/ Cen'a'e Learnin'# =010/
>/ $ A <orou;an an , Mu4ho&a%a%# Cr%&to'ra&h% an +et1or4 6ecurit%2=Ee5/ Tata Mc*ra1 Hill# =010
CS+! )R(0C()-ES .3 )R./R#%%(0/ -#0/4#/ES
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
Pro'rammin' Lan'ua'es: Conce&ts an Constructs/ -nt%&e Arithmetic 87&ressions 9 Introuction# 6emantics#
8!aluation/
%odule ("! (T) 1 2()) 'ours)
-nt%&e Lam"a Calculus 9 $asics# 6emantics/ Pro'rammin' in Lam"a Calculus/
%odule , ("! (T) 1 2()) 'ours)
T%&e Arithmetic 87&ressions 9 T%&es an T%&in' relations# T%&e 6a(et%/
6im&l% T%&e Lam"a Calculus 9 <unction t%&es# T%&in' relations# Pro&erties o( t%&in'/
%odule + (" (T) 1 2()) 'ours)
87tensions to 6im&l% T%&e Lam"a Calculus 9 -nit t%&e# Let "inin's# Pairs# Recors# 6ums# Iariants# Re(erences#
87ce&tions/
References&
1. $en:amin C/ Pierce# T%&es an Pro'rammin' Lan'ua'es # MIT Press# =00=
2. ,a!i A/ 6chmit# Pro'rammin' Lan'ua'e 6emantics/ In Allen $/ Tuc4er# 8/ Han"oo4 o( Com&uter 6cience
an 8n'ineerin'# CRC Press# 1FF6/
3. Luca Carelli# T%&e 6%stems/ In Allen $/ Tuc4er# 8/ Han"oo4 o( Com&uter 6cience an 8n'ineerin'# CRC
Press# 1FF6/
>/ Michael L/ 6cott# Pro'rammin' Lan'ua'e Pra'matics# 8lse!ier 2=Ee5# =00>
CS+!, C.%)4T#T(.0#- (0ETE--(/E0CE
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("!(T) 1 2()) 'ours)
Arti(icial Intelli'ence: Histor% an A&&lications# Prouction 6%stems# 6tructures an 6trate'ies (or state s&ace search-
,ata ri!en an 'oal ri!en search# ,e&th <irst an $reath <irst 6earch# ,<6 1ith Iterati!e ,ee&enin'# Heuristic
6earch- $est <irst 6earch# AL Al'orithm# ACL Al'orithm# Local 6earch Al'orithms an C&timi;ation Pro"lems#
Constraint satis(action# -sin' heuristics in 'ames- Minima7 6earch# Al&ha $eta Proceure/ Im&lementation o( 6earch
Al'orithms in LI6P/

%odule ("!(T) 1 2()) 'ours)
Ano1le'e re&resentation - Pro&ositional calculus# Preicate Calculus# <or1ar an $ac41ar chainin'# Theorem
&ro!in' "% Resolution# Ans1er 87traction# AI Re&resentational 6chemes- 6emantic +ets# Conce&tual ,e&enenc%#
6cri&ts# <rames# Introuction to A'ent "ase &ro"lem sol!in'/ Im&lementation o( -ni(ication# Resolution an Ans1er
87traction usin' Resolution/
%odule , ("!(T) 1 2()) 'ours)
Machine Learnin'- 6%m"ol "ase an Connectionist# 6ocial an 8mer'ent moels o( learnin'# Plannin'-Plannin' an
actin' in the real .orl# The *enetic Al'orithm- *enetic Pro'rammin'# C!er!ie1 o( 87&ert 6%stem Technolo'%- Rule
"ase 87&ert 6%stems# Introuction to +atural Lan'ua'e Processin'/ Im&lementation o( Machine Learnin' al'orithms/
%odule + ("(T) 1 2()) 'ours)
Lan'ua'es an Pro'rammin' Techniques (or AI- Introuction to PRCLC* an LI6P# 6earch strate'ies an Lo'ic
Pro'rammin' in LI6P# Prouction 6%stem e7am&les in PRCLC*/
References&
1/ *eor'e < Lu'er# Arti(icial Intelli'ence- 6tructures an 6trate'ies (or Com&le7 Pro"lem 6ol!in'# >Ee# =00=# Pearson
8ucation/
=/ 8/ Rich an A/Ani'ht# Arti(icial Intelli'ence# =Ee# Tata Mc*ra1 Hill
3/ 6 Russel an P +or!i'# Arti(icial Intelli'ence- A Moern A&&roach# =Ee# Pearson 8ucation# =00=
>/ +ils 0 +ilsson# Arti(icial Intelli'ence a ne1 6%nthesis# 8lse!ier#1FFD
5/ .inston/ P/ H# LI6P# Aison .esle%
6/ I!an $rat4o# Prolo' Pro'rammin' (or Arti(icial Intelli'ence# 3Ee# Aison .esle%# =000
@/ ,r/Russell 8"erhart an ,r/Juhui shi# Com&utational Intelli'ence - Conce&ts to Im&lementation# 8lse!ier# =00@
D/ <a4hreine C Aarra%# Clarence ,e 6il!a# 6o(t Com&utin' an Intelli'ent 6%stems ,esi'n- Theor% tools an
A&&lications# Pearson 8ucation# =00F/
CS+!+ (03.R%#T(.0 T'E.R5
Pre-requisite: +il
L T P C
> 0 0 >
Total Hours: 56 Hrs
%odule " ("+ 'ours)
<ounations: Re!ie1 o( &ro"a"ilit% theor%# entro&% an in(ormation# ranom sources# i/i/ an Mar4o! sources#
iscrete (inite state stationar% Mar4o! sources# 8ntro&% rate o( stationar% sources# Com&utation o( stationar%
istri"utions/
%odule ("+ 'ours)
6ource Coin': Pre(i7 an uniquel% ecoa"le coes - Ara(tKs an MacmillanKs inequalities - 6hannonKs source coin'
theorem - 6hannon <ano coe# Hu((man coe - o&timalit% - Lem&el Hi! coe - o&timalit% (or stationar% er'oic sources/
%odule , ("+ 'ours)
Channel Coin': $6C an $8C channel moels - Channel ca&acit% - 6hannonKs channel coin' theorem - e7istence o(
ca&acit% achie!in' coes (or $8C# <ano-8lias Inequalit%/
%odule + ("+ 'ours)
Cr%&to'ra&h%: In(ormation theoretic securit% - Per(ect secrec% - 6hannonKs theorem - &er(ectl% secret coes -
Introuction to com&utational securit% an &seuo ranom sources/
References&
1. T/ M/ Co!er an 0/ A/ Thomas# 8lements o( In(ormation Theor%# Aison .esle%# 1FFF/
=/ ,/ 0/ Mac4a%# In(ormation Theor%# In(erence an Learnin' Al'orithms/ Cam"ri'e -ni!ersit% Press# =00=/
3/ H/ ,el(s an H/ Ane"l# Introuction to Cr%&to'ra&h%2=Ee5# 6&rin'er# =010/
CS+!* /R#)' T'E.R5 #0D C.%B(0#T.R(CS
Pre-requisite: +il
L T P C
> 0 0 >
Total Hours: 56 Hrs
%odule " ("+ 'ours)
*eneratin' (unctions an a&&lications: Po1er series e7&ansion an 'eneratin' (unctions# Catalan an 6tirlin'
num"ers# sol!in' recurrence equations usin' 'eneratin' (unctions# Lam"ert series# $ell series an ,irichlet series#
A&&lications/
%odule ("+ 'ours)
87istential Com"inatorics: Ramse% theor%# Ramse% theorem# Ramse% num"ers# lo1er "oun (or R24#45# Lo!as; local
lemma - "oun on R24#45 usin' Lo!as; lemma# a&&lications o( local lemma/
%odule , ("+ 'ours)
Matchin' theor%: $i&artite matchin'# Aoni'Ks theorem# HallKs Matchin' Theorem# +et1or4 (lo1# Ma7 (lo1 min cut
theorem# inte'ralit%# <or <ul4erson metho
Connecti!it%: Pro&erties o( = connecte an 3 connecte 'ra&hs# Men'erKs theorem# A&&lications
%odule + ("+ 'ours)
Planar 'ra&hs an Colourin': Planar 'ra&hs# 5 color theorem# $roo4Ks theorem# e'e colorin'# Ii;in'Ks theorem# list
colourin'# ThomassenKs theorem/
References&
1/ R/ P/ *rimali# ,iscrete an Com"inatorial Mathematics# Aison .esle%# 1FFD/
=/ R/ P/ 6tanle%/ 8numerati!e Com"inatorics# Cam"ri'e -ni!ersit% Press# =001/
3/ P/ 0/ Cameron# Com"inatorics: To&ics# Techniques an Al'orithms# Cam"ri'e -ni!ersit% Press# 1FF5/
CS+!: C.%B(0#T.R(#- #-/.R(T'%S
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
+et1or4 <lo1s: Re!ie1 o( 'ra&h theor% 9 s&annin' trees# shortest &aths/ Connecti!it%# +et1or4 <lo1s - Ma7 (lo1
min cut theorem# al'orithms o( <or-<ul4erson# 8mon Aar&# &re(lo1-&ush al'orithms/
%odule ("! (T) 1 2()) 'ours)
Primal ,ual Theor%: Linear &ro'rammin' 9 Primal ual theor%# LP-ualit% "ase al'orithm esi'n/
A&&lications to +et1or4 (lo1 an other com"inatorial &ro"lems# A&&lications to 'ra&h theor% - Aoni'Ks theorem# Halls
theorem# Men'erKs theorem/
%odule , ("! (T) 1 2()) 'ours)
Matchin' Theor%: TutteKs theorem# Primal ual al'orithms 9 Hun'arian al'orithm# 8monKs ma7imum matchin'
al'orithm/ A&&lication to marria'e &ro"lems# Ho&cro(t Aar& al'orithm/
%odule + (" (T) 1 2()) 'ours)
A&&ro7imation: Primal ,ual a&&ro7imation al'orithms (or set co!er# Ma7imum satis(ia"ilit%# 6teiner tree# multicut#
6teiner (orest# s&arsest cut an 4-meians/
References&
1. ,/ .est# *ra&h Theor%# Prentice Hall# =00=/
2. ,/ 0un'nic4el# *ra&hs +et1or4s an Al'orithms# 6&rin'er =005/
3/ -/ Ia;irani# A&&ro7imation Al'orithms# 6&rin'er =003/
4. T/ H/ Cormen# C/ 8/ Leiserson# R/ L/ Ri!est# 6/ C/ 6tein# Introuction to Al'orithms 2>Ee5# Mc*ra1 Hill# =010/

CS+!2 T.)(CS (0 #-/.R(T'%S
Pre-requisite: +il
L T P C
> 0 0 >
Total Hours: 56 Hrs
%odule " ("+ 'ours)
Discrete )robability: Pro"a"ilit%# 87&ectations# Tail $ouns# Cherno(( $oun# Mar4o! Chains/ Ranom .al4s
87&onential *eneratin' <unctions# homo'eneous an non-homo'eneous o( (irst an secon e'rees/ Re!ie1 o(
al'orithm anal%sis/
%odule ("+ 'ours)
Ranomi;e Al'orithms# Moments an ,e!iations/ Tail Inequalities/ Ranomi;e selection/
Las Ie'as Al'orithms/ Monte Carlo Al'orithms/ Parallel an ,istri"ute Al'orithms/ ,e-Ranomi;ation
Com&le7it%: Pro"a"ilistic Com&le7it% Classes
%odule , ("+ 'ours)
Proo( Theor%/ 87am&les o( &ro"a"ilistic al'orithms/ Pro"a"ilistic Metho an Proo(s# Pro!in' that an al'orithm is
correct KAlmost sureK/ Com&le7it% anal%sis o( &ro"a"ilistic al'orithms# Pro"a"ilistic Countin'/ 6u&er recursi!e
al'orithms an inucti!e Turin' machines

%odule + ("+ 'ours)
Aolmo'or! Com&le7it% 9 $asic conce&ts/ Moels o( Com&utation/ A&&lications to anal%sis o( al'orithms/ Lo1er
"ouns/ Relation to 8ntro&%/ Aolmo'oro! com&le7it% an uni!ersal &ro"a"ilit%/ *oelKs Incom&leteness Theorem/
Chatin)s Proo( (or *oel)s Theorem/
References&
1/ R/ Mot1ani an P/ Ra'ha!an# Ranomi;e Al'orithms# Cam"ri'e -ni!ersit% Press# 1FF5
=/ C/ H/ Pa&aimitriou# Com&utational Com&le7it%# Aison .esle%# 1FF>
3/ ,e7ter C/ Ao;en# The ,esi'n an Anal%sis o( Al'orithms# 6&rin'er Ierla' +/J# 1FF=
>/ Ronal *raham# ,onal Anuth# Cren Patashni4 21FDF5: Concrete Mathematics# Aison-.esle%# I6$+ 0-=01-
1>=36-D
5/ Current Literature

CS+!6 @4#0T4% C.%)4T#T(.0
Pre-requisite: +il
L T P C
> 0 0 >
Total Hours: 56 Hrs
%odule " ("+ 'ours)
Re!ie1 o( Linear Al'e"ra/ The &ostulates o( quantum mechanics/ Re!ie1 o( Theor% o( <inite ,imensional Hil"ert
6&aces an Tensor Proucts
%odule ("+ 'ours)
Com&le7it% classes/ Moels (or Buantum Com&utation/ Bu"its/ 6in'le an multi&le qu"it 'ates/ Buantum circuits/ $ell
states/ 6in'le qu"it o&erations/ Controlle o&erations an measurement/ -ni!ersal quantum 'ates/ Buantum
Com&le7it% classes an relationshi& 1ith classical com&le7it% classes
%odule , ("+ 'ours)
Buantum Al'orithms 9 Buantum search al'orithm - 'eometric !isuali;ation an &er(ormance/ Buantum search as a
quantum simulation/ 6&eein' u& the solution o( +P Com&lete &ro"lems/ Buantum search as an
unstructure ata"ase/ *ro!er)s an 6hor)s Al'orithms/
%odule + ("+ 'ours)
Introuction to Buantum Coin' Theor%/ Buantum error correction/ The 6hor coe/ ,iscreti;ation o( errors#
Ine&enent error moels# ,e'enerate Coes/ The quantum Hammin' "oun/ Constructin' quantum coes 9 Classical
linear coes# 6hannon entro&% an Ion +euman 8ntro&%/
References&
1/ +ielsen# Michael A/# an Isaac L/ Chuan'# Buantum Com&utation an Buantum In(ormation/ Cam"ri'e# -A#
Cam"ri'e -ni!ersit% Press# 6e&tem"er =00=
=/ *rus4a# 0/ Buantum Com&utin'# Mc*ra1 Hill# 1FFF/
3/ Halmos# P/ R/ <inite ,imensional Iector 6&aces# Ian +ostran# 1F5D/
>/ Peres# Asher/ Buantum Theor%: Conce&ts an MethosA +e1 Jor4# +J: 6&rin'er# 1FF3/ I6$+: F@D0@F=3=5>FF/
CS+!7 T.)(CS (0 T'E.R5 .3 C.%)4T#T(.0
Pre-requisite: C63001 Theor% o( Com&utation
L T P C
> 0 0 >
Total Hours: 56 Hrs
%odule " ("+ 'ours)
Recursion# The &rimiti!e recursi!e (unctions# Turin' machines# Arithmeti;ation# Coin' (unctions # The normal (orm
theorem# The "asic equi!alence an Church)s thesis# Canonical coin' o( (inite sets# Com&uta"le an com&uta"l%
enumera"le sets# ,ia'onali;ation# Com&uta"l% enumera"le sets # -necia"le sets # -ni(ormit%# Man%-one reuci"ilit%#
The recursion theorem# Proo( (or *oel)s Incom&leteness Theorem "ase on Recursion theorem/
%odule ("+ 'ours)
The arithmetical hierarch%# Com&utin' le!els in the arithmetical hierarch% # Relati!i;e com&utation an Turin'
e'rees# Turin' reuci"ilit% # Limit com&uta"le sets# Incom&ara"le e'rees
%odule , ("+ 'ours)
The &riorit% metho# ,ia'onali;ation# Turin' incom&ara"le sets # -necia"ilit% # Constructi!ism# ranomness an
Aolmo'oro! com&le7it%# Com&ressi"ilit% an ranomness# -necia"ilit%
%odule + ("+ 'ours)
6cheme# &ro'rammin' an com&uta"ilit% theor% "ase on a term-re1ritin'# Nsu"stitutionN moel o( com&utation "%
6cheme &ro'rams 1ith sie-e((ectsG com&utation as al'e"raic mani&ulation: 6cheme e!aluation as al'e"raic
mani&ulation an term re1ritin' theor%/
References&
1/ R/ I/ 6oare# Recursi!el% enumera"le sets an e'rees# 6&rin'er-Ierla'# 1FD@
=/ */ 8/ 6ac4s# Hi'her recursion theor%# 6&rin'er Ierla'# 1FF0/
3/ M/ Li an P/ IitOn%i# An introuction to Aolmo'oro! com&le7it% an its a&&lications# 6&rin'er-Ierla'# 1FF3
4. ,e7ter C/ Ao;en# Automata an Com&uta"ilit%# 6&rin'er-Ierla'# Inc/# +e1 Jor4# +J# 1FF@/
5. 6/ C/ Aleene# Introuction to Metamathematics# Ian +ostran Co/# Inc/# Princeton# +e1 0erse%# 1F50/
6/ MIT C&enCourse.are on Com&uta"ilit% Theor% o( an 1ith 6cheme at htt&:EEoc1/mit/euEcoursesEelectrical-
en'ineerin'-an-com&uter-scienceE6-D>>-com&uta"ilit%-theor%-o(-an-1ith-scheme-s&rin'-=003E accesse on
=6E11E=010
CS+!,! C.%)4T#T(.0#- C.%)-E>(T5
Pre-requisite: +il
L T P C
> 0 0 >
Total Hours: 56 Hrs
%odule " ("+ 'ours)
Re!ie1 o( Com&le7it% Classes# +P an +P Com&leteness# 6&ace Com&le7it%# Hierarchies# Circuit satis(ia"ilit%# 6a!itch
an Immerman theorems# Aar& Li&ton Theorem/
%odule ("+ 'ours)
Ranomi;e Com&le7it% classes# AlemanKs theorem# 6i&ser *acs theorem# Ranomi;e Reuctions# Countin'
Com&le7it%# Permanent)s an Ialiant)s Theorem
%odule , ("+ 'ours)
Parallel com&le7it%# P-com&leteness# 6u&-liner s&ace classes# Rene'olKs theorem# Pol%nomial hierarch% an ToaKs
theorem
%odule + ("+ 'ours)
Arthur Merlin 'ames# *ra&h Isomor&hism &ro"lem# *ol1asser-6i&ser theorem# Interacti!e Proo(s# 6hamirKs theorem/
References&
1. 6/ Arora# $/ $ara4# Com&utational Com&le7it%: A Moern A&&roach# Cam"ri'e -ni!ersit% Press# =00F/
2. Pa&aimtriou C/ H//# Com&utational Com&le7it%# Aison .esle%# <irst 8ition# 1FF3
3. Mot1ani R# Ranomi;e Al'orithms# Cam"ri'e -ni!ersit% Press# 1FF5/
>/ Ia;irani I/# A&&ro7imation Al'orithms# 6&rin'er# <irst 8ition# =00>/
CS+!," C.%)4T#T(.#- #-/EBR#
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
+um"er Theor%: Re!ie1 o( 'rou&s an rin's an !ector s&aces# 8ucliKs al'orithm# 6tructure o( the rin' HPn
Al'orithms (or com&utation in the rin' HPn - moular in!ersion# e7&onentiation# Chinese remainerin'/
%odule ("! (T) 1 2()) 'ours)
<inite (iels: 6tructure theor% o( (inite (iels - <actori;ation o( &ol%nomials o!er (inite (iels - $erle4am&Ks al'orithm#
Cantor Hassenhaus al'orithm# <ourier Trans(orm al'orithm (or (inite (iels/
%odule , ("! (T) 1 2()) 'ours)
Primalit% Testin': 6olo!a% 6trassen test# Miller Ra"in test# A'ra1al# Aa%al 6a7ena al'orithm/
%odule + (" (T) 1 2()) 'ours)
A&&lications: 8ucliKs al'orithm (or rational &ol%nomial a&&ro7imation an ecoin' $CH an R6 coes/ A&&lications
to &u"lic 4e% cr%&to'ra&h%/
References&
1. I/ 6hou&# A com&utational Introuction to +um"er Theor% an Al'e"ra# Cam"ri'e -ni!ersit% Press# =005/
2. H/ ,el(s an H/ Ane"l# Introuction to Cr%&to'ra&h%# 6&rin'er# 1FFD/
3. 0/ !on ;ur *athen# Moern Com&uter Al'e"ra# Cam"ri'e -ni!ersit% Press# =003/
4. ./ C/ Hu((man an I/ Pless# <unamentals o( 8rror Correctin' Coes# Cam"ri'e -ni!ersit% &ress# =003/
CS+!, C.%)4TER #RC'(TECT4RE
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " (6(T) 1 2()) 'ours)
<unamentals 9 Technolo'% tren -&er(ormance measurement 9Com&arin' an summari;in' &er(ormance- quantitati!e
&rinci&les o( com&uter esi'n 9Amahl)s la1- instruction set architectures 9 memor% aressin'- 9t%&e an si;e
o&eran - encoin' an instruction set - role o( com&ilers - case stu% 9 MIP6 6> architecture 9 Re!ie1 o( &i&elinin' -
MIP6 architecture
%odule ("!(T) 1 2()) 'ours)
Instruction le!el &arallelism an its limits - %namic scheulin' 9-%namic har1are &reiction - multi&le issue
&rocessor 9 multi&le issue 1ith %namic scheulin'-har1are "ase s&eculation- limitation o( ILP-Case stu% P6
micro-architecture Introuction to multicore &rocessors#
%odule , (":(T) 1 "()) 'ours)
Multi&rocessor an threa le!el &arallelism- classi(ication o( &arallel architecture-moels o( communication an
memor% architecture-6%mmetric share memor% architecture-cache coherence &rotocols-istri"ute share memor%
architecture-irector% "ase cache coherence &rotocol- Memor% consistenc%-rela7e consistenc% moels multi
threain'- e7&loitin' threa le!el &arallelism multicore architecture# Memor% hierarch% esi'n - reucin' cache misses
an miss &enalt%# reucin' hit time - main memor% or'ani;ation - !irtual memor% an its &rotection -/ Memor% issues
in multicore &rocessor "ase s%stems

%odule + (6(T) 1 ()) 'ours)
6tora'e 6%stems# <aults an relia"ilit%# +et1or4s# Bueuin'# ,esi'n o( stora'e s%stems 9 case stuies
References
1/ Hennes% 0/ L/ ? Pattersen ,/ A/# Anrea C/ Ar&aci-,usseau# Com&uter Architecture: A Buantitati!e a&&roach# >Ee#
Mor'an Aau(man# =00@
=/ Pattersen ,/ A/ ? Hennes% 0/ L/# Com&uter Cr'anisation an ,esi'n: The Har1areE 6o(t1are Inter(ace# 3Ee#
Harcourt Asia Pte Lt 2Mor'an Aau(man5# 6in'a&ore
CS+!,, D(STR(B4TED C.%)4T(0/
Pre-requisite: C6=005 ,ata 6tructures an Al'orithms
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("!(T) 1 2()) 'ours)
Characteristics o( ,istri"ute 6%stems# ,istri"ute s%stems Iersus Parallel s%stems# Moels o( istri"ute s%stemsB
Ha&&ene $e(ore an Potential Causalit% Moel# Moels "ase on 6tates# Lo'ical cloc4s# Iector cloc4s# Ieri(%in' cloc4
al'orithms# ,irect e&enenc% cloc4s/
%odule ("!(T) 1 2()) 'ours)
Mutual e7clusion usin' Time stam&s# ,istri"ute Mutual 87clusion 2,M85 usin' timestam&s# to4en an Buorums#
Centrali;e an istri"ute al'orithms# &roo(s o( correctness an com&le7it% anal%sis/ ,rin4in' &hiloso&hers &ro"lem#
,inin' &hiloso&hers &ro"lem uner hea!% an li'ht loa conitions/ Im&lementation an &er(ormance e!aluation o(
,M8 al'orithms/
%odule , ("!(T) 1 2()) 'ours)
Leaer election al'orithms# *lo"al state etection# *lo"al &reicates# Termination ,etection# Control o( istri"ute
com&utation# is:uncti!e &reicates/ Per(ormance e!aluation o( leaer election al'orithms on simulate en!ironments/
%odule + ("(T) 1 2()) 'ours)
6el( sta"ili;ation# 4no1le'e an common 4no1le'e# ,istri"ute consensus# Consensus uner As%nchron% an
6%nchron%# Chec4 &ointin' (or Reco!er%# R- *ra&hs
References&
1/ Ii:a% A/ *ar'/# 8lements o( ,istri"ute Com&utin'# .ile% ? 6ons# =00=
=/ 6u4umar *hosh# ,istri"ute 6%stems An Al'orithmic A&&roach# Cha&man ? Hall# CRC Com&uter an
In(ormation 6cience 6eries# =006/
3. Tanen"aum 6# ,istri"ute C&eratin' 6%stems# Pearson 8ucation/#=005
4. Coulouris *# ,ollimore 0/ ? Ain"er' T/# ,istri"ute 6%stems Conce&ts An ,esi'n# =Ee# Aison .esle%
=00>
5. Cho1 R/ an 0ohnson T/# ,istri"ute C&eratin' 6%stems an Al'orithms# Aison .esle%# =00=
CS+!,+ %(DD-E=#RE TEC'0.-./(ES
Pre-requisite: C6>033 ,istri"ute Com&utin'
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
Pu"lishE6u"scri"e matchin' al'orithm# e!ent "ase s%stems# noti(ication (ilterin' mechanisms# Com&osite e!ent
&rocessin'# content "ase routin'# content "ase moels an matchin'# matchin' al'orithms# istri"ute hash ta"les
2,HT5
%odule ("! (T) 1 2()) 'ours)
,istri"ute noti(ication routin'# content "ase routin' al'orithms# en'ineerin' e!ent "ase s%stems# Accessin'
&u"lishEsu"scri"e (unctionalit% usin' APIs/ 6co&in'# e!ent "ase s%stems 1ith sco&es# noti(ication ma&&in's#
transmission &olicies# im&lementation strate'ies (or sco&in'/
%odule , ("! (T) 1 2()) 'ours)
Com&osite e!ent etection# etection architectures# securit%# (ault tolerance# con'estion control# mo"ilit%# e7istin'
noti(ication stanars- 0M6# ,,6# HLA/
%odule + (" (T) 1 2()) 'ours)
To&ic "ase s%stems# C!erla%s# P=P s%stems# o!erla% routin'# Case stuies- R8$8CA# H8RM86# *r%&hon/
Commercial s%stems- I$M .e"s&here MB# TI$CC Rene;!ous/
References&
1/ *ero Muhl# Lu'er <ie'e# Peter R/ Piet;uch# ,istri"ute 8!ent $ase 6%stems/ 6&rin'er# =006
=/ Chris $ritton an Peter $%e# IT Architectures an Mile1are/ Pearson 8ucation# 2=Ee5# =005
3/ Janlei ,iao# an Michael 0/ <ran4lin# Buer% Processin' (or Hi'h-Iolume QML Messa'e $ro4erin'/ IL,$
=003/
4. Chee-Jon' Chan# Minos *aro(ala4is an Ra:ee! Rasto'i# R8-Tree: An 8((icient Ine7 6tructure (or Re'ular
87&ressions# IL,$ =00=/
5/ Peter R/ Piet;uch# $rian 6han# 0ean $acon/ A <rame1or4 (or 8!ent Com&osition in ,istri"ute 6%stems#
Proc/ o( the >th Int/ Con(/ on Mile1are 2M.K035
CS+!,* C.%)4TER SEC4R(T5
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
C&eratin' s%stem securit% - Access Control 9 MAC# ,AC# R$AC/ <ormal moels o( securit% - $LP# $i"a# Chinese
.all an Clar4 .ilson/ C!er!ie1 o( 68 Linu7/ 6o(t1are !ulnera"ilities - $u((er an stac4 o!er(lo1# Phishin'/ Mal1are
- Iiruses# .orms an Tro:ans/
%odule ("+ (T) 1 2()) 'ours)
+et1or4 6ecurit% - 6ecurit% at i((erent la%ers 9 IP6ec E 66L E P*P/ 6ecurit% &ro"lems in net1or4 omain - ,o6#
,,o6# ARP s&oo(in' an session hi:ac4in'/ ,+6 attac4s an ,+668C/ Cross-site scri&tin' Q66 1orm# 6BL in:ection
attac4s/ Intrusion ,etection 6%stems 2I,65/ ,,o6 etection an &re!ention in a net1or4/
%odule , (7 (T) 1 2()) 'ours)
6ecurit% in current omains 9 .8P - .ireless LA+ securit% - Iulnera"ilities - (rame s&oo(in'/ Cell&hone securit% -
*6M an -MT6 securit%/ Mo"ile mal1are - "luetooth securit%/
%odule + (7 (T) 1 2()) 'ours)
6ecurit% in current a&&lications 9 6ecurit% case stuies o( Cnline "an4in' an Creit Car Pa%ment 6%stems/
Challen'es in securit% (or 1e" ser!ices an clous/
References&
1. $ernar Mene;es# +et1or4 securit% an Cr%&to'ra&h%# Cen'a'e Learnin' Inia# =010/
=/ $ A <orou;an an , Mu4ho&a%a%# Cr%&to'ra&h% an +et1or4 6ecurit%2=Ee5/ Tata Mc*ra1 Hill# =010
3/ ,ieter *ollmann# Com&uter 6ecurit%# 0ohn .ile% an 6ons Lt/# =006/
CS+!,: #D8#0CED D#T#B#SE %#0#/E%E0T S5STE%S
Pre-requisite: C6300= ,ata"ase Mana'ement 6%stems
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
,istri"ute ata"ase conce&ts - o!er!ie1 o( client - ser!er architecture an its relationshi& to istri"ute ata"ases#
Concurrenc% control Hetero'eneit% issues# Persistent Pro'rammin' Lan'ua'es# C":ect Ientit% an its im&lementation#
Clusterin'# Ine7in'# Client 6er!er C":ect $ases# Cache Coherence/
%odule ("! (T) 1 2()) 'ours)
Parallel ,ata"ases: Parallel Architectures# &er(ormance measures# share nothin'Eshare is4Eshare memor% "ase
architectures# ,ata &artitionin'# Intra-o&erator &arallelism# Pi&elinin'# 6cheulin'# Loa "alancin'# Buer% &rocessin'-
Ine7 "ase# Buer% o&timi;ation: cost estimation# Buer% o&timi;ation: al'orithms# Cnline quer% &rocessin' an
o&timi;ation# QML# ,T,# QPath# QML
ine7in'# Aa&ti!e quer% &rocessin'
%odule , ("! (T) 1 2()) 'ours)
A!ance Transaction Moels: 6a!e&oints# 6a'as# +este Transactions# Multi Le!el Transactions/ Reco!er%: Multi-
le!el reco!er%# 6hare is4 s%stems# ,istri"ute s%stems =PC# 3PC# re&lication an hot s&ares# ,ata stora'e# securit%
an &ri!ac%- Multiimensional A- Anon%mit%# ,ata stream mana'ement/
%odule + (" (T) 1 2()) 'ours)
Moels o( 6&atial ,ata: Conce&tual ,ata Moels (or s&atial ata"ases 2e/'/ &icto'ram enhance 8R,s5# Lo'ical ata
moels (or s&atial ata"ases: raster moel 2ma& al'e"ra5# !ector moel# 6&atial quer% lan'ua'es# +ee (or s&atial
o&erators an relations# 6BL3 an A,T/ 6&atial o&erators# C*I6 queries
References&
1. A!i 6il"erschat;# Han4 Aorth# an 6/ 6uarshan/ ,ata"ase 6%stem Conce&ts# 25Ee5# Mc*ra1 Hill# =005
=/ 6/ 6he4har an 6/ Cha1la/ 6&atial ,ata"ases: A Tour# Prentice Hall# =003/
3/ Ral( Hartmut *utin'# Mar4us 6chneier# Mo!in' C":ects ,ata"ases Mor'an Aau(man# =005/
>/ R/ 8lmasri an 6/ +a!athe# <unamentals o( ,ata"ase 6%stems# $en:amin- Cummin's #25Ee5# =00@
CS+!,2 C-.4D C.%)4T(0/
Pre-requisite: C6>033 ,istri"ute Com&utin'
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
+e1 Com&utin' Parai'ms ? 6er!ices: Clou com&utin' # 8'e com&utin' # *ri com&utin' # -tilit% com&utin' #
Clou Com&utin' Architectural <rame1or4# Clou ,e&lo%ment Moels# Iirtuali;ation in Clou Com&utin'#
Paralleli;ation in Clou Com&utin'# 6ecurit% (or Clou Com&utin'# Clou 8conomics # Meterin' o( ser!ices/
%odule ("! (T) 1 2()) 'ours)
Clou 6er!ice Moels: 6o(t1are as a 6er!ice 26aa65# In(rastructure as a 6er!ice 2Iaa65# Plat(orm as a 6er!ice 2Paa65#
6er!ice Criente Architecture 26oA5# 8lastic Com&utin'# Cn ,eman Com&utin'# Clou Architecture# Introuction to
!irtuali;ation/
%odule , ("! (T) 1 2()) 'ours)
T%&es o( Iirtuali;ation# *ri technolo'% # $ro1ser as a &lat(orm# .e" =/0# Autonomic 6%stems# Clou Com&utin'
C&eratin' 6%stem# ,e&lo%ment o( a&&lications on the clou# Case stuies- Qen# IM1are# 8ucal%&tus# Ama;on 8C=/
%odule + (" (T) 1 2()) 'ours)
Introuction to Ma& Reuce# In(ormation retrie!al throu'h Ma& Reuce# Haoo& <ile 6%stem# *<6# Pa'e Ran4in'
usin' Ma& Reuce# 6ecurit% threats an solutions in clous# mo"ile clou com&utin'# Case stuies- A:a7# Haoo&/
References&
1/ Tom .hite# Haoo&: The ,e(initi!e *uie# CKReill% Meia# =00F
=/ 0ason Ienner# Pro Haoo&# A&ress# =00F
3/ Timoth% Chou # Introuction to clou com&utin' ? $usiness# Acti!e $oo4 Press# =010
>/ Current literature- 0ournal ? con(erence &a&ers
CS+!,6 D#T# %(0(0/
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
Introuction to ata minin'-challen'es an tas4s ,ata &re&rocessin' ata anal%sis# measures o( similarit% an
issimilarit%# ,ata !isuali;ation 9conce&ts an techniques
%odule ("! (T) 1 2()) 'ours)
Classi(ication- ecision tree-&er(ormance e!aluation o( the classi(ier# com&arison o( i((erent classi(iers# Rule "ase
classi(ier# +earest-nei'h"or classi(iers-$a%esian classi(iers-su&&ort !ector machines# Class im"alance &ro"lem
%odule , ("! (T) 1 2()) 'ours)
Association anal%sis 9(requent item 'eneration rule 'eneration# e!aluation o( association &atterns
%odule + (" (T) 1 2()) 'ours)
Cluster anal%sis#-t%&es o( clusters# A means al'orithm# cluster e!aluation# a&&lication o( ata minin' to 1e" minin' an
$ioin(ormatics
References&
1. Pan'-+in' Tan#Michael 6tein"ach an Ii&in Aumar # Introduction to "ata Mining# Pearson 8ucation =006/
2. Han an Aam"er# "ata Mining: Concepts and Techni#ues 2=e5# Mor'an Aau(mann# =005/
CS+!,7 %4-T( #/E0T S5STE%S
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
Introuction to a'ent an multi-a'ent s%stems# i((erent t%&es o( a'ents# a"stract architecture# istri"ute &ro"lem
sol!in'# a&&lication areas# 6o(t1are tools (or moelin' Multi-A'ent 6%stems
%odule ("! (T) 1 2()) 'ours)
A'ent communication# communication lan'ua'es ABML an <IPA ACL Communication &olicies an &rotocols#
Protocol Moelin'
%odule , ("! (T) 1 2()) 'ours)
+e'otiation in multi-a'ent- a'ent en!ironment# 'ame theoretical moel # heuristic a&&roach# ar'umentation "ase
a&&roach
%odule + (" (T) 1 2()) 'ours)
,istri"ute ecision ma4in' 9e!aluation criteria -6ocial 1el(are# Pareto 8((icienc%# Ini!iual Rational# 6ta"ilit%#
A&&lication o( multia'ent s%stems in com&le7 istri"ute &ro"lem sol!in'# Moelin' istri"ute multi-a'ent s%stems/
References&
1. M/ .oolri'e# An Introduction to multi$agent systems# .ile%# =00F/
2. R/ +or!i'# Artificial Intelligence: A modern approach# Prentice Hall# =010/
CS+!+! B(.(03.R%#T(CS
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
Molecular "iolo'% &rimer# 'ene structure an in(ormation content# $ioin(ormatics tools an ata"ases# 'enomic
in(ormation content# 6equence Ali'nment# Al'orithms (or 'lo"al an local ali'nments# 6corin' matrices# ,%namic
Pro'rammin' al'orithms/
%odule ("! (T) 1 2()) 'ours)
Introuction to $io-&ro'rammin' lan'ua'es# Restriction Ma&&in' an Moti( (inin'# *ene Preiction# Molecular
Ph%lo'enetics# Ph%lo'enetic trees# Al'orithms (or Ph%lo'enetic Tree construction/
%odule , ("! (T) 1 2()) 'ours)
Com"inatorial &attern matchin'# Re&eat (inin'# Ae%1or Trees# 6u((i7 Trees# Heuristic similarit% search al'orithms#
A&&ro7imate &attern matchin'/
%odule + (" (T) 1 2()) 'ours)
Microarra%s# *ene e7&ression# Al'orithms (or Anal%;in' *ene 87&ression ata# Protein an R+A structure &reiction#
Al'orithms (or structure &reiction/ 8mer'in' trens in "ioin(ormatics al'orithms an ata"ases/
References&
1. +eil C 0ones an Pa!el A Pe!;ner# An Introuction to $ioin(ormatics Al'orithms# MIT Press# =00>/
2. ,a!i . Mount# $ioin(ormatics- 6equence an *enome Anal%sis# 2=Ee5# Col 6&rin' Har"or La"orator% Press#
+e1 Jor4# =00>/
3. ,/ 8/ Arane an M/ L/ Ra%mer# <unamental Conce&ts o( $ioin(ormatics# Pearson 8ucation# =003/
4. T/ A/ Att1oo an ,/ 0/ Parr%-6mith# Introuction to $ioin(ormatics# Pearson 8ucation# =003/
5/ Current Literature/
CS+!+" 0#T4R#- -#0/4#/E )R.CESS(0/
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("!(T)12()) 'ours)
Introuction to +atural Lan'ua'e Processin'# ,i((erent Le!els o( lan'ua'e anal%sis# Re&resentation an unerstanin'#
Lin'uistic "ac4'roun/ *rammars an &arsin'# To& o1n an $ottom u& &arsers/
%odule ("!(T)12()) 'ours)
Transition +et1or4 *rammars# <eature s%stems an au'mente 'rammars# Mor&holo'ical anal%sis an the le7icon#
Parsin' 1ith (eatures# Au'mente Transition +et1or4s/
%odule , ("!(T)12()) 'ours)
*rammars (or natural lan'ua'e# Mo!ement &henomenon in lan'ua'e# Hanlin' questions in conte7t (ree 'rammars#
Hol mechanisms in AT+s# *a& threain'# Human &re(erences in &arsin'# 6hi(t reuce &arsers# ,eterministic &arsers#
6tatistical methos (or Am"i'uit% resolution
%odule + ("(T)12()) 'ours)
6emantic Inter&retation# 1or senses an am"i'uit%# $asic lo'ical (orm lan'ua'e# 8ncoin' am"i'uit% in lo'ical (rom#
Thematic roles# Lin4in' s%nta7 an semantics# In(ormation Retrie!al# Recent trens in +LP/
References&
1/ 0ames Allen# +atural Lan'ua'e -nerstanin' 2=Ee5# Pearson 8ucation# =003
=/ T 6iiqui an - 6 Ti1ar%# +atural Lan'ua'e Processin' an In(ormation Retrie!al# C7(or -ni!ersit% Press# =00D
3/ , 0ura((s4% an 0 H Martin# 6&eech an Lan'ua'e Processin'# Pearson 8ucation# =000
CS+!+ =EB )R./R#%%(0/
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
Internet an its architecture# Client 6er!er +et1or4in' - Creatin' an Internet Client# A&&lication Protocols an htt&#
Presentation as&ects html# C66 an 0a!a scri&t# Creatin' a 1e" ser!er# 6er!in' ,%namic Content- C*I 9 o!er!ie1 o(
technolo'ies li4e PHP 9 a&&lets 9 06P/ Im&lementation e7am&les/
%odule ("! (T) 1 2()) 'ours)
.e" ser!er architecture# Pro'rammin' threas in C# 6hare memor% s%nchroni;ation# Per(ormance measurement an
1or4loa moels/ Com&arison usin' e7istin' "enchmar4s/
%odule , ("! (T) 1 2()) 'ours)
.e" e!elo&ment (rame1or4s 9 ,etaile stu% o( one o&en source 1e" (rame1or4 - Ru"% 6cri&tin'# Ru"% on rails 9
,esi'n# Im&lementation an Maintenance as&ects/
%odule + (" (T) 1 2()) 'ours)
6er!ice Criente Architecture 9 6CAP/ .e" =/0 technolo'ies/ 9 A0AQ/ ,e!elo&ment usin' .e"=/0 technolo'ies/
Introuction to semantic 1e"/
References&
1/ ,a!e Thomas# 1ith Cha <o1ler an An% Hunt/ Pro'rammin' Ru"%: The Pra'matic Pro'rammerKs *uie
23Ee5# Pra'matic Pro'rammers# Ma% =00D/
=/ $alachaner Arishnamurth% an 0enni(er Re7(or/ .e" Protocols an Practice: HTTPE1/1# +et1or4in'
Protocols# Cachin'# an Tra((ic Measurement 21Ee5# Aison .esle% Pro(essional# =001
CS+!+, (%#/E )R.CESS(0/
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
!undamentals of Image processing: ,i'ital ima'e re&resentation# 8lements o( ,i'ital ima'e &rocessin' s%stems#
Ima'e moel# 6am&lin' an Buanti;ation# $asic relations "et1een &i7els/

Image transforms: Cne imensional <ourier trans(orm# T1o imensional <ourier trans(orm# Pro&erties o( t1o
imensional <ourier trans(orm/ .alsh trans(orm# Haamar trans(orm# ,iscrete cosine trans(orm# Haar trans(orm#
6lant trans(orm/
%odule ("! (T) 1 2()) 'ours)
Image enhancement techni#ues: 6&atial omain methos# <requenc% omain methos# Intensit% trans(orm# Histo'ram
&rocessin'# Ima'e su"traction# Ima'e a!era'in'# 6moothin' (ilters# 6har&enin' (ilters# 6&atial mas4s (rom (requenc%
omain/
%odule , ("! (T) 1 2()) 'ours)
Image %egmentation: Thresholin': ,i((erent t%&es o( thresholin' methos# Point etection# 8'e etection: ,i((erent
t%&es o( e'e o&erators# Line etection# 8'e lin4in' an "ounar% etection# Re'ion 'ro1in'# Re'ion s&littin'# Re'ion
Mer'in'/
%odule + (" (T) 1 2()) 'ours)
Image "ata Compression: <unamentals# Com&ression moels# 8rror (ree com&ression# Loss% Com&ression# Ima'e
com&ression stanars/
Applications of Image Processing: Meical ima'in'# Ro"ot !ision# Character reco'nition# Remote 6ensin'/
References&
1/ R/C/*on;ale; an R/8/.oos# / ,i'ital Ima'e Processin'# Aison-.esle% Pu"lishin' Com&an%# =00@/
=/ Milan 6on4a# Iacla! Hla!ac an Ro'er $o%le# Ima'e Processin'# Anal%sis# an Machine Iision# 2=Ee5# P.6
Pu"lishin'# 1FFF
CS+!++ )#TTER0 REC./0(T(.0
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
Introduction: Machine Perce&tion # Pattern Reco'nition 6%stems# The ,esi'n C%cle# Learnin' an Aa&tation/
&aye's "ecision Theory: $a%es ,ecision Theor%# Minimum 8rror rate Classi(ication# Classi(iers#
,iscriminant (unctions an ,ecision 6ur(aces# +ormal ,ensit%# ,iscriminant (unctions (or the +ormal
,ensit%# $a%es ,ecision Theor% (or ,iscrete (eatures
%odule ("! (T) 1 2()) 'ours)
Maximum (ielihood and &ayesian Parameter Estimation :Ma7imum Li4elihoo 8stimation# $a%esian
8stimation# $a%esian Parameter 8stimation# *aussian Case an *eneral Theor%/
)on Parametric Techni#ues: ,ensit% 8stimation# Par;en .ino1s # A- +earest +ei'h"or 8stimation#++ rule#
Metrics an ++ Classi(ication# <u;;% Classi(ication
%odule , ("! (T) 1 2()) 'ours)
(inear "escriminant !unctions : Linear ,iscriminant <unctions an ,ecision 6ur(aces# *enerali;e
,iscriminant <unctions# The t1o-cate'or% linearl% se&ara"le case # Minimi;in' the &erce&tron criterion
(unction# rela7ation &roceures# non- se&ara"le "eha!ior# Minimum 6quare- 8rror &roceures/
%odule + (" (T) 1 2()) 'ours)
Multi (ayer )eural )et*ors : <ee-(or1ar C&eration# Classi(ication# $ac4 9 &ro&a'ation Al'orithm#
8rror 6ur(aces# $ac4-&ro&a'ation as <eature ma&&in'/
References&
1. R/ C/ ,ua# P/ 8/ Hart an ,/ */ 6tor4# Pattern Classification # 0ohn-.ile%# =00>
2. 0/ T/ Tou an R/ C/ *on;ale;# Pattern +ecognition Principles# "% Tou an *on;ale;# .ile%# 1F@>/
CS+!+* %ED(C#- (%#/E )R.CESS(0/
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
Introuction to i'ital ima'e &rocessin': ima'es# ima'e qualit%# "asic o&erations/
Raio'ra&h%: Introuction# Q-ra%s# interaction 1ith matter# etectors# ual ener'% ima'in'# qualit% clinical use#
"iolo'ic e((ect an sa(et%# <ourier 6lice Theorem $asics/
%odule ("! (T) 1 2()) 'ours)
Q-ra% Com&ute tomo'ra&h%: Introuction# Q-ra% etectors in CT# ima'in'# cariac CT# ima'e qualit%# clinical use#
"iolo'ic e((ects an sa(et%/
Ma'netic resonance ima'in': Introuction# &h%sics o( transmitte si'nal# interaction 1ith tissue# si'nal etection an
etector# ima'in'/ $iolo'ic e((ects an sa(et%
%odule , ("! (T) 1 2()) 'ours)
+uclear ima'in'# Introuction# raionuclies# interaction o( *ama-&hotons an &articles 1ith matter# ata acquisition#
ima'in'# ima'e qualit%# equi&ment# clinical use# "iolo'ic e((ects an sa(et%
-ltrasoun ima'in': Ph%sics o( acoustic 1a!es# 'eneration an etection o( ultrasoun# 'ra%scale ima'in'# ,o&&ler
ima'in'# ima'e qualit%# equi&ment# clinical use# "iolo'ic e((ects an sa(et%/
%odule + (" (T) 1 2()) 'ours)
Meical ima'e anal%sis: Manual an automate anal%sis# com&utation strate'ies (or automate meical ima'e anal%sis#
&i7el classi(ication/
References&
1. Paul 6uetens# !undamentals of medical imaging# Cam"ri'e -ni!ersit% Press# =00F
2. $ush"er'# 0/ A/ et al/ The Essential Physics of Medical Imaging ,-e.# L/ .illiams an .il4ins# =00=
CS+!+: C.%)4TER 8(S(.0
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
Introuction an o!er!ie1# &inhole cameras# raiometr% terminolo'%/ 6ources# shao1s an shain': Local shain'
moels- &oint# line an area sourcesG &hotometric stereo/ Color: Ph%sics o( colorG human color &erce&tion# Re&resentin'
colorG A moel (or ima'e colorG sur(ace color (rom ima'e color/
%odule ("! (T) 1 2()) 'ours)
Linear (ilters: Linear (ilters an con!olutionG shi(t in!ariant linear s%stems- iscrete con!olution# continuous
con!olution# e'e e((ects in iscrete con!olutionG 6&atial (requenc% an (ourier trans(ormsG 6am&lin' an aliasin'G
(ilters as tem&latesG +ormali;e correlations an (inin' &atterns/ 8'e etection: +oiseG estimatin' eri!ati!esG
etectin' e'es/ Te7ture: Re&resentin' te7tureG Anal%sis usin' oriente &%ramiG A&&licationsG 6ha&e (rom te7ture/ The
'eometr% an !ie1s: T1o !ie1s/
%odule , ("! (T) 1 2()) 'ours)
6tereo&sis: ReconstructionG human stereoG $inocular (usionG usin' color camera/
%odule + (" (T) 1 2()) 'ours)
6e'mentation "% clusterin': Human !ision# a&&lications# se'mentation "% 'ra&h theoretic clusterin'/ 6e'mentation "%
(ittin' a moel# Hou'h trans(ormG (ittin' lines# (ittin' cur!esG
References&
1/ ,a!i A <ors%nth an 0ean Ponce# Com&uter Iision- A moern a&&roach# Pearson eucation series# =003/
=/ Milan 6on4a# Iacla! Hla!ac an Ro'er $o%le # ,i'ital ima'e &rocessin' an com&uter !ision# Cen'a'e
learnin'# =00D/
3. 6chal4o(( R/ 0/# ,i'ital Ima'e Processin' an Com&uter Iision# 0ohn .ile%# =00>/
CS+!+2 C.%)4TER /R#)'(CS
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0Hrs
%odule " ("! (T) 1 2()) 'ours)
*ra&hics Pi&eline - o!er!ie1 o( !erte7 &rocessin'# &rimiti!e 'eneration# trans(ormations an &ro:ections# cli&&in'#
rasterisation# (ra'ment &rocessin' - *ra&hics Har1are - o!er!ie1 o( *P- architecture# ho1 *P-s 6IM, architecture
suits com&uter 'ra&hics/
%odule ("! (T) 1 2()) 'ours)
Coorinate 6%stems - re&resentations# homo'enous coorinates# o":ect# camera# 1orl# an screen coorinate s%stem#
chan'in' coorinate s%stems/ Trans(ormations - a((ine trans(ormations# translation# rotation# scalin' in homo'enous
coorinates# matri7 re&resentations# cumulation o( trans(ormations/ Iie1in' an Pro:ections - ortho'ra&hic an
&ers&ecti!e &ro:ection# camera &ositionin'# Hien 6ur(ace Remo!al - its im&ortance in renerin'# ; "u((er al'orithm#
cli&&in'# cullin'# ,ata 6tructures (or e((icient im&lementation o( the trans(ormations an &ro:ections/
%odule , ("! (T) 1 2()) 'ours)
Li'htin' an 6hain' - li'ht sources# normal com&utation# re(lection moels# (lat an smooth shain' # Introuction to
Te7tures an Ma&&in' - Renerin' Techniques - slicin'# !olume renerin'# iso-sur(ace e7traction# ra% castin'# multi
resolution re&resentations (or lar'e ata renerin'/ ,ata 6tructures (or e((icient im&lementation/
%odule + (" (T) 1 2()) 'ours)
*eometric Moellin' - ,ata structures - tree re&resentations# hierarchical moels# scene 'ra&hs - &article s%stems an
re&resentations - introuction to moelin' an sol!in' %namics "ase on &h%sics# Introuction to Cur!es 6ur(aces
2$e;ier# s&lines5 an Meshes - structure an unstructure/
References&
1. 8/ 6/ An'el# Interacti!e Com&uter *ra&hics# A to&-o1n a&&roach 1ith C&en*L# 25e5# Pearson 8ucation#
=00F//
2. ,/ Hearn an M/ P/ $a4er# Com&uter *ra&hisc 1ith C&en*L# Prentice Hall# =003# 23Ee5# Prentice Hall, 2003/
CS+!+6& T.)(CS (0 C.%)(-ERS
Prerequisite: C6 3005 Com&iler ,esi'n
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule "& #ttribute grammars ("!(T) 1 2()) hours)
Anal%sis# use# tests# circularit%/ Issues in t%&e s%stems/
%odule & #nalysis and .ptimiCations ("!(T)12()) hours)
A!ance to&ics in ,ata <lo1# Control <lo1 an ,e&enenc% anal%sis# Loo& o&timi;ations 9 in!ariant coe motion#
elimination o( &artial reunanc%# 87&erimental &lat(orms 9 6-I</
%odule ,& (-) Compilation (""(T) 1 2()) hours)
Issues in com&ilation (or ILP "ase &rocessors/ 8((ect o( ILI.# 6&eculati!e# Preicate instructions# multithreae
&rocessors/
%odule +& Dynamic Compilation (""(T)12()) hours)
Introuction# methos# case stuies# im&lementation# so(t1are tools/
References&
1/ ACM 6I*PLA+/
=/ ACM Transactions on Pro'rammin' lan'ua'es an 6%stems/
3/ 6T8I8+ M-CH+ICA/ Advanced Compiler "esign Implementation# Mor'an Aau((mann Pu"lishers# 1FF@
>/ Aho A/I# Lam M/6# 6ethi R an -llman 0/ ,# Com&ilers 9 Princi&les# Techniques an Tools# Pearson# =00@/
CS+!+7 #D8#0CED C.%)4TER 0ET=.R?S
Pre-requisite: C63006 Com&uter +et1or4s
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)& Introuction- Internet esi'n &hiloso&h%# la%erin' an en to en esi'n &rinci&le/
MAC &rotocols (or hi'h-s&ee LA+6# MA+s# 1ireless LA+s an mo"ile net1or4s# ILA+/ <ast access technolo'ies/
%odule ("! (T) 1 2()) 'ours)& IP!6: .h% IP!6# "asic &rotocol# e7tensions an o&tions# su&&ort (or Bo6# securit%#
nei'h"our isco!er%# auto-con(i'uration# routin'/ Chan'es to other &rotocols/ A&&lication Pro'rammin' Inter(ace (or
IP!6# 6"one/ IP Multicastin'# 1ie area multicastin'# relia"le multicast/ Routin' la%er issues# I6Ps an &eerin'# $*P#
I*P# Tra((ic 8n'ineerin'# Routin' mechanisms: Bueue mana'ement# &ac4et scheulin'/ MPL6# IP+s
%odule , ("! (T) 1 2()) 'ours)& TCP e7tensions (or hi'h-s&ee net1or4s# transaction-oriente a&&lications/ +e1
o&tions in TCP# TCP &er(ormance issues o!er 1ireless net1or4s# 6CTP# ,CCP/
%odule + (" (T) 1 2()) 'ours)& ,+6 issues# other namin' mechanisms# o!erla% net1or4s# &=& net1or4s# 1e" ser!er
s%stems# 1e" =/0# Internet tra((ic moellin'# Internet measurements/ 6ecurit% 9 <ire1alls# -ni(ie threat Mana'ement
6%stem# +et1or4 Access Control/
References&
1/ Arian <arrel# The Internet an its &rotocols a com&arati!e a&&roach# 8lse!ier# =005
=/ M/ *onsal!es an A/ +iles/PIP!6 +et1or4s# Mc*ra1 Hill# 1FFD/
3/ ./ R/ 6te!ens# TCPEIP Illustrate# Iolume 1: The &rotocols# Aison .esle%# 1FF>/
>/ */ R/ .ri'ht# TCPEIP Illustrate# Iolume =: The Im&lementation# Aison .esle%# 1FF5/
5/ ./ R/ 6te!ens# TCPEIP Illustrate# Iolume 3: TCP (or Transactions# HTTP# ++TP# an the -ni7 ,omain
Protocols# Aison .esle%# 1FF6/
6/ Articles in !arious :ournals an con(erence &roceein's/
@/ R<Cs an Internet ,ra(ts# a!aila"le (rom Internet 8n'ineerin' Tas4 <orce/
CS+!*! DES(/0 #0D #0#-5S(S .3 #-/.R(T'%S
Pre-requisite: C6=005 ,ata 6tructures ? Al'orithms
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
Anal%sis: RAM moel - "i' Ch - "i' Cme'a 9 As%m&totic Anal%sis# recurrence relations# &ro"a"ilistic anal%sis -
linearit% o( e7&ectations - 1orst an a!era'e case anal%sis o( sortin' al'orithms# "inar% search - hashin' al'orithms -
lo1er "oun &roo(s (or the a"o!e &ro"lems - amorti;e anal%sis - a''re'ate - accountin' an &otential methos -
anal%sis o( Anuth-Morris-Pratt al'orithm - amorti;e 1ei'ht "alance trees

%odule ("! (T) 1 2()) 'ours)
Pro"lem 6ol!in'# Classical Al'orithm &arai'ms#: i!ie an conquer - 6trassenKs al'orithm# C2n5 meian (inin'
al'orithm - %namic &ro'rammin' - matri7 chain multi&lication - o&timal &ol%'on trian'ulation - o&timal "inar%
search trees - <lo%-.arshall al'orithm - CJA al'orithm - 'ree% - Hu((man coin' - Ana&sac4# Arus4alKs an PrimKs
al'orithms (or M6T - "ac4trac4in' - "ranch an "oun - tra!elin' salesman &ro"lem - matrois an theoretical
(ounations o( 'ree% al'orithms
%odule , ("! (T) 1 2()) 'ours)
Com&le7it%: com&le7it% classes - P# +P# Co-+P# +P-Har an +P-com&lete &ro"lems - coo4Ks theorem- +P-
com&leteness reuctions (or clique - !erte7 co!er - su"set sum - hamiltonian c%cle - T6P - inte'er &ro'rammin' -
a&&ro7imation al'orithms - !erte7 co!er - T6P - set co!erin' an su"set sum

%odule + (" (T) 1 2()) 'ours)
Pro"a"ilistic al'orithms: &seuo ranom num"er 'eneration methos - Monte Carlo al'orithms - &ro"a"ilistic countin'
- !eri(%in' matri7 multi&lication - &rimalit% testin' - Miller Ra"in test - inte'er (actori;ation - Pollar)s rho heuristic -
am&li(ication o( stochastic a!anta'e - a&&lications to cr%&to'ra&h% - interacti!e &roo( s%stems - les !e'as al'orithms -
ranomi;e selection an sortin' - ranomi;e solution (or ei'ht queen &ro"lem - uni!ersal hashin' - ,i7on)s inte'er
(actori;ation al'orithm
References&
1/ Cormen T/H/# Leiserson C/8# Ri!est R/L/ an 6tein C# Introuction to Al'orithms# Prentice Hall Inia# 3Ee# =010
=/ Mot1ani R an Ra'ha!an P/# Ranomi;e Al'orithms# Cam"ri'e -ni!ersit% Press# =001
3. Anan% Le!itin# Introuction to the ,esi'n ? Anal%sis o( Al'orithms# Pearson 8ucation/ =003
4. $asse 6/# Com&uter Al'orithms: Introuction to ,esi'n An Anal%sis# Aison .esle%/
5. Man"er -/# Introuction to Al'orithms: A Creati!e A&&roach# Aison .esle%
6/ Aho A/ I/# Ho&cro(t 0/ 8/ ? -llman 0/ ,/# The ,esi'n An Anal%sis o( Com&uter Al'orithms# Aison
.esle%

CS+!*" C.D(0/ T'E.R5
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
Linear Coes: Re!ie1 o( linear al'e"ra - Linear coes an s%nrome ecoin'/ *enerator an &arit% chec4 matrices/
Hammin' 'eometr% an coe &er(ormance/ Hammin' coes/ 8rror correction an conce&t o( hammin' istance/
%odule ("! (T) 1 2()) 'ours)
C%clic coes: $CH coes# Ree-6olomon coes 9 Pol%nomial time ecoin'/ 6hi(t re'ister encoers (or c%clic coes/
C%clic hammin' coes/ ,ecoin' $CH 9 4e% equation an al'orithms/ $erle4am&Ks Iterati!e ecoin' Al'orithm/
%odule , ("! (T) 1 2()) 'ours)
Con!olutional coes : Iiter"i ecoin'/ Conce&t o( (or1ar error correction/ 6tate ia'ram# trellises/
Conce&t o( s&ace time coes/ 6&ace Time Trellis coes/ Path enumerators an &roo( o( error "ouns/
A&&lications to 1ireless communication/
%odule + (" (T) 1 2()) 'ours)
Coes on *ra&hs: Conce&t o( 'irth an minimum istance in 'ra&h theoretic coes/ 87&aner *ra&hs an Coes 9
linear time ecoin'/ $asic e7&aner "ase construction o( list ecoa"le coes/ 6i&ser 6&ielman al'orithm/ $ounin'
results/
References&
1/ R/ 0ohannesson an A/ 6h/ Hi'an'iro!# <unamentals o( Con!olutional Coin'# .ile%-I888 Press# 1FFF/
=/ ./ C/ Hu((man an I/ Pless# <unamentals o( error correctin' coes# Cam"ri'e -ni!ersit% Press# =003/
3/ !an Lint 0/ H/ An Introuction to Coin' Theor%# 2=Ee5/ +e1 Jor4: 6&rin'er-Ierla'# 1FF=/
>/ R/0/ Mc8liece# The Theor% o( In(ormation an Coin'# Aison .esle%# 1FF@/
CS+!* -./(C 3.R C.%)4TER SC(E0CE
Pre-requisite: +il
L T P C
3 0 = >
Total Hours: @0 Hrs
%odule " ("! (T) 1 2()) 'ours)
Pro&ositional lo'ic# s%nta7 o( &ro&ositional lo'ic# semantics o( &ro&ositional lo'ic# truth ta"les an tautolo'ies# ta"leaus#
sounness theorem# (inishe sets# com&leteness theorem/
%odule ("! (T) 1 2()) 'ours)
Preicate lo'ic# s%nta7 o( &reicate lo'ic# (ree an "oun !aria"les# semantics o( &reicate lo'ic# 'ra&hs# ta"leaus#
sounness theorem# (inishe sets# com&leteness theorem# equi!alence relations# orer relations# set theor%/
%odule , ("! (T) 1 2()) 'ours)
Linear time Tem&oral Lo'ic2LTL5# s%nta7 o( LTL# semantics o( LTL# $uchi Automata# $uchi reco'ni;a"le lan'ua'es
an their &ro&erties# Automata theoretic methos# Iari-.ol&er Construction# 6atis(ia"ilit% &ro"lem o( LTL# Moel
chec4in' &ro"lem o( LTL/
%odule + (" (T) 1 2()) 'ours)
6o(t1are Ieri(ication: Introuction to Tools use (or so(t1are !eri(ication - 6PI+ an 6MI# Metho o( !eri(ication "%
the tools/
References&
1. 0erome Aeisler an H/ 0oel Ro""in# Mathematical Lo'ic an Com&uta"ilit%# Mc*ra1-Hill International
8itions# 1FF6
2. Pa&aimitriou/ C/ H/# Com&utational Com&le7it%# Aison .esle%# 1FF>
3. *allier# 0/ H/# Lo'ic (or Com&uter 6cience: <ounations o( Automatic Theorem Pro!in'# Har&er an Ro1#
1FD6/
CS,!7" C.%)(-ER -#B.R#T.R5
Pre-requisite: +il
L T P C
1 0 3 3
Total Hours: 56 Hrs
Theory ("+ 'ours) )ractical (+ 'ours)
%odule " ( (T) 1 :()) 'ours)
*eneration o( le7ical anal%;er usin' tools such as L8Q
%odule (: (T) 1 "+()) 'ours)
*eneration o( &arser usin' tools such as JACC/ Creation o( A"stract 6%nta7 Tree
%odule , (, (T) 1 "!()) 'ours)
Creation o( 6%m"ol ta"les/ 6emantic Anal%sis/
%odule + (, (T) 1 "()) 'ours)
*eneration o( tar'et coe/
References&
1. ./ A&&el# Moern Com&iler Im&lementation in C # Cam"ri'e -ni!ersit% Press# 1FFD/
2. I/ Aho# M/ 6/ Lam# R/ 6ethi# 0/ ,/ -llman# Com&ilers- Princi&les# Techniques ? Tools 2=Ee5# Pearson
8ucation# =00@/
CS,!7 .)ER#T(0/ S5STE%S -#B.R#T.R5
Pre-requisite: +il
L T P C
1 0 3 3
Total Hours: 56Hrs
Theory ("+ 'ours)
-ni7 s%stem &ro'rammin' (unamentals an s%stem calls/
)ractical (+ 'ours)
Linu7 shell &ro'rammin'# Inter &rocess communication-Pi&es# sema&hores# 6hare memor% an Messa'e &assin'
Loain' e7ecuta"le &ro'rams into memor% an e7ecute 6%stem Call im&lementation-rea25# 1rite25# o&en 25 an close25
Multi&ro'rammin'-Memor% mana'ement- Im&lementation o( <or425# .ait25# 87ec25 an 87it25 6%stem calls
6u&&ort (or so(t1are TL$- TL$ im&lementation 9 im&lementation o( LR- re&lacement al'orithm
<ile s%stem im&lementation-eman &a'in' - &a'e (ault e7ce&tion 9 &a'e re&lacement &olic%
Im&lementation o( 6%nchroni;ation &rimiti!es -6ema&hore# Loc4s an Conitional Iaria"les
$uil +et1or4in' (acilities - Mail"o7
References&
1/ *ar% 0/ +utt# C&eratin' 6%stems# Pearson 8ucation# 3Ee# =00>/
=/ ,aniel P $o!et # Marco Cesati # -nerstanin' the Linu7 Aernel# CKReill% Meia# 23Ee5# =005
3/ Course .e" &a'e
CS,!7, 0ET=.R?S -#B.R#T.R5
Pre-requisite: +il
L T P C
1 0 3 3
Total Hours: 56 Hrs
Theory ("+ 'ours)& Introuction# C!er!ie1 o( -ni7 Pro'rammin' 8n!ironment# -ni7 Pro'ramin' Tools#
Introuction to Com&uter +et1or4in' an TCPEIP# Introuction to 6oc4et Pro'rammin'# TCP 6oc4ets an Concurrent
6er!ers# Threas# IEC Multi&le7in' an 6oc4et C&tions# -,P 6oc4ets an +ame an Aress Con!ersions# ,aemon
Processses an Inet 6u&erser!er# A!ance IEC an Timeouts# +on-"loc4in' 6oc4ets# -ni7 ,omain 6oc4ets#
$roacastin'# Multicastin'# A!ance -,P 6oc4ets# Ioctl C&erations/
Introuction to o&en source (ire1all &ac4a'es/ Introuction to net1or4 emulators an simulators/
)ractical (+ 'ours)
87&eriment 1: Im&lementation o( "asic Client 6er!er &ro'ram usin' TCP 6oc4et 28'/ ,a% time ser!er an clent5/
87&eriment =: Im&lementation o( "asic Client 6er!er &ro'ram usin' -,P 6oc4et/
87&eriment 3: Im&lementin' a &ro'ram 1ith TCP 6er!er an -,P Client/
87&eriment >: Im&lementation o( TCP Client 6er!er &ro'ram 1ith concurrent connection (rom clients/
87&eriment 5: Im&lementin' (ull% concurrent a&&lication 1ith a TCP ser!er actin' as a irector% ser!er an client
&ro'rams allo1in' concurrent connection an messa'e trans(er 28'/ Chat s%tem5/
87&eriment 6: <ull% ecentrali;e a&&lication li4e a Peer to Peer s%stem/ This &ro'ram is to im&lement 1ithout a
esi'nate 6e!er as in the case o( e7&eriment 5/
87&eriment @: 87&eriments 1ith o&en source (ire1allE&ro7% &ac4a'es li4e i&ta"les#u(1# squi etc/
87&eriment D: 87&eriments 1ith 8mulator li4e +et4it# 8mula" etc/
87&eriment F: 87&eriments 1ith 6imulator li4e +6=# +CT- +6 etc/
References&
1. ./ RRchar 6te!ens# -ni7 +et1or4 Pro'rammin' 9 +et1or4in' APIs: 6oc4ets an QTI Iolume 1# =
n
8ition#
Pearson 8ucation# =00>/
2. ./ RRchar 6te!ens# -ni7 +et1or4 Pro'rammin' 9 Inter&rocess Communications Iolume =# =
n
8ition#
Pearson 8ucation# =00>/
3. .arren ./ *a%# Linu7 6oc4et Pro'rammin' "% 87am&le# 1
st
8ition# Bue Press# =000/
4. $rian Hall# $ee:Ks *uie to +et1or4 Pro'rammin'# htt&:EE"ee:/usE'uieE"'netE
5. 8lliotte Rust% Harol# 0a!a +et1or4 Pro'rammin'# 3
r
8ition# C)Reill%# =00>/
6/ ,ou'las C/ 6chmit# an 6te&hen ,/ Huston# CMM +et1or4 Pro'rammin'# Iolume =# Aison-1esle%# =003
CS,!7+ )R./R#%%(0/ -#0/4#/ES -#B.R#T.R5
Pre-requisite: +il
L T P C
1 0 3 3
Total Hours: 56 Hrs
Theory ("+ 'ours)
<unctional &ro'rammin' (ounations re!ie1/
)ractical (+ 'ours)
%odule " (* (T) 1 "()) 'ours)
Introuction to (unctional &ro'rammin'/ Inter&reter (or the lan'ua'e o( unt%&e arithmetic e7&ressions/
%odule (, (T) 1 "()) 'ours)
Inter&reter (or the lan'ua'e o( -nt%&e Lam"a Calculus
%odule , (, (T) 1 7()) 'ours)
Inter&reter (or the lan'ua'e o( T%&e arithmetic e7&ressions/
%odule + (, (T) 1 7()) 'ours)
Inter&reter (or 6im&l% T%&e Lam"a Calculus an its e7tensions/
References&
1. $en:amin C/ Pierce# T%&es an Pro'rammin' Lan'ua'es # MIT Press# =00=/
CS,!7* D#T#B#SE %#0#/E%E0T S5STE%S -#B.R#T.R5
Pre-requisite: +il
L T P C
1 0 3 3
Total Hours: 56 Hrs
Theory ("+ 'ours)
6tu% o( Post'res 6BL# PLE6BL &ro'rammin' an 0,$C/ Conce&ts o( !ie1s# scri&ts# tri''ers an transactions# 6BL
,$A# PHP# 8cli&se/ 6er!lets
)ractical (+ 'ours)
La"orator% e7ercises 1hich inclue e(inin' schemas (or a&&lications# creation o( a ata"ases# 1ritin' 6BL an
PLE6BL queries# to retrie!e in(ormation (rom the ata"ases# use o( host lan'ua'es# inter(ace 1ith em"ee 6BL# use
o( (orms ? re&ort 1ritin' &ac4a'es a!aila"le 1ith the chosen R,$M6 &rouct &re(era"l% Post'res 6BL Pro'rammin'
e7ercises on usin' scri&tin' lan'ua'es li4e PHP# *i!in' 1e" inter(aces (or "ac4 en ata"ase a&&lications/
87ercises on Pro'rammin' in 0a!a (or connectin' Post'res 6BL ata"ases usin' 0,$C/
87ercises on creatin' 1e" &a'e inter(aces (or ata"ase a&&lications usin' ser!lets/

References&
1. A!i 6il"erschat;# Han4 Aorth# an 6/ 6uarshan# ,ata"ase 6%stem Conce&ts# 25Ee5# Mc*ra1 Hill# =005
=/ R/ 8lmasri an 6/ +a!athe# <unamentals o( ,ata"ase 6%stems# Aison .esle% # 25Ee5 # =00@
CS,!7: C.%)4T#T(.0#- (0ETE--(/E0CE -#B.R#T.R5
Pre-requisite: +il
L T P C
1 0 3 3
Total Hours: 56 Hrs
Theory ("+ 'ours)
State Space Search, Two-agent Games, Logic, Machine Learning
)ractical (+ 'ours)
State Space Search Water Jug Problem, Missionaries and cannibals, Tower of HANOI, Eight puzzle, Implementation
of these problems using both uninformed and informed search. BFS, DFS, Best First Search, A*
Two-agent Games Tic-Tac-Toe using Min-Max search and Alpha-Beta pruning, Constraint Satisfaction Problems
N-Queens using Heuristic repair and constraint propagation
Logic-Unification, Resolution,Answer Extraction Using Resolution
Machine Learning Decision Tree, Candidate Elimination, Clustering (K-means), Neural net learning (Perceptron),
Genetic algorithms (2SAT), Expert Systems, Natural Language Processing
References&
1.George F Luger, Artificial Intelligence- Structures and Strategies for Complex Problem Solving, 4/e, 2002, Pearson
Education.
2. E. Rich, K.Knight, Artificial Intelligence, 2/e, Tata McGraw Hill
3. S Russel, P Norvig, Artificial Intelligence- A Modern Approach, 2/e, Pearson Education, 2002
3. Winston. P. H, LISP, Addison Wesley
4. Ivan Bratko, Prolog Programming for Artificial Intelligence, 3/e, Addison Wesley, 2000
CS,!72 =EB )R./R#%%(0/ -#B.R#T.R5
Pre-requisite: +il
L T P C
1 0 3 3
Total Hours: 56 Hrs
Theory ("+ 'ours)
Re!ie1 o( "asic technolo'ies an conce&ts in .e" Pro'rammin'
)ractical (+ 'ours)
$asic 1e" client: Client &ro'rammin'# &rocessin' an &arsin' ata 1hen reain' (rom a net1or4
soc4et - "asics o( the HTTP &rotocol/
$asic 1e" ser!er: Client-ser!er &ro'rammin' - Im&lement a &rotocol/ 1/0 s&eci(ication o( HTTP -
conitional 'et an coo4ies/
Concurrent 1e" ser!er: Moi(%in' 1e" ser!er (or &ool o( threas - sema&hores to s%nchroni;e access
to share memor%/
Per(ormance e!aluation: .or4loa 'eneration# an &er(ormance e!aluation/ &er(ormance
im&ro!ement 'aine "% usin' threas - o&timi;ation/
Peer-to-&eer 1e" "ro1ser: Peer-to-&eer &ro'rammin' 9 "uilin' a istri"ute s%stem/ Peer to &eer (ile
sharin' 9 s%nchroni;ation similar to $itTorrent trac4er/ Buanti(%in' scala"ilit%/
Com&lete 1e" a&&lication: ,e!elo&in' a ata"ase-ri!en com&lete 1e" a&&lication (ollo1in' 6,LC/
,ata"ase "ac4en 2sa% M%6BL5 9 a&&lication in PHP E Rails/
References&
1/ 6am Ru"%# ,a!e Thomas an ,a!i Heinemeier Hansson/ A'ile .e" ,e!elo&ment 1ith Rails 23Ee5#
Pra'matic Pro'rammers# =00F/
=/ Hu'h 8/ .illiams an ,a!i Lane/ .e" ,ata"ase A&&lications 1ith PHP an M%6BL 2=Ee5# CKReill% ?
Associates# Ma% =00>
CS+!7" B(.C.%)4T(0/ -#B.R#T.R5
Pre-requisite: +il
L T P C
1 0 3 3
Total Hours: 56Hrs
%odule " (, (T) 1 "! ()) 'ours)
<amiliari;ation 1ith $ioin(ormatics Resources: -nerstanin' o( "iolo'ical ata"ases S*en$an4# 8M$L# ,,$0# P,$#
PIR# 61issProtT# Retrie!in' an anal%;in' !arious t%&es o( ata (rom these ata"ases# 6tu% o( sequence ali'nment tools
2"oth stanalone an online !ersions5 S,otPlot# Clustal# $LA6T# <A6TAT# 6tu% o( PHJLIP/
%odule (, (T) 1 "! ()) 'ours)
Introuction to $io-&ro'rammin' lan'ua'es: $ioPerl# $ioP%thon# $io0a!a/
%odule , (, (T) 1 "! ()) 'ours)
6tu% o( *enomics an Proteomics Tools: .or4in' 1ith *enscan# 6tu% o( molecular !isuali;ation tools SRasmol#
,ee& Iie1T# 6tu% o( Protein structure &reiction tools S6CCP# MC,8LL8R# I-TA668RT
%odule + (* (T) 1 " ()) 'ours)
Im&lementation o( al'orithms in $ioin(ormatics: 6equence anal%sis an ali'nment# Moti( (inin'# Protein structure
&reiction# Construction o( Ph%lo'enetic trees/
References&
1 +eil C 0ones an Pa!el A Pe!;ner# An Introuction To $ioin(ormatics Al'orithms# MIT Press# Au'ust =00>/
2 = Richar 8rnest $ellman# ,%namic Pro'rammin'# Princeton -ni!ersit% Press# =003/
3 ,an *us(iel# Al'orithms Cn 6trin's# Trees# An 6equences# Cam"ri'e -ni!ersit% Press# 1FF@/
4 *ar% $enson an Roeric Pa'e# Al'orithms In $ioin(ormatics# 6&rin'er# Iol =D1=# =003/
CS+!7 D#T# %(0(0/ -#B.R#T.R5
Pre-requisite: +il
L T P C
1 0 3 3
Total Hours: 56 Hrs
Theory ("+ 'ours) 1 )ractical (+ 'ours)
Introuction to 6cila" Matri7 o&erations# Plottin' (unctions# contours 2=2T5M62P5Hours5
Classi(ication $a%esian classi(ier# Perce&tron # 6u&&ort Iector Machine232T5M1=2P5 Hours5
Clusterin' A-means an 8M Clusterin' 232T5M62P5 Hours5 Association rule minin' 2=2T5M62P5 Hours5
<eature selection 2=2T5M62P5 Hours5 Introuction to .e4a 2=2T5M62P5 Hours5
References&
1/ Pan'-+in' Tan#Michael 6tein"ach an Ii&in Aumar Introuction to ,ata Minin'# Pearson 8ucation =006/
=/ Han an Aam"er# ,ata Minin': Conce&ts an Techniques# 2=Ee5# Mor'an Aau(mann
CS+!7, (%#/E )R.CESS(0/ -#B.R#T.R5
Pre-requisite: +il
L T P C
1 0 3 3
Total Hours: 56 Hrs
Theory ("+ 'ours)
An introuction to i'ital ima'es- sam&lin'# quanti;ation/ $asic ima'e &rocessin'# arithmetic &rocessin'/ Ima'e
enhancement an &oint o&eration/ Ima'e enhancement an s&atial o&eration/ Color ima'es an moels moels/
<requenc% omain o&erations/
)ractical (+ 'ours)
La"1: An introuction to i'ital ima'es- sam&lin'# quanti;ation# Ima'e re-sam&lin'# Ima'e &ro&erties: "it-e&th
La"=: $asic ima'e &rocessin'# arithmetic &rocessin'
La"3: Ima'e enhancement an &oint o&eration- Linear &oint o&eration# cli&&in'# thresholin'# ne'ation# non-linear
ma&&in'# intensit% slicin'# ima'e histo'ram# histo'ram equali;ation/
La">: Ima'e enhancement an s&atial o&eration- Con!olution# correlation# linear (ilterin'# e'e etection/
La"5: Color ima'es- color moels# color enhancement# color thresholin'/
La"6: <requenc% omain o&erations- (ourier trans(orm# (req omain (ilterin'
References&
1/ Ra(ael C/# *on;ale; ? .oos R/8/# ,i'ital Ima'e Processin'# Aison .esle%# =00@/
=/ 0ain A/A# <unamentals o( ,i'ital Ima'e Processin'# Prentice Hall# 8n'le1oo Cli((s# =00=/
3/ 6chal4o(( R/ 0/# ,i'ital Ima'e Processin' an Com&uter Iision# 0ohn .ile%# =00>/
CS+!7+ C.%)4TER 8(S(.0 -#B.R#T.R5
Pre-requisite: +il
L T P C
1 0 3 3
Total Hours: 56 Hrs
Theory ("+ 'ours)
8'e o&erations: Iarious e'e o&erators/
6e'mentation an clusterin' techniques an a&&lications/
Colourin' an color ima'e &rocessin'/ C":ect etection an classi(ication/
Com&utation o( 3, scene (rom =,/

)ractical (+ 'ours)
MatLa" im&lementation (or the (ollo1in':
1/ 8'e o&erations:
=/ 6e'mentation: "% clusterin'# se'mentation "% (ittin' moels-Iision a&&lications/
3/ Colourin' techniq ues# Pseuo-colourin'#
>/ Colour ima'e anal%sis/
5/ C":ect etection an classi(ications
6/ Com&utation o( 3, scene (rom =,/

References&
1/ ,a!i A <ors%nth an 0ean Ponce 2=0035# Com&uter Iision- A moern a&&roach# Pearson eucation series#
=003/
=/ Milan 6on4a# Iacla! Hla!ac an Ro'er $o%le 2=00D5# ,i'ital ima'e &rocessin' an com&uter !ision# Cen'a'e
learnin'# =00D
3. 6chal4o(( R/ 0/# ,i'ital Ima'e Processin' an Com&uter Iision# 0ohn .ile%# =00>/
CS+!7* C.%)4TER /R#)'(CS -#B.R#T.R5
Pre-requisite: +il
L T P C
1 0 3 3
Total Hours: 56 Hrs
Theory ("+ 'ours)
C&en*L &ro'rammin' - constructs an stanars/
)ractical (+ 'ours)
,ra1in' *eometric Primiti!es - case stuies/
Create sim&le moels/
Interacti!e Trans(ormations an Pro:ections
Parsin' sim&le mesh (ile (ormats
Renerin' meshes/
Case 6tu%: Moel a scene# Place li'hts on the scene# rener shao1s an te7ture moels/
References&
1. ,/ 6hreiner# M/ .oo# 0/ +eier an T/ ,a!is# C&en*L Pro'rammin' *uie# Aison .esle%# =005/
CS+!7: S.3T=#RE E0/(0EER(0/ -#B.R#T.R5
Pre-requisite: C6300> 6o(t1are 8n'ineerin'
L T P C
1 0 3 3
Total Hours: 56 Hrs
Theory ("+ 'ours)
Introuctor% Lectures on the use o( a&&ro&riate tools is to "e 'i!en/
Peer re!ie1 iscussions o( eli!era"les 1ill also "e one in theor% sessions/
)ractical (+ 'ours)
C":ecti!e is to e!elo& a si'ni(icant so(t1are &rouct usin' soun so(t1are en'ineerin' &rinci&les "% small stuent
'rou&s/ Choice o( a&&ro&riate methoolo'% an stanar tools are also e7&ecte/ The la" 1ill ha!e eli!era"les at each
milestone o( e!elo&ment/
1/ Pro"lem 6tatement E Prouct 6&eci(ication
=/ Pro:ect Plan 9 Pro:ect Mana'ement Tool to "e ienti(ie an 8stimation an Costin' to "e one/
3/ Requirements ,ocument 9 6&eci(ication Tool choice to "e :usti(ie - In class Re!ie1
>/ ,esi'n ,ocument 9 Choice o( Methoolo'% to "e :usti(ie - In class Re!ie1
5/ Coe an Test Re&ort 9 Peer re!ie1 ocuments o( stanars aherence to "e &ro!ie
6/ ,emo 9 Inte'rate Prouct or 6olution to the &ro"lem
@/ Re!ie1 o( the &rocess an anal%sis o( !ariation (rom initial &lan an estimation/
References&
1. Ro'er 6 Pressman# 6o(t1are 8n'ineerin': A Practitioner)s A&&roach 26Ee/5# Mc *ra1 Hill# =00D/
CS+!72 .BDECT .R(E0TED )R./R#%%(0/ -#B.R#T.R5
Pre-requisite: +il
L T P C
1 0 3 3
Total Hours: 56 Hrs
Theory ("+ 'ours)
Proceural !s/ C":ecte oriente a&&roaches 9 Conce&t o( A"straction - ,esi'n an anal%sis usin' CC methoolo'ies/
Introuction to -ML/
)ractical (+ 'ours)
The im&lementation has to "e one usin' lan'ua'es li4e CMME0a!aECU/
Pro'rams to stu%
<unctions 9 Control structures 9 6trin' hanlin' 9 <ile hanlin'
8rror an 87ce&tion hanlin'
Class 9 C":ects 9Instantiation
Princi&les o( Inheritance# 8nca&sulation# Pol%mor&hism 9 C!erloain'# Iirtual (unctions
CC ,esi'n 1ith stress on inter(ace s&eci(ication/ Automate coe 'eneration an com&onent reuse - -ML
References&
$ 6troustru&# The CMM Pro'rammin' Lan'ua'e 23Ee5/ Aison .esle%# 1FF@/
6te!e Cualline# Practical CMM Pro'rammin' 2=Ee5/ CKReill% ? Associates# =00=/
0 +ino an < A Hosch# An introuction to &ro'rammin' an o":ect oriente esi'n usin' 0a!a/ .ile% Inia# =010

Das könnte Ihnen auch gefallen