UNIVERSITY OF PUNE

B.E. (COMPUTER ENGINEERING) - 2003 COURSE
Term I Subject Code
Subject Teaching Scheme Lect. Pract
410441

Examination Scheme Th 100 Tw Pr — — — — — 50 —
50 — 50 — 50 — — 100 Or

Mark

Design & Analysis of Algorithms Operating Systems

04 -03
— 02 — 02 04 02 10

100 100 175 100 175 100 50 800

410442 410443

100 — 100 25 100 — 100 25

Object Oriented Modeling & 03 Design Principles of Compiler Design Elective I Computer Laboratory I Project Work

410444

04 04 — — 18

410445 410446 410447

50

— — 50

Total

500 100

Term II
Subject Code Subject

Teaching Scheme Lect.
Pract 02

Examination Scheme

Mark Or — 100 100

Th 100 100

Tw —

Pr —

410448 410449

Networks and Information Security Advanced Computer Architecture and Computing Software Testing and Quality Assurance Elective II

04 04

410450 410451 410452 410447

04 04

— 02 04 06 12

100 100
——

— 25 25 100 200

— — 50 — 50

— 50 — 50 100

100 175 75 150 700

Computer Laboratory II — Project Work Total — 16

400

Th: Theory Tw: Term Work Elective I 1) Image Processing 2) Advanced Databases 3) Artificial Intelligence 4) Multimedia Systems Elective II 1) Distributed Systems 2) Software Architecture 3) Embedded Systems 4) High Performance Networks

Pr: Practical Or: Oral

410441 Design And Analysis of Algorithms Teaching Scheme: Examination Scheme: Theory: 4 Hours/Week Theory: 100 Marks
Duration: 3 Hrs Objectives: • To study and perform analysis of algorithms. • To study techniques/strategies in design of algorithms UNIT I: Introduction: Asymptotic notations, Average, Best and Worst case analysis of algorithms for Time and Space complexity, Amortized Analysis, Solving Recurrence Equations, Proof Techniques: by Contradiction, by Mathematical Induction. Priority Queues: Heaps & Heap sort. 8 Hours
UNIT-II

Divide And Conquer And Greedy Strategy: Divide and Conquer: General Strategy, Exponentiation. Binary Search, 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. 9 Hours UNIT III: Dynamic Programming: General Strategy, Multistage graphs, OBST, 0/1 Knapsack, Traveling Salesperson Problem, Flow Shop Scheduling. 7 Hours UNIT IV: Backtracking & Branch And Bound: Backtracking: General Strategy, 8 Queen's problem, Graph Coloring, Hamiltonian Cycles, 0/1 Knapsack. Branch and Bound: General Strategy, 0/1 Knapsack, Traveling Salesperson Problem . 8 Hours

UNIT V: Parallel Algorithms: Computational Model, Basic Techniques and Algorithms (Complete Binary Tree, Pointer Doubling, Prefix Computation), Selection, Merging, Sorting Networks, Parallel Sorting, Graph Problems (Alternate Algorithm for Transitive Closure, All pairs shortest path) 8 Hours

UNIT VI: NP-Hard And NP-Complete Problems: Algorithms, Complexity-intractability, Non-Deterministic Polynomial time (NP) Decision problems, Cooks Theorem. NP-Complete problems- Satisfiability problem, vertex cover problem. NP-Hard problems-graph, scheduling, code generation problems, Simplified NP Hard Problems. 6 Hours

Text Books: 1. Bressard, "Fundamental of Algorithm.", PHI 2. Horowitz and Sahani, "Fundamentals of computer Algorithms", Galgotia. References: 1. Thomas H Cormen and Charles E.L Leiserson, "Introduction to Algorithm" PHI 2. A. V. Aho and J.D. Ullman, "Design and Analysis of Algorithms", Addison Wesley

OS synchronization 4 Hrs UNIT II: Deadlocks: System mode!. UNIT I: Process synchronization and inter-process communication : Background. avoidance. file & Record Locking. file system maintenance 8 Hrs UNIT V : Structures of processes: Process States and Transitions. securing system and facilities. Other file types. Invoking other programs. User perspective. stat and fstat. The User ID of a process. Assumptions about hardware. Process control: Process Creation. file system abstrations. pipes. File Creation. System Calls for the file system: open. Process Termination. Kernel Data Structures. Signals. Inode assignment to a new file. domain of' protection. read. Advantages and Disadvantages of the Buffer Cache 8 Hrs UNIT IV: Internal Representation of files: Inodes. Manipulation of the process address space. Saving the context of a process. link. Close. System Administration. Access matrix. Conversion of a path name to an Inode. monitors. Change Directory and Change Root. Architecture of UNIX OS. Objectives • To study advanced concepts of operating systems To study the comparison of different function of different OSs. Changing the size of a process. classic problems of synchronizations. Critical section problem. Super Block. methods For handling deadlocks. prevention. critical regions. Revocation of access rights Security: Security problem. Awaiting Process Termination. Allocation of Disk Blocks. mounting and unmounting file systems. program threats. Intrusion detection and cryptography 6 Hrs UNIT III: System Architecture. system threats. Directories. dup. The shell. Operating System Services. deadlock characterization. Sleep. write. Iseek. unlink. semaphores. Process Scheduling and Time: Process Scheduling. Reading and Writing Disk Blocks. Buffer Headers. Implementation of Access matrix. Creation of Special Files. Structure of a regular file. The Context of a process. System calls for time & clock . Change Owner and Change Mode.recovery Protection: Goals of protection.410442 Operating Systems Teaching Scheme lectures: 3 Mrs/Week Theory: 100 Marks Duration: 3 Mrs. Introduction to System Concepts. System boot and the init process. deadlocks detection. Layout of System Memory. User authentication. Scenarios for retrieval of a Buffer.. Structure of'the Buffer Pool.

. Prentice Hall India. 2nd '. ISBN-81-203-0516-7 . 'Maurice J. John Wiley & Sons.. 5/e. Gagnes . "Operating System Concepts" 6/e. a hybrid system with swapping and demand paging I/O Subsystem: Driver interfaces. "Operating System-Internals and Design Principles ".." Modern Operating Systems". Prentice Hall India.8 Hrs UNIT VI: Memory Management Policies: Swapping. William Stallings. Tanenbaum. ISBN-81203-2063-8 3. Prentice Hall India. ISBN-81-297-01094-3 2. Terminal drivers. 2/e. ISBN-9971-51-388-9 Reference Books: 1. Disk drivers. Edition-2006 2. Galvin. Tata McGraw Hill Publications.A Concept-Based Approach". Demand Paging. Bach. -. Dhamdhre D. M. Streams 4 Mrs Text Books: 1. "The design of the UNIX Operating System". Silberschatz. Andrew S."Operating Systems .

Forward Engineering. Communication diagrams. Deployment diagrams. regions. Architectural approaches : Use case Centric. UNIT IV: Interaction diagrams.0 and its diagrams as a modeling tool for large and complex systems. firmware and business processes. Applications of UML commercial applications. Timing diagrams. aggregation. Activities. Notation. CRC method. Templates. transitions.0 for each diagram the need. UNIT III Object diagrams . UML History. collaborations.CORBA . association. dependencies. Interfaces and ports.Rational Unified Process emphasizing Inception. UNIT II: Introduction to UML. 4+1 View architecture. Classes and Relationships.Overview of all diagrams in UML 2. exceptions. UNIT VI: Support for modeling Architecture in UML. All diagrams are to be assumed for UML 2. • Introduce UML 2. sub activities. Objectives: • Introduction to Modeling and Design of software. regions.410443 Object Oriented Modeling and Design Teaching Scheme Lectures: 3 Hours /Week Practical: 2 Hours/Week Examination Scheme Theory : 100 Marks Term Work:25 Marks Oral: 50 Marks Duration: 3 Mrs. UML 2. submachine. OCL. signals.0. Elaboration. partitions.0 New Features. Construction. Interaction Overview diagrams including interactions. UML 2. Reverse Engineering & Application must be considered. MOF. partitions. exceptions. purpose. Architecture driven. States.Class diagrams. Advanced relationships generalization. Review of OO concepts. UNIT V: State Machine diagrams. Iterative approach. XMI. Extensibility mechanisms like stereotypes. Sequence diagrams.0. OO Concepts Review. Concepts. Composite structure diagrams including composite structures. . Transition Phase's. state generalization. UML MetaModel. Activity diagrams. encapsulation of states. tagged values. constraints and profiles. signals. • Understand the concepts being modeled in UML UNIT I Introduction to OMG Standards : MDA. Active Objects.

Text Books. • To model an entire system using UML 2. • To learn good design. Third Edition (Paperback) . web based or embedded system for modeling. Jim Arlow. good modeling practices. Grady Booch. and composite structure diagrams. Brian Lyons. 2. Magnus Penker. Dan Pilone. "UML Distilled: A Brief Guide to the Standard Object Modeling Language". object diagrams for your system as study assignments.0 Basic And Advanced concepts and notation for the same: • To use UML 2. best practices in software. Ila Neustadt "UML 2 and the Unified Process : Practical Object-Oriented Analysis and Design" (2nd Edition) (Addison-Wesley Object Technology Series) (Paperback) 6. discuss different UML 2. its scope. Ivar Jacobson "Unified Modeling Language User Guide". .0 diagrams. Apress "Fast track UML 2. firmware development today and explore UML 2. unless they are not applicable for the chosen system in which case other systems may be chosen for specific diagrams. Kendal Scott. The (2nd Edition) (Addison-Wesley Object Technology Series) (Hardcover) Reference Books: 1.Michael Jesse. advanced notation. 1. Schardt "UML 2.0. • To learn issues in modeling large. paper based assignment or in cases relevant even in CASE TOOL . Hans-Erik Eriksson. To meet above objectives teachers will help students choose a hypothetical system preferably either a commercial. (In a Nutshell (O'Reiily)) Paperback) 4. David Fado "UML 2 Toolkit (Paperback)" 5. complex systems with example hypothetical systems • To learn concepts.Addisioh Westey 3.0 " Object Oriented Modeling and Design Lab Objectives of the Laboratory: • To learn how to understand the requirements of a system.0 diagrams for modeling different aspects of a system throughout the SDLC lifecycle .0 • To learn effective use of any CASE TOOL for UML 2. James Rumbaugh. the other diagrams can be drawn on paper. notation. James A. Students will learn to draw.0 for dummies " 7. timing diagrams. The students will try and identify scope of such a system as realistically as possible. Martin Fowler. Third edition. forward and reverse engineering aspects.0 in a Nutshell". Optionally one may draw Interaction overview diagrams. Joseph Schmuller "SAMS Teach yourself UML in 24 Hours". Any 8 diagrams can be drawn using tool. Neil Pitman "UML 2. document them and be able to discuss the pros and cons of your designs and models. As far as possible draw as many diagrams for one single system. their concepts.

access to non-local names. back patching. lexical error. Boolean expressions. shift-Reduce: SLR. Symbol Table organization and management 6 Hours . conditional statements. variable-length data. Block schematic of lexical analyser. Boot strapping. case statements.410444 Principles Of Compiler Design Teaching Scheme Lectures: 4 hrs/week Theory: 100 Marks Duration : 3 Hrs Objectives • To learn and understand the design of a compiler • To learn and use tools for construction of a compiler UNIT I: Introduction to Compiler: Translator issues. LL (k) parsers. static and dynamic scope. Top-down translation. "Automatic construction of lexical analyser-(LEX). procedure parameters. Incremental compiler. LEX specification and features. type checking and type conversion 10 Hours UNIT HI: Syntax directed translation Syntax directed definitions. 10 Hours UNIT IV: Runtime Storage Organization Source language issues.Operator precedence parsers. L-attributed definitions. Bottom up Parsers . nested procedures. iterative statements. token. structures. byte code compilers. arrays. 6 Hours UNIT II Syntax Analysis Introduction: Role of parsers. procedure Call and return. Intermediate code generation using YACC . using ambiguous grammars. Activation record. Lexical Analysis. assignment statements. bottom-up evaluation of S-attributed Definitions. Cross compiler. construction of syntax trees. Automatic construction of parsers (YACC). compilation process in brief. compiler construction tools. LR (k). procedure calls. Storage organization and allocation strategies. bottom-up evaluation of inherited attributes -Intermediate Code Generation Intermediate languages. Review of lexical analysis: alphabet. declarations. front end and backend model. YACC specifications Semantic Analysis Need of semantic analysis. LALR etc. for block structured and non block structured languages. Top down-RD parser. why to write compiler. Interpreter and the related issues. Error detection and recovery. Predictive parsers.

Morgan Kaufinann Publishers. S. Cooper. Louden. notes. "Lex & Yacc". DAG based local optimization. "Compiler Design". J. 2000. Global Optimization: Control and data flow analysis. 2003.590 . Target machine description. Prentice-Hall of India. "Compilers: Principles. L. ISBN 81-7366 -061-X. T. 2005. . ISBN 81 . Levine.The write-ups for any diagram can include small examples to cover notation that has not been referred to in your submitted diagram. next-use information. Mason. "Engineering a Compiler". Local optimization. non-functional requirements.UNIT V: Code Generation: Introduction: Issues in code generation. Techniques. Common sub-expression elimination. . Classification of optimization. live range identification 8 Hours Text Books 1. ISBN 981 . Data flow analysis. Code generator. code movement. ISBN 81-8147-369-8. A V Aho. optimization of basic blocks. Pearson Education. R.7758 . Loops in flow graphs. Dynamic programming. Brown. Thomson Brookes/Cole (ISE). variable propagation. 8 Hours Unit VI: Code Optimization Introduction. Iterative data flow analysis: Available expressions. Optimizing transformations: compile time evaluation. R. Principle sources Of Optimization. O'Reilly. Sethi. K. dead code elimination and loop optimization. assumptions. ISBN 81-203-2725-X. D. Torczon. Computing Global Data flow information: meet over paths.K. strength reduction.8 Reference Books - 1. Generally any UML diagram has accompanied document to explain the diagram further for example use case descriptions. Register allocation and assignment. Data flow equations. "Compiler Construction: Principles and Practice". Chattopadhyay. 2. 4. Basic blocks and flow graphs. project management aspects.694-4: 3. Dag representation of basic blocks.243 . Peephole optimization.J D Ullman. and Tools". Generating code from a DAG. scripts.

5. 8. Draw deployment diagrams to model the runtime architecture of your system.Assignments: 1. 10. types in your system and their relationships. other classifiers like interfaces. 7. Draw activity diagrams to display either business flows or like flow charts. 3. Draw state machine to model the behavior of a single object. 2. Draw one or more Package diagram to organize and manage your large and complex systems as well as their complex models. Draw basic class diagrams to identity and describe key concepts like classes. Draw sequence diagrams OR communication diagrams with advanced notation for'your system to show objects and their message exchanges. . Use case diagrams must include template showing description and steps of the Use Case for various scenarios. Draw component diagrams assuming that you will build your system reusing existing components along with a few new ones. 4. specifying the sequence of events that an object goes through during its lifetime in response to events. Draw one or more Use Case diagrams for capturing and representing requirements of the system. Choose a hypothetical system of significant complexity and write an SRS for the same. 6. 9. Draw advanced class diagrams to depict advanced relationships.

suspend it using wait system call and transfer it into the zombie state. state 6. Shell Programming and AWK Programming with suitable application and use of advanced filters. . PART II: Assignments related to Operating Systems 1. Provide the details of all conflicting entries in the parser table generated by LEX and YACC and how they have been resolved-Syntax Directed Translation I. 4. 3. if.410446 Computer Laboratory-l Teaching Scheme Practical: 4 hrs/week Examination Scheme Practical: 50 Marks Term work: 50 Marks Objectives • • To learn and use compiler writing tools. open. Laboratory Project 1. Assignment to understand basic syntax of LEX specifications. To understand and implement algorithms used by an operating system PART I: Assignments related to Compilers LEX 1. Implement a lexical analyzer for a subset of C using LEX Implementation should support Error handling. Implement an Alarm clock application using signals 7.Server communication using following IPC mechanism 1. write a compiler using LEX and YACC. Simultaneous execution of two threads 8. Client . For a small subset of C with essential programming constructs. Write a code to store the identifiers from the input in a symbol table and also to record other relevant information about the identifiers. 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 & insert a module in Linux Kernel generator concept. Named pipe 3. (To be carried out in a group of 4 to 6 students). Using fork system call creates child process. built-in functions and Variables 2. Write an ambiguous CFG to recognize an infix expression and implement a parser that recognizes the infix expression using YACC. Unnamed pipe 2. Seek. AWK Report Generation. Assignment to understand basic syntax of YACC specifications. "for". Write an attributed translation grammar to recognize declarations of simple variables. YACC 1. assignment. built-in functions and Variables 2. Semaphore 5. File management using low level file access system calls such as write. Study of UNIX Commands 2. Display all records stored in the symbol table.

"The UNIX Programming Environment" Prentice Hall India. 6. 5/e. Richard Stevens. Finding shortest path for multistage graph problem. Daniel P. "UNIX Network Programming". Marco Cesati. A complete LC branch and bound algorithm for job sequencing with dead lines problem.. (b) Branch & Bound approach. ISBN: 81-265-0484-6 4. ISBN: 007-052489-7 PART ID: Design And Analysis Of Algorithms Laboratory Minimum 6 assignments based on the following topics. ISBN: 0-596-00213-0 . OBST/Flow Shop Scheduling as an example of dynamic programming. . 8.) 5.*. Simulation/ Implementation of any Parallel Algorithms. Time complexity measure is to be obtained. Richard Stones. Rob Pike. 3/e. Peterson. 0/1 knapsack's problem using Dynamic Programming. Use fixed tuple size formulation. 2/e Volume 2. Bovet.. Kernighan.. Neil Matthew. 7. W. Prentice Hall India. Linux". 9. Tata McGraw Hill.. (single source shortest path and all pairs shortest path. "The Complete Reference. ISBN: 81-203-0499-3 2. 8-Queen problem/ Graph coloring problem : general backtracking method and recursive back tracking method and their comparison for space and time complexity. Algorithm implementation for 'Traveling salesman' problem using (a) Dynamic programming approach. 2/e. 3. Second Edition". 2.Reference Books: 1. 5. Backtracking and Branch & Bound Strategies. Richard L. WROX Publication. Quick Sort/ Merge Sort implementations using divide and conquer approach. Minimal spanning Trees/ Job scheduling as an example of Greedy approach 4. Brian W. "Beginning Linux Programming". 10. Recursive and iterative (non recursive) algorithm for specific problem and their complexity measures (comparison expected). ISBN: 81-203-2062-X 3. (At least 1 assignment must be performed on each of the strategies mentioned in the theory syllabus) 1. "Understanding the Linux Kernel.

Parallel database architecture. web search engines. data reduction UNITY : Data Mining Introduction to data mining. Bayesian classifiers. descriptive and predictive data mining. Querying XML data . Dimensional data modeling. XML DTD's. anthologies. Operations on cubes. I/O parallelism. UNIT IV: Data Warehousing Introduction to Data warehousing. Introduction to text rnh. UNIT VI : Information Retrieval Information retrieval .decision tree.SOAP XML . UNTT I:-Parallel databases Introduction. homonyms. Domain specific DTD's . Business logic . Data preprocessing need for preprocessing. data cleaning. Homogeneous and Heterogeneous Databases. fact constellation. measuring retrieval effectiveness .k means algorithm. architecture. / Week Theory : 100 Marks Practical: 2 Hrs / Week Term Work : 50 Mark Oral: 50 Mark Duration : 3 Hrs. Design of parallel systems UNIT II : Distributed Databases Introduction. snowflake schemas. Distributed data storage. association rules . Objectives : • To learn and understand advances in Database System Implementations • To learn and understand various database architectures and applications. Information retrieval and structured data.mg. classification . Indexing of documents. Distributed query processing. Directory systems UNIT II : Web based systems Overview of client server architecture. Relevance ranking using terms and hyperlinks. Availability. Distributed transactions. Databases and web architecture. . DDBMS architectures. Concurrency control in distributed databases. OLAP and data cubes. synonyms. data integration and transformation.overview .410445 Advanced Databases Teaching Scheme : Lecturers : 4 Hrs. Inter-query and Intra-query parallelism. clustering . Introduction to machine learning.star. N-tier architecture.Introduction. .apriori algorithm. outlier analysis. Commit protocols. Inter-operational and Intra-operational parallelism.

4th Edition. Raghu Ramkrishnan. 3. Database systems : "Design implementation and management". DB2 Text Books: 1. "Database system concepts'*. Sudarshan. Abraham Silberschatz. 4. Jiawei nan. "Database Management Systems". 5* Edition .List of assignments 1. multivalued attributes. Micheline Kamber. 2. Second Edition. Johannes Gehrke.address book using LDAP Web based system using ASP / JSP Building cubes and OLAP analysis 5. Case Study a) any one from open source (eg: Postgres SQL »My SQL) b) Any one from Oracle. SQL Server. ORDBMS — Implement system using composite. Thomson Learning Press 2. "Data Mining: Concepts and systems'*. McGraw Hill International Edition . McGraw Hill International Edition 2. Data mining algorithms 6. Reference Books 1. Henry Korth. S. Morgan Kaufmann publishers . inheritance Directory systems . Rob Coronel.

I. Conceptual dependency. Inference Rules in Prepositional Logic. History.: 2 Mrs/Week Term Work : 25 Marks Oral: 50 Marks Duration: 3 Mrs Objectives: • To understand the concepts of Artificial intelligence • To learn and Understand the knowledge representation techniques for knowledgebase • To learn and Understand the fundamentals of Neural Network UNIT IIntroduction Definition. A. Properties of internal representation Futures of A. A. Forward and Backward chaining rules 8 Hrs UNITII: Heuristic search techniques. Frames. Knowledge representation using Predicate logic : Predicate Calculus. Alpha beta cutoffs. semantic net. Logic Programming. & Medicine)..I? Foundation of A. Application (E Commerce. Prepositional Logic. What is A. statistical and probabilistic reasoning. intelligent Agents. Script. Heuristic search. mean and end analysis. Best first search. Production System. Frame notation .I. and Issue in design of search Programs Logic Programming Introduction. 10 Hrs . Game playing Minmax search procedure. Secondary search. Constraint Satisfaction. Knowledge representation Paradigrams. Forward and Backward reasoning . waiting for Quiescence. fuzzy logic. UNIT III: Knowledge Representation Basic of Knowledge representation. A* and AO* Algorithm. Resolution . Predicate and arguments.I. Natural Dedication Knowledge representation using non monotonic logic: TMS (Truth maintenance system).410445 Artificial Intelligence Teaching Scheme lectures :4 Mrs/Week Theory :100 Marks Practical. Hill Climbing. 7 Hrs. Agent Architecture. Representation.I. Logic. ISA hierarchy. structure knowledge representation.

Stuart Russell & Peter Nerving : "Artificial Intelligence : A Modern Approach". Non linear planning with goal stacks. Kishen Mehrotra. Robot Architecture 8 Hrs UNIT VI: Neural Networks: Introduction to neural networks and perception-qualitative Analysis. Direct instruction Analogy. 3.' Herbert A. Implement 8 puzzle problem using A* algorithm • • 2. Syntactic Processing . Expert system: Utilization and functionality. 4. Dreamtech Publication Laboratory work: Assignment based on: 1." 3. Implementation of Unification Algorithm. 3. Simon. ATN. 2. Drew Mcdermott: "Introduction to artificial intelligence. 7 Hrs UNIT V: Advance Al Topics Natural Language Processing Introduction. Action. Prentice Hall. Implementation using goal stack. 1990." 'Reference Book 1. Charniak. two case studies on expert systems. Parsing Method Implementation using Prolog. Development of mini expert system using Prolog / Expert System Shell " Vidwan" Designed By NCST Mumbai. "The Sciences of the Artificial ". least commitment strategy. Discourse & Pragmatic Processing. Implementation of Min/MAX search procedure for game Playing 6. knowledge representation. Eugene. 7. Eiaine Rich and Kerin Knight: "Artificial Intelligence. RTN. Steps in NLP ." 2. Hierarchical planning. K Mohan. MITTress. Perception : Perception. Deduction) Planning: Block world. Implement AO* algorithm for tower of Hanoi .1995. Induction. Semantic analysis. Neural net architecture and applications. "Artificial Neural Network. . Implementation of Truth maintenance system using prolog 5. architecture of expert system.UNITIV: Learning: What is Learning? Types of Learning (Rote. 3rd Edition (2nd Printing). 4. Tim Jones "Artificial Intelligence Application Programming" M. 2nd Edition Addison Wesley. strips. . Ivan Bratko : "Prolog Programming For Artificial Intelligence" . 8 Hrs Text Books 1. 2nd Edition. Sanjay Rawika.

Sampling. Statistical . Satellite Imagery. Thickening And Pruning. Elements Of Digital Geometry. Topological Attributes. Orthogonal Transform. Fuzzy Sets And Properties UNIT II: Image Formation And Digitization Geometric Model. Image Properties. Sharpening Image Restoration -. Spatial Features Recognition : Deterministic. Digitization. Water Marking . Loss-Less Compression UNITIV : Segmentation : Region Extraction. Application Of Image Processing. Objective: • Introducing The Concept Of Image In Digital Form • Analysis Of Digitized Images. Homoraorphic Filtering.Fuzzy UNIT V : Color image processing and Morphology Color Models. Vector Algebra. Texture Based.Contrast Intensification.Staff should frame any six assignments on above topics. Photometric Model. Image Compressing . Edge Detection : Preventive Operators. Stereography. Medical Images Capture And Processing. Representation. Binary Morphology -Dilation. Corrosion Thinning. Smoothening. Singular Value Decomposition.Square Error Restoration Techniques. • Processing And Restoration Of Images UNIT I : Introduction Scenes And Images. Thresholding . Histogram Analysis . UNIT III Image Processing Image Enhancement . Pseudo coloring And Color Displays. Edge Filtering Masks Feature Extraction : Representation. Geometric Attributes. 410445 Image Processing Teaching Scheme Lectures: 4 Hours / Week Theory: 100 Marks Practical: 2 Hours / Week T/W: 25 Marks Oral: 50 Marks Duration: 3 Hrs. Spatial Interpolation. Image Processing System ( Hardware. Gray Level Morphology UNIT VI : Application Of Image Processing Image Processing in Multimedia.Basic .Loss Compression. Software).

D. Mini Project: Instructor can give captured image from any of the application area and a group of students will be assigned a set of IP operations to analyze and extract all the features of the given image The results (output) may be viewed and compared using any standard package.R. The instructor will frame at least one assignment on each of the areas specified above. . Develop C / C-H. smoothening using filtering masks 3. PHI . ISBN-9-814-12620-9 2.code to create a simple image and save the same as bitmap image in . "Digital Image Processing". ISBN . R. Oral examination will be based on the term work submitted.bmp file. Implement gray scale thresholding to blur an image5. 5th Reprint ISBN-81-203-1618-5 2. sharing. R. John Willey & Sons Inc. Develop C/C++ code to implement image compression (any one algorithm) 4. "Digital Image Processing And Analysis". The journal will contain minimum 5 assignments and a mini project. Gonzalez.C. Woods.Datta Mujumdar. . Anil Jain. Using derivative filtering technique implement an algorithm for edge detection and further thinning the edge 6. Anil Jain PHI. 2. "Fundamentals Of Digital Image Processing". William Pratt. Develop C / C++ code to perform basic image enhancement operations like. B.Text Books: 1. ISBN-81-2030929-4 Image Processing Lab Assignments for Image Processing 1. "Digital Image Processing Person Education ".817808-629-8 Reference: 1. Chanda.: Students will submit the term work in the form of journal.

overview of multimedia software tools. Image compression : Types of compression: lossy & loss less. VOC. fractal compression technique. SGML. Goals and objectives. AVO. Color image processing. Multimedia architecture: User interfaces: GTK+. interframe correlation. Audio file formats: WAV. UNIT I: Introduction: What is multimedia. transform coding. amplifiers. multimedia Document Architecture (MHEG. streaming technologies. Shannon. multimedia applications. speakers. AIFF. storage processing. hardware • support. Image data types. MFC. multimedia and internet. text file formats: TXT. MIDI. Lossy : Vector quantization. OMF etc 06 hours UNIT II Image Processing: Basic Image fundamentals. Windows multimedia support. RTF. PS. Qt. MPEG-I. multimedia database systems. Hybrid: JPEG-DCT 10 Hours UNIT III Multimedia Audio: Nature of sound waves. JPEG. ODA. and display. AVI. DOC. WMA. Loss less: RLE. 06 Marks UNIT IV: Text : Types of text. Multimedia building blocks.410445 Multimedia Systems Teaching Scheme Lectures: 4 Mrs/Week Practical: 2 Mrs/Week Examination Scheme Theory: 100 marks Term Work: 25 Marks Oral: 50 Marks Duration : 3 Hrs. LZ & LZW. digital audio. CD formats. BMP. Multimedia authoring tools. intraframe & interframe Hybrid. etc). psycho-analysis. PDF. MPEG-HI. psycho-acoustic. symmetrical & asymmetrical. PCX . MPEGIV. Spatial filtering. • Learn to design multimedia projects independently. Communication. Video: .Text compression: Huffman coading. TIFF. elements of audio systems: Microphone. MPEG-II. Arithmetic coding. characteristics of multimedia presentation. synthesizer. Image enhancement: Enhancement by point processing. characteristics of sound waves. Image acquisition. Learning Objectives: • Learn key concepts of Multimedia Systems. distributed multimedia applications. image file formats (GIF. RMF.Fano algorithm.

Video signal formats. Creating animation. Rotoscoping & bluescreening. masking . VR devices: Hand Gloves. Marks S. RealVideo. video recording systems: VHS. Head mounted tracking system. types of animation. morphing. Judith Jeffcoate "Multimedia in Practice": PH. 5. H-26I. cinepack. VCR. DVD-video. DVCAN. EDTV. Ralf Steinmetz and Klara Nahrstedt "Multimedia Computing. principles of animation. ISBN 0-07-058833-3 2. Motion Cycling. Pearson Education. Communication and Applications". Video transmission standards. VR chair. Video Compact Cassette. micro-MV. Virtual Objects -Basics of VRML. Gonzalez. References: • -. VR applications. animation on the web. 6. nerodigital. Nigel Chapman and Jenny Chapman. 05 hours Text Book 1. Wiley "Digital Multimedia" 3. Mark Nelson "Data Compression Book ". 3D Sound system. "Digital Image Processing" Addison Wesley.TMH. 05 hours UNIT VI Animation: Uses of animation. • 1. PHI 4. CCD. VCD. Flip Book animation . K. "Principles of Multimedia". H-263. Head mounted display. Drew. SIF. Lesser disc. Ranjan Parekh. Camcorder. Video r^ formats: MOV. "Fundamentals of Multimedia". digitization of video. CCER. CIF. 3D animation. Woods. BPB. Norms of VR. . 2. color cycling. HDTV. Jain "Fundamentals of Digital Image Processing". A. Ze-Nian Li. techniques of animation: Onion Skinning. DVD formats 08 Hours UNIT V: Virtual Reality and Multimedia: Concept. Pearson Education. video editing.

Multimedia systems Lab Assignments: 1. Garden Model 5. Edit .VOC file and convert it to . Write a tool to create presentation slide with audio & video effects 4.DCT compression Technique . 1. Using VRML generate any one virtual scene.WAV file format b) Create. Implement JPEG-.WAV file and convert it to . 2.VOC file format. Write a program to develop animated clip 3. Edit . 7. Write a menu Driven program a) Create. . Implement arithmetic coding technique on any image. Implement Edge Detection Algorithm on any Image 6. Coffee House 2. Building Model 3.

platform choice. Every group member must take part in the presentation. literature survey. SRS (System Requirement Specification) Document in specific format and high-level design document at the end of term-J.410447 Project Work Teaching Scheme Practical: 2 Hours/Week Term Work: 150 Marks Oral: 50 Marks Objectives: I) To allow the students to select a project in the area of Computer Engineering or Information Technology of his/her choice. 3) The pair of examiners will go through the preliminary report prepared by the group and observe the presentation prepared by them. 2) The project work will be assessed by internal examiner (preferably the guide) having four or more years of experience and an external examiner from other college having five or more years of experience. Term I Teaching Scheme Practical: 2 Hours/Week Examination Scheme Term Work: 50 Marks 1) A preliminary project report consisting of a problem definition. . The examiners can ask some questions based on report and presentation to judge the understanding of the topic of every group member and will award the marks according to their performance. The group will select a project with the approval pf project coordinator /guide and submit the name of the project ‘with synopsis of not more than 2 to 3 pages not later than the second week of July in the academic year. The project will be undertaken preferably by a group of maximum 4 students and minimum 3 students who will jointly work and implement the project. study the feasibility of it and plan the project properly for two terms of the year.

Test cases and test results generated by available testing tool. User Interface design. They will ensure that every member has contributed in the project work. appendix (if necessary). 3) The pair of examiners will go through the project report prepared by the group and observe the presentation prepared by them. conclusions.Term II Teaching Scheme Practical: 6 Hours/Week Term Work: 100 Marks Oral: 50 Marks 1) A project report consisting of a preliminary report prepared in term-I. glossary. detailed design (all necessary UML diagrams) document. 4) The pair o£ examiners will conduct a oral examination based on the project work they have undertaken during the entire academic year. 2) The project work will be assessed by internal examiner (preferably the guide) and an external examiner from the industry having five or more years of experience. . tools used and references at the end of term-II.

.

Hash algorithms. AH. key distribution. integrity. WEP. use of Bioinformatics in security. attacks. access control. web security considerations. Koreros.509. Trojans. Elliptical curve Cryptography. tunneling and tunneling protocols. RSA. PPTP. DSA. PEM and S/MIME. attributes of security. Honey pot. types. application security using smart cards. OS hardening. PGP smart cards. IDEA. E-cache. application level gateways. authentication. attacks UNIT-IV: Virtual Private Network Need. X.410448 Networks And Information Security Teaching Scheme: 4 Mrs/Week Theory: 100 Marks Practical: 2Hrs/Week Term Work: 25 Marks Oral: 50 Marks Duration: 3 Hrs. DNS poisoning. Types of attacks. . VLAN. viruses. packet filters. IP spoofing. SET. message authentication and hash functions. firewalls. L2TP. UNIT V:Network Periphery Security Router and security. IKE. triple DES. UNITII : Public Key Cryptography Principles. diffie-helleman. micro payments. UNIT I : Introduction Need of security. VPN supported systems. UNIT VI: Web And Email Security Security services. wireless LAN. confidentiality. electronic commerce attacks. key management. authorization. AES. attack. non-reproduction and cryptography. unsmart cards. layers. multilevel model of security. Vulnerabilities in OSI model. types of VPN. IPS. SSL and TLS. DMZ. Koreros. ECC. key exchange. Worms. Information security lifecycle. one time fem. passwords. DOS. ESP. I-PSEC protocol Suite. UNIT III: Secret Key Cryptography DES. man-in-the-middle. and digital signatures. single sign on. replay.

Stephen northcatt. William Stallings "Cryptography and network security. Radia Perlman and mike speciner "Network security. principles and practices". Robert Bragge. Christopher M« King.the complete reference". private communication in a public world" 2.Pearson Reference Books: 1. Mark Rhodes. 3. et al "INSIDE NETWORK Perimeter Security" Pearson Education Asia. 4. Heith straggberg "Network Security . Tata McGraw Hill Publication . design deployment and operations".Text Books: I. leny zeltser. Curtis patton and RSA press "Security architecture. Charlie Kaufman.

out of order execution. Inter Processor communication network. vectorizers and optimizers. Constraints of conventional architecture. Inter PE Communication. UNIT IV: Multiprocessor Architecture Loosely and Tightly coupled multiprocessors. Predicated execution. Vector performance modeling. Evolution of parallel processors.410449 Advanced Computer Architecture and Computing Teaching Scheme Theory: 4 Hrs/Week Examination Scheme Theory: 100 Marks Duration: 3 Hours UNIT I: Overview of Parallel Processing and Pipelining Processing Necessity of high performance. Case study of Intel Itanium Processor Principles of scalable performance : Performance Metrics and Measures. Job sequencing and Collision. VLIW (Very Long Instruction Word) processor. software scheduling. Case study: Cray Arch. cube hyper cube and Mesh Interconnection network. Chip Multiprocessing (CMP). Register Stack Engine. Issues in Vector Processing. Case Study of IBM Power4 Processor Inter Processor Communication and Synchronization . Cow’s and NOW's Cluster and Network of Work Stations). Pipelining hazards and resolving techniques. Time shared bus. 6 Hrs UNIT II Pipeline Architecture Principles and implementation of Pipelining. Architectural Classification. Classification of pipelining processors. Ultra SPARC • • 8 Hrs UNIT III: Vector and Array Processor Basic vector architecture. Explicitly Parallel Instruction Computing (EPIC) Architecture. Memory contention and arbitration techniques. Data buffering techniques. Processor characteristics of multiprocessors. Cache coherency and bus snooping. Advanced pipelining techniques.Pentium. FFT 8 Hrs. Software pipelining. Parallel Algorithms For Array Processors: Matrix Multiplication. General pipelining reservation table. future trends. Case study: Super scalar Architecture. Parallelism in uniprocessor system. Crossbar switch. Design aspect of Arithmetic and Instruction pipelining. loop unrolling techniques. Instruction level Parallelism and Thread Level Parallelism. Static Vs Dynamic network. Applications of parallel processing. trace scheduling. Sorting. Interconnection networks of SIMD. Massively Parallel Processors (MPP). Multiport Memory Model. Speedup Performance Laws. SIMD Computer Organization Masking and Data network mechanism. Speculative loading.

http://www. Text Books 1. Issues and solutions. High performance computer Architecture . http://www. 5. Message Passing Interfaces (MPI).intel. Harrold Stone. Kai Hwang. Kai Hwang. L Sivaram Murthy. Scalable Parallel Computing . CCC etc. V. For IBM Power 4 Processor a. 3.com/servers/eserver/pseries/hardware/whitepapers/power/ppc_ar ch. Occam. Shared Memory Programming. performance of parallel algorithms b) Operating systems for multiprocessors systems.html . UNIT V: Multithreaded Architecture Multithreaded processors. Latency hiding techniques. Tata McGraw-Hill References: 1. Advanced Computer Architecture 6. Kai Hwang. "Advanced Computer Architecture".com/products/processor (for Intel Itanium Processor) 7. Threads (in shared memory system) c) Parallel Programming Languages : Fortan 90. Briggs. Introduction to Neuro Computing and Grid Computing : 8 Hrs. Richard Y. William Stallings. PHI. Synchronous and asynchronous message passing . "Computer Architecture and Parallel Processing" McGrawHill international Edition 2. Sixth edition. Parallel Programming Techniques ". Message passing libraries for parallel programming interface. Message passing program development. Data Parallel Programming 7 Hrs.Rajaraman.8 Hrs. 2. Message passing parallel programming. Principles of multithreading. Designing for performance" Prentice Hall. 4. "Computer Organization and Architecture. d) Issues towards aluster computing. "Parallel Computers". Kain. classification of parallel algorithms. UNITVI: Parallel Software Issues a) Parallel algorithms for multiprocessors. PVM (in distributed memory system).ibm. C-Linda. Faye A.

Applying Framework. Types of structural measures. Static analysis tools. UNIT III Software Measurement Programs and Principles of Testing: What is a metric plan?. Structural Testing. Defect repository and Test Design. Scenario testing. Compatibility Testing. UNIT I: Principles of Measurement: Representation Theory of Measurement. Code Complexity testing. Difficulties with general complexity measures. Objectives: • To introduce Software Measurement concepts • To introduce Software Testing Process • To emphasis on Software Testing strategies • To introduce Software Quality management principles & metrics. Equivalence Partitioning. Execution and Reporting. functionality. Regression testing. control-flow structures. Positive and negative testing. Software Test Automation. Integration testing. Developer/Tester support for Defect Repository Test Case Design I [White-Box]: Test Adequacy criteria. Management. Measurement and models. liability and Accessibility Testing. User Documentation Testing. reuse. Classification of Software Measures. Modularity and information flow attributes. Determining what to measure.410450 Software Testing And Quality Assurance Teaching Scheme: 04 HrsTweek Theory: 100 Marks Duration: 3 Mrs. Measurement in Large systems. Measurement tools. State-based or Graphbased Testing. Halstead's Software Science. . Static testing by humans. System and Acceptance testing. length. How to Store and Extract data. GUI testing. UNIT II: Internal Product attributes Measurement Size. Validation testing. Defect Classes. Aspects of software size. Mutation Testing Test Case Design II [Black-Box]: Test case Design Criteria.' Software Measurement Validation. Requirement based testing. Object-oriented metrics. Planning Formal Experiments. Data structure. Four principles of Investigation. How to define/collect data. What is a good data. Ad hoc Testing. Measurement in small. Boundary Value analysis. Domain Testing UNITIV: Software testing: Test plan. Specification-based testing. complexity : Structure. Goal-Question-Metric model. Measurement Scales. Performance Testing. Defects: Origins of Defects.

Software Quality Assurance. In process Quality Metrics. Categorizing and Identifying problem. Challenges and Best Practices. Pearson Education. Ramesh. Preparing and Testing Shipment unit . Edward Deming's principles. Tata McGraw Hill. Software maintenance. Pearson Education. Fenton. "Software Testing : Principles and Practices". " Software Metrics. Stephen H. Scatter diagrams. ISO 9000. Desikan. Control chart. ISBN 81 -7758-121-X 3. Problem Resolution: Overview of Problem Resolution. Composing Fixes. Bhattiprolu. Making the Fix and Testing it. Fix Distribution: Overview of Fix Distribution. Springer International Edition. Run Charts. Defects reported by Internal Customers. Pareto diagrams. Fleeter. " Software Maintenance". ISBN 818128-089-X . Malcolm Baldn'dge Assessment.UNIT V: Software Quality metrics and tools: Quality concepts. IsMkawa's 7 basic tools. Cause Effect diagram. ISBN 981 -240-3 85-X 2. Defect Removal Effectiveness & Process Maturity Level. UNIT VI: Software Maintenance: Problem Reporting: Customer side Preliminary activities. Challenges and Best Practices. Thomson. Logistics and Tooling. Text Books: 1. "Practical Software Testing". Kan. A Rigorous and Practical Approach". Histogram. ISBN 81-297-0175-8 Reference Books: 1. Six Sigma principles. Choosing method of Fix Distribution. Checklists. "Metrics & Models in Software Quality Engineering". Ramesh. ISBN 0-07048345-0 2. Product Quality Metrics. Total Quality Management. Burnstein.

2. Text Books: 1. Distributed Transaction. Fundamental Models. X 500 DS UNIT IV: Synchronization Time and Global States: Clock Synchronization. characteristics. and Comparisons. Pradeep K. Name Services. hardware and software concepts. resource sharing and the web. Remote Method Invocation. UNITH: Communication Inter process Communication: Message oriented Communication. Grid and Clusters. Distributed File Systems Distributed File Systems: SUN NFS. Global Name Service. Architectural Model. UNIT VI: Case Studies :Case Studies on CORBA.Concepts and Design" Publisher: Pearson(LPE) Reference Book: 1. Case Studies: DNS Directory. goals. CODA. Locating Mobile Entities. Distributed Objects: RFC & LRPC. Jean DoIIimore & Tim Kindberg. and global state. Theory: 100 Marks. design issues. and Client Server Models. Reliable group communication. Removing unredeemed entities. Other DS. mutual exclusion. Name Entities. Andrew S. George Coulouris.410451 Distributed Systems Teaching scheme: 4 Mrs/ Week. UNIT V: Fault Tolerance Process Resilience. "Distributed Systems . Co-ordination: Election Algorithms. Events and Notifications. 25 Marks Oral : 50 Marks Duration: 3 Hrs UNITI: Introduction Introduction to distributed Systems. Logical clocks. Sinha "Distributed Operating Systems Concepts and Design" Publication: PHI. Tanenbaum & Maarten van Steen. challenges. Transport Level and Higher-level Protocols. Stream Oriented Communication Layered Protocols: Lower Level. Reliable client server communication. Practical : 2 Mrs/Week Term work. Distributed Commit and Recovery. examples of distributed systems. .Distributed Systems "Principles and Paradigms" Publisher: PHI. System Models: Introduction.

Active X controls. Entity.NET Remoting. Java Applets. Hardcover 2. Rick Kaaran. Session. "Beginning J2EE 1 . Kevin Mukhar. Facade. lunknown. Adaptor. Introduction to Java EE. Proxy. Introduction to Java EE technologies like JMS. Event Listener. Paperback 4. Application servers. Server side technologies JSP.02004 3. Factory. Second Edition . UNIT I: Architecture Business Cycle. Documenting software architectures. UNIT IV: Types of Middleware. . Paul Clements. UNIT V Introduction to three tier and N-Tier Web Architectures. Java Servlets. Objectives • Introduction to Software architecture as a discipline • Introduction to current architecture approaches Introduction to software Architecture strategies. . Lsn Bass. Client side technologies DHTML. why is software architecture Important. JSF. achieving quality attributes. Dale Rogers on. ISBN: \M7120459-5.0 Architecture. JXTA. Iterator. Introduction tc . Observer. JDBC. EJB 3. Mediator. DLL Servers. ''Software Architecture in Practice". Message beans.NET architecture.NET assemblies. . Braude.4: From Novice to Professional . Eric J. Weaver. What is software architecture. James L. JAX-WS. XML. Study of a number of representative patterns like Singleton. UNIT VI: Components. Pipes And Filter. architecture and quality attributes.410451 Software Architecture Teaching Scheme : Theory : 4 Hours /Week Examination Scheme: Theory: 100 Marks Term Work: 25 Marks Oral: 50 Marks Duration: 3 Hrs. Interfaces. UNIT II: Understanding quality attributes. UNIT III: Design Patterns: history. "Software Design: From Programming 10 Architecture”. Ways of using patterns. "Inside Com (Microsoft Programming Series) ". principles and expectations.NET Web Services 1.

with UML Submit a IDL definition for a few components and interlaces from above system 3. 3. 2. Assignment: Part A: Design Patterns 1. Implement an ITERATOR or OBSERVER pattern in language of your choice and submit it along with a write-up with its specification. References. • Explore various design Patterns and learn to implement them • Explore some representative architectural styles • Understand how to design and partly implement Client Server systems using components and web services • Implement and study some MIDDLEWARE based clients and components in LAN and WEB world. The specification must include Problem/ Issue. Discussion/ Consequences/ Implementation. Part B : Architectural 1 . Explore' and Implement one of the Advanced J2EE technology Java RMI OR JAVA SOCKETS (with concurrency and threads) OR: JAVA based XML processing 5. Audience/ Context. Implement the pipes and filters architectural style 3. Interfaces. Implement a sample EJB based application. Example Instances. APIs. reaper ?e lime. Related Patterns. Implement any one other pattern in language of your choice and submit it along with a write-up with its specification.a representative paper design of a hypo. Forces. . its deployment issue. Implement Keyword in context KWIC problem using any one architectyral style 4. transaction management and other quality attributes FART C : Middleware aid Web services 1 .Software Architecture Lab Objectives: • Understand various non-functional requirements that lead to need for good Architecture and good Design. • Explore implementations of some of the underlying technologies of distributed client server applications Faculty can set assignments based on Microsoft AND / OR Java world AND /OR Open source based languages. Solution.Ethical system using components. platforms. Study and submit a report for any of the MVC based Frameworks 2. Study any Four patterns and SUBMIT a design pattern specification for two patterns in a standard format along with their UML diagrams.bility. scah. Implement COM 4.. Study a case study of any website or any other large system and its architecture for iault tolerance. performance. Middleware.

PART D: Web Environment 1. Do server side programming using either CGI scripts or ASP/JSP with database handling and components on server side with security aspects covered. Client side caching. Applets or Active X controls. . Develop dynamic and interactive web clients with use for some of the technologies listed here DHTML. XML. Scripting. 2.

RTOS Task Scheduling models. Assemble lang. Memory Map Of Embedded System DMA . Modifiers. Real Time Clock and Timers.Opto Isolator . Application Specific System Processor. UNIT I: Introduction to Embedded System Components of Embedded System & it's Classification. Exemplary ARM Processor. C Program Compliers & Cross Compliers. OS functions & tasks for resource management Embedded Linux. Introduction to embedded processor. Structural Units of Processor. ISR. C program Elements. serial communication using I C. Statements. High Level Lang. UNIT IH: I/O interfacing: I/O devices. Strategy for synchronization between the processes . Clocking Unit.410451 Embedded System Teaching Scheme: Theory : 4 Hours /Week Theory: 100 Marks Practical: 2 Mrs / Week Term Work : 25 Mark Oral: 50 Mark Duration: 3 Mrs. ADC / DAC . OS security issue. Timers & counting devices. CAN .Evaluation Board Concept. Reset Circuitry and Watchdog Timer. Mobile OS. Micros & Function. Relay & stepper motor . internals : Linux Kernel for device drivers & embedded system . Queues & Stacks. UNITY: Real Time Operating Systems Real Time & embedded System Os. Multiple Task. CISC and RISC Processor architectures and exemplary instruction set. List & Order List. Os & Embedded System model UNITJV: Programming concepts. threads & routines . UNITII: System Hardware: ( Management of Power Supply . AYR AT9052313. Interfacing Processors. Characteristic of embedded system. Data structures. RS232. Interrupt Latency & Response time. RTOS . Embedded System Programming In C++ & Java. Multiprocessor systems using General Purpose Processor. Embedded System Programming C & C++ : Software development cycle. Example architecture of Mototrala-68HC/08. In circuit emulator.. Data types. Interrupt Routines in RTOS environment. Optical Devices such as LED / LCD Display devices . Review of Microprocessors & Micro controllers. Loops & Pointers. Memories and I/O. & USB Device drivers & interrupt servicing inter process communication & synchronization Multiple Processes. Digital Signal Processor. Processor and Memory Selection.

Case study coding for send application layer byte streams on A TCP/IP Network Using RTOS Vex works. "Microcontrollers . Prasad. of readable . Tammy Nergaard "Embedded Systems Architecture .Controlling Hardware & Software 2. Case study in Embedded system for Smart Card.use Multi Threading for message Que or Shared Memory 10. 8."Embedded Real time Systems Programming". Write a program to control an Application RTL Linux. process running as Linux Process & ctb= as RTL Linux Process 11. Prasad "Embedded / real time System : Concepts. Raj Kamal . used ui Process control system 7. Write a C Program Which Generates Packets of 32 Bits . K. Using Microcontroller development Board. Write a program that demonstrates multithreading in RTL Linux. V.UNIT VI: Programming Tools and Applications of Embedded Systems: Case Study of coding for Vending machine system using MUCOSRTOS. Case study of an embedded System for an adapting Cruise control System in a car. Rajkamal. First bit of packet indicates whether the packet is control packet or data packet 4. K. Develop an Embedded system that takes Analog voice signal as input & converts it into digital format & send this data to PC. . Text Books 1. K. Ltd. K. which can be. Dr. 1. 3. Write a C Program that takes string input from keyboard & Displays the Length of string . 9. Design. One. Develop 8 Channel Data Acquisition System to Acquire Date from 8 Channel. & Programming -Black Book" Dreamtech Press Publication 3. Sriram lyer . Write a program to control the relay. Elesevier Publication Embedded System Lab . Verma "Programming for Embedded system " Wiley -Dreamtech India Pvt. Using Microcontroller development Board Develop the software which read input from the switches 5.A Comprehensive Guide For Engineering & Programming". 1. V. Interface & System Design" Pearson Education 2. K. 3. Reference Book: . Pankaj Gupta. Develop the software for serial communication 6. Tata Me Graw Hill. . "Embedded System Architecture Programming Design" Tata Graw Hii! Publication 2. 12. writable & executable files in specified Directory. Perform Any 10 Experiments from the following list: . Study of Evaluation Board . Write a Shell Script that display the no. Gupta Dass. Convert it into Digital Format & transmit to PC . . Dr.. Architecture. Programming . Write a program that demonstrates the communication between two Processes. K.

Protocol architecture etc).BECN and CLLM) UNIT III: Broadband ISDN (B-ISDN): Driving forces and need. Congestion Control frame Work.LAPF protocol (Both Core and Contro!). Frame Mode call control).ISDN Data Link layer (LAPD protocol. basic call control using Q. Cell Delineation etc).ATM Adoption layer (need. Classical IP over ATM.Network Design using Gigabit Ethernet a case study .Gigabit Ethernet Physical layer (lOOOBase X and lOOOBase T). B-ISDN standards and services. Frame relay Protocols and services ( protocol architecture. B-ISDN Transmission structure. Frame Relay Congestion control. Conceptual overview of Signaling System Number 7 Frame Relay: Frame relay Vs X. ISDN Interfaces and functions (transmission structure. terminal adoption. U-N Configuration. and DE bit. Need. Network use of CIR. B-ISDN protocol architecture.25. 120 ). Congestion Notification (FECN. Virtual Channels and Virtual Path Switching.931) ISDN services. 1.25 • Concepts of OS1 model and Local area Network UNIT I: Gigabit Ethernet: Business Drivers and need of it. different types and comparison). Gigabit Ethernet Media Access Control (Half Duplex operation Vs Full Duplex Operation). UNIT II: Integrated Services Digital Network: Conceptual view of ISDN and ISDN standards. Ethernet summery Migration from lOMbps to Gigabit Ethemet.410451 High Performance Networks Teaching Scheme: Theory: 4 Mrs/week Theory : 100 Marks Practical: 2 Mrs/week Term Work: 25 Marks Oral: 50 Marks Duration: 3 Hrs. ATM QOS parameters. B-ISDN Functional Architecture. Detail Functionality of ATM Layer( Cell structure . ATM service categories . Prerequisite: • Conceptual knowledge of Digital transmission and line coding • Communication networks (Circuit switching and packet Switching) • Conceptual overview of X.Applications of Gigabit Ethernet. ATM protocol architecture.ISDN Network layer (Overview. HEC.465/v.ATM in LAN environment (LANE) .Concept of DLCI and its significance. Architecture and Overview of Gigabit Ethernet.ATM traffic descriptors. SONET/SDH and comparison with other available standards ATM: Overview.ATM traffic and Congestion control Requirements.

Industrial visit to understand the market scenario (typically ISP site would help) . Sumit kasera and Pankaj Sethi . RSVP. "ISDN and Broadband ISDN with Frame Relay and ATM" 4th edition (Pearson Education) • 2. Deployment Case study. Rich Seifert . Architecture. Implementation of ISDN ( U-N interface.UNIT IV: ADSL and DSL Technologies: Background and technological capabilities. Market status and future UNTTV: MPLS&RSVP: MPLS. Frame relay service availability .) Reference Books: s 1."ATM Networks Concepts and protocols" Tata McGraw Hill Publication. Comparative study of different technologies 5. William Stallings. Integrated & differential Services UNTTVI: WiFi&WiMax Text Books: 1. Costing etc."Gigabit Ethernet"( Addison Wesley Inc.) 3. 2.A user's perspective 4. 1. Conceptual overview of VDSL. Standards and associations. High Performance Networks Lab Laboratory Assignments. Router configuration. Case studies of implementation of Gigabit Ethernet including the components . costings etc.

Test Oracle for the System under test. Write a program to detect a Remote Firewall. State chart Diagrams for target system (System Under Construction) demonstrating Static and Dynamic behavior of the system. Implementation of Rijndael algorithm using 64-bit key. • Will this pose a problem in any way? • If so. Narrate necessary supporting documentation. Assignment 1: Prepare System Requirement Specification. ! 8. Now suppose p is not a prime but rather the product of two primes pi and p2. Use gpg to verify the signature on this assignment. Sequence Diagrams. Use Case Diagrams. Install a Proxy server and configure an application Gateway. likelihood of incidents. Test Procedures. Write a program to find an IP address of a remote system. Implementation of MD5 hashing technique. Configure and study a Intrusion detection system (IDS). Indicating the traced Independent data paths. Prepare control flow graphs for the unit under test. Install. 7. Implementation of email security using PGP/GPG( create yourself a 1024-bit gpg key. 5. The Test case Scenarios should correspond to the relevant Use case Scenario. Control paths and Error handling paths. Assignment 2: Implement the System under construction and narrate Test Plan for the same. Prepare Class Diagram demonstrating System Design. Design an experiment to estimate the amount of time to • Generate key pair (RSA) • Encrypt n bit message (RSA) : • Decrypt n bit message (RSA) As-function of key size. and a disaster plan. 2. Record the Test criteria and Test conditions along with Test results.) 10. 3.) 6. The first in generating encrypt/decrypt keys in RSA is to generate two prime numbers p and q. Experiment withjdifTerent n-bit messages. vulnerabilities. . Compute the Cyclamate complexity of the unit. possible counter measures/controls. 4. Implementation of Diffie-hellman algorithm. ' 9.410452 Computer Laboratory -II Teaching Scheme: Practical :4 Mrs/Week Term Work :25 Marks Practical: 50 Marks PART I: Network And Information Security 1. 11. Identify Test cases. Summarize your conclusion. Use your name and email address for your key label. Test log. how/why and how often? PART II: Software Testing & Quality Assurance Objectives: • To introduce Software Testing Process • To emphasis on Software Testing strategies. Assignment 3: Perform Unit testing especial. Perform a risk assessment of your personal computer (Assume that you have been using your computer to write your throughput: You'll need to identify assets.

Note: The instructor is required to frame five assignments covering ail the details as mentioned above at suitable length with relevant use of case tools. Specify Usage patterns of the system and indicate it using Run charts / Histograms. Perform Regression Testing / GUI Testing of the System under construction.Assignment 4: Perform Black box Testing for all the units contained in the architectural segments. . Assignment 5: Prepare System Usage Specification outline.

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

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

Cancel anytime.