Term I Subject Code
Subject Teaching Scheme Lect. Pract

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


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


04 04 — — 18

410445 410446 410447


— — 50


500 100

Term II
Subject Code Subject

Teaching Scheme Lect.
Pract 02

Examination Scheme Th 100 100

Mark Or — 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


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Implement gray scale thresholding to blur an image5. ISBN-81-2030929-4 Image Processing Lab Assignments for Image Processing 1.817808-629-8 Reference: 1. Develop C/C++ code to implement image compression (any one algorithm) 4.R. 5th Reprint ISBN-81-203-1618-5 2. . "Fundamentals Of Digital Image Processing". B. Anil Jain PHI. The journal will contain minimum 5 assignments and a mini project. D.bmp file. Oral examination will be based on the term work submitted. sharing. "Digital Image Processing Person Education ". Anil Jain. "Digital Image Processing And Analysis".C. William Pratt. 2. PHI . ISBN . Develop C / C-H. Develop C / C++ code to perform basic image enhancement operations like. Woods. R. ISBN-9-814-12620-9 2. John Willey & Sons Inc. Using derivative filtering technique implement an algorithm for edge detection and further thinning the edge 6.: Students will submit the term work in the form of journal. "Digital Image Processing". smoothening using filtering masks 3. Gonzalez.Datta Mujumdar.Text Books: 1. . Chanda. The instructor will frame at least one assignment on each of the areas specified above.code to create a simple image and save the same as bitmap image in . 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.

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

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

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

Every group member must take part in the presentation. 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. 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. SRS (System Requirement Specification) Document in specific format and high-level design document at the end of term-J. literature survey. study the feasibility of it and plan the project properly for two terms of the year. 3) The pair of examiners will go through the preliminary report prepared by the group and observe the presentation prepared by them.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. platform choice. . 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. 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.

Test cases and test results generated by available testing tool. glossary. appendix (if necessary). User Interface design.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. conclusions. 4) The pair o£ examiners will conduct a oral examination based on the project work they have undertaken during the entire academic year. . detailed design (all necessary UML diagrams) document. tools used and references at the end of term-II. 3) The pair of examiners will go through the project report prepared by the group and observe the presentation prepared by them. They will ensure that every member has contributed in the project work. 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.


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

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

Memory contention and arbitration techniques. Multiport Memory Model. Architectural Classification. Data buffering techniques. future trends. SIMD Computer Organization Masking and Data network mechanism. Speculative loading. Parallel Algorithms For Array Processors: Matrix Multiplication. Instruction level Parallelism and Thread Level Parallelism. loop unrolling techniques. VLIW (Very Long Instruction Word) processor. trace scheduling. Sorting.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. General pipelining reservation table. Issues in Vector Processing. Classification of pipelining processors. Time shared bus. cube hyper cube and Mesh Interconnection network. Inter Processor communication network. Predicated execution. Constraints of conventional architecture. out of order execution. vectorizers and optimizers. Register Stack Engine. Crossbar switch. UNIT IV: Multiprocessor Architecture Loosely and Tightly coupled multiprocessors. Vector performance modeling. Pipelining hazards and resolving techniques. software scheduling. Processor characteristics of multiprocessors. Case study: Cray Arch. Software pipelining. Cache coherency and bus . Job sequencing and Collision. Static Vs Dynamic network. Case study: Super scalar Architecture. Parallelism in uniprocessor system. Case study of Intel Itanium Processor Principles of scalable performance : Performance Metrics and Measures. Speedup Performance Laws. Ultra SPARC • • 8 Hrs UNIT III: Vector and Array Processor Basic vector architecture. Explicitly Parallel Instruction Computing (EPIC) Architecture.Pentium. Advanced pipelining techniques. Design aspect of Arithmetic and Instruction pipelining. Interconnection networks of SIMD. FFT 8 Hrs. Inter PE Communication. Evolution of parallel processors. Applications of parallel processing. 6 Hrs UNIT II Pipeline Architecture Principles and implementation of Pipelining.

"Computer Architecture and Parallel Processing" McGrawHill international Edition 2. Sixth edition. http://www. Synchronous and asynchronous message passing ch. UNIT V: Multithreaded Architecture Multithreaded processors. Harrold Stone. Chip Multiprocessing (CMP). performance of parallel algorithms b) Operating systems for multiprocessors systems. 2. Faye A. Cow’s and NOW's Cluster and Network of Work Stations). Richard Y. Message passing parallel programming. classification of parallel algorithms. Shared Memory (for Intel Itanium Processor) 7. Kain. "Advanced Computer Architecture".html . Kai Hwang. Issues and solutions. 3. Text Books 1. Message Passing Interfaces (MPI). CCC etc. For IBM Power 4 Processor a.snooping. Designing for performance" Prentice Hall. Kai Hwang. 4. Data Parallel Programming 7 Hrs. Briggs. Principles of multithreading. Case Study of IBM Power4 Processor Inter Processor Communication and Synchronization 8 Hrs. High performance computer Architecture . Parallel Programming Techniques ". Threads (in shared memory system) c) Parallel Programming Languages : Fortan 90. Message passing program development. Introduction to Neuro Computing and Grid Computing : 8 Hrs. C-Linda. "Parallel Computers".ibm. V. PVM (in distributed memory system). Massively Parallel Processors (MPP). PHI. d) Issues towards aluster computing. UNITVI: Parallel Software Issues a) Parallel algorithms for multiprocessors. William Stallings. Kai Hwang. Occam. Tata McGraw-Hill References: 1. Message passing libraries for parallel programming interface. 5. "Computer Organization and Architecture. http://www. Latency hiding techniques. Scalable Parallel Computing . Advanced Computer Architecture L Sivaram Murthy.

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

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

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

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

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

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

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

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

UNIT II: Integrated Services Digital Network: Conceptual view of ISDN and ISDN standards.ATM traffic and Congestion control . Frame Relay Congestion control. Congestion Control frame Work. Gigabit Ethernet Media Access Control (Half Duplex operation Vs Full Duplex Operation).ISDN Network layer (Overview. Congestion Notification (FECN.LAPF protocol (Both Core and Contro!). Virtual Channels and Virtual Path Switching.Concept of DLCI and its significance. 1. Architecture and Overview of Gigabit Ethernet.Network Design using Gigabit Ethernet a case study .25.465/v. Frame Mode call control). SONET/SDH and comparison with other available standards ATM: Overview.931) ISDN services. B-ISDN Transmission structure. different types and comparison). and DE bit. Prerequisite: • Conceptual knowledge of Digital transmission and line coding • Communication networks (Circuit switching and packet Switching) • Conceptual overview of X.25 • Concepts of OS1 model and Local area Network UNIT I: Gigabit Ethernet: Business Drivers and need of it.ISDN Data Link layer (LAPD protocol. Write a program to control an Application RTL Linux. ISDN Interfaces and functions (transmission structure. Frame relay Protocols and services ( protocol architecture.ATM Adoption layer (need. terminal adoption. Network use of CIR. Detail Functionality of ATM Layer( Cell structure . HEC. B-ISDN Functional Architecture. Protocol architecture etc).BECN and CLLM) UNIT III: Broadband ISDN (B-ISDN): Driving forces and need.Applications of Gigabit Ethernet. Need. B-ISDN standards and services. basic call control using Q.Gigabit Ethernet Physical layer (lOOOBase X and lOOOBase T). Conceptual overview of Signaling System Number 7 Frame Relay: Frame relay Vs X. Ethernet summery Migration from lOMbps to Gigabit Ethemet. 120 ).12. 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. Cell Delineation etc). B-ISDN protocol architecture. ATM protocol architecture. U-N Configuration.

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

) 6. ! 8. possible counter measures/controls. Implementation of email security using PGP/GPG( create yourself a 1024-bit gpg key. Experiment withjdifTerent n-bit messages. Prepare Class Diagram demonstrating System Design. how/why and how often? PART II: Software Testing & Quality Assurance Objectives: • To introduce Software Testing Process • To emphasis on Software Testing strategies. Implementation of Diffie-hellman algorithm. likelihood of incidents. Use gpg to verify the signature on this assignment. 3. and a disaster plan. 2. 4. Summarize your conclusion. 11. Configure and study a Intrusion detection system (IDS). The first in generating encrypt/decrypt keys in RSA is to generate two prime numbers p and q. Sequence Diagrams. Install a Proxy server and configure an application Gateway.) 10. Write a program to detect a Remote Firewall. ' 9. Write a program to find an IP address of a remote system. 5.410452 Computer Laboratory -II Teaching Scheme: Practical :4 Mrs/Week Term Work :25 Marks Practical: 50 Marks PART I: Network And Information Security 1. State chart Diagrams for target system (System Under Construction) demonstrating Static and Dynamic behavior of the system. • Will this pose a problem in any way? • If so. 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. Now suppose p is not a prime but rather the product of two primes pi and p2. . 7. Install. Use your name and email address for your key label. Implementation of Rijndael algorithm using 64-bit key. Assignment 1: Prepare System Requirement Specification. Implementation of MD5 hashing technique. 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. Narrate necessary supporting documentation. vulnerabilities. Use Case Diagrams.

Compute the Cyclamate complexity of the unit. Test log. Prepare control flow graphs for the unit under test. Indicating the traced Independent data paths. . Assignment 5: Prepare System Usage Specification outline. Test Procedures. Specify Usage patterns of the system and indicate it using Run charts / Histograms. Record the Test criteria and Test conditions along with Test results. Test Oracle for the System under test. The Test case Scenarios should correspond to the relevant Use case Scenario. Assignment 3: Perform Unit testing especial. 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.Assignment 2: Implement the System under construction and narrate Test Plan for the same. Perform Regression Testing / GUI Testing of the System under construction. Control paths and Error handling paths. Identify Test cases. Assignment 4: Perform Black box Testing for all the units contained in the architectural segments.

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.