ME Computer Engineering Syllabus_5!8!13

8/12/2019 ME Computer Engineering Syllabus_5!8!13

1/37

Syllabus for ME (Computer Engineering)Course 2013 (w.e.f 2013)

SubjectCode Subject

TeachingScheme

Hrs/WeekExamination Scheme Credits

Lect. PractPaper

Tw Ora/Presentation

!arks

"nSemester#ssessment

EndSemester#ssessment

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 )& '( )%' )%' %' %' +'' )%

SubjectCode

SubjectTeachingScheme

Hrs/Week

Examination Scheme Credits

Lect. Pract Pa,er TwOra/Presentation !arks



SE!$ ""

%&'&'- (perating )!stem Design 04

50 50

100(

%&'&' )oft*are Design and Architecture 04

50 50

100(


2/37

%&'&' #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&- ' )'' )'' &'' &'' +'' )%

SubjectCode


Hrs/Week


Lect. Pract Pa,er TwOra/Presentation !arks

"nSemester#ssess

ment

EndSemester#ssess

mentSE!$ """

+&'&'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&- ' &%' &%' &'' &'' %'' )%

SubjectCode


Hrs/Week


Lect. Pract Pa,er Tw Ora/Presentation !arks




3/37

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. Programsunder faculty of Engineering effective from June 2013;.

Eecti0es7

Eecti0e " Eecti0e ""&'&'%# "nteigent S2stems %&'&&'#


4/37

%&'&'&9 #,,ied #gorithmsTeaching Scheme Examination SchemeLectures7 (Hrs/week Theor2 "n9semester #ssessment7 %' !arks

Theor2 End9semester #ssessment7 %' !arksTota Credits 7 '(

Objecti0es

-his course covers selected topics in algorithms that have found applications in areassuch 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 #gorithmsRevie* of algorithmic strategies: As!mptotic anal!sis; upper and lo*er compleit!

bounds2 $dentif!ing differences among best: average and *orst Case ehaviors2 ig (:little (: omega and theta notations: )tandard compleit! classes2 "mpirical measurements ofperformance2 -ime and space trade'offs in algorithms2 Anal!undamenta Com,uting #gorithms3umerical algorithms: )e=uential and binar! search algorithms2 >uadratic sorting algorithms

and ( .n log n/ sorting algorithms2 Algorithms on graphs and their compleities using 6reed!Approach for ''' Prim?s and @rush7al?s Algorithm for minimum spanning tree: )ingle sourceshortest path Algorithm: all pair shortest paths in 6raph

4nit """. #,,roximation #gorithms$ntroduction: Absolute approimation: "psilon approimation: Pol!nomial time

Approimation schemes: probabilisticall! good algorithms2

4nit "5. eometric #gorithms

Prere=uisites # asic properties of line: intersection of line: line segment: pol!gon:etc2 &inesegment properties: detaining segment intersection in time compleit! .n log n/:Conve fullproblem # formulation: solving b! 6raham scan algorithm: arvis march algorithm closest pairof points # problem formulation: solving b! divide con=uer method24nit 5. Linear Programming

)tandard and )lac7 forms: formulation of problems as linear programs: simple algorithm:dualit!: initial basic feasible solution2

Problem formulation for # single source shortest path: maimum flo* problem: Berte coverproblem: @napsac7 problem24nit 5". Probabiit2


5/37

52 )2 aase: ) and A2 Ban 6elder: GComputer Algorithms; $ntroduction to Design andAnal!sisG: Erd edition2 Addison esle!:,000

I2 Aho: Hopcraft: Jllman: -he Design and Anal!sis of Computer Algorithms: Addisonesle!

K2 @nuth: Art of Programming: Addison esle!+2 C Papadimitriou and @ )teiglit


6/37

%&'&') 9 High Per3ormance =atabasesTeaching Scheme Examination SchemeLectures7 ( Hrs/week Theor2 "n9semester #ssessment7 %' !arks


41"T ". Ph2sica database design F Tuning

Database *or7loads: ph!sical design and tuning decisions: 3eed for -uning"ndex seection76uideline for inde selection: Clustering $ndeing -ools for inde selection=atabase Tuning; -uning indees: -uning Conceptual schema -uning >ueries vie*s: $mpactof Concurrenc!: enchmar7ing

41"T "". =istributed =atabases

$ntroduction: Design Frame*or7: Design of database fragmentation: -he Allocation ofFragments: -ranslation of global =ueries to fragment =ueries: (ptimiuer!: )torage of L& data:G!LTechnoogies 7 D( )AL $nterfaces L pointer: Llin7: LH-&: )(AP: )D&:

JDD$:L& database Application2

41"T 5. Emerging Trends in =atabases

$ntroduction: otivation: -emporal databases: )patial geographic databases: ultimediaDatabases: obilit! personal Databases

41"T 5". #d0anced #,,ication =e0eo,ment

Performance -uning: Performance enchmar7s: )tandardi


7/37

%&'&'*9 #d0anced Com,uter #rchitectureTeaching Scheme Examination SchemeLectures7 ( Hrs/week Theor2 "n9semester #ssessment7 %' !arks


4nit " "ntroduction to architectures and Com,uting !odes

"volution in processor development: 6eneric computer architecture: Data representation:$nstruction sets: data path and control: memor! management: uses and peripherals: 3et*or7ingand communication: ultiprocessor and multicomputer: multivector and )$D s!stems:PRA and B&)$ models: net*or7 properties: conditions for parallelisms: partitioning andscheduling: program flo* mechanisms: s!stem interconnect architectures

4nit "" Per3ormance metricsetrics and measures for parallel programs: )peedup performance la*s: scalabilit! anal!sisapproaches: Amdahl?s la*: limitation: enchmar7: )$D: $D Performance2

4nit """ Hardware ,araeismProcessor and memor! hierarch!' Advanced processor technolog!: superscalar and vector

processors: memor! hierarch!: virtual memor!: shared memor! organiuantitative Approach: ohn & Henness!: David a Patterns: 4 th"dition:

"lsevier: $)3; MKI'I1'E1,'0K,1'0


8/37

%&'&'(9 8esearch !ethodoog2Teaching Scheme Examination SchemeLectures7 ( Hrs/week Theor2 "n9semester #ssessment7 %' !arks


(b8ective; to introduce the student to research methodolog!: and to prepare them forconduct independent research

4nit ". 4nderstand the research ,rocess

"volution of research methodolog! eaning: nature: scope: and significance of researchResearch paradigm (b8ectives of research: otivation for research Postulates underl!ingscientific investigations -!pes of research Research process and *or7flo* Principles of ethics:ethical considerations in research $ntellectual Propert! Rights .$PR/4nit "". Probem identi3ication and h2,othesis 3ormuation)electing an area for research Problem identification &iterature search Jnderstandingreported research Fitting the pieces Ascertaining current state of 7no*ledge )ources ofinformation Recording literature search findings Defining the problem H!pothesis formulation4nit """. 8esearch design

-!pe of research designs: pitfalls and advantages Research approaches Principles ofeperimental design Design of eperiments Characteristics of good research design Jniverse:population: and sample )ampling concepts: principles: and techni=ues )ample design .random:pseudo random: cluster: stratified: multi'stage/ )ampling considerations .si


9/37

ELECT"5E9"

%&'&'%#9 "nteigent S2stemsTeaching Scheme Examination SchemeLectures7 % Hrs/week Theor2 "n9semester #ssessment7 %' !arks

Theor2 End9semester #ssessment7 %' !arksTota Credits 7 '%

&. "ntroduction"nteigent #gents7 $ntroduction2 Agents and "nvironments: 6ood ehavior; -he Concept of

Rationalit!: -he 3ature of "nvironments: -he )tructure of Agents2Probem >ormuation7 Problem')olving Agents: "ample 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


10/37


11/37

%&'&'%C9 !achine Learning and TransationTeaching Scheme Examination SchemeLectures7 % Hrs/week Theor2 "n9semester #ssessment7 %' !arks


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 andParadigms: 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 algorithms26aussian discriminant anal!sis2 3aive a!es2 )upport vector machines2 odel selection andfeature selection2 "nsemble methods; agging: boosting2 "valuating and debugging learningalgorithms2 BC dimension2 orst case .online/ learning2 Practical advice on ho* to use learningalgorithms2 easuring &earning Performance: &earning and @no*ledge building? Clustering2 @'means2 "2 iture 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 !achineLearning

)!stemic achine &earning: achine'&earning Frame*or7: ulti'perspective Decisiona7ing 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'ased and odel'Free ethods/: D!namic Programming: Adaptive D!namic

Programming: "ample; Reinforcement &earning for oing -rainer

4nit 5. !achine Learning !odes and "n3erence

A Frame*or7 for &earning: Capturing the )!stemic Bie* for learning: athematicalRepresentation of )!stem $nteractions: $mpact Function: Decision'$mpact Anal!sis2 $nferenceechanisms and 3eed: $ntegration of Contet and $nference: )tatistical $nference and $nduction:Pure &i7elihood Approach: Appl!ing a!esian Paradigm and $nference: -ime'ased $nference:$nference to uild a )!stem Bie*: Appl!ing a!esian &earning: Appl!ing )B: Appl!ing6aussian maimum li7elihood

4nit 5". #da,ti0e and "ncrementa !achine LearningAdaptive &earning and Adaptive )!stems: Adaptive achine &earning: Adaptation and

&earning ethod )election ased on )cenario: Applications of Adaptive &earning: Competitive&earning and Adaptive &earning: $ncremental &earning: &earning from hat $s Alread!&earned: )upervised $ncremental &earning: $ncremental Jnsupervised &earning and $ncrementalClustering: )emi'supervised $ncremental &earning: $ncremental and )!stemic &earning:$ncremental Closeness Balue and &earning ethod: &earning and Decision'a7ing odel:$ncremental Classification -echni=ues


12/37

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'ased &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 Comple &earning )cenarios

4nit 5""".


13/37

%&'&'%=9 8ea Time S2stems

Teaching Scheme Examination SchemeLectures7 % Hrs/week Theor2 "n9semester #ssessment7 %' !arks


4nit ". "ntroduction

$ssues in Real'-ime Computing: )tructures of Real'-ime )!stem: -as7 Classes: Performanceeasures for Real'-ime )!stems: "stimating Program Run -imes

4nit "". Task #ssignment and ScheduingClassical Jni'processor )cheduling algorithm: Jni'processor )cheduling of $R$) -as7s: -as7Assignment: ode Changes: Fault -olerant )cheduling

4nit """. Programming Languages and ToosDesired &anguage characteristics: Data -!ping : Control )tructures : Facilitating HierarchicalDecomposition: Pac7ages: Runtime "rror ."ception/ Handling: (verloading and 6enerics:ultitas7ing :&o*'&evel Programming: -as7 )cheduling: -iming )pecifications: )omeeperimental &anguages: Programming "nvironments: Run'-ime )upport2

4nit "5. 8ea9Time =atabases

asic Definitions: Real'-ime Bs 6eneral'Purpose Databases: ain emor! Databases:-ransaction Priorities: -ransaction Aborts: Concurrenc! Control $ssues: Dis7 )chedulingalgorithm: A -*o Phase Approach -o $mprove Predictabilit!: aintain )eriali


14/37

%&'&'+9 Laborator2 Practice9 "

Teaching Scheme Examination SchemePractica7 ( Hrs/week O87 %' !arks

TW7 %' !arksTota 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 -uringmachine: multipleer logic inducing concurrenc! and perform 3P'Hard anal!sis for thesolution 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!2Prepare architecture diagram and installation document to be used for the assignmentnumber E

E2 $mplement Digital &ibrar! $nfrastructure using Hadoop or )imilar recent technolog! fordistributed database storage2 -o develop front end 6J$ and algorithm for searching themultimedia resource files: presentations in the selected domain: author: boo7 title: $)322Jse different search eploration techni=ues2

Or Assignments e=uivalent to above assignments2

42 "lective teacher shall design four suitable assignments based on "lective $ maintainingabove =ualit! of the assignments2

52 Design and implement class9classes using latest I4'bit COO9ABA9 P!thon9>- 521 andabove: Cuda COO or such latest I4'bit programming tools for the implementation of -*o8ournal .$""" -ransactions9AC "lsevier9)pringer/ papers published in the current !earrelated to the respective elective sub8ects2 Development -ools such as

A-&A9(P"3CB9(P"3P93)E or e=uivalent ma! be used if re=uired to interfacethe developed classes to the simulators2

Toos 3or the Laboratories7 The aboratories must be eDui,,ed with adeDuate? wemaintained working resources as ,er the so3tware/eDui,ment/toos ist ,ubished b2 theor maintaining the Duait2 and e33ecti0e ,er3ormance the


15/37

Semester 9 ""

%&'&'-9 O,erating S2stem =esign

Teaching Scheme Examination SchemeLectures7 ( Hrs/week Theor2 "n9semester #ssessment7 %' !arks


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: Deviceas Files: -he process Concept: Communication bet*een Processes: J3$L')t!le ProcessCreation: )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


16/37

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


17/37

%&'&'9So3tware =esign and #rchitectureTeaching Scheme Examination Scheme

Lectures7 ( Hrs/week Theor2 "n9semester #ssessment7 %' !arksTheor2 End9semester #ssessment7 %' !arks

Tota Credits 7 '(4nit ". So3tware =esign Process

Role of )oft*are Design7 )oft*are design process: nature of design process: design=ualities -ransferring Design @no*ledge; describe design solution: transferring design7no*ledge: design notations: design strategies:

4nit "". Object Oriented =esignCreational: )tructural: behavioural design patterns: Component based design: Formal

Approach to design

4nit """. "ntroduction to So3tware #rchitecturehat $s )oft*are Architecture h! $s )oft*are Architecture $mportant >ualit!

Attributes: Architecture and Re=uirements: Designing an Architecture: Documenting soft*areArchitecture: 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 ofthe odule Bie*t!pe: "ecution 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: RuleArchet!pe pattern2

4nit 5". So3tware #rchitectures

(b8ect'(riented Paradigm: Data Flo* Architectures: Data'Centered )oft*areArchitecture: Hierarchical Architecture: $nteraction'(riented )oft*are Architectures: DistributedArchitecture: Component'ased )oft*are Architecture: Heterogeneous Architecture:Architecture of Jser $nterfaces: $mplicit as!nchronous communication soft*are architecture28e3erence ian: Liang Fu: &iin -ao: )oft*are Architecture and Design $lluminated: ones artlett &earning: ,00M: $)3 0KIEK54,0L: MK+0KIEK54,04


18/37

%&'&'9 #d0anced Com,uter 1etworksTeaching Scheme Examination SchemeLectures7 ( Hrs/week Theor2 "n9semester #ssessment7 %' !arks


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: resourceallocation: obilit!: 3et*or7ed applications: Data in support of net*or7 design: 6eneralPrinciples of 3et*or7 Design: net*or7 characteristics2

4nit ""

Dela! odels in Data 3et*or7s; odeling and Performance evaluation2 ultipleing 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! >ueuing4nit """

odeling 3et*or7s as 6raphs: Problems algorithms; ultipoint line topolog!' C)-:"sau'illiam?s Algorithm: )harma?s Algorithm: in Pac7ing algorithms2 -erminal Assignment'6reed! algorithm and echange algorithms: Concentrator location' C(: Add: Drop:Relaation algorithm2 3et*or7 of =ueues: (pen: closed and semi'open =ueues: 3et*or7 node:@leinroc7?s $ndependent approimation2

4nit "5

>ualit! of )ervice in 3et*or7s; Application and >o): >o) mechanisms: >ueue managementAlgorithms: Feedbac7: Resource reservations: traffic engineering: Jbi=uitous Computing;Applications and Re=uirements: )mart Devices and )ervices: )mart obiles: Cards and Device3et*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; ireless and sensor net*or7s: multimedianet*or7ing: content distribution net*or7s: computer net*or7 simulation: Domain'specificnet*or7s: 3et generation net*or7s: C!ber ph!sical s!stems2

8e3erences7

12 @ershenbaum A2: -elecommunication 3et*or7 Design Algorithms: -ata c6ra* Hill

,2 )imulation odeling and anal!sis: Averill 2 &a*: 2 D2 @elton

E2 Computer 3et*or7s: Priciples: -echnologies and Protocols for net*or7 design 3atalia (lifer:

Bictor (lifer: ile! $ndia

42 Jbi=uitous Computing: )tefan Poslad: $&"N $3D$A "D$-$(3


19/37

Eecti0e ""

%&'&&'# 9


20/37

%&'&&'< 9 4sabiit2 EngineeringTeaching Scheme Examination Scheme

Lectures7 % Hrs/week Theor2 "n9semester #ssessment7 %' !arksTheor2 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 andConceptuali


21/37

8e3erences712 &inda caula!: HC$ for )oft*are Designers:$nternational -hompson Computer Press:J)A:1MM+2,2 en )chneiderman: GDesigning the Jser $nterfaceG: Pearson "ducation: 3e* Delhi:,0052E2 Alan Cooper: G-he "ssentials of Jser $nterface DesignG: $D6 oo7s: 3e* Delhi:1MM5242 acob 3ielsen: GJsabilit! "ngineeringG: Academic Press: 1MME252 Alan Di et al: GHuman ' Computer $nteractionG: Prentice Hall: J)A:1MME2I2 "lements of Jser $nterface Design ' -heo andel: ohn ile! )ons

K2 $nteraction Design # Preece: Roger: )harp: ohn ile! )ons +2 (b8ect odeling Jser $nterface Design ' ar7 Hamelen


22/37

%&'&&'C 9 #d0anced Com,ier =esignTeaching Scheme Examination Scheme


Tota Credits 7 '%


3otation and Concepts for &anguages and 6rammars: -raditional compilers: structure ofcompiler: architecture: properties: portabilit! and re'targetabilit!: optimiunctiona F Logic Programs

(ffside rules: &ists: &ist comprehensions: pattern matching: pol!morphic t!ping:referential transparenc!: High'order functions: la

pol!morphic t!pe chec7ing: Desugaring: 6raph reduction: Code generation for functional: coreprograms: (ptimi


23/37

%&'&&'= 9 Embedded S2stems =esignTeaching Scheme Examination Scheme


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: atter! ac7up

)RA: "PR( and (-P: Parit!: "rror Detection and Correcting emor!: Access times: Pac7ages:DRA $nterfaces: DRA Refresh -echni=ues: (ptimi


24/37

%&'&&&9 Laborator2 Practice9 ""Teaching Scheme Examination SchemePractica7 ( 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'riter Problem solution b! creating multiple processes and shareregions or bloc7s2 Jse I4'bit &inu derivative and tools for implementation2

,2 rite a program to identif! the least used icons9files9folders on the des7top and move themto temp folder created in Documents2

E2 Create a computing facilit! grid using net*or7s for ooth?s multiplication .I4'bit/ usingsign'etension method2 here bit multiplication: additions and merging of the additionresults 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 -henet*or7 controlling node *ill be submitted *ith files having total distributed storage of 1000numbers as a )A3 =ueued for the eecution in sorted manner on the lesser cost due to lengthof the multiplier and displa! the results along *ith the net*or7 trac7ing report for thed!namic allocation of multiplier and addition nodes along *ith the sleeping9 inactive9unutili


25/37

%&'&&)9 Seminar9 "

Teaching Scheme Examination SchemePractica7 ( Hrs/week TW7 %' !arks

Presentation Ora7 %' !arksTota Credits7 '(

)tate'of'the'art topic approved b! the guide useful for professional gro*th in the filed ofepertise2 -he presentation should cover motivation: mathematical modeling: data'tablediscussion 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 progressiverecord of the seminar contact Hrs of 1 Hrs per month per seminar *hich shall include the discussionagenda: *ee7l! outcomes achieved during practical sessions: corrective actions and comments on theprogress report as per the plan submitted b! the students including dates and timing: along *ith thesignature of the student as per the class and teacher time table .as additional teaching load/ such recordof progressive *or7 shall be referred b! the eaminers during evaluation2


26/37

Semester """

+&'&'&9 #d0anced Storage S2stems and "n3rastructure !anagementTeaching Scheme Examination SchemeLectures7 ( Hrs/week Theor2 "n9semester #ssessment7 %' !arks


Objecti0es7

Jnderstanding components of modern information storage infrastructure2

Jpon successful completion of this course: participants should be able to;

"valuate storage architecture understand logical and ph!sical components of a storageinfrastructure including storage subs!stems

Describe storage net*or7ing technologies and data archival solution

Jnderstand and articulate business continuit! solutions including: bac7up and recover!technologies: and local and remote replication solutions

$dentif! parameters of infrastructure management and describe common infrastructuremanagement activities and solutions

PrereDuisites-o understand the content and successfull! complete this course: a participant must have a basicunderstanding 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 ofdata to a business: Challenges in Data )torage and anagement: Data )torage $nfrastructure2Components of a )torage )!stem "nvironment; Dis7 drive components: Dis7 Driveperformance: &ogical Components2

Data protection;concept of RA$D and different RA$D levels .RA$D 0: 1: E: 5: 0O191O0:and I/$ntelligent )torage )!stem .$))/ and its components: $mplementation of $)) as high'end

and midrange storage arra!s2

4nit ""7 =i33erent Storage Technoogies and 5irtuaiation

$ntroduction to 3et*or7ed )torage; "volution of net*or7ed storage: Architecture:(vervie* of FC')A3: 3A): and $P')A32 3et*or7'Attached )torage .3A)/; enefits of 3A):Components: $mplementations: File )haring: $9( operations: Performance and Availabilit!2Content Addressed )torage .CA)/; features and enefits of a CA)2 CA) Architecture: )torage

and Retrieval: "amples2)torage Birtuali


27/37

4nit """7


28/37

+&'&')9 #d0anced 4nix ProgrammingTeaching Scheme Examination SchemeLectures7 ( Hrs/week Theor2 "n9semester #ssessment7 %' !arks


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: or7ing*ith ourn shell; )hell responsibilities: P$P") and input and output redirection: )hell variables:)hell commands: Control structures: )hell script eamples: et4: $A'I4 Architecture; Jserlevel$nstruction )et Architecture: Runtime and )oft*are Conventions: )!stem $nstruction )etArchitecture: -he Register )tac7 "ngine .R)"/2 @ernel "ntr! and "it; $nteruptions: )!stemCalls: )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: $mplementationAspects2

4nit "". Process !anagement

Process management and *or7ing of signals in Jni ' process definition: its relation *ithits environment through environment variables: command'line arguments process memeor!la!out process creation'for7./: process control ' *ait./: *aitpid./ program loading'eec./famil! process termination'eit./: Seit./ non'local goto'set8mp./: long8mp./ signals'signaldisposition: reliable and unreliable *a!s of signals: creation: pending and deliver! stagessignalsets'bloc7ing: unbloc7ing useful signals')$6$3-: )$6@$&&: )$6-"R: )$6A&R: alarm./:pause./: "&FI4: &inu -as7s: Birtual emor! anagement: Address space for &inu Process:Page -ables: -ranslation &oo7ahead uffers: Page Faults: emor! Coheranc!: )*itchingAddress spaces2

4nit """. #d0anced "/O in 4nix$ntroduction: )treams and file ob8ects: )tandard $nput: )tandard (utput: and )tandard

"rror: uffering: opening reading *riting in streams: 3onbloc7ing $9(: Record loc7ing:streams: $9( multipleing: as!nchronous $9(: readv *ritev functions: readn *riten

functions: emor! mapped $9(:

4nit "5. "nter9,rocess Communication

$nter Processes communication *ithin the s!stem and their applications in net*or7programming; t!pes of $PC'pipes: F$F(s: essage >ueues: )emaphores: )hared memor! pipes'characteristics: creating a pipe: *riting and reading from a pipe: popen./: s!nchroniueues'characteristics: contrast*ith pipes9fifos: concept of 7e! space: identifier: for7./: msgget./: msgsnd./: msgrcv./:msgctl./semaphores' characteristics: semget./:semop./:semctl./: semad8 variable usage shared memor!'characteristics: fastest $PC: shmget./:shmat./:shmdt.0:shmctl./2

4nit 5. !utithreading in 41"GDifferent models of concurrent server design; ultipleing: For7ing: ultithreading:

Prefor7ing: Prethreading: Prefor7ing and Prethreading Prefor7ing odels Prethreading odels2-o understand remote procedure calls and practice; RPC model stubs and s7eletons callsemantics2 -hread $nterface: -hread )!nchroni


29/37

4nit 5". "ntroduction to Socket

Jnderstanding of soc7ets; *hat is a soc7et: )tud! of different t!pes of soc7ets; Ra*soc7ets: Jni Domain soc7ets: -CP JDP soc7ets: Routing soc7ets: soc7et pair: soc7etdescriptor: soc7et address structure for $Pv4 : end point addressing: )tud! of simple: protocoldependent 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'2 Richard )tevens,2 Jni 3et*or7 Programming; Bol'$$ $nter Process CommunicationsE2 $A'I4 &inu @ernel; Design and $mplementation: David osberger: He*lett'Pac7ard

Professional oo7s: $)31E; MK+01E0I10140: $)310; 01E0I1014E

#dditiona 8e3erences712 -he Design of the Jni (perating )!stem' aurice 2 ach


30/37

Eecti0e """

+&'&'*# 9 1etwork Securit2Teaching Scheme Examination Scheme


Tota Credits 7 '%


)ecurit! -rends: the ()$ )ecurit! Architecture: )ecurit! Attac7s: )ecurit! )ervices:)ecurit! echanisms: A model for 3et*or7 )ecurit! -he )ecurit! problems: Avenues ofAttac7s

4nit "". Securit2 at each a2er;)ecurit! at Application &a!er ; P6P: and )9$": "mail )ecurit! )ecurit! at -ransport &a!er ;))& -&): ))& 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! "change .$@"/: $)A@P

4nit """. S2stem Securit2;Description of the s!stem: Jsers: -rust and -rusted s!stems: uffer overflo* and

alicious soft*are: malicious program: *orm: viruses: $D): Fire*all2Fire*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 Public 7e! Cr!ptograph!: -!pes of attac7: -!pes of cipher ' )ubstitution:

transposition: (ther Cipher properties: )ecret 7e! cr!ptograph! : Public 7e! cr!ptograph! andR)A 7e! management: digital certificates: P@$: identit! based encr!ption: Authentication

4nit 5. Securit2 Poicies and =esign uideines

Policies; Polic! creation: Regularit! considerations: Privac! regulations2 )ecurit!; $nfrastructure

and components2 Design 6uidelines2 Authentication; Authori


31/37


32/37

. Dan C2 arinescu: Cloud computing; -heor! and Practice:

#dditiona 8e3erences7&. Antonopoulus: 3i7os: Cloud computing; Principles: )!stems and Applications:1st

edition). Ronald @rut


33/37

+&'&'*C 9Com,uter 5ision and Pattern 8ecognitionTeaching Scheme Examination Scheme


Tota Credits 7 '%

4nit ".


34/37

+&'&'*=9 So3t Com,utingTeaching Scheme Examination SchemeLectures7 % Hrs/week Theor2 "n9semester #ssessment7 %' !arks


Objecti0es7

Design and develop intelligent s!stems in the frame*or7 of soft computing: and toac=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: fucomputational neural net*or7 models: fu4nit "7 So3t Com,uting

3euron: 3erve structure and s!napse: Artificial 3euron and its model: activationfunctions: 3eural net*or7 architecture; single la!er and multila!er feed for*ard net*or7s:recurrent net*or7s2 Barious learning techni=ues perception and convergence rule: Auto'associative and hetro'associative memor!: perceptron model: single la!er artificial neuralnet*or7: multila!er perception model bac7 propagation learning methods: effect of learning ruleco'efficient bac7 propagation algorithm: factors affecting bac7 propagation training:applications2

4nit """7 >u2 Logic

asic concepts of fu


35/37

4nit 57 E0outionar2 com,uting

Role of biologicall! inspired soft*are: Difficulties in search: optimi

8e3erence


36/37

+&'&'( 9 Seminar9 ""

Teaching Scheme Examination SchemePractica7 ( Hrs/week TW7 %' !arks

Presentation Ora7 %' !arksTota Credits7 '(

)eminar based on state'of'the art in the selected electives2 -he presentation and the report shouldcover motivation: mathematical modeling: data'table discussion and conclusion2 -he reports tobe prepared using &A-"L derivative2 -o maintain the =ualit! of the seminar *or7 it ismandator! on the seminar guides to maintain a progressive record of the seminar contact Hrs of 1Hrs per month per seminar *hich shall include the discussion agenda: *ee7l! outcomes achieved duringpractical 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 andteacher time table .as additional teaching load/ such record of progressive *or7 shall be referred b! theeaminers during evaluation2

+&'&'% =issertation Stage9"

Teaching Scheme Examination SchemePractica7 Hrs/week/student TW7 %' !arks

O87 %' !arksTota 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 ournal Paper .having $))3 3umber and preferabl! *ith

Citation $nde $$/ or paper can be published in reputed $nternational ournal recommended b! the guideof the Dissertation andin addition to above the term *or7 shall include the paper published: revie*erscomments and certificate of presenting the paper in the conference organi


37/37