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