This action might not be possible to undo. Are you sure you want to continue?
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
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
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
81 7371 6126 2.". "Fundamentals of Computer Algorithms". ISBN: 978 81 7371 6119. "Design and Analysis of Algorithms". "Introduction to Algorithm" PHI 2. Pearson Education ISBN 978 81 317 0205 5 3. Horiowitz . University Press. ". Sahani: ―Computer Algorithms / C++. 2ND Edition. PHI Reference Books: 1. Ullman. Text Books: 1.L Leiserson.D. A. Sorting & Convex hulls algorithm. "Fundamental of Algorithm. Horowitz and Sahani. 81 7371 611 0 . 2ND Edition. Aho and J. V. Bressard.(Huffman coding). Review and interactive discussions on home tutorials. Thomas H Cormen and Charles E. ISBN: 978 81 7371 6126. University Press. classroom tutorials and students presentation. Review of recent advances in the subject.
Symbol Table organization and management Run-time Storage organization Introduction: Issues in code generation. type checking and type conversion Syntax directed definitions. optimization of basic blocks. Predictive parsers. Review and interactive discussions on home tutorials. Dynamic programming. Intermediate Code Generation. Error detection and recovery. Introduction: Role of parsers. Bottom up Parsers . procedure parameters. Generating code from a DAG. arrays. Register allocation and assignment. Declarations. variable-length data. Block schematic of lexical analyser. Introduction. back patching. 06 next-use information. L-attributed definitions. case 06 statements. static and dynamic scope. Automatic construction of parsers (YACC). Introduction to phases of Compiler. Basic blocks and flow graphs. bottom-up evaluation of S-attributed Definitions. 13 LL (k) parsers. procedure calls. iterative statements.Operator precedence parsers. Automatic construction of lexical analyser-(LEX). lexical error. Principle sources Of 06 Optimization. LR (k). Activation record. nested procedures. Top06 down translation. Loops in flow graphs. token. shiftReduce: SLR. Introduction and Classification of code optimization. Target machine description. Lexical Analysis. procedure Call and return.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. Top down-RD parser. Source language issues. Review of lexical analysis: alphabet. LALR etc. access to non-local names. Dag representation of basic blocks. LEX specification and features. Boolean expressions. Run-time Storage organization. classroom tutorials and students presentation. structures. Storage organization and allocation strategies for block structured and non block structured languages. Code generator concept. Intermediate languages. Intermediate languages programming structures. assignment statements. using ambiguous grammars. Storage organization and allocation 05 strategies. Optimizing transformations: Unit III Unit IV Unit V Unit VI . YACC specifications. Peephole optimization. conditional statements. construction of syntax trees. Need of semantic analysis. Introduction to Semantic Analysis and syntax directed translation. Intermediate code generation using YACC. Review of recent advances in the subject.
Global Optimization: Control and data flow analysis. Morgan Kaufinann Publishers. 2. Sethi. Levine.7758 . Brown. code movement.8 References Books: 1.Introduction. strength reduction. T. Louden. R. DAG based local optimization. ISBN 81-2032725-X. "Engineering a Compiler". "Lex & Yacc". Mason. live range identification. Pearson Education. ISBN 978-81-315-0132-0 3. variable propagation. ISBN 81-8147-369-8. 2000. 4. R. D. Text books: 1. J. . A V Aho. Prentice-Hall of India. Iterative data flow analysis: Available expressions. 2005. ISBN 81 . "Compilers: Principles. Local optimization.J D Ullman.590 . Loops in flow graphs. Torczon. Common sub-expression elimination. K. Cooper. Computing Global Data flow information: meet over paths. Techniques. ISBN 81-7366 061-X. dead code elimination and loop optimization. . and Tools". Data flow equations. Data flow analysis. L. K. "Compiler Construction: Principles and Practice". Cengage Learning. O'Reilly. "Compiler Design". Chattopadhyay. S. Optimizing transformations: compile time evaluation.
expression syntax Introduction to OMG standards MDA. Interaction Overview diagrams. Timing Diagram.0. XMI. Basic Class diagrams. Interfaces and ports. Basic Class diagrams. Object diagrams. Review of recent advances in the subject. purpose & application of sequence diagrams. purpose & 7 application of UML diagrams. 4+1 Architecture. Extensibility mechanisms like stereotypes. UML Meta model. XMI. use cases. Deployment 6 diagrams. UML 2.0. Need.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. Abstract factory. purpose & application of above diagrams two. proxy.0 UNIT II Requirements modeling: Gathering & classifying requirements. Component Diagram. RUP emphasizing Inception. constraints and profiles. MDA. UML diagrams for following design patterns: Singleton. Package diagrams. OCL: what & why. three tier architecture. UML 2. Forward Engineering and Reverse Engineering of all diagrams of UML 2. Need. Iterator. Review and interactive discussions on home tutorials. CRC method. classroom tutorials and students presentation. Use-case modeling (actors. Advanced use-case modeling. Transition Phases. Concept of Forward Engineering and Reverse Engineering of 7 UML Diagrams. Observer. Design pattern examples UNIT III UNIT IV UNIT V UNIT VI . Composite structure diagrams. Elaboration. Activity diagrams. State Machine diagrams. Advanced Class diagrams. Construction. Design patterns. Communication 6 diagrams. Object diagrams. Requirements workflow Detail Use case specifications. relationships). Façade. Illustrations of Package diagrams. 7 Requirements metamodel. Composite structure diagrams Need. tagged values. History of UML Building Blocks of UML. Use cases & RUP.
3. by Mantha Mahesh. Martin Fowler. Ivar Jacobson "Unified Modeling Language User Guide". Wieley India 4.Addisioh Westey 4. Erich Gamma Richard Helm.0 in a Nutshell". PHI Publications. Ila Neustadt "UML 2 and the Unified Process : Practical ObjectOriented Analysis and Design" (2nd Edition) (Pearson) 2. wiely publication. Onject-Oriented Analysis and Design Using UML. 2. Reference Books: 1. The (2nd Edition) (Addison-Wesley Object Technology Series) (Hardcover) 3. ISBN 978-81203-3322-2. An introduction to unified Process and design patterns. Third Edition (Paperback). Dan Pilone.Text Books: 1. James Rumbaugh. Grady Booch. ―Design patterns‖ Elements of reusable Object – Oriented Software. Tom Pender. Pearson Education. "UML Distilled: A Brief Guide to the Standard Object Modeling Language". Jim Arlow. ―Object Oriented Analysis & Design‖. Mike O’Docherty. ―UML 2 Bible‖. (In a Nutshell (O'Reiily)) Paperback) . Neil Pitman "UML 2.
0 diagrams. good modeling practices.0 • To learn effective use of any CASE TOOL for UML 2. 5) Students will be able to select the set of appropriate diagrams to develop a system model. . • To model an entire system using UML 2. the other diagrams can be drawn on paper.0. and composite structure diagrams. The students will try and identify scope of such a system as realistically as possible. Outcomes: 1) Students will be able to document SRS. best practices in software. web based or embedded system for modeling. forward and reverse engineering aspects.0 Basic And Advanced concepts and notation for the same: • To use UML 2. its scope. unless they are not applicable for the chosen system in which case other systems may be chosen for specific diagrams. notation. advanced notation. timing diagrams. complex systems with example hypothetical systems • To learn concepts. 2) Students will be able to develop structural models. document them and be able to discuss the pros and cons of your designs and models. Any 8 diagrams can be drawn using tool. 4) Students will be able to create Architectural models. • To learn issues in modeling large.0 diagrams for modeling different aspects of a system throughout the SDLC lifecycle. object diagrams for your system as study assignments. • To learn good design. their concepts. Students will learn to draw. 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. 3) Students will be able to develop behavioral 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. As far as possible draw as many diagrams for one single system.Object Oriented Modeling and Design Lab Objectives of the Laboratory: • To learn how to understand the requirements of a system. discuss different UML 2. firmware development today and explore UML 2. Optionally one may draw Interaction overview diagrams.
Image Processing filters. RLE. Elements of matrix theory. Basic image preprocessing (contrast enhancement. Sub-band coding. Segmentation & thresholding. Digital Imaging Hardware & Software. Wiener Filtering. Spatial transformation Gray Level liner and non-linear transformation. Principal Component Analysis & Local Component Analysis for dimension reduction. Content Unit II Unit III 6 Unit IV Image Restoration & Reconstruction. Lines & corners detection.JPEG.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. Lines & corners detection. 6 Implementation Feature extraction: Edges. Boundary Skeleton). Scalar & Vector Quantization. . Hadamard and Walsh transformation. usage and application of 6 image processing. 6 Introduction to Image Compression and its need. Introduction to Human Visual System. Noise Models. simple noise 6 reduction. Unit V Image Compression & Object Recognition. Introduction to Object Recognition. Introduction. 6 Unit VI Wavelets & Application of Image Processing. Haar and Daubechies Wavelets. Fundamental steps and component of image processing system. Classification of image restoration techniques. Image Segmentation & Analysis. Coding Redundancy. Feature extractionEdges. Object Representation (Signatures. Huffman. Shannon fano). Texture & shape measures. color balancing). Model of Image degradation. Lucy Richardson Filtering. smoothing and sharpening domain filters. Classification of Compression Techniques (Lossy and Losless . edge (Canny) & region based approach. use of motion in segmentation. Simple Boundary Descriptors. Histogram Processing. Image enhancement in spatial and frequency domain: basic fundamental. Regional descriptors(Texture). Blind-deconvolution techniques. Digital representation of images (monochrome & color). Texture & shape measures. Image Compression using Wavelets (JPEG 2000). region extraction. Background: Image pyramids. Sampling & Quantization.
The journal will contain minimum six assignments. Chanda. Digital Image Processing. Digital Image Processing and Computer Vision. Introduction to Digital Image Processing with MATLAB. Face detection c. 4. R. D. Alasdair McAndrew. Digital Image Processing. ISBN-81203-0929-4 2. Oral examination will be based on term work submitted. R. and display it . Medical Image Processing b. Local enhancement. Face detection. R. Digital Image Processing And Analysis. Iris Recognition (Note: Students will submit the term work in the form of journal . use suitable algorithm for a. Anil Jain. Smoothing and d. Iris Recognition Text books: 1. References Books: 1. 2.tiff format. B. "Fundamentals Of Digital Image Processing". Unconstrained image restoration 6) Implement any of the following application/ or any Image processing application using MATLAB/ OpenCV a. R.R. T. Cenage Learning Assignment for Image Processing (Using Object oriented techniques/OpenCV) 1) Write a program to create a simple image file . Sonka. Gonzalez. Cenage Learning. Constrained image restoration. 4) Write a program for image enhancement . Boyle. Histogram equalization & specification.C. 2nd Edition. save the same in .R. (recommended using Hadamard or Walsh transformation method or latest advanced transformation method). 3) Write a program using derivative filtering technique for edge detection and further thinning the edge. S. Sharpening 5) Write a program to illustrate a. lavac.) .C. b.ApplicationsMedical Image Processing. Gonzalez. 2) Write a program for image transformation. 3. Veerakumar ( Mc Graw Hill). and b. Woods(TMH) 3. Anil Jain PHI. c. Woods(Person). Digital Image Processing using MATLAB. PHI.Jayaraman.Datta Mujumdar.
comparison of closed loop schemes (stop and wait. Traffic 6 Models. Signaling.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. Security Issues and tools for BW Unit IV Unit V Unit VI . randomization.). M/M/1 Queue System. Admission control. Implementation of System Design. pipelining. point processes Delay Models. Requirements. Open loop and closed loop flow control. System Design. common design 6 techniques. Resource constraints and their metrics. capacity planning. Analysis and design of switching fabrics. Packet scheduling algorithms and RED/AQM. Markov chains. Simulation techniques of System Design Introduction. Credit based etc. Introduction and Framework for Traffic management. M/G/1 system. Modeling and simulation techniques. generalized state dependent arrival and service system. Router algorithms for network measurements. Network design. Renegotiation. security issues. Introduction. soft state etc). Bandwidth management. comparison of various approaches. Network of queues. static window. Implementation aspects of Router/Switch architectures and algorithms Functions and responsibilities. performance analysis and tuning. ATM Forum and IETF approaches Router/Switch architectures and algorithms 6 Introduction and overview of router architecture and hardware Prefix match IP lookup. ATM Forum. scheduling best 6 effort connections and guaranteed service connections. Fundamental choices. Network planning and 6 implementation. open queuing system. Sub-netting. Review of background concepts of computer networks 6 and data communication Content Unit II Unit III Review of discrete random variables. TCP Tahoe. Traffic classes. Study and analysis of System Design. Study of flow control and scheduling. Independence assumption. QOS (ATM Forum and IETF approaches). Tools for BW and security management. summarization of various techniques (e. Access networks and Backbone design. closed queuing system. Implementation aspects of open loop and closed loop flow control.g multiplexing. TCP Vegas. virtualization. IP trace back.Little’s theorem. peak load pricing.
Kershenbaum A. peak load pricing. Security Issues . Open Virtual Network Tools 2.Text Books: 1. Pearson education 2. Data networks by D. Network Algorithms by George Varghese. Network Analysis based decision system for Admission control. Printice Hall 2. Morgan Kaufmann (For Unit 5) Reference Books: 1. Analysis of Flow control and scheduling algorithms using test data 5. 3.Berteskas and R Gallagar. An Engineering approach to computer Networking by S. ―Telecommunication Network Design Algorithms‖. Using simulation tools and test data perform design and analysis of access network and backbone design 4. Network planning and implementation: Bandwidth issue. Use of Little’s theorem or Marcov Chains for design and analysis of network queues. Study of Network Simulators.Keshav. Tata McGraw Hill Design 6 suitable assignments based on following topics for the purpose of Design and Analysis of Computer Networks Laboratory 1.. capacity planning 6. McGraw Hill 3. Design and Analysis of Communication Networks By V Ahuja . Design and analysis of router Algorithm for network measurements using network simulation tools 7.
Alpha--Beta Pruning. Optimal decisions in multiplayer games. Constraint Propagation: Inference in CSPs. How the components of agent programs work. Genetic algorithms. Partially Observable Games Constraint Satisfaction Problems: Defining Constraint Satisfaction Problems. Searching for Solutions. Local beam search. The Structure of Agents. The Foundations of 6 Artificial Intelligence. Implementation aspects of minimax algorithm and CSP. Backtracking Search for CSPs. Variations on the CSP formalism. Solving Problems by Searching. The History of Artificial Intelligence. Stochastic Games. Good Behavior: The Concept of Rationality. Local Search in Continuous Spaces. Evaluation functions for games of chance. Learning heuristics from experience Beyond Classical Search Local Search Algorithms and Optimization Problems: Hill-climbing search Simulated annealing.I. Forward pruning. Cutting off search. Depth-first search. Optimality of A*. Searching with Non-deterministic Actions: AND-OR search trees.6 max algorithm Adversarial Search: Games. Heuristic Functions. Bidirectional search Informed (Heuristic) Search Strategies: Greedy bestfirst search A* search: Minimizing the total estimated solution cost. Optimal Decisions in Games. Move ordering .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. Study of mini. Local Search for CSPs. Applications of A. Implementation of Depth-first search Problem-Solving Agents. Study and analysis of Various 6 searching algorithms. Imperfect Real-Time Decisions. Conditions for optimality: Admissibility and consistency. Searching with Partial Observations Adversarial Search and Constraint Satisfaction Problems. Uninformed Search Strategies: Breadth-first search. Search versus lookup. What Is AI. Unit II Unit III . Uniform-cost search. The Nature of Environments. Intelligent Agents Agents and Environments. Evaluation functions. Iterative deepening depth-first search. Memory-bounded heuristic search. The minimax algorithm. Depth-limited search. Generating admissible heuristics from sub problems: Pattern databases. Alpha-beta pruning and CSP.
Algorithms for Planning as State-Space Search.Unit IV Logical agents and Classical Planning. Kevin Knight and Nair ISBN-978-0-07008770-5. Implementation aspects of Backtracking algorithm and forward and backward chaining Logical Agents: Knowledge representation structures: Frames. Components of Expert System. Backward (regression) relevant-states search. Prepositional Theorem Proving. . Semantic interpretation. Supervised Learning. Forward (progression) state-space search. Implementation aspects of Syntactic Analysis (Parsing) Expert Systems: What is Expert system. Heuristics for planning. Unification. Other Classical Planning Approaches. Knowledge Engineering in First-Order Logic. Inducing decision trees from examples. Steps in NLP. Natural Language Processing: Language Models. Logic: Prepositional Logic. Rule-based methods for uncertain reasoning. Forward and backward chaining. Introduction to logic programming (PROLOG) Classical Planning: Definition of Classical Planning. Syntactic Analysis (Parsing). Case studies on Expert System Text Book: 1. Expressiveness of decision trees. Symbols and interpretations. Implementation aspects of Decision trees Learning from Examples: Forms of Learning. Scripts. Representing Knowledge in an Uncertain Domain. Basic Probability Notation. Bayes' Rule and Its Use. TMH. Hierarchical Planning Unit V 7 Quantifying Uncertainty: Acting under Uncertainty. A complete backtracking algorithm. Discourse and pragmatic Processing. Text Classification. Resolution. semantic net. Artificial Intelligence by Elaine Rich. Conjunctive normal form. Artificial Intelligence: A Modern Approach by Peter and Norvig ISBN-0-13103805-2. Syntax and Semantics of First-Order Logic. Study of fuzzy logic and Decision trees. Horn clauses and definite clauses. Inference Using Full Joint Distributions. Inference and proofs. Other Approaches to Uncertain Reasoning. Planning Graphs. Proof by resolution. The complexity of classical planning. Discourse and pragmatic Processing. Representing vagueness: Fuzzy sets and fuzzy logic. The decision tree representation. 6 Unit VI Natural language processing and Expert systems. Learning Decision Trees. Reference Books: 1. Study and comparison of 6 knowledge representation structures.
Implementation of Solving Uncertainty Problems like Weather forecasting 6. 5. Artificial Intelligence Laboratory Assignments: 1.I.2. Implementation of Mini Expert System . 2. 3. Prolog Programming for A. Implementation of Parsing methods to categorize the text Or 7. Implementation of Unification algorithm by considering Resolution concept.978-81-315-1099-5. Cengage Learning 4. Oxforfd University Press. Implementation of A* algorithm for solving Puzzle problems. 4. Implementation of MinMax Search Procedure with alpha beta pruning for finding the solutions of games. Artificial Intelligence and Intelligent Systems by Padhy. by Bratko. Implementation of Constraint Satisfaction Problem for solving Crypt-arithmetic Problems. TMH 3. Artificial Intelligence by Saroj Kausik ISBN:.
struts . Server side technologies: JSP. composite. JSF. What is 6 software architecture. Session. principles and expectations. Specifications and characteristics of Middleware technologies. Application servers.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. Observer. DHTML. Understanding 6 Unit II quality attributes. AJAX. Entity.MVC. Introduction to Quality Attributes.0 Architecture. Factory. XSLT. RMI. Facade. Introduction to Java EE technologies like JMS. chain of. Proxy. Recent advances in Middleware technologies Introduction to three tier and n-Tier Web Architectures. Message beans. Need of Client side technology in multi-tier architectures Examples of three tier and n-tier architectures. Ways of using patterns Case studies of patterns in software architecture Introduction to Middleware. Case study of quality attributes in software architecture templates. 6 Introduction to Java EE. Client side 6 technologies HTML. Opportunities and Advances in software architectures. XML. Java Applets. Architecture Business Cycle. JDBC. Documenting software architectures. SOCKET. Need of quality attributes. XML. Deriving Quality Attributes for software architectures Design Patterns: history. Java Web 6 Services. Active X controls. SOA. RPC. Mediator. architecture and quality attributes. EJB 3. Architecture structures and views. Iterator. Study of a number of 6 representative patterns like Singleton. Unit III Unit IV Unit V Unit VI Need of server side technology in multi-tier architectures. Types of Middleware. client side technologies Case study of mobile or portable client side technologies. DOM. Adaptor. software architecture requirements. achieving quality attributes. Hrs Unit Contents Unit I Introduction to Software Architecture. Java Servlets.
''Software Architecture in Practice". Discussion/ Consequences/ Implementation. Audience/ Context. 2. Related Patterns. Study and submit a report for any of the MVC based Frameworks (J2EE/EJB) . Pearson . Len Bass. 3. xyz. Paul Clements. Second Edition.Text Book: 1.4: From Novice to Professional 2. "Beginning J2EE 1 . Middleware. The specification must include Problem/ Issue. 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. 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. 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. James L. References. ―Java Sever Programming‖ Black Book dreamTech Press ISBN: \978-81-7722-835-9 4.ISBN 978-81-775-8996-2 2. Richard N.Taylor . Weaver. Rick Kazman. APIs.Wiley ISBN: 978-81-265-2802-8. Forces.‖Design Patterns‖ 3. ―Software Architecture Foundation Theory and practice ―. Design Patterns 1. Java6 Programming. Kevin Mukhar. PHI Publications Reference Book: 1. Erich Gamma. platforms. 3. Nenad M. Solution.
Implement a web application for a system covering 4. components. A representative paper design of the above system using navigation. interfaces. Develop server side programming with database handling/ servlets /EJB/webservice on server side with security aspects covered. . its deployment issue with UML 5. Scripting/Applets/ActiveX controls 6. Develop dynamic and interactive web client using JSP.
Windows API for Multimedia. EDTV. Digital representation. CIF. Introduction to Image Processing and Compression applications. Multimedia Database Systems. Video formats: H-26I. Spatial filtering. SIF. Text file formats: TXT. Arithmetic coding. psycho. RTF. Image acquisition. symmetrical & asymmetrical. Hybrid: JPEG-DCT Programs considerations for image enhancement using point processing and image compression. Media streaming. Loss less: RLE. Text compression: Huffman coding. MPEG Video compression. Video: Digitization of video. Windows multimedia support. LZ & LZW. digital audio. Study of different text formats and video formats. Interaction techniques and devices.DM. Lossy: Vector quantization. Digital representation of text. Color image processing. Image enhancement: Enhancement by point processing. Multimedia OS. Image data types. Design & programming aspects of application for audio/video streaming. 6 Multimedia Audio: Data structures used in audio files. Image compression: Types of compression: Lossy & lossless. HDTV. JPEG). DOC. intraframe & interframe Hybrid. Programming aspects of using Windows/Open-source API for developing applications. transform coding. Characteristics of sound waves. AVI. MIDI and MIDI File format. VOC. CD and DVD formats. TIFF.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. 5 Text :Visual representation of text. BMP. CCER. image file formats (GIF. Video streaming. Multimedia architecture: Introduction to multimedia architectures. Multimedia building blocks. Study and Unit III Unit IV . DPCM Study of different audio file formats and compression techniques Programming considerations for audio compression. fractal compression technique. psycho-analysis.Fano algorithm. Video transmission standards. Audio file formats: WAV. Video capturing . Shannon. 6 Image Processing: Basic Image fundamentals. MPEG Audio Audio compression: Compression in audio PCM. interframe correlation. PDF. H-263. User interfaces. Multimedia authoring tools.
Analysis and development of Multimedia application Unit VI Text Book 1. Media consumption. Woods. Edward Angel. Gonzalez. e-learning and education. rendering. 4. Extension. Quality of data transmission. 3. compression and streaming Unit V Animation and Multimedia Languages. shadowing techniques. Rao. "Digital Image Processing" Addison Wesley Ze-Nian Li.R. Standards. 5. TMH. Pearson Education. . web-based applications. OpenGL: Open GL over windows/Linux. Multimedia over IP. and Networks‖. principles of animation. Addison-Wesley. 2. K. "Fundamentals of Multimedia". Marks S. Study of Multimedia 5 networking. Ranjan Parekh. Learn to use OpenGL 5 Animation: Basics of animation. Cengage Learning. ‖OpenGL: A Primer‖. Programming aspects in creating simple animation using OpenGL Multimedia Communication and applications. Students Presentations: Different Multimedia applications. Communication andApplications". programming languages. ‖ Multimedia Communication Systems: Techniques. "Principles of Multimedia". Pearson Education. ―DeMustified Video‖ Parag Havaldar. Creating animation. Media on Demand Applications Media Entertainment. ‖Multimedia Systems‖. SDK. Gerard Medioni.TMH. 2. Drew. References: 1. types of animation. Ralf Steinmetz and Klara Nahrstedt "Multimedia Computing. 3. techniques of animation.analysis of video formats.
encryption. Review of recent advances in the subject.Artech House 2. base station systems. MAP protocol for basic service support. echo canceller. 6 Unit III 6 Unit IV 6 Unit V Review and interactive discussions on home tutorials. steps in formation of a call. MS-MS call. frequency hopping. TDMA. William C. API’s for mobile application development Text Books 1. GSM background. FDMA. . MTP3. history of mobile communication. introduction to GSM system. Mobile Communication.Y. MAP Protocols. Application layers RR-layer. The Mobile Communication Handbook . Visiting Location Register (VLR). Wily Series In Telecommunication Reference Books 1. equipment identification. Recent Advances and application Standards in Mobile OS Time and Frequency Domains representations. Time organization of signaling channels. call handover. register. Signaling protocols. Jerry D.410445 Elective II: Mobile Computing Teaching Scheme: 3Hrs/Week Marking Scheme : Theory: 100 Marks Hrs/Unit 6 Unit Unit I Unit II Content Applications. cell layout and frequency planning. CC-Layer. Authentication. structure of TDMA slot with frame. classroom tutorials and students presentation. location updates. Time Organization of signaling Channels Mobility Management. Functioning and types of PSTN networks Security issues in mobile computing. Characteristics of SIM. GSM operational and technical requirements. Jochen Schiller. MM-layer. IEEE Press 2. Gibson. Pearson Education Asia . Mobile Communication Design Fundamentals . MS-PSTN call. 6 Unit VI Physical layer. message formation. equipment identity register. Security Application development for Mobile OS Multiplexing issues in time and frequency domains. Asha Mehrotra. GSM System Engg. CDMA. PSTNMS call. TDMA standards and Applications. mobile station. TCAP protocol. GSM network structure. MAP protocol-MAP 6 protocol for MM. switching sub systems. home locations. data link layer. Lee. SCCP.
Android: Wireless Application Development Developer’s Library. Garg V. by Lauren Darcey and Shane Conder. ―Wireless and personal Communications Systems‖. Addison Wesley. Wilkes.. Prentice Hall 4. 2nd Edition.3. Joseph E. Free Online Edition .
Parallel ports their uses in device interfacing. Programmer’s model. Interrupt structure and Applications. Challenges in Embedded System design. Arbitration. Memory Map Of Embedded System. Communication Cycle. Memory Map Of Embedded System I/O interfacing and Communication Buses. Embedded System Programming. statements. 06 Unit III 06 Unit IV 06 . Reset Circuitry and Watchdog Timer. Assembly language V/s High Level Language and its suitability for applications development. List & Order List and their use in the implementation of Embedded System software. topology. Different serial communication Protocols. Clocking Unit. CAN. RS 485. Comparison with ARM9. Modes of operation. Interrupt Structure and Applications. different Packets. Design metrics. Real Time Clock and Timers. Applications. queues and stacks. ARM7 Processor . Review of Microprocessors and Micro-controllers. Relay & stepper motor. Design Examples. C program elements – Micros and functions. Multiprocessor systems using General Purpose Processor. Processor and Memory Selection. CISC and RISC Processor architectures. Interfacing Processors . Timers/Counters. Advances in Embedded Systems System hardware. I2 C. Processor and Memory Selection. Design Process in Embedded System. Digital Signal Processor. data types. Opto-Isolator. Introduction to embedded processor. Memories and I/O. Application Specific System Processor. I/O devices.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. DSP processor. Parallel v/s serial communication. Details of Components of Embedded SystemsManagement of Power Supply. Steps in design process. C /C++/Java programming concepts. Optical Devices such as LED / LCD Display devices. Their comparison and area of application. Software development cycle. modifiers. Serial Data Communication using USB/CAN/RS-232C and Comparison. Process of Converting assembly language program and C language program to ROM image. Components of Embedded System & its Classification. Brief overview of Embedded System Programming In C++ & Java. Structural Units of Processor. Programming concepts. loops and pointers. ADC / DAC. data structures.Architecture. & USB – Protocol Architecture. Characteristic of embedded system. Design Process in Embedded System.RS232C.
Prasad ―Embedded / real time System : Concepts. Dr. Interrupt Latency. K. Handheld computer. Navigation system. Digital camera. K. embedded System OS and Handheld OS – Windows XP Embedded.Their features and applications. Tammy Noergaard. Strategy for synchronization between the processes. ―ARM System Developer’s Guide-Designing and Optimizing Software‖. Design of tasks and IPCs. (Features. Applications). Deadline.Unit V Unit VI Difference between Compliers & Cross Compliers. class diagrams. Rajkamal.Technical Ref Manual 7. CAN Specification Version 2.0 Protocol Standard. Sloss. Design of tasks and synchronization and IPCs. their Block diagram. simulation and debugging tools – simulators. I2C Specification Protocol Standard. K. their sources.0 Protocol Standard. USB Specification Version 2. Software Defined Radio. Embedded Linux. RTOS Tasks and their Scheduling models. 2004. Interrupts. Verma ―Programming for Embedded system ― Wiley – Dreamtech India Pvt. Gupta Dass. IP phone.Brief about different types of device drivers. Prasad. Device Handling and Concepts of Real Time Operating Systems. K. Scheduling. & Programming – Black Book‖ Dreamtech Press Publication. Elsevier Publication. ― Embedded Systems Architecture‖ by Elsevier . their differences. IPC used. Ltd. ARM7/TDMI(ReV4). MicroC/OS II. Context. Representative Embedded Systems – Digital Thermometer. Handheld Operating Systems. Real Time & embedded System OS. Context Switching. Embedded System testing. 06 06 Text Books 1. K. Programmed I/O v/s Interrupt based I/O. Dr. K. 3. Chris Wright. Reference Book: 1. VxWorks. 2. 2008. V. Domiic Symes. 5. 6. 4. V. ―Embedded System Architecture Programming Design‖ Tata Graw Hill Publication Second Edition. Palm OS. Virtual Device Drivers. Rajkamal. Design Examples and case study of – Mobile Phone. Design. laboratory tools-Oscilloscope. ―Embedded System Architecture Programming Design‖ Tata Graw Hill Publication first Edition. Logic Analyzer and In-Circuit Emulator. Automatic Cruise control System. Response time. Design of tasks and synchronization and IPCs Examples of Real Time OS. Device drivers as ISRs . Symbian OS . Exemplary Operating Systems and Representative Embedded Systems. Andrew N. 2. Interrupt Routines in RTOS environment. types and Interrupt service mechanisms. 3.
Basis path testing. Requirement 06 Analysis. 06 Unit static testing by humans. Manual testing Vs Automated testing. Sanity testing. Equivalence Partitioning Unit class. Test case design criteria. Importance of testing in software production cycle. Goals. Productivity. Case-study of White-Box testing Test organization. SQA Model. Quality control & Unit assurance. Measurement tools. Case studies of Black-Box testing. Basics of Software Testing. Winrunner. Testing Principles. Progress. II documentation testing & domain testing. Random Testing. Measurement in small & large system. Testing Life Unit Cycle. requirement based testing. Smoke testing. Six Sigma. Need of white box testing. Mutation Testing. Cost of quality. Methods of quality management. Loop Testing. design of test cases. Defect Report. Adhoc testing. Manual testing. Automated Testing Tools & Case studies. Boundary value analysis. III Graph metrics. Regression testing. Testing metrics: Type 06 of metric – Project. Introduction. IV Other Software Testing: GUI testing. Design of test cases. Automated Testing Tools Case studies 04 04 . Rational Robot. Testing Methods. Defects. Need of black box testing. Validation testing. Case studies based on Web VI based. Advances in Software Testing Methods Software quality. Specification based testing. Loadrunner). Data flow testing. error guessing. Challenges in White box testing.logic coverage criteria. Software quality metrics-TQM. Structure . I Introduction. Test Plan(IEEE format). Quality attribute. Testing of Object oriented systems.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. Positive & negative testing. Scenario testing. Test adequacy criteria. Defect Life Cycle. state based or graph based. GUI testing. Study of Testing tools Unit (QTP. Goal Question metric Unit model. Black box testing Concept. Quality management & project management. Testing types. ISO. Quality Assurance. Structure of testing. Quality factor. Quality V management. cause effect graph based. Phases of Testing. Metric plan.
Erik Van Veenendaal. Pearson Education ISBN-13: 978-0-672-32798-8 2. Dreamtech Press ISBN: 10:817722-532-4 . Software Testing. Software Testing Tools by Dr.G.ISBN 81-7722-712-2 References Books: 1. Willey Publication. ISBN 13:978-0-07-013990-9 3. ISBN 81-265-0893-0 3. By Stephen H Kan. Foundation of software testing by Dorothy Graham. ISBN 81-7758-121-X 5. Dreamtech . Prasad.Text books: 1. Oxford University Press.V.ISBN 978-81-315-0218-1 4. Software Testing Concepts and Tools By Nageshwar Rao . Metric and Model in Software Quality Engineering . Pearson Education. Software testing Principle and Practices By Ramesh Desikan. Limaye TMG Hill Publication.K. ISBN 0-19-806184-6 4. Pearson Education ISBN 81-297-0175-8 2. Software Testing Principles and Tools By M. Effective methods for software testing by William Perry . Second Edition By: Ron Patton. CENGAGE learning . Software Testing Principles and Practices By Naresh Chauhan.K.
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. Assignment to understand basic syntax of LEX specifications. Write an ambiguous CFG to recognize an infix expression and implement a parser that recognizes the infix expression using YACC. Assignment to optimize the generated equivalent three-address code in 3rd assignment. 2. "for". Implement a lexical analyzer for a subset of C using LEX Implementation should support Error handling. YACC 1. . Display all records stored in the symbol table. Code Generation 5. assignment. Write an attributed translation grammar to recognize declarations of simple variables. if. 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. 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. Write a code to store the identifiers from the input in a symbol table and also to record other relevant information about the identifiers. Assignment to understand basic syntax of YACC specifications. built-in functions and Variables. built-in functions and Variables 2. Code Optimization 4.
Exposure to Learning and knowledge access techniques using Conferences. names of atleast two conferences. Plan of project execution using planner or alike project management tool. 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. (Recommended dates: 3 weeks after Commencement of the Term). (if any)) supporting the project idea. NP-Complete or P type using modern . Term I Teaching Scheme: Practical: 2 Hours/Week Examination Scheme: Term Work: 50 Marks Term I project term work 1. Internal guide allocation for the BE Project: Assistant Professor in computer engineering can guide the BE Project. The Project laboratory of 4 project groups (3 to 4 students in one group) constituting one laboratory batch (2 hrs per week). Review of Conference/Journal papers (atleast 10 papers + White papers or web references. be allocated to the guide. Journal papers and participation in research activities. The project conduct and procedures are amended as detailed below:Problem statement feasibility assessment using. In case of non-availability of qualified guide. 2. ACM Keywords) and relevant mathematics associated with the Project. The project group will submit the synopsis including title of the project. use of state-of-art technologies. To encourage and expose students for participation in National/ International paper presentation activities. Preferably. without compromising the quality of the work. Technical Key Words (Ref. HOD can allocate the senior teacher as a guide. where papers can be published.410447 Project Work Objectives: To expose students with project-product development cycle using industrial experience. satisfiability analysis and NP-Hard.
A Report consisting of problem definition. Students must submit atleast one technical paper on the project design in the conferences/workshops in IITs. functions and functional relations and any other dependencies. . morphism. 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. testing of UML diagram's reliability. Project problem statement feasibility assessment using NP-Hard.(recommended submission date:. Function testing principals) selection and appropriate use of testing tools.3 weeks before term end) Testing of problem statement using generated test data (using mathematical models. algebra and relevant mathematical models. 4. Central Universities or UoP Conferences or equivalent International Conferences. 6. 7. (recommended submission date:. (recommended submission date:. NP-Complete or satisfiability issues using modern algebra and/or relevant mathematical models. literature survey.(recommended date of submission:.6 weeks before term end) Functional dependency graphs and relevant UML diagrams or other necessities. 5. 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.two weeks before term end) The index of submission must cover above mentioned 5 heads in addition to the instructions by the guide. 8. overloading.8 weeks before term end) Use of above to identify objects.3. platform choice.
GUI.2. and functional relations and any other dependencies (as per requirements). Testing of project problem statement using generated test data (using mathematical models. Function testing principals. morphisms. 3. if any) selection and appropriate use of testing tools. Use of above to draw functional dependency graphs and relevant UML diagrams or other necessities using appropriate tools. testing of UML diagram's reliability. . 4. Use of above to identify objects. overloading in functions (if any).
Group communication. Applications of Agreement algorithm. Concept of Process. 6 Concepts of Distributed System. System Model. Multidatagram messages. Issues in Interprocess Communication Message Passing . Introduction to Distributed Computing Environment. Advances in Distributed Systems Architecture of Distributed System – Introduction. Classification of agreement problems. Distributed deadlock detection algorithms. Election Algorithms Issues in Designing Distributed System and role of middleware in Distributed System Unit II Unit III Distributed Mutual Exclusion – Introduction. Communication primitives. Issues in IPC by Message passing. RPC. Event ordering. Distributed Computing System Models . Network. What is Distributed System? 7 Evolution of Distributed Computing System. NOS. Avoidance and Prevention algorithms. Token based algorithms.Teaching Scheme: Teaching 4Hrs/Week Unit Unit I Content 410448: Distributed Operating Systems Examination Scheme Theory: 100 Marks Teaching Scheme Fundamentals – Fundamentals of OS. Failure Handling. Classification of mutual 8 exclusion algorithms. Process addressing. Mutual Exclusion. RMI Synchronization. Hierarchical deadlock detection algorithms Agreement Protocols – Introduction. Encoding and decoding of message data. Lamport’s logical clock. Distributed operating system. Case Study: RMI. Protocols for Distributed System. Centralized deadlock detection algorithms. Vector clock. Suzuki Kasami’s broadcast algorithms Distributed Deadlock detection – Introduction. Architectural models of Distributed System Synchronization Introduction. Interprocess Communication. Middleware Communication Networks. Desirable features of good message passing system. Distributed Computing gaining popularity Issues in Designing Distributed System. Global states. CORBA.Introduction . Distributed Synchronization and . Control organizations for distributed deadlock detection. Solutions to the Byzantine Agreement problem. Deadlock. Buffering. non token based algorithms. A simple solution to distributed mutual exclusion. Preliminaries. Threads Clock synchronization. Issues in deadlock detection and resolution. Deadlock handling strategies . Process Synchronization. Motivations. Inherent Limitations of a Distributed System. Preliminaries . Ricart Agrawala algorithm. System architecture types. Process Migration.
Dynamic vote. Advances in Recovery and security mechanisms Unit VI Emerging Trends in Distributed System. advanced models of protection. Basic concepts of Recovery and Types of Failures Recovery – Introduction. Issues. Case studies-BAR Fault Tolerance. Service Oriented Grid. Deadlock Solution to Distributed Mutual exclusion Unit IV Distributed Resource Management. Case studies. Failure Resilient Processes. Coherence protocols. Simulators SOA: Basic SOA Definition. Case studies-Linda Distributed Scheduling – Introduction. Targon/32 UNIX Access and Flow control – Introduction. Design issues. SOA Design and Development. Concepts of Database system 8 Security. 8 Scheduling Algorithms Distributed File System Introduction . Preliminaries. Synchronous and Asynchronous check pointing and recovery Fault tolerance – Introduction. How Grid Computing Works. Google FS Distributed Shared Memory – Introduction. Motivation. Consistent set of checkpoints. Backward error recovery. Concepts of File System. Issues in load distribution. Classification of failures. Memory Coherence. Stability. Voting protocols. Atomic actions and committing. Implementations of Access Matrix. Recovery in concurrent systems. Overview of SOA. Reassignment protocols. Log structured file systems. Selecting a suitable load sharing algorithms. Load distributing algorithms. Performance Comparison. Commit Protocols. Majority based Dynamic Voting protocol. Requirements for load distributing. Architecture and Motivation. Components of load distributing algorithms. Mechanisms for building distributed file system. Access matrix Model. Safety in Access matrix model. Concepts of Cluster. SOA and Web Services. Grid Middleware. Backward and forward error recovery.Agreement Protocol. Grid Architecture. Non blocking Commit protocols. Advantages and Future of SOA Grid computing. Concepts of Mutual exclusion. Basic concepts. Types of Grids Grid Computing Applications. Cloud and SOA Unit V . Concepts 5 of Grid Computing Grid Computing Introduction to GRID Computing. algorithms for implementing DSM. Reliable communication. Load sharing policies. Case studies-Unix OS Distributed Fault tolerance and Security. Task migration Distributed File System: Comparisons Recovery and Security mechanism. Design issues. Architecture.
Colouris .K.Text books: 1. ―Distributed O. Sunita Mahajan. ―Distributed Computing‖. OXFORD University Press Reference Books: 1.Sinha.Shivaratri.G. Tanenbaum. ―Advanced concepts in Operating Systems‖. ―Distributed Systems‖. PHI 2. Mukesh Singhal & N. P. Seema Shah. PHI 2. 3rd Edition .S Concepts and Design‖. ―Distributed System Principles and Paradigms‖. 2nd edition . Andrew S. TMH 3.
Conventional and EPIC architecture. Data buffering techniques. Super scalar architecture of Pentium. Ultra SPARC. Sorting. out of order execution. Issues in Vector Processing. VLIW (Very Long Instruction Word) processor.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. Predicated execution. Speedup Performance Laws. Implementation issues of a program on any pipelined processor their analysis. Evolution of parallel processors. Overview of Parallel Processing and Pipelining Processing Necessity of high performance. cube hyper cube and Mesh Interconnection network. Inter PE Communication. Applications of parallel processing. Case study: Super scalar Architecture. Study and comparison of Vector and array processors. future trends and there architecture. Parallelism in uni-processor system. Interconnection networks of SIMD. Constraints of conventional architecture. Advances in pipeline architectures. trace scheduling. SIMD computer organization. Advanced pipelining techniques. Architectural Classification. Pipelining hazards and resolving techniques. Basic vector architecture. Parallel Algorithms For Array Processors: Matrix Multiplication. Pipeline Architecture. future trends. Design aspect of Arithmetic and Instruction pipelining. Register Stack Engine. 8 Vector and Array Processor. Case study of Intel Itanium Processor. SIMD Computer Organization Masking and Data network mechanism. software scheduling. vectorizers and optimizers. Implementation issues of Matrix multiplication and sorting on array processor and their analysis. Ultra SPARC. Content Unit II Unit III . Study and comparison of processors with and without pipelining. study and 6 comparison of uni-processors and parallel processors. Evolution of parallel processors. Static Vs Dynamic network. Programming aspects for Intel Itanium Processor Principles and implementation of Pipelining. General pipelining reservation table. Job sequencing and Collision. Explicitly Parallel Instruction Computing (EPIC) Architecture. Case study: Cray Arch. Classification of pipelining 8 processors. Software pipelining. loop unrolling techniques. Principles of scalable performance: Performance Metrics and Measures. Speculative loading.Pentium. Vector performance modeling. Instruction level Parallelism and Thread Level Parallelism.
Issues and solutions. Richard Y. Threads (in shared memory system) c) Parallel Programming Languages : Fortran 90. High performance computer Architecture. Parallel software issues. Processor characteristics of multiprocessors. Study of Architecture of Multithreaded processors. Faye A. Multiport Memory Model. 8 a)Parallel algorithms for multiprocessors. d) Issues towards cluster computing. Inter Processor communication network. 4. Massively Parallel Processors (MPP). Kai Hwang. Implementation issues of a multithreaded program. Case Study of IBM Power4 Processor Inter Processor Communication and Synchronization. Synchronous and asynchronous message passing. Parallel Programming Techniques: Message passing program development. C-Linda. Sixth edition. "Advanced Computer Architecture". Kain. classification of parallel algorithms. V. PHI. L Sivaram Murthy.intel. CCC etc. Designing for performance" Prentice Hall. Message Passing Interfaces (MPI). Introduction to Neuro Computing and Grid Computing: Unit V Unit VI Text Books 1. Message passing parallel programming. Crossbar switch. 2. study of parallel programming concepts.Rajaraman. Memory contention and arbitration techniques. Occam. Scalable Parallel Computing. William Stallings. Implementation issues of a program on multiprocessor system. "Parallel Computers". Briggs. "Computer Organization and Architecture. Message passing libraries for parallel programming interface. Harrold Stone. Principles of multithreading. Time shared bus. Latency hiding 7 techniques. Kai Hwang. Data Parallel Programming. Loosely and Tightly coupled multiprocessors. Cow’s and NOW's Cluster and Network of Work Stations). http://www.com/products/processor (for Intel Itanium Processor) . Shared Memory Programming. Chip Multiprocessing (CMP). Tata McGraw-Hill References: 1. performance of parallel algorithms b) Operating systems for multiprocessors systems.Unit IV Microprocessor Architectures. PVM (in distributed memory system). 5. Kai Hwang. Advanced Computer Architecture 6. Cache coherency and bus snooping. 3. study and comparison of Loosely and 8 Tightly coupled multiprocessors. "Computer Architecture and Parallel Processing" McGrawHill international Edition 2.
Parzen-window 7 method. classroom tutorials and students presentation. Support vector machines.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. Criterion functions for clustering. Expectation-maximization method. Perceptron.Stork. C. by K. Hierarchical and other methods. S. Supervised versus Unsupervised Pattern Recognition.Duda.Theodoridis and K. Algorithms for clustering: K-means. Unit III Unit IV Context-dependent classification. K-Nearest Neighbour method. P. Comparison of Supervised and unsupervised Pattern Recognition. Feature Vectors and Classifiers Unit II Bayesian decision theory: Classifiers. Unit VI Non-metric methods for pattern classification. Pattern Recognition. Challenges in Bayesian decision theory Parameter estimation methods. R. Feature Vectors and Classifiers. Statistical Pattern Recognition.. Continuous density hidden Markov models. 2nd edition. Sequential Pattern classification.E. Review and interactive discussions on home tutorials. Dimension reduction methods. Linear discriminant function based classifiers. Principal component analysis. Unit V Non-parametric techniques for density estimation. Unsupervised learning and clustering.G. Pattern Classification. Perceptron.Koutroumbas.Hart and D. 7 Gaussian mixture models. Mean Square Estimation Revisited. Decision trees. Morgan Kaufmann.O. John Wiley. 1990.Bishop. Non-numeric data or 7 nominal data. Fisher discriminant analysis. Pattern Recognition and Machine Learning. Linear Discriminant Functions 7 and Decision Hyperplanes. Review of recent advances in the subject. 7 Context-dependent classification Discrete hidden Markov models. Maximum-Likelihood estimation. 2001 3. 2006 Reference Books: 1. Cluster validation. Review and interactive discussions on home tutorials. Bayesian estimation. classroom tutorials and students presentation. Fukunaga. 4th Ed. Review of recent advances in the subject. Academic Press.M. Least Squares Methods. Implementation issues in algorithms for clustering Text Books: 1. Springer. . 2009 2.
1999. experimenting with wavelet transform. Pattern Recognition Practical Assignment Topic (design six suitable assignments based on the following topic) 1. experiments with PCA and ICA. Using and interpretation of ROC curves. Experiments with edge detection: 6. 2. Write program to build a Bayesian classifier Write a program to recognize line patterns in a given set of points. template matching. 3. . Exploring different feature spaces . 4. Arnold. by A. 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.using Fourier shape descriptors. 5.2. Webb. Statistical Pattern Recognition. 7.
ATM traffic and Congestion control . LAPF protocol (Both Core and Control). Protocol architecture etc) Congestion Notification (FECN. Architecture and Overview of Gigabit Ethernet.ATM in LAN environment (LANE). Background and technological capabilities.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.BECN and CLLM). ATM protocol architecture. Conceptual overview of Signaling System Number 7 Frame Relay: Frame relay Vs X.ATM Adoption layer (need. Congestion Notification (FECN. Applications of Gigabit Ethernet. I.120 ). Detail Functionality of ATM Layer( Cell structure . Architecture and Overview of Gigabit Ethernet.ISDN Network layer (Overview. Protocol architecture etc). B-ISDN protocol architecture. ISDN services. different types and comparison). 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. terminal adoption. Conceptual 6 overview of Signaling System Numbers. Conceptual overview of VDSL. Deployment Case study. Network use of CIR. Gigabit Ethernet Media Access Control (Half Duplex operation Vs Full Duplex Operation). basic call control using Q. Frame relay LAPF protocol. Network Design using Gigabit Ethernet a case study. Virtual Channels and Virtual Path Switching. ATM service categories .Requirements. ISDN Interfaces and functions (transmission structure. Need. B-ISDN Functional 8 Architecture. B-ISDN Transmission structure. Architecture. ISDN Data Link layer (LAPD protocol. U-N Configuration. Market status . Unit IV VDSL and DSL background and technological capabilities and its 8 standards. Frame relay Protocols and services (protocol architecture. Frame Relay Congestion control. Concept of DLCI and its significance. ISDN Interfaces and functions. Architecture. ATM QOS parameters.ATM traffic descriptors. Cell Delineation etc). Ethernet summery Migration from 10Mbps to Gigabit Ethernet. BECN and CLLM) Conceptual view of ISDN and ISDN standards. U-N Configuration. Standards and associations. SONET/SDH and comparison with other available standards ATM: Overview. Classical IP over ATM. Congestion Control frame Work. B-ISDN standards and services. and DE bit.931).465/v. Frame Relay Congestion control. Conceptual overview of VDSL. Unit III Driving forces and need. Gigabit Ethernet Physical layer (1000Base X and 1000Base T). Concept of DLCI and its significance. ISDN Interfaces and functions (transmission structure.25. Frame Mode call control). HEC.
) 4. WiFi & WiMax Basics. Physical layer specifications. 5 Introduction of WiFi and WiMax. Unit VI 2. Physical layer specifications.) Reference Books : 1. Network Components of MPLS. Integrated & differential Services Framework. Comparison of various standards.and future. William Stallings.11 standards. Implementing WiFi Network (Including configuration). Arunabha Ghosh and Rias Muhammad Pearson Education (For Unit VI) Design 6 suitable assignment form the following topics for HPN Laboratory 1. IEEE Standards. Sumit kasera and Pankaj Sethi . ―ISDN and Broadband ISDN with Frame Relay and ATM‖ 4th edition (Pearson Education) 2. WiMax physical and MAC layer overviews. Survey of Open Source Simulation tools for HPN. Frame relay Congestion Control 5. 8 working RSVP protocol. Fundamental of WiMAX by Jeffery Andrews. New node detection and authentication implementation in WiFi environment or simulated WiFi environment 7.‖ATM Networks Concepts and protocols‖ Tata McGraw Hill Publication. Performance study of RSVP protocol using virtual HPN test-bed. HPN organization using bipartite graph) . Applications. Text Books: 1. ―Gigabit Ethernet‖(Addison Wesley Inc. Unit V Introduction to MPLS and QOS. Implementation of ISDN (U-N interface. QOS and WiMax. Rich Seifert. Virtual Network Laboratory for HPN 2. WiMax Standards MAC protocol and operation. Introduction to various WiMax Standards. Costing etc. Router configuration. IETF approach. Latency time measurements in different HPN Server-Client graphs configurations in simulated scalable environment (For example. OFDM and OFDMA. WiMax physical and MAC layer overviews Introduction to IEEE 802. MPLS basic working. 6. MAC protocol and operation. RSVP protocol. MPLS network Components. Network Scalability (Servers) using Gigabit Ethernet 3.
Stochastic Networks & Stimulated Annealing. Hrs/ Unit 6 Unit II 8 Unit III Stochastic Processes and Neural Networks and Stimulated Annealing. ―Artificial Neural Networks‖. Kohonen self-organizing maps. PHI 2. Analysis of linear auto adaptive feed forward networks. Modular neural networks. Characteristics of Neural Networks. 8 6 8 Unit VI Applications of Neural Networks. Basic data structures: mapping of vector spaces. B. Applications in decision making. House. Supervised Learning Neural Networks. Applications in Image Processing. Unsupervised Learning Networks Competitive learning. Associative memories. Unit IV Analysis of linear auto adaptive feed forward networks. Pattern classification. Basic Learning Rules. Jaico Publ. Introduction to artificial neural systems. Optimization. Radial basis function networks. Yegnanarayana. Adaline and madaline. Analysis of pattern storage Networks. principal components. . Models of Neuron. Single layer and multi layer perceptrons. Adaptive networks. 1994. Jacek M. clusters. Recent advances in Neural Networks The Perceptron and its learning law. Principal component analysis of Hebbian Learning. / 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. Biological Neural Networks. Adaptive Resonance Theory. Adaptive Resonance Theory. Applications in decision making 6 Text Books 1. Unit V Unsupervised Learning. Boltzman machine. Feedback Neural Networks. Pattern classification. Applications in Image Processing.410450 Elective III: Neural Network Teaching Scheme: 4 Hrs. Classification of linearly separable patterns. learning vector quantization. Analysis of pattern storage Networks. Analysis of linear auto adaptive feed forward networks. Zurada. Boltzman machine Multilayer Perceptrons.
―Neural Networks-Algorithms. Prentice Hall Neural Networks Laboratory Assignment Teachers are instructed to frame suitable assignments on the following topics 1. Implementation of back propagation algorithm/ simulator for character recognition. ―An introduction to Artificial Neural Networks‖. 3. Anderson. Haykin. Implementation of ART simulator Implementation of SOFM network. James A Freeman. Implementation of BAM simulator. ―Neural Network a comprehensive Foundation‖. 4.3. David M Skapura. PHI 2. 6. 2.‖ Person Education Reference Books 1. Implementation of Perceptron Learning algorithm and Adaline algorithm for two class / three class problems. 5. Implementation of Hopfield network. . Applications and Programming Techniques.
Databases and web architecture.apriori algorithm. Web server. Baysian classifiers. Multidimensional data model. parallel query evaluation. Parallel database architecture. Multidimensional data model. Introduction. Analysis of Decision tree. Simulating and maintaining a Warehouse. Storage of XML Data. Data preprocessing need for preprocessing. Creating and maintaining a warehouse. Analysis of Concurrency control in distributed databases. OLAP and data cubes. XML Document Schema. Implementation of XML validations. Data mining functionalities. Study of Data preprocessing need for preprocessing. speedup. association rules . Structure of XML Data. Commit protocols.k means algorithm. Data warehousing Concepts. Use of Web service like Amazon web service or Microsoft Azure. Unit V Introduction to data mining . API to XML. Inter-query and Intra-query parallelism. Use of web servers. Directory systems-ldap. XML and DTD implementation. Inter-operational and Intra-operational parallelism. Distributed data storage and transactions.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. XML. Distributed transactions. Availability. Comparison of Homogeneous and Heterogeneous Databases.decision tree. Implementing Clustering . OLAP and data cubes. Introduction to Data warehouse and OLAP. Teaching Scheme 08 Unit II 08 Unit III 06 Unit IV Introduction to Decision Support. Operations on cubes. Distributed query processing. Outlier analysis. XML Applications: web services. scale-up I/O parallelism. Introduction to text mining. N-tier architecture. Overview of client server architecture. Distributed data storage. Study of DDBMS architectures. classification . Implementation of Distributed query processing. XPath. Data Warehouse architecture. Data Warehousing. Implementation issues of Parallel query evaluation. Analysis of Data preprocessing. Comparison of Inter-query and Intra-query parallelism. 06 06 . Querying and Transformation: XQuery. Design of parallel systems.k means algorithm. Design of parallel systems. XML validation. FLOWR. Web based system. DTD. clustering . Distributed Databases.
postgres SQL Anyone DBMS from: ORACLE. Sudarshan.Unit VI Information retrieval . measuring retrieval effectiveness. DB2. "Database system concepts". synonyms. Second Edition. Pearson education List of Laboratory Assignment Topics 1. Henry Korth. web search engines. SQL server. 4th Edition. Thomson Learning Press 2. Database systems: "Design implementation and management". Johannes Gehrke. 3. Abraham Silberschatz. 2. Homonyms. S. "Database Management Systems". Ontologies.overview. Relevance ranking using terms and hyperlinks. 5th Edition. "Data Mining: Concepts and systems". Thomas Connolly. Raghu Ramkrishnan. 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. Micheline Kamber. Text Books : 06 1. Information retrieval and structured data.Carolyn Beg ―Database Systems :Practical approach to design implementation and management ― third edition. 6. ontologies. Rob Coronel. CauchDB . Study and Comparison of Synonyms. Indexing of documents. Information Retrieval. McGraw Hill International Edition 2. Jiawei han. McGraw Hill International Edition 3. Morgan Kaufmann Publishers Reference Books 1. 5. Stop words Case Study : Anyone DBMS from open source: mysql. Implementation issues of Relevance ranking Algorithm. homonyms. IDF.
integrated circuits. signal values. Computer Simulation of VLSI Modern CMOS Technology 8 Introduction. digital-design levels. Semiconductor Technology Families. programmable logic devices. Gate Formation. Memories. wafer Cleaning. CPLDS. Raw materials and Purification. Source/Drain Formation. dielectrics. Active Region Formation. gettering. entity-architecture. backend technology. sequential logic design principles. Basic Properties of Silicon Wafers Crystal Growth Wafer Fabrication Wafer Preparation and specification. Digital devices. Light sources. electronic aspects of digital design. The role of hardware description languages. synthesis: the simulation model. Software aspects of digital design Unit VI Combinational logic design principles. application-specific IC’s. field programmable gate arrays(FPGAs). number systems and codes. CMOS Process Flow 6 Historical Development and Basic Concepts Crystal Structure. constructing VHDL models using CSAs . implants in real silicon. understanding delays. VHDL Programming Unit V Introduction to Digital Design. interconnects and vias. Multilevel Metal Formation. Analog versus Digital. Contamination reduction: Clean factories. shared signals. Process Options for Active Region and Well Formation. Lithography: Light sources. physical vapor deposition. Contact and Local Interconnect Formation. Choosing a Substrate. Defects in crystals. digital circuits. and FPGAs Unit III 6 8 6 . the synthesis model. basic concepts of chemical vapor deposition . Tip or Extension(LDD) Formation. Czochrlski and Float-Zone Crystal Growth Methods. propagation delays. Integrated circuits and the Planar Process. Semiconductors. Process Option for Device Isolation – Shallow Trench Isolation. Mask engineering: Basic concepts of Thermal oxidation and the si/sio2 Interface. and concurrency. Unit IV What is VHDL? Introduction: Modeling Digital Systems: describing systems. Photoresists. events. simulation vs. Basic concepts of dopant diffusion . basic concepts of wet etching and plasma etching. Wafer Development and Dopants. Software aspects of digital design. basic language concepts: signals. wafer exposure systems. waveforms and timing. concurrent statements. contacts.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. Wafer Preparation and specification. N and P Well Formation. Semiconductor 6 Devices.
Practice and Modeling by James D Plummer et. Pearson education ISBN 978-81-317-2604-4 2.Text Books: 1. Digital Design: principles and practices fourth edition by John F. Wakerly Pearson prentice hall ISBM 978-81-317-1366-2 .. VHDL: from simulation to synthesis by Sudhakar Yalamanchili Pearson education ISBN 81-7808-558-5 3. Silicon VLSI Technology: Fundamental. al.
Constrained and unconstrained problems of Maxima and Minima. Queuing system. Decision making under certainty. Specialized Poisson Queues. Advanced Linear Programming. Transition Probability and Transition Matrix. Review of recent advances in the subject. processing 2 jobs with m machines. Goal Programming. Role of exponential distribution in queuing systems. To derive necessary condition of optimality. Characteristics of Game theory. Decision making under risk. Practical solutions of 8 NLP. Solutions of mixed strategy games. Random variables and Probability 8 distributions. Variations in expected value criteria. Queuing decision models. Processing n jobs with 2 machines. ―Normality‖ and ―Orthogonality‖ conditions. M/G/1 formula. Minimum path problem. Transient and steady States. Marcov Process and Marcov chain. Canonical form of NLP. Optimal Strategies and value of game. Multi. Computational procedures of Fractional Algorithms Unit VI Concept of dynamic programming. Decision making under uncertainty. Network diagrams with time estimates and analysis. Maxima-minima. Geometric programming problem. Modeling with Linear Programming: Two-Variable LP model. Generalized poisson queuing model. Solving the OR model. Applications of dynamic programming in . Solution of sequencing problem. Game theory: Introduction and definitions. Principal 6 Assumptions.period models. Project Management: Applications and basic steps in PERT/CPM techniques. Lagrangian method. List of 6 symbols. Deterministic dynamic 6 programming. Queuing and 6 Simulation Models. resource allocation. Linear Programming (LP) Applications. Forward and Backward recursion. Continuous review models. models of single additive constraint. queuing problem. Elements of Queuing models. Graphical LP Solutions. Piece-wise linear approximation of NLP. solution of game with saddle point. Unit IV Job sequencing: Introduction. Review of basic probability. Utilization factor. Inventory Models Unit V Non-Linear Programming (NLP) Introduction. Birth and Death Models. Multiplicatively Separable return. Simplex method and sensitivity analysis. Four Common distributions. Processing n jobs with m machines. Problems with inequality constrains. General from of NLP.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. Duality. Terminology and Notions. Saddle point. Random Processes. Introduction to Separable functions.
Kedar Nath Ram Nath Publication . Recursive nature of computations in dynamic programming. S.production. linear programming and reliability. Expectation of a random variable. Pearson Publications. Decision trees and Bellman’s principal of optimality. Text Books: 1. Sharma. Problem of dimensionality. ISBN 978-81-317-1104-0 2. Operations Research: An Introduction by Hamdy A Taha.D. Investment models. Eighth Edition. Equipment replacement problem. Eleventh Edition. Inventory Models. Operations Research by Dr.
Study of Hypervisors 8 Unit Compare SOAP and REST II Webservices. load balancing. Elastic Computing Introduction to Cloud Technologies. Secure Execution Environments and Communications in cloud. AJAX and mashups-Web services: SOAP and REST. Vulnerability assessment tool for cloud. BigTable.Platform as Service: Google App Engine. Cloud file systems: GFS and HDFS. Trusted Cloud computing. Parallel efficiency of Map-Reduce. Multitenance using cloud data stores. Dependability. VM Security Recommendations. PAAS. Secure Execution Environments and Communications. Issues in cloud computing. Implementing real time application over cloud platform 6 Issues in Intercloud environments. 6 HBase and Dynamo. Inter Cloud issues. Map-Reduce model Content Unit IV Unit V Cloud security fundamentals. QOS Issues in Cloud. Data access control for enterprise applications. Comparison among SAAS.HDFS etc. Deploy application over cloud. resource dynamic reconfiguration. SOAP versus REST. Definition. Enterprise batch processing using Map-Reduce. Identity Management and Access controlIdentity management. Access control. Quality of Service (QoS) monitoring in a Cloud computing environment. Administering & Monitoring cloud services.410451 Elective IV: Cloud Computing Teaching Scheme: 4Hrs/Week Examination Scheme Theory: 100 Marks Unit Hrs/ Unit Unit I Introduction to Cloud Computing. benefits and limitations. Components. IAAS Cloud computing platforms: Infrastructure as service: Amazon EC2. streaming in Cloud. PAAS. Microsoft Azure. Mobile Cloud Computing. Relational operations using Map-Reduce. Cloud Middleware. Sky computing. Micro-architectures. Utility Computing. resource optimization. virtualization applications in enterprises. SAAS. The map-Reduce model. Example/Application of Mapreduce. Characteristics. Monitoring in Cloud . Pitfalls of virtualization Multitenant software: Multi-entity support.General Issues. Map-Reduce and extensions: Parallel computing. Autonomic Security Cloud computing security challenges: Virtualization security managementvirtual threats. Unit III Data in the cloud: Relational databases. Features and comparisons among GFS. AJAX: asynchronous 'rich' interfaces. Introduction to cloud development. VM-Specific Security techniques. Privacy and 6 Security in cloud Cloud computing security architecture: Architectural Considerations. IAAS and Others. data migration. Multi-schema approach. A grid of clouds. Cloud 8 provider. Organizational scenarios of clouds. Mashups: user interface services Virtualization Technology: Virtual machine technology.
et. Wiley India 5.Latif (SPD.al. 6 Text Book: 1. Enomaly Elastic Computing Platform.Bloor.Kumaraswammy. Enterprise Cloud Computing by Gautam Shroff. TPlatform.Cambridge 3. Apache Virtual Computing Lab (VCL). Wiley-India Reference Book: 1. Nimbus.Halper (Wiley India Edition) 2. Cloud Security by Ronald Krutz and Russell Dean Vines.O’REILLY) 3. Cloud Security & Privacy by Tim Malhar. S. F. Installing cloud platforms and performance evaluation Features and functions of cloud platforms: Xen Cloud Platform. Antohy T Velte. Eucalyptus. 2010 IEEE 3rd International Conference on Cloud Computing .al McGraw Hill.Pearson 2. M.‖QoS–aware Clouds”. Cloud Computing Bible by Barrie Sosinsky.. R. OpenNebula.Unit VI Cloud computing platforms. Google Apps by Scott Granneman. 4. Stefano Ferretti et. Cloud Computing : A Practical Approach.Kanfman. S. Cloud Computing for Dummies by Judith Hurwitz.
Intrusion Prevention System. and SSL. RSA. TLS. IDEA. Intrusion Detection System. HMAC. Encrypt given messages 6 using DES. non-reproduction OSI security architecture. Introduction to cryptography. web security considerations. finite fields. DES.Classical cryptography. digital signatures. confidentiality. trusted systems. 8 Unit III Unit IV Unit V Introduction to Network. SHA-512. Introduction to Public key and Cryptography.509. PEM. MD5. web security considerations.authentication. Study of applications and comparison of authentication functions. MAC. Introduction to number theory. authentication functions. access control. services and mechanisms Information security management-security policy. Firewalls-design principles. integrity. block cipher modes of operation. guidelines and procedures. web and email security considerations. Kerberos.attacks. Authentication applications-. S/MIME. Principles. Problems on cryptography algorithms. PKI. IDEA.Legal. Different standards related to IS.algorithm.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. Unit II Introduction to Secret key and cryptography. Problems on classical ciphers. Elliptical curve cryptography. trusted systems. AES. Ethical and Professional Issues 8 Attributes of security. Firewalls-design principles. 6 Electronic commerce security. hash functions etc. MAC.Classical cryptography. DSA. hash functions etc. Problems on key generation. Unit VI . authorization. Introduction to cryptography. Encrypt given messages 6 using ECC. Intrusion Detection System. TLS. Requirements of message authentication. key distribution. man-in-themiddle attack. Intrusion Prevention System. TLS. Intrusion Detection System. security of RSA. Transport and Periphery Security. Implementation and analysis of Security services. Study of Security services. PGP. standards. stream cipher. RC5. security lifecycle. Triple DES. Security services. AES. Security architecture. trusted systems. X. hash functions. Case-study: Information security management used in organizations. and SSL. Intrusion Prevention System IPSEC. cryptography algorithms Principles. Implementation and analysis of IPSEC. Implementation and analysis of authentication functions. Study of 6 IPSEC. and SSL. Key management-Diffie-Hellman key exchange. Firewalls-design principles. MAC. Electronic commerce security.
Christopher M. 5.Ltd.SET. Curtis Patton and RSA press "Security architecture. design deployment and operations". ISBN97881-265-1692-6. ―Information System Security‖. Mark Rhodes. Text Books: 1. 2. Smart cards.. Heith straggberg "Network Security. Cengage Learning. Pearson Reference Books: 1.Electronic commerce security. principles and practices". King. 3. Wiley India Pvt. private communication in a public world" 4. ―Network Security and Cryptography‖. Nina Godbole. Charlie Kaufman. Radia Perlman and mike speciner "Network security. strengths of Security services. Robert Bragge. Bernard Menezes. William Stallings "Cryptography and network security. The Complete Reference". Tata McGraw Hill Publication .
. 2.Bully b.Ring 3. b. a. Re-assignment protocols. Threads clock synchronization. a.410452 Computer Lab II Teaching Scheme Practical: 4 Hrs/Week Examination Scheme Term Work: 50 Marks Practical: 50 Marks 1. Assignment on election algorithms. Load distributing algorithms. Study of Distributed File System: NFS – CODA 5. 4. Clock synchronization: NTP / Lamports clock. Inter-process communication using socket programming/ RPC mechanism including implementing multi-threaded echo server. Application development on Cluster/Grid computing. Distributed/Hierarchical deadlock detection algorithms. 6. Performance comparison. Simulation of election algorithms (Ring and Bus Topology). Backward error recovery in concurrent systems.
410447 Project Work (Term II) Objectives: To expose students with project-product development cycle using industrial experience. 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. To encourage and expose students for participation in National/ International paper presentation activities. (recommended submission date:.3 weeks after commencement of second term) 2) Programming of the project. graphs etc. Laboratory assignments on test cases and test results generated by selected project testing tool. GUI (if any) as per 1st Term termwork submission. . conclusions. use of state-of-art technologies. appendix (if necessary). 5) Students must submit and preferably publish atleast one technical paper in the conferences held by IITs. glossary. Term II Project Term Work Teaching Scheme Practical: 6 Hours/Week Examination Scheme: Term Work: 100 Marks Oral: 50 Marks 1) Project workstation selection. including reliability testing. University Conferences or equivalent centers of excellence etc. detailed design (all necessary UML diagrams) document. and other competitions/conferences participated like IIT. Journal papers and participation in research activities. installations and setup along with report to the guide. tools used and references at the end of Term-II. Exposure to Learning and knowledge access techniques using Conferences.(recommended submission date:. User Interface design.Progress report every week during laboratory) 3) Test tool selection for various testing recommended by preferably external guide and generate various testing result charts. Central Universities or UoP Conference or International Conferences in Europe or US. Central Universities. (7 weeks before Term II Conclusion) 4) Review of design and necessary corrective actions taking into consideration feedback report of Term I assessment.
using necessary simulators (if required) and presentation by the students. 3. including reliability testing. Term-II Project Laboratory Assignments 1. 2. 4.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). Programming of the project functions. Central Universities. The project assessment shall be done using Live Project Demonstration [in existing functional condition]. . Project workstation selection. University Conferences or equivalent centers of excellence etc. The remarks of Term I assessment and related corrective actions must be assessed during examining the term-work. Test tool selection and testing of various test cases for the project performed and generate various testing result charts. and other competitions/conferences participated like IIT. installations along with setup and installation report preparations. Review of design and necessary corrective actions taking into consideration the feedback report of Term I assessment. graphs etc. interfaces and GUI (if any) as per 1st Term term-work submission using corrective actions recommended in Term-I assessment of Term-work.