UNIVERSITY OF PUNE BE (COMPUTER ENGINEERING) - 2003 COURSE Term I Subject Code 410441 410442 410443 410444 410445 410446

410447 Subject Design & Analysis of Algorithms Operating Systems Object Oriented Modeling & Design Principles of Compiler Design Elective I Computer Laboratory I Project Work Total Teaching Scheme Lect. Pratt 04 03 03 04 04 18 02 04 02 10 02 Examination Scheme Th 100 100 100 25 - 100 100 500 25 50 50 100 50 50 Tw Pr --50 50 100 Or 100 100 175 100 175 100 50 800 Mark

Term II Subject Code 410448 410449 410450 410451 410452 410447 Subject Networks and Information Security Advanced Computer Architecture and Computing Software Testing and Quality Assurance Elective II Computer Laboratory II Project Work Total Tw: Term Work Teaching Scheme Lect. Pract 04 04 04 04 16 Pr: Practical 02 04 06 12 02 Examination Scheme Th 100 - 100 - 100 100 400 25 25 100 200 Tw Pr ----50 50 - 50 50 100 Or 100 100 100 175 75 150 700 Mark

Th: Theory

Or: Oral

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

410441 Design And Analysis of Algorithms Teaching Scheme: Theory:4 HourslWeek Examination Scheme: 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: Big O, theta and omega 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, Oil 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 Polynom:al time (NP) Decision problems, Cooks Theorem. NP-Complete problems- Statisfiability problem, vertex cover problem. NP-Hard problems-graph, scheduling, code generation problems, Simplified NP Hard Problems. 6 Hours Text Books: I. Bressard, "Fundamental of Algorithm." , PHI 2. Horowitz and Sahani, "Fundamentals of computer Algorithms", Galgotia.

References: I. Thomas H Connen and Charles E.L Leiserson, "Introduction to Algorithm" PHI 2. A. V. Aho and J.D. Ullman, "Design and Analysis of Algorithms", Addison Wesley

Changing the size of a process. write. Architecture of UNIX OS. . File Creation. Process Scheduling and Time: Process Scheduiing. Close. UNIT I : Process synchronization and inter-process communication: Background. To study the comparison of different function of different OSs. Manipulation of the process address space. Saving the context of a process. Terminal drivers. The shell. deadlocks detection. file & Record Locking. critical regions. program threats. a hybrid system with swapping and demand paging I/O Subsystem: Driver interfaces. User authentication. stat and fstat. Super Block. Prentice Examination Scheme Theory: 100 Marks Duration: 3 Hrs. Demand Paging. Conversion of a path name to an Inode. System boot and the init process. deadlock characterization. Kernel Data Structures. unlink. Change Owner and Change Mode. avoidance. read. pipes. Layout of System Memory. semaphores. OS synchronization 4 Hrs UNIT II : Deadlocks: System model. Other file types. William Stallings. lseek. mounting and unmounting file systems. link. Implementation of Access matrix. Disk drivers. Allocation of Disk Blocks. The User ID of a process. Operating System Services. Process Termination. domain of protection. Structure of the Buffer Pool. Buffer Headers. prevention. Introduction to System Concepts. Revocation of a(:cess rights Security: Security problem. Creation of Special Files. . file system maintenance 8 Hrs UNIT V : Structures of processes: Process States and Transitions. file system abstrations. Scenarios for retrieval of a Buffer. Assumptions about hardware. Change Directory and Change Root.410442 Operating Systems Teaching Scheme Lectures: 3 HrslWeek Objectives . Signals. Critical section problem. System calls for time & clock 8 Hrs UNIT VI : Memory Management Policies: Swapping. Access matrix. methods for handling deadlocks. Awaiting Process Termination. Process control: Process Creation. 5/c. The Context of a process. Intrusion detection and cryptography 6 Hrs UNIT III : System Architecture. Inode assignment to a new file. Sleep. Invoking other programs. To study advanced concepts of operating systems. dup. System Calls for the file system: open. monitors. Directories. "Operating System-Intemals and Design Principles ". User perspective. Reading and Writing Disk Blocks. recovery Protection: Goals of protection. System Administration. system threats. classic problems of synchronizations. Streams 4 Hrs Text Books: 1. Structure of a regular file. securing system and facilities. Advantages and Disadvantages of the Buffer Cache 8 Hrs UNIT IV : Internal Representation of files: Inodes.

ISBN-81-203-0516. Silberschatz. Andrew S. 2nd Edition-2006 2. 2/e. Dhamdhre D. Galvin.A Concept-Based Approach".Hall India. ISBN 81-203-2063-8 . Prentice Hall India. "Operating System Concepts" 6/e . 3. Tanenbaum. Maurice J. "The design of the UNIX Operating System". John Wiley & Sons. Gagnes . Tata McGraw Hill Publications.. ISBN-81-297-0 1 094-3 2.7 . M. Prentice Hall India."Operating Systems . Bach. " Modem Operating Systems". ISBN-9971-51-388-9 Reference Books: I.

Construction. Activities. Rational Unified Process emphasizing Inception. exceptions. collaborations. Forward Engineering. Timing diagrams. sub activities. UNIT V: State Machine diagrams. The (2nd . UML 2. Classes and Relationships. Introduction to Modeling and Design of software.0 for each diagram the need. Introduce UML 2. firmware and business proc_sses. Architecture driven. commercial applications. submachine. 1. Advanced relationships generalization. AI! diagrams are to be assumed for UML 2. Activity diagrams.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 Hrs.0.0 New Features. encapsulation of states. association.CORBA .Class diagrams. Applications of UML in embedded systems. UNIT IV : Interaction diagrams. Active Objects. Concepts. regions. James Rumbaugh. Deployment diagrams. Notation. transitions. Review of 00 concepts. Grady Booch. . Elaboration. Understand the concepts being modeled in UML UNIT I : Introduction to OMG Standards: MDA. Reverse Engineering & Application must be considered. Communication diagrams. UML History. Extensibility mechanisms like stereotypes. Component diagrams. Templates. Package diagrams. States. UML MetaModel. state generalization.0. Transition Phases. tagged values. Interfaces and ports. partitions. aggregation. Objectives : . UNIT ll: Introduction to UML. exceptions. Architectural approaches: Use case Centric. signals. Iterative approach.0 and its diagrams as a modeling tool for large and comple£ systems. UNIT VI : Support for modeling Architecture in UML. MOF. . 00 Concepts Review. Text Books. 4+ 1 View architecture. dependencies. Interaction Overview diagrams including interactions. Web applications. partitions. UML 2. UNIT III : Object diagrams. Composite structure diagrams including composite structures. XMI. signals. Sequence diagrams. Ivar Jacobson "Unified Modeling Language User Edition) (Addison-Wesley Object Technology Series) (Hardcover) Reference Books : Guide". purpose. regions. OCLOverview of all diagrams in UML 2. constraints and profiles. CRCmethod.

2. (In a Nutshell (O'Reilly» Paperback) 4. Kendal Scott. 7. . Draw sequence diagrams OR communication diagrams with advanced notation for your . Michael Jesse. Joseph Schmuller "SAMS Teach yourselfUML in 24 Hours". and composite structure diagrams.0. Draw activity diagrams to display either business flows or like flow charts. document them and be able to discuss the pros and cons of your designs and models. Schardt "UML 2. Hans-Erik Eriksson. To learn concepts. Generally any UML diagram has accompanied document to explain the diagram further for example use case descriptions. 4. notes. As far as possible draw as many diagrams for one single system. The write-ups for any diagram can include small examples to cover notation that has not been refelTed to in your submitted diagram. assumptions. "UML Distilled: A Brief Guide to the Standard Object Modeling Language". To model an entire system using UML 2. The students will try and identify scope of such a system as realistically as possible. advanced notation. James A.0 diagrams for modeling different aspects of a system throughout the SDLC lifecycle . 6. non-functional requirements. Jim Arlow. Draw one or more Use Case diagrams for capturing and representing requirements of the system. the other diagrams can be drawn on paper. Draw basic class diagrams to identify and describe key concepts like classes. Draw one or more Package diagram to organize and manage your large and complex systems as well as their complex models.I. Magnus Penker. other classifiers like interfaces. Dan Pi lone.0" Object Oriented Modeling and Design Lab Objectives of the Laboratory: . good modeling practices. Martin Fowler. . Any 8 diagrams can be drawn using tool. object diagrams for your system as study assignments. To learn good design. paper based assignment or in cases relevant even in CASE TOOL.0 Basic And Advanced concepts and notation for the same: .0 . best practices in software.Addision Wesley 3. Students will learn to draw. Assignments: 1.. David Fado "UML 2 Toolkit (Paperback) " 5. Ila Neustadt "UML 2 and the Unified Process: Practical Object-Oriented Analysis and Design" (2nd Edition) (Addison-Wesley Object Technology Series) (Paperback) 6. 5. 2. Optionally one may draw Interaction overview diagrams. types in your system and their relationships. Neil Pitman "UML 2. its scope. Draw advanced class diagrams to depict advanced relationships. Apress "Fast track UML 2. 3. discuss different UML 2. To learn effective use of any CASE TOOL for UML 2. timing diagrams. To learn how to understand the requirements of a system. Brian Lyons.0 for dummies" 7. project management aspects. their concepts. complex systems with example hypothetical systems . Choose a hypothetical system of significant complexity and write an SRS for the same. firmware development today and explore UML 2. Use case diagrams must include template showing description and steps of the Use Case for various scenarios. To use UML 2. web based or embedded system for modeling. To meet above objectives teachers will help students choose a hypothetical system preferably either a commercial. scripts.0 diagrams. Third edition.0 in a Nutshell". unless they are not applicable for the chosen system in which case other systems may be chosen for specific diagrams. forward and reverse engineering aspects. To learn issues in modeling large. notation. Third Edition (Paperback) .

specifying the sequence of events that an object goes through during its lifetime in response to events. 8. Draw state machine to model the behavior of a single object. . 10. 9.system to show objects and their message exchanges. Draw deployment diagrams to model the runtime architecture of your system. Draw component diagrams assuming that you will build your system reusing existing components along with a few new ones.

back patching. byte code compilers Lexical Analysis Review of lexical analysis: alphabet. Boot strapping. LR (k). Top down-RD parser. Error detection and recovery. structures. front end and backend model. To learn and understand the design of a compiler . conditional statements. assignment statements. construction of syntax trees. Peephole optimisation. Block schematic of lexical analyser. compiler construction tools. Target machine description. Symbol Table organisation and management 6 Hour UNIT V: Code Generation: Introduction: Issues in code generation. Cross compiler. shift-Reduce: SLR.generator concept. LALR etc. Automatic construction of parsers (Y ACC). bottom-up evaluation of inherited attributes Intermediate Code Generation Intermediate languages. iterative statements. Register allocation and assignment. Lattributed definitions. Boolean expressions. Predictive parsers. procedure Call and return. why to write compiler. arrays. LL (k) parsers. LEX specification and features. Incremental compiler. Interpreter and the related issues. Storage organization and allocation strategies. static and dynamic scope. variable-length data. Code generator. for block structured and non block structured languages. using ambiguous grammars. Bottom up Parsers Operator precedence parsers. Intermediate code generation using Y ACC 10 Hours UNIT IV : Run Time Storage Organisation Source language issues. Generating code from a DAG. lexical error.410444 Principles Of Compiler Design Teaching Scheme Lectures: 4 hrslweek Objectives . access to non-local names. Basic blocks and flow graphs. compilation process in brief. To learn and use tools for construction of a compiler UNIT I: Introduction to Compiler: Translator issues. Dynamic programming. 6 Hours UNIT II : Syntax Analysis Introduction: Role of parsers. declarations. Y ACC specifications Semantic Analysis Need of semantic analysis. Automatic construction of lexical analyser (LEX). Dag representation of basic blocks. procedure parameters. nested procedures. next-use information. Activation record. Top-down translation. type checking and type conversion 10 Hours UNIT III: Syntax directed translation Syntax directed definitions. bottom-up evaluation of S-attributed definitions. token. procedure calls. . 8 Hours Unit VI : Code Optimisation Examination Scheme Theory: 100 Marks Duration: 3 Hrs . case statements.

ISBN 981 . Cooper.Introduction.7758 . Chattopadhyay. Loops in flow graphs. Techniques. 2000. Thomson Brookes/Cole (ISE).8 Reference Books l. K.694 . D. Common subexpression elimination. Global Optimisation: Control and data flow analysis. ISBN 81-2032725-X. "Compiler Design". R. . K. L. ISBN 81 . "Compilers: Principles.8147 . Computing Global Data flow information: meet over paths.369 2. Prentice-Hall of India. Data flow analysis. ISBN 81-7366062 . "Compiler Construction: Principles and Practice". "Lex & Yacc". Brown. optimisation of basic blocks. Optimising transformations: compile time evaluation. R. 2005. Morgan Kaufmann Publishers.X 4. O'Reilly. ISBN 81 .243 . dead code elimination and loop optimisation.590 . Data flow equations. Louden. Pearson Education. Torczon. Principle sources Of Optimisation. Levine. 3. Local optimisation. Classification of optimisation. Mason. live range identification 8 Hours Text Books 1.4 . strength reduction. Iterative data flow analysis: Available expressions. "Engineering a Compiler". 2003. variable propagation. A V Aho. code movement. T. and Tools". J D Ullman. Sethi. DAG based local optimisation. J.

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

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

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

address book using LDAP . Directory systems . multivalued attributes. ORDBMS . inheritance 2.List of assignments 1.Implement system using composite.

Data mining algorithms 6.3. 4th Edition. Abraham Silberschatz. DB2 Text Books : I. McGraw Hill International Edition . "Data Mining: Concepts and systems" . "Database system concepts". Database systems: "Design implementation and management". 5th Edition. MySQL ) b) Anyone from Oracle. Thomson Learning Press 2. SQL Server. Johannes Gehrke. McGraw Hill International Edition 2. Henry Korth. Second Edition. Jiawei han. Web based system using ASP I JSP 4. Case Study a) anyone from open source ( eg : Postgres SQL . Sudarshan. S. Raghu Ramkrishnan. Morgan Kaufmann publishers Reference Books I. Rob Coronel. Building cubes and OLAP analysis 5. "Database Management Systems". Micheline Kamber.

Logic Programming. Forward and Backward resoning .. Implementation using goal stack.Production System. Best first search. Resolution. Heuristic search. UNIT III : Knowledge Representation Basic of Knowledge representation.I . fuzzy logic. Representation. & Medicine). statistical and probabilist_c rea_oning. intelligent Agents. waiting for Quiescence. Direct instruction Analogy. Properties of internal representation . : 2 HrslWeek Examination Scheme Theory :100 Marks Term Work: 25 Marks Oral: 50 Marks Duration: 3 Hrs Objectives . Induction. History. A * and AO* Algorithm. A. Non linear planning with goal stacks. mean and end analysis. To Learnand Understand the fundamentals of Neural Network UNlT I: Introduction Definition. Natural Dedication Knowledge representation using non monotonic logic: TMS (Truth maintenance system). Frame notation. Knowledge representation Paradigrams. Inference Rules in Propositional Logic. Alpha beta cutoffs. strips. Constraint Satisfaction. least commitment strategy. Propositional Logic. Forward and Backward chaining rules 8 Hrs UNIT II : Heuristic search techniques. A. Frames. To understand the concepts of Artificial intelligence . Agent Architecture. ISA hierarchy. Futures of A. What is AI ? Foundation of AI. Deduction) Planning: Block world. Conceptual dependency. Knowledge representation using Predicate logic: Predicate Calculus.410445 Artificial Intelligence Teaching Scheme Lectures : 4 HrslWeek Practical. Script. 10 Hrs UNIT IV : Learning: What is Learning? Types of Learning (Rote. Hierarchical planning. Hill Climbing.I. To Learn and Understand the knowledge representation techniques for knowledgebase . Logic. structure knowledge representation. semantic net. Game playing Minmax search procedure. 7 Hrs. Secondary search. Predicate and arguments.I. Application(E Commerce. Issue in design of search Programs Logic Programming Introduction. 7 Hrs .

Eugene. 2. Herbert A. 8 Hrs UNIT VI: Neural Networks: i. knowledge representation. Chamiak. . "The Sciences of the Artificial "." Reference Book 1. Implement AO* algorithm for tower of Hanoi 3. Robot Architecture. RTN. Dreamtech Publication Laboratory work: Assignment based on: I. Drew Mcdennott: "Introduction to artificial intelligence. Prentice Hall. 1990. 4. Sanjay Rawika. Steps in NLP. Elaine Rich and Kerin Knight: "Artificial Intelligence. Expert system: Utilization and functionality. Implement 8 puzzle problem using A * algorithm 2. Implementation of Unification Algorithm. Introduction to neural networks and perception-qualitative Analysis. Tim Jones "Artificial Intelligence Application Programming" M. Development of mini expert system using _g / Expert System Shell" Vidwan" Designed By NCST Mumbai.2nd Edition Addison Wesley. A TN. architecture of expert system. ." 2. K Mohan.1998. Implementation of MinIMAX search procedure for game Playing 6.UNIT V: Advance AI Topics Natural Language Processing Introduction. Pragmatic Processing. Stuart Russell & Peter Norvig : "Artificial Intelligence: A Modem Approach". Neural net architecture and applications. Kishen Mehrotra. 2nd Edition. Semantic analysis. two case studies on expert systems. 1. 3. Perception: Perception. 7. 4." 3. "Artificial Neural Network. Implementation of Truth maintenance system using prolog 5. Staff should frame any six assignments on above topics. Ivan Bratko : "Prolog Programming For Artificial Intelligence" . 8 Hrs Text Books. Action. MIT Press. 3rd Edition ( 2nd Printing ). Syntactic Processing. Simon. Parsing Method Implementation using Prolog.

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

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

transform coding. MPEG-II. SIF. PDF. . TIFF. Multimedia architecture: User interfaces: GTK +. characteristics of multimedia presentation. multimedia database systems. amplifiers. psycho-analysis. synthesizer. storage processing. SGML. symmetrical & asymmetrical. DVDvideo. Learn key concepts of Multimedia Systems. DVCAN. Spatial filtering.410445 Multimedia Systems Teaching Scheme Lectures: 4 HrslWeek Practical. Multimedia building blocks. Learning Objectives: . distributed multimedia applications. Color image processing. H-263. image file formats (GIF. Image compression: Types of compression: lossy & lossless. Image acquisition. text file formats: TXT. Lesser disc. A va. A VI. : 2 HrslWeek Examination Scheme Theory : 1 00 marks Term Work: 25 Marks Oral: 50 Marks Duration: 3 Hrs. PS. Arithmetic coding. MPEG-IV. MPEG-I. cinepack. WMA. micro-MY. LZ & LZW. Lossy: Vector quantization. interframe correlation. Hybrid: JPEG-DCT 10 Hours UNIT III: Multimedia Audio: Nature of sound waves. digitization of video. Video file formats: MOV. video editing. Communication.Text compression: Huffman coau. MPC. RealVideo. MIDI. VOC. Lossless: RLE. BMP. PCX etc). streaming technologies.OMF etc. . CD formats. Audio file formats: W A V. multimedia applications. elements of audio systems: Microphone. CIF. Video: Video signal formats. multimedia and internet. MPEG-III. JPEG. DOC. Windows multimedia support.Fano algorithm. 06 Marks UNIT IV: Text: Types of text. hardware support. UNIT I: Introduction: What is multimedia. Shannon. Video Compact Cassette. DVD formats 08 Hours . AIFF. characteristics of sound waves. H-261. Multimedia authoring tools. video recording systems: VHS. VCD. multimedia Document Architecture (MHEG. Video transmission standards: EDTV. digital audio. Camcorder. Learn to design multimedia projects independently. nerodigital. HDTV. ODA. RMF. Image enhancement: Enhancement by point processing. and display.) 06 hours UNIT II: Digital Image Processing: Basic Image fundamentals. psycho-acoustic. fractal compression technique. Goals and objectives. Image data types. CCIR. overview of multimedia software RTF. Qt. speakers. intraframe & interframe Hybrid.


CCD. principles of animation. Jain "Fundamentals of Digital Imi!ge Processing". Implement JPEG-. "Principles of Multimedia". Head mounted tracking system.DCT compression Technique .UNIT V: Virtual Reality and Multimedia: Concept. Woods. morphing . VOC file and convert it to . Nigel Chapman and Jenny Chapman. Implement Edge Detection Algorithm on any Image 6. Building Model 3. Coffee House 2. masking. Implement arithmetic coding technique on any image. Head mounted display. types of animation. Rotoscoping & blue-screening. Pearson Education. Norms of VR. Communication and Applications".VOC file format. 6. W A V file format b) Create. Creating animation. VR chair. ISBN 0-07-058833-3 2. Garden Model 5. color cycling. K. 2. VR devices: Hand Gloves. Wiley "Digital Multimedia" 3. Mark Nelson "Data Compression Book ". Flip Book animation. Motion Cycling. Marks S. VR applications. PHI. A. animation on the web. "Digital Image Processing" Addison Wesley 5. Multimedia systems Lab Assignments: I. "Fundamentals of Multimedia". BPB. 05 hours UNIT VI: Animation: Uses of animation.W A V file and convert it to . Ranjan Parekh. PHI 4. Pearson Education. Edit. Judith Jeffcoate "Multimedia in Practice":. 3D Sound system. 2. Drew.TMH. VCR. Write a program to develop animated clip 3. References: I. Gonzalez. Write a tool to create presentation slide with audio & video effects 4. techniques of animation: Onion Skinning. Ze-Nian Li. Write a menu Driven program a) Create. Ralf Steinmetz and Klara Nahrstedt "Multimedia Computing. Using VRML generate anyone virtual scene 1. 05 hours Text Book 1. Virtual Objects Basics ofVRML. 7. 3D animation. Edit .

platform choice.410447 Project Work Teaching Scheme Practical: 2 HourslWeek Examination Scheme Term Work: 150 Marks Oral : 50 Marks Objectives: 1) To allow. SRS(System Requirement Specification) Document in specific format and high level design document at the end ofterm-I. . 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. study the feasibility of it and plan the project properly for two terms of the 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. literature survey. the students to select a project in the area of Computer Engineering or Information Technology of his/her choice. Term I Teaching Scheme Practical: 2 HourslWeek 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. Every group member must take part in the presentation. 3) The pair of examiners will go through the preliminary report prepared by the group and observe the presentation prepared by them. The group will select a project with the approval of project coordinator Iguide 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.

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

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

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

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

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

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

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

Transport Level and Higher-level Protocols. Locating Mobile Entities. Remote Method Invocation. CODA. hardware and software concepts. Global Name Service. Removing unreferenced entities. . Case Studies: DNS Directory. Events and Notifications. Architectural Model. Distributed Transaction. characteristics. Comparisons. X 500 DS UNIT IV: Synchronization Time and Global States: Clock Synchronization. global state. UNIT V: Fault Tolerance Process Resilience. Name Services: Name Entities. Reliable group communication. examples of distributed systems. mutual exclusion.410451 Distributed Systems Teaching scheme: Theory: 4 Hrsl Week. UNIT VI: Case Studies Case Studies on CORBA. Logical clocks. design issues. Reliable client server communication. and Client Server Models. Distributed Objects: RPC & LRPC. resource sharing and the web. Stream Oriented Communication Layered Protocols: Lower Level. Fundamental Models. Practical: 2 HrslWeek Examination Scheme: Theory: 100 marks Term work: 25 Marks Oral: 50 Marks Duration: 3 Hrs UNIT I: Introduction Introduction to distributed Systems. goals. Co-ordination: Election Algorithms. challenges. Other DS. UNIT II: Communication Inter process Communication: Message oriented Communication. Grid and Clusters. System Models: Introduction. UNIT III: Distributed File Systems Distributed File Systems: SUN NFS. Distributed Commit and Recovery.

Andrew S. "" 2. "Distributed Systems .Distributed Systems "Principles and Paradigms" Publisher: PHI. Pradeep K. Jean Dollimore & Tim Kindberg. George Coulouris. Tanenbaum & Maarten van Steen. .Concepts and Design" Publisher: Pearson (LPE) Reference Book: 1. . Sinha "Distributed Operating Systems Concepts and Design" Publication: PHI.Text Books: 1.

Rick Kazman. achieving quality attributes. Client side technologies DHTML. Objectives . "Inside Com (Microsoft Programming Series)"."Design Patterns: Elements of Reusable Object-Oriented Software" (Addison-Wesley Professional Computing Series) (Hardcover) . Paul Clements. Crume (Publisher) 5. UNIT III: Design Patterns: history. . Introduction to software Architecture strategies. JAX-WS. Proxy. Eric J. UNIT V: Introduction to three tier and N. Active X controls. Introduction to Software architecture as a discipline . Java Servlets.410451 Software Architecture Teaching Scheme: Theory: 4 Hours /Week Examination Scheme: Theory: 100 Marks Term Work: 25 Marks Oral : 50 Marks Duration: 3 Hrs. Dale Rogerson. "Beginning J2EE 1. .NET architecture. JXTA. JDBC. Braude. UNIT VI : Components. JSF.4: From Novice to Professional (Apress Beginner Series) (Paperback)". Iterator. . EJB 3. Session. UNIT I: Architecture Business Cycle. . "Software Design: From Programming to Architecture" . Java Applets. Introduction to Java EE technologies like JMS. Observer. XML. Introduction to . principles and expectations. Introduction to current architecture approaches. John Vlissides . Kevin Mukhar. Adaptor. Factory. Ways of using patterns. Study of a number of representative patterns like Singleton. Interfaces. Len Bass. Mediator.Tier Web Architectures. UNIT II : Understanding quality attributes. Introduction to Java EE. Weaver. lunknown. Documenting software architectures.ISBN: 0-471 20459-5. UNIT IV: Types of Middleware.@2004 3. why is software architecture important.NET Web Services Reference Books : 1. Pipes And Filter. Paperback 4. architecture and quality attributes.0 Architecture. "Software Architecture in Practice". James L. Richard Helm. Ralph Johnson. Message beans. What is software architecture. Server side technologies JSP.NET Remoting. Application servers. James P.NET assemblies. DLL Servers. Erich Gamma. Event Listener. Second Edition . Entity. Facade.Hardcover 2.


Implement an ITERATOR or OBSERVER pattern in language of your choice and a write-up with its specification. APIs. response time. platforms. Implement a sample EJB based application. scalability. Assignments Part A: Design Patterns 1. its deployment issues with UML 2. 3. Solution. Submit a IDL definition for a few components and interfaces from above system 3. performance. . 2. Implement Keyword in context KWIC problem using anyone architectyral style 4. References. Example Instances.Software Architecture Lab Objectives: -. transaction management and other quality attributes PART C: Middleware and Web services 1. Explore various design patterns and learn to implement them . Implement a representative paper design of a hypothetical system using components. Discussion/ Consequences/ Implementation. Implement the pipes and filters architectural style 3. Understand how to design and partly implement Client Server systems using components and web services . Explore and Implement one of the Advanced JEE technology Java RMI OR JAVA SOCKETS (with concurrem:y and threads) OR JA V A based XML processing 5. 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 lOR Open source based languages. Implement and study some MIDDLEWARE based clients and components in LAN and WEB world. Implement a client and set of components in C++ and COM as DLL servers OR Implement a client and set of compcpents in C++ and COM as EXE servers 4. Audience/ Context. Study any Four patterns and SUBMIT a design pattern specification for two patterns in a standard format along with their UML diagrams. The specification must include Problem! Issue. Explore some representative architectural styles . Middleware. submit it along with a write-up with its Part B : Architectural 1. Forces. Understand various non-functional requirements that lead to need for good Architecture and good Design. . . Related Patterns. . Implement anyone other pattern in language of your choice and submit it along with specification. Study a case study of any website or any other large system and its architecture for fault tolerance. Interfaces. Study and submit a report for any of the MVC based Frameworks 2.0 2.

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

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

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

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

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

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

Record the Test criteria and Test conditions along with Test results.of the unit. .

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