PART -I

Sr. Subject Teaching Hours Examination Scheme Total

No. T P Total CT T TW PR Marks
01 Microprocessor -II 4 2 6 20 100 25 25 170
02 Data Structure And 4 2 6 20 100 25 25 170
algorithms
03 Theory of computation 4 - 6 20 100 - - 145
04 Software Engineering 4 2 6 20 100 25 - 145
05 Programming in Java 4 2 6 20 100 25 25 170
06 Software Development 2 2 4 - 25 25 50
Lab-III(vb.net)
TOTAL 20 10 32 100 500 125 75 800
PART-II
01 Computer Graphics 4 2 6 20 100 25 -- 145
02 Database management 4 2 6 20 100 25 25 170
System
03 Computer Networks 4 2 6 20 100 25 - 145
04 Digital Signal & image 4 2 6 20 100 25 25 170
Processing
05 Operating System 4 2 6 20 100 25 -- 145

06 Web Development Lab 2 2 4 -- -- 25 -- 25

(ASP.NET\ JSP)
06 TOTAL 22 12 34 100 500 150 50 800

Grand Total 1600

 Microprocessor-II
Teaching Scheme: Examination Scheme:
Lectures: 04 Hours Week Theory Paper: 03 Hours 100Marks
Practical:02 Hours Week Term Work: 25 Marks
Class Test: 20 Marks

The Processors Register Organisation of 8086, Architecture, Signal descriptions of

8086, Physical Memory Organization, general Bus Operation, IO Addressing
Capabilities, Minimum mode 8086 system, maximum Mode 8086 system, The Processor
8088. (04)

8086/8088 Instruction Set and Assembler Directives:

Machine language Instruction Formats, Addressing Modes of 8086, Instruction set of
8086/8088, Assembler Directives and operators. (04)

The Art of Assembly Language Programming with 8086/8088:

Machine level programs, Machine coding the programs, Programming with an
Assembler, assembly language programs, STACK Structure of 8086 8088, Interrupts &
Service routines, Maskable & Non Maskable Interrupts, Interrupt Programming,
MACROS. (05)

Basic Peripherals & their Interfacing with 8086/8088:

Semiconductor Memory Interfacing, Dynamic RAM Interfacing, Interfacing IO Ports,
PIO 8255, Modes of operation of 8255, Interfacing Analog to Digital Converters,
Interfacing Digital to Analog Converters, Steeper Motor Interfacing. (05)

Special Purpose Programmable Peripheral Devices & their Interfacing:

Programmable Interval Timer 8253, Programmable Interrupt Controller 8259A, The
Keyboard/Display Controller 8279, Programmable Communication Interface 8251
USART. (04)

DMA, Floppy Disk & CRT Controllers:

DMA Controller 8257, DMA Transfer & Operations, Programmable DMA Interface
8237, Floppy Disk Controller 8272m, CRT Controller 8275, CRT Controller 6845.
(03)

Microcomputer Operating System:

Assembly Language Programming, BIOS & DOS Interrupt, Components of DOS, File
Allocation Table, Root Directory Area, Structure of EXE & COM Files, Device Drivers,
Layout of Device Drivers. (04)

Evolution of Microprocessors:
 Sailent Features of 80286-80287 - A Microprocessor with Memory Mangement,
Instruction set features of 80286. (02)

80386-80387 & 80486- The 32 Bit Processors:

Sailent Features of 80386DX, The CPU with a Numeric Coprocessor, 80486DX.
(02)

Introduction to Pentium Family Architecture:

Sailent Features of 80586(PENTIUM), Enhanced Instruction set of Pentium, Intel
MMX Data types, Sailent points about Multimedia Application Programming, Journey to
Pentium-Pro, Pentium-II, Pentium-III- The CPU of the next Millennium (04)

Term Work:
1) The term-work consists of al least 06 Assembly language Programs written and
complied using TASM assembler.
2) At least 03, Interfacing Programs using Microprocessor (8085& 8086) Kit
Stepping Motor Interfacing
Interfacing Analog to Digital Converters
Interfacing Digital to Analog Converters
3) Assignments based on the syllabus.

Assessment of Term-Work should be done as follows:

i) Continuous Lab Assessment (40%)
ii) Actually Performing Practicals in Laboratory (30%)
iii) Oral Examination (Internally) conducted at the time of Submission on the syllabus &
practicals performed (30%)

Text Books:

1) Ajoy Kumar Ray & Kishor M.Bhurchandi, “Advance Microprocessors &

Peripherals” (Architecture, Programming & Interfacing), Tata Mcgraw-Hill
Publishing Company Limited, New Delhi.
2) Introduction to Assembly Language Programming ,Sivarama P. dandamudi,
Publisher: Springer, ISBN: 81-8128-048-2
3) Liu Gibson, “ Microprocessor Systems: The 8086/8088 family, Architecture,
Programming & Design”. PHI.

Reference Books:

1) Douglas V. Hall, “ Microprocessor & Interfacing –Programming & Hardware”,

2nd Edition, TMH.
2) Brey, “ The Intel Microprocessors 8086/8088,80186,80286,80386,80486,
Architecture, programming, Interfacing”, PHI.
3) Allen Wyall, “Assembly Language Programming”, QUE.
4) Peter Abel, “ Assembly Language Programming”, PHI.
Websites: http://www.intel.com
 Data Structures and Algorithms

Teaching Scheme: Examination Scheme:

Lectures: 04 Hours Week Theory Paper: 03 Hours 100Marks
Practical:02 Hours Week Term Work: 25 Marks
Practical/Oral :25 Marks
Class Test: 20 Marks

Section-A

1. Introduction to Data Structures:-

- Abstract Data Types
- Classes in C++

2. Stacks & Queues :

- Definition, Concepts, Operation on stacks & queues
- Examples of stack
- Priority queue
- Stack & Queue Implementation in C++

3. Linked Lists:-
- Inserting & removing nodes from a list
- Linked implementation of Stacks
- Linked implementation of Queues
- Example of List Operation
- Circular List
- Stack as a Circular List
- Queue as a Circular List
- Doubly Linked List

4. Trees
- Definition, Basic Terminology
- Operation on Binary Trees, Linked Storage Representation for Binary
Trees
- Binary Search trees & Basic Operations on Binary Search Trees
- Tree Traversals

5. Graphs
- Definition, Basic terminology, Matrix Representation & Implementation
of Graphs
- Graph transversals
DFS BFS
 Section –B

6. Introduction to Algorithms
- What is an Algorithm
- Performance Analysis

7. Divide & Conquer

- General Method
- Binary Search
- Finding the Minimum & Maximum
- Merge Sort
- Quick Sort
- Section

8. The Greedy Method

- The General Method
- Knapsack problem
- Job Sequencing with Deadline
- Optimal Storage on tapes
- Optimal merge Patterns

9. Dynamic Programming
- The General Method
- Multistage Graph
- All pairs Shortest Path
- Optimal Binary Search Trees
- The Traveling Sales Person Problem

10. Back Tracking

- The General Method
- Sum of Subsets
- 8 Queens Problem
- Graph Coloring

Reference Books:
1) Data Structure using C & C++( 2nd Ed.),
Tedidyah Langsar, Moshe J.
Augenstein, Aaron M. Tanenbaum Prentice Hall, India
2) Data Structure & Program Design
Rovert L.Kruse Prentice Hall
3) Fundamentals of Computer Algorithms
Horowitz Sahni
TERM-WORK:
It shall consist of al least 10 Assignments, programs based on above syllabus.
 THEROY OF COMPUTATION

Teaching Scheme: Exam Scheme:

Theory: 4 Hrs/Week Theory: 100 Marks(03 Hours)
Class Test: 20 Marks

1)Mathematical Notations & Techniques:

Sets, Logic, Functions, Relations, Principles of Mathematical Induction, Recursive
Definitions, Structural Induction. (04)

2) Regular Expressions & Finite Automata:

Regular languages & Regular Expressions, The Memory Required to Recognize
Language, Finite Automata, Distinguishing One String from Another , Unions,
Intersections, & Complements. (06)

3) Nondeterminism & Kleene’s Theorem:

Nondeterministic Finite Automata, Nondeterministic Finite Automata with ^ _
Transitions, Kleen’s Theorem. (04)

4) Regular & Nonregular Languages:

A Criterion for Regularity, Minimal Finite Automata, The Pumping Lemma, Decision
Problem, Regular Language & Computers. (05)

5) Context Free Grammers:

Definition of a Context Free Grammer, More Example, Including some Familier
Languages, Unions, Concatenations, and *’s of CFLs, Derivation Trees & Aumbiguity,
An Unambiguous CFG for Algebric Expressions, Simplified forms and Normal Forms.
(07)

6) Pushdown Automata:
Introduction by way of an Example, Definition of Pushdown Automaton, Deterministic
Pushdown Automata, A PDA Corresponding to a given Context Free Grammer, A
Context Free Grammer Corresponding to a given PDA.
(06)

7) Context-Free & Noncontext-Free Languages:

The Pumping Lemma for Context Free Languages, Intersection & Complements of
Context Free languages, Decision problems Involving Context Free languages
(04)

8) Turing Machines:
Models of Computation & the Church- Turing Thesis, definition of a Turing
Machine, & TMs as a language Acceptors, Combing Turing Machines, Computing a
Partial Functions with a Turing Machine, Variations of Turing Machines: Multitape TMs,
Nondeterministic Turning Machines, Universal turing machines. (04)
Reference Books:
1) Introduction to Languages & Theory of Computation by John C. Martin(Tata
McGraw Hill 2nd Edition)

2) Theory of Computer Science by Mishra & Chandrasekaran(PHI 2nd Edition)

3) Introduction to automat Theory, Languages, and Compuatation by Hopcroft &

Ullaman(Narosa)
 SOFTWARE ENGINEERING

Teaching Scheme: Examination Scheme:

Lectures: 04 Hours Week Theory Paper: 03 Hours 100Marks
Practical:02 Hours Week Term Work: 25 Marks
Class Test: 20 Marks

1.Manging Software Projects

Project Management Concepts, The Management Spectrum, People, The problem,
The Process, The Project, Software Process & Project Metrics, Measures, Metrics,
Indicators, Metrics in the process & Project Domains, Software
Measurement,Reconcilling Different Metrics Approaches, Metrics for Software Quality,
Integrating Metrics within the software process, Software project planning, Observations
on Estimating, Project Planning Objectives, Software Scope, Resources, Software Project
Estimation, Decomposition Techniques, Empirical Estimation Models, The Make-Buy
Decision, Automated Estimation Tools, Risk Management, Reactive vs Proactive Risk
Strategies, Software Risks, Risk Identification, Risk Projection, Risk Mitigation
monitoring, And management, safety Risks & hazards, The RMMM plan, Project
Scheduling and Tracking, Basic Concepts, The Relationship between people & effort,
Defining a task set for the software project, selecting software engineering tasks,
Refinement of Mayor task, Defining task Network, Scheduling, The project plan.
(10)

2.Quality, Configuration management, Technical Metrics and formal Methods

Software Quality Assurance, Quality Concepts, The quality Movement, Software Quality
Assurance, Software Reviews, Formal Technical reviews, Formal Approaches to SQA,
statistical quality Assurance, Software Reliability, The SQA Plan, The ISO9000 Quality
Standards.
Software Configuration Management: The SCM Process, Identification of objects in
the software configuration, Version Control, change Control, Configuration Audit, Status
Reporting, SCM Standards, technical Metrics for software, software quality, a framework
for technical software metrics, Metrics for the analysis model , Metrics for the Design
model , Metrics for the source code , Metrics for testing, Metrics for maintenance, Formal
methods, Basic Concepts, Mathematical Preliminaries, Applying Mathematical Notation
for formal Specifications, Formal Specification Languages, Using Z to Represent &
Example Software Components, The Ten commandments of Formal Methods, Formal
methods- The Road Ahead. (10)

3. Object-Oriented Software Engineering

Object- Oriented Concepts & Principles, The Object-Oriented paradigm, Object-
Oriented Concepts, Identifying the Elements of an Object Model, Management of Object-
Oriented Software, Projects, Object-Oriented Analysis, Domain Analysis, Generic
Components of the OO analysis Model, The OO process, The Object-Relationship
Model, The Object-Behavior Model, Object Oriented Design, Design for Object-Oriented
systems, The Generic Components of the OO design Model, The System Design Process,
The Object Design Process, design Patterns, Object-Oriented Programming, Object-
Oriented-Testing, Broadening the view of testing, Testing OOA & OOD Models, Object-
Oriented Testing Strategies, Test case Design for OO Software Testing.

Methods Applicable at the class level, Interclass Test Case Design, technical Metrics for
Object-Oriented Systems, The intent of Object-Oriented Metrics
The Distinguishing Characteristics : Metric for the OO design model, Class, Oriented
Metrics, Operation Oriented Metrics, Metrics for Object-Oriented testing ,Metrics for
Object-Oriented projects.
(10)

4. Reuse, Reengineering, Client/Server, & Case

Software Reuse, Management Issues, The Reverse Process, Domain Engineering,
Building Reusable Components, Classifying & Retrieving Components, Economics of
Software Reuse, Reengineering,, Business Process Reengineering, Software
Reengineering,, Reverse Reengineering, Restructing, forward engineering, The
Economics of Reengineering, Client/Server Software Engineering, The Structure of
Client/Server Systems, Software Engineering for C/S Systems, Analysis Modeling Issues,
Design for C/S Systems, Testing Issues, Computer-Aided Software Engineering, What is
case, Building Blocks for case, A Taxonomy of case Tools, Integrated Case
Environments, the Integration Architecture , The case Repository.
(10)

Text Books

1. Roger S. Pressman: Software Engineering- A Practitioner’s Approach(4th & 5th Ed.),

Tata, McGraw-Hill,1997,( Chapters ,4,5,6,7,8,9,18,19,20,21,22,23,24,26,27,28,29,29).

Reference Books:

1. Ian Sommerville: Software Engineering(5th Ed.), Addison Wesley,1996.

2. Carlo Ghezzi et al: Fundamentals of Software Engineering, Prentice-Hall
India,1991
3. Pankaj Jalote: An Integrated Approach to Software Engineering(2nd Ed.), Narosa
Publishing House,1997.
4. F.P. Bross: The Mythicai man Month(2nd Ed.), Addison Wesley,1995.

TERM-WORK:
It shall consists of al least 10 Assignments/Programs/Mini Project based on syllabus
Assessment of Term-Work should be done as follows:
i) Continuous Lab Assessment (40%)
ii) Actually Performing Practicals in Laboratory (30%)
iii) Oral Examination (Internally) conducted at the time of Submission on the syllabus &
practicals performed (30%)
 Programming in Java

Teaching Scheme: Examination Scheme:

Theory Lecture: 04 Hours/Week Theory Paper :100 Marks(03 Hrs)
Practical : 02 Hours/week Term-Work :25 Marks
Practical/Oral :25 Marks
Class Test :20

1) An Overview of Java:-
Why Java is important to the internet?, Java’s Magic: The Byte Code, Java
Buzzwords, Difference between C++ and Java, Data types, Variables and Arrays,
Operators and Control Statements. (04 Hrs)

2) Introduction to Classes:-
Class Fundaments, Declaring Objects, Assigning Object Reference Variables,
Introduction Methods, Constructors, This Keyword, A Stack Class, Overloading
Methods, Overloading Constructors, Using objects as Parameters, A closer look at
argument passing, Returning objects, Recursion, Introducing Access Control,
Understanding Static, Introducing Final, String Class, Command Line Arguments.
(08 Hrs)
3) Inheritance, Packages and Interfaces:-
Basics, Using Super, Method Overriding, Dynamic Method Dispatch, Abstract
Class, Using Final with Inheritance, Packages, Access Protection, Importing
Packages and Interfaces. (04 Hrs)

4) Exception Handling:-
Fundamentals, Exception Types, Uncaught Exceptions, Using Try and Catch,
Multiple Catch Clauses, Throw, throws, finally, Built-in Exceptions and creating
your own Exception Sub Classes. (04 Hrs)

5) Multithreaded Programming:-
Java Thread Model, The Main thread, Creating a Thread, Creating Multiple
Threads, Using Alive () and Join (),Thread Priorities, Synchronization, Interthread
Communication, Suspending, Resuming and Stopping Threads. (04 hrs)

6) The Applet Class:-

Applet, Basics, Applet Skeleton, Simple Applet Display Methods, A Simple
Banner Applet, HTML Applet tag, passing Parameters to Applets, AWT.
(04 Hrs)

7) Introduction to Java Servlets:-

Servlet Life Cycle, Servlet Interface, Generic Servlet Class, HTTP Servlet Class,
 HTTP ServletRequest Interface, HTTP ServletResponse Interface,
getOutputStream() method, Parameter Passing to Servlet, Java Web Server.
(06 Hrs)

8) An Overview of JDBC:-
Database Connectivity, ODBC API, JDBC API, JDBC Application Architecture,
Exploring Java.sql, Obtaining a Connection, Steps for creating ODBC DSN, The
Statement Object, Working with the Result Set, Query Prepared Statement,
Callable Statement, The ResultSetMetaData Interface. (06 Hrs)

Text Books:

1) Herbert Schildt: The Complete Reference Java2 5th Edition TMH

Publications.
2) Internet and Java Programming R.Krishnamoorthy and S.Prabhu , New Age
International Publishers.

Reference Books:
1) Java Servlets by Example: Alan R. Williamson Manning Publications Co.
2) Programming with Java A Primer: E Balguruswamy.
 SOFTWARE DEVELOPMENT LAB-III VB.NET

Teaching Schemes: Examination Schemes :

Theory Lecturer : 02 Hours/Week Term Work : 25 Marks
Practical : 02 Hours/Week Class Test : 20 Marks

Laying Your Visual Basic.Net Foundation

Exploiting the .NET Environment
Programming Visual Basic.NET Classes
Programming Building Blocks: Variables, Data Types and Operators
Variables and Data Types, Assignment and Arithmetic Operators, Comparison and
Logical Operators, Controlling the flow of the Program, Control Structures, Loops
And Arrays, Procedures
The User Interface
Helper Forms
Menus and Toolbars
Object-Oriented Programming in Visual Basic.NET
Test Driving the Common Language Run Time and Base Class Library
Programming Visual Basic.NET File and Directory Operations
Leveraging the .NET Common Dialogs
Exploiting Multiple Threads of Execution
Taking Advantage of Structured Error Handling
Responding to and Handling Events
Programming Windows forms
Looking Closer at .NET Assemblies and Versioning
Programming ASP.NET Solution
Programming Web Forms
Programming Web Services
Getting Started with ADO.NET
Programming .NET Reflection and Program Attributes

Text Book :
1. Visual Basic.Net & Techniques, Author : Jamsa, ISBN : 0-07-052919-1
Edition : 01, Publisher : Tata McGraw-Hill.

2. Visual Basic.Net : A Beginner’s Guide, Author : KANT, TMH, 048679-4

Reference Books :
1. MICROSOFT VISUAL BASIC.NET-STEP BY STEP, Author :
HALVORSON, Microsoft Press.
2. Learn Program with Visual Basic.Net, Author : Smiley, 048678-6, Tata
McGraw-Hill.
3. VISUAL BASIC.NET PROFESSIONAL PROJECT, Microsoft Press.
4. AN INTRODUCTION TO PROGRAMMING USING VISUAL
BASIC.NET FIFTH EDITION, Author : DAVID I. SCHNEIDER, Microsoft
Press.
Term –Work :
It shall consist of at least 10 Assignments /and A Mini Project Package based on
above syllabus.

Assessment to term Term-Work should be done as follows :

a. Continuous Lab Assessment 40 %
b. Actually performing practical in laboratory 30%
c. Oral Examination ( Internally ) conducted at the time 30%
of submission on the syllabus & practical performed.

Practical Examination
The Practical examination shall be based on the Mini Project and
Assignments in Journal
 COMPUTER GRAPHICS

Teaching Scheme Examination Scheme

Lectures: 04 Hours/week Theory Paper: .100 Marks (03) Hours
Practical: 02 Hours/Week Term-work: 25 Marks
Class Test: 20 Marks

1. Introduction I)
Image processing as picture analysis: Advantage of interactive graphics, Representation:
uses of computer graphics, Classification of applications, Development of hardware
and software for computer graphic, conceptual framework for interactive graphics.
Drawing with SRGP, Basic interaction handling, Raster graphics features, limitations for
SRGP, Hardcopy technologies, R:nter-scan display systems, The video controller.
Random-scan display processor, Input, devices for operator interaction, Image scanners

2. Raster Graphics Algorithms 6

Overview, scan conve11ing lines, Scan converting circles, Filling rectangles, Filling
polygons, filling ellipse arcs, Pattern filling, Thick primitives, Line style and pen style.
Clipping in a raster world, Clipping, lines, Clipping circles and ellipses. Clipping
polygons, Generating Characters. SRGP copy pixel, Antialiasing.

3 Geometrical Transformations . 6
2 D Transformations, Homogeneous coordinates and Matrix representation or 2D
Transformations, composition of 2D transformations, The window-to-viewport
Transformation, Efficiency. Matrix representation of 3D transformation, Composition
3D transformation, Transformation as a change: in coordinate system.

4 Viewing in 3D 4
Projections,specifying an arbitrary 3D view, Examples of:3D viewing, The mathematics
of planer geometric projection, Implementation planar geometric projections, co-ordinate
systems.

5 Interaction Techniques, Dialog Design and User Intel'face Software 6

Interaction hardware, Basic interaction tasks, Composite interaction tasks, The form and
content of User- computer dialogues, User- interf~1cc style. Important design
considerations, Modes and Syntax, Visual design, The design methodologies.

6, Representing curves and surfaces .1

Polygon meshes, parametric cubic curves, parametric bicubic surfaces. Quadric surfaces
7 Visihlc Slirface Detection

Functions of two variables. Techniques, for efficient visible-surface aIgorith. Algorithms

for visible- line determination. Z- Buffer algorithm, List priority algorith. Scan-line
algorithms. Area-Subdivision algorithms, Algorithms for octrees. Algorithms 1'01'
curved surfaces. Visible surface ray tracing.
Text Books
1. James D. Foley Andries Van Dam Steven K. Feiner John f. Hughes, Computer
Graphics
2. Rogers, Mathematical Elements Of Computer Graphics
Reference Books
Donald Hearn and M. Pauline Baker Computer Graphics
 DATABASE MANAGEMENT SYSTEM

Teaching Schemes: Examination Schemes :

Theory Lecturer : 04 Hours/Week Theory Paper : 100 Marks(03 Hours)
Practical : 02 Hours/Week Term Work : 25 Marks
Practical / Oral : 25 Marks
Class Test : 20 Marks

1. Introduction :
Database and Database users, Introduction to Database Management System,
Examples, Characteristics of the Database Approach, Actors on the scene,
Workers behind the scene, Advantage of using a Database Approach, When not to
use a Database Management Systems, Database System concepts and
Architecture, Data Models, Schemes and Instances, DBMS Architecture and Data
Independence, Database Languages and Interfaces, Database System
Environment, Classification of Database Management Systems. (06 Hrs)

2. ER Models, Relational Models and Relational Algebra :

Database Modeling using the ER Model, Using High-Level conceptual Data
Models for Database design, An example Database Application, Entity types,
Entity Sets, Attributes and keys, Relationships, Relationship types, roles and
Structural Constraints, Week Entity types, Refining the ER Design for the
Company Database, ER Diagrams, naming conventions and design Issues, the
Relational Data Model, Relational constraints, the Relational Algebra: Relational
Model Concepts, Relational concepts and Relational Database Schemes, Update
Operation and Dealing with Constraints Violations, Basic relational algebra
Operations, Additional Relational Operations, Examples of queries to Relational
Algebra, Relational Database Design, Using ER-to-Relational Mapping.
(10 Hrs)

3. Database Designing :
Functional Dependencies and Normalization for Relational Database, Informal
Design Guidelines for Schemes, Functional Dependencies, Normal Forms based
on Primary keys, General Definitions of Second and Third Normal forms, Boyce-
Codd Normal form, Relational Database Design Algorithms and Further
Dependencies, Algorithms for Relational Database Schema Design, Multivalued
Dependencies and Fourth Normal Form, Join Dependencies and Fifth Normal
Form, Inclusion Dependencies, Other Dependencies and Normal Forms.
(08 Hrs)

4. SOL-The relation Database Standard :

Data definition, Constraints and Schema changes in SQL 2, Basic Quires in SQL.
More Complex SQL Quires, Insert, Delete and Update Statements in SQL, views
(Virtual Tables) in SQL, Specifying general constraints as Assertion features of
SQL. (06 Hrs)
 5. Transaction Processing :
Transaction Processing Concepts, Introduction to Transaction Processing,
Transaction and System Concept, Desirable properties of Transactions,
Scheduling and Recoverability, Serializability of Scheduling, Transaction Support
in SQL, Concurrency control techniques, Concurrency techniques for concurrency
control, concurrency control based on timestamp Ordering. Multivision
concurrency control techniques. Validation ( Optimistic ) concurrency
Control techniques, Granularity control in Index, Some other Concurrency
Control issues, Database Recovery Techniques based on Immediate Update,
Shadow Paging, The ARIES Recovery Algorithms, Recovery in multidatabases
system, Database backup and Recovery from catastrophic Failures, Database
Security and Authorization, Introduction to Database Security Issues,
Discretionary Access Control for multilevel Security, Introduction to Statistical
Database Security. (10 Hrs)

Text Book :
2. Database System Concepts, 4th Edition, Abraham Silberschatz and Henry Korth,
S. Sudarshan, ISBN : 0-07-120413-X, Tata McGraw-Hill.
3. Ehmasri and Navathe : Fundamentals of Data base Systems ( 3rd Ed.), Addison-
Wesley, 1999. Chapter 1,2,3,4,5,6,7,8,9.1,14,15,19,20,21,22)

Reference Books :
2. Raghu Ramakrishnan: Database Management Systems, 2nd Ed., McGraw-
Hill 2000.
3. Data C.J: Introduction to Database system, 6th Ed., Addision –Wesley,
1995.
4. Partrick O’Neil & Dtabase Principles , Programming, Performances, 2nd
Ed., Morgan Kaufman, 2000.

Term –Work :
It shall consist of at least 10 Assignments programs based on above syllabus.

Assessment ot term Term-Work should be done as follows :

• Continuous Lab Assessment 40 %
• Actually performing practicals in laboratory 30%
• Oral Examination ( Internally ) conducted at the time 30%
of submission on the syllabus & practical performed.

Suggested Practicals / Assignment :

A min I project implemented in an RDBMS environment like INGRES> ORACLE
SYBASE etc.

Study assignments on RAID – different levels

Study assignments and priticals on Implementating a Client-Server System on
Window 2000 Server Family ( Windows2003 Preferred).
The min-project may be carried out individually or by a batch of not more than two
students.
The students will pick a topic in consultation with a departmental faculty. These
faculty must guide the students.
Each students in the term should equally participating in the tasks mentioned below
The mini-project must be carried out in the college only
The mini –project tasks would involve the following
1. Understanding the mini-world description and the application specification of the
mini-project.
2. Brining out the conceptual design ( Entity relationship representation ) of the
mini-project.
3. Converting the conceptual design to the Relational design, Normalization of the
Relational design up to 3NF ( Desirable 5NF).
4. Documentation and Submission or Report

Typical mini-projects.

1. Room reservation and front office needs of a luxury hotel.

2. Railway reservation for Indian Railway.
3. Airline reservation for Indian Airlines.
4. Sales management of consumer products company.
5. Library management.
6. A city tourist assistance service.
7. Bus reservation for a state transport corporation.
8. Front office management for large University.
9. Patients and service management for a large hospital.
10. Admission management for large University.
11. Managing of placements center
12. Sports databases
13. Examination system management.
14. Online enquiry service for products and services in a city like Yellow pages.
 COMPUTER NETWORK

Teaching Schemes: Examination Schemes :

Theory Lecturer : 04 Hours/Week Theory Paper : 100 Marks(03 Hours)
Practical : 02 Hours/Week Term Work : 25 Marks
Class Test : 20 Marks

6. Introduction :
Overview of computer networks, Network hardware and software, Reference
model-OSI and TCP/IP and their comparison, Network layer – Network layer
design issues, Various Routing algorithms and congestion control algorithms,
Internetworking, The networking layer in the internet and in ATM
network.(12Hrs)

7. Transport Layer :
The Transport Service, Elements of Transport Protocols, Internet Transport
Protocols, TCP and UDP, ATM AAL layer protocols, Performance issues.
(08 Hrs)
8. TCP/IP :
The TCP/IP architecture, The Internet Protocols, Ipv6, User gram Protocol,
DHCP and mobile IP, Internet protocols, Multi cast routing.(06 Hrs)

9. The Application Layer :

Network security – Principles of cryptography, Secret-key and Public-key
algorithms, Authentication protocols, Digital scanners, Domain Name System –
The DNS name space, Resource records, Name Servers, Simple Network
Management Protocol – the SNMP model, Abstract syntax notation, Structure of
management information, Managements information base, The SNMP protocol,
Electronic mail- Architecture and services, The user agent, Message formants and
message transfer, Email privacy, Usenet news, User view of Usenet
Implementation. (08 Hrs)

10. Multimedia Information and Networking:

Loss less data compression, Digital Representation of Analog Signals, Techniques
for increasing compression, The Real-Time Transport Protocol, Session control
protocols. (06 Hrs)

Text Book :
4. Andrew S Tanenbaum, Computer Networks, Third Edition, Prentice hall Indian,
1996 Chapter 1.1,1.2,1.3,1.4 (expect
1.4,.4,1.4.5),,5.1,5.2,5.3,5.4,5.5,5.6,6.1,6.2,6.4,6.5,6.6,7.1(expect
7.1.7),7.2,7.3,7.4,7.5,7.6,7.7)

5. ALBERTO Leon-
6. Ehmasri and Navathe : Fundamentals of Data base Systems ( 3rd Ed.), Addison-
Wesley, 1999. Chapter 1,2,3,4,5,6,7,8,9.1,14,15,19,20,21,22)
 DIGITAL SIGNAL & IMAGE PROCESSING

Teaching Schemes: Examination Schemes :

Theory Lecturer : 04 Hours/Week Theory Paper : 100 Marks(03 Hours)
Practical : 02 Hours/Week Term Work : 25 Marks
Practical / Oral : 25 Marks
Class Test : 20 Marks

0.1 Introduction :
Introduction, Signals, Systems, Basic Elements of Digital signal processing
system. Classification of signal Multi Channel & multidimensional signals,
Continuous –Time Vs Discrete-Time Signals, Continuous-Valued Vs Discrete-
Valued signals, Deterministic Vs Random signals. (02 Hrs)

0.2Discete-Time Signal & System :

Discrete-Time signals, Classification of Discrete time signals, Simple
manipulation of discrete-Time signals, Discrete-Time System Input/output
description of system, Block Diagram representation, Classification of Discrete
time systems. Interconnection of Discrete time systems. Resolution of discrete
time signals into impulses, Response of LTI system to arbitrary inputs: The
convolution sum, Properties of Convolution & Interconnection of LTI system,
Stability of LTI system correlation of Discrete time signals Filtering of long data
sequences.
03 The Z-Transform : (06 Hrs)
The Direct Z-Transform, The Inverse Z Transform Properties of Z-Transform,
Rational Z-Transform, Poles and zeros, Pole Location and Time-Domain Behavior
for Causal Signals,The System function of linear Time Invariant system
Inverse Z-Transform:Inverse Z-Transform by Contour Integration, Power Series
Expansion, partial-Fraction Expansion,Decomposition of rational Z transform One
sided Z-Transform Definition and properties , Solution of different Equations.

04 Frequency analysis of signals and systems (03 Hrs)

Frequency analysis of continuous time signals Frequency analysis Discrete time

signals properties of Fourier Transform for Discrete time signals Frequency domain
characteristics of LTI systems Linear time invariant system as frequency selective filters

05 The Discrete Fourier transform : (04 Hrs)

Frequency domain Sampling : The Discrete Fourier Transform, DFT, The DFT as
Linear Transformation, Relationship of the DFT to Other Transform, Properties of
DFT , Circular Convolution.

06 FFT Algorithms : (03 Hrs)

Direct Computation of DFT, Divide- and- Conquer Approach to Computation of
DFT,Radix-2 FFT Algorithms.Decimation in Time and decimation in Frequency
Algorithm

07 Implementation of Discrete-Time System (02 Hrs)

Structur of FIR filters; Structur of IIR filters;

08 Design of Filters :
Introduction to different Filter types and characteristics , Design of digital filters
from analog filters Analog Low pass Filter Design: Butterworth filtera and
chebyshev filter Design of IIR filter from analog filter using Impulse Invarient
Transformation, Bilinear transformation Sy mmetric and Antisymmetic Filter Design
of FIR filters using fourier series method Windowing techniques Rectangular
Hamming Hanning Triangular Kaised Rased Cosine Filters

09 Introduction to Digital Image Processing :

Digital image representation, Digital image representation, Fundamental of DIP, ,
image formation model, Relationship between pixels, Neighbors of pixels,
connectivity, distance measures, arithmetic/logic operations, image (02 Hrs)

Image Enhancement (07)

Spatial Domain:
Introduction, Some basic gray level transformation, Image Negative Contrast
Stretching , Clipping and Thresholding, Log Transformation ,Power law
transformation, Piecewise linear Transformation Histogram Processing, Histogram
Equalizations Histogram maching (Specification)Local Operations – Image
substraction and image averaging Basics of Spatial Filtering, Smoothing filter-
Smoothing linear filter , order statistics filters Sharpening Spatial Filters-formation
use of second derivative for enhancement , the laplacian.
Image Enhancement In the Frequency Domain:
Introduction, The one dimensional Fourier transform and its Inverse, The two
dimensional fourier transform and its Inverse Filtering in the frequency domain,
correspondence between filtering in the spatial and frequency domain.
Smoothing Frequency filters:- Ideal low pass filter bitter worth low pass filters
Gaussian low pass filters
Sharpening Frequency Domain Filter Ideal high pass filter butter worth high pass
filters Gaussian high pass filters, the laplacian. In the frequency domain ,Unsharp
masking High boost filtering and High frequency emphasis filtering Homomorhic
Filtering

Text Book :
1. Digital Signal Processing- Proakis , Manolkis (3rd Edition)
2. Digital Image Processing- Rafael C. Gonzalez, Richard E. Woods (2nd
Edition).
Reference Books :
1. Digital Signal Processing- Sanjit K. Mitra (2nd Edition) TMcGH
2. Fundamentals Of Digital Image Processing- A. K. Jain, PHI.
 OPERATING SYSTEM

Teaching Scheme: Examination Scheme:

Theory Lecture: 04 Hours/Week Theory Paper :100 Marks(03 Hrs)
Practical : 02 Hours/week Term-Work :25 Marks
Practical/Oral :25 Marks
Class Test :20 Marks

9) Introduction :
Batch System, Concept of Multi-programming and Time sharing, parallel,
Distributed and Real- Time Systems, Operating System Structures- Operating
System and services, System calls, System Programs, Virtual machines.(04 Hrs)

10) Process management :

Process concept, Process scheduling, co-operative processes, Threads,
Interprocess communication, CPU scheduling criteria, Scheduling algorithms,
Multiple- Processor scheduling, Real – time scheduling, Algorithm evolution.(06
Hrs)

11) Process synchronization & Deadlock :

The critical-region problem, synchronization H/W, Semaphores, classical
problems of synchronization, critical regions, monitors deadlocks-system model,
characterization, deadlock preventation, Avoidance & Detection, Recovery from
deadlocks, combined approach to deadlock handling.(08 Hrs)

12) Storage Management :

Memory management, logical & physical address space, Swapping, Contiguous
allocation, Paging, Segmentation with paging in MULTICS, Intel 386, Virtual
mem-femand paging & its performance, Page size & other consideration, demand
segmentation, File system, Secondary storage structures-file concept, access
methods, directory structure, Protection & consistency semantics, File system
structure, allocation methods free space management, Directory implementation,
Efficiency & performances, Recovery, Disk structure, Disk scheduling methods,
Disk management, Swap-space management, Disk reliability Protection &
security-Goals of protection, Domain of protection, Access matrix,
Implementation of access matrix, Revocation of access rights, Language based
protection, The security problem, Authentication, one-time PWD, Programming
threats, System threats, Threat monitoring, Encryption. (14 Hrs)
13) Case Study-Win NT, LOS :
Win – NT Design principals, system components environmental subsystem,
Networking & programming interface, Linux system-design principles, Kernel
modules, process management, scheduling, memory management, File system
I/O, Interprocess communication, N/W structure, Security. (08 hrs)

Text Books:
3) Mian Milankovic, Operating systems, concept and design, 2nd Ed.Tata
McGraw-Hill, 1992.
4) Abraham Silberschatz and Peter Barer Gavin, Operating System concepts, 5th
Ed. Addison – Weslay 1998[ chapters 1,3.1,3.2,3.3,3.4,3.6,4.5.6 (except
6.8,6.9), 7,8,9,10,11,13(Expect 13.6),19(expect 19.6),20,22,23]
Reference Books:
3) Harvey M. Deital, Operating Systems, 2nd Ed.Addison- Wesley,1990.
4) Richard Pertension, Lions: The complete Reference Osborne McGraw-Hill,
1998.
TERM-WORK :
It shall consist of at least 10 Assignments / Program based on above syllabus

Assessment of term Term -Work should be done as follows :

• Continuous Lab Assessment 40 %
• Actually performing practicals in laboratory 30%
• Oral Examination ( Internally ) conducted at the time 30%
of submission on the syllabus & practical performed
 SOFTWARE DEVELOPMENT LAB-IV

Teaching Scheme: Examination Scheme:

Lectures: 02 Hours /Week Term Work: 25 Marks
Practical:02 Hours /Week

The Software Development Lab IV comprise of two main topics ASP.NET, JSP.
Either of two can be opted for SDL-IV. However, if Lecturer & Student desires to study
both the topics, Certainly both can be studied, but partial studying the topics is not
recommended.

ASP.NET 20 Hours

Part I: ASP.NET Introduction

The .NET Framework
Learning the .NET Languages
Types, Objects, Namespaces
Setting Up ASP.NET & IIS

Part II: Developing ASP.NET Applications

ASP.NET Applications
Web Form Fundamentals
Web Controls
Using Visual Studio.NET
Validation & Rich Controls
State Management
Tracing, Logging, & Error Handling

Part III: Working with Data

Overview of ADO.NET
ADO.NET Data Access
Data Binding
The Data List, Data Grid, and Repeater
Files, streams, Email
Using XML

Part IV: Web Services

Web Services Architecture
Creating Web Services
Using Web Services

Part V: Advanced ASP.NET

Component-Based Programming
Custom Controls
Caching & Performance Tuning
Implementing Security
The IBaySpy Case Studies

Part VI: ASP.NET Reference

HTML Server Controls
Web Controls
Configuration Files

Text Books:
1) ASP.NET: THE COMPLETE REFERENCE, by
MACDONALD,MATTHEW,ISBN : 0-07-049536-X

Reference Books:
1) MICROSOFT ASP.NET STEP BY STEP, Author : DUTHIE, Microsoft Press,

2) MICROSOFT ASP.NET PROFESSIONAL PROJECTS, Microsoft Press,

3) ASP.NET Programming A Developer’s Guide, by Mesbah Ahmed, Chris Garret,

Jeremy Fair, Chris Payne, DorThatCom.com, Wei Meng-Lee, Jonothon
Ortiz,ISBN 81-7722-153-1.

OR

JSP
Part I: The Web Programming Environment
Evolution of the Web Application
Overview of the Hypertext Transfer Protocol (HTTP)
Introduction to Serve lets
JSP Overview

Part II: Elements of JSP

JSP Syntax and Semantics
Expressions, Script lets, & Declarations
Request Dispatching
Session & Thread Management
Application Event Listeners
Filters

Part III: JSP tag Extensions

Introduction to Custom Tags
Expression Language
The JSP Standard Tag Library (JSTL)
Simple Tag Extensions, Tag Files & JSP Fragments
 Part Iv: JSP Applications
Database Access with JDBC
JSP & XML
JSP Testing & Debugging
Deploying Web Applications

Text Books:

1) JSP 2.0: THE COMPLETE REFERENCE, by HANNA, PHIL, Pub : Tata

McGraw Hill ISBN 0-07-053141-2

Reference Books:
1) JAVASERVER PAGES FAST & EASY WEB DEVELOPMENT, by,
BAKHARIA, ISBN : 81-203-1895-1, PRENTICE HALL AL, India
2) JavaServer pages, 3rd Edition, by, Hans Bergsten, Publisher: O’Relly
& Associates, ISBN : 0596005636

TERM-WORK:

It shall consists of al least 10 Assignments/Programs/Mini Project based on syllabus

Assessment of Term-Work should be done as follows:

i) Continuous Lab Assessment (40%)
ii) Actually Performing Practicals in Laboratory (30%)
iii) Oral Examination (Internally) conducted at the time of Submission on the syllabus &
practicals performed (30%)