SEM 6 Computer Engg Detailed Syllabus

 

B.E. COMPUTER ENGINEERING – VI SEM

 

 

System Programming

Operating System

Web Technology

Object Oriented Analysis & Design

Advance Database

Computer Graphics

SUBJECT: SYSTEMS PROGRAMMING

 

Lectures : 3 Hrs per week                                                     Theory: 100 Marks

Practical: 2 Hrs per week                                                      Term Work: 25 Marks

                                                                                                Oral Examination: 25 Marks

 

 

Objectives of the course: This course is an introduction to the design and implementation various types of system software. It is intended that the student should be able to design working assembler, loader and macro-processor on completion of this course.

 

Pre-requisites: Course in computer organization, data structures and C/C+

 

DETAILED SYLLABUS

 

1. Language Processors:

Fundamental of Language Processing and Language Specification. Classification of programming Langauge Grammars. Static and Dynamic Binding. Language Processor Development Tools.

 

1. System Software And Machine Architecture.:

Introduction to Systems Programs. Introduction to Data Formats. Registers and Addressing Modes for Traditional CISC Machines and RISC Machines.

 

1. Assemblers:

Basic Assembler Functions. Assembler Algorithm and Data Structures. Design of Single Pass Assembler. Design of Multi-pass Assemblers. Implementation Examples. MASM Assemblers and SPARC Assembler.

 

1. Macros And Macro Processors:

Macros Definition and Expansion. Conditional Macro Expansion. Macro Parameter. Re-cursive Macro Expansion. Nested Macro Calls. Design of Macro Preprocessors. Implementation Examples: MASM Macro processor, ANSI C Macro Languages.

 

1. Loaders And Linkers:

Basic Loader Functions. Design of an Absolute Loader. Relocation and Linking Concept Linkage Editors. Dynamic Linking. Bootstrap Loaders. Design of a Linker. Implementation Example. A Linker for MS-DOS.

 

1. Scanning And Parsing:

Introduction to Regular Expressions and Finite State Automata. Optimization of DFP, Based Pattern Matchers. Top-down and Bottom-up Parsing Technique. Recursive Descent Parisian LL (1) Parsing LALR Parsing and Operator Precedence Parsing. LEX and YACC Syntax Directed Translation.

 

1. Compilers And Interpreters

Aspects of Compilation. Memory Allocation: Run time storage organization. Static, Dynamics Heap Storage and Garbage Compaction. Phases of Complain: Lexical Analysis. Syntax Analysis: Intermediate Code Generation, Machine Independent and Machine Independent Code Optimization. Compilation of Expressions and Control structures. Interpreters. Java: Compiler and Environment.YACC Compiler-Compiler.

 

1. Software Tools:

Software Tools for Program Development Editors. Debug Monitors Programming Environments. User Interfaces.

 

Text Books:

1. D.M.Dhamdhere “Systems Programming And Operating Systems: TMH 2^nd ED. 2002.

2. Leland L. Beck, ‘Systems Software”, Addison Wesley.

3. A.V.Aho, Ravi Sethi & J.D. Utlman, “Compilers Principles and Techniques’, Pearson Education.

 

References:

J.Donovan, “Systems Programming, “ TMH

 

TERM WORKS

Term work should involve:

1. Course projects on Assembler implementation, Design of compiler for simple language constructs.

2. Implementation of simple parsers.

3. Implementation of a simple loader.

 

 

OPERATING SYSTEMS WITH UNIX

 

Lectures: 3 Hrs per week                                                                  Theory: 100 Marks

Practical: 2 Hrs per week                                                                  Term work: 25 Marks

                                                                                                            Oral Examination: 25 Marks

 

1. Operating System Overview

Operating System Objectives and functions. The history and evolution of operating System Characteristecs of Modem Operating System : Window 2002 Overview Traditional UNIX Systems: Modern UNIX Systems.

Basic Concepts. Precesses, Files: system calls, Shel, Layered Structure vs monolithic structures of O.S.

 

1. Processes:

Process Model, Process state, Process Description Process Control, PCB creation of process, context switching exit processes UNIX SV RH Process Management .

Threads, SMP Processes and Threads, Symmetric Multiprocessing: Windows 2000 Threads and SMP management, Linux Process and Thread management.

 

 

1. Process Scheduling:

Objectives, preemptive vs non-premptive scheduling, Multiprocessor Scheduling Realtime Scheduling Linux Scheduling Unix SVR4 Scheduling Window 2000 Scheduling comparative assessment of different scheduling algorithms.

Concurrency Mutual and Synchronization Principles of Concurrency mutual Exclusion Software Exclusion Approaches Mutual Exclusion Hardware Support Semaphores Monitors Message Passing readers/Writers Problesm.

Concurrency. Deadlock and Starvation: Principles of Deadlock; Deadlock; Deadlock Prevention. Deadlock Avoidance; Deadlock Detection; An integrated Deadlock Strategy; Dining Philosophers Problem; UNIX Concurrency Mechanisms; ‘Window 2000 Concurrency Mechanism.

 

1. Memory

Memory Management Requirements. Memory Partitioning; ‘Virtual memory; Paging Segmentation; Design and implementation issues in paging and segmentation: Page replacement algorithms; page fault handling: working set model; UNIX and Linux Memory Management; Window 2000 Memory Management;

 

1. I/O Management and Risk Scheduling.

I/O Devices. Organization of the I/O Function; Operating System Design Issues;I/O Buffering Disk Scheduling; RAID; Disk Cache; UNIX SVR4I/O Window 2000 I/O:

 

1. File Management.

Overview: File Organization; File Directorites; File Sharing; Record Blocking: Secondary Storage Management: UNIX File Mangement.’ Windows 2000 File System.

 

 

1. Case Studies:

Unix Internal representation files system calls for the files systems, Implemenation of processes, process scheduling memory management policies Window NT, Layered structure, interprebility.

 

Text Books

 

1. William stallings, “Operating Systems”

2. Sibershatz, A.Peterson, J.Galvin, “Operating System Concepts, “ Addison Wesley

3. Maurice J.Bach, “The Design of the Unix Operating System”.

 

References:

1. Tannenbaum, “Modern Operating Systems”, Second Edition.

2. Milan Milenkovic, “Operating Systems”, Mc Graw Hill.

3. “Tannenbaum A” Operating Systems: Desing and Implementation”, Prentice Hall

 

Term Work:

Term works shall consist of at least 9 programs based on the above topics. It should also Include Small routines, Small routines, involving implementation of small utilities in shell programs that would give good exposure to Unix system calls for process control, memory management and management.

Test must be conducted with a weightage of 10 Marks.

 

WEB TECHNOLOGY

 

Lectures: 3 Hrs per week                                                                  Theory: 100 Marks

Practical: 2 Hrs per week                                                                  Term work: 25 Marks

                                                                                                            Oral Examination: 25 Marks

 

Objectives of the course: The objective of the course is to provide an understanding of technology used for building WEB. This course gives knowledge right from building of web in thanking business on Web. It also gives a comprehensive coverage of HTML, JavaScript, CGI/Java Servlets, ASP for Building Secure E-commerce applications.

 

DETAILED SYLLABUS

 

1. Introduction:

Introduction to WEB Technology: TCP/IP, Protocols, Telnet Electronic Mail (Email) File Transfer Protocol (FTP) World Wide Domain Name System (DNS).Uniforms Resource Locator (URL).

 

1. HTML:

Introduction to Hypertext Markup Language, Tags, Anchors, Backgrounds, Images Web Page structure, Hyper liking Lists, Charter Formatting, Color Control, Images, Tables, Frames Multimedia, Cascading style sheet, Application with layers.

 

1. Dynamic Web Pages:

HTML/DHTML: Introduction to DHTML, Forms, Client-side Forms, Java Scripts, Incorporating JavaScript in HTML, JavaScript expressions, Control flow and functions, String and Arraya javaScripts objects. JavaScripts Forms, Cookies, History Location, XML CGI Scripting with

 

1. Active Server Page & Servlets:

ASP Objects: Application Request, Resonse, Server, Session, Forms, Query Strings, Cookies, Connectivity with database, Using Active X Objects, JSP, Java Servlets.

 

1. Applications:

Electronics Commerce: An Introduction, Types, Solutions, e-shop, Online Pament, Internet Banking.

 

Text Books:

1. Kriss Jamsa, Konrad King, “HTML & Web Design”, TMH

2. Achyul Godbole, “Web Technologies”, TMH.

 

References:

1. Box, “Essential XML”, Pearson Education.

2. David Whiteley, “E-Commerce”, TMH

3. Douglas E Comer, “Internetworking with TCP/IP”, Volume I. Pearson education.

4. Steven Holzner, “HTML Black Book”, Dreamtech.

5. Vivek Sharma, Rajiv Sharma, “Developing e-commerce site”, Pearson Education.

6. Microsoft commerce Solutions, Web technology PHI.

7. Jason Hunter & William Crawford”, Java Servlet Programming”, O RELY

8. Tom Negrino and Dori Smith” JavaScript for The World Wide Web”, Third Edition Eduction.

 

TERM WORK

1. At least 10 programs based on above syllabus.

2. Build an e-commerce site.

3. Study of ISP, Instalation of WEB Server.

4. A test must be conducted with a weightage of 10 Marks.

 

OBJECT ORIENTED ANALYSIS & DESIGN

 

Lectures: 3 Hrs per week                                                                  Theory: 100 Marks

Practical: 2 Hrs per week                                                                  Term work: 25 Marks

                                                                                                Practical Examination: 25 Marks

 

DETAILD SYLLABUS

 

1. Introduction

Overview Of OOL Object Classes: Meta Types. Object Oriented Methodologies. The Unfied Approach Modeling: Why Modeling? Static And Dynamic Models: Functions Models.

 

1. Object Modeling

Object Links. Association, Inheritance. Grouping Constructs: problems on Objects Modeling Advantages Of Object Modeling.

 

1. Analysis:

Problem Analysis Problem Domain Classes Identify Classes: And Objects Of Real World Problems. Using Use Case Analysis; Recording Analysis

 

1. Basic Object Modeling:

Multiplicity. Constraints. Aggregation Component.

 

1. Sequence Diagram:

Modeling Scenarios. Mapping Events To Object. Interfaces. Discovering Attributes Modeling Simple Collaboration Modeling. Logical Database Schema. Activity Diagram Modeling Workflow.

 

1. Class Diagram:

Test Scenarios. Interfaces. Classes Methods. Stress Testing System Testing. Scalability Testing. Regression Testing behavioral Modeling State Chart Diagram.

 

1. Design Classes:

Architectural Design, Refining The Model. Refactoring. Coupling And Cohesion. Who Should Own The Attribute? Who Should Own The Operations? Process and Threads.

 

1. Design Classes:

Classes Visibility: User Interface. Subsystem Interface.

 

1. Deponent Diagram

Modeling Source Codes. Physical Database.

 

1. Deployment Diagram:

Modeling In A C/S System. Distributed System And Embedded Systems.

 

TOPICS FOR EXPERIMENT

Use any UML/OOAD tool and do the following

1. Use case diagram

2. Sequencediagram

3. Collaborating Diagram

4. Activity Diagram

5. Use case realization

6. Class Diagram

7. Testing, Debugging Porting

8. Component Diagram

9. Change Management Using Make/SCCS Utility

 

Text Books:

1. Ali Bahrami, “Object oriented System Development”, McGraw Hill.

2. Grady Bock. J.Rambaugh IVAR Jaconson, “The UML Users Guide”, Pearson Ducation

3. J.Rambaugh of al, “Object Oriented Modeling and Design.”

4. Andrew Haigh, “Object Oriented Analysis and Design”, Tata Mcgraw Hill

 

References:

1. Simon Benett, Steve Mc Robb, Ray Farmer, “Object Oriented System Analysis and Design Using UML” McGraw Hill.

2. Timoothy C. Lethbridge, Robert Laganiere, “Object Oriented software Engineering”, McGraw Hill.

3. Stephen R. Schach, “Object Oriented and Classical Software Engineering”, TMH

 

Term Work

1. Term work should consist of at least 8 experiments covering all the topics.

2. A terms work test must be conducted with a weightage of 10 marks.

 

ADVANCE DATA BASES

 

Lectures: 3 Hrs per week                                                                  Theory: 100 Marks

Practical: 2 Hrs per week                                                                  Term Work: 25 Marks

                                                                                                Practical Examination: 25 Marks

 

Objectives of the course: To study the further database techniques beyond which covered in second year and thus to acquaint the students with some relatively advanced issued. At the end of the course students should be able to gan an awareness of the basic issue in objected oriented data models, learn about the Web-DBMS integration technology and data mining techniques and other advanced topics. Apply the knowledge acquired to solve simple problems.

 

Pre-requisites: A basic course in “Database Systems” and knowledge of OOAD.

 

DETAILED SYLLABUS

 

1. The Expended Entity Relationship Model and Object Model:

The ER model revised, Motivation for complex data types. User Defined Abstract Data Types And Structured Types, Subclasses, Super Classes , Inheritance. Specialization and Generalization, Constraints ana Characteristics of Specilization and Generalization Relationship Types of Degree higher Than Two.

 

1. Object-Oriented Databases:

Overview of Object-Oriented Concepts, object Identity, Object Structure, and Type Constructors, Encapsulation of Operations, Method and Persistence. Type Hierarchies and Inheritance, Type Extends and Queries, Complex Objects: Database Schema Design for OODBMS, OOL Persistent Programming Languages. OODBMS Architecture and storage Issues, Transactions and Concurrency Control.

 

1. Object Relational and Extended Relational Databases:

Database Design for An OROBMS – Nested Relations and Collections: Storage And Access methods, Ouery processing and Optimization: An overview of SQL3, Implementation Issues for Extended Type; Systems. Comparison of RDBMS OOD BMS. ORDBMS

 

1. Parallel and Distributed Databases and Client-Server Architecture:

Architecture for Parallel Databases Query Evalution, Parallelizing Individual Operations, Sorting joints Distributed Database Concepts, Data Fragmentation, Replication and Allocation techniques for Distributed Database Design. Query Processing in distributed Databases, Concurrency Control and Recovery in Distributed Database An Overview of Client Server Architecture.

 

1. Database on the Web and Semi Structured Data

Web Interface to the Web Overview of XML Structure of XML Data Document Schema Querying XML Data XML Applications, The Semi structured Data Model Implementation Issue Indexes for Text Data.

 

1. Data Warehousing and data Mining:

Introduction To Data Warehousing. Star Schemas Multidimensional Data Model and OLAP Introduction To Data Mining: Applications of Data Warehousing and Data Mining.

 

1. Advanced data Models for Advanced Applications.

Active Database Concepts. Temporal Database Concepts., spatial Databases, Concepts and architecture, Deductive Databases and Query Processing Mobile Database Geographics Information Systems.

 

Text Books

1. Elmasri and Navathe, “Fundamentals Database Systems”, 4^th Edition Pearson Education

2. Raghu Ramakrishnan, Johnnes Gehrke, “Database Management Systems”, Second Edition McGraw Hill

 

References:

1. Perter Rob and Coronel, “Database systems, Dign Implementation and Management Fifth Edition Thomson Learning.

2. G.J.Data Longman, “Introduction To database Systems”, 7^th Edition Adison Wesley

 

Term Work

1. The term work should include 6 small projects that would cover the different data models deal with in the subject.

2. Two Assingment on current topics should also be included.

3. A terms Work test must be conducted with a weightage of 10 Marks.

 

COMPUTER GRAPHICS

 

Lectures: 3 Hrs per week                                                                  Theory: 100 Marks

Practical: 2 Hrs per week                                                                  Term Work: 25 Marks

                                                                                                Practical Examination : 25 Marks

 

Pre-requisites: Knowledge of C Language is needed

 

DETAILED SYLLABUS

 

1. Introduction:

Application Areas, Input and Output Devices, Video Display Devices: Refresh CRT Raste Scan display, color CRT monitor, Flat panel display, Co-ordinate representation

 

1. Basic Raster Graphics Alogrithm for drawing 2-D Primitives:

Output Characteristics: Aspect ration Alising and anti-alising Line Drawing Algorithms: DDA alrithm Bresenham algorithm Circle Generation Algertithm Midpoint circle algorithms Ellipse Generation Algorithm: Mid Point Ellipse algorithms Area Filling: Scan line polygon filling algorithm: Inside-outside test, Boundary fill algorithm Flood-fill algorithm.                            

 

1. 2-D Geometric Transformation:

Window and Viewport Window and Viewport relationship World co-ordinaties Normalise device co-ordinates and homogenous co-ordinates. Basic Transformation : Transtatics Rotation and scalling Other Transformation: Reflection and Shear Composite Transfermation.

 

1. 2-D Viewing and Cliping:

Window to Viewport Co-ordinate Tranformation Clipping Point clipping, Line Cohen Sutherland algorithm Liang Barsky clipping Mid-point Subdivision. Polygon : Suthe and Hodgman algorithm.

 

1. D-D Concepts:

3-D Display Method Parallel and Prespective projections Depth Cueing 3-D Transformation Basic Transformations : translation, rotation and scaling other Transmission reflection and shear Composite Transformation 3-D Viewing and Clippping.

 

1. Hidden Surface Elimination Method:

Backface Detection Depth or Z-buffer Method, Scan Line Method Area Subdivision Method.

 

1. Curves:

Spline Representation Bezier Curves, B-Spline.

 

1. Light Shading:

Illumination Model Shading Constant Intensity shading Gouraud shading Phong Shading Haftoning Ray Tracing.

 

Text Books:

1. Donald Hearn and M. Pauline Baker. “Computer Graphics with C Version”, Second Edition pearson Education.

2. Newman and Sproll Principles of Interactive Computer Graphics”, Second Edition

 

References:

1. Rogers and Adams “ Mathematical Elements for Computer Graphics”, TMH

2. Xlang and Plastok, “Schaum’s Outlines Computer Graphics”, Second Edition, TMH

3. Harrington, “Computer Graphics”, McGraw Hill.

4. Rogers, “Procedural Elements for Computer Graphics”, TMH.

 

Term Works

1. Terms Work should consist of at least 10 practical experiments Covering all the topics of the syllabus.

2. A terms work test must be conducted with a weightage of 10 marks.