Syllabus for ME (Computer Engineering)

Course 2013 (w.e.f 2013)

Subject
Code Subject
Teaching
Scheme
Hrs/Week
Examination Scheme Credits
Lect. Pract
Paper
Tw Ora/P
resenta
tion
!arks
"n
Semest
er
#ssess
ment
End
Semest
er
#ssess
ment
SE! $ "
%&'&'& Applied Algorithms 04 50 50 100 (
%&'&') High Performance Databases 04 50 50 100 (
%&'&'* Advanced Computer Architecture 04 50 50 100 (
%&'&'( Research ethodolog! 04 50 50 100 (
%&'&'% "lective #$ 05 50 50% 100 %
%&'&'+ &aborator! Practice'$ 04 50 50 100 (
Tota )& '( )%' )%' %' %' +'' )%
Subject
Code
Subject
Teaching
Scheme
Hrs/Week
Examination Scheme
Credits
Lect. Pract Pa,er Tw
Ora/Pre
sentation !arks
"n
Semes
ter
#ssess
ment
End
Semes
ter
#ssess
ment
SE!$ ""
%&'&'- (perating )!stem Design 04

50 50

100
(
%&'&'. )oft*are Design and Architecture 04

50 50

100
(
%&'&'/ #d0anced Com,uter 1etworks 04

50 50

100
(
%&'&&' "lective #$$ 05

50 50%

100
%
%&'&&& &aborator! Practice'$$
04

50
50 100
(
%&'&&) )eminar'$
04

50
50 100
(
Tota
&- '. )'' )'' &'' &'' +'' )%
Subject
Code
Subject
Teaching
Scheme
Hrs/Week
Examination Scheme
Credits
Lect. Pract Pa,er Tw
Ora/Pre
sentation !arks
"n
Semes
ter
#ssess
ment
End
Semes
ter
#ssess
ment
SE!$ """
+&'&'&
#d0anced Storage S2stems and
"n3rastructure !anagement
04

50 50

100
(
+&'&') #d0anced 4nix Programming 04

50 50

100
(
+&'&'* "lective'$$$ 05

50 50%

100
(
+&'&'( )eminar #$$ 04

50 50 100
%
+&'&'% Dissertation )tage # $ 0+ 50 50 100
.
Tota
&- '. &%' &%' &'' &'' %'' )%
Subject
Code
Subject
Teaching
Scheme
Hrs/Week
Examination Scheme
Credits
Lect. Pract Pa,er Tw
Ora/Pre
sentation !arks
"n
Semes
ter
#ssess
ment
End
Semes
ter
#ssess
ment
SE!$ "5
+&'&'+ )eminar #$$$ 05 50 50 100
%
+&'&'- Dissertation )tage # $$ ,0 150 50 ,00
)'
Tota
)% )'' &'' *'' )%
67 8e3. 8ue 89&.* 3or Examination 8ues o3 :Rules and Regulations for M.E. Programs
under faculty of Engineering effective from June 2013;.
Eecti0es7
Eecti0e " Eecti0e ""
%&'&'%#
"nteigent S2stems
%&'&&'#
<usiness "nteigence and =ata !ining
%&'&'%<
"8 and Web !ining
%&'&&'<
4sabiit2 Engineering
%&'&'%C
!achine Learning and Transation
%&'&&'C
#d0anced Com,ier =esign
%&'&'%=
O,en Eecti0e /8ea Time S2stems
%&'&&'=
O,en Eecti0e/ Embedded S2stem =esign
Eecti0e """ 1on Credit Courses
+&'&'*#
1etwork Securit2
Semester 9"
C2ber Securit2
+&'&'*<
Coud Com,uting
Semester9""
"n3ormation and C2ber War3are
+&'&'*C
Com,uter 5ision and Pattern
8ecognition
Semester9"""
<io9!etrics and C2ber Securit2
+&'&'*=
O,en Eecti0e/ So3t Com,uting
Semester 9"5
C2ber >orensics and "n3ormation
Securit2
-he dissertation must result into the publication of at least t*o research papers .at )tage#$ and )tage'$$ respectivel!/
preferabl! in the 0ournal having Citation $nde1 ,20 and $))3 number4 or paper can be published in reputed $nternational
0ournal recommended b! the guide of the Dissertation and the 5o) supported cP6C(3 event for paper presentation and
participation2 -he guides certificate covering originalit! of the *or7 and plagiarism'testing result shall be included in the
report along *ith the Published 0ournal Papers and2 cP6C(3 paper presentation and participation certificates2 -he
comments received b! the 8ournal paper revie*ers be attached in the Dissertation report and shall be made available during
dissertation presentation9viva to the e1aminers2
1ote &7 8e3er 89).- 3or Examination 8ues o3 :Rules and Regulations for M.E. Programs under faculty of
Engineering effective from June 2013. 1on9credit courses are mandator2 3or the grant o3 the term and
sha be com,eted b2 the students as a se3 stud2 either b2 re3erring to the Hand books?
@ourna/Con3erence ,a,ers Aateast )% in numberB? o,en source so3tware? toos and in addition ma2 be b2
organiCing educationa 0isits to the technoogica/,ro3essiona centers in the subject? if any. Each student is
reDuired to ,roduce in own words? one &' ,ages inno0ati0e? technica ,a,er to be submitted as a ,art o3 the
semester course work o3 non9credit courses.
%&'&'&9 #,,ied #gorithms
Teaching Scheme Examination Scheme
Lectures7 (Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '(
Objecti0es
-his course covers selected topics in algorithms that have found applications in areas
such as geometric modeling: graphics: robotics: vision: computer animation: etc2
-he course ob8ective is to teach problem formulation and problem solving s7ills2
-he course aims at 7eeping a sound balance bet*een programming and anal!tical
problem solving2
4nit ". #na2sis o3 #gorithms
Revie* of algorithmic strategies: As!mptotic anal!sis; upper and lo*er comple1it!
bounds2 $dentif!ing differences among best: average and *orst Case 5ehaviors2 5ig (:
little (: omega and theta notations: )tandard comple1it! classes2 "mpirical measurements of
performance2 -ime and space trade'offs in algorithms2 Anal!<ing recursive algorithms using
recurrence relations2
4nit "". >undamenta Com,uting #gorithms
3umerical algorithms: )e=uential and binar! search algorithms2 >uadratic sorting algorithms
and ( .n log n/ sorting algorithms2 Algorithms on graphs and their comple1ities using 6reed!
Approach for ''' Prim?s and @rush7al?s Algorithm for minimum spanning tree: )ingle source
shortest path Algorithm: all pair shortest paths in 6raph
4nit """. #,,roximation #gorithms
$ntroduction: Absolute appro1imation: "psilon appro1imation: Pol!nomial time
Appro1imation schemes: probabilisticall! good algorithms2
4nit "5. Eeometric #gorithms
Prere=uisites # 5asic properties of line: intersection of line: line segment: pol!gon:etc2 &ine
segment properties: detaining segment intersection in time comple1it! .n log n/:Conve1 full
problem # formulation: solving b! 6raham scan algorithm: 0arvis march algorithm4 closest pair
of points # problem formulation: solving b! divide A con=uer method2
4nit 5. Linear Programming
)tandard and )lac7 forms: formulation of problems as linear programs: simple1 algorithm:
dualit!: initial basic feasible solution2
Problem formulation for # single source shortest path: ma1imum flo* problem: Berte1 cover
problem: @napsac7 problem2
4nit 5". Probabiit2 <ased #na2sis
"1pectations7 $ntroduction: oments: "1pectations of functions of more than one random
variable: transform methods: moments and transforms of distributions: computation of mean time
to failure: ine=ualities and limit theorems
8e3erence <ooks7
12 @ishore )2 -rivedi: CProbabilit! A )tatistics *ith Reliabilit!: >ueing: and Computer
)cience ApplicationsD PH$
,2 Cormen: &eiserson: Rivest: CAlgorithmsD: PH$
E2 5ressard: CFundamentals of AlgorithmsD: PH$
42 Horo*it<: )ahni: CFundamentals of Computer AlgorithmD: 6algotia
52 )2 5aase: ) and A2 Ban 6elder: GComputer Algorithms; $ntroduction to Design and
Anal!sisG: Erd edition2 Addison Hesle!:,000
I2 Aho: Hopcraft: Jllman: C-he Design and Anal!sis of Computer AlgorithmsD: Addison
Hesle!
K2 @nuth: CArt of ProgrammingD: Addison Hesle!
+2 C Papadimitriou and @ )teiglit<: CCombinatorial (ptimi<ationD: PH$
%&'&') 9 High Per3ormance =atabases
Teaching Scheme Examination Scheme
Lectures7 ( Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '(
41"T ". Ph2sica database design F Tuning
Database *or7loads: ph!sical design and tuning decisions: 3eed for -uning
"ndex seection7 6uideline for inde1 selection: Clustering A $nde1ing -ools for inde1 selection
=atabase Tuning; -uning inde1es: -uning Conceptual schema -uning >ueries Avie*s: $mpact
of Concurrenc!: 5enchmar7ing
41"T "". =istributed =atabases
$ntroduction: Design Frame*or7: Design of database fragmentation: -he Allocation of
Fragments: -ranslation of global =ueries to fragment =ueries: (ptimi<ation of access =ueries:
Distributed -ransaction anagement: Concurrenc! Control: Reliabilit!2
41"T """. #d0ance Transaction Processing
-ransaction Processing onitors: -ransactional Hor7flo*: Real time transaction )!stem: &ong
duration -ransactions: -ransaction anagement in ulti'databases: Distributed -ransaction
anagement: ain emor! Databases: and Advanced -ransaction odels2
41"T "5. Semi9Structured =ata and G!L
)emi')tructured Data: $ntroduction to L&: L& hierarchical odel: D-D A L& schema:
L& 3amespace: L& =uer! A -ransformation; Lpath: L)&-: L>uer!: )torage of L& data:
G!LTechnoogies 7 D( A)AL $nterfaces L pointer: Llin7: LH-&: )(AP: H)D&:
JDD$:L& database Application2
41"T 5. Emerging Trends in =atabases
$ntroduction: otivation: -emporal databases: )patial A geographic databases: ultimedia
Databases: obilit! A personal Databases
41"T 5". #d0anced #,,ication =e0eo,ment
Performance -uning: Performance 5enchmar7s: )tandardi<ation: "'Commerce: &egac! )!stems:
&arge'scale Data anagement *ith HAD((P: )emi structured database C(JCHD5;
$ntroduction: Architecture and principles: features
8e3erences7
Database s!stem Concept b! )ilberschat< And @orth I
th
"dition
Distributed Databases principles A s!stems b! )tefano Ceri: 6iuseppe Pelagatti
Heb Data anagement: Abiteboul: &oana: Philippe "t2 al Cambridge publication
Database )!stems: -homas Connoll!: Carol!n 5egg: Pearson 4
th
"dition
Database anagement )!stems b! Raghu Rama7rishnan and 0ohannes 6ehr7e
%&'&'*9 #d0anced Com,uter #rchitecture
Teaching Scheme Examination Scheme
Lectures7 ( Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '(
4nit H " "ntroduction to architectures and Com,uting !odes
"volution in processor development: 6eneric computer architecture: Data representation:
$nstruction sets: data path and control: memor! management: 5uses and peripherals: 3et*or7ing
and communication: ultiprocessor and multicomputer: multivector and )$D s!stems:
PRA and B&)$ models: net*or7 properties: conditions for parallelisms: partitioning and
scheduling: program flo* mechanisms: s!stem interconnect architectures
4nit H"" Per3ormance metrics
etrics and measures for parallel programs: )peedup performance la*s: scalabilit! anal!sis
approaches: Amdahl?s la*: limitation: 5enchmar7: )$D: $D Performance2
4nit H """ Hardware ,araeism
Processor and memor! hierarch!' Advanced processor technolog!: superscalar and vector
processors: memor! hierarch!: virtual memor!: shared memor! organi<ations: bus s!stems:
consistenc! on shared data: Pipelining' &inear and non linear pipelines: $nstruction pipelines:
instruction and arithmetic pipeline design
4nit H "5 Parae and Scaabe architectures
ultiprocessor and s!stem interconnects: cache coherence and s!nchroni<ation
mechanisms: multicomputer generations: message passing paradigms: ultivector architecture'
principles of vector processing: multivector multiprocessors: compound vector processing: )$D
organi<ation: $D organi<ation: multithread and dataflo* architectures; ultithreading: fine
grained multicomputers: dataflo* and h!brid architectures: )ingle Program'ultiple
Data.)PD/: ultiple Program: ultiple Data.PD/: Case stud! of non'coherent
multiprogramming in PRA
4nit H 5 Parae ,rogramming and ,rogram de0eo,ment en0ironments
Parallel programming models: parallel languages and compilers: dependence anal!sis and
of data arra!s: code optimi<ation and scheduling: loop parallelism and pipelining: Parallel
programming environments: s!nchroni<ation and multiprocessing modes: shared variable
programs: message passing programs: mapping programs on multi'computers2
(perating s!stem support for parallel program e1ecution: processes and threads: parallel
programming languages'C'&inda: Fortran'M0: Programming *ith P$2 $ntroduction to map'
reduce2
4nit H 5" #d0anced Com,uting #rchitectures
>uantum Computing: 5io9olecular Computing: 6rid Computing: 3euro Computing:
Cloud Computing: $ntroduction to 6PJ parallel architecture2
8e3erence <ooks7
12 Computer Architecture and (rgani<ation: iles urdocca: Bincent Heuring' Hile! Publication
,2 Advanced Computer Architecture: @ai H*ang and 3aresh 0ot*ani: c2 6ra*2 Hill Publication
E2 High Performance Computer Architectures b! Harrold )tone
42 Computer Architecture; A >uantitative Approach: 0ohn & Henness!: David a Patterns: 4
th
"dition:
"lsevier: $)53; MKI'I1'E1,'0K,1'0
%&'&'(9 8esearch !ethodoog2
Teaching Scheme Examination Scheme
Lectures7 ( Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '(
(b8ective; to introduce the student to research methodolog!: and to prepare them for
conduct independent research
4nit ". 4nderstand the research ,rocess
"volution of research methodolog!4 eaning: nature: scope: and significance of research4
Research paradigm4 (b8ectives of research: otivation for research4 Postulates underl!ing
scientific investigations4 -!pes of research4 Research process and *or7flo*4 Principles of ethics:
ethical considerations in research4 $ntellectual Propert! Rights .$PR/
4nit "". Probem identi3ication and h2,othesis 3ormuation
)electing an area for research4 Problem identification4 &iterature search4 CJnderstandingD
reported research4 Fitting the pieces4 Ascertaining current state of 7no*ledge4 )ources of
information4 Recording literature search findings4 Defining the problem4 H!pothesis formulation
4nit """. 8esearch design
-!pe of research designs: pitfalls and advantages4 Research approaches4 Principles of
e1perimental design4 Design of e1periments4 Characteristics of good research design4 Jniverse:
population: and sample4 )ampling concepts: principles: and techni=ues4 )ample design .random:
pseudo random: cluster: stratified: multi'stage/4 )ampling considerations .si<e: design: selection:
measurements/4 easures: easurements: etrics: and $ndicators4 easurement scales and
direct measurements
4nit "5. !ethods? toos? and techniDues
Data collection techni=ues .observation: intervie*ing: =uestionnaires: *eb'based: group
techni=ues: e1perimentation: surve!s/4 )ources of errors4 Reliabilit! and validit!4 Probabilit!
theor! and theoretical distributions4 Parametric statistics: )imple linear models .A3(BA:
correlation and Regression: A3AC(BA/: ultivariate anal!sis: )tep'*ise regression4 3on'
parametric statistics: )ign test: Paired ran7ing test: Pearson Correlation: an'Hhitne! J -est:
Chi's=uare test:
4nit 5. =ata ,rocessing and =ata ana2sis
Primar! and secondar! data4 coding and summari<ation of data: =uantification of =ualitative data
.content anal!sis/4 Computation of indirect metrics4 Role of descriptive statistics4 easures of
central tendenc!: dispersion: s7e*ness: 7urtosis4 plots and correlations4 $nferential statistics:
h!pothesis testing: -!pe $ and -!pe $$ errors: Po*er of tests4 Role of computers in research4 Jse
of statistical pac7ages .e2g2 )P))/
4nit 5". 8e,orting research
Dissemination of research findings4 Reporting and interpretation of results4 cautions in
interpretations: -!pe of reports: -!pical report outlines: use of diagrams: tables: and charts4
(ptimi<ation and optimi<ation methods: $ntroduction to game theor!: >ueuing theor!
8e3erences7
12 @othari C2R2: Research ethodolog! .,
nd
"d2/: 3e* Age $nternational: .,004/4
$)53.1E/; MK+'+1',,4'15,,'E
,2 @umar: Ran8it: Research ethodolog! .E
rd
"d/4 )age Publications: ,0114 $5)3; MK+'1'
+4M,'0E01',
E2 5er7man: "lliot -2: A Conceptual 6uide to )tatistics Jsing )P)): )age Publications:
,0114 $)53; MK+'1'41,M'K40I'I
ELECT"5E9"
%&'&'%#9 "nteigent S2stems
Teaching Scheme Examination Scheme
Lectures7 % Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '%
&. "ntroduction
"nteigent #gents7 $ntroduction2 Agents and "nvironments: 6ood 5ehavior; -he Concept of
Rationalit!: -he 3ature of "nvironments: -he )tructure of Agents2
Probem >ormuation7 Problem')olving Agents: "1ample Problems: )earching for )olutions:
Jninformed )earch )trategies: Avoiding Repeated )tates: )earching *ith Partial $nformation2
). Search !ethods
"n3ormed Search and Ex,oration7 $nformed .Heuristic/ )earch )trategies: Heuristic
Functions: &ocal )earch Algorithms and (ptimi<ation Problems: &ocal )earch in Continuous
)paces: (nline )earch Agents and Jn7no*n "nvironments: 6eneric Algorithms for -)P2
Constraint Satis3action Probems7 Constraint )atisfaction Problems: 5ac7trac7ing )earch for
C)Ps: &ocal )earch for Constraint )atisfaction Problems: )tructure of Problems2
*. Panning
-he Planning Problem: Planning *ith )tate')pace )earch: Partial'(rder Planning:
Planning 6raphs: Planning *ith Prepositional &ogic: Anal!sis of Planning Approaches2
(. Panning and #cting in the 8ea Word
-ime: )chedules and Resources: Hierarchical -as7 3et*or7 Planning: Planning and
Acting in 3ondeterministic Domains: Conditional Planning: "1ecution onitoring and Re'
planning: Continuous Planning: ulti'Agent Planning2
%. 4ncertain knowedge and reasoning
Acting under Jncertaint!: 5asic Probabilit! 3otation: Representing @no*ledge in an
Jncertain Domain: -he )emantics of 5a!esian 3et*or7s: "fficient Representation of
Conditional Distributions: "1act $nference in 5a!esian 3et*or7s: Appro1imate $nference in
5a!esian 3et*or7s: "1tending Probabilit! to First'(rder Representations: (ther Approaches to
Jncertain Reasoning2
+. !aking Sim,e FCom,ex =ecisions
Combining 5eliefs and Desires under Jncertaint!: -he 5asis of Jtilit! -heor!: Jtilit!
Functions: ulti'attribute Jtilit! Functions: Decision 3et*or7s: -he Balue of $nformation:
Decision'-heoretic "1pert )!stems: )e=uential Decision Problems: Balue $teration: Polic!
$teration2
8e3erence <ooks7
12 )tuart Russell: Peter 3orvig: CArtificial $ntelligence # A odern ApproachD ,
nd
"dition
Pearson Publication: $)53 3o2MK+'+1'KK5'+EIK'02
,2 Patric7 Henr! Hinston: CArtificial $ntelligenceD: E
rd
"dition2:Pearson Publication: $)53 3o2
MK+'+1'E1K'1505'52
E2 Patric7 Henr! Hinston2: C&isp programming languageD: Pearson Publication2
%&'&'%<9 "8 and WE< !ining
Teaching Scheme Examination Scheme
Lectures7 % Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '%
4nit ". "n3ormation 8etrie0a <asics
6oals and histor! of $R2 -he impact of the *eb on $R2 Components of an $R s!stem:
5oolean and vector'space retrieval models4 ran7ed retrieval4 te1t'similarit! metrics4 -F'$DF
.term fre=uenc!9inverse document fre=uenc!/ *eighting4 cosine similarit!2 )imple to7eni<ing:
stop'*ord removal: and stemming4 inverted indices: $nde1 Construction and compression2
4nit "". "n3ormation 8etrie0a !odes
Probabilistic $nformation Retrieval: &anguage odeling for $nformation Retrieval:
Adhoc Retrieval: &atent )emantic $nde1ing: Relevance feedbac7: Pseudo relevance feedbac7:
>uer! e1pansion: >uer! languages: P() tagging:
4nit """. Web !ining
Heb )tructure: content and usage mining: Heb Cra*ling: $nde1es: )earch engines4
spidering4 metacra*lers4 directed spidering4 lin7 anal!sis .e2g2 hubs and authorities: 6oogle
PageRan7/: $nformation "1traction: spam filtering: L& retrieval2
4nit "5. Per3ormance metrics
Recall: precision: and F'measure4 "valuations on benchmar7 te1t collections: -R"C -rac7s2
)ocial 3et*or7s ; )ocial Heb: 5logs: Hi7is: Forums: )ocial 3et*or7 anal!sis: Recommender
s!stems: $nformation Filtering: Collaborative filtering and content'based recommendation of
documents and products2
4nit 5. Semantic web
Heb E20: (ntolog!: (H&: RDF )chema: ontolog! learning: @no*ledge representation:
management and e1traction: ultimedia Retrieval: Content based $mage retrieval: Pattern
atching and classification for $R2
4nit 5". S,eci3ic to,ics in "8 and Web !ining
Focused Retrieval: -ransfer &earning: &earning to Ran7: Personalisation: 5ehavioral
-argeting: Cross &anguage $R: Digital &ibraries: 5ibliographic s!stems: Patent )earch: "'
learning: )ecurit! $ssues:Political and ethical issues2
References :

12 Nates A 3eto: Godern $nformation RetrievalG: Pearson "ducation: $)53 +1',MK'0,K4'I .,011/2
,2 Christopher D. Manning, Prabhakar Raghavan, Hinrich Schtze : C$ntroduction to $nformation
RetrievalD .available online at http;99nlp2stanford2edu9$R'boo79/
3. Chakrabarti, S., Mining the Web, Morgan Kaufmann (An Imprint of Elsevier !""#.
#dditiona 8e3erences 7
12 C202 Ri8sbergen: G$nformation RetrievalG: .http;99***2dcs2gla2ac2u79@eith9Preface2html/
,2 6rossman: D2 A2 and Frieder: (2: $nformation Retrieval; Algorithms and Heuristics2 @lu*er 1MM+2
E2 )earch "ngines; $nformation Retrieval in Practice b! 5ruce Croft: Donald et<ler: and -revor )trohman:
Addison'Hesle!: ,00M2
42 $nformation Retrieval; $mplementing and "valuating )earch "ngines b! )2 5uttcher: C2 Clar7e and 62 Cormac7:
$- Press: ,0102
52 Heb Data ining; "1ploring H!perlin7s: Contents: and Jsage Data b! 52 &iu: )pringer: )econd "dition: ,0112
%&'&'%C9 !achine Learning and Transation
Teaching Scheme Examination Scheme
Lectures7 % Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '%
4nit ". "ntroduction to !achine Learning
$ntroduction to &: $ntroduction to )tatistical &earning ethods: Histor! of achine
&earning: achine'&earning Problem: &earning Paradigms: achine'&earning -echni=ues and
Paradigms: 3eed of &earning: achine $ntelligence
4nit "". Learning theor2 7 Su,er0ised earning and 4nsu,er0ised earning.
&ogistic regression: )imple 3eural 3et*or7: Perceptron: 6enerative learning algorithms2
6aussian discriminant anal!sis2 3aive 5a!es2 )upport vector machines2 odel selection and
feature selection2 "nsemble methods; 5agging: boosting2 "valuating and debugging learning
algorithms2 BC dimension2 Horst case .online/ learning2 Practical advice on ho* to use learning
algorithms2 easuring &earning Performance: &earning and @no*ledge building? Clustering2 @'
means2 "2 i1ture of 6aussians2 Factor anal!sis2 PCA .Principal components anal!sis/2 $CA
.$ndependent components anal!sis/2
4nit """. >undamentas o3 Whoe9S2stem? S2stemic? and !uti9,ers,ecti0e !achine
Learning
)!stemic achine &earning: achine'&earning Frame*or7: ulti'perspective Decision
a7ing and ultiperspective &earning: D!namic and $nteractive Decision a7ing: -he
)!stemic &earning Frame*or7: )!stem Anal!sis
4nit "5. 8ein3orcement Learning
&earning Agents: Returns and Re*ard Calculations: Reinforcement &earning and
Adaptive Control: D!namic )!stems: Reinforcement &earning and Control: ar7ov Propert!
and ar7ov Decision Process: Balue Functions: Action and Balue: &earning an (ptimal Polic!
.odel'5ased and odel'Free ethods/: D!namic Programming: Adaptive D!namic
Programming: "1ample; Reinforcement &earning for 5o1ing -rainer
4nit 5. !achine Learning !odes and "n3erence
A Frame*or7 for &earning: Capturing the )!stemic Bie* for learning: athematical
Representation of )!stem $nteractions: $mpact Function: Decision'$mpact Anal!sis2 $nference
echanisms and 3eed: $ntegration of Conte1t and $nference: )tatistical $nference and $nduction:
Pure &i7elihood Approach: Appl!ing 5a!esian Paradigm and $nference: -ime'5ased $nference:
$nference to 5uild a )!stem Bie*: Appl!ing 5a!esian &earning: Appl!ing )B: Appl!ing
6aussian ma1imum li7elihood
4nit 5". #da,ti0e and "ncrementa !achine Learning
Adaptive &earning and Adaptive )!stems: Adaptive achine &earning: Adaptation and
&earning ethod )election 5ased on )cenario: Applications of Adaptive &earning: Competitive
&earning and Adaptive &earning: $ncremental &earning: &earning from Hhat $s Alread!
&earned: )upervised $ncremental &earning: $ncremental Jnsupervised &earning and $ncremental
Clustering: )emi'supervised $ncremental &earning: $ncremental and )!stemic &earning:
$ncremental Closeness Balue and &earning ethod: &earning and Decision'a7ing odel:
$ncremental Classification -echni=ues
4nit 5"". Inowedge 8e,resentation and #ugmentation7 # !achine Learning Pers,ecti0e
@no*ledge Augmentation and @no*ledge "licitation: &ife C!cle of @no*ledge:
$ncremental @no*ledge Representation: Case'5ased &earning and &earning *ith Reference to
@no*ledge &oss: @no*ledge Augmentation; -echni=ues and ethods
Heuristic &earning : )!stemic achine &earning and @no*ledge Augmentation:
@no*ledge Augmentation in Comple1 &earning )cenarios
4nit 5""". <uiding a Learning S2stem
)!stemic &earning )!stem: Algorithm )election: @no*ledge Representation: Designing a
&earning )!stem: a7ing )!stem to 5ehave $ntelligentl!: "1ample'5ased &earning2 Holistic
@no*ledge Frame*or7 and Jse of Reinforcement &earning: $ntelligent AgentsDeplo!ment
and @no*ledge Ac=uisition and Reuse: Case'5ased &earning; Human "motion'Detection
)!stem: Holistic Bie* in Comple1 Decision Problem: @no*ledge Representation and Data
Discover!
8e3erences 7
12 Reinforcement and )!stemic achine &earning for Decision a7ing: Parag @ul7arni: 0ul!
,01,: Hile!'$""" Press: $)53; MK+'0'4K0'M1MMM'I
,2 $ntroduction to achine &earning: "them A&PAND$3: -he $- Press: (ctober ,004: $)53
0',I,'01,11'1
E2 achine &earning: -om itchell: c6ra* Hill: 1MMK2
42 -he "lements of )tatistical &earning; Data ining: -revor Hastie: Robert -ibshirani: 0erome
Friedman: $nference: and Prediction: )econd "dition: Februar! ,00M
%&'&'%=9 8ea Time S2stems
Teaching Scheme Examination Scheme
Lectures7 % Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '%
4nit ". "ntroduction
$ssues in Real'-ime Computing: )tructures of Real'-ime )!stem: -as7 Classes: Performance
easures for Real'-ime )!stems: "stimating Program Run -imes
4nit "". Task #ssignment and Scheduing
Classical Jni'processor )cheduling algorithm: Jni'processor )cheduling of $R$) -as7s: -as7
Assignment: ode Changes: Fault -olerant )cheduling
4nit """. Programming Languages and Toos
Desired &anguage characteristics: Data -!ping : Control )tructures : Facilitating Hierarchical
Decomposition: Pac7ages: Runtime "rror ."1ception/ Handling: (verloading and 6enerics:
ultitas7ing :&o*'&evel Programming: -as7 )cheduling: -iming )pecifications: )ome
e1perimental &anguages: Programming "nvironments: Run'-ime )upport2
4nit "5. 8ea9Time =atabases
5asic Definitions: Real'-ime Bs 6eneral'Purpose Databases: ain emor! Databases:
-ransaction Priorities: -ransaction Aborts: Concurrenc! Control $ssues: Dis7 )cheduling
algorithm: A -*o Phase Approach -o $mprove Predictabilit!: aintain )eriali<ation
Consistenc!: Databases for Hard Real -ime )!stems2
4nit 5. 8ea9Time Communication
3et*or7 -opologies :Protocols :Cloc7s : A 3on Fault -olerant )!nchroni<ation
Algorithm: $mpact of Faults : Fault -olerant )!nchroni<ation in Hard*are:
)!nchroni<ation in )oft*are
4nit 5". >aut Toerant TechniDues
Fault -!pes : Fault Detection: Fault and error Containment: Redundanc!: Data Diversit!:
Reversal Chec7s: alicious or 5!<antine Failures: $ntegrated Failure Handing: (btaining
Parameter Balues: Reliabilit! odels for Hard*are Redundanc!: )oft*are "rror models:
-a7ing -ime into Account2
8e3erences7
12 C22 @rishna: @ang 62 )hin: CReal'-ime )!stemsD: -ata c6ra* Hill
%&'&'+9 Laborator2 Practice9 "
Teaching Scheme Examination Scheme
Practica7 ( Hrs/week O87 %' !arks
TW7 %' !arks
Tota Credits 7 '(

12 Develop algorithmic solution for solving the problem stated in assignment ,: E belo*
using set theor!: Probabilit! theor! and9or re=uired theories: strateg! to design -uring
machine: multiple1er logic inducing concurrenc! and perform 3P'Hard anal!sis for the
solution feasibilit!2
,2 Design and implement the distributed architecture for the Hadoop having 3ame node:
-rac7er node and data nodes .separated b! AD)& routers/ or such recent technolog!2
Prepare architecture diagram and installation document to be used for the assignment
number E
E2 $mplement Digital &ibrar! $nfrastructure using Hadoop or )imilar recent technolog! for
distributed database storage2 -o develop front end 6J$ and algorithm for searching the
multimedia resource files: presentations in the selected domain: author: boo7 title: $)5322
Jse different search e1ploration techni=ues2
Or Assignments e=uivalent to above assignments2
42 "lective teacher shall design four suitable assignments based on "lective $ maintaining
above =ualit! of the assignments2
52 Design and implement class9classes using latest I4'bit COO90ABA9 P!thon9>- 521 and
above: Cuda COO or such latest I4'bit programming tools for the implementation of -*o
8ournal .$""" -ransactions9AC "lsevier9)pringer/ papers published in the current !ear
related to the respective elective sub8ects2 Development -ools such as
A-&A59(P"3CB9(P"3P93)E or e=uivalent ma! be used if re=uired to interface
the developed classes to the simulators2
Toos 3or the Laboratories7 The aboratories must be eDui,,ed with adeDuate? we
maintained working resources as ,er the so3tware/eDui,ment/toos ist ,ubished b2 the
<oard o3 Studies time to time. >or maintaining the Duait2 and e33ecti0e ,er3ormance the
<oard o3 Studies ma2 ,ubish the Duait2 guideines 3or e33ecti0e conduct o3 the
aboratories? seminars and dissertation.
Semester 9 ""
%&'&'-9 O,erating S2stem =esign
Teaching Scheme Examination Scheme
Lectures7 ( Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '(
4nit ". "ntroduction
)!stem levels: Hard*are Resources: Resource management: Birtual Computers: -he
Hard*are $nterface: -he CPJ: emor! and Addressing: $nterrupts: $9( Devices: -he (perating
)!stem $nterface: $nformation and eta'$nformation: 3aming (perating )!stem (b8ects: Device
as Files: -he process Concept: Communication bet*een Processes: J3$L')t!le Process
Creation: )tandard $nput and )tandard (utput: -he Jser $nterface to an (perating
=esign TechniDues7 (perating )!stems and Design: Design Problems: Design -echni=ues: -*o
&evel $mplementation: $nterface Design: Connection in Protocols: $nteractive and Programming
$nterfaces: Decomposition Patterns2
4nit "". "m,ementing Processes
$mplementation of a )imple (perating )!stem: $mplementation of Processes: )!stem
$nitiali<ation: Process )*itching: )!stem Call $nterrupt Handling: Program "rror $nterrupts: Dis7
Driver )ubs!stem: $mplementation of Haiting: Flo* of Control -hrough the (perating )!stem:
)ignaling in an (perating )!stem: $nterrupts in the (perating )!stem: (perating )!stems as
"vent and -able anagers: Process $mplementation: "1amples of Process $mplementation:
ono'programming: Parallel )!stem2

4nit """. "nter ,rocess Communication Patterns
Patterns of $nter process communication: 3e* message'passing s!stem calls: $PC
Patterns: Failure of Processes: Processes; "ver!da! )cheduling: Preemptive )cheduling
ethods: Polic! versus echanism in )cheduling: )cheduling in Real (perating )!stems:
Deadloc7: -*o Phase &oc7ing: )tarvation: )!nchroni<ation: )emaphores: Programming
&anguage 5ased )!nchroni<ation Primitives: essage Passing Design $ssues
=esign TechniDues7 $ndirection: Jsing )tate achines: Hin 5ig -hen 6ive )ome 5ac7:
)eparation of Concepts: Reducing a Problem to a )pecial Case: Reentrant Programs: Jsing
odels for $nspiration: Adding a 3e* Facilit! -o a )!stem2
4nit "5. !emor2 !anagement
&evels of emor! anagement: &in7ing and &oading a Process: Bariations in Program
&oading: -he emor! anagement Design Problem: D!namic emor! Allocation: @eeping
-rac7 of the 5loc7s: ultiprogramming $ssues: emor! Protection: emor! anagement
)!stem Calls: Birtual emor!: Birtual emor! )!stems
=esign TechniDues7 ultiple1ing: &ate binding: )tatic Bersus D!namic: )pace'-ime -radeoffs:
)imple Anal!tic odels
4nit 5. "/O =e0ices F >ie S2stems
$9( Devices: $9( )!stems: -he File Abstraction: File 3aming: File )!stem (b8ects and
(perations: File )!stem $mplementation: File )!stems (rgani<ation
=esign TechniDues7 Caching: (ptimi<ation and Hints: Hierarchical 3ames: 3aming of (b8ects:
Jnification of Concepts2
4nit 5". Resource anagement
$ssues: -!pes of Resources: $ntegrated )cheduling: >ueuing odels of )cheduling: Real'
time (perating )!stems: Protection of Resources: Jser Authentication: echanisms for
Protecting Hard*are Resources: Representation of Protection $nformation: echanisms For
)oft*are Protection: -he Jse of Cr!ptograph! in Computer )ecurit!: -he Client )erver odel
8e3erences7
12 Charles Cro*le!: C (perating )!stem; A Design'(riented ApproachD: -ata c6ra*'
Hill2
%&'&'.9 So3tware =esign and #rchitecture
Teaching Scheme Examination Scheme
Lectures7 ( Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '(
4nit ". So3tware =esign Process
Role of )oft*are Design7 )oft*are design process: nature of design process: design
=ualities4 -ransferring Design @no*ledge; describe design solution: transferring design
7no*ledge: design notations: design strategies:
4nit "". Object Oriented =esign
Creational: )tructural: behavioural design patterns: Component based design: Formal
Approach to design
4nit """. "ntroduction to So3tware #rchitecture
Hhat $s )oft*are ArchitectureP Hh! $s )oft*are Architecture $mportantP >ualit!
Attributes: Architecture and Re=uirements: Designing an Architecture: Documenting soft*are
Architecture: Architecture and )oft*are Product lines
4nit "5. So3tware #rchitecture =esign
Designing: Describing: and Jsing )oft*are Architecture: $),000; -he Advanced $maging
)olution: 6lobal Anal!sis: Conceptual Architecture Bie*: odule Architecture Bie*: )t!les of
the odule Bie*t!pe: "1ecution Architecture Bie*: Code Architecture Bie*2 Component'and'
Connector Bie*t!pe: )t!les of Component'and'Connector Bie*t!pe: Allocation Bie*t!pe and
)t!les2
4nit 5. #rchet2,e Patterns
Archet!pes and Archet!pe Patterns: odel Driven Architecture *ith Archet!pe Patterns2
&iterate odeling: Archet!pe Pattern2 : Customer Relationship anagement .CR/
Archet!pe Pattern: Product Archet!pe Pattern: >uantit! Archet!pe Pattern: Rule
Archet!pe pattern2
4nit 5". So3tware #rchitectures
(b8ect'(riented Paradigm: Data Flo* Architectures: Data'Centered )oft*are
Architecture: Hierarchical Architecture: $nteraction'(riented )oft*are Architectures: Distributed
Architecture: Component'5ased )oft*are Architecture: Heterogeneous Architecture:
Architecture of Jser $nterfaces: $mplicit as!nchronous communication soft*are architecture2
8e3erence <ooks7
12 David 5udgen: C)oft*are DesignD: ,nd edition: Pearson "ducation .&P"/
,2 )oft*are Design; From Programming to Architecture "ric 02 5raude $)53; MK+'0'4K1',045M'I
E2 )oft*are Architecture in Practice: Erd "dition 5! &en 5ass: Paul Clements: Ric7 @a<man
Published )ep ,5: ,01, b! Addison'Hesle! Professional
42 Applied )oft*are Architecture :Christine Hofmeister: Robert 3ord: Deli )oni: Addison'Hesle!
Professional4 1st edition .3ovember 4: 1MMM/ :$)53'10; 0,01E,5K1E : $)53'1E; MK+'
0,01E,5K1E
52 "nterprise Patterns and DA; 5uilding 5etter )oft*are *ith Archet!pe Patterns and J&0im
Arlo*: $la 3eustadt :Addison'Hesle! Professional: ,004: $)53'10; 0E,111,E0L $)53'1E;
MK+0E,111,E0M
I2 @ai >ian: Liang Fu: &i1in -ao: C)oft*are Architecture and Design $lluminatedD: 0ones A
5artlett &earning: ,00M: $)53 0KIEK54,0L: MK+0KIEK54,04
%&'&'/9 #d0anced Com,uter 1etworks
Teaching Scheme Examination Scheme
Lectures7 ( Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '(
4nit "
$ntroduction; -!pes of 3et*or7s2 3et*or7 design issues2 3et*or7 design tools:
advanced net*or7 architectures2 Reliable data deliver!: Routing and for*arding: resource
allocation: obilit!: 3et*or7ed applications: Data in support of net*or7 design: 6eneral
Principles of 3et*or7 Design: net*or7 characteristics2
4nit ""
Dela! odels in Data 3et*or7s; odeling and Performance evaluation2 ultiple1ing of
-raffic on a Communication &in7: >ueuing odels' &ittle?s -heorem: Probabilistic Form of
&ittle?s -heorem: Application of &ittle?s -heorem: >ueuing )!stems; 991: 99,: 99m:
99Q: 99m9m: 99m9=: 99193: D9D91: 9691 )!stem: 9691 >ueues *ith Bacations:
Reservations and Polling: Priorit! >ueuing
4nit """
odeling 3et*or7s as 6raphs: Problems A algorithms; ultipoint line topolog!' C)-:
"sau'Hilliam?s Algorithm: )harma?s Algorithm: 5in Pac7ing algorithms2 -erminal Assignment'
6reed! algorithm and e1change algorithms: Concentrator location' C(: Add: Drop:
Rela1ation algorithm2 3et*or7 of =ueues: (pen: closed and semi'open =ueues: 3et*or7 node:
@leinroc7?s $ndependent appro1imation2
4nit "5
>ualit! of )ervice in 3et*or7s; Application and >o): >o) mechanisms: >ueue management
Algorithms: Feedbac7: Resource reservations: traffic engineering: Jbi=uitous Computing;
Applications and Re=uirements: )mart Devices and )ervices: )mart obiles: Cards and Device
3et*or7s2
4nit 5
$P pac7et format: $P routing method: routing using mas7s: fragmentation of $P pac7et:
$PvI: advanced features of $P routers; filtering: $P >o): 3A-: routers
4nit 5"
Advanced topics in computer net*or7s; Hireless and sensor net*or7s: multimedia
net*or7ing: content distribution net*or7s: computer net*or7 simulation: Domain'specific
net*or7s: 3e1t generation net*or7s: C!ber ph!sical s!stems2
8e3erences7
12 @ershenbaum A2: C-elecommunication 3et*or7 Design AlgorithmsD: -ata c6ra* Hill
,2 )imulation odeling and anal!sis: Averill 2 &a*: H2 D2 @elton
E2 Computer 3et*or7s: Priciples: -echnologies and Protocols for net*or7 design 3atalia (lifer:
Bictor (lifer: Hile! $ndia
42 Jbi=uitous Computing: )tefan Poslad: H$&"N $3D$A "D$-$(3
Eecti0e H ""
%&'&&'# 9 <usiness "nteigence and =ata !ining
Teaching Scheme Examination Scheme
Lectures7 % Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '%
4nit ". "ntroduction to <usiness "nteigence
$ntroduction to Data $nformation and 7no*ledge: Data Decision Challenge: (perational
vs $nformation Data: $ntroduction to Decision )upport )!stem: $ntroduction to 5usiness
$ntelligence: 5usiness $ntelligent )!stem Components: 5usiness odels: $ntroduction to Data
Harehouse: A 5usiness anal!sis frame*or7 for DH2
4nit "". =ata Warehouse
$ntroduction: Data *arehouse modeling: Data *arehouse design: Data *arehouse
technolog!: Distributed Data *arehouse: inde1 techni=ues: materiali<ed vie*2
4nit """. =ata Pre,rocessing and Cube Technoog2
$ntroduction to Data Preprocessing: Data Cleaning: Data integration: data reduction:
transformation and Data Descriti<ation2
$ntroduction to (&AP: Data Cube ; A multidimensional model: data cube computation: data cube
computation methods ; multidimensional data anal!sis2
4nit "5. !ining >reDuent Patterns and #ssociation 8ue
$ntroduction to association rule: mar7et bas7et anal!sis: fre=uent item set: apriori
algorithm: parameter: a pattern gro*th approach: mining closed and ma1 patterns: pattern
evaluation: pattern mining in multilevel: multidimensional data space: pattern e1ploration and
application2
4nit 5. Cassi3ication
5asic concepts: decision tree: rule based classification: 5a!esian belief net*or7s:
classification b! bac7 propagation: support vector machines: la<! learners # 7'33 classifier: case
based reasoning : model evaluation and selection : techni=ues to improve classification accurac!:
multiclass classification: semi'supervised classification: ensemble methods2
4nit 5". Custering #na2sis
Cluster anal!sis: Partitioning methods: hierarchical methods: densit! based methods: grid
based methods: clustering graph and net*or7 data: clustering *ith constrains: evaluation of
clustering outliers and anal!sis: outlier detection methods: scalable clustering algorithms2
8e3erences7
12 Data mining concepts and techni=ues: 0a*ai Han: ichelline @amber: 0iran Pie: organ
@aufmann Publishers: E
rd
"dition2
,2 $ntroduction to Data ining: Bipin @umar: Pang'3ing -an : Pearson
E2 5uilding the Data Harehouse: Hilliam H $nmon: Hile! Publication 4
th
"dition2
42 $ntroduction to 5usiness $ntelligence A Data Harehousing: $5: PH$2
52 5usiness modeling and Data ining Dorian P!le: "lsevier Publication @2
I2 Database )!stems: -homas Connoll!: Carol!n 5egg: Pearson 4
th
"dition2
%&'&&'< 9 4sabiit2 Engineering
Teaching Scheme Examination Scheme
Lectures7 % Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '%
4nit ". "ntroduction to Human9Com,uter "nteraction as an emerging 3ied
Disciplines contributing to HC$: Human $nformation Processing Ps!cholog! of ever!da!
things: $mportance of human factors in design # cultural : emotional : technological: business:
3eed )atisfaction curve of technolog!: &evels of human computer interaction
4nit "". >oundations o3 4ser "nter3ace =esign A4.".=B
6oals of J$D: 6oal directed Design: Jser $nterface odels: Jnderstanding and
Conceptuali<ing $nterface: Ps!cholog! of users designing for collaboration and
communication: Process of $nteraction Design: )tandards A 6uidelines: Jsabilit! -esting:
6$J
4nit """. Human >actors
-he importance of Jser $nterface # J$ and )oft*are Designer # 6oals of J$ design #
otivations for human factors in Design # Jnderstanding user needs and re=uirements2
4nit "5.!odes
-heories # Different models ' (b8ect ' Action $nterface odel ' Principles for Design #
Data displa! and entr! guidelines2
4nit 5. =esign Process
Jser $nterface Design Process # Classes of J$ design # Principles of good design #
"valuating design using the principles # Choice of color # -as7 oriented approach for J$ ' Case
stud!2
6J$ design process ' Design of icons # Jse of metaphors # 6J$ st!le guides and
tool7its # Portabilit! # 6J$ design and ob8ect oriented approach # Case stud!2

4nit 5". 4sabiit2
-he vie*point of user: customer and designer #Jsabilit! specification # Description of
stages in usabilit! specification and evaluation2
$nformation Related; $nformation )earch and Bisuali<ation # H!permedia and HHH2
HC$ )tandards7 "CA # $)( # 5)$ guide2
8e3erences7
12 &inda caula!: CHC$ for )oft*are DesignersD:$nternational -hompson Computer Press:
J)A:1MM+2
,2 5en )chneiderman: GDesigning the Jser $nterfaceG: Pearson "ducation: 3e* Delhi:,0052
E2 Alan Cooper: G-he "ssentials of Jser $nterface DesignG: $D6 5oo7s: 3e* Delhi:1MM52
42 0acob 3ielsen: GJsabilit! "ngineeringG: Academic Press: 1MME2
52 Alan Di1 et al: GHuman ' Computer $nteractionG: Prentice Hall: J)A:1MME2
I2 "lements of Jser $nterface Design ' -heo andel: 0ohn Hile! A )ons
K2 $nteraction Design # Preece: Roger: )harp: 0ohn Hile! A )ons
+2 (b8ect odeling A Jser $nterface Design ' ar7 Hamelen
%&'&&'C 9 #d0anced Com,ier =esign
Teaching Scheme Examination Scheme
Lectures7 % Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '%
4nit ". "ntroduction
3otation and Concepts for &anguages and 6rammars: -raditional compilers: structure of
compiler: architecture: properties: portabilit! and re'targetabilit!: optimi<ation: grammars:
Closure algorithms: abstract s!nta1 tree; le1ical structure: s!nta12
4nit "". #ttribute grammars
Dependenc! graphs: attribute evaluation: c!cle handling: attribute allocation: multi'visit
attribute grammars: t!pes of attribute grammars: &'attribute grammar: )'attributed grammars:
e=uivalence of &'attributed and )'attributed grammars: "1tended grammar notations and attribute
grammars: manual methods2
4nit """. "ntermediate code ,rocessing
$nterpretation: Code generation: Assembler design issues: lin7er design issues2 emor!
anagement; data allocation *ith e1plicit de'allocation: data allocation *ith implicit de'
allocation: )tatic: D!namic and Heap )torage allocation2
4nit "5
Conte1t handling: source language data representations: routines and their activation:
Code generation for control flo* assessment: Code generation for modules2 "1amples of Parser
generators: machine'independent Code generation2
4nit 5. >unctiona F Logic Programs
(ffside rules: &ists: &ist comprehensions: pattern matching: pol!morphic t!ping:
referential transparenc!: High'order functions: la<! evaluation: compiling functional languages:
pol!morphic t!pe chec7ing: Desugaring: 6raph reduction: Code generation for functional: core
programs: (ptimi<ing the functional Core: Advanced graph manipulations
-he logic programming models: implementation model interpretation: unification:
implementation model compilation: compiled code for unification2
4nit 5". Parae ,rogramming
Parallel programming models: processes and threads: shared variables: message passing: parallel
ob8ect 'oriented languages: -uple space: automatic paralleli<ation2 Case stud! of simple ob8ect'
oriented compiler9interpreter2
8e3erence <ooks
12 odern Compiler Design: Dic7 6rune: Henri " 5al: 0acobs: &angendoen Hile! $ndia Pvt &td:
$)53; +1',I5'041+'+
,2 -he -heor! and Practice of Compiler Hriting: -remble! )orenson: ac6ra*Hill $ndia
$)53;0'0K'NIII1I'4
%&'&&'= 9 Embedded S2stems =esign
Teaching Scheme Examination Scheme
Lectures7 % Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '(
4nit "
$ntroduction to "mbedded s!stems: building bloc7s: legac! "mbedded processors: $ntegrated R$)C
processors: D)P Processors Architecture: )election of Processor:: &PC,14+' Architecture: Register set:
Programmers odel:
4nit ""
emor! )!stems: DRA -echnolog!: Bideo RA: )RA; Pseudo')tatic RA: 5atter! 5ac7up
)RA: "PR( and (-P: Parit!: "rror Detection and Correcting emor!: Access times: Pac7ages:
DRA $nterfaces: DRA Refresh -echni=ues: (ptimi<ing line length and cache si<e: &ogical versus
ph!sical caches: Jnified versus Harvard caches: Cache coherenc!; Hrite through: *rite bac7: no caching
of *rite c!cles: *rite buffer: 5us snooping: ")$ Protocol: "$ Protocol: 5$6 and &ittle "ndian: Dual
Port and )hared emor!: 5an7 )*itching: emor! (verla!s: )hado*ing: emor! $nterfacing:
HN,KJJ0++65'Architecture: Register )et: Programmers odel
4nit """
5asic Peripherals; Parallel ports: -imer Counters: +,5E: CI+,E0 modes: -imer Processors: Real'time
cloc7s: )erial Ports: serial peripheral interface: $
,
C bus: '5us: R),E,C: J)5,20: JAR-
implementations: DA Controllers: DA Controller odels: Channels and Control 5loc7s: )haring 5us
5and*idth: DA $mplementations: $ntel+,+01 $( Controller HJ5
Analogue to Digital Conversion: )ample Rate and )i<e: Codecs: Po*er Control
4nit "5
$nterrupts and "1ceptions: $nterrupt )tructure: Recogni<ing an $nterrupt: $nterrupt mechanism: CI+000
$nterrupts: R$)C "1ceptions: Fast $nterrupts: $nterrupt Controllers: $nstruction restart and continuation:
$nterrupt &atenc!: $nterrupt Handling Do?s and Don?ts: $ntel iK interrupts and programmers model
4nit 5
Real'-ime (perating )!stems: (perating s!stems internals: ultitas7ing (): )cheduler Algorithms:
Priorit! $nversion: -as7s: -hreads and processes: "1ceptions: emor! odels: emor! odels and
Address -ranslation: Commercial (perating )!stems: Resource Protection: &inu1: Dis7 Partitioning:
Hriting soft*are for "mbedded )!stems; -he Compilation Process: 3ative verses cross compilers: Run'
-ime &ibraries: Hriting &ibrar!: Jsing Alternative &ibraries: Jsing )tandard &ibraries: Porting @ernels: C
e1tensions for "mbedded )!stems: Do*nloading:
"mulation and Debugging techni=ues: -he role of the development s!stem: "mulation -echni=ues2
4nit 5"
5uffering and other data )tructures: buffers: &inear buffers: Directional 5uffers: Double 5uffering: 5uffer
"1change: &in7ed list: F$F(: Circular buffers: buffer under run and over run: Allocating buffer memor!:
emor! lea7age: effects of memor! *ait state scenarios: a7ing the right decisions: )oft*are
5enchmar7 "1amples: Creating )oft*are )tate mechanisms: Design of 5urglar alarm s!stem: Digital
echo Jnit: Choosing the soft*are environment: Deriving realtime s!stems performance form non'real'
time s!stems: )cheduling the data sampling: sampling the data: Controlling from an e1ternal )*itch:
Problems2
8e3erences
&. Embedded S2stems =esign? Ste0e Heath? E=1 Series 3or =esign Engineers? Ese0ier
"S<17 /-.9.&9.&(-9/-'9/
). Phii,s LPC)&(. =atasheet A,c)&(&J()J((J(+J(.J(.,d3B
*. HK)-44'LLE%!.,d3
(. "nte.).'& "O Controer H4<.,d3
%. A"nte i- interru,t registers and ,rogrammingB *))&+%.,d3
%&'&&&9 Laborator2 Practice9 ""
Teaching Scheme Examination Scheme
Practica7 ( Hrs/week O87 %' !arks
TW7 %' !arks
Tota Credits 7 '(
4se suitabe +(9bit Linux en0ironment and tooset to im,ement 3oowing assignments
12 Demonstrate the Reader'Hriter Problem solution b! creating multiple processes and share
regions or bloc7s2 Jse I4'bit &inu1 derivative and tools for implementation2
,2 Hrite a program to identif! the least used icons9files9folders on the des7top and move them
to temp folder created in Documents2
E2 Create a computing facilit! grid using net*or7s for 5ooth?s multiplication .I4'bit/ using
sign'e1tension method2 Hhere bit multiplication: additions and merging of the addition
results for final processing2 -he computing grid is created using Advanced *ireless net*or7
*ith fe* computing resources are separated b! the router and identified b! the 3A-2 -he
net*or7 controlling node *ill be submitted *ith files having total distributed storage of 1000
numbers as a )A3 =ueued for the e1ecution in sorted manner on the lesser cost due to length
of the multiplier and displa! the results along *ith the net*or7 trac7ing report for the
d!namic allocation of multiplier and addition nodes along *ith the sleeping9 inactive9
unutili<ed nodes in the net*or72
42 Design suitable soft*are architecture for assignment number 1:, and E above2
(r assignments e=uivalent to the above assignments
52 Design and implement class9classes using latest I4'bit COO90ABA9 P!thon9>- 521 and above:
Cuda COO or such latest I4'bit programming tools for the implementation of -*o 8ournal .$"""
-ransactions9AC "lsevier9)pringer/ papers published in the current !ear related to the
respective elective sub8ects2 Development -ools such as A-&A59(P"3CB9(P"3P93)E or
e=uivalent ma! be used if re=uired to interface the developed classes to the simulators2
Toos 3or the Laboratories7 The aboratories must be eDui,,ed with adeDuate? we
maintained working resources as ,er the so3tware/eDui,ment/toos ist ,ubished b2 the
<oard o3 Studies time to time. >or maintaining the Duait2 and e33ecti0e ,er3ormance the
<oard o3 Studies ma2 ,ubish the Duait2 guideines 3or e33ecti0e conduct o3 the
aboratories? seminars and dissertation.
%&'&&)9 Seminar9 "
Teaching Scheme Examination Scheme
Practica7 ( Hrs/week TW7 %' !arks
Presentation Ora7 %' !arks
Tota Credits7 '(
)tate'of'the'art topic approved b! the guide useful for professional gro*th in the filed of
e1pertise2 -he presentation should cover motivation: mathematical modeling: data'table
discussion and conclusion2 -he reports to be prepared using &A-"L derivative2 -o maintain the
=ualit! of the seminar *or7 it is mandator! on the seminar guides to maintain a progressive
record of the seminar contact Hrs of 1 Hrs per month per seminar *hich shall include the discussion
agenda: *ee7l! outcomes achieved during practical sessions: corrective actions and comments on the
progress report as per the plan submitted b! the students including dates and timing: along *ith the
signature of the student as per the class and teacher time table .as additional teaching load/4 such record
of progressive *or7 shall be referred b! the e1aminers during evaluation2
Semester """
+&'&'&9 #d0anced Storage S2stems and "n3rastructure !anagement
Teaching Scheme Examination Scheme
Lectures7 ( Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '(
Objecti0es7
Jnderstanding components of modern information storage infrastructure2
Jpon successful completion of this course: participants should be able to;
"valuate storage architecture4 understand logical and ph!sical components of a storage
infrastructure including storage subs!stems4
Describe storage net*or7ing technologies and data archival solution4
Jnderstand and articulate business continuit! solutions including: bac7up and recover!
technologies: and local and remote replication solutions4
$dentif! parameters of infrastructure management and describe common infrastructure
management activities and solutions4
PrereDuisites
-o understand the content and successfull! complete this course: a participant must have a basic
understanding of computer architecture: operating s!stems: net*or7ing: and databases2
4nit "7 "ntroduction to "n3ormation Storage Technoog2 / S2stems

Revie* data creation and the amount of data being created and understand the value of
data to a business: Challenges in Data )torage and anagement: Data )torage $nfrastructure2
Components of a )torage )!stem "nvironment; Dis7 drive components: Dis7 Drive
performance: &ogical Components2
Data protection; concept of RA$D and different RA$D levels .RA$D 0: 1: E: 5: 0O191O0:
and I/4
$ntelligent )torage )!stem .$))/ and its components: $mplementation of $)) as high'end
and midrange storage arra!s2
4nit ""7 =i33erent Storage Technoogies and 5irtuaiCation
$ntroduction to 3et*or7ed )torage; "volution of net*or7ed storage: Architecture:
(vervie* of FC')A3: 3A): and $P')A32 3et*or7'Attached )torage .3A)/; 5enefits of 3A):
Components: $mplementations: File )haring: $9( operations: Performance and Availabilit!2
Content Addressed )torage .CA)/; features and 5enefits of a CA)2 CA) Architecture: )torage
and Retrieval: "1amples2
)torage Birtuali<ation; Forms: -a1onom!: Configuration: Challenges: -!pes of )torage
Birtuali<ations2
(vervie* of emerging technologies such as Cloud storage: Birtual provisioning: Jnified
)torage: FC(": FA)-2
4nit """7 <usiness Continuit2
Concept of information availabilit! and its measurement: causes and conse=uences of
do*ntime: concept of R-(: and RP(: single points of failure in a storage infrastructure and
solutions for its mitigation: bac7up9recover! purposes and considerations: architecture and
different bac7up9recover! topologies4
&ocal replication technologies and their operation: remote replication technologies and
their operation: emerging technologies li7e de duplication: offsite bac7up2
4nit "57 "n3rastructure !anagement O0er0iew
Definitions: $nfrastructure management activities: "volutions of )!stems since 1MI0s
.ainframes'to'idrange'to'PCs'to'Client'server computing'to'3e* age s!stems/ and their
management: gro*th of internet: current business demands and $- s!stems issues: comple1it! of
toda!Rs computing environment: -otal cost of comple1it! issues: Balue of )!stems management
for business2
4nit 57 Pre,aring 3or "n3rastructure !anagement
Factors to consider in designing $- organi<ations and $- infrastructure: Determining
customerRs Re=uirements: $dentif!ing )!stem Components to manage: "1ist Processes: Data:
applications: -ools and their integration: Patterns for $- s!stems management: $ntroduction to the
design process for information s!stems: odels: $nformation -echnolog! $nfrastructure &ibrar!
.$-$&/2
4nit 5"7 Ser0ice !anagement
)ervice Deliver! Processes' )ervice'level management: financial management and
costing: $- services continuit! management: Capacit! management: Availabilit! management2
)ervice )upport Processes' Configuration anagement: )ervice des72 $ncident management2
Problem management: Change management: Release management2
8e3erence <ooks7
12 "C "ducational )ervices: $nformation )torage and anagement: Hile! $ndia:2
,2 Robert )palding: C)torage 3et*or7s; -he Complete ReferenceC: -ata c6ra* Hill: (sborne:
,00E2
E2 arc Farle!: C5uilding )torage 3et*or7sD: -ata c6ra* Hill :(sborne: ,0012
42 0an Ban 5on: CFoundations of $- )ervice anagement; based on $-$&D: Ban Haren
Publishing: ,nd edition ,005
52 Harris @em: )tuart 6aiup: 6u! 3emiro: C$- (rgani<ation; 5uilding a Horldclass
$nfrastructureD: Prentice Hall: ,000
I2 Richard 5ar7er and Paul assiglia, .)torage Area 3et*or7 "ssentials; A Complete 6uide to
Jnderstanding and $mplementing )A3s2: Hile! $ndia2
K2 eet 6upta: )torage Area 3et*or7 Fundamentals2: Pearson "ducation &imited: ,00,2
+&'&')9 #d0anced 4nix Programming
Teaching Scheme Examination Scheme
Lectures7 ( Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '(
4nit ". "ntroduction to 41"G >ie s2stem
$ntroduction to J3$L file s!stem: file handling utilities: securities and file permissions:
process utilities: Dis7 utilities: net*or7ing commands: $ntroduction to shell scripting: Hor7ing
*ith 5ourn shell; )hell responsibilities: P$P") and input and output redirection: )hell variables:
)hell commands: Control structures: )hell script e1amples: e1t4: $A'I4 Architecture; Jserlevel
$nstruction )et Architecture: Runtime and )oft*are Conventions: )!stem $nstruction )et
Architecture: -he Register )tac7 "ngine .R)"/2 @ernel "ntr! and "1it; $nteruptions: )!stem
Calls: )ignals: @ernel acces to user memor!: )tac7 un*inding; $A'I4 "&F un*ind sections -he
@ernel Jn*ind $nterface: "mbedding un*ind information in Assembl! code: $mplementation
Aspects2
4nit "". Process !anagement
Process management and *or7ing of signals in Jni1 ' process definition: its relation *ith
its environment through environment variables: command'line arguments4 process memeor!
la!out4 process creation'for7./: process control ' *ait./: *aitpid./4 program loading'e1ec./
famil!4 process termination'e1it./: Se1it./4 non'local goto'set8mp./: long8mp./4 signals'signal
disposition: reliable and unreliable *a!s of signals: creation: pending and deliver! stages4signal
sets'bloc7ing: unbloc7ing4 useful signals')$6$3-: )$6@$&&: )$6-"R: )$6A&R: alarm./:
pause./: "&FI4: &inu1 -as7s: Birtual emor! anagement: Address space for &inu1 Process:
Page -ables: -ranslation &oo7ahead 5uffers: Page Faults: emor! Coheranc!: )*itching
Address spaces2
4nit """. #d0anced "/O in 4nix
$ntroduction: )treams and file ob8ects: )tandard $nput: )tandard (utput: and )tandard
"rror: 5uffering: opening reading A *riting in streams: 3onbloc7ing $9(: Record loc7ing:
streams: $9( multiple1ing: as!nchronous $9(: readv A *ritev functions: readn A *riten
functions: emor! mapped $9(:
4nit "5. "nter9,rocess Communication
$nter Processes communication *ithin the s!stem and their applications in net*or7
programming; t!pes of $PC'pipes: F$F(s: essage >ueues: )emaphores: )hared memor!4 pipes'
characteristics: creating a pipe: *riting and reading from a pipe: popen./: s!nchroni<ation:
process pipe'lining: co'processes4 F$F('names pipe: characteristics: contrast *ith pipes:
opening: reading and *riting: non'bloc7ing option4 essage >ueues'characteristics: contrast
*ith pipes9fifos: concept of 7e! space: identifier: for7./: msgget./: msgsnd./: msgrcv./:msgctl./4
semaphores' characteristics: semget./:semop./:semctl./: semad8 variable usage4 shared memor!'
characteristics: fastest $PC: shmget./:shmat./:shmdt.0:shmctl./2
4nit 5. !utithreading in 41"G
Different models of concurrent server design; ultiple1ing: For7ing: ultithreading:
Prefor7ing: Prethreading: Prefor7ing and Prethreading4 Prefor7ing odels4 Prethreading odels2
-o understand remote procedure calls and practice; RPC model4 stubs and s7eletons4 call
semantics2 -hread $nterface: -hread )!nchroni<ation: )!metric ultiprocessing; ultiprocesing
on &inu1: &inu1 &oc7ing Principles: ultiprocessor support $nterface: CPJ'specific Data area2
4nit 5". "ntroduction to Socket
Jnderstanding of soc7ets; *hat is a soc7et: )tud! of different t!pes of soc7ets; Ra*
soc7ets: Jni1 Domain soc7ets: -CP A JDP soc7ets: Routing soc7ets: soc7et pair: soc7et
descriptor: soc7et address structure for $Pv4 : end point addressing: )tud! of simple: protocol
dependent soc7et program; Design of a simple client and server; da!time server : echo server
*ith and *ithout threading 2
8e3erences7
12 Advanced Programming in the J3$L'H2 Richard )tevens
,2 Jni1 3et*or7 Programming; Bol'$$ $nter Process Communications
E2 $A'I4 &inu1 @ernel; Design and $mplementation: David osberger: He*lett'Pac7ard
Professional 5oo7s: $)531E; MK+01E0I10140: $)5310; 01E0I1014E
#dditiona 8e3erences7
12 -he Design of the Jni1 (perating )!stem' aurice 02 5ach
Eecti0e """
+&'&'*# 9 1etwork Securit2
Teaching Scheme Examination Scheme
Lectures7 % Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '%
4nit ". "ntroduction
)ecurit! -rends: the ()$ )ecurit! Architecture: )ecurit! Attac7s: )ecurit! )ervices:
)ecurit! echanisms: A model for 3et*or7 )ecurit! -he )ecurit! problems: Avenues of
Attac7s
4nit "". Securit2 at each a2er ;
)ecurit! at Application &a!er ; P6P: and )9$": "mail )ecurit! )ecurit! at -ransport &a!er ;
))& A -&): ))& Architecture: Four Protocols: ))& message formats: -ransport la!er securit!
)ecurit! at 3et*or7 &a!er ; $P)ec: -*o odes: -*o )ecurit! Protocols: )ecurit! Association:
securit! Polic!: $nternet @e! "1change .$@"/: $)A@P
4nit """. S2stem Securit2 ;
Description of the s!stem: Jsers: -rust and -rusted s!stems: 5uffer overflo* and
alicious soft*are: malicious program: *orm: viruses: $D): Fire*all2
Fire*alls; 3et*or7 Partitioning: fire*all platforms: partitioning models and methods:
)ecure )3P: )ecure routing interoperabilit!: virtual net*or72
4nit "5. Cr2,togra,hic TechniDues
)ecret versus C PublicD 7e! Cr!ptograph!: -!pes of attac7: -!pes of cipher ' )ubstitution:
transposition: (ther Cipher properties: )ecret 7e! cr!ptograph! : Public 7e! cr!ptograph! and
R)A 7e! management: digital certificates: P@$: identit! based encr!ption: Authentication
4nit 5. Securit2 Poicies and =esign Euideines
Policies; Polic! creation: Regularit! considerations: Privac! regulations2 )ecurit!; $nfrastructure
and components2 Design 6uidelines2 Authentication; Authori<ation and accounting2 Ph!sical and
logical access control2 Jser authentication; 5iometric devices2
4nit 5". Web Securit2
Computer Forensics; evidence : collecting "vidence Chain of Custod!: free space vs
)tac7 space2 -CP9$P Bulnerabilities ; )ecuring -CP9$P )poofing; -he process of an $P spoofing
attac7: Cost of )poofing: -!pes of spoofing: spoofing tools: prevention and itigation
8e3erences7
12 Cr!ptograph! and 3et*or7 )ecurit! # Principles and Practices # Hilliam )tallings
,2 Cr!ptograph! and 3et*or7 )ecurit! # Foro<an an u7hopadha! # c 6ra* Hill
E2 $nformation Assurance A securit! )eries Principles of Computer )ecurit!: )ecurit! O and
5e!ond # Con7lin: Hhite: Cothren: Hilliams: Davis # Dreamtech Press
42 Ches*ic7 H2 5ellovin )2 C Fire*all and $nternet securit! Repelling the Hil! Hac7erD: ,
nd

Addison Hesle!
52 )ecurit! Architecture: design: deplo!ment and operations # Christophr @ing : Curtis:
Dalton and - "rtem (smanoglu
I2 Computer )ecurit! Concepts: $ssues and $mplementation # Alfred 5asta: Holf Halton #
Cengage &earning
+&'&'*< 9 Coud Com,uting
Teaching Scheme Examination Scheme
Lectures7 % Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '%
4nit ". "ntroduction
Cloud computing fundamentals: the role of net*or7s in Cloud computing: "ssential
characteristics of Cloud computing: Cloud deplo!ment model: Cloud service models:
ultitenanc!: Cloud cube model: Cloud economics and benefits: Cloud t!pes and service
scalabilit! over the cloud: challenges in cloud 3$)- guidelines
4nit "". 5irtuaiCation? Ser0er? Storage and 1etworking
Birtuali<ation concepts : t!pes: )erver virtuali<ation: )torage virtuali<ation: )torage
services: 3et*or7 virtuali<ation: )ervice virtuali<ation: Birtuali<ation management:
Birtuali<ation technologies and architectures: $nternals of virtual machine: easurement and
profiling of virtuali<ed applications2 H!pervisors; @B: Len: H!perB Different h!pervisors and
features
4nit """. =ata in coud
)torage s!stem architecture: 5ig data: Birtuali<ed Data Centre .BDC/ architecture: BDC
environments: concepts: planning and design: anaging BDC and cloud infrastructures:
h!brid storage net*or7ing technologies .i)C)$: FC$P:FCo"/: host s!stem design consideration
4nit "5. Coud securit2
Cloud )ecurit! ris7s: )ecurit!: Privac!: -rust: (perating s!stem securit!: )ecurit! of
virtuali<ation: )ecurit! ris7s posed b! shared images: )ecurit! ris7 posed b! a management ():
Loar: -rusted virtual machine monitor
4nit 5. MoS N Muait2 o3 Ser0ice O o3 Coud
-a1onom! and surve! of >o) management and service : )election methodologies for
cloud computing: Auto scaling: &oad balancing and monitoring in open source cloud: Resource
scheduling for Cloud Computing
4nit 5". Coud ,atterns and a,,ication
Cloud Platforms; Ama<on "C, and )E: Cloudstac7: $ntercloud: obile Cloud Designing
an image; Pre'pac7aged image: singleton instances protot!pe images Designing an architecture ;
Adapters: Facades: Pro1ies and balancers Clustering ; -he n'-ier Heb pattern: )emaphores and
&oc7ing ap Reduce Peer'to'Peer frame*or7
8e3erences7
&. Dr2 @umar )aurabh:DCloud ComputingD: Hile! Publication
). 5or7o Furht: CHandboo7 of Cloud ComputingD: )pringer
*. Ben7ata 0os!ula:DCloud computing # Automated virtuali<ed data centerD: C$)C( Press
(. 6reg )chulr:DCloud and virtual data storage net*or7ingD:CRC Press
%. ar7 Carlson:DCloud data management and storageD: c 6ra* hill
+. &i<he Hang: C Cloud Computing;ethodolog!: )!stem and ApplicationsD: CRC Press
-. Cloud computing; Data $ntensive Computing and )cheduling b! Chapman Hall9CRC
.. Christopher 2 o!er: 5uilding Applications in the Cloud; Concepts: Patterns: and
Pro8ects
/. Dan C2 arinescu:D Cloud computing; -heor! and PracticeD:
#dditiona 8e3erences7
&. Antonopoulus: 3i7os: DCloud computing; Principles: )!stems and ApplicationsD:1
st
edition
). Ronald @rut<:DCloud )ecurit!; Comprehensive guide to )ecure Cloud ComputingD:
Hile! Publishing
*. 5arrie )osins7!:DCloud Computing 5ibleD: Hile!
(. Ra87umar 5u!!a:DC&(JD C(PJ-$36 Principles and ParadigmsD:Hile! and )ons:
$nc
%. Anthon! -2 Belte: CCloud Computing; Practical ApproachD: c 6ra* Hill
+. -im ather:DCloud )ecurit! and Privac!D: (?R"$&&N
-. 6autham )hroff: C"nterprise Cloud ComputingD: Cambridge
+&'&'*C 9 Com,uter 5ision and Pattern 8ecognition
Teaching Scheme Examination Scheme
Lectures7 % Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '%
4nit ". <asics o3 =igita "maging
$mage Ac=uisition: )ampling: >uanti<ation: Difference in onochrome and ultichrome
imaging: concept of color spaces: point processing techni=ues: mas7 processing methods: image
filtering: shape in images: edge detection: gradient operators' Roberts: )obel: Pre*itt: Cann!:
)lope magnitude method: morphological image processing: erosion: dilation: opening: closing:
hit'n'miss transform: thinning: -op Hat transformation: 5ottom hat transformation2
4nit "". "mage 8e,resentation and 8egion #na2sis
)hape Descriptors'contour based: region based: 5oundar! based4 -hresholding based
segmentation: Hatershed based )egmentation: 6ra! level Co'occurrence atri1'energ!: entrop!:
ma1imum probabilit!: contrast: correlation4 *avelets: *avelet P!ramids: $mage matching:
similarit! measures: feature e1traction in spatial domain: bloc7 truncation coding: feature
e1traction in transform domain: image transforms: energ! based feature e1traction2
4nit """. Com,uter 5ision #,,ications
$mage Fusion and Clustering' @'means: Bector >uanti<ation: Hierarchical Clustering:
Partitioned Clustering: $mage $npainting: ultisensor image fusion: character recognition: face
recognition: -rademar7 databases: edical $maging: )ignature Berification: Behicular license
plate Recognition: image and Bideo retrieval: )urveillance: Robotic vision: Panoramic vie*
Construction
4nit "5. "ntroduction to Pattern 8ecognition
-ree ClassiTers'Decision -rees: Random Forests4 5a!esian Decision -heor!4 &inear
Discriminants Discriminative Classifiers' )eparabilit!: Perceptions: )upport Bector achines2
4nit 5. =ecision Theor2
Parametric -echni=ues 6enerative ethods grounded in 5a!esian Decision
-heor!; a1imum &i7elihood "stimation: 5a!esian Parameter "stimation: )ufTcient
)tatistics4 3on'Parametric -echni=ues' @ernel Densit! "stimators: Par<en Hindo*: 3earest
3eighbor ethods4 Jnsupervised ethods "1ploring the Data for &atent )tructure' Component
Anal!sis and Dimension Reduction: principal Component Anal!sis
4nit 5". Custering
@'eans: "1pectation a1imi<ation: ean )hift: Bector >uanti<ation' Codeboo7
generation ethods4 ClassiTer "nsembles' 5agging: 5oosting 9 Ada5oost4 6raphical odels
-he odern &anguage of Pattern Recognition and achine &earning' 5a!esian
3et*or7s: )e=uential odels4 3eural 3et*or7s
8e3erence <ooks
12 Robert Haralic7 and &inda )hapiro: GComputer and Robot BisionG: Bol $: $$: Addison Hesle!: 1MME2
,2 David A2 Fors!th: 0ean Ponce: GComputer Bision; A odern ApproachG PH$
E2 R 0ain: R @asturi: : Gachine BisionG, c6ra* Hill
42 R2 (2 Duda: P2 "2 Hart: D2 62 )tor7: CPattern ClassificationD: ,nd "dition: Hile!'$nter'science: 0ohn Hile!
A)ons: ,001
52 David 62 )tor7 and "lad Nom'-ov: CComputer anual in A-&A5 to accompan! Pattern ClassificationD
Hile! $nter'science: ,004
+&'&'*=9 So3t Com,uting
Teaching Scheme Examination Scheme
Lectures7 % Hrs/week Theor2 "n9semester #ssessment7 %' !arks
Theor2 End9semester #ssessment7 %' !arks
Tota Credits 7 '%
Objecti0es7
Design and develop intelligent s!stems in the frame*or7 of soft computing: and to
ac=uire 7no*ledge of scientific application'driven environments2
Outcomes7
)tudents *ho successfull! complete this course *ill be able to
Have a general understanding of soft computing methodologies: including artificial
neural net*or7s: fu<<! sets: fu<<! logic: fu<<! inference s!stems and genetic algorithms4
Design and development of certain scientific and commercial application using
computational neural net*or7 models: fu<<! models: fu<<! clustering applications and
genetic algorithms in specified applications2
4nit "7 So3t Com,uting <asics
$ntroduction: soft computing vs2 hard computing: various t!pes of soft computing
techni=ues: applications of soft computing2 5asic tools of soft computing # Fu<<! logic: neural
net*or7: evolutionar! computing2 $ntroduction; 3eural net*or7s: application scope of neural
net*or7s: fu<<!
logic: genetic algorithm: h!brid s!stems2
4nit ""7 1eura 1etworks
3euron: 3erve structure and s!napse: Artificial 3euron and its model: activation
functions: 3eural net*or7 architecture; single la!er and multila!er feed for*ard net*or7s:
recurrent net*or7s2 Barious learning techni=ues4 perception and convergence rule: Auto'
associative and hetro'associative memor!: perceptron model: single la!er artificial neural
net*or7: multila!er perception model4 bac7 propagation learning methods: effect of learning rule
co'efficient 4bac7 propagation algorithm: factors affecting bac7 propagation training:
applications2
4nit """7 >uCC2 Logic
5asic concepts of fu<<! logic: Fu<<! sets and Crisp sets: Fu<<! set theor! and operations:
Properties of fu<<! sets: Fu<<! and Crisp relations: Fu<<! to Crisp conversion2 embership
functions: interference in fu<<! logic: fu<<! if'then rules: Fu<<! implications and Fu<<!
algorithms: Fu<<!fications A Defu<<ifications: Fu<<! Controller: Fu<<! rule base and
appro1imate reasoning; truth values and tables in fu<<! logic: fu<<! propositions formation of
rules :decomposition of compound rules: aggregation of fu<<! rules: fu<<! reasoning: fu<<!
inference s!stem: fu<<! e1pert s!stems2
4nit "57 Eenetic #gorithm
5asic concepts: *or7ing principle: procedures of 6A: flo* chart of 6A: 6enetic
representations: .encoding/ $nitiali<ation and selection: 6enetic operators: utation:
6enerational C!cle: -raditional algorithm vs genetic algorithm: simple 6A: general genetic
algorithm: schema theorem: Classification of genetic algorithm: Holland classifier s!stems:
genetic programming: applications of genetic algorithm: Convergence of 6A: Applications A
advances in 6A: Differences A similarities bet*een 6A A other traditional method: applications2
4nit 57 E0outionar2 com,uting
Role of biologicall! inspired soft*are: Difficulties in search: optimi<ation and machine
learning: (vervie* of natural evolution and its abilities: "volutionar!
Programming9"volutionar! )trategies
$ssues in evolutionar! search: appl!ing an evolutionar! algorithm: Artificial &ife: Ant colon!
optimi<ation: )*arm intelligence
4nit 5"7 #,,ication areas o3 so3t com,uting
(ptimi<ation: function regression: )cheduling: Fraud detection: Anomal! detection:
Design Robot or agent control: $nteractive tools such as music composition: art generation:
decision ma7ing and others2
Text <ooks7
12 )2 Ra8se7aran A 62A2 Bi8a!ala7shmi Pai: C3eural 3et*or7s:Fu<<! &ogic and 6enetic
Algorithm;)!nthesis and ApplicationsD Prentice Hall of $ndia2
,2 32P2Padh!:DArtificial $ntelligence and $ntelligent )!stemsD (1ford Jniversit! Press2
E2 3euro'Fu<<! and )oft Computing: 0 ) R 0ang: C- )un and "2i<utani : PH$ PB- &-D2
42 Principles of soft computing #b! )ivandudam and Deepa: 0ohn i7e! $ndia2
8e3erence <ooks7
12 )iman Ha!7in:D3eural 3eto*r7sDPrentice Hall of $ndia
,2 -imoth! 02 Ross: CFu<<! &ogic *ith "ngineering ApplicationsD Hile! $ndia2
3. "iben and )mith: C$ntroduction to "volutionar! ComputationG: )pringer2
+&'&'( 9 Seminar9 ""
Teaching Scheme Examination Scheme
Practica7 ( Hrs/week TW7 %' !arks
Presentation Ora7 %' !arks
Tota Credits7 '(
)eminar based on state'of'the art in the selected electives2 -he presentation and the report should
cover motivation: mathematical modeling: data'table discussion and conclusion2 -he reports to
be prepared using &A-"L derivative2 -o maintain the =ualit! of the seminar *or7 it is
mandator! on the seminar guides to maintain a progressive record of the seminar contact Hrs of 1
Hrs per month per seminar *hich shall include the discussion agenda: *ee7l! outcomes achieved during
practical sessions: corrective actions and comments on the progress report as per the plan submitted b!
the students including dates and timing: along *ith the signature of the student as per the class and
teacher time table .as additional teaching load/4 such record of progressive *or7 shall be referred b! the
e1aminers during evaluation2
+&'&'% H =issertation Stage9"
Teaching Scheme Examination Scheme
Practica7 . Hrs/week/student TW7 %' !arks
O87 %' !arks
Tota Credits7 '.
!oti0ation? Probem statement? sur0e2 o3 journa ,a,ers reated to the ,robem statement?
,robem modeing and design using set theor2? 1P9Hard ana2sis? S8S? 4!L? Casses? Signas?
Test scenarios and other necessar2? ,robem s,eci3ic 4!L? so3tware engineering documents.
)tudent should publish one $nternational 0ournal Paper .having $))3 3umber and preferabl! *ith
Citation $nde1 $$/4 or paper can be published in reputed $nternational 0ournal recommended b! the guide
of the Dissertation and in addition to above the term *or7 shall include the paper published: revie*ers
comments and certificate of presenting the paper in the conference organi<ed9sponsored b! the 5oard of
)tudies in Computer "ngineering2 -o maintain the =ualit! of the dissertation *or7 it is mandator! on the
dissertation guides to maintain a progressive record of the dissertation contact Hrs of 1 Hrs per *ee7 *hich
shall include the dissertation discussion agenda: *ee7l! outcomes achieved during practical sessions: corrective
actions and comments on the progress report as per the plan submitted b! the students including dates and timing:
along *ith the signature of the student as per the class and teacher time table4 such record of progressive *or7
shall be referred b! the dissertation e1aminers during evaluation2 At the most + dissertations can be assigned to a
guide2
"m,ortant 1ote regarding a O,en Eecti0es
(pen "lective proposal shall be .current state'of the art in Computer "ngineering or $nter'
disciplinar! or intra'disciplinar!/ focusing algorithms: technologies developed using computing
or s!stems programming .@ernel level9 "mbedded/ or virtuali<ation or useful for the
professional gro*th: if an!: to be for*arded to the 5o): Computer "ngineering for necessar!
approvals on or before the month of December ever! !ear2 -he teaching shall be done through
$ndustr!'$nstitute $nteraction9invited tal7s9*ebminars etc2
Semester 9 "5
+&'&'+ 9 Seminar9 """
Teaching Scheme Examination Scheme
Practica7 % Hrs/week TW7 %' !arks
Presentation Ora7 %' !arks
Tota Credits7 '%
)eminar based on selected research methodolog! preferabl! algorithmic design advances as an
e1tension to seminar'$$2 -he presentation should cover motivation: mathematical modeling: data'
table discussion and conclusion2 -he reports shall be prepared using &A-"L derivative2 -o
maintain the =ualit! of the seminar *or7 it is mandator! on the seminar guides to maintain a
progressive record of the seminar contact Hrs of 1 Hrs per month per seminar *hich shall include the
discussion agenda: *ee7l! outcomes achieved during practical sessions: corrective actions and comments
on the progress report as per the plan submitted b! the students including dates and timing: along *ith the
signature of the student as per the class and teacher time table .as additional teaching load/4 such record
of progressive *or7 shall be referred b! the e1aminers during evaluation2
+&'&'+ H =issertation Stage9""
Teaching Scheme Examination Scheme
Practica7 )' Hrs/week/student TW7 &%' !arks
O87 %'
Tota Credits7 )'
Seection o3 Technoog2? "nstaations? 4!L im,ementations? testing? 8esuts? ,er3ormance
discussions using data tabes ,er ,arameter considered 3or the im,ro0ement with existing
known agorithms and com,arati0e gra,hs to su,,ort the concusions drawn. )tudent
should publish one $nternational 0ournal Paper .having $))3 3umber and preferabl! *ith
Citation $nde1 $$/4 or paper can be published in reputed $nternational 0ournal recommended b!
the guide of the Dissertation and in addition to above the term *or7 shall include the paper
published: revie*ers comments and certificate of presenting the paper in the conference
organi<ed9sponsored b! the 5oard of )tudies in Computer "ngineering2 -o maintain the =ualit!
of the dissertation *or7 it is mandator! on the dissertation guides to maintain a progressive
record of the dissertation contact Hrs of 1 Hrs per *ee7 *hich shall include the dissertation discussion
agenda: *ee7l! outcomes achieved during practical sessions: corrective actions and comments on the
progress report as per the plan submitted b! the students including dates and timing: along *ith the
signature of the student as per the class and teacher time table4 such record of progressive *or7 shall be
referred b! the dissertation e1aminers during evaluation2 At the most + dissertations can be assigned to a
guide2
"m,ortant 1ote 8egarding a O,en Eecti0es
(pen "lective proposal shall be .current state'of the art in Computer "ngineering or $nter'disciplinar! or
intra'disciplinar!/ focusing algorithms: technologies developed using computing or s!stems programming
.@ernel level9 "mbedded/ or virtuali<ation or useful for the professional gro*th: if an!: to be for*arded to
the 5o): Computer "ngineering for necessar! approvals on or before the month of December ever! !ear2
-he teaching shall be done through $ndustr!'$nstitute $nteraction9invited tal7s9*ebminars etc2
Toos 3or the Laboratories7 The aboratories must be eDui,,ed with adeDuate? we maintained
working resources as ,er the so3tware/eDui,ment/toos ist ,ubished b2 the <oard o3 Studies time
to time. >or maintaining the Duait2 and e33ecti0e ,er3ormance the <oard o3 Studies ma2 ,ubish
the Duait2 guideines 3or e33ecti0e conduct o3 the aboratories? seminars and dissertation.