Syllabus BE (Computer Engineering) 2008 Course

Preamble
Dear Students and Teachers, we, the Board of Studies Computer Engineering, are very happy to present BE Computer Engineering Syllabus (2008 course). We are sure you will find this syllabus interesting and challenging. The objective of the syllabus is to inculcate reading, innovative thinking, technical-writing and presentation habits in the students. Development of skills and imparting knowledge is also important part of syllabus. To achieve these objectives teachers are encouraged to take home tutorials, class tutorials, students presentations and invited talks in addition to the lectures conducted by teachers. Review and interactive discussions on home tutorials, classroom tutorials and students presentation along with review of recent advances in the subject is a must. There is mountainous growth in the areas of computer applications, subjects, technology and algorithms. The computer equipments are becoming very faster, granular with concurrent architectures and operating systems environments. Along with the Industry, the opensource movement has also contributed to the great extent. The education must withstand with this growth and demand of innovation and be the front-runner to lead the path of progress and innovation. We give you best wishes to take this syllabus and travel the path of success.

Board of Studies Computer Engineering

BE (COMPUTER ENGINEERING)- 2008 COURSE STRUCTURE Term-I Subject Subject Teaching Examination Scheme Code Scheme Lect. Pract. Th TW Pr Or 410441 Design & Analysis of 04 100 — Algorithms 410442 Principles of Compiler 04 — 100 — — — Design 410443 Object Oriented Modeling & 04 02 100 25 — 50 Design 410444 410445 410446 410447 Elective-I Elective-II Computer Laboratory-I Project Work Total Total of Part I (A) 03 03 — --18 04 02 10 02 100 100 — --500 25 ------50 100 — — 50 --50 750 50 --— --100

Total Marks 100 100 175 175 100 050 050 750

28 Hrs Term II Teaching Scheme Lect. Pract 04 04 04 04 — — 16 02 --04 06 12 ---

Subject Code 410448 410449 410450 410451 410452 410447

Subject

Examination Total Scheme Marks Th TW Pr Or 100 100 100 100 50 — 50 --- — ----- --- --100 100 200 100 100 150 750

Distributed Operating Systems Advanced Computer Architecture Elective-III Elective-IV Computer Laboratory II Project Work Total Total of Part II (B)

— — 50 50 — — 400 100 — 50 200 50 100 750 1500

28 Hrs

Grand Total (A+B) (A) + (B) Th: Theory TW: Term Work

Pr: Practical Or: Oral

Elective I 1) Image Processing 2) Design & Analysis of Computer Networks 3) Artificial Intelligence 4) Software Architecture

Elective II 1) Multimedia Systems 2) Mobile Computing 3) Embedded Systems 4) Software Testing & Quality Assurance Elective IV 1) VLSI & Digital System Design 2) Operations Research 3) Cloud Computing 4) Information Security or Open Elective

Elective III 1) Pattern Recognition 2) High Performance networks 3) Neural Networks 4) Advanced Databases

Open Elective: Any other Electives that are being taught in Term II under the Faculty of Engineering or individual college and Industry, together, can define new elective using framework of Elective IV defined in syllabus structure and GET IT APPROVED FROM BOARD OF STUDIES COMPUTER ENGINEERING AND OTHER NECESSARY STATUTORY SYSTEMS IN THE UNIVERSITY OF PUNE BEFORE 30th DECEMBER. The BE Project Term work assessment for Term I will be done by selecting panel of examiners amongst senior teachers of Computer Engineering. Existing prevailing practices are followed for all remaining examinations and assessment work.

410441: Design and Analysis of Algorithms Teaching Scheme: Examination Scheme Teaching 4Hrs/Week Theory: 100 Marks Unit Teaching Scheme Unit I Asymptotic notations, necessary mathematical foundation, introduction to 10 Algorithm, Algorithm specifications, Performance analysis, Review of proof techniques: Contradiction and Mathematical induction, Solving Recurrence Equations. Introduction to NP-Hard And NP-Complete Problems, Divide And Conquer And Greedy Strategy, Performance analysis of Algorithmic Strategies Divide and Conquer: General Strategy, Exponentiation, Quick Sort and Merge Sort. Greedy Method: General Strategy, Knapsack problem, Job sequencing with Deadlines, Optimal merge patterns, Minimal Spanning Trees and Dijkstra's algorithm. Unit II Dynamic Programming, Study of different ways to implement Knapsack 6 Problem. Implementation of OBST, Traveling Salesperson Problem. General Strategy, Multistage graphs, OBST, 0/1 Knapsack, Traveling Salesperson Problem, Flow Shop Scheduling. Backtracking: General Strategy, 8 Queen's problem, Graph Coloring, 6 Hamiltonian Cycles, 0/1 Knapsack. Branch and Bound: General Strategy, 0/1 Knapsack, Traveling Salesperson Problem. Design of N Queen's problem, Hamiltonian Cycles Basic Concepts: Non deterministic algorithms, The classes NP Hard and 6 NP Complete, Cook's Theorem, NP Hard graph problems: Clique Decision problem, Node cover Decision problem, Chromatic number decision problem, Directed Hamiltonian Cycle Problem, TSP Decision problem, AND/OR Graph decision problem, NP-Hard Scheduling problems: Scheduling Identical processors, Flow shop scheduling, Job shop scheduling. NP-Hard Scheduling. Study of NP-Hard and NP-COMPLETE problems. Solving NP-COMPLETE problem. Parallel Algorithms, Study of different graph problems. Implementation of 6 different sorting problems on multiprocessor system. Computational Model, Basic Techniques and Algorithms, Complete Binary Tree, Pointer Doubling, Prefix Computation, Selection, Merging, Sorting, Graph Problems. Case Studies of Algorithmic Designs & Applications, Implementation of 6 Huffman Problem. Deadlock detection and avoidance implementation. Image edge detection algorithms, Resource allocation algorithm with deadlock avoidance, Heuristic search algorithm, Coding theory algorithm
Content

Unit III

Unit IV

Unit V

Unit VI

Review of recent advances in the subject. Thomas H Cormen and Charles E. 2ND Edition. Pearson Education ISBN 978 81 317 0205 5 3.L Leiserson. Horiowitz . 81 7371 611 0 . "Design and Analysis of Algorithms". 2ND Edition. 81 7371 6126 2. Review and interactive discussions on home tutorials. A. V. ISBN: 978 81 7371 6119.(Huffman coding). Horowitz and Sahani. University Press. ISBN: 978 81 7371 6126. University Press. "Introduction to Algorithm" PHI 2. Aho and J. Sorting & Convex hulls algorithm.". "Fundamentals of Computer Algorithms". "Fundamental of Algorithm. PHI Reference Books: 1. ". classroom tutorials and students presentation. Text Books: 1. Ullman. Bressard. Sahani: ―Computer Algorithms / C++.D.

type checking and type conversion Syntax directed definitions. access to non-local names. Register allocation and assignment. Run-time Storage organization. Symbol Table organization and management Run-time Storage organization Introduction: Issues in code generation. Introduction: Role of parsers. using ambiguous grammars. Introduction to Semantic Analysis and syntax directed translation. 13 LL (k) parsers. Top down-RD parser. Bottom up Parsers . Block schematic of lexical analyser. iterative statements. Storage organization and allocation 05 strategies. L-attributed definitions. procedure Call and return. Intermediate Code Generation. LEX specification and features. variable-length data. Basic blocks and flow graphs. Dag representation of basic blocks. token. YACC specifications. arrays. Review and interactive discussions on home tutorials. static and dynamic scope. assignment statements. Need of semantic analysis. Intermediate languages. 06 next-use information. Intermediate languages programming structures. Review of recent advances in the subject. Automatic construction of lexical analyser-(LEX). Principle sources Of 06 Optimization. Review of lexical analysis: alphabet. Dynamic programming. Activation record. conditional statements. Introduction. lexical error. shiftReduce: SLR. Predictive parsers. Optimizing transformations: Unit III Unit IV Unit V Unit VI . Lexical Analysis. nested procedures. Error detection and recovery. structures.Operator precedence parsers. Loops in flow graphs. classroom tutorials and students presentation. Introduction and Classification of code optimization. procedure parameters. Top06 down translation. Automatic construction of parsers (YACC). Intermediate code generation using YACC. back patching.41442 Principles of Compiler Design Teaching Scheme Lectures: 4 Hrs/Week Unit Examination Scheme Theory: 100 marks Contents Teaching Scheme Unit I Unit II Introduction to lexical Analysis and Syntax analysis. optimization of basic blocks. LALR etc. Generating code from a DAG. Code generator concept. LR (k). Introduction to phases of Compiler. Boolean expressions. bottom-up evaluation of S-attributed Definitions. case 06 statements. procedure calls. Peephole optimization. Source language issues. construction of syntax trees. Target machine description. Declarations. Storage organization and allocation strategies for block structured and non block structured languages.

variable propagation. R. Levine.Introduction. ISBN 81-8147-369-8. 2000. dead code elimination and loop optimization. Loops in flow graphs. Text books: 1. R. "Lex & Yacc". and Tools". O'Reilly. Cengage Learning. J. Prentice-Hall of India. Data flow equations. L. Data flow analysis.8 References Books: 1. code movement. strength reduction. Brown. ISBN 978-81-315-0132-0 3. Mason. "Compiler Construction: Principles and Practice".J D Ullman. "Compiler Design". Louden. A V Aho. "Engineering a Compiler". K. K. Pearson Education. T. Optimizing transformations: compile time evaluation. 2005. Techniques. DAG based local optimization. Torczon.7758 . ISBN 81 . ISBN 81-2032725-X. Iterative data flow analysis: Available expressions. "Compilers: Principles. S. ISBN 81-7366 061-X. Cooper. Common sub-expression elimination. Computing Global Data flow information: meet over paths. Chattopadhyay. D. . 4. Morgan Kaufinann Publishers. .590 . 2. live range identification. Sethi. Global Optimization: Control and data flow analysis. Local optimization.

4+1 Architecture. Elaboration. Composite structure diagrams. Use-case modeling (actors. purpose & 7 application of UML diagrams. Advanced use-case modeling. Object diagrams. 7 Requirements metamodel. MDA. XMI. Package diagrams. Transition Phases. Object diagrams. expression syntax Introduction to OMG standards MDA. relationships). tagged values. purpose & application of sequence diagrams. Need. Communication 6 diagrams. classroom tutorials and students presentation. Advanced Class diagrams. Forward Engineering and Reverse Engineering of all diagrams of UML 2.0 UNIT II Requirements modeling: Gathering & classifying requirements.0. proxy. Review of recent advances in the subject. Observer. Use cases & RUP. Review and interactive discussions on home tutorials. Deployment 6 diagrams. CRC method. RUP emphasizing Inception. Concept of Forward Engineering and Reverse Engineering of 7 UML Diagrams. Component Diagram. UML Meta model. three tier architecture. Abstract factory. OCL: what & why. Iterator.0. History of UML Building Blocks of UML. Construction. Extensibility mechanisms like stereotypes. UML 2. Design patterns. purpose & application of above diagrams two. Illustrations of Package diagrams. Basic Class diagrams. State Machine diagrams. Basic Class diagrams. Requirements workflow Detail Use case specifications. Activity diagrams.410443 Object Oriented Modeling and Design Teaching Scheme Lectures: 4 Hours /Week Practical: 2 Hours/Week Examination Scheme: Theory: 100 Marks Term Work: 25 Marks Oral: 50 Marks Hrs/ Unit 7 Units Contents UNIT I What is modeling? Object Oriented Thinking. Façade. Interaction Overview diagrams. XMI. UML diagrams for following design patterns: Singleton. Design pattern examples UNIT III UNIT IV UNIT V UNIT VI . use cases. Need. Interfaces and ports. Composite structure diagrams Need. Timing Diagram. constraints and profiles. UML 2.

Grady Booch. Pearson Education. (In a Nutshell (O'Reiily)) Paperback) . Mike O’Docherty. Dan Pilone. 2. Erich Gamma Richard Helm. "UML Distilled: A Brief Guide to the Standard Object Modeling Language". ―Design patterns‖ Elements of reusable Object – Oriented Software. Martin Fowler.Addisioh Westey 4. James Rumbaugh. Wieley India 4. ISBN 978-81203-3322-2. The (2nd Edition) (Addison-Wesley Object Technology Series) (Hardcover) 3. Onject-Oriented Analysis and Design Using UML. Tom Pender. ―UML 2 Bible‖. Ila Neustadt "UML 2 and the Unified Process : Practical ObjectOriented Analysis and Design" (2nd Edition) (Pearson) 2. by Mantha Mahesh. Ivar Jacobson "Unified Modeling Language User Guide". PHI Publications. Jim Arlow.0 in a Nutshell". 3. Neil Pitman "UML 2. Third Edition (Paperback). ―Object Oriented Analysis & Design‖. An introduction to unified Process and design patterns. wiely publication.Text Books: 1. Reference Books: 1.

Object Oriented Modeling and Design Lab Objectives of the Laboratory: • To learn how to understand the requirements of a system. The students will try and identify scope of such a system as realistically as possible. its scope. document them and be able to discuss the pros and cons of your designs and models.0 diagrams. Optionally one may draw Interaction overview diagrams. Outcomes: 1) Students will be able to document SRS. 2) Students will be able to develop structural models. the other diagrams can be drawn on paper. timing diagrams. their concepts. discuss different UML 2. notation. complex systems with example hypothetical systems • To learn concepts. 4) Students will be able to create Architectural models. 6) Students will be skilled in a CASE Tool To meet above objectives teachers will help students choose a hypothetical system preferably either a commercial.0 Basic And Advanced concepts and notation for the same: • To use UML 2. 3) Students will be able to develop behavioral models. firmware development today and explore UML 2. • To model an entire system using UML 2.0 • To learn effective use of any CASE TOOL for UML 2. advanced notation.0. unless they are not applicable for the chosen system in which case other systems may be chosen for specific diagrams. Students will learn to draw. . good modeling practices. As far as possible draw as many diagrams for one single system. • To learn issues in modeling large.0 diagrams for modeling different aspects of a system throughout the SDLC lifecycle. and composite structure diagrams. Any 8 diagrams can be drawn using tool. web based or embedded system for modeling. paper based assignment or in cases relevant even in CASE TOOL The faculties are advised to use Project Based Learning [PBL] to conduct this lab. best practices in software. • To learn good design. 5) Students will be able to select the set of appropriate diagrams to develop a system model. object diagrams for your system as study assignments. forward and reverse engineering aspects.

Content Unit II Unit III 6 Unit IV Image Restoration & Reconstruction. Huffman. Boundary Skeleton). Model of Image degradation. Elements of matrix theory. Lucy Richardson Filtering. Wiener Filtering. Digital Imaging Hardware & Software. region extraction. Basic image preprocessing (contrast enhancement. simple noise 6 reduction. Shannon fano). Fundamental steps and component of image processing system.JPEG. Scalar & Vector Quantization. use of motion in segmentation. Texture & shape measures. smoothing and sharpening domain filters. Unit V Image Compression & Object Recognition. Histogram Processing. Image Processing filters. Spatial transformation Gray Level liner and non-linear transformation. Image enhancement in spatial and frequency domain: basic fundamental. Blind-deconvolution techniques. Introduction to Object Recognition. Background: Image pyramids. Simple Boundary Descriptors. Image Compression using Wavelets (JPEG 2000). edge (Canny) & region based approach.410444: Elective I: Image Processing Teaching Scheme: Examination Scheme Teaching: 3Hrs/Week Theory: 100 Marks Practical: 2 Hrs/week Term Work: 25 Marks Oral: 50 Marks Unit Unit I Teaching Scheme What is digital image processing? Origin. 6 Unit VI Wavelets & Application of Image Processing. usage and application of 6 image processing. Segmentation & thresholding. Introduction to Human Visual System. Noise Models. Feature extractionEdges. Lines & corners detection. Introduction. RLE. Coding Redundancy. Classification of image restoration techniques. . Sub-band coding. Digital representation of images (monochrome & color). Hadamard and Walsh transformation. Principal Component Analysis & Local Component Analysis for dimension reduction. color balancing). Object Representation (Signatures. Classification of Compression Techniques (Lossy and Losless . 6 Introduction to Image Compression and its need. 6 Implementation Feature extraction: Edges. Image Segmentation & Analysis. Texture & shape measures. Sampling & Quantization. Lines & corners detection. Regional descriptors(Texture). Haar and Daubechies Wavelets.

and b. 3) Write a program using derivative filtering technique for edge detection and further thinning the edge. Oral examination will be based on term work submitted. lavac. save the same in . Veerakumar ( Mc Graw Hill). 4) Write a program for image enhancement .R.R.tiff format. 2) Write a program for image transformation. S. Smoothing and d. Sharpening 5) Write a program to illustrate a.) .The journal will contain minimum six assignments. Digital Image Processing. Woods(Person). R. B. (recommended using Hadamard or Walsh transformation method or latest advanced transformation method). T. Medical Image Processing b. Face detection c. Gonzalez. Face detection. R. and display it . Iris Recognition (Note: Students will submit the term work in the form of journal . b. Digital Image Processing And Analysis. 3. use suitable algorithm for a. 2. Anil Jain. Histogram equalization & specification. Chanda. Boyle.Jayaraman. Unconstrained image restoration 6) Implement any of the following application/ or any Image processing application using MATLAB/ OpenCV a. Alasdair McAndrew. References Books: 1. Gonzalez. Digital Image Processing using MATLAB. 2nd Edition. Cenage Learning. c. Introduction to Digital Image Processing with MATLAB. Cenage Learning Assignment for Image Processing (Using Object oriented techniques/OpenCV) 1) Write a program to create a simple image file . R.C. Constrained image restoration. Anil Jain PHI.ApplicationsMedical Image Processing. ISBN-81203-0929-4 2. D. Local enhancement. Woods(TMH) 3. 4. Digital Image Processing. Digital Image Processing and Computer Vision. Sonka. PHI.Datta Mujumdar. R. "Fundamentals Of Digital Image Processing". Iris Recognition Text books: 1.C.

Simulation techniques of System Design Introduction. Network planning and 6 implementation. pipelining. Resource constraints and their metrics. summarization of various techniques (e. comparison of various approaches. scheduling best 6 effort connections and guaranteed service connections. Open loop and closed loop flow control. Signaling. QOS (ATM Forum and IETF approaches). Analysis and design of switching fabrics. Introduction and Framework for Traffic management. M/M/1 Queue System. virtualization. Fundamental choices. Sub-netting.410444: Elective I: Design and Analysis of Computer Networks Teaching Scheme: Examination Scheme Teaching: 3Hrs/Week Theory: 100 Marks Practical: 2 Hrs/week Term Work: 25 Marks Oral: 50 Marks Unit Unit I Teaching Scheme Introduction. ATM Forum and IETF approaches Router/Switch architectures and algorithms 6 Introduction and overview of router architecture and hardware Prefix match IP lookup. generalized state dependent arrival and service system. ATM Forum. Study of flow control and scheduling.). common design 6 techniques. Review of background concepts of computer networks 6 and data communication Content Unit II Unit III Review of discrete random variables.g multiplexing. Implementation aspects of Router/Switch architectures and algorithms Functions and responsibilities. TCP Tahoe. capacity planning. Router algorithms for network measurements. Traffic 6 Models. Renegotiation. Security Issues and tools for BW Unit IV Unit V Unit VI . randomization. point processes Delay Models. Independence assumption. closed queuing system. peak load pricing. security issues. Access networks and Backbone design. comparison of closed loop schemes (stop and wait. Bandwidth management. soft state etc). Requirements.Little’s theorem. Markov chains. IP trace back. Admission control. Implementation of System Design. Introduction. Tools for BW and security management. TCP Vegas. Network of queues. performance analysis and tuning. Network design. Packet scheduling algorithms and RED/AQM. open queuing system. System Design. Modeling and simulation techniques. M/G/1 system. Traffic classes. Study and analysis of System Design. Implementation aspects of open loop and closed loop flow control. Credit based etc. static window.

Tata McGraw Hill Design 6 suitable assignments based on following topics for the purpose of Design and Analysis of Computer Networks Laboratory 1. Design and analysis of router Algorithm for network measurements using network simulation tools 7.Keshav.Berteskas and R Gallagar.Text Books: 1. Use of Little’s theorem or Marcov Chains for design and analysis of network queues. Printice Hall 2. peak load pricing. Design and Analysis of Communication Networks By V Ahuja . McGraw Hill 3. Pearson education 2. Study of Network Simulators. Morgan Kaufmann (For Unit 5) Reference Books: 1. ―Telecommunication Network Design Algorithms‖. Security Issues .. Open Virtual Network Tools 2. An Engineering approach to computer Networking by S. Data networks by D. capacity planning 6. Network Analysis based decision system for Admission control. Network Algorithms by George Varghese. Network planning and implementation: Bandwidth issue. Kershenbaum A. Analysis of Flow control and scheduling algorithms using test data 5. 3. Using simulation tools and test data perform design and analysis of access network and backbone design 4.

Optimal decisions in multiplayer games. Good Behavior: The Concept of Rationality. Searching for Solutions. Local beam search. Local Search for CSPs. Optimal Decisions in Games.I. Study and analysis of Various 6 searching algorithms.Teaching Scheme: Teaching: 3Hrs/Week Practical: 2 Hrs/week 410444: Elective I: Artificial Intelligence Examination Scheme Theory: 100 Marks Term Work: 25 Marks Oral: 50 Marks Content Unit Unit I Teaching Scheme Introduction and Intelligent systems. The Foundations of 6 Artificial Intelligence. Implementation aspects of minimax algorithm and CSP. The minimax algorithm. Generating admissible heuristics from sub problems: Pattern databases. Unit II Unit III . Evaluation functions. Evaluation functions for games of chance. Optimality of A*. Uniform-cost search. How the components of agent programs work. Study of mini. Searching with Non-deterministic Actions: AND-OR search trees. Learning heuristics from experience Beyond Classical Search Local Search Algorithms and Optimization Problems: Hill-climbing search Simulated annealing. Bidirectional search Informed (Heuristic) Search Strategies: Greedy bestfirst search A* search: Minimizing the total estimated solution cost. Depth-limited search. Move ordering . Intelligent Agents Agents and Environments. Conditions for optimality: Admissibility and consistency. The History of Artificial Intelligence. Imperfect Real-Time Decisions. Stochastic Games. Cutting off search. Uninformed Search Strategies: Breadth-first search. Implementation of Depth-first search Problem-Solving Agents. Applications of A. Forward pruning. What Is AI. Partially Observable Games Constraint Satisfaction Problems: Defining Constraint Satisfaction Problems. Heuristic Functions. Iterative deepening depth-first search. Solving Problems by Searching. Memory-bounded heuristic search. Alpha--Beta Pruning. Constraint Propagation: Inference in CSPs. Search versus lookup. Local Search in Continuous Spaces.6 max algorithm Adversarial Search: Games. Variations on the CSP formalism. The Nature of Environments. Searching with Partial Observations Adversarial Search and Constraint Satisfaction Problems. The Structure of Agents. Genetic algorithms. Alpha-beta pruning and CSP. Backtracking Search for CSPs. Depth-first search.

Steps in NLP. Semantic interpretation. Logic: Prepositional Logic. Proof by resolution. Symbols and interpretations. Horn clauses and definite clauses. Conjunctive normal form. Components of Expert System. Algorithms for Planning as State-Space Search. Basic Probability Notation. Resolution. Scripts. Bayes' Rule and Its Use. Rule-based methods for uncertain reasoning. Syntactic Analysis (Parsing). Backward (regression) relevant-states search. Text Classification.Unit IV Logical agents and Classical Planning. Inference and proofs. Unification. Prepositional Theorem Proving. Implementation aspects of Backtracking algorithm and forward and backward chaining Logical Agents: Knowledge representation structures: Frames. Inference Using Full Joint Distributions. Other Classical Planning Approaches. Hierarchical Planning Unit V 7 Quantifying Uncertainty: Acting under Uncertainty. Forward and backward chaining. Expressiveness of decision trees. Natural Language Processing: Language Models. Kevin Knight and Nair ISBN-978-0-07008770-5. Reference Books: 1. A complete backtracking algorithm. 6 Unit VI Natural language processing and Expert systems. Supervised Learning. The decision tree representation. Representing vagueness: Fuzzy sets and fuzzy logic. Implementation aspects of Syntactic Analysis (Parsing) Expert Systems: What is Expert system. Syntax and Semantics of First-Order Logic. Other Approaches to Uncertain Reasoning. Artificial Intelligence: A Modern Approach by Peter and Norvig ISBN-0-13103805-2. Discourse and pragmatic Processing. Knowledge Engineering in First-Order Logic. Artificial Intelligence by Elaine Rich. semantic net. Heuristics for planning. Case studies on Expert System Text Book: 1. Planning Graphs. Introduction to logic programming (PROLOG) Classical Planning: Definition of Classical Planning. Forward (progression) state-space search. TMH. Representing Knowledge in an Uncertain Domain. Implementation aspects of Decision trees Learning from Examples: Forms of Learning. Discourse and pragmatic Processing. The complexity of classical planning. Study and comparison of 6 knowledge representation structures. Inducing decision trees from examples. Learning Decision Trees. . Study of fuzzy logic and Decision trees.

4. Artificial Intelligence and Intelligent Systems by Padhy. Implementation of A* algorithm for solving Puzzle problems. TMH 3.I.978-81-315-1099-5.2. Implementation of Constraint Satisfaction Problem for solving Crypt-arithmetic Problems. Oxforfd University Press. Implementation of Solving Uncertainty Problems like Weather forecasting 6. Implementation of Unification algorithm by considering Resolution concept. by Bratko. Implementation of Parsing methods to categorize the text Or 7. Artificial Intelligence by Saroj Kausik ISBN:. Prolog Programming for A. 3. 5. Artificial Intelligence Laboratory Assignments: 1. Cengage Learning 4. Implementation of Mini Expert System . Implementation of MinMax Search Procedure with alpha beta pruning for finding the solutions of games. 2.

Iterator. Documenting software architectures. Need of Client side technology in multi-tier architectures Examples of three tier and n-tier architectures. 6 Introduction to Java EE. JDBC. Case study of quality attributes in software architecture templates. Recent advances in Middleware technologies Introduction to three tier and n-Tier Web Architectures. Specifications and characteristics of Middleware technologies. What is 6 software architecture.420444 Elective I: Software Architecture Teaching Scheme Lectures: 3 Hrs/Week Practical: 2 Hrs/week Examination Scheme Theory: 100 marks Oral: 50 Marks Term Work: 25 Marks Nos. JSF. Architecture structures and views. client side technologies Case study of mobile or portable client side technologies. architecture and quality attributes. AJAX. principles and expectations. Factory. Need of quality attributes. Session. DOM. Architecture Business Cycle. SOCKET. Introduction to Java EE technologies like JMS.MVC. composite. Ways of using patterns Case studies of patterns in software architecture Introduction to Middleware. Application servers. Java Servlets. Proxy. XML. RMI. EJB 3. Opportunities and Advances in software architectures. chain of. Unit III Unit IV Unit V Unit VI Need of server side technology in multi-tier architectures. Java Applets. struts . Hrs Unit Contents Unit I Introduction to Software Architecture. Study of a number of 6 representative patterns like Singleton. Entity. Adaptor. XML. DHTML. Facade. achieving quality attributes. XSLT. Mediator. Client side 6 technologies HTML.0 Architecture. Understanding 6 Unit II quality attributes. Introduction to Quality Attributes. Active X controls. RPC. Message beans. SOA. Deriving Quality Attributes for software architectures Design Patterns: history. software architecture requirements. Observer. Server side technologies: JSP. Types of Middleware. Java Web 6 Services.

Java6 Programming.Text Book: 1.ISBN 978-81-775-8996-2 2. ―Software Architecture Foundation Theory and practice ―. Len Bass. PHI Publications Reference Book: 1. ''Software Architecture in Practice". 2. ―Java Sever Programming‖ Black Book dreamTech Press ISBN: \978-81-7722-835-9 4. Weaver. Implement an ITERATOR/OBSERVER or any two patterns pattern in language of your choice and submit it along with a write-up with its specification. platforms.4: From Novice to Professional 2. APIs. Design Patterns 1. 3. Black Book dreamTech Press ISBN:978-81-7722-736-9 Software Architecture Laboratory Objectives: • Understand various non-functional requirements that lead to need for good Architecture and good Design. "Beginning J2EE 1 . Nenad M. xyz. The specification must include Problem/ Issue. References.Wiley ISBN: 978-81-265-2802-8. Forces. Middleware. Study and submit a report for any of the MVC based Frameworks (J2EE/EJB) .‖Design Patterns‖ 3. Richard N. Audience/ Context. Kevin Mukhar. Example Instances. • Explore various design Patterns and learn to implement them • Understand how to design and partly implement Client Server systems using components and web services • Explore implementations of some of the underlying technologies of distributed client server applications Faculty can set assignments based on Microsoft / Java world /OR Open source based languages. Study any two patterns and SUBMIT a design pattern specification these in a standard format along with their UML diagrams.Taylor . Second Edition. Pearson . 3. Discussion/ Consequences/ Implementation. Erich Gamma. Related Patterns. Rick Kazman. Solution. James L. Paul Clements.

its deployment issue with UML 5. Scripting/Applets/ActiveX controls 6.Implement a web application for a system covering 4. Develop server side programming with database handling/ servlets /EJB/webservice on server side with security aspects covered. components. interfaces. Develop dynamic and interactive web client using JSP. . A representative paper design of the above system using navigation.

Multimedia Database Systems. fractal compression technique. Text file formats: TXT. Programming aspects of using Windows/Open-source API for developing applications. Digital representation of text. DOC. Image acquisition. MPEG Video compression. Video: Digitization of video. Video streaming. Media streaming. PDF. CIF. Multimedia building blocks. Text compression: Huffman coding.Fano algorithm. 6 Image Processing: Basic Image fundamentals. Characteristics of sound waves. Loss less: RLE. Video transmission standards. AVI. Spatial filtering. intraframe & interframe Hybrid. DPCM Study of different audio file formats and compression techniques Programming considerations for audio compression. MIDI and MIDI File format. User interfaces. transform coding. TIFF. Study and Unit III Unit IV . Multimedia architecture: Introduction to multimedia architectures. Lossy: Vector quantization. interframe correlation. Arithmetic coding. JPEG). BMP.Teaching Scheme: Teaching: 3Hrs/Week Unit Unit I 410445: Elective II: Multimedia Systems Examination Scheme Theory: 100 Marks Teaching Scheme 6 Content Unit II MM Introduction: Overview of multimedia. Interaction techniques and devices. Hybrid: JPEG-DCT Programs considerations for image enhancement using point processing and image compression. 5 Text :Visual representation of text. Windows API for Multimedia. Color image processing. CD and DVD formats. image file formats (GIF. SIF. Audio file formats: WAV. MPEG Audio Audio compression: Compression in audio PCM. Video capturing . Study of different text formats and video formats. Introduction to Image Processing and Compression applications. Design & programming aspects of application for audio/video streaming. psycho-analysis. Image enhancement: Enhancement by point processing. Shannon. psycho. symmetrical & asymmetrical. Windows multimedia support.DM. RTF. Image data types. LZ & LZW. H-263. 6 Multimedia Audio: Data structures used in audio files. VOC. Multimedia authoring tools. digital audio. HDTV. Multimedia OS. Image compression: Types of compression: Lossy & lossless. Digital representation. CCER. Video formats: H-26I. EDTV.

Woods. Multimedia over IP. programming languages. Study of Multimedia 5 networking. Gonzalez. TMH. Addison-Wesley. rendering. compression and streaming Unit V Animation and Multimedia Languages. 3.analysis of video formats. Cengage Learning. OpenGL: Open GL over windows/Linux. SDK. ‖OpenGL: A Primer‖. Quality of data transmission. Standards. 3. web-based applications. Learn to use OpenGL 5 Animation: Basics of animation. 2. Communication andApplications". types of animation. .R. Analysis and development of Multimedia application Unit VI Text Book 1. Media consumption. and Networks‖. Media on Demand Applications Media Entertainment. References: 1. ‖ Multimedia Communication Systems: Techniques. 4. "Digital Image Processing" Addison Wesley Ze-Nian Li. Programming aspects in creating simple animation using OpenGL Multimedia Communication and applications. Students Presentations: Different Multimedia applications. Creating animation. Extension. Drew. principles of animation. 2. Pearson Education. "Fundamentals of Multimedia". Ranjan Parekh. Gerard Medioni. Pearson Education. Rao. ―DeMustified Video‖ Parag Havaldar. Edward Angel. Ralf Steinmetz and Klara Nahrstedt "Multimedia Computing. "Principles of Multimedia". Marks S. ‖Multimedia Systems‖.TMH. shadowing techniques. K. e-learning and education. 5. techniques of animation.

Artech House 2. Review of recent advances in the subject. CDMA. equipment identification. MS-MS call. frequency hopping. MAP protocol-MAP 6 protocol for MM. 6 Unit VI Physical layer. cell layout and frequency planning. MM-layer. Wily Series In Telecommunication Reference Books 1. echo canceller. home locations. data link layer.410445 Elective II: Mobile Computing Teaching Scheme: 3Hrs/Week Marking Scheme : Theory: 100 Marks Hrs/Unit 6 Unit Unit I Unit II Content Applications. Time organization of signaling channels. equipment identity register. Asha Mehrotra. PSTNMS call. location updates. Lee. Visiting Location Register (VLR). API’s for mobile application development Text Books 1. MAP Protocols. TCAP protocol. Recent Advances and application Standards in Mobile OS Time and Frequency Domains representations. register. Mobile Communication. Security Application development for Mobile OS Multiplexing issues in time and frequency domains. encryption. switching sub systems. introduction to GSM system. MAP protocol for basic service support. MS-PSTN call. CC-Layer. Functioning and types of PSTN networks Security issues in mobile computing. SCCP. IEEE Press 2. 6 Unit III 6 Unit IV 6 Unit V Review and interactive discussions on home tutorials. Jochen Schiller. FDMA. structure of TDMA slot with frame. Signaling protocols. . MTP3. TDMA standards and Applications. Authentication. message formation. GSM operational and technical requirements. William C. Pearson Education Asia . Gibson. The Mobile Communication Handbook .Y. base station systems. GSM System Engg. mobile station. classroom tutorials and students presentation. Jerry D. steps in formation of a call. GSM network structure. call handover. history of mobile communication. GSM background. Time Organization of signaling Channels Mobility Management. TDMA. Characteristics of SIM. Application layers RR-layer. Mobile Communication Design Fundamentals .

Free Online Edition . by Lauren Darcey and Shane Conder. Addison Wesley. Joseph E. ―Wireless and personal Communications Systems‖.. Wilkes. Garg V. Prentice Hall 4. 2nd Edition.3. Android: Wireless Application Development Developer’s Library.

Programming concepts. Arbitration. Brief overview of Embedded System Programming In C++ & Java. topology. I/O devices. queues and stacks. Interrupt Structure and Applications. I2 C. Interfacing Processors . Relay & stepper motor. C program elements – Micros and functions. Communication Cycle. Embedded System Programming. Digital Signal Processor. loops and pointers. Modes of operation. C /C++/Java programming concepts.Architecture. 06 Unit III 06 Unit IV 06 . RS 485. Applications. data structures. Application Specific System Processor. Introduction to embedded processor. CAN. Design Process in Embedded System. Details of Components of Embedded SystemsManagement of Power Supply. Their comparison and area of application. Memories and I/O. Timers/Counters. Parallel v/s serial communication. Reset Circuitry and Watchdog Timer. Challenges in Embedded System design. ADC / DAC. Design Examples. Serial Data Communication using USB/CAN/RS-232C and Comparison. Optical Devices such as LED / LCD Display devices. Process of Converting assembly language program and C language program to ROM image. Opto-Isolator. Steps in design process. DSP processor. Clocking Unit.Teaching Scheme: Teaching 3Hrs/Week Unit Unit I Content 410445: Elective II: Embedded Systems Examination Scheme Theory: 100 Marks Teaching Scheme 06 Unit II Introduction to Embedded Systems. & USB – Protocol Architecture. Assembly language V/s High Level Language and its suitability for applications development.RS232C. Components of Embedded System & its Classification. Software development cycle. Review of Microprocessors and Micro-controllers. Real Time Clock and Timers. Programmer’s model. Parallel ports their uses in device interfacing. different Packets. Different serial communication Protocols. Interrupt structure and Applications. Memory Map Of Embedded System I/O interfacing and Communication Buses. Processor and Memory Selection. Structural Units of Processor. data types. CISC and RISC Processor architectures. statements. Comparison with ARM9. Design Process in Embedded System. Multiprocessor systems using General Purpose Processor. ARM7 Processor . List & Order List and their use in the implementation of Embedded System software. Processor and Memory Selection. Design metrics. Advances in Embedded Systems System hardware. modifiers. Characteristic of embedded system. Memory Map Of Embedded System.

K.Unit V Unit VI Difference between Compliers & Cross Compliers. Tammy Noergaard. K. Software Defined Radio. Verma ―Programming for Embedded system ― Wiley – Dreamtech India Pvt. Design. Andrew N. 2. Rajkamal. 3. Prasad. IP phone. K. Dr. Design Examples and case study of – Mobile Phone. Design of tasks and synchronization and IPCs Examples of Real Time OS. their Block diagram. Rajkamal. (Features.Brief about different types of device drivers. Embedded System testing. 5. Context Switching. Representative Embedded Systems – Digital Thermometer. I2C Specification Protocol Standard. Design of tasks and IPCs.0 Protocol Standard. Chris Wright. Context. Embedded Linux. ― Embedded Systems Architecture‖ by Elsevier . Palm OS. Symbian OS . Exemplary Operating Systems and Representative Embedded Systems. K. Interrupts. laboratory tools-Oscilloscope. embedded System OS and Handheld OS – Windows XP Embedded. Real Time & embedded System OS. Programmed I/O v/s Interrupt based I/O. Handheld Operating Systems. Ltd. USB Specification Version 2. ARM7/TDMI(ReV4). Dr. Interrupt Routines in RTOS environment. Automatic Cruise control System.Technical Ref Manual 7. 4. Scheduling. Navigation system. their sources. types and Interrupt service mechanisms. Logic Analyzer and In-Circuit Emulator. simulation and debugging tools – simulators. & Programming – Black Book‖ Dreamtech Press Publication. Virtual Device Drivers. V. CAN Specification Version 2. 2004. V. Reference Book: 1. Response time. IPC used.Their features and applications. Elsevier Publication. ―Embedded System Architecture Programming Design‖ Tata Graw Hill Publication Second Edition. Prasad ―Embedded / real time System : Concepts. Digital camera. Design of tasks and synchronization and IPCs. Strategy for synchronization between the processes. ―ARM System Developer’s Guide-Designing and Optimizing Software‖. K. VxWorks. Deadline. Device Handling and Concepts of Real Time Operating Systems. ―Embedded System Architecture Programming Design‖ Tata Graw Hill Publication first Edition. 3. 2. Gupta Dass. RTOS Tasks and their Scheduling models.0 Protocol Standard. Interrupt Latency. 2008. Domiic Symes. class diagrams. 06 06 Text Books 1. Sloss. Device drivers as ISRs . 6. MicroC/OS II. Handheld computer. K. Applications). their differences.

Test Plan(IEEE format). Structure of testing. Testing types. Smoke testing. Data flow testing. II documentation testing & domain testing. Validation testing. Testing Principles. Case studies of Black-Box testing. Defect Report.410445 Elective II: Software Testing and Quality Assurance Teaching Scheme Lectures: 3 Hrs/Week Unit Contents Examination Scheme Theory: 100 marks Hrs/ Unit 04 Introduction. cause effect graph based. Random Testing. error guessing. requirement based testing. Measurement in small & large system. Quality attribute. Quality factor. Adhoc testing. IV Other Software Testing: GUI testing. Design of test cases. Phases of Testing. Scenario testing. Quality V management. Measurement tools. GUI testing. Winrunner. Regression testing. 06 Unit static testing by humans. Productivity. Loadrunner). Quality Assurance. ISO. design of test cases. Goals. Quality management & project management. I Introduction. Equivalence Partitioning Unit class. Quality control & Unit assurance. Defect Life Cycle. Test case design criteria. Software quality metrics-TQM. Automated Testing Tools & Case studies. Cost of quality. Loop Testing. Introduction. Testing Methods. Importance of testing in software production cycle. Testing metrics: Type 06 of metric – Project. state based or graph based.logic coverage criteria. Requirement 06 Analysis. Advances in Software Testing Methods Software quality. Manual testing Vs Automated testing. Case studies based on Web VI based. Defects. Need of white box testing. Challenges in White box testing. Progress. Goal Question metric Unit model. Positive & negative testing. Structure . Manual testing. Testing of Object oriented systems. Need of black box testing. Basics of Software Testing. Specification based testing. Black box testing Concept. Methods of quality management. SQA Model. Metric plan. Mutation Testing. III Graph metrics. Sanity testing. Case-study of White-Box testing Test organization. Rational Robot. Basis path testing. Automated Testing Tools Case studies 04 04 . Test adequacy criteria. Boundary value analysis. Testing Life Unit Cycle. Study of Testing tools Unit (QTP. Six Sigma.

Software Testing Tools by Dr.G. Software Testing. ISBN 81-7758-121-X 5. Dreamtech Press ISBN: 10:817722-532-4 . Second Edition By: Ron Patton. By Stephen H Kan.K.K. Software Testing Principles and Tools By M.ISBN 81-7722-712-2 References Books: 1. Prasad. Erik Van Veenendaal. Software Testing Concepts and Tools By Nageshwar Rao . Foundation of software testing by Dorothy Graham. ISBN 0-19-806184-6 4. Pearson Education. Pearson Education ISBN 81-297-0175-8 2. CENGAGE learning . Effective methods for software testing by William Perry .ISBN 978-81-315-0218-1 4. Dreamtech . ISBN 81-265-0893-0 3. Software Testing Principles and Practices By Naresh Chauhan. Metric and Model in Software Quality Engineering . Oxford University Press. Software testing Principle and Practices By Ramesh Desikan. ISBN 13:978-0-07-013990-9 3.Text books: 1. Pearson Education ISBN-13: 978-0-672-32798-8 2. Limaye TMG Hill Publication. Willey Publication.V.

Assignment to understand basic syntax of LEX specifications. if-else statements as per syntax of C or Pascal and generate equivalent three address code for the given input made up of constructs mentioned above using LEX and YACC. Code Optimization 4. Assignment to optimize the generated equivalent three-address code in 3rd assignment. Display all records stored in the symbol table. assignment. Assignment to understand basic syntax of YACC specifications. "for". Generate the target code for the optimized code in 4th assignment.410446 Computer Laboratory-l Teaching Scheme Practical: 4 hrs/week Examination Scheme Practical: 50 Marks Principles of Compiler Design Assignments LEX 1. built-in functions and Variables 2. YACC 1. . Code Generation 5. Write an ambiguous CFG to recognize an infix expression and implement a parser that recognizes the infix expression using YACC. if. Write a code to store the identifiers from the input in a symbol table and also to record other relevant information about the identifiers. Implement a lexical analyzer for a subset of C using LEX Implementation should support Error handling. 2. Write an attributed translation grammar to recognize declarations of simple variables. Provide the details of all conflicting entries in the parser table generated by LEX and YACC and how they have been resolved Intermediate Code Generation 3. built-in functions and Variables.

(if any)) supporting the project idea. Internal guide allocation for the BE Project: Assistant Professor in computer engineering can guide the BE Project. be allocated to the guide. Exposure to Learning and knowledge access techniques using Conferences. use of state-of-art technologies. In case of non-availability of qualified guide. where papers can be published. To encourage and expose students for participation in National/ International paper presentation activities. HOD can allocate the senior teacher as a guide. Review of Conference/Journal papers (atleast 10 papers + White papers or web references. Term I Teaching Scheme: Practical: 2 Hours/Week Examination Scheme: Term Work: 50 Marks Term I project term work 1.410447 Project Work Objectives: To expose students with project-product development cycle using industrial experience. Journal papers and participation in research activities. Plan of project execution using planner or alike project management tool. Preferably. The project conduct and procedures are amended as detailed below:Problem statement feasibility assessment using. The Project laboratory of 4 project groups (3 to 4 students in one group) constituting one laboratory batch (2 hrs per week). satisfiability analysis and NP-Hard. names of atleast two conferences. without compromising the quality of the work. NP-Complete or P type using modern . The project group will submit the synopsis including title of the project. (Recommended dates: 3 weeks after Commencement of the Term). 2. Technical Key Words (Ref. the projects are Industry Sponsored or part of high level research/ Sponsored Research Project that are not conducted for any award of the educational degree. ACM Keywords) and relevant mathematics associated with the Project.

(recommended submission date:. A Report consisting of problem definition. (recommended submission date:. Project problem statement feasibility assessment using NP-Hard. functions and functional relations and any other dependencies. testing of UML diagram's reliability. 4.8 weeks before term end) Use of above to identify objects. (recommended submission date:. NP-Complete or satisfiability issues using modern algebra and/or relevant mathematical models.3. Central Universities or UoP Conferences or equivalent International Conferences. algebra and relevant mathematical models. 7.two weeks before term end) The index of submission must cover above mentioned 5 heads in addition to the instructions by the guide. morphism. The term work at the end of Term-I shall be assessed and evaluated for 50 marks by the panel of examiners in the subject (Internal (preferably guide) and external examiner from Computer Department of Engineering Colleges). Annex B: Laboratory assignments on Project Quality and Reliability Testing of Project Design at the end of term-I and Annex C: Project Planner and progress report. . Function testing principals) selection and appropriate use of testing tools.(recommended date of submission:. 6. 5.3 weeks before term end) Testing of problem statement using generated test data (using mathematical models. SRS (System Requirement Specification) Document in specific format and high-level design document along with Annex A: Laboratory assignments on Project Analysis of Algorithmic Design. Term-I Project Laboratory Assignments 1. Students must submit atleast one technical paper on the project design in the conferences/workshops in IITs. overloading. 8.6 weeks before term end) Functional dependency graphs and relevant UML diagrams or other necessities. platform choice. literature survey.

and functional relations and any other dependencies (as per requirements). Use of above to draw functional dependency graphs and relevant UML diagrams or other necessities using appropriate tools. Use of above to identify objects. GUI.2. . overloading in functions (if any). testing of UML diagram's reliability. Function testing principals. if any) selection and appropriate use of testing tools. 4. morphisms. 3. Testing of project problem statement using generated test data (using mathematical models.

Event ordering. What is Distributed System? 7 Evolution of Distributed Computing System. Issues in deadlock detection and resolution. Lamport’s logical clock. Issues in IPC by Message passing. Desirable features of good message passing system. Process addressing. Architectural models of Distributed System Synchronization Introduction. Classification of mutual 8 exclusion algorithms. Mutual Exclusion. Distributed deadlock detection algorithms. Preliminaries . Ricart Agrawala algorithm. RPC.Introduction . Case Study: RMI. Protocols for Distributed System. Global states. Concept of Process. Solutions to the Byzantine Agreement problem. A simple solution to distributed mutual exclusion. CORBA. Avoidance and Prevention algorithms. Introduction to Distributed Computing Environment. Advances in Distributed Systems Architecture of Distributed System – Introduction. Process Synchronization. NOS. Distributed Synchronization and . Token based algorithms. non token based algorithms. Classification of agreement problems. Buffering. Distributed Computing gaining popularity Issues in Designing Distributed System. Centralized deadlock detection algorithms. Process Migration. Applications of Agreement algorithm. Inherent Limitations of a Distributed System. Failure Handling. Threads Clock synchronization. System Model. Deadlock handling strategies . System architecture types. Encoding and decoding of message data. Control organizations for distributed deadlock detection. Multidatagram messages. Suzuki Kasami’s broadcast algorithms Distributed Deadlock detection – Introduction. Middleware Communication Networks. Election Algorithms Issues in Designing Distributed System and role of middleware in Distributed System Unit II Unit III Distributed Mutual Exclusion – Introduction. Network. Issues in Interprocess Communication Message Passing . Vector clock. Distributed Computing System Models . Distributed operating system. Motivations. Hierarchical deadlock detection algorithms Agreement Protocols – Introduction. Deadlock. Preliminaries. Communication primitives. Group communication. Interprocess Communication.Teaching Scheme: Teaching 4Hrs/Week Unit Unit I Content 410448: Distributed Operating Systems Examination Scheme Theory: 100 Marks Teaching Scheme Fundamentals – Fundamentals of OS. 6 Concepts of Distributed System. RMI Synchronization.

Selecting a suitable load sharing algorithms. 8 Scheduling Algorithms Distributed File System Introduction . SOA and Web Services. Targon/32 UNIX Access and Flow control – Introduction. Performance Comparison. Case studies-Unix OS Distributed Fault tolerance and Security. Load sharing policies. Task migration Distributed File System: Comparisons Recovery and Security mechanism. Design issues. Non blocking Commit protocols. Safety in Access matrix model. Consistent set of checkpoints. Basic concepts of Recovery and Types of Failures Recovery – Introduction. Coherence protocols. Components of load distributing algorithms. Classification of failures. Log structured file systems. How Grid Computing Works. Motivation. Failure Resilient Processes. Service Oriented Grid. Advances in Recovery and security mechanisms Unit VI Emerging Trends in Distributed System. SOA Design and Development. Deadlock Solution to Distributed Mutual exclusion Unit IV Distributed Resource Management. Dynamic vote. Issues. Load distributing algorithms. Architecture and Motivation. Synchronous and Asynchronous check pointing and recovery Fault tolerance – Introduction. Grid Architecture. Preliminaries. Recovery in concurrent systems. Concepts of Cluster.Agreement Protocol. algorithms for implementing DSM. advanced models of protection. Case studies. Case studies-BAR Fault Tolerance. Commit Protocols. Simulators SOA: Basic SOA Definition. Access matrix Model. Advantages and Future of SOA Grid computing. Design issues. Memory Coherence. Voting protocols. Concepts of Database system 8 Security. Stability. Mechanisms for building distributed file system. Reassignment protocols. Grid Middleware. Concepts 5 of Grid Computing Grid Computing Introduction to GRID Computing. Types of Grids Grid Computing Applications. Overview of SOA. Backward and forward error recovery. Basic concepts. Implementations of Access Matrix. Case studies-Linda Distributed Scheduling – Introduction. Majority based Dynamic Voting protocol. Cloud and SOA Unit V . Issues in load distribution. Architecture. Requirements for load distributing. Atomic actions and committing. Concepts of Mutual exclusion. Google FS Distributed Shared Memory – Introduction. Reliable communication. Backward error recovery. Concepts of File System.

S Concepts and Design‖. 3rd Edition . ―Distributed System Principles and Paradigms‖. P. Sunita Mahajan.Text books: 1. Colouris .Shivaratri. TMH 3. Seema Shah. PHI 2.K. ―Distributed O.G. Mukesh Singhal & N. OXFORD University Press Reference Books: 1. Andrew S. PHI 2. ―Distributed Computing‖.Sinha. Tanenbaum. ―Advanced concepts in Operating Systems‖. 2nd edition . ―Distributed Systems‖.

Pipelining hazards and resolving techniques. Static Vs Dynamic network. Principles of scalable performance: Performance Metrics and Measures. future trends. Content Unit II Unit III . Implementation issues of a program on any pipelined processor their analysis. Basic vector architecture.Teaching Scheme: Theory: 4Hrs/Week 410449: Advanced Computer Architecture Examination Scheme Theory: 100 Marks Unit Unit I Teaching Scheme Overview of Parallel Processing and Pipelining Processing. Study and comparison of Vector and array processors. Implementation issues of Matrix multiplication and sorting on array processor and their analysis. Advanced pipelining techniques. Classification of pipelining 8 processors. Parallel Algorithms For Array Processors: Matrix Multiplication. Explicitly Parallel Instruction Computing (EPIC) Architecture. Study and comparison of processors with and without pipelining. Design aspect of Arithmetic and Instruction pipelining. Evolution of parallel processors. Vector performance modeling. Ultra SPARC. Pipeline Architecture. Job sequencing and Collision. Sorting. 8 Vector and Array Processor. cube hyper cube and Mesh Interconnection network. Programming aspects for Intel Itanium Processor Principles and implementation of Pipelining. SIMD computer organization. Instruction level Parallelism and Thread Level Parallelism. Applications of parallel processing. software scheduling. Case study of Intel Itanium Processor. Issues in Vector Processing.Pentium. Speculative loading. VLIW (Very Long Instruction Word) processor. Advances in pipeline architectures. Predicated execution. Inter PE Communication. Constraints of conventional architecture. Architectural Classification. Software pipelining. Speedup Performance Laws. Register Stack Engine. Interconnection networks of SIMD. Super scalar architecture of Pentium. Case study: Cray Arch. Parallelism in uni-processor system. SIMD Computer Organization Masking and Data network mechanism. General pipelining reservation table. Evolution of parallel processors. out of order execution. loop unrolling techniques. Conventional and EPIC architecture. trace scheduling. vectorizers and optimizers. Ultra SPARC. future trends and there architecture. Overview of Parallel Processing and Pipelining Processing Necessity of high performance. Case study: Super scalar Architecture. study and 6 comparison of uni-processors and parallel processors. Data buffering techniques.

Richard Y.intel. High performance computer Architecture. "Computer Organization and Architecture. classification of parallel algorithms. Tata McGraw-Hill References: 1. Cache coherency and bus snooping. Introduction to Neuro Computing and Grid Computing: Unit V Unit VI Text Books 1. 8 a)Parallel algorithms for multiprocessors.Rajaraman. Memory contention and arbitration techniques. PHI. Chip Multiprocessing (CMP). CCC etc. Crossbar switch. d) Issues towards cluster computing. Case Study of IBM Power4 Processor Inter Processor Communication and Synchronization.Unit IV Microprocessor Architectures. Harrold Stone. PVM (in distributed memory system). Message passing parallel programming. 5. Multiport Memory Model. Occam. Designing for performance" Prentice Hall. William Stallings. Data Parallel Programming. Inter Processor communication network. Principles of multithreading. http://www. "Advanced Computer Architecture". Parallel Programming Techniques: Message passing program development. L Sivaram Murthy. Parallel software issues. Issues and solutions. Faye A. Implementation issues of a multithreaded program. study of parallel programming concepts. Message passing libraries for parallel programming interface. Advanced Computer Architecture 6. Study of Architecture of Multithreaded processors. "Computer Architecture and Parallel Processing" McGrawHill international Edition 2. Implementation issues of a program on multiprocessor system. performance of parallel algorithms b) Operating systems for multiprocessors systems. Briggs. Kai Hwang. 2. V. 3. 4.com/products/processor (for Intel Itanium Processor) . Massively Parallel Processors (MPP). Synchronous and asynchronous message passing. Shared Memory Programming. Kai Hwang. study and comparison of Loosely and 8 Tightly coupled multiprocessors. Scalable Parallel Computing. "Parallel Computers". Kain. Loosely and Tightly coupled multiprocessors. Cow’s and NOW's Cluster and Network of Work Stations). Threads (in shared memory system) c) Parallel Programming Languages : Fortran 90. Kai Hwang. Sixth edition. C-Linda. Processor characteristics of multiprocessors. Latency hiding 7 techniques. Message Passing Interfaces (MPI). Time shared bus.

Implementation issues in algorithms for clustering Text Books: 1. Criterion functions for clustering. Hierarchical and other methods.410450: Elective III: Pattern Recognition Teaching Scheme: Examination Scheme Teaching 4Hrs/Week Theory: 100 Marks Practical: 2 Hrs/Week Term Work: 50 Marks Oral: 50 Marks Unit Unit I Content Teaching Scheme 7 Basics of pattern recognition Features. Supervised versus Unsupervised Pattern Recognition. Challenges in Bayesian decision theory Parameter estimation methods. Unsupervised learning and clustering.O. Linear discriminant function based classifiers. Fisher discriminant analysis. K-Nearest Neighbour method. 2006 Reference Books: 1. Bayesian estimation. Academic Press. 7 Gaussian mixture models. Fukunaga. C.. Review of recent advances in the subject.Hart and D. Review and interactive discussions on home tutorials. R. Parzen-window 7 method. classroom tutorials and students presentation. P. Mean Square Estimation Revisited. Expectation-maximization method. . Pattern Recognition. Feature Vectors and Classifiers Unit II Bayesian decision theory: Classifiers. 7 Context-dependent classification Discrete hidden Markov models.Bishop. Pattern Recognition and Machine Learning. Least Squares Methods.Koutroumbas. 2nd edition. Algorithms for clustering: K-means. Comparison of Supervised and unsupervised Pattern Recognition. John Wiley.Duda.Theodoridis and K. Statistical Pattern Recognition. Perceptron. Review and interactive discussions on home tutorials. Maximum-Likelihood estimation. 2001 3. 4th Ed. Support vector machines. Feature Vectors and Classifiers. Pattern Classification. 1990. Springer. Review of recent advances in the subject. Decision trees.Stork. classroom tutorials and students presentation.E.M. Continuous density hidden Markov models. Morgan Kaufmann. Linear Discriminant Functions 7 and Decision Hyperplanes.G. Perceptron. by K. Unit III Unit IV Context-dependent classification. Sequential Pattern classification. 2009 2. Unit V Non-parametric techniques for density estimation. Principal component analysis. Dimension reduction methods. Unit VI Non-metric methods for pattern classification. S. Non-numeric data or 7 nominal data. Cluster validation.

3. Arnold. 5. Statistical Pattern Recognition. Webb. Write program to build a Bayesian classifier Write a program to recognize line patterns in a given set of points. by A. Using and interpretation of ROC curves. 2. 1999. Experiments with edge detection: 6.using Fourier shape descriptors. experimenting with wavelet transform.2. template matching. . experiments with PCA and ICA. Pattern Recognition Practical Assignment Topic (design six suitable assignments based on the following topic) 1. Implement Image Block matching by 2D Log Search and Brute-force approach Write a program to implement Edit Distance Problem Exploring difference between color spaces and color-based image segmentation. 4. 7. Exploring different feature spaces .

B-ISDN Functional 8 Architecture. Conceptual overview of Signaling System Number 7 Frame Relay: Frame relay Vs X. Detail Functionality of ATM Layer( Cell structure . Architecture and Overview of Gigabit Ethernet. Applications of Gigabit Ethernet. Architecture. Architecture and Overview of Gigabit Ethernet. Market status . and DE bit. ISDN Interfaces and functions.ATM traffic and Congestion control . B-ISDN Transmission structure. Concept of DLCI and its significance. Conceptual overview of VDSL. Need. different types and comparison). SONET/SDH and comparison with other available standards ATM: Overview. Virtual Channels and Virtual Path Switching.BECN and CLLM). B-ISDN standards and services. Architecture. Conceptual 6 overview of Signaling System Numbers. Frame Relay Congestion control. Frame relay LAPF protocol. Frame Mode call control). Background and technological capabilities. ISDN Data Link layer (LAPD protocol.120 ). ATM QOS parameters. ISDN Interfaces and functions (transmission structure. ISDN Interfaces and functions (transmission structure.ATM Adoption layer (need. Unit IV VDSL and DSL background and technological capabilities and its 8 standards. Frame Relay Congestion control. ATM protocol architecture. Concept of DLCI and its significance. U-N Configuration. Congestion Notification (FECN. Congestion Control frame Work.25. Classical IP over ATM. Unit III Driving forces and need. U-N Configuration.ATM in LAN environment (LANE). Standards and associations. LAPF protocol (Both Core and Control).931). BECN and CLLM) Conceptual view of ISDN and ISDN standards. ISDN services. Network use of CIR. Gigabit Ethernet Physical layer (1000Base X and 1000Base T). Network Design using Gigabit Ethernet a case study. basic call control using Q. B-ISDN protocol architecture. Protocol architecture etc) Congestion Notification (FECN.410450: Elective III: High Performance Networks Teaching Scheme: Examination Scheme Teaching 4Hrs/Week Theory: 100 Marks Practical: 2 Hrs/week Term Work: 50 Marks Oral: 50 Marks Unit Content Business Drivers and need of it. Deployment Case study. HEC. Conceptual overview of VDSL.ISDN Network layer (Overview.Requirements. ATM service categories . Gigabit Ethernet Media Access Control (Half Duplex operation Vs Full Duplex Operation). Cell Delineation etc). I. Ethernet summery Migration from 10Mbps to Gigabit Ethernet. Protocol architecture etc). Frame relay Protocols and services (protocol architecture. terminal adoption.465/v.ATM traffic descriptors. Gigabit Ethernet Physical layer (1000Base X and 1000Base T) Unit I Introduction and Applications of Gigabit Ethernet Teaching Scheme 7 Unit II Integrated Services Digital Network.

Unit V Introduction to MPLS and QOS. Performance study of RSVP protocol using virtual HPN test-bed. Network Components of MPLS. MAC protocol and operation. IEEE Standards. MPLS network Components. Physical layer specifications. WiMax Standards MAC protocol and operation. Costing etc. Survey of Open Source Simulation tools for HPN. WiFi & WiMax Basics. Physical layer specifications. New node detection and authentication implementation in WiFi environment or simulated WiFi environment 7. Virtual Network Laboratory for HPN 2. William Stallings. Introduction to various WiMax Standards. Frame relay Congestion Control 5. WiMax physical and MAC layer overviews. ―Gigabit Ethernet‖(Addison Wesley Inc. Integrated & differential Services Framework. Sumit kasera and Pankaj Sethi . 6. Router configuration. Arunabha Ghosh and Rias Muhammad Pearson Education (For Unit VI) Design 6 suitable assignment form the following topics for HPN Laboratory 1. Implementing WiFi Network (Including configuration). Applications. Fundamental of WiMAX by Jeffery Andrews.) 4. Implementation of ISDN (U-N interface. ―ISDN and Broadband ISDN with Frame Relay and ATM‖ 4th edition (Pearson Education) 2. WiMax physical and MAC layer overviews Introduction to IEEE 802. 5 Introduction of WiFi and WiMax. OFDM and OFDMA. QOS and WiMax. MPLS basic working.‖ATM Networks Concepts and protocols‖ Tata McGraw Hill Publication. Unit VI 2. IETF approach. 8 working RSVP protocol. Text Books: 1.and future. Comparison of various standards.) Reference Books : 1. RSVP protocol. Latency time measurements in different HPN Server-Client graphs configurations in simulated scalable environment (For example. HPN organization using bipartite graph) . Rich Seifert. Network Scalability (Servers) using Gigabit Ethernet 3.11 standards.

8 6 8 Unit VI Applications of Neural Networks. learning vector quantization.410450 Elective III: Neural Network Teaching Scheme: 4 Hrs. Zurada. House. Applications in Image Processing. Adaptive Resonance Theory. Unit V Unsupervised Learning. 1994. Pattern classification. clusters. Basic Learning Rules. Applications in decision making. Characteristics of Neural Networks. Hrs/ Unit 6 Unit II 8 Unit III Stochastic Processes and Neural Networks and Stimulated Annealing. Jaico Publ. Principal component analysis of Hebbian Learning. Radial basis function networks. Boltzman machine Multilayer Perceptrons. Classification of linearly separable patterns. Supervised Learning Neural Networks. Analysis of pattern storage Networks. Analysis of linear auto adaptive feed forward networks. PHI 2. Applications in Image Processing. / Week Exam Scheme: Practical: 2 Hrs/Week Paper: 100 Marks Term Work: 50 Marks Oral: 50 Marks Unit Unit I Contents Introduction to Neural Networks. Adaptive networks. Basic data structures: mapping of vector spaces. . Feedback Neural Networks. Optimization. Biological Neural Networks. Analysis of linear auto adaptive feed forward networks. Models of Neuron. B. ―Artificial Neural Networks‖. Modular neural networks. Associative memories. Single layer and multi layer perceptrons. Stochastic Networks & Stimulated Annealing. Yegnanarayana. Boltzman machine. Introduction to artificial neural systems. Pattern classification. Kohonen self-organizing maps. Adaptive Resonance Theory. Applications in decision making 6 Text Books 1. Recent advances in Neural Networks The Perceptron and its learning law. Adaline and madaline. Analysis of pattern storage Networks. principal components. Unsupervised Learning Networks Competitive learning. Jacek M. Unit IV Analysis of linear auto adaptive feed forward networks.

James A Freeman.‖ Person Education Reference Books 1. 2.3. Implementation of Hopfield network. ―Neural Network a comprehensive Foundation‖. Haykin. 5. . Prentice Hall Neural Networks Laboratory Assignment Teachers are instructed to frame suitable assignments on the following topics 1. Implementation of BAM simulator. Implementation of back propagation algorithm/ simulator for character recognition. Implementation of Perceptron Learning algorithm and Adaline algorithm for two class / three class problems. Implementation of ART simulator Implementation of SOFM network. ―Neural Networks-Algorithms. Applications and Programming Techniques. PHI 2. David M Skapura. 3. Anderson. ―An introduction to Artificial Neural Networks‖. 4. 6.

Distributed data storage and transactions.k means algorithm. Distributed transactions. Inter-operational and Intra-operational parallelism. Introduction. Data preprocessing need for preprocessing. Implementation of Distributed query processing. Implementing Clustering . classification . Inter-query and Intra-query parallelism. Data mining functionalities. scale-up I/O parallelism. XML. Analysis of Decision tree. Creating and maintaining a warehouse. Distributed query processing. Distributed Databases. Databases and web architecture. Data warehousing Concepts. Introduction to Data warehouse and OLAP. XPath. Outlier analysis. DTD. Commit protocols. Web based system. Structure of XML Data. XML Document Schema. Design of parallel systems. Operations on cubes. XML and DTD implementation.decision tree. Introduction to text mining. Comparison of Homogeneous and Heterogeneous Databases. API to XML. speedup. XML Applications: web services. Data Warehousing. Design of parallel systems. N-tier architecture. FLOWR. Availability. Unit V Introduction to data mining . Implementation of XML validations. Simulating and maintaining a Warehouse. OLAP and data cubes. Implementation issues of Parallel query evaluation.apriori algorithm. Storage of XML Data. clustering . Data Warehouse architecture. parallel query evaluation. Distributed data storage. Analysis of Data preprocessing. Analysis of Concurrency control in distributed databases. Study of DDBMS architectures. 06 06 . Use of Web service like Amazon web service or Microsoft Azure. association rules . Comparison of Inter-query and Intra-query parallelism. Web server. Use of web servers. OLAP and data cubes. Multidimensional data model. Teaching Scheme 08 Unit II 08 Unit III 06 Unit IV Introduction to Decision Support. Multidimensional data model. Querying and Transformation: XQuery. Study of Data preprocessing need for preprocessing. Baysian classifiers. Parallel database architecture.k means algorithm. XML validation. Directory systems-ldap. Overview of client server architecture.410450: Elective III: Advanced Databases Teaching Scheme: Examination Scheme Teaching 4Hrs/Week Theory: 100 Marks Practical: 2 Hrs/Week Term Work: 50 Marks Oral: 50 Marks Unit Unit I Content Introduction.

Carolyn Beg ―Database Systems :Practical approach to design implementation and management ― third edition. Information Retrieval. McGraw Hill International Edition 3. Database systems: "Design implementation and management". Henry Korth. 6. "Data Mining: Concepts and systems". postgres SQL Anyone DBMS from: ORACLE. Indexing of documents. Pearson education List of Laboratory Assignment Topics 1. 4th Edition. synonyms. McGraw Hill International Edition 2. Homonyms. homonyms.Unit VI Information retrieval . 5th Edition. Implementation of partitioning techniques and handling of skew Directory systems using LDAP (Latest version) Building cubes and OLAP analysis and construction of data mart Association rule (Apriori algorithm) or Clustering algorithm (K-means) IR assignment: TF. 4. IDF. Jiawei han. Johannes Gehrke. Sudarshan. S. "Database system concepts". measuring retrieval effectiveness. 2. Text Books : 06 1. Study and Comparison of Synonyms. Raghu Ramkrishnan. Thomson Learning Press 2. Relevance ranking using terms and hyperlinks. 5. web search engines. Thomas Connolly. Rob Coronel. Information retrieval and structured data. Ontologies. Abraham Silberschatz. SQL server. Implementation issues of Relevance ranking Algorithm. Micheline Kamber. "Database Management Systems". Morgan Kaufmann Publishers Reference Books 1.overview. ontologies. Stop words Case Study : Anyone DBMS from open source: mysql. CauchDB . 3. Second Edition. DB2.

integrated circuits. Software aspects of digital design. Multilevel Metal Formation. Software aspects of digital design Unit VI Combinational logic design principles. field programmable gate arrays(FPGAs). gettering. backend technology. programmable logic devices. Wafer Development and Dopants. physical vapor deposition. dielectrics. the synthesis model. Digital devices. Unit IV What is VHDL? Introduction: Modeling Digital Systems: describing systems. Lithography: Light sources. Analog versus Digital. propagation delays. shared signals. Computer Simulation of VLSI Modern CMOS Technology 8 Introduction. Semiconductors. Raw materials and Purification. entity-architecture. understanding delays. waveforms and timing. simulation vs. signal values. digital-design levels. concurrent statements. Wafer Preparation and specification. Process Option for Device Isolation – Shallow Trench Isolation. Gate Formation. Light sources. and FPGAs Unit III 6 8 6 . Process Options for Active Region and Well Formation. N and P Well Formation. Memories. Mask engineering: Basic concepts of Thermal oxidation and the si/sio2 Interface. synthesis: the simulation model. The role of hardware description languages. and concurrency. Choosing a Substrate. contacts. Basic Properties of Silicon Wafers Crystal Growth Wafer Fabrication Wafer Preparation and specification. Tip or Extension(LDD) Formation. Contact and Local Interconnect Formation. sequential logic design principles.410451 Elective IV: VLSI and Digital Systems Teaching Scheme: 4Hrs/Week Evaluation Scheme: Theory 100 Marks Unit Unit I Content Unit II Teaching Scheme VLSI concepts and technology. basic concepts of wet etching and plasma etching. implants in real silicon. number systems and codes. CMOS Process Flow 6 Historical Development and Basic Concepts Crystal Structure. electronic aspects of digital design. application-specific IC’s. basic concepts of chemical vapor deposition . events. wafer Cleaning. Source/Drain Formation. basic language concepts: signals. Contamination reduction: Clean factories. VHDL Programming Unit V Introduction to Digital Design. Semiconductor Technology Families. Active Region Formation. Semiconductor 6 Devices. interconnects and vias. CPLDS. wafer exposure systems. Czochrlski and Float-Zone Crystal Growth Methods. Defects in crystals. digital circuits. constructing VHDL models using CSAs . Photoresists. Basic concepts of dopant diffusion . Integrated circuits and the Planar Process.

Wakerly Pearson prentice hall ISBM 978-81-317-1366-2 . Digital Design: principles and practices fourth edition by John F.. Practice and Modeling by James D Plummer et. al. Pearson education ISBN 978-81-317-2604-4 2. Silicon VLSI Technology: Fundamental. VHDL: from simulation to synthesis by Sudhakar Yalamanchili Pearson education ISBN 81-7808-558-5 3.Text Books: 1.

Multiplicatively Separable return. General from of NLP. Introduction to Separable functions. Game theory: Introduction and definitions. Decision making under risk. Specialized Poisson Queues. Problems with inequality constrains. solution of game with saddle point. Maxima-minima. Modeling with Linear Programming: Two-Variable LP model. Decision making under uncertainty. Random Processes. Inventory Models Unit V Non-Linear Programming (NLP) Introduction. Elements of Queuing models. Unit IV Job sequencing: Introduction. Constrained and unconstrained problems of Maxima and Minima. Four Common distributions. To derive necessary condition of optimality. Project Management: Applications and basic steps in PERT/CPM techniques. Optimal Strategies and value of game. Solution of sequencing problem. Solutions of mixed strategy games. List of 6 symbols. Generalized poisson queuing model. Marcov Process and Marcov chain. Minimum path problem. Saddle point. Utilization factor. Decision making under certainty. models of single additive constraint. Transient and steady States. resource allocation. Duality. M/G/1 formula. Random variables and Probability 8 distributions. Geometric programming problem. Queuing decision models. Solving the OR model. Processing n jobs with 2 machines. Advanced Linear Programming.period models. Characteristics of Game theory. Queuing system. Goal Programming. Continuous review models. Canonical form of NLP. Variations in expected value criteria. Principal 6 Assumptions. processing 2 jobs with m machines. Applications of dynamic programming in . Practical solutions of 8 NLP. Linear Programming (LP) Applications. Lagrangian method. Network diagrams with time estimates and analysis. Processing n jobs with m machines. Terminology and Notions. Piece-wise linear approximation of NLP. Role of exponential distribution in queuing systems. Queuing and 6 Simulation Models. Graphical LP Solutions. Multi. Forward and Backward recursion. Review of basic probability. Deterministic dynamic 6 programming.410451 Elective IV: Operations Research Teaching Scheme: 4Hrs/Week Evaluation Scheme: Theory 100 Marks Unit Unit I Content Unit II Unit III Teaching Scheme Operation Research Models. Problem of dimensionality. Review of recent advances in the subject. Birth and Death Models. Simplex method and sensitivity analysis. Computational procedures of Fractional Algorithms Unit VI Concept of dynamic programming. queuing problem. Transition Probability and Transition Matrix. ―Normality‖ and ―Orthogonality‖ conditions.

Eighth Edition. Operations Research by Dr. ISBN 978-81-317-1104-0 2. Kedar Nath Ram Nath Publication . Sharma. linear programming and reliability. Inventory Models. Equipment replacement problem.production. Eleventh Edition. Decision trees and Bellman’s principal of optimality. Pearson Publications. Operations Research: An Introduction by Hamdy A Taha. S. Problem of dimensionality. Recursive nature of computations in dynamic programming. Text Books: 1.D. Investment models. Expectation of a random variable.

PAAS. Vulnerability assessment tool for cloud. BigTable. Autonomic Security Cloud computing security challenges: Virtualization security managementvirtual threats. VM Security Recommendations. Cloud Middleware. Map-Reduce and extensions: Parallel computing. Mobile Cloud Computing. Organizational scenarios of clouds.410451 Elective IV: Cloud Computing Teaching Scheme: 4Hrs/Week Examination Scheme Theory: 100 Marks Unit Hrs/ Unit Unit I Introduction to Cloud Computing. Map-Reduce model Content Unit IV Unit V Cloud security fundamentals. Multi-schema approach. resource optimization. Implementing real time application over cloud platform 6 Issues in Intercloud environments. Introduction to cloud development. VM-Specific Security techniques. Utility Computing. 6 HBase and Dynamo. The map-Reduce model. Privacy and 6 Security in cloud Cloud computing security architecture: Architectural Considerations. Secure Execution Environments and Communications. Multitenance using cloud data stores. Elastic Computing Introduction to Cloud Technologies. QOS Issues in Cloud. IAAS and Others.Platform as Service: Google App Engine. Monitoring in Cloud . Pitfalls of virtualization Multitenant software: Multi-entity support. AJAX: asynchronous 'rich' interfaces. Microsoft Azure. A grid of clouds. Sky computing. Unit III Data in the cloud: Relational databases. IAAS Cloud computing platforms: Infrastructure as service: Amazon EC2. resource dynamic reconfiguration. Characteristics. Features and comparisons among GFS. AJAX and mashups-Web services: SOAP and REST. Issues in cloud computing. Access control. Dependability. SOAP versus REST. Secure Execution Environments and Communications in cloud. Cloud file systems: GFS and HDFS. Cloud 8 provider. Parallel efficiency of Map-Reduce. streaming in Cloud. Trusted Cloud computing.General Issues. Quality of Service (QoS) monitoring in a Cloud computing environment. Administering & Monitoring cloud services. Study of Hypervisors 8 Unit Compare SOAP and REST II Webservices. Micro-architectures. Inter Cloud issues. data migration. benefits and limitations. load balancing. Example/Application of Mapreduce. Deploy application over cloud. Relational operations using Map-Reduce. Comparison among SAAS. Components. PAAS.HDFS etc. virtualization applications in enterprises. Mashups: user interface services Virtualization Technology: Virtual machine technology. Identity Management and Access controlIdentity management. Data access control for enterprise applications. Definition. SAAS. Enterprise batch processing using Map-Reduce.

al McGraw Hill. Stefano Ferretti et. Wiley India 5. 2010 IEEE 3rd International Conference on Cloud Computing . Cloud Computing Bible by Barrie Sosinsky. Cloud Security by Ronald Krutz and Russell Dean Vines. Cloud Security & Privacy by Tim Malhar.Kanfman.Unit VI Cloud computing platforms.Kumaraswammy. Eucalyptus. 6 Text Book: 1. R.O’REILLY) 3. 4. S. Apache Virtual Computing Lab (VCL). Enterprise Cloud Computing by Gautam Shroff. Google Apps by Scott Granneman. et. Enomaly Elastic Computing Platform.Cambridge 3. M. TPlatform.‖QoS–aware Clouds”.al. F. Installing cloud platforms and performance evaluation Features and functions of cloud platforms: Xen Cloud Platform. Nimbus. Cloud Computing for Dummies by Judith Hurwitz. Antohy T Velte..Bloor. Wiley-India Reference Book: 1. OpenNebula.Pearson 2.Halper (Wiley India Edition) 2. Cloud Computing : A Practical Approach. S.Latif (SPD.

MD5. Triple DES. PEM. MAC. Introduction to Public key and Cryptography. Key management-Diffie-Hellman key exchange. X. web security considerations. key distribution. Firewalls-design principles.algorithm. IDEA. access control. Unit VI . Introduction to cryptography. standards. finite fields. Implementation and analysis of Security services. security of RSA. IDEA.Legal. and SSL. Study of Security services.509. Kerberos. S/MIME. Security architecture. authentication functions. confidentiality. Encrypt given messages 6 using ECC. Security services. 8 Unit III Unit IV Unit V Introduction to Network. and SSL. trusted systems. Intrusion Prevention System. Intrusion Detection System. Intrusion Prevention System. hash functions etc. and SSL. services and mechanisms Information security management-security policy. trusted systems. guidelines and procedures. PKI. Intrusion Detection System. HMAC. RC5. integrity. Requirements of message authentication. SHA-512. authorization. Intrusion Detection System. MAC. TLS. Study of applications and comparison of authentication functions. cryptography algorithms Principles. Introduction to number theory. web and email security considerations. digital signatures. Elliptical curve cryptography. Different standards related to IS. hash functions. Problems on classical ciphers. stream cipher. DSA.authentication.Classical cryptography. Encrypt given messages 6 using DES. Implementation and analysis of IPSEC. Firewalls-design principles. Unit II Introduction to Secret key and cryptography. hash functions etc. Implementation and analysis of authentication functions. RSA.Classical cryptography. Ethical and Professional Issues 8 Attributes of security. Problems on cryptography algorithms. TLS.attacks. AES. security lifecycle. Transport and Periphery Security. Intrusion Prevention System IPSEC. non-reproduction OSI security architecture. 6 Electronic commerce security. MAC. DES. man-in-themiddle attack. TLS. Authentication applications-. Problems on key generation. Firewalls-design principles. PGP.Teaching Scheme: Teaching 4Hrs/Week Unit Content 410451: Elective IV: Information Security Examination Scheme Theory: 100 Marks Teaching Scheme Unit I Need of information security. AES. trusted systems. Electronic commerce security. Principles. block cipher modes of operation. web security considerations. Study of 6 IPSEC. Introduction to cryptography. Case-study: Information security management used in organizations.

Tata McGraw Hill Publication . 2. Nina Godbole. Mark Rhodes. The Complete Reference". ―Network Security and Cryptography‖. 5. Curtis Patton and RSA press "Security architecture. principles and practices".Electronic commerce security. Bernard Menezes. ―Information System Security‖. Text Books: 1. Smart cards. Cengage Learning.. Charlie Kaufman. King. Radia Perlman and mike speciner "Network security. private communication in a public world" 4. William Stallings "Cryptography and network security. Robert Bragge. ISBN97881-265-1692-6. Pearson Reference Books: 1. design deployment and operations". strengths of Security services. Christopher M.Ltd. 3. Heith straggberg "Network Security.SET. Wiley India Pvt.

Application development on Cluster/Grid computing. 2. Load distributing algorithms. a. Simulation of election algorithms (Ring and Bus Topology). . a. 6. b. Backward error recovery in concurrent systems. Assignment on election algorithms. Performance comparison.Bully b. Clock synchronization: NTP / Lamports clock.Ring 3. Threads clock synchronization. 4. Inter-process communication using socket programming/ RPC mechanism including implementing multi-threaded echo server.410452 Computer Lab II Teaching Scheme Practical: 4 Hrs/Week Examination Scheme Term Work: 50 Marks Practical: 50 Marks 1. Re-assignment protocols. Distributed/Hierarchical deadlock detection algorithms. Study of Distributed File System: NFS – CODA 5.

User Interface design. Laboratory assignments on test cases and test results generated by selected project testing tool. . Exposure to Learning and knowledge access techniques using Conferences. conclusions. Central Universities or UoP Conference or International Conferences in Europe or US. 5) Students must submit and preferably publish atleast one technical paper in the conferences held by IITs.(recommended submission date:.Progress report every week during laboratory) 3) Test tool selection for various testing recommended by preferably external guide and generate various testing result charts. graphs etc.3 weeks after commencement of second term) 2) Programming of the project. 6) Final term work submissions in the prescribed format given by the guides consisting of a project report consisting of a preliminary report prepared in term-I. GUI (if any) as per 1st Term termwork submission. (7 weeks before Term II Conclusion) 4) Review of design and necessary corrective actions taking into consideration feedback report of Term I assessment. detailed design (all necessary UML diagrams) document. tools used and references at the end of Term-II. including reliability testing. Central Universities. installations and setup along with report to the guide. Term II Project Term Work Teaching Scheme Practical: 6 Hours/Week Examination Scheme: Term Work: 100 Marks Oral: 50 Marks 1) Project workstation selection. University Conferences or equivalent centers of excellence etc. appendix (if necessary). Journal papers and participation in research activities. use of state-of-art technologies. and other competitions/conferences participated like IIT.410447 Project Work (Term II) Objectives: To expose students with project-product development cycle using industrial experience. glossary. (recommended submission date:. To encourage and expose students for participation in National/ International paper presentation activities.

Central Universities. 4. using necessary simulators (if required) and presentation by the students. 2. and other competitions/conferences participated like IIT. Project workstation selection. including reliability testing. graphs etc. University Conferences or equivalent centers of excellence etc. . Term-II Project Laboratory Assignments 1. installations along with setup and installation report preparations. The project assessment shall be done using Live Project Demonstration [in existing functional condition]. 3. Programming of the project functions. interfaces and GUI (if any) as per 1st Term term-work submission using corrective actions recommended in Term-I assessment of Term-work. Review of design and necessary corrective actions taking into consideration the feedback report of Term I assessment.The Term II examination is conducted by panel of examiners (preferably guide and expert from Industry having atleast 5 years subject experience (or senior teacher in the subject in case of nonavailability of industry expert). Test tool selection and testing of various test cases for the project performed and generate various testing result charts. The remarks of Term I assessment and related corrective actions must be assessed during examining the term-work.

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master Your Semester with a Special Offer from Scribd & The New York Times

Cancel anytime.