Final Autonomous Syllabus 5th & 6th Sem-Mar

RV COLLEGE OF ENGINEERING,BANGALORE-59

(Autonomous Institution under VTU, Belgaum)

Semester – V Department – Information Science and Engineering

SCHEME OF TEACHING & EXAMINATION

Sl NoSub. Code

Title BOS

Teaching Scheme Hours/week

Examination

CreditsTheory Tutorial Practical

1 07HSS51Management and Entrepreneurship

HSS 4 4

2 07IS52Database Management Systems

ISE 3 1 3 5

3 07IS53 Computer Networks – I ISE 4 4

4 07IS54 Microprocessors ISE 3 1 3 5

5 07IS55 Computer Organization ISE 4 4

6 07IS56X Elective-A ISE 4 4

TOTAL 22 2 6 26

1

Elective-A

Sub Code Title

07IS561 Probability Statistics and Queuing

07IS562 Soft Computing

07IS563 Operational Research

07IS564 Decision Support Systems

RV COLLEGE OF ENGINEERING, BANGALORE – 560059


Semester – VI Department – Information Science and Engineering


Sl NoSub Code Title BOS

Teaching Scheme Hours/weekExamination

no of creditsTheory Tutorial Practical

1 07IS61 Computer Networks-II ISE 3 1 3 5

2 07IS62 Software Engineering ISE 4 4

3 07IS63 File Structures ISE 3 1 3 5

4 07IS64 Systems software ISE 3 3

5 07IS65X Elective-B ISE 4 4

6 07IS66X Elective-C ISE 4 4

TOTAL 21 2 6 25

2

Elective-B Elective-C

Sub Code

TitleSub

CodeTitle

07IS651 Artificial Intelligence and Neural Networks 07IS661 Digital Image Processing

07IS652 Distributed Computing 07IS662 Service Oriented Architecture

07IS653 Advanced DBMS 07IS663 Mobile Handset Software Design

07IS654 Java and J2EE 07IS664 Data Warehousing and Data mining



3

RV COLLEGE OF ENGINEERING, BANGALORE-59

AUTONOMOUS INSTITUTION UNDER VTU

V – SEMESTER

INFORMATION SCIENCE AND ENGINEERING


Management & Entrepreneurship

Subject Code : 07HSS51 CIE Marks : 100

Hrs/Week : 4 + 0 + 0 Exam Hrs : 3

Credits : 04 SEE Marks : 100

Objective:

1. To provide the students with an overview of several influential approaches and concepts of management those

have shaped managerial thinking during the past century.

2. To trigger the entrepreneurial thinking amongst the student community and provide necessary inputs for setting

up of an enterprise.

PART – A

Principles of Management

1 Management: Introduction – Meaning – nature and characteristics of Management, scope and

functional areas of management – Management as a science, art or profession – Management and

administration – Roles of management, Levels of management, Development of Management Thought

– Early management approaches – Modern management approaches.

4 Hrs

2 Planning and Forecasting: Nature of Planning, Types of planning, Forecasting, Strategies for

managing technology.

2 Hrs

3 Organizing: Nature of Organizing, Technology and Modern Organization Structures, Authority and

Power, Delegation, Committees and Meetings.

3 Hrs

4 Motivating and Leading Technical People: Motivation, Leadership, Motivating and Leading

Technical Professionals (Excludes detailed coverage of Leadership and motivation theories)

Controlling: the Process of Control, Financial Controls, Non-Financial Controls.

3 Hrs

PART – B

Engineering Management

5 Managing Engineering Design and Development: Product and Technology Life Cycles, Nature of 7 Hrs

4

Research and development, Research Strategy and organization, selecting R & D Projects, Protection

of Ideas, Creativity, Nature of Engineering Design, Systems Engineering / New Product Development,

Control System in Design Product Liability and Safety, Designing for Reliability, other “abilities” in

Design.

6 Managing Production Operations: Assuring product quality, Productivity, Work measurement,

Maintenance and Facilities (Plant) engineering, other manufacturing functions.

6 Hrs

7 Engineers in Marketing and service activities: Marketing and the Engineer, Engineers in Service

organizations.

3 Hrs

8 Project Planning and Acquisition: Characteristics of a project, the project proposal process, project

planning tools, Types of contracts.

5 Hrs

9 Financial Management for Engineers: Overview of tools for financial performance measurement of

organizations.

3 Hrs

PART – C

Entrepreneurship

10 Entrepreneur: Meaning of an Entrepreneur, Evolution of the Concept, Functions of an

Entrepreneur, Types of Entrepreneurs, Intrapreneur - an Emerging Class. Concept of

Entrepreneurship – steps in entrepreneurial process, Role of entrepreneurs in Economic

Development: Entrepreneurship in India; Entrepreneurship –Barriers.

3 Hrs

11 Micro Small & Medium Enterprises (MSME): Definition; Characteristics; Need and rationale;

Objectives; Scope; role of MSME in Economic Development. Advantages of MSME, Steps to start

an MSME – Government policy towards MSME; Impact of Liberalization, Privatization,

Globalization on MSME, Effect of WTO / GATT.

3 Hrs

12 Institutional Support: Different Schemes; TECSOK, KIADB, KSSIDC, KSIMC, DIC single

Window Agency; MSME, NSIC; SIDBI; KSFC.

2 Hrs

13 Preparation of Project: Meaning of Project, Project Identification, Project Selection, Project Report

- Contents; Formulation; Project Appraisal. Identification of Business Opportunities: Market

Feasibility studies; Technical Feasibility Studies; Financial Feasibility Studies and Social Feasibility

studies.

4 Hrs

Reference Books:

5

1. Harold Koontz and Heinz Weihrich - Essentials of Management, 7th Edition, TMH.

2. Daniel L Babcock and Lucy C Morse – Managing Engineering and Technology, 3rd Edition, Pearson Education.

3. SS Khanka - Entrepreneurship Development, S Chand & Co.

4. James Arthur Finch Stoner, R. Edward Freeman, Daniel R., Jr. Gilbert- Management,6 Sub edition (January 1995)

ISBN-13: 978-0131087477 , Prentice Hall.

5. Poornima M Charantimath – Entrepreneurship Development - Small Business Enterprises, Pearson Education –

2006 .

6. David Holt – Entrepreneurship.

Note: The subject treatment should be introductory in nature. The course is meant to equip engineering students on

the managerial aspects of an enterprise and motivate the students to consider entrepreneurship as a career option.

Scheme of Semester End Evaluation :

Two questions from Part – A, Four questions from Part – B and Two questions from Part – C are to be set. Students

will be asked to answer at least one question from Part – A, three from Part – B and one from Part C.



Database Management Systems

(Theory and Practice)

Subject Code : 07IS52 CIE Marks : 150

6

Hrs/Week : 3 + 1 + 3 Exam Hrs : 3+3


Objective: The history of database research over the past years is one of the exceptional productivity that

has led to the Database System. This course provides the student with an overview of creating, modifying

& managing data-base for single user & multi-user environment. The topic on ER-model exposes the

students to the concepts of modeling ER-diagram. SQL- Queries, Concurrency control and an exposure to

basic normal forms enable the student to learn creating databases and applications to produce an effective

and efficient system. The laboratory work helps to better rationalization of lecture material and contribute

to formation of practical skills.

Part – A

1. Databases and Database Users 6 Hrs

Introduction; Characteristics of Database approach; Actors on the Scene; Workers behind the scene;

Advantages of using DBMS approach. Data models, schemas and instances; Three-schema architecture

and data Independence; Database languages and interfaces; The database system environment;

Centralized and client-server architectures; Classification of Database Management systems.

2. Data Modeling Using the Entity-Relationship Model: 6 Hrs

Using High-Level Conceptual Data Models for Database Design; Entity Types, Entity Sets, Attributes and

Keys; Relationship types, Relationship Sets, Roles and Structural Constraints; Weak Entity Types;

Refining the ER Design; ER Diagrams, Naming Conventions and Design Issues; Relationship types of

degree higher than two.

3. Database Design: 8 Hrs

Informal Design Guidelines for Relation Schemas; Functional Dependencies; Normal. Forms Based on

Primary Keys; General Definitions of Second and Third Normal Forms; Boyce-Codd Normal Form.

Properties of Relational Decompositions; 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.

PART – B

4. Relational Model: 8 Hrs

Relational Model Concepts; Relational Model Constraints and Relational Database Schemas; Relational

Database Design. Update Operations, Transactions, and Dealing with constraint Violations. Unary

Relational Operations: SELECT and PROJECT; Relational Algebra Operations from Set Theory; Binary

Relational Operations: JOIN and DIVISION; Additional Relational Operations; Examples of Queries in

7

Relational Algebra, Relational Database Design Using ER- to-Relational Mapping.

5. SQL: 12 Hrs

SQL Data Definition and Data Types; Specifying basic constraints in SQL; Schema change statements in

SQL; Basic queries in SQL; More complex SQL Queries. Insert, Delete and Update statements in SQL;

Specifying general constraints as Assertion and Trigger; Views (Virtual Tables) in SQL; Additional

features of SQL; Database programming issues and techniques; Embedded SQL, Dynamic SQL;

Database stored procedures and SQL / PSM.

PART – C

6. Transaction Management: 12 Hrs

The ACID Properties; Transactions and Schedules; Concurrent Execution of Transactions; Lock- Based

Concurrency Control; Performance of locking; Transaction support in SQL; Introduction to crash

recovery. 2PL,Serializability and Recoverability; Introduction to Lock Management; Lock Conversions;

Introduction to ARIES; The log; Other recovery-related structures; The write-ahead log protocol;

Checkpointing; Recovering from a System Crash; Media Recovery; Other approaches and interaction

with concurrency control.

Reference Books:

1. ElmaSri and Navathe - Fundamentals of Database Systems, 5th Edition, Addison- Wesley, 2007.

(Chapters 1, 2, 3 except 3.8, 5, 6.1 to 6.5, 7.1, 8, 9.1, 9.2 except SQLJ, 9.4, 10, 11)

2. Raghu Ramakrishnan and Johannes Gehrke - Database Management Systems, 3rd Edition, McGraw-

Hill ,2003.(Chapters 16, 17.1, 17.2, 18)

3. Silberschatz, Korth and Sudharshan - Data base System Concepts, 5th Edition, Mc-GrawHill 2006.

4. C.J. Date, A. Kannan, S. Swamynatham - A Introduction to Database Systems, 8th Edition, Pearson

Education, 2006.

Scheme of Semester End Evaluation:

Three questions from Part – A, Three questions from Part – B and Two questions from Part – C are to be

set. Students will be asked to answer two questions from Part – A, two from Part – B and one from

Part – C.

PART – D

DATABASE MANAGEMENT SYSTEM LABORATORY

A Mini Project to be implemented in RDBMS environment like ORACLE, MySQL, SQL Server.

The Mini project shall be carried out individually. The students will pick a topic in consultation

with faculty. The mini project must be carried out in the college only.

8

A Project should involve:

The mini world description and the application specification

The conceptual design (Entity relationship representation)

Converting the conceptual design to the Relational design.

Normalization of the Relational design up to 3NF (Desirable 5NF).

Documentation and Report.

Typical Mini Projects:

Room reservation and front office needs of a luxury hotel.

Railway reservation for Indian Railways.

Airline Reservation for Indian Airlines.

Sales management of consumer products company

Library management

Lab Schedule:

Week 1: Requirements collection and analysis (Data requirements & Functional requirements)

Week 2: Conceptual Design (Designing ER diagram)

Week 3: Converting ER diagram to relational design

Week 4: Normalization of the Relational design up to 3NF (Desirable 5NF)

Week 5: Creating tables of the relational design and populating the database.

Week 6: Creating all the forms using front end

Week 7: Creating all the reports using front-end.

Week 8: Implementation

Week 9: Implementation

Week 10: Project Demo.


Description Marks

Demonstration of the project 50

Implementation of the specified modification 30

Subject Viva 20



Computer Networks - I


Hrs/Week : 4 Exam Hrs : 3

9


Objective: This subject covers the data link layer issues and the ways of transmitting data (Analog to

Digital, Digital to Analog). This subject also deals with different modulation techniques and its

application. Provides student an introduction to fundamental network architecture concepts and their

application in existing and emerging networks. Also emphasizes the pivotal role of Internet protocols in

future network architecture at the same time provides a broad coverage of fundamental network concepts.

PART - A

1. Introduction 6 Hrs

Data Communications: Components, Data Representation, Data Flow; Networks: Distributed Processing,

Network Criteria, Physical Structures, Network Models, Categories Of Networks, Interconnection of

Networks; The Internet: The Brief History, The Internet Today; Protocols and Standards: Protocols,

Standards, Standards Organizations, Internet Standards; Layered tasks: Sender,Reciever and Carrier,

Hierarchy; The OSI Model and the layers in the OSI model; TCP / IP Protocol Suite.

2. Data, Signals, and Digital Transmission 8 Hrs

Analog and digital signals: Analog and Digital Data, Analog And Digital Signals, Periodic And Non

periodic Signals, Periodic Analog Signals: Sine Wave, Phase, Wavelength, Time and Frequency Domains,

Composite Signals, Bandwidth, Digital Signals: Bit rate, Bit Length, Digital Signal as a Composite

Analog Signal, Transmission of Digital Signals; Transmission impairment: Attenuation, Distortion, Noise;

Data rate limits: Noiseless channel:NyquistBitRate,NoisyCahannel:ShannonCapacitty,Using,bothlimits;

Performance: Bandwidth, Throughput, Latency, Bandwidth-Delay Product, Jitter; Digital - to -Digital

conversion: Line Coding, Line Coding Schemes, Block Coding Schemes, Block Coding, Scrambling;

Analog – to – Digital conversion: Pulse Code Modulation, Delta Modulation; Transmission modes:

Parallel Transmission, Serial Transmission.

3. Analog Transmission and Multiplexing 6 Hrs

Digital - to - Analog conversion: Aspects of Digital-to-Analog Conversion, Amplitude Shift Keying,

Frequency Shift Keying, Phase Shift Keying,Quadrature Amplitude Modulation; Analog - to - Analog

conversion: Amplitude Modulation, Frequency Modulation, Phase Modulation; Multiplexing: Frequency

Division Multiplexing, Wavelength-Division Multiplexing, Synchronous Time Division Multiplexing,

Statistical Time Division Multiplexing; Spread spectrum: Frequency Hopping Spread Specttrum,Direct

Sequence Spread Spectrum.

PART – B

4. Transmission Media, Error Detection and Correction 6 Hrs

Guided Media: Twisted pair cable, Coaxial cable, Fiber-Optic cable; Unguided media: wireless: Radio

waves, Microwaves, Infrared. Introduction to error detection / correction: Types of

10

errors,Redundancy,Detection Versus Correction ,Forward Error Correction Versus

Retransmission,Coding,Modular arithmetic; Block coding: Error Detection, Error Correction, Hamming

Distance, Minimum Hamming distance; Linear block codes: Minimum Distance For Linear Block Codes,

Some Linear block codes; Cyclic codes: Cyclic Redundancy Check, Hardware

Implementaion,Polynomials,Cyclic Code Analysis, Advantages of Cyclic Codes, Other cyclic codes,

Checksum:Idea,Ones’s Complement, Internet Checksum

5. Data Link Control 7 Hrs

Framing: Fixed-Size Framing, Variable Size Framing; Flow and Error control: Flow Control, Error

control; Protocols; Noiseless channels: Simplest Protocol, Stop-and-Wait Protocol; Noisy channels: Stop-

and-Wait Automatic Repeat Request, Go-back-N Automatic Repeat Request, Selective Repeat Automatic

repeat Request, Piggybacking; HDLC:Configuration and Transfer Modes,Frames,Control Field; Point-to-

point Protocol - framing, transition phases.

6. Multiple Access, Ethernet 7 Hrs

Random Access: ALOHA, Carrier Sense Multiple Access, Carrier Sense Multiple Access with Collision

Detection, Carrier Sense Multiple Access with Collision Avoidance ; Controlled Access:

Reservation,polling,Token passing; Channelization: Frequency Division Multiple Access, Time Division

Multiple Access, Code- Division Multiple Access. Ethernet: IEEE standards: Data Link Layer, physical

Layer; Standard Ethernet: MAC Sub layer, Physical Layer and changes in the standard: Bridged Ethernet,

Switched Ethernet, Full-Duplex Ethernet; Fast Ethernet: MAC Sub layer, Physical Layer; Gigabit

Ethernet: MAC Sub layer, Physical Layer, Ten-Gigabit Ethernet.

PART – C

7. Wireless LANs and Connection of LANs 6 Hrs

IEE 802.11:Architecture,MAC Sub layer, Addressing Mechanism, Physical Layer; Bluetooth:

Architecture, Bluetooth Layers, Radio Layer, Baseband Layer,L2CAP Connecting devices: Passive

Hubs,Repeaters,Active Hubs,Bridges,Two-Layers Switches,Routers,Three-Layer Switches; Backbone

Networks: Bus Backbone, Star Backbone, Connecting Remote LANs; Virtual LANs: Membership,

Configuration, Communication Between Switches, IEEE Standard, Advantages.

8. Other Technologies 6 Hrs

Cellular telephony: Frequency- reuse Principle, Transmitting, Receiving, Roaming, First Generation,

Second Generation, Third Generation; SONET / SDH: Architecture:Signals,SONET Devices,

Connections, Layers, Path Layer, Line Layer, Section Layer, Photonic Layer, Device-Layer Relationship,

Frames-Frame,Byte,and Bit transmission,STS-1 Frame Format; STS multiplexing: Byte Interleaving,

Concatenated Signal, Add/Drop Multiplexer. ATM: Design goals, problems, architecture, switching, and

11

layers.

Reference Books:

1. Behrouz A. Forouzan - Data Communications and Networking, 4th Edition, Tata McGraw-Hill, 2006

2. Alberto Leon-Garcia and Indra Widjaja - Communication Networks -Fundamental Concepts and Key

architectures, 3rd Edition , Tata McGraw- Hill 2004.

3. William Stallings - Data and Computer Communication, 8th Edition, Pearson Education, 2007.

4. Larry L. Peterson and Bruce S. David - Computer Networks – A Systems Approach, 4 th Edition,

Elsevier , 2007.




Part – C.



Microprocessors


12




Objective: To learn Architecture of Microprocessors and to review number system and data types. The

software section includes many practical concepts and practical software applications. The use of a

practical 80x86 assembler program, the Microsoft MASM Assembler is also covered. The course covers

input/output interface circuits and LSI peripheral devices. The course also covers Microcontrollers.

PART - A

1. Introduction to Microprocessors

6 Hrs

General Architecture of Microcomputer system, Evolution of the Microprocessors Microcomputer

architecture, Register organization of 8086 and 8088 Architecture, Memory address space and data

organization, Segment registers and memory segmentation, Generating Memory address, the stack, Input/

Output address space.

2. 8086/8088 Instruction Set & Assembler Directives

7 Hrs

Machine language instruction format, addressing modes of 8086, Instruction set 8086/8088, Assembler

directives and operators.

3. Art of assembly language programming with 8086/8088 7 Hrs

A few machine level programs, Converting assembly language instructions to machine code,

Programming with an assembler, Assembly level example programs. The PC and its DEBUG program

using Code view/ DEBUG. Assembly Language Program development using MASM.

PART B

4. The 8086 and 8088 Pin configuration and their Memory and Input/Out Interfaces 8 Hrs

8086, and 8088 Microprocessors, Minimum mode and Maximum mode systems, Data bus, Address bus,

Control signals, Interrupt signals, Status signals, DMA Interface signals. Bus cycle and time status. - Read

and write bus cycle.

5. Memory Devices, Circuits and Subsystem design 8 Hrs

Program and Data Storage Memory, Standard EPROM ICs- Quick-pulse programming Algorithm

flowchart, Intelligent Programming Algorithm flow chart. Random Access Read/Write Memories, Static

and Dynamic RAMs, Flash Memory, Block diagram of a flash memory. Wait-state circuitry, 8086/8088

Microcomputer system memory circuitry.

6. Input/output Interface Circuits 4 Hrs

LED, LCD, Key switch, Analog to Digital Converter and Digital to Analog devices interface directly to

13

8086/8088 microprocessors

PART C

7. Special Purpose Programmable Peripheral Devices and their Interfacing 10 Hrs

Programmable Peripheral Input-Output Port 8255, Programmable Interrupt Controller 8259,

Programmable Interval Timer 8253, Programmable Keyboard /Display Interface 8279, Programmable

Communication Interface USART 8251.

8. Micro Controller Introduction (8051) 2 Hrs

Intel’s Family of 8-bit Microcontrollers, Architecture of 8051. Difference between Microprocessor and

Microcontroller.

Reference Books:

1. Walter A. Triebel and Avtar Singh - The 8088 and 8086 Microprocessors - Programming, Interfacing,

Software, Hardware and Applications: Chapter 1 - 1.1, 1.2, Chap 2 - 2.1, 2.2, 2.3, 2.5, 2.11, 2.12, 2.13,

Chap 4 - 4.1, 4.3, Chap 7 - 7.1, 7.2, 7.3, 7.4, 7.5, 7.6, Chap 8 - 8.1, 8.2, 8.3, 8.7, 8.11, Chap 9 - 9.1, 9.2,

9.3, 9.5, 9.6, 9.7, Chap 10 - 10.1, 10.5, 10.11, 10.12, 10.13.

2. A K Ray & K M Bhurchandi - Advanced Microprocessors and Peripherals Chapter 16 – 16.1, 16.2.

3. Ajoy Kumar Ray & Kishor M Bhurchandi - Advanced Microprocessors and Peripherals, Architecture

Programming and Interfacing.

4. K. Udaya Kumar & B.S. Umashankar - Advanced Microprocessors & IBM-PC assembly Language

Programming, TMH 2003.




Part – C.

PART D

MICROPROCESSOR LABORATORY

Note: Develop and execute the following programs using an 8086 Assembly Language. All the programs

to be executed using an assembler like MASM, TASM etc. Programs should have suitable comments.

1. a) Search a key element in a list of ‘n’ 16-bit numbers using the Binary search algorithm.

b) Read the status of eight input bits from the Logic Controller Interface and display ‘FF” if it is

even parity bits otherwise displays 00. Also display number of 1’s in the input data.

2. a) Write ALP Procedure: i. To read a character from the keyboard in the module (1) (in a different

file) ii. To display a character in module (2) (from different file) iii. Use the above two modules to

read a string of characters from the keyboard terminated by the carriage return and print the string

on the display in the next line.

14

b) Perform the following functions using the Logic Controller Interface. i. BCD up-down Counter

ii. Ring Counter.

3. a) Sort a given set of ‘n’ numbers in ascending and descending orders using the Bubble Sort

algorithm.

b) Read the status from the Logic Controller Interface and Implement the following.

PB1 PB0 Operation

0 0 Half Adder

0 1 Half Subtracter

1 0 4:1 MUX

1 1 3:8 Decoder

4. a) Read an alphanumeric character and displays its equivalent ASCII code at the center of the

screen.

b) Display messages FIRE and HELP alternately with flickering effects on a 7-segment display

interface for a suitable period of time. Ensure a flashing rate that makes it easy to read

both the messages (Examiner does not specify these delay values nor it is necessary for the

student to compute these values).

5. a) Reverse a given string and check whether it is a palindrome or not. Accept the string from the

keyboard and Display suitable message on the monitor.

b) Write a program for Decimal Up-Counter from 0000-9999 and display it on Seven Segment

Display Interface. (Examiner does not specify the delay values nor it is necessary for the student

to compute these values).

6. a) Read two strings, store them in locations STR1 and STR2. Check whether they are equal or not

and display appropriated messages. Also display the length of the stored strings.

b) Convert a 16-bit binary value (assumed to be an unsigned integer) to and display it from left to

right and right to left for specified number of times on a 7-segment display interface.

7. a) Write a program for matrix multiplication. Read data from keyboard and display input and

output in matrix form.

b) Interface Keyboard with Seven Segment Display. Read the data from keyboard and Display it

on Seven Segment Display.

8. a) Write a C program to call an assembly language program to compute the factorial of a positive

integer ‘n’ using recursive procedure.

b) Interface Logic Controller with Seven Segment Display. Read Binary data from logic

controller and Convert it BCD and Display it on Seven Segment Display.

9. a) Compute nCr using recursive procedure. Assume that ‘n’ and ‘r’ are non-negative integers.

b) Drive a stepper motor interface to rotate the motor by N steps Clockwise direction and N steps

15

anticlockwise direction (N is specified by the examiner). Introduce suitable delay between

successive steps. (Any arbitrary value for the delay may be assumed by the student).

10. a) Find out whether a given sub-string is present or not in a main string of characters.

b) Scan a 8 x 3 keypad for key closure and to store the code of the key pressed in a memory

location or display on screen. Also display row and column numbers of the key pressed.

11. a) Write a C program to call an assembly language to generate the first ‘n’ Fibonacci numbers.

b) Scan an 8 x 3 keypad for key closure and simulate ADD and SUBTRACT operations as in a

calculator.

12. a) Read the current time from the system and display it in the standard format on the screen.

b) Generate the Sine Wave using DAC interface (The output of the DAC is to be displayed on the

CRO).

13. a) Write a C programs to call an assembly language function to simulate a Decimal Up-counter to

display 0000-9999.

b) Write a program to generate any character (A-Z) using the DAC interface. (The output of the

DAC is to be displayed on the CRO).

14. a) Read a pair of input co-ordinates in BCD and moves the cursor to the specified location on the

screen.

b) Generate a Stair Case (Step Size is given by examiner) waveform using the DAC interface.

The output of the DAC is to be displayed on the CRO.

15. a) Program a C program to call an assembly function to create a file (input file) and to delete an

existing file.

b) Drive an elevator interface in the following way: i). initially the elevator should be in the

ground floor, with all requests in OFF state. ii). When a request is made from a floor, the elevator

should move to that floor, wait there for a couple of seconds, and then come down to ground floor

and stop. If some requests occur during going up or coming down they should be ignored.


In the examination questions must be given on lots. Each student must execute 1 out of 15 selected

questions.

1. Student need to pick the questions from the choices given.

2. 10% modification on each question should be given by the examiner.

3. No change in question permitted.

Marks break up:

Particulars Marks

Correct Program 10

16

Execution 70

Output Format 10

Viva 10

17



Computer Organization




Objective: The course covers the basic principles of computer organization, operation & performance.

This course provides an overview of computer hardware and software and the basic functional units and

the way they are interconnected to form a complete computer system. Machine instructions, Addressing

techniques, Instruction sequencing, I/O organization, Basic processing unit, Memory system, Arithmetic

unit of a computer are presented in this course. An overview of embedded systems is also presented in

this course.

PART – A

1. Basic Structure of Computers 4 Hrs

Computer types, Functional units: Input unit, Memory unit, Arithmetic and logic unit, Output unit,

Control unit, Basic Operational Concepts, Bus Structures, Performance, Processor clock, Basic

performance equation, Pipelining and Superscalar operation, Clock rate, Performance measurement.

2. Machine Instructions and Programs 10 Hrs

Numbers, Arithmetic operations and characters, Memory Locations and Address, Byte addressability,

Big-endian and Little-endian assignments, Word Alignment, Accessing Numbers, Characters and

Character strings, memory Operation, Instruction and Instruction Sequencing, Register Transfer Notation,

Assembly Language Notation, Basic Instruction Types, Instruction Execution & Straight-line sequencing,

Branching, Condition Codes, Generating Memory Addresses, Addressing Modes, implementation of

Variables & Constants, Indirection & pointers, Indexing & Arrays, Relative Addressing, Additional

Modes, Assembly Language: Assembler Directives, Number Notation, Basic Input/output Operations,

Stacks & Queues, Subroutines, Subroutine Nesting & Processor Stack, Parameter Passing, The Stack

Frame.

3. Assessing and Enhancing Performance with Pipelining 6 Hrs

Introduction, Defining performance, Measuring performance, CPU Performance and its factors,

Evaluating performance, Performance of INTEL processors. An Overview of Pipelining:

Designing Instruction set for pipelining, pipeline hazards, structural hazards, data hazards, control

hazards.

18

PART – B

5. Input/output Organization 8 Hrs

Accessing I/O devices, Interrupts : Interrupt Hardware, Enabling & Disabling Interrupt, Handling

Multiple Devices, Controlling Device Requests, Exceptions, Direct Memory Access, Bus Arbitration;

Buses : Synchronous Bus, Asynchronous Bus, Interface Circuits, Parallel Port, Serial Port, Standard I/O

Interfaces, PCI bus, SCSI bus, USB.

6. The Memory System 8 Hrs

Some Basic Concepts: Static Memories, Asynchronous DRAMs, Synchronous DRAMs, Structure of

Larger Memories, Memory System Considerations: Rambus memory, Read-only memory, Speed, Size &

cost. Large and Fast Exploding Memory Hierarchy Introduction, The basics of Caches, Accessing a

cache, Handling Cache Misses, Handling Writes, An example cache: The Intrinsity FastMATH processor,

Designing the Memory System to support Caches.

7. Basic Processing Unit 4 Hrs

Some Fundamental Concepts : Register Transfers, Performing an Arithmetic or Logic operation, Fetching

a Word from Memory, Storing a Word in Memory, Execution of a Complete Instruction, Branch

instruction, Multiple Bus Organization, Hardwired Control, A Complete Processor, Micro programmed

Control.

PART – C

8. Arithmetic 9 Hrs

Addition & Subtraction of Signed Numbers: Addition /Subtraction Logic Unit, Design of fast adder:

Carry-Look-ahead Addition, Multiplication of Positive numbers: Signed-Operand Multiplication, Booth

Algorithm, Fast Multiplication: Bit-pair Recording of Multipliers; Integer division, Floating-point

Numbers & Operations, IEEE Standard for Floating-point Numbers, Arithmetic Operations on Floating-

point Numbers, Implementing Floating-point Operations.

7. Embedded Systems 3 Hrs

Example of Embedded Systems : Microwave Oven, Digital Camera, Home Telemetry; Processor chips

for Embedded Applications : A Simple Microcontroller.

Reference Books:

1. Carl Hamacher, Z Vranesic & S Zaky - Computer Organization, 5th edition, Mc Graw Hill, 2002.

2. David A. Patterson and John L. Hennessy - Computer Organization and Design, 3 rd Edition, Elsevier ,

2005.

3. Morris Mano - Computer System Architecture, 2nd Edition, PHI, 1986.

4. William Stallings - Computer Architecture and Organization, 6th Edition, PHI, 2003.


19



Part – C.

20

Elective-A



Probability Statistics and Queuing




Objective: It gives overview of probability & statistics to computer students. This subject is used in most

of the algorithms in data mining, queue system in processing in computer. Computer scientists need

powerful tools to analyze algorithms and computer systems. Many of the tools necessary for these

analyses have their foundations in probability theory. The performance of an algorithm depends upon the

distributions of input data items. Hence probability distributions of input data become more important. If

storage is dynamically allocated a probabilistic analysis of the storage requirement is more appropriate

than a worst-case analysis.

PART A

1. Introduction, Random Variables and Probability Distributions 11 Hrs

The concept of probability , the axioms of probability , some important theorems on probability,

Assignment of probabilities, Conditional probability , theorems on conditional probability, independent

Events, Bayes theorem. Random variables, Discrete probability distributions, Distributions functions for

discrete random variables, Continuous probability distributions, Distribution functions for continuous

random variables, Joint distributions, Independent random variables.

2. Mathematical Expectation 3 Hrs

Definition, Functions of random variables, some theorems on expectations, The variance and standard

Deviation, Moments, Moment Generating Functions, Covariance, Correlation Coefficient, Skewness and

Kurtosis.

3. Special Probability Distributions 6 Hrs

The Binomial Distributions, The Normal Distributions, The Poisson Distribution, Relations between

different distributions, Central limit distribution, Uniform distribution, Chi-square Distribution,

Exponential distribution, Student’s t Distribution.

PART B

4. Sampling Theory 7 Hrs

Population and sample, Sampling with replacement, Sampling without replacement, the sample mean,

Sampling distribution of means, Sampling distribution of proportions, Sampling distribution of

differences and Sampling distribution of sums, the sample variance, The sample distribution of variances.

21

5. Tests of Hypotheses and Significance 7 Hrs

Statistical Decisions, Statistical hypothesis, Null hypotheses, Tests and hypotheses and significance, type

I and type II errors, level of significance , Test involving the Normal distribution, one-Tailed and Two-

tailed tests, Special tests of significance for large and small samples, the Chi-square test for goodness of

fit.

6. Curve Fitting, Regression and Correlation 6 Hrs

Curve Fitting, The method of least squares, The least squares line, multiple regression, the linear

correlation coefficient, rank correlation, probability interpretation of regression and correlation.

PART C

7. Discrete-Parameter Markov Chains 12 Hrs

Introduction, computation of n-step Transition probabilities , State classifications and limiting

Distributions, Distribution of times between state changes, irreducible finite chains with periodic states,

the M/G/I queuing system, Discrete – Parameter Birth-death processes, Finite Markov chains with

absorbing states.

Reference Books:

1. Murray R Spiegel -“ Probability and statistics”, McGraw Hill , Schaum’s Outline Zseries (chapters

1,2,3,4,5,7,8)

2. Kishore S Trivedi - “ Probability and Statistics with Reliability, Queuing and computer Science

Applications”, Prentice hall of India, 2000 (Chapter 7)

3. Richard A Johnson - Probability and Statistics for Engineers, Pearson Education / Prentice Hall, India,

2002.

4. W.Feller - An introduction to probability theory & its applications, 2 volumes, John Wiley & sons,

Newyork,1968.




Part – C.



22

Soft Computing




Objective: The course aims at giving students the knowledge of soft computing theories, fundamentals of

non-traditional technologies and approaches to solving hard real-world problems, fundamentals of

artificial neural networks, fuzzy sets and fuzzy logic and genetic algorithms.

PART A

1. Neural Networks 8 Hrs

History, overview of biological Neuro-system, Mathematical Models of Neurons, ANN architecture

2. Learning Processes 12 Hrs

Learning rules, Learning Paradigms-Supervised, Unsupervised and reinforcement Learning, ANN

training Algorithms-perceptions, Training rules, Delta, Back Propagation Algorithm, Multilayer

Perceptron Model, Hopfield Networks, Associative Memories, Applications of Artificial Neural

Networks.

PART B

3. Fuzzy Logic 8 Hrs

Introduction to Fuzzy Logic, Classical and Fuzzy Sets: Overview of Classical Sets, Membership

Function, Fuzzy rule generation.

4. Operations on Fuzzy Sets, Fuzzy Arithmetic, Fuzzy Logic, Uncertainty based Information

12 Hrs

Complement, Intersections, Unions, Combinations of Operations, Aggregation Operations. Fuzzy

Numbers, Linguistic Variables, Arithmetic Operations on Intervals & Numbers, Lattice of Fuzzy

Numbers, Fuzzy Equations. Classical Logic, Multivalued Logics, Fuzzy Propositions, Fuzzy Qualifiers,

Linguistic Hedges. Information & Uncertainty, Non specificity of Fuzzy & Crisp Sets, Fuzziness of Fuzzy

Sets.

PART C

5. Introduction of Neuro-Fuzzy Systems 6 Hrs

Architecture of Neuro Fuzzy Networks, Applications of Fuzzy Logic: Medicine, Economics etc.

6. Genetic Algorithms: 6 Hrs

An Overview, Genetic Algorithms in problem solving, Implementation of Genetic Algorithms

Reference Books:

1. Anderson J.A - An Introduction to Neural Networks, PHI, 1999.

23

2. Hertz J. Krogh, R.G. Palmer - Introduction to the Theory of Neural Computation, Addison-Wesley,

1991.

3. G.J. Klir & B. Yuan - Fuzzy Sets & Fuzzy Logic, PHI, 1995.

4. Melanie Mitchell - An Introduction to Genetic Algorithm, PHI, 1998.




Part – C.



24

Operational Research




Objective: This subject provides the basic knowledge of mathematical formation for the linear

programming model. It gives in insight for optimization. It also provides the sensitive analysis. It is

fundamental subject for management studies. It discusses transportation assignment of resources. The

project evaluation and estimation of time is a topic that helps the students in their software development.

PART – A

1. Introduction, Linear Programming – 1 6 Hrs

Introduction: The origin, nature & impact of OR; Defining the problem; Limitation of OR, Application of

Linear Programming. Formulating a mathematical model; Deriving solution from the model; Testing the

model; Preparing to apply the model; Implementation. Introduction to linear programming: Example;

The linear programming (LP) model.

2. LP – 2 Simplex Method – 1 8 Hrs

Simplex method, Assumption of LP; Additional examples. The essence of the simplex method; Setting up

the simplex method; Graphical Solution of LP problem. General formulation of LPP, Slack variable,

surplus variables, Standard form of LPP. Matrix form of LPP. Algebra of the simplex method; The

simplex method in tabular form; special cases such as Alternate optima, degeneracy, unbounded solutions

and non-existing feasible solutions.

3. Simplex Method – 2 6 Hrs

Artificial variable techniques: Big-M method, Two phase method. Adapting to other model forms; Post

optimality analysis; Foundation of the simplex method.

PART - B

4. Simplex Method – 2, Duality Theory 7 Hrs

The revised simplex method, a fundamental insight. The essence of the duality theory; Fundamental

duality theorem, economic interpretation of duality. Primal dual relationship; Duality and simplex

method. Comparison of solutions to the primal and its dual. Rules for obtaining dual optimal solution

from that of primal and conversely. Advantage of dual simplex method over simplex method, Difference

between simplex and dual simplex methods.

5. Duality Theory And Sensitivity Analysis, Other Algorithms For LP 7 Hrs

The role of duality in sensitivity analysis: Changes in the Coefficients ‘cj’, of the objective function,

Change in Component ‘bj’ of Vector b. Addition of new variables, Deletion of existing variable, Addition

25

of new constrain, and Deletion of existing constraint. The essence of sensitivity analysis; Applying

sensitivity analysis. The dual simplex method; parametric linear programming; The upper bound

technique.

6. Transportation and Assignment Problems 6 Hrs

Assignment Models: Introduction, Mathematical formulation of assignment problem, Fundamental

Theorems, Hungarian Method for assignment Problem, Unbalanced assignment problem, sensitivity in

assignment problem, Travelling salesman problem.

The transportation problem; A streamlined simplex method for transportation problem; Matrix form of

transportation problem, tabular representation, special structure of transportation problem, loops in

transportation table and their problem, Transportation Algorithm for minimization problem.

PART –C

7. PERT and CPM 6 Hrs

Introduction, Applications of PERT/CPM, Basic steps in PER/CPM, Network Diagram representation,

Rules for drawing network diagram, Labeling (Fulkerson’s rule), Time estimates and critical path in

network analysis. Optimal duration and minimum duration cost (Crashing). Project Evaluation and

Review Technique: Updating, Resource allocation.

8. Game Theory 6 Hrs

Introduction, characteristics of Games Theory, Minmax (maximin) criterion and Optimal Strategy, Saddle

Point, Optimal strategies and value of Game. Solution of Games with Saddle Point(s). Minimax –

Maxmin Principle for Mixed strategy games, Solution of (mxn) games by linear programming. Principle

of dominance to reduce the size of game, Graphical method.

Reference Books:

1. Hamdy A Taha - Operation Research an Introduction, 8th Edition, Prentice Hall India, 2007.

2. Frederick S. Hillier and Gerald J. Lieberman - Introduction Operation Research – 8th Edition, Tata

McGraw Hill, 2005.

3. Wayne L. Winston - Operation Research Application and Algorithms –4th Edition, Thomson Course

Technology, 2003.

4. S D Sharma – Operation Research, 13th edition, Kedarnath Ramnath & Co.




Part – C.



26

Decision Support Systems




Objective: Decision Support Systems (DSS) are a specific class of computerized information system

that supports business and organizational decision-making activities. A properly-designed DSS is an

interactive software-based system intended to help decision makers compile useful information from raw

data, documents, personal knowledge, and/or business models to identify and solve problems and make

decisions. The course will be self-contained and as part of it students study some of the AI techniques that

are used to build IDSSs including several application areas like Help-desk systems, e-commerce and

Knowledge Management.

PART-A

1. Decision Making and Computerized Support: 8 Hrs

Managers and Decision Making, Managerial Decision Making and Information Systems, Managers and

Computerized Support, Computerized Decision Support and the Supporting Technologies, A frame work

for decision support, The concept of Decision Support systems, Group Decision Support Systems,

Enterprise Information Systems, Knowledge management systems, Expert Systems, Artificial Neural

Networks, Advanced Intelligent Decision Support System, Hybrid Support Systems.

2. Decision Making Systems, Modeling, and Support: 4 Hrs

Introduction and Definitions, Systems, Models, Phases of Decision Making Process, Decision Making:

The Intelligent Phase, Decision Making: The Design Phase, Decision Making: The Choice Phase,

Decision Making: Implementation Phase, how decisions are supported?

3. Decision Support Systems: An Overview: 8 Hrs

DSS Configuration, What is DSS? Characteristics, Capabilities, Components of DSS, The Data

Management Sub System, The Model Management Subsystem, The User Interface subsystem, The

Knowledge Based Management Subsystem, The User, DSS Hardware, DSS Classification.

PART-B

4. Decision Support Systems Development: 8 Hrs

Introduction to DSS development, The Traditional System Development Life cycle, Alternate

Development Methodologies, Prototyping: The DSS Development Methodology, Change Management,

DSS Technology Levels and Tools, DSS Development Platforms, DSS Development Tool Selection,

Team-Developed DSS, End User-Developed DSS, Putting the DSS Together.

5. Collaborative Computing Technologies: Group Support Systems: 4 Hrs

Group Decision Making, Communication and Collaboration, Communication Support, Collaboration

Support: Computer- Supported Cooperative work, Group Support Systems, Group Support Systems

27

Technologies, Group Systems Meeting room and online, Distance Learning, Creativity and Idea

Generation.

6. Enterprise Decision Support Systems: 8 Hrs

Enterprise Information Systems: Concepts and Definitions, The Evolution of Executive and Enterprise

Information Systems, Executives Roles and their Information Needs, Characteristics and capabilities of

Executive Support Systems, Comparing and Integrating EIS and DSS; EIS, Data Access, Data

Warehousing, OLAP, Multidimensional Analysis, Presentation, and the Web; Soft Information in

Enterprise Systems, Organizational DSS, Supply and Value Chains and Decision Support, Supply Chain

Problems and Solutions; Materials Requirement Planning (MRP), Enterprise Resource

Planning/Enterprise Resource Management (ERP/ERM), and Supply Chain Management (SCM)

Systems; Customer Relationship (Resource) Management (CRM) Systems; Emerging Enterprise

Information Systems: Product Lifecycle Management (PLM), Business-Process Management (BPM) and

Business Activity Monitoring (BAM).

PART-C

7. Knowledge-Based Decision Support: A I and Expert Systems: 7Hrs

Concepts and Definitions of Artificial Intelligence, Evolution of Artificial Intelligence, The Artificial

Intelligence field, Basic concepts of Expert Systems, Applications of Expert Systems, Structure of Expert

Systems, How expert systems work? Problem areas suitable for expert systems, Benefits and capabilities

of Expert Systems, Problems and Limitations of Expert Systems, Expert system success factors, Types of

Expert Systems, Expert Systems on Web, Concepts of Knowledge Engineering, Scope and types of

knowledge, Methods of Knowledge Acquisition from experts, Knowledge Acquisition from multiple

experts, Automated Knowledge Acquisition From Data and Documents, Knowledge based verification

and validation, Representation of knowledge, Reasoning in Rule-Based systems, Explanation and

Metaknowledge, Inferencing with Uncertainty, Expert Systems Development, Knowledge acquisition and

the internet.

8. Integration, Impacts, and the Future of Management-Support Systems: 5 Hrs

System Integration: An Overview, Models of MSS integration, Intelligent DSS, Intelligent modeling and

model management, Integration with the Web, Enterprise systems, and Knowledge Management, The

impact of MSS: An Overview, MSS impacts on organizations, Impact on individuals, Decision-Making

and the Manager’s job, Issues of legality, privacy, and ethics, Intelligent Systems and employment levels,

Internet communities, Other societal impacts and the Digital Divide, The future of Management- Support

System.

Reference Books:

1. Efraim Turban & Jay E. Aronson - “Decision Support Systems and Intelligent Systems”, 7th Edition,

Pearson Education, 2006.

28

[Chapter 1: 1.2 – 1.14, Chapter 2 : 2.2 – 2.10 , Chapter 3 : 3.2 – 3.13, Chapter 6 : 6.2 – 6.12, Chapter 7 :

7.2 – 7.10, Chapter 8 : 8.2 - 8.14, Chapter 10 : 10.2 – 10.14, Chapter 11 : 11.2 – 11.13, Chapter 15 : 15.2-

15.15 ]

2. Joseph C. Giarratano & Gary D. Riley -“Expert Systems: Principles and Programming”, 4th Edition,

Thomson Brooks / Cole, 2005.

3. Sprague R.H. Jr and H.J. Watson - “Decision Support Systems”, 4th Edition, PHI, 1996.

4. Effrem G. Mallach -“Decision Support and Data Warehouse Systems”, McGraw-Hill/Irwin, 2000.




Part – C.

29

RV COLLEGE OF ENGINEERING, BANGALORE-59

AUTONOMOUS INSTITUTION UNDER VTU

VI – SEMESTER

INFORMATION SCIENCE AND ENGINEERING


30

R V COLLEGE OF ENGINEERING, BANGALORE – 560059


Computer Networks – II





Objective: The aim of the course is to acquaint students with the advanced concepts, standards and

tendencies of development in the field of computer networks. The course covers Network, Transport and

Application layers. Course also enables the student to understand the advanced topics in computer

networks like administration of computer networks, network security, multimedia networking etc. The

laboratory work helps to better rationalization of lecture material and contribute to formation of practical

skills.

PART – A

1. Packet-Switching Networks 10 Hrs

Network services and internal network operations; Packet network topology; Datagrams and virtual

circuits; Routing in packet networks; Shortest-path routing. Traffic management at the packet level;

Traffic management at the flow level; Traffic management at the flow-aggregate level.

2. TCP / IP 10 Hrs

The TCP / IP architecture; The Internet protocol:IP packet, IP Addressing, IP routing,

CIDR,ARP,RARP,Fragmetation & reassembly. IPv6; User datagram protocol; Transmission control

protocol; Internet routing protocols; Multicast routing; DHCP, NAT, and Mobile IP.

PART – B

3. ATM Networks-2 9 Hrs

What is ATM? Why ATM? BISDN reference mode ATM layer; ATM adaptation layer:

AAL1,AAL2,AAL3/4,AAL5,Signaling AAL, Traffic contracts, Connection Admission Control, and

Traffic Management; ATM signaling: ATM Addressing, UNI signaling, PNNI signaling; PNNI routing;

Classical IP over ATM: a case study.

4. QoS, Resource Allocation, VPNs, Tunneling, Overlay Networks 7 Hrs

Overview of QOS; Integrated services QoS; Differentiated services QoS; Resource allocation. Virtual

Private Networks; Multiprotocol Label switching; Overlay networks.

31

5. Compression of Digital Voice and Video 4 Hrs

Overview of data compression; How it is important in Computer Networks. Case Study: FAX

compression for transmission.

PART – C

6. VoIP, Multimedia Networking : 6 Hrs

Overview of IP telephony; VoIP signaling protocols; Real-Time media transport protocols: RTP, RTCP,

RTSP; Distributed multimedia networking; SCTP.

7. Network Management, Security: 6 Hrs

Network management overview; SNMP; Structure of Management information; MIB; Remote network

monitoring. Security and cryptographic algorithms; Security protocols; Cryptographic algorithms.

Reference Books:

1. Alberto Leon-Garcia and Indra Widjaja - Communication Networks –Fundamental Concepts and Key

architectures, 2nd Edition, Tata McGraw-Hill, 2004. (Chapters 7, 8, 9, 11, Appendix B)

2. Nader F. Mir - Computer and Communication Networks, Pearson Education, 2007. (Chapters 12, 16,

17, 18, 19, 20)

3. Behrouz A. Forouzan - Data Communications and Networking, 4th Edition, Tata McGraw-Hill, 2006.

4. William Stallings - Data and Computer Communication, 8th Edition, Pearson Education, 2007.




Part – C.

PART – D

Simulation Exercises

Note: The following experiments shall be conducted using NETSIM simulator. Students can also

simulate using any other simulators like NS/OPNET.

CYCLE - I

1. Simulate 3 nodes P-to-P network with duplex links between them. Set the queue size and vary

Bandwidth and find number of packets dropped.

2. Simulate the different types of Internet Traffic such as FTP and TELNET over a network and Analyze

the throughput.

3. Simulate the transmission of PING messages over a network topology consisting of 6 nodes and Find

the number of packets dropped due to congestion.

4. Simulate Ethernet LAN using N nodes and set multiple traffic nodes and plot congestion window For

different source / destination.

5. Simulate Ethernet LAN using N nodes (5-10), change error rate and data rate and compare

32

throughput.

6. Simulate simple ESS and with transmitting nodes in Wire – Less LAN by simulation and Determine

the performance with respect to transmission of packets.

7. Simulate 6 node P-to-P networks with links connected as follows:

N0-n2 ,n1-n2, n2-n3, n3-n5,n4-n5 apply TCP agent between n0-n2 and UDP agent between n2-n5 .

Apply relevant application over TCP and UDP agents changing parameter and determine the number of

packet sent by TCP / UDP.

CYCLE - II

Implement the following in C/C++:

1. Write a program for error detecting code using CRC-CCITT (16 bits)

2. Write a program for frame sorting technique used in buffers

3. Write a program for distance vector algorithm to find shortest path for transmission

4. Write a program for simple RSA algorithm to encrypt and decrypt the data.

5. Write a program for congestion control using leaky bucket algorithm.

6. Using TCP/IP sockets write a client server program to make the client send the file name and to make

the server sent back the contents of the requested file if present.

7. Implement above program using as message queues or FIFO as IPC channels

8. Write a program hamming code generation for error detection and correction


1. Student need to pick a question from the choices given in each part.

2. 10% modification on each question should be given by the examiner

3. No change in question is permitted

Marks break up:

Particulars Marks

Correct program 10

Execution 70

Output format 10

Viva 10

33



Software Engineering




Objective: Software Engineering is an engineering discipline whose focus is the cost-effective

development of high quality software systems. Software is abstract and intangible. New methods and

techniques are needed to control the complexity inherent in large software systems and also focus on

management related issues and topics, a thorough study of all the phases of software development is

presented along with the case studies and examples to know very well the reality of the software

development, to check the software quality and quantity, verification and validation. Finally the course

also throws a light on the management study for project development.

PART – A

1. Overview 6 Hrs

Introduction: FAQ's about software engineering, Professional and ethical responsibility. Socio-Technical

systems: Emergent system properties; Systems engineering; Organizations, people and computer systems;

Legacy systems.

2. Critical Systems, Software Processes 7 Hrs

Critical Systems: A simple safety-critical system; System dependability; Availability and reliability.

Software Processes: Models, Process iteration, Process activities; The Rational Unified Process;

Computer-Aided Software Engineering.

3. Requirements 7 Hrs

Software Requirements: Functional and Non-functional requirements; User requirements; System

requirements; Interface specification; The software requirements document. Requirements Engineering

Processes: Feasibility studies; Requirements elicitation and analysis; Requirements validation;

Requirements management.

PART - B

34

4. Process models, Project Management 7 Hrs

Process Models: Prescriptive Models; The Waterfall Model; Incremental Process Models; Evolutionary

Process Models; Specialized Process Models; The Unified Process. Project Management: The

Management Spectrum; The People; The Product; The Process; The Project; The W5HH Principle;

Critical Practices.

5. Software Design 7 Hrs

Architectural Design: Architectural design decisions; System organization; Modular decomposition

styles; Control styles. Object-Oriented design: Objects and Object Classes; An Object-Oriented design

process; Design evolution.

6. Development 6 Hrs

Rapid Software Development: Agile methods; Extreme programming; Rapid application development.

Software Evolution: Program evolution dynamics; Software maintenance; Evolution processes; Legacy

system evolution.

PART – C

7. Verification and Validation 6 Hrs

Verification and Validation: Planning; Software inspections; Automated static analysis; Verification and

formal methods. Software testing: System testing; Component testing; Test case design; Test automation.

8. Management 6 Hrs

Project Management: The Management activities; Project planning; Project scheduling; Risk

management. Managing People: Selecting staff; Motivating people; Managing people; The People

Capability Maturity Model. Software Cost Estimation: Productivity; Estimation techniques; Algorithmic

cost modeling, Project duration and staffing.

Reference Books:

1. Ian Sommerville - Software Engineering, 8th edition, Person Education Ltd, 2007.

(Chapters-: 1, 2, 3, 4, 5, 6, 7, 8, 11, 14, 17, 21, 22, 23, 25, 26)

2. Roger.S.Pressman - Software Engineering-A Practitioners approach, 6 th edition, McGraw-Hill, 2005.

(Chapters-: 3, 21)

3. James F Peters -Software Engineering-An Engineering Approach, Witold Pedryz, John Wiley.

4. Waman S Jawadelias - Software Engineering Principles & Practice, The Mc-Graw Hill Companies.




Part – C.

35



File Structures



Hrs/Week : 3+1+3 Exam Hrs : 3+3


Objective: This subject covers fundamental file handling concepts and the fundamental file structuring

concepts. This course also demonstrates how the object oriented approach can be successfully applied to

complex implementation problem, dealing with the concept of design and efficient file structures that are

easy for application programmers to use. This subject provides the conceptual tools that enables to think

through alternative file structure designs that apply the task at hand, and gives an extensive discussion of

object-oriented approach to represent information and algorithms and features of C++.

PART – A


File Structures: Definition of file structures, Overview of file structure design, Fundamental File

Operations: Physical Files and Logical Files, Opening Files, Closing Files, Reading and Writing, Seeking,

Special Characters. Review of Unix Directory Structure: Physical devices and Logical Files, File-related

Header Files, Secondary Storage and System Software: Disks, Magnetic Tape, Disk versus Tape. CD-

ROM: Introduction, Physical Organization, Strengths and Weaknesses; Storage as Hierarchy, A journey of

a Byte, Buffer Management.

2. Fundamental File Structure Concepts, Managing Files of Records 6 Hrs

Field and Record Organization, Using Classes to Manipulate Buffers, Using Inheritance for Record

Buffer Classes, Managing Fixed Length, Fixed Field Buffers, An Object-Oriented Class for Record Files,

Record Access, More about Record Structures, Encapsulating Record Operations in a Single Class, File

Access and File Organization.

3. Organization of Files and Indexing 8 Hrs

Over view of Data Compression, Reclaiming Space in files, Internal Sorting and Binary Searching, Key

sorting. Indexing: What is an Index? A Simple Index for Entry-Sequenced File, Using Template Classes

in C++ for Object I/O, Object-Oriented support for Indexed, Entry-Sequenced Files of Data Objects,

Indexes that are too large to hold in Memory, Indexing to provide access by multiple keys, Retrieval

Using Combinations of Secondary Keys, Improving the Secondary Index structure: Inverted Lists,

36

Selective indexes, binding.

PART – B

4. Co sequential Processing and Sorting of Large files 5 Hrs

Co sequential Processing: A Model for Implementing Co sequential Processes, Application of the

Model to a General Ledger Program, Extension of the Model to include Multiway Merging, Sorting Of

Large Files: A Second Look at Sorting in Memory, Merging as a Way of Sorting Large Files on Disk.

5. Multi-Level Indexing and B-Trees 8 Hrs

Introduction: The invention of B-Tree, Statement of the problem, Indexing with Binary Search Trees;

Multi-Level Indexing, B-Trees, Example of Creating a B-Tree, An Object-Oriented Representation of

B-Trees, B-Tree Methods; Nomenclature, Formal Definition of B-Tree Properties, Worst-case Search

Depth, Deletion, Merging and Redistribution, Redistribution during insertion; B* Trees, Buffering of

pages; Virtual B-Trees; Variable-length Records and keys.

6. Indexed Sequential File Access and Prefix B + Trees 7 Hrs

Indexed Sequential Access, Maintaining a Sequence Set, Adding a Simple Index to the Sequence Set, The

Content of the Index: Separators Instead of key. The Simple Prefix B+ Tree and its maintenance, Index

Set Block Size, Internal Structure of Index Set Blocks: A Variable-order B- Tree, Loading a Simple Prefix

B+ Trees, B-Trees, B+ Trees and Simple Prefix B+ Trees in Perspective.

PART – C

7. Hashing 7 Hrs

Introduction, A Simple Hashing Algorithm, Hashing Functions and Record Distribution, How much Extra

Memory should be used?, Collision resolution by progressive overflow, Buckets, Making deletions, Other

collision resolution techniques, Patterns of record access.

8. Extendible Hashing 5 Hrs

How Extendible Hashing Works, Implementation, Deletion, Extendible Hashing Performance, Alternative

Approaches.

Reference Books:

1. Michael J. Folk, Bill Zoellick, Greg Riccardi - File Structures-An Object Oriented Approach with C++,

3rd Edition ,Addison-Wesley, 1998. (Chapters 1 to 12 excluding 1.4, 1.5, 5.5, 5.6, 8.6, 8.7, 8.8)

2. K.R. Venugopal, K.G. Srinivas, P.M. Krishnaraj -File Structures Using C++, Tata McGraw-Hill, 2008.

3. Scot Robert Ladd - C++ Components and Algorithms, BPB Publications, 1993.

4. Raghu Ramakrishan and Johannes Gehrke - Database Management Systems, 3rd Edition, McGraw

Hill, 2003.


37



Part – C.

PART – D

General Guidelines:

1. The Mini project shall be carried out individually. The students will pick a topic in consultation with

faculty. The mini project must be carried out in the college only.

2. The department must ensure that all the projects are implemented.

3. All possible operations relating to files like open, close, read, retrieve, delete and update needs to be

implemented and demonstrated in all the projects.

CYCLE - I

Note: Methods should be included for initialization, assignment and modifying values. Provide methods

to write the member values to the output stream suitably formatted. Add methods to store objects as

records in files and load objects from the file using buffering. Design a suitable IO BUFFER class

hierarchy. Add pack and unpack methods to the class. For all the programs assume variable–size fields

with delimiters, in affixed length record structure for the data file.

1. Design a class called STUDENT. Each object of this class represents information about a single

student. Members should be included for student USN (University Seat Number), Name, Address,

Semester, Branch etc.

2. Consider a Banking system. Create a class called DEPOSITOR. Each object of this class represents

information about a single depositor. Members should be included for depositor name, Acc number,

Address, Branch name etc.

3. Consider a book dealership enterprise. Create a class called CATALOG. Each object in this class

represents information about a single Book. Member should be included for Book_id, Title, Author_id,

Publisher_id, etc.

CYCLE - II

Note:

1. One of the following mini projects is to be completed by each student.

2. The following specification is common to all projects.

Design a class called STUDENT. Each object of this class represents information about a single student.

Members should be included for student USN (University Seat Number), Name, Address, Semester,

Branch etc. Methods should be included for initialization, assignment and modifying values. Provide

methods to write the member values to the output stream suitably formatted. Add methods to store objects

as records in files and load objects from the file using buffering. Design a suitable IO BUFFER class

38

hierarchy. Add pack and unpack methods to class STUDENT. For all the mini projects, assume variable–

size fields with delimiters, in affixed length record structure for the data file.

PROJECT – 1: Develop an indexed file for the student record file with the USN as the key and name as

the secondary key. Write a driver program to create an index file from the student record file created in

PART – 1. Prompt for USN and display of the record. Modify the program so that if a secondary key

value is entered by the user and if there are multiple matching records, then all the records are displayed.

1. Select any other secondary key of your choice and demonstrate the retrieval using combinations of

secondary keys.

2. Use inverted list structure to rearrange the secondary key index file when new insertion is to be done.

PROJECT – 2: Develop an application that produces student’s transcripts. Use Cosequential processes

and Master Transaction Process to develop this. For each student record (Master) print the student

information and list of all subjects (transactions) taken by the student. As input, use file of STUDENT

records sorted by USN.

1. Demonstrate 4-way merge.

2. Sort the data file using heap-sort and demonstrate the 4 phases of merging using heap-sort.

PROJECT – 3: Add B – tree indexes to the data files created in PART – 1. Use Class BTREE to create

B-tree index of the student record file with USN as key. Write a driver program to create a B-tree file

from an existing student record file. Demonstrate the retrieval information based on USN and print all

objects that match it.

1. Calculate and display the average space utilization.

2. Invoke a method to indicate the level of collapse.

3. Invoke a method to indicate the level splitting.

PROJECT – 4: Design and implement class B+ Tree, which puts together the classes sequence set and

B-tree. B-Tree characteristics should be maintained in the index set as before; the sequence set should be

maintained so that blocks are always at least half full. Consider the following suggestions:

1. Do not compress the keys as you form the separators for the index set.

2. Keep B-tree nodes in the same file as the sequence set blocks. The header block should contain a

reference to the root of the B-tree as well as a reference to the beginning of the sequence set.

PROJECT – 5: Develop a hashed index of the student record file with the USN as the key. Write a

driver program to create a hashed file from an existing student record file. Demonstrate the recursive

collapse of directory over more than one level.

1. Demonstrate doubling of the directory size.

2. Display the space utilization for buckets and directory size.

39


Particulars Marks

Demonstration of the project 50

Implementation of the specified modification 30

Subject Viva 20

40



System Software




Objective: System software is the interface between hardware and software. This subject gives the

knowledge of system software design. Assemblers, compilers, loaders, linkers and macro processors are

designed for a fictitious system SIC and SIC/XE machine. Case study of the existing software design is

also provided. Editor design is provided as basic design system software.

PART - A

1. Machine Architecture 4 Hrs

Introduction, System Software and Machine Architecture, Simplified Instructional Computer (SIC) - SIC

Machine Architecture, SIC/XE Machine Architecture, SIC Programming Examples, Traditional (CISC)

Machines - RISC

2. Assemblers 10 Hrs

Basic Assembler Function - A Simple SIC Assembler, Assembler Algorithm and Data Structures, Machine

Dependent Assembler Features - Instruction Formats & Addressing Modes, Program Relocation, Machine

Independent Assembler Features – Literals, Symbol-Definition Statements, Expression, Program Blocks,

Control Sections and Programming Linking, Assembler Design Operations - One-Pass Assembler, Multi-

Pass Assembler

3. Loaders and Linkers 6 Hrs

Basic Loader Functions - Design of an Absolute Loader, A Simple Bootstrap Loader, Machine-Dependent

Loader Features – Relocation, Program Linking, Algorithm and Data Structures for a Linking Loader,

Machine-Independent Loader Features - Automatic Library Search, Loader Options, Loader Design

Options - Linkage Editor, Dynamic Linkage

PART – B

4. Editors and Debugging Systems 3 Hrs

Text Editors - Overview of Editing Process, User Interface, Editor Structure, Interactive Debugging

Systems - Debugging Functions and Capabilities, Relationship With Other Parts Of The System, User

Interface Criteria

41

5. Macro Processor 5 Hrs

Basic Macro Processor Functions - Macro Definitions and Expansion, Macro Processor Algorithm and

Data Structures, Machine-Independent Macro Processor Features - Concatenation of Macro Parameters,

Generation of Unique Labels, Conditional Macro Expansion, Keyword Macro Parameters, Macro

Processor Design Options - Recursive Macro Expansion, General-Purpose Macro Processors, Macro

Processing Within Language Translators,

6. Compilers: 12 Hrs

Basic Compiler Function – Grammars, Lexical Analysis, Syntactic Analysis, Code Generation, Machine

Dependent Compiler Features - Intermediate Form Of The Program, Machine-Dependent Code

Optimization, Machine Independent Compiler Features - Structured Variables, Machine Independent

Code Optimization, Storage Allocation, Block Structured Languages, Compiler Design Options -

Division Into Passes, Interpreters

Reference Books:

1. Leland.L.Beck - System Software, 3rd Edition, Addison-Wesley, 1997.

2. D.M.Dhamdhere - System Programming and Operating Systems, 2nd Edition, TMH, 1999.


Four questions from Part – A, Four questions from Part – B are to be set. Students will be asked to answer

five questions choosing at least two questions from each part.

42

Elective-B



Artificial Intelligence and Neural Networks




Objective: The course provides a thorough introduction to the backed methods of this new field.

Introduce the main fundamental principles and techniques of neural network systems. Investigate the

principal neural network models and applications. Artificial Intelligence provides a strong foundation of

fundamental concepts, lot of applications is also discussed in the subject.

PART-A


Intelligent Agents – Agents and environments - Good behavior – The nature of environments – structure

of agents - Problem Solving - problem solving agents – searching for solutions – uniformed search

strategies - avoiding repeated states – searching, partial information.

2. Searching techniques 10 Hrs

Informed search and exploration – Informed search strategies – heuristic function – local search

algorithms and optimistic problems – local search in continuous spaces – online search agents and

unknown environments - Constraint satisfaction problems (CSP) – Backtracking search and Local search

for CSP – Structure of problems - Adversarial Search – Games – Optimal decisions in games – Alpha –

Beta Pruning – imperfect real-time decision – games that include an element of chance.

PART-B

3. Introduction to Neural Network 7 Hrs

What is a Neural Network, Human Brain, Models of Neuron, Neural Networks viewed as directed graphs,

Feedback, Network Architectures, Knowledge representation, Artificial Intelligence and Neural

Networks.

4. Learning Processes 6 Hrs

Introduction, Error-correction learning, Memory-based learning, Hebbian learning, Competitive learning,

Boltzmann learning, Credit Assignment problem, Learning with a Teacher, learning without a Teacher,

Learning tasks, Memory, Adaptation.

5. Learning Processes – 2, Single Layer Perceptrons 7 Hrs

43

Statistical nature of the learning process, Statistical learning theory, approximately correct model of

learning. Single Layer Perceptrons: Introduction, Adaptive filtering problem, Unconstrained optimization

techniques, Linear least-squares filters, Least-mean square algorithm, Learning curves, Learning rate

annealing techniques, Perceptron, Perceptron convergence theorem, Relation between the Perceptron and

Bayes classifier for a Gaussian environment.

PART-C

6. Multilayer Perceptrons – 1 6 Hrs

Introduction, Some preliminaries, Back-propagation Algorithm, Summary of back propagation algorithm,

XOR problem, Heuristics for making the back-propagation algorithm perform better, Output

representation and decision rule, Computer experiment, Feature detection, Back-propagation and

differentiation.

7. Multilayer Perceptrons – 2 6 Hrs

Hessian matrix, Generalization, approximation of functions, Cross validation, Network pruning

techniques, virtues and limitations of back- propagation learning, Accelerated convergence of back

propagation learning, supervised learning viewed as an optimization problem, Convolution networks.

Reference Books:

1. Stuart Russell, Peter Norvig - Artificial Intelligence A Modern Approach, 2nd Edition, Pearson

Education, 2003.

2. Simon Haykin: Neural Networks- A Comprehensive Foundation, 2nd Edition, Pearson Education, 1999.

(Chapters 1.1-1.8, 2.1-2.15, 3.1-3.10, 4.1-4.19, 5.1-5.14)

3. B Kosko. Neural Networks and Fuzzy systems - A Dynamical System Approach, Prentice Hall 1991.

4. B.Yegnanarayana - Artificial Neural Networks, PHI, 2001.




Part – C.


44


Distributed Computing




Objective: The main goal of a distributed computing system is to connect users and resources in a

transparent, open, and scalable way. Ideally this arrangement is drastically more fault tolerant and more

powerful than many combinations of stand-alone computer systems. In this course students will learn

about distributed systems, key features, design goal and design issues involved in the distributed systems

and describe the models of distributed system structure. The course helps in understanding the design of

many different types of distributed computing systems challenges to overcome in successfully designing

one.

PART-A


What is Distributed Computing Systems?, Evolution of Distributed Computing System, Distributed

Computing System Models, Why are Distributed Computing Systems gaining popularity?, What is

Distributed Operating System?, Issues in Designing a Distributed Operating System, Introduction to

Distributed Computing Environment (DCE).

2. Message Passing 7 Hrs

Desirable Features of a good message passing system, Issues in IPC by Message Passing,

Synchronization, Buffering, Multidatagram Messages, Encoding and Decoding of Message Data, Process

Addressing, Failure Handling, Group Communication, Case Study: 4.3 BSD UNIX IPC Mechanism.

3. Remote Procedure Calls 8 Hrs

The RPC Model, Transparency of RPC, Implementing RPC Mechanism, Stub Generation, RPC

Messages, Marshaling Arguments and Results, Server Management, Parameter - Passing Semantics, Call

semantics, Communication Protocols for RPCs, Complicated RPCs, Client-Server Binding, Exception

Handling, Security, Case Studies: Sun RPC.

PART-B

4. Distributed Shared Memory 7 Hrs

General Architecture of DSM Systems, Design and Implementation Issues of DSM, Granularity, Structure

of Shared Memory Space, Consistency Models, Replacement Strategy, Thrashing, Other approaches to

DSM, Heterogeneous DSM, Advantages of DSM.

5. Synchronization 7 Hrs

45

http://en.wikipedia.org/wiki/Stand-alone

http://en.wikipedia.org/wiki/Fault_tolerant

http://en.wikipedia.org/wiki/Scalable

http://en.wikipedia.org/wiki/Transparency_(computing)

Clock Synchronization, Event Ordering, Mutual Exclusion, Dead Lock, Election Algorithms.

6. Resource Management 6 Hrs

Desirable Features of a Good Global Scheduling Algorithm, Task Assignment Approach,

Load – Balancing Approach, Load – Sharing Approach.

PART-C

7. Process Management 4 Hrs

Process Migration, Desirable features of a good process migration mechanism, minimal interference,

process migration mechanisms, freezing and restarting a process, Address space transfer mechanism,

Process migration in heterogeneous systems, Threads, models for organizing threads, issues, scheduling.

8. Distributed File Systems 8Hrs

Desirable Features of a Good Distributed File System, File models, File–Accessing Models,

File – Sharing Semantics, File – Caching Schemes, File Replication, Fault Tolerance, Atomic

Transactions, Design Principles, Case Study: DCE Distributed File Service.

Reference Books:

1. Pradeep. K. Sinha - “Distributed Operating System: Concepts and Design”, PHI, 2007. [Chapter 1: 1.1-

1.7, Chapter 3: 3.2-3.11, Chapter 4: 4.2-4.15, 4.20, Chapter 5: 5.2-5.11, Chapter 6: 6.2-6.6, Chapter 7:

7.2- 7.5, Chapter 8: 8.2-8.3, Chapter 9: 9.2- 9.11].

2. Andrew S. Tanenbaum and Maarten VanSteen - “Distributed Systems – Principles and Paradigms”, 2nd

Edition, PHI, 2007.

3. Andrew S. Tanenbaum - “Distributed Operating System”, Pearson Education, 2008.

4. Ajay D Kshemakalyani, Mukesh Singhal - “Distributed Computing – Principles, Algorithms and

Systems”, Cambridge, 2008




Part – C.

46



Advanced DBMS




Objective: The database is now the underlying framework of the Information System, and has

fundamentally changed the way many organizations operate. This course aims at providing the students

with an overview of object oriented database, object-relational database with an emphasis on the Web as a

Database Application Platform with other emerging technologies. The course also exposes the student to

the architecture of advanced DBMS by using a realistic worked example based on integrated case studies.

PART-A

1. Introduction to Object DBMS 8 Hrs

Advanced Database Applications, Weaknesses of RDBMS, Object-Oriented Concepts, Abstraction,

Encapsulation, & Information Hiding, Objects & attributes, Object identity, Methods & Messages,

Classes, Subclasses, Superclasses & Inheritance, Overriding & Overloading, Polymorphism & Dynamic

binding, Complex Objects, Storing Objects in Relational Database, Mapping classes to Relations,

Accessing Objects in the Relational Database, Next Generation Database Systems.

2. Concepts And Design-- Object-Oriented Database

12 Hrs Introduction to Object-Oriented Data Models and DBMS’s, Persistent Programming

Languages, Alternative Strategies for Developing an OODBMS, OODBMS Perspectives, Pointer

Swizzling Techniques, Accessing an Object, Persistence, Persistence Schemas, Orthogonal Persistence,

Issues in OODBMSs, Transactions, Versions, Schema Evolution, Architecture, Benchmarking, The

OODBMS Manifesto, Advantages & Disadvantages of OODBMSs, Advantages, Disadvantages,

OODBMS Design.

PART-B

3. Object-Relational DBMS 10 Hrs

Introduction to Object-Relational Database Systems, Third generation Database Manifestos, Postgres-An

early ORDBMSs, Objectives of Postgres, Abstract Data Types, Relations & Inheritance, Object Identity,

SQL3, Row Types, User-Defined Types, User-Defined Routines, Polymorphism, Reference Types &

Object Identity, Subtypes & Super types, Creating Types, Querying Data, Collection Types, Persistent

Stored Modules, Triggers, Large Objects, Recursion, Sql3 & OQL, Query Processing & Optimization,

Object-Oriented Extension in Oracle, User-Defined Data Types, Manipulating Object Tables, Object

47

Views, Privileges Comparison of ORDBMS and OODBMS

4. Emerging Trends 10 Hrs

Web Technology & DBMS, Introduction to the Internet & web, Internets & Extranets, e-Commerce & e-

Business, The Web, HTTP, HTML, Uniform Resource Locators, Static and Dynamic Web Pages, The

Web as a Database Application Platform, Requirements of Web-DBMS Integration, Web-DBMS

Architecture, Advantages & Disadvantages of the Web-DBMS Approach, Approaches to Integrating the

web & ADBSs, Scripting Languages, JavaScript & Jscript, VBScript, Perl & PHP, Common Gateway

Interface, Passing Information to the CGI Script, Advantages & Disadvantages of CGI, HTTP Cookies,

Extending the Web Server, Netscape API, Comparison CGI & API, Java, JDBC, SQLJ, Comparison of

JDBC & SQLJ, Java Servlets, Java Server Pages, Microsoft’s Web Solution Platform, Universal Data

Access, Active Server Pages & ActiveX Data Objects, Remote Data Services, Comparison of ASP & JSP,

Microsoft Access & Web Page Generation, The Future of ASP & ADO, Oracle Internet Platform.

PART-C

5. Distributed Databases and Client Server Architecture 6 Hrs

Distributed Database Concepts, Data Fragmentation, Replication and Allocation Techniques for

Distributed Database Design, Types of Distributed Database Systems, Query Processing in Distributed

Databases, Overview of Concurrency Control and recovery in Databases, An Overview of 3 – Tier Client

Server Architecture, Distributed Databases in ORACLE.

6. Security, Advanced Modeling and Distribution 6 Hrs

Introduction to Data Security Issues, Discretionary Access Control Based on Granting and revoking

Privileges, Mandatory Access Control and Role Access Control for Multilevel Security Introduction to

Statistical Database Security and Flow Control, Encryption and Public Key Infrastructures, Privacy Issues

and Preservation, Challenges of Database Security .

Reference Books:

1. Thomas Connolly And Carolyn Begg - ‘Database systems’, 3rd Edition, Pearson Education, 2005.

(Chapters 24, 27, 28, 30)

2. ElmaSri and Navathe - ‘Fundamentals of Database Systems’, 4 th Edition, Pearson Education, 2003.

(Chapters 21, 23, 24, 25, 30)

3. RaghuRamakrishnan and Johannes Gerhke, ‘Database Management Systems’, 3rd Edition, McGraw

Hill, 2003.

4. Silberchatz, Korth and Sudarshan - ‘Database Systems Concepts’, 4th Edition, McGraw Hill, 2002.




48

Part – C.



Java and J2EE




Objective: This course introduces the students to basic features of Java language, learn its syntax, idioms,

patterns, styles and become comfortable with object oriented programming and Learn to think in objects.

The syllabus also introduces the essentials of the Java class library, threads and exceptions, Event driven

Graphical User Interface (GUI) programming, role of J2EE in development of enterprise software in Java

language, and to understand how J2EE facilitates integration of java components with non-Java systems

including databases and World Wide Web using servlets and JSP. The course also focus on writing code

that is legible, maintainable, reusable, fast, and efficient for developing stand alone and web applications.

PART-A

1. Introduction to Java 8 Hrs

Java Language introduction, Java features, why Java is important to internet, Java Language Introduction-

Hello World, Lexical Issues, Java class Libraries, Variables, Data Types- Simple Types, Type conversion,

Arrays. Operators, Flow Control-Branching, Looping, Classes-Object References, Instance Variables,

The new operator, The Dot(.) Operator, Method Declaration, Method Calling, Constructors, Method

Overloading, Inheritance, Method Overriding, Dynamic Method Dispatch, Abstract, Packages and

Interfaces- Packages, Interfaces.

2. Java Classes 12 Hrs

String handling- Constructors, String syntax, Character Extraction, Comparison, String Copy

Modifications, Exception Handling-Exception Types, Uncaught Exceptions, Try and catch, Multiple catch

Clauses, Nested try Statements, Exception sub Classes, Threads and Synchronization- Single Threaded

Event Loop, The Java Thread Model, Thread class, Runnable Interface, Thread Priorities,

Synchronization, Inter-Thread Communication, Thread API Summary. Utilities- Enumerations, Simple

type Wrappers, runtime, Input/ Output- File, Input Stream, Output Stream, File Streams.

49

PART – B

3. Introduction to Java GUI 8 Hrs

Applets: Applet Basics, Architecture, Applet Lifecycle, repaint(), update, HTML APPLET Tags, passing

parameters to Applets. AWT: AWT classes, Window fundamentals. Swings: Introduction to Swings,

JApplet, JFrame and JComponent, Icons & labels, Handling Threading issues, Text Fields, Buttons.

4. J2EE and JDBC Concepts 12 Hrs

Overview of J2EE and J2SE, J2EE best Practices, Enterprise Application strategy, Enterprise Application,

clients, session Management, Web Tier & JSP, EJB Tier. The Concept of JDBC; JDBC Driver Types;

JDBC Packages; A Brief Overview of the JDBC process; Database Connection; Associating the

JDBC/ODBC Bridge with the Database; Statement Objects; Result Set; Transaction Processing;

Metadata, Data types; Exceptions.

PART – C

5. Servlets and JSP 12 Hrs

Background, The Life Cycle of a Servlet; servelet configuration, Reading/Sending data, working with

Cookies – Cookie class and its methods, Session Tracking- methods used in session tracking. Java Server

Pages (JSP) installation, JSP Tags, Tomcat-starting and stopping server, Request String, User Sessions,

Cookies, Session Objects.

Reference Books:

1. Herbert Schildt - Java The Complete Reference J2SE, 5 th Edition, Tata McGraw Hill, 2007.

(Chapters 1,2,3,4,5,6,7.1-7.4, 8,9,10,11,12.1,12.2, 13.1-13.5, 15, 16.1,16.4,16.5, 21.1-21.8, 23.1, 23.2,

29.1 to 29.6)

2. Jim Keogh: J2EE - The Complete Reference, Tata McGraw Hill, 2007. (Chapters 1.6, 3.1 – 3.6, 6, 10,

11)

3. Bruce Eckel: Thinking in Java, 3rd Edition, Pearson Education.

4. E.Balagurusamy, Programming with Java, 3rd Edition, McGraw Hill.




Part – C.

ELECTIVE-C



Digital Image Processing




Objective: Introduce the student to analytical tools and methods which are currently used in digital image

processing as applied to image information for human viewing. Students Understands the fundamental

algorithms and how to implement them.

PART - A

1. Digital image fundamentals 10 Hrs

Representation - elements of visual perception - simple image formation model - Image sampling and

quantization - basic relationships between pixels - imaging geometry. Review of matrix theory results:

Row and column ordering - Toeplitz, Circulant and Block matrices. Review of Image transforms: 2D-

DFT, FFT, Walsh, Hadamard, Haar, DCT and Wavelet transforms.

2. Image enhancement 10 Hrs

Spatial domain methods: point processing - intensity transformations, histogram processing, image

subtraction, image averaging; Spatial filtering- smoothing filters, sharpening filters. Frequency domain

methods: low pass filtering, high pass filtering, homomorphic filtering. Generation of spatial masks from

frequency domain specifications.

PART – B

3. Image restoration 10 Hrs

Degradation model - Diagonalization of circulant and Block circulant matrices - Algebraic approaches-

Inverse filtering - Wiener filter – Constrained; Least squares restoration - Interactive restoration -

Geometric transformations. Fundamentals of color image processing: color models - RGB, CMY, YIQ,

HIS - Pseudo color image processing - intensity slicing, gray level to color transformation.

4. Image compression: Fundamentals- redundancy 10 Hrs

Coding, inter pixel, psycho visual, fidelity criteria, Models, Elements of information theory, Error free

compression- variable length, bit plane, lossless predictive, Lossy compression- lossy predictive,

transform coding. Fundamentals of JPEG, MPEG, Fractals.

PART - C

5. Image segmentation 12 Hrs

Detection of discontinuities - point, line and edge and combined detection ; Edge linking and boundary

description - local and global processing using Hough transform Thresholding - Region oriented

segmentation - basic formulation, region growing by pixel aggregation, region splitting and merging - Use

of motion in segmentation. Fundamentals of Representation and Description.

Reference Books:

1. Rafel C Gonzalez and Richard E Woods - Digital Image Processing, 2nd Edition, Pearson Education,

2003.

2. Anil K. Jain - "Fundamentals of Digital Image Processing", Pearson Education, 2003.

3. Mark Nelson, Jean- Loup Gailly - "The Data compression Book", 2nd Edition, BPB Publications.

4. Pratt William K -"Digital Image Processing", John Wiley & sons.

5. Chanda & Majumdar - "Digital Image Processing and Analysis", PHI.

6. M.Sonka, V. Hlavac, R. Boyle - "Image Processing, Analysis and Machine Vision", Vikas Publishing

House.




Part – C.



Service Oriented Architecture




Objective: This course is designed to provide a thorough introduction to "Service Oriented Architecture"

(SOA), which refers to a design pattern made up of components and interconnections that stress

interoperability and location transparency. This course includes the latest heterogeneous models for

carrying out large scale distributed computing using Web services. It covers the design of SOA systems of

a distributed Web Service based system. The fundamentals of defining, designing, building, testing and

rolling-out a SOA system are explored. Also, looks at the impact of SOA on software quality, efficiency,

security, performance and flexibility. The syllabus covers the Fundamental concepts of Service Oriented

Architecture (SOA), including related computer science, engineering and business aspects. Design,

modeling and simulation of SOA software systems

PART – A

1. Introduction to SOA, Evolution of SOA 7 Hrs

Fundamental of SOA: A service-oriented analogy, How services encapsulate logic, How services relate,

How services communicate, How services are built, Primitive SOA; Common Characteristics of

contemporary SOA; Common tangible benefits of SOA: Improved integration, Inherent reuse,

Streamlined architectures and solutions, Leveraging the legacy investment, Establishing standardized

XML data representation, Focused investment on communications infrastructure, “Best-of-breed"

alternatives, Organizational agility; An SOA timeline (from XML to Web services to SOA): XML

:A brief history, web services: a brief history, SOA :A brief history, How SOA is re-shaping XML and

Web services; The continuing evolution of SOA (Standards organizations and Contributing vendors); The

roots of SOA(comparing SOA to Past architectures).

2. Principles of Service – Orientation 7 Hrs

Services-orientation and the enterprise; Anatomy of a service-oriented architecture: Logical components

of the Web services framework, Logical components of automation logic, Components of an SOA, How

components in an SOA inter-relate; Common Principles of Service-orientation: Services are reusable,

share a formal contract, loosely coupled, abstract underlying logic, compasable, autonomous, stateless,

discoverable; How service orientation principles interrelate: Service reusability, Service contract, Service

loose coupling, Service abstraction, Service composability, Service autonomy, Service statelessness,

Service discoverability; Service-orientation and object-orientation; Native Web service support for

service-orientation principles.

3. Service Layers 6 Hrs

Service-orientation and contemporary SOA: Mapping the origins and supporting sources of concrete SOA

characteristics, Unsupported SOA characteristics; Service layer abstraction: Problems solved by layering

services; Application service layer, Business service layer, Orchestration service layer; Agnostic services;

Service layer configuration scenarios.

PART – B

4. Web Services and Primitive SOA 6 Hrs

The Web services framework; Services (as Web services): Service Roles, Service Models; Service

descriptions (with WSDL): Service End Points and service descriptions, Abstract Description, Concrete

Description, Metadata and Service Contracts, Semantic Descriptions, Servide Description advertisement

and discovery; messaging (with SOAP): Messages, Nodes, Message paths.

5. Web Services and Contemporary SOA – 1 6 Hrs

Message exchange patterns; Primitive MEPs, MEPs and SOAP, MEPs and WSDL, MEPs and SOA,

Service activity; Primitive and complex service activities, Service activities and SOA,

Coordination; Coordinator composition, Coordination types and coordination protocols, coordination

contexts and coordination participants, The activation and registration Process, The completion Process,

Coordination and SOA Atomic Transactions; ACID Transactions, Atomic Transaction Protocols, The

atomic transaction coordinator, The atomic transaction process, Atomic transaction and SOA Business

activities; Business activity protocols, Business activity coordinator, Business activity states, Business

activities and atomic transactions, Business activities and SOA. Orchestration; Business Protocols and

process definition, Process services and partner services, Basic activities and structured activities,

Sequences, Flows and Links, Orchestration and activities, Orchestration and coordination, orchestration

and SOA Choreography; Collaboration, Roles and Participants, Relationships and channels, Interaction

and work units, Reusability, Composability and Modularity, Orchestrations and choreography,

choreography and SOA

6. Web Services and Contemporary SOA – 2 8 Hrs

Addressing; End point references, Message Information Headers, Addressing and Transport protocol

independence, Addressing and SOA Reliable messaging; RM Source, RM Destination, Application

Source and application destination, Sequences, Acknowledgements, Delivery assurances, Reliable

Messaging and Addressing, Reliable Messaging band SOACorrelation; Correlation in abstract,

Correlation in MEPs and activities, Correlation in coordination, Correlation in archestration, correlation

in addressing, correlation in reliable messaging, correlation in SOA Polices; The WS-Policy framework,

Policy assertions and policy alternatives, Policy assertion types and policy vocabularies, Policy subjects

and policy scopes, Policy expressions and policy attachments, What you really need to know?, Policies in

coordination,Policies in orchestration and choreography, Policies in reliable messaging, Policies in SOA,

Metadata exchange; The WS-metadata exchange specification, Get metadata request and response

messages, Get request and response messages, Selective retrieval of metadata, metadata exchange and

service description discovery, Metadata exchange and version control, metadata exchange and SOA,

Security; Identification, authentication and authorization, Single sign-on, confidentiality and integrity,

Transport level security and message level security, Encryption and digital signatures, security and SOA.

Notification and eventing.

PART – C

7. Business Process Design 6 Hrs

WS-BPEL language basics; WS-Coordination overview; Service-oriented business process design(A step-

by-step process); WS-addresing language basics; WS-ReliableMessaging language basics.

8. SOA Platforms 6 Hrs

SOA platform basics: Basic platform building blocks, Common SOA platform layers, Relationship

between SOA layers and technologies, Fundamental service technology architecture, Vendor platforms;

SOA support in J2EE: Platform overview, Primitive SOA support, Support for service-orientation

principles, Contemporary SOA support; SOA support in .NET: Platform overview, Primitive SOA

support, Support for service-orientation principles, Contemporary SOA support; Integration

considerations.

Reference Books:

1. Thomas Erl: Service-Oriented Architecture – Concepts, Technology, and Design, Pearson Education,

2005.

2. Eric Newcomer, Greg Lomow - Understanding SOA with Web Services, Pearson education, 2005.

3. Thomas Erl - A Field Guide to Integrating XML and Web Services, 5 th Edition, Prentice Hall PTR,

2004 ISBN 0131428985, 9780131428980.

4. Eric A. Marks, Michael Bell - A Planning and Implementation Guide for Business and Technology,

Wiley, 2006 ISBN 0471768944, 9780471768944.




Part – C.



Mobile Handset Software Design




Objective:

This course is intended to develop the skill to develop mobile handset software application development using Samsung’s

LiMo Platform SDK. It will help students to prepare themselves to get into booming mobile telecommunication industry.

PART – A

1 Introduction to Mobile SW Platforms

Introduction to Mobile networks and Current state of art Mobile SW Platform , 3 rd Party Applications

Introduction to Key terms and definitions - Smart Phone, Feature Phone, Proprietary vs. open source,

Application processor, baseband, single chip HW, dual chip HW, Introduction to Open Source Licenses

6 Hrs

2 ARCHITECTURE

Intro to Handset Hardware, Application Processor (OMAP 3430), Introduction to Handset SW

architecture, Application Platform SW Architecture, Modem/Radio Layer – What is it and functionality,

Middleware components Responsibilities and Architecture,

Architecture of Middleware components

1. Application framework

2. System-framework

3. UI-framework

4. Telephony-framework

5. Storage-framework

6. Multimedia -framework

7. Network -framework

8. Messaging-framework

9. Connectivity-framework

Security-framework .

24 Hrs

PART – B

3 DESIGN CONCEPTS & ADVANCE TOPICS

Application Design Concepts- Basic framework to build an app, DBUS Vs Socket, Application Usability

& User Experience Platform Concepts -Eventing Mechanism and its difference from Linux, List of

System Events Available and List of System Events unavailable for applications, Memory management,

Single Threaded and Multi-threaded

Platform Concepts -What are elementary components of windowing systems, Model View Controller –

Doc-View Framework, Impact of various factors on Platform, Phone form factor, Memory, CPU,

Screen, Requirements (esp. on platform capabilities), Radio technology (and it’s limitation), Chip

capability (single vs. multiple processors), Multiprocessor or Multicore chipset

Case-study – Study popular mobile applications

Security Issues, Adding Drivers to Linux Platform, Threading Model, Rich graphics Interfaces,

Debugging and Troubleshooting – How to get infer information from application call stack and

generating logs., How to write complex applications?

Introduction to SDK, IDE, Cross compilation & Tools - Eclipse, Memory leak, GDB, Valgrind,

Debugging

12 Hrs

List of programme

1. 1 Write “Hello world” of each programming model and test in on SLP SDK simulator.

2. Usage 1: A programming problem using IPC and Memory management

3. Usage 2: Write applications addressing various considerations learnt architecture part for a

specific middleware component.

4. Usage 1: Write applications addressing various considerations learnt architecture part using

atleast 2 different type of middleware components.

5. Usage 2: Write applications addressing various considerations learnt architecture part using

atleast 2 different type of middleware components.

6. Make a mini-project proposal for a mobile application and implement it using SDK simulator.

Presentation of Mini Project working on simulator.

7. Test and Deploy the application made previously on target

REFERENCES

1. Samsung Platform SDK – tools and programming guides for each SLP Middleware Components

2. Samsung Supplied Study materials

3. Professional Palm OS Programming (Paperback) by Lonnon R. Foster, Glenn Bachmann

4. Hacking BlackBerry: ExtremeTech (Paperback) by Glenn Bachmann

5. Palm OS Programming Bible, Second Edition (Paperback) by Lonnon R. Foster

6. Palm WebOS (Paperback) by Mitch Allen, Publisher: O'Reilly Media, Inc. (August 14, 2009)

7. Practical Palm Pre WebOS Projects (Paperback) by Frank Zammetti

8. Palm Pre: The Missing Manual (Paperback) by Ed Baig

9. Professional Android Application Development (Paperback) by Reto Meier

10. Beginning iPhone 3 Development: Exploring the iPhone SDK (Paperback) by Dave Mark

11. iPhone Cool Projects (Paperback) by Gary Bennett (Author), Wolfgang Ante (Author), Mike

Ash (Author), Benjamin Jackson (Author), Neil Mix (Author), Steven Peterson (Author),

Matthew "Canis" Rosenfeld (Author)

12. iPhone Advanced Projects (Paperback) by Dave Mark

13. iPhone SDK Programming: Developing Mobile Applications for Apple iPhone and iPod touch

(Paperback) by Maher Ali

14. Programming Windows Embedded CE 6.0 Developer Reference, 4th Edition (Perfect

Paperback) by Douglas Boling (Author)

15. Professional Microsoft Smartphone Programming (Paperback) by Baijian Yang (Author), Pei

Zheng (Author), Lionel M. Ni (Author)

Scheme of Evaluation:

Theory:

THREE out of FIVE from PART A and TWO out of THREE from PART B.



Data Warehousing and Data Mining




Objective: Corporate decision makers require access to all the organization’s data, wherever it is located.

To provide comprehensive analysis of the organization, its business, its requirements and any trends,

require access to not only the current data in the database but also to historical data. Many current data

analysis techniques are beyond the reach of most managers and practitioners. This course bridges three

gaps: first, a gap between academic ivory tower and the real world; secondly, a gap between quantitative

data analysis techniques and qualitative data analysis techniques; and finally, a gap between a specific

technique and an overall strategy. This course will involve an in-depth study of various concepts needed

to design and develop a data warehouse and data mining.

PART – A

1. The fundamentals of Data Warehousing 4 Hrs

Inherent risks, converting data into information, the data warehouse phenomenon, definition of a data

warehouse, users and frame work

2. The Data warehouse architecture 4 Hrs

Architectural challenge, essential components, Scoping, assessing architectural risk, data base design, star

schema

3. Meta Data Management 6 Hrs

Internal and external metadata, challenge of Meta data, sources of metadata, types of metadata users

4. Introduction to Data Mining 6 Hrs

What is data mining, Data mining functionalities, classification of data mining systems

PART – B

5. Data preprocessing 6 Hrs

Why Preprocess the data, Data Cleaning, Data Integration and Transformation, Data Reduction,

discretization and Concept hierarchy generation

6. Association Analysis 6 Hrs

Apriori, FP-Growth algorithm, Evaluation of association patterns; from association mining to correlation

analysis, constraint based association mining

7. Classification and Prediction – I 8 Hrs

What is classification? Prediction, Classification by Decision tree Induction, Bayesian Classification,

classification by back propagation, other classification methods, prediction

PART – C

8. Cluster Analysis 6 Hrs

Overview, K-means, Hierarchical clustering, DBSCAN, Overview of Cluster Evaluation.

9. Mining Stream, Time-Series, and Sequence Data 6 Hrs

Mining Data Streams, Mining Time-Series Data, Mining Sequence Patterns in Transactional Databases,

Mining Sequence Patterns in Biological Data

Reference Books:

1. Sean Kelly - Data Warehousing in Action, Wiley India, 2007. (Chapter 1, 4 and 6)

2. Jiawei Han and Micheline Kamber - Data Mining – Concepts and Techniques, 2nd Edition, Morgan

Kaufmann, 2006. (Chapters 1, 2, 5, 6, 7, 8)

3. Ralph Kimball - The Data warehouse Tool Kit, 2nd Edition, and Wiley edition.

4. Pieter Adriaans and Dolt Zantinge - Data Mining, Addison Wesley, 1996.




Part – C.