bsc-it syllabus at jecrc universityjecrcuniversity.edu.in/assets/pdf/syllabi b.sc. it.pdf · ·...

BSc-IT Syllabus at JECRC University

1

Course Structure and Syllabi

B. Sc. (Information Technology)

Academic Programmes

July, 2013


2

Semester – I

Course Code Course Name L

(Hr.)

T

(Hr.)

P

(Hr.) C

CA-1011 “C” Programming 3 1 0 4

CA-1012 Basics of Electrical Engineering 3 1 0 4

CA-1013 Computer Concepts & Problem Solving 3 1 0 4

CA-1014 C Programming Lab. 0 0 2 1

CA-1015 Electrical Engineering Lab. 0 0 2 1

CA-1016 Computer Concepts and Problem Solving

Lab. 0 0 2 1

G1001 Current Affairs 2 1 0 3

G1002 Computer Applications 2 1 0 3

G1003 Computer Lab - I 0 0 2 1

G1004 Communication Skills 2 1 0 3

Total 25


3

Semester – II


(Hr.)

T

(Hr.)

P

(Hr.) C

CA-2011 Data Structures 3 1 0 4

CA-2012 Operating Systems 3 1 0 4

CA-2013 Digital Principles 3 1 0 4

CA-2014 Data Structures Lab. 0 0 2 1

CA-2015 Operating Systems Lab. 0 0 2 1

CA-2016 Digital Principles Lab. 0 0 2 1



G2003 Computer Lab - II 0 0 2 1


Total 25


4

Semester – III


(Hr.)

T

(Hr.)

P

(Hr.) C

CA-3011 Data structures & Algorithms 3 1 0 4

CA-3012 Database Management Systems 3 1 0 4

CA-3013 Object Oriented Programming 3 1 0 4

CA-3014 Data structures & Algorithms Lab. 0 0 2 1

CA-3015 Database Management Systems Lab. 0 0 2 1

CA-3016 Object Oriented Programming Lab. 0 0 2 1



G3003 Computer Lab - III 0 0 2 1

G3004 Environmental Studies 2 1 0 3

Total 25


5

Semester – IV


(Hr.)

T

(Hr.)

P

(Hr.) C

CA-4011 OOP&C++ 3 1 0 4

CA-4012 JAVA Programming 3 1 0 4

CA-4013 Fundamentals of Digital Signal Processing 3 1 0 4

CA-4014 OOP&C++ Lab. 0 0 2 1

CA-4015 JAVA Programming Lab. 0 0 2 1

CA-4016 Fundamentals of Digital Signal Processing

Lab. 0 0 2 1



G4003 Computer Lab - IV 0 0 2 1

G4004 Value Education 2 1 0 3

Total 25


6

Semester – V


(Hr.)

T

(Hr.)

P

(Hr.) C

CA-5011 Data communication 2 0 2 3

CA-5012 Software Engineering 2 0 2 3

CA-5013 DBMS 2 0 2 3

CA-5014

Elective I:

A. Java,

B. .Net Computing,

C. Grid Computing,

D. Simulation & Modeling

2 0 2 3

CA-5015 Mini Project 2 1 2 4

CA-5016

A. Web Programming,

B. Introduction to Computers & Office

Automation

2 0 2 3



Total 25


7

Semester – VI


(Hr.)

T

(Hr.)

P

(Hr.) C

CA-6011 Computer Network Security and Management 3 0 0 3

CA-6012 Operating System 3 0 0 3

CA-6013

Elective II:

A. Mobile Computing

B. Data Mining & Warehousing

C. Software Testing

3 0 0 3

CA-6014 Multimedia Technologies 3 0 0 3

CA-6015 Project 3 0 2 4

CA-6016 A. Cryptography & Network Security

B. Image Processing 3 0 0 3



Total 25


8

Course Code: CA-1011

Course Name:“C” Programming

L T P C

3 1 0 4

Unit – I (10 Hours)

Programming principles: Algorithms, Flow charts. Computer Language: Classification. Program

Concept: Source program, Compiling, Program execution, Object program. Measures of program

performance. C- Language Fundamentals: Tokens, Fundamental data types, Precedence of

evaluation.

Unit – II: (10 Hours) Flow of Control: Branching: If statement, If – else and Else – If constructs, nested if statements,

switch statements. Looping: for loops, while and do-while loops, nested loops, break and

continue statements.

Unit –III :(12 Hours)

Arrays: Definition, One-dimensional arrays, Two-dimensional arrays, Initializing one and two

dimensional arrays. Strings: Declaring and initializing strings, Reading and writ ing strings.

Functions: Definition, Types of functions, Function prototyping, Arguments and return values,

Nesting of functions, Recursive functions, String functions. Scope and Extent of Variables:

Local and global variables, auto, static and register variables.

Unit – 1V: (12 Hours) Structures and Union: Definitions, Arrays of structures, Structures with in structures, Structures

and functions, sizeof() operator. Pointers: Definition, Pointers and structures, Pointers and

functions, Pointers and arrays, Operations on pointers.

Unit – V: (10 Hours)

Input and output: Character I/O, Formatted I/O, print and scan functions. File: Defining and

opening a file, Closing a file, I/O operations on files, Error handling, Random access. The

preprocessors: #define, #include, #if, #undef, etc. Command line arguments.Dynamic memory

allocation.

REFERENCES

1. E Balaguruswamy, “ Programming in ANSIC”.

2. Kelley, A & Pohl, I;, “A Book on C”, Addison - Wesley

3. VenuGopalK.R.&Prasad, S.R. “Programming with C”, Tata McGraw Hill

4. S.G.Kochen , “Programming in C”.

5. Kernigham and Ritchie, “C Language Reference”.


9


Course Name:Basics of Electrical Engineering

L T P C

3 1 0 4

UNIT I

FUNDAMENTALS OF DC AND AC CIRCUITS Ohms’ law, Kirchhoff‟s law, Simple

resistive circuits - Effect of series and parallel resistances - Mesh analysis - simple problems.

Fundamentals of AC circuits: RMS, Average value of a sine wave, Form factor, Peak factor.

Single Phase AC Circuits – Impedance – Series RL, RC, RLC circuits.Simple problems.

UNIT II

FUNDAMENTALS OF MAGNETIC CIRCUIT Ohm‟s law of magnetic circuit, Simple and

composite magnetic circuits, Effect of air gap – leakage factor - fringing effect- simple problems.

Faraday‟s law of electromagnetic induction - self and mutually induced emf - statically and

dynamically induced emf - simple problems.

UNIT III

DC MACHINES AND TRANSFORMER Construction - emf equation of DC generator - types

of generators- characteristics of generators- single phase transformer – construction - EMF

equation-transformation ratio - types of single phase transformer.

UNIT IV

INDUCTION MACHINES Construction - Types of motors - principle of operation - torque

equation - slip torque characteristics of cage and wound rotor. Single phase induction motor-

principle of operation.

UNIT V

POWER SUPPLIES Half and Full wave rectifier - Bridge rectifier - rectification efficiency –

transformer utility factor -voltage regulator- introduction to SMPS and UPS.12

REFERENCE BOOKS:

1. B.L.Theraja, “Electrical Technology” - Vol I&II – Nirja construction and development

company, New Delhi. 2. V.N.Mittle, “Basic Electrical Engineering”, Tata Mc.Graw Hill, New Delhi, 2006.


10


Course Name:Computer Concepts & Problem Solving

L T P C

3 1 0 4

UNIT I

FUNDAMENTALS OF COMPUTERS Evolution of Computers – Inputs/Outputs –

Alternative Methods of Input – Organization of Modern Digital Computers – Operating System

– Multitasking OS – Graphical User Interface.

UNIT II

WORD PROCESSING Word Processing Programs and Their Uses – Word Processor‟s

Interface – Editing Text – Formatting Text –Macro- Special Features of Word – Desktop

Publishing Service – Converting doc into www pages.

UNIT III

SPREADSHEET SOFTWARE Spreadsheet Programs – applications – Spreadsheet package

features, attributes - structure, label, data, importing data, formula, functions – data handling –

Managing workbooks.

UNIT IV

INTRODUCTION TO COMPUTER PROBLEM SOLVING Introduction – Problem Solving

aspects-Top-Down Design-Implementation of Algorithms – Program Verification-Efficiency of

Algorithms-Analysis of Algorithm fundamental algorithm-factorial computation-generation of

Fibonacci sequence.

UNIT V

FACTORING AND ARRAY TECHNIQUES Factoring Methods-finding the square root of a

number-generating prime numbers- Array techniques-array order reversal-Finding the maximum

number in a set- Removal of duplicates from an ordered Array-finding the kth smallest element.

REFERENCE BOOKS:

1. Peter Norton, “Introduction to Computers”,4th Edition, 2001, Tata McGraw Hill Ltd,

New Delhi.

2. R.G. Dromey,”How to solve it by Computers”,2007, Pearson Publishers, New Delhi.


11


Course Name:C Programming Laboratory

L T P C

0 0 2 1

C Programming

Implementation of

1. Input / output function

2. Control Functions

3. Functions

4. Arrays

5. Pointers

6. Structures and Unions

7. Files

Using case studies on : Roots of a quadratic equation, Measures of location – Matrix Operations

– Evaluation of trigonometric functions – Pay roll problems. String operations like substring,

concatenation, finding a string from a given paragraph, finding the number of words in a

paragraph.


12


Course Name:Electrical Engineering Laboratory

L T P C

0 0 2 1

1. Verification of Ohm‟s and Krichoft Law

2. Verification of Circuit Theorem

3. Load Test on Single Phase Transformer

4. Load Test on D.C.Shunt Motor

5. Load Test on D.C. Shunt Generator

6. Swinburn‟s Test on D.C. Shunt Motor

7. OC & SC Test on Single Phase Transformer

8. Load Test on 1 Phase induction Motor

9. Study of SMPS

10. Study of Half Wave and Full Wave Rectifiers


13


Course Name:Computer Concepts and Problem Solving Laboratory

L T P C

0 0 2 1

1. Word Processing

2. Spreadsheet

3. Power point

4. Factorial

5. Fibonacci

6. Prime Generation

7. Removal of duplicates from an ordered Array

8. Finding the kth smallest element.


14

Course Code: G1002

Course Name:Presentation, Publication and Graphing Techniques

L T P C

2 1 0 3

Unit – I

Presentation Techniques

Power Point Presentation. Data Presentation.Graphics and curves presentation.Multi Media

Presentation. Creation of flash videos

Unit – II

Documentation and Publication Techniques

Introduction to Word Processor(s). Excel Sheet Preparations. Graphics in the Excel.LaTeXfile

Preparation. Working on Adobe Premier Pro/ Maya /Coral Draw

Unit –III

Graphing Techniques

Data Curve plotting: Using Excel, Origin and Gnu Plot.Functional Plotting: Using Gnu Plot,

Origin. Introduction to Mathematica / MatLab explorations. Functional Plots using

Mathematica / MatLab. Animation graphics using Mathematica / MatLab

REFERENCES 1. MATLAB (An Introduction with Application): Amos Gilat, Wiley India.

2. Getting Started with MATLAB: RudraPratap, Oxford University Press.

3. A Concise Introduction to MATLAB: William J. Palm III, Tata McGraw Hill

Education Private Limited.


15

Course Code: G1003

Course Name:Computer Lab - I

L T P C

0 0 2 1

PowerPoint:

Introduction to the IDE of Power Point, Introduction to various toolbars like – Quick access,

Placeholders, Creating title slides, slide shows, Introduction to layouts, themes, Clipboard, font

paragraph, Drawing & Editing, Animations, Transitions, Spell Check, Outline, Tab, slides tabs,

Sorter view and Printing

MS Word:

Introduction to IDE of Microsoft Word, Functionality of various tool bars – Quick Access, Title,

Ribbon, Ruler, and Status Bars. Understanding document Views, Formatting, Editing and

Understanding non printing characters, Using AutoText, Using Indentation & Alignment, and

Style set Page breaks, Page numbers and Setting Page Layouts and Printing Documents

MS Excel:

Introduction to Electronic Spreadsheet, Worksheet, Cells, Quick Access Toolbar, Formula Bar,

Status Bar, Clipboard, Font, Alignment, Number, Cells, Styles, Editing, Perform Mathematical

Calculations, Working with Headers & Footers, Perform Automatic Calculations, Perform

Advanced Mathematical Calculations, Work with Long Text, format Numbers, Excel Functions,

Using Reference Operators and Printing

Charts: Creating and applying chart layout, Adding Labels, Switching Data, Changing the Chart

Style, Size and Position, Chart Type


16


Course Name:Data Structures

L T P C

3 1 0 4

UNIT I

PROBLEM SOLVING Problem solving – Top-down Design – Implementation – Verification – Efficiency – Analysis –

Sample algorithms.

UNIT II

LISTS, STACKS AND QUEUES

Abstract Data Type (ADT) – The List ADT – The Stack ADT – The Queue ADT

UNIT III

TREES

Preliminaries – Binary Trees – The Search Tree ADT – Binary Search Trees – AVL Trees – Tree

Traversals – Hashing – General Idea – Hash Function – Separate Chaining – Open Addressing –

Linear Probing – Priority Queues (Heaps) – Model – Simple implementations – Binary Heap

UNITIV

SORTING

Preliminaries – Insertion Sort – Shellsort – Heapsort – Mergesort – Quicksort – External Sorting

UNIT V

GRAPHS Definitions – Topological Sort – Shortest-Path Algorithms – UnweightedShortest Paths –

Dijkstra‟s Algorithm – Minimum Spanning Tree – Prim‟s Algorithm – Applications of Depth-

First Search– Undirected Graphs – Biconnectivity–Introduction to NP-Completeness

REFERENCE BOOKS :

1. R. G. Dromey, “How to Solve it by Computer” (Chaps 1-2), Prentice- Hall of India, 2002.

2. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, 2nd ed, Pearson Education Asia,

2002.

3. ISRD Group, “Data Structures using C”, Tata McGraw Hill, 2007

4. Richard F. Gilberg, Behrouz A. Forouzan, “Data Structures – A pseudocodeApproach with

C”, ThomsonBrooks / COLE, 1998.


17


Course Name:Operating Systems

L T P C

3 1 0 4

UNIT I

INTRODUCTION History of OS – Operating System Concepts- Functions- Structures- Types

UNIT II

PROCESS MANAGEMENT Processes - Inter process communication -Scheduling criteria -

algorithms - Process Synchronization – Deadlocks

UNIT III

MEMORY MANAGEMENT Storage organization - contiguous – non-contiguous allocation –

fixed partition multiprogramming - multiprogramming with variable partitions - Swapping -

Virtual memory - Paging - Segmentation - Page replacement algorithms - Demand paging.

UNIT IV

DEVICE AND FILE MANAGEMENT I/O hardware - I/O Software - Disks – Disk

Scheduling – File organization - File system implementation - allocation methods- Security -

Protection mechanism.

UNIT V

CASE STUDY LINUX – Architecture - Kernel - Features - System calls – WINDOWS NT:

Architecture – Features- Process Management

REFERENCE BOOKS :

1. Silberschatz A, Galvin, P. Gagne G "Operating System Concepts", John Wiley & Sons,

7th Edition, Singapore, 2004.

2. Deitel, H.M., “Operating Systems", Pearson Education, 3rd edition, New Delhi, 2004.

3. Andrew S. Tanenbaum, Modern Operating Systems", Pearson Education, 3rd

Edition,

New Delhi, 2007

4. Achyut S. Godbole, "Operating Systems", Tata Mc-Graw Hill, 2nd edition, New Delhi,

2003.


18


Course Name:Digital Principles

L T P C

3 1 0 4

UNIT I

Binary Systems : Digital Systems, Binary Numbers, Number Base Conversions, Octal and

Hexadecimal Numbers, Complements, Signed Binary Numbers, Binary Codes, Binary Storage

and Registers, Binary Logic Boolean Algebra and Logic Gates: Basic Theorems and Properties

of Boolean Algebra, Boolean Functions, Canonical and Standard Forms, Digital Logic Gates.

UNIT II

Minimization: K-Map Method – Table Method, POS - SOP, Don‟t Care Conditions, NAND,

NOR Implementation, Introduction to HDL. Combinational Logic: Combinational Circuits,

Analysis and Design Procedure, Binary Adder, Subtractor, Decimal Adder, Binary Multiplier,

Magnitude Comparator, Decoders, Encoders, Multiplexers.

UNIT III

Synchro nous Sequential Logic: Sequential Circutes - Latches, Flip-F lops ,Analys is of Clocked

Sequential Circuits, State Reduction and Assignment Design Procedure.

UNIT IV

Registers and Counters: Registers, Shift Registers, Ripple Counters, Synchronous Counters, Ring

Counters-Johnson Counter.

UNIT V

Asynchronous Sequential Circuit : Introduction, Analysis Procedure, Circuits with Latches,

Design Procedure, Reduction of State and Flow Tables, Race – Free State Assignment Hazards,

Design Example.

REFERENCE BOOKS:

1. M.Morris Mano, “Digital Design”, 3rd edition, Pearson Education, Delhi, 2007

2. Donald P Leech, Albert Paul Malvino and GoutamSaha, “Digital Principles and

Applications”, Tata McGraw Hill, 2007.


19


Course Name:Digital Laboratory

L T P C

0 0 2 1

LIST OF EXERCISES:

1 Binary and BCD counter

2 Verification of NAND, NOR, XOR, AND, OR Gate Logic

3 Parity Generator

4 Multiplexer / Demultiplexers

5 Adder / Subtractor

6 Code Converters

7 Up / Down 4 bit Binary Counter

8 Up / Down 4 bit Decimal Counter

9 Shift Register

10 Ring Counter


20


Course Name:Operating System

L T P C

0 0 2 1

LIST OF EXERCISES

1. Concurrency in Unix/ C- creating child processes using fork, exec

2. Implementation of Interprocess communication

3. Implementation of Process Scheduling Algorithms

4. Implementation of Process Synchronization

5 . Design and Implementation of Deadlock algorithms

6. Implementation of Memory Management Algorithms

7. Implementation of Page replacement Algorithms

8. File system implementation

9. Directory implementation

10. Implementation of Disk Scheduling Algorithms


21


Course Name:Data Structure Laboratory

L T P C

0 0 2 1

LIST OF EXERCISES

Implement the following exercises using C:

1 Array implementation of List Abstract Data Type (ADT)

2 Linked list implementation of List ADT

3 Cursor implementation of List ADT

4 Array implementations of Stack ADT

5 Linked list implementations of Stack ADT The following three exercises are to be done by

implementing the following source files

(a) Program for „Balanced Paranthesis‟

(b) Array implementation of Stack ADT

(c) Linked list implementation of Stack ADT

(d) Program for „Evaluating Postfix Expressions‟ An appropriate header file for the Stack ADT

should be #included in (a) and (d)

6 Implement the application for checking „Balanced Paranthesis‟ using array implementation of

Stack ADT (by implementing files (a) and (b) given above)

7 Implement the application for checking „Balanced Paranthesis‟ using linked list

implementation of Stack ADT (by using file (a) from experiment 6 and implementing file (c))

8 Implement the application for „Evaluating Postfix Expressions‟ using array and linked list

implementations of Stack ADT (by implementing file (d) and using file (b), and then by using

files (d) and (c))

9 Queue ADT

10 Search Tree ADT - Binary Search Tree

11 Heap Sort

12 Quick Sort


22

Course Code: G2002

Course Name:Introduction to Computer Programming (Programming with C)

L T P C

2 1 0 3

UNIT I

Introduction

Stored Program Architecture of Computers, Evolution of Processors (In terms of word length &

Speed only), Storage Device- Primary Memory and Secondary Storage, Working Principle of

Primary Storage devices- RAM, ROM, PROM, EPROM, EEPROM, Random, Direct, Sequential

access methods.

UNIT II

Number System

Data Representation, Concept of radix and representation of numbers in radix r with special

cases of r=2, 8, 10 and 16 with conversion from radix r1 to radix r2. r‟s and (r-1)‟s complement.

Representation of Integer in sign-magnitude, signed 1‟s and 2‟s complement. Floating point

representation.Concept of bias and normalization.Representation of alphabets.

UNIT III

Binary Codes: Binary arithmetic, Addition and subtraction of Integers and floating point

numbers. Multiplication of Integers.Gray code, BCD 8421 and 2421, Excess-3 and Excess-3

gray codes. (Not)

UNIT IV

Programming in C

Structure of C Program, Concept of Preprocessor, Macro Substitution, Intermediate code, Object

Code, Executable Code. Compilation Process, Basic Data types, Importance of braces ({ }) in C

Program, enumerated data type, Identifiers, Scope of Variable, Storage Class, Constants,

Expressions in C, Type Casting, Control Statements, printf( ), scanf ( ), reading single character.

Command Line Arguments.

Arrays in C, Pointers, Using pointers to represent arrays, Dynamic Memory allocation,

Structures, using typedef, Arrays of Structures &pointers.Functions in C, Passing Parameters (By

value & Reference), using returned data, Passing arrays, structures, array of structures, pointer to

structures etc., passing characters and strings, The void pointer.

REFERENCE BOOKS:

1. Let Us C: BalaGuruswami, TATA McGraw Hill.


23

Course Code: G2003

Course Name:Computer Lab - II

L T P C

0 0 2 1

The lab is to be conducted on Linux platform. vi editor is to be used.

1. Simple OS Commands, vi editor, compiling program, compiler options, linking libraries.

2. Simple input output program integer, real character and string. (Formatted &

Unformatted)

3. Conditional statement programs (if, if-else-if, switch-case)

4. Looping Program. (for, while, do-while)

5. Program based on array (one, two and three dimensions)

6. Program using Structure and Union.

7. Program using Function (with and without recursion)

8. Simple programs using pointers.

9. File handling.


24


Course Name:Data structures & Algorithms

L T P C

3 1 0 4

Unit – 1: (10 Hours)

Introduction: Elementary data organization, Data structures, Data structure operations,

Algorithmic notation, Control structures, Complexity of algorithms, String processing,

Structured approach in programming, Top-down design, Recursive procedures and algorithms.

Unit – II: (10 Hours)

Arrays, Records and Pointers: Linear arrays, Representation, Traversing, Inserting and deleting,

sorting and searching, Binary search. Multidimensional arrays, Pointers, Records,

Representation, Matrices, Sparse matrices, Sparse matrix operations

Unit –III :( 14 Hours) Linked Lists: Concept, Representation, Traversing, Inserting and deleting, Searching, Types of

linked lists (circular, doubly circular doubly), garbage collection. Stacks and Queues: Definition,

Fundamental operations on stacks, array representation, linked list representation, polish

notation, Applications of stack, Concepts of queues, dequeues and priority queues.

Unit – 1V: (10 Hours) Tress: Basic terminology, Binary tree representation, Traversing binary trees, Traversing

algorithms using stack, Threads, Binary search tree, Operations; Heap: Storage representation

and manipulation of binary trees, Huffman‟s algorithm, General trees. Graphs: Concept,

Representation, Operations.

Unit – V: (12 Hours) Sorting and Searching: Sorting types, Insertion sort, Selection sort, Merging, Merge sort, quick

sort, radix sort, bubble sort, heap sort; Searching: Binary search and linear search comparison,

Hashing.

REFERENCES

1. Seymour Lipschutz, “Theory and Problems of Data Structures”, International

Edition,1986

2. E.Horowitz, S Sahni& D Mehta,” Fundamentals of Data Structures in C++”,1st

Edition,

Galgotia,2005

3. S Sahni, “Data Structures, Algorithms, and Applications in C++”, International Edition,

McGraw Hill, 2000.

4. Wirth N, “Algorithms + Data Structures = Programs”, Prentice Hall International, 2001.


25


Course Name:Database Management Systems

L T P C

3 1 0 4

UNIT I

INTRODUCTION AND CONCEPTUAL MODELING

Introduction to File and Database systems- Database system structure – Data Models –

Introduction to Network and Hierarchical Models – ER model – Relational Model – Relational

Algebra and Calculus.

UNIT II

RELATIONAL MODEL

SQL – Data definition- Queries in SQL- Updates- Views – Integrity and Security – Relational

Database design – Functional dependences and Normalization for Relational Databases (up to

BCNF).

UNIT III

DATA STORAGE AND QUERY PROCESSING

Record storage and Primary file organization- Secondary storage Devices- Operations onFiles-

Heap File- Sorted Files- Hashing Techniques – Index Structure for files –Different types of

Indexes- B-Tree - B+Tree – Query Processing.

UNIT IV

TRANSACTION MANAGEMENT

Transaction Processing – Introduction- Need for Concurrency control- Desirable properties of

Transaction- Schedule and Recoverability- Serializability and Schedules – Concurrency Control

– Types of Locks- Two Phases locking- Deadlock- Time stamp based concurrency control –

Recovery Techniques – Concepts- Immediate Update- Deferred Update – Shadow Paging.

UNIT V

CURRENT TRENDS

Object Oriented Databases – Need for Complex Data types- OO data Model- Nested relations-

Complex Types- Inheritance Reference Types - Distributed databases- Homogenous and

Heterogenous- Distributed data Storage – XML – Structure of XML- Data- XML Document-

Schema- Querying and Transformation. – Data Mining and Data Warehousing.

REFERENCES:

1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan- “Database System Concepts”

Fourth Edition, McGraw-Hill, 2002.

2. RamezElmasri and Shamkant B. Navathe, “Fundamental Database Systems”, Third

Edition, Pearson Education, 2003.

3. Raghu Ramakrishnan, “Database Management System”, Tata McGraw-Hill Publishing

Company, 2003.

4. Hector Garcia–Molina, Jeffrey D.Ullman and Jennifer Widom- “Database System

Implementation”- Pearson Education- 2000.


26


Course Name:Object Oriented Programming

L T P C

3 1 0 4

UNIT I

INTRODUCTION

Object-oriented paradigm, elements of object oriented programming – Merits and demerits of

OO methodology – C++ fundamentals – data types, operators and expressions, control flow,

arrays, strings, pointers and functions.

UNIT II

PROGRAMMING IN C++

Classes and objects – constructors and destructors, operator overloading – inheritance, virtual

functions and polymorphism.

UNIT III

FILE HANDLING

C++ streams – console streams – console stream classes-formatted and unformatted console I/O

operations, manipulators - File streams - classes file modes file pointers and manipulations file

I/O – Exception handling.

UNIT IV

JAVA INTRODUCTION

An overview of Java, data types, variables and arrays, operators, control statements, classes,

objects, methods – Inheritance.

UNIT V

JAVA PROGRAMMING

Packages and Interfaces, Exception handling, Multithreaded programming, Strings, Input

/Output.

REFERENCES:

1. Herbert Schildt, "the Java 2 : Complete Reference", Fourth edition, TMH, 2002 (Unit IV,

Unit-V)(Chapters 1-11,13,17)

2. Ira Pohl, “Object oriented programming using C++”, Pearson Education Asia, 2003

3. BjarneStroustrup, “The C++ programming language”, Addison Wesley, 2000

4. John R.Hubbard, “Progranning with C++”, Schaums outline series, TMH, 2003

5. H.M.Deitel, P.J.Deitel, “Java : how to program”, Fifth edition, Prentice Hall of India

private limited.

6. E.Balagurusamy“ Object Oriented Programming with C++”, TMH 2/e


27


Course Name:Algorithm Design Laboratory

L T P C

0 0 2 1

1. Apply the divide and Conquer technique to arrange a set of numbers using mergesort method.

2. Perform Strassen‟s matrix multiplication using divide and conquer method.

3. Solve the knapsack problem using greedy method.

4. Construct a minimum spanning tree using greedy method.

5. Construct optimal binary search trees using dynamic programming method of problem

solving.

6. Find the solution for traveling salesperson problem using dynamic programming approach.

7. Perform graph traversals.

8. Implement the 8-Queens Problem using backtracking.

9. Implement knapsack problem using backtracking.

10. Find the solution of traveling salesperson problem using backtracking


28


Course Name:Database Management Systems Laboratory

L T P C

0 0 2 1

1. Data Definition Language (DDL) commands in RDBMS.

2. Data Manipulation Language (DML) and Data Control Language (DCL) commands in

RDBMS.

3. High-level language extension with Cursors.

4. High level language extension with Triggers

5. Procedures and Functions.

6. Embedded SQL.

7. Database design using E-R model and Normalization.

8. Design and implementation of Payroll Processing System.

9. Design and implementation of Banking System.

10. Design and implementation of Library Information System.


29


Course Name:Object Oriented Programming Laboratory

L T P C

0 0 2 1

C++

1. Programs Using Functions

- Functions with default arguments

- Implementation of Call by Value, Call by Address and Call by Reference

2. Simple Classes for understanding objects, member functions and Constructors

- Classes with primitive data members

- Classes with arrays as data members

- Classes with pointers as data members – String Class

- Classes with constant data members

- Classes with static member functions

3. Compile time Polymorphism

- Operator Overloading including Unary and Binary Operators.

- Function Overloading

4. Runtime Polymorphism

- Inheritance

- Virtual functions

- Virtual Base Classes

- Templates

5. File Handling

- Sequential access

- Random access

JAVA

6. Simple Java applications

- for understanding reference to an instance of a class (object), methods

- Handling Strings in Java

7. Simple Package creation.

- Developing user defined packages in Java

8. Interfaces

- Developing user-defined interfaces and implementation

- Use of predefined interfaces

9. Threading

- Creation of thread in Java applications

- Multithreading

10. Exception Handling Mechanism in Java

- Handling pre-defined exceptions

- Handling user-defined exceptions


30

Course Code: CS3002

Course Name:Programming with C++ and JAVA

L T P C

3 0 0 3

UNIT I

Programming in C++

C++ Overview, C++ Characteristics,Object-Oriented Terminology,Polymorphism, Object-

Oriented Paradigm, Abstract Data Types, I/O Services, Standard Template Library, Standards

Compliance, Functions and Variables, Functions: Declaration and Definition, Variables:

Definition, Declaration, and Scope, Variables: Dynamic Creation and Derived Data, Arrays and

Strings in C++, Qualifiers, Classes in C++, Defining Classes in C++, Classes and Encapsulation,

Member Functions, Instantiating and Using Classes, Using Constructors, Multiple Constructors

and Initialization Lists, Using Destructors to Destroy Instances, Using Destructors to Destroy

Instances, Operator Overloading, Operator Overloading, Working with Overloaded Operator

Methods, Initialization and Assignment, Initialization vs. Assignment, The Copy Constructor,

Assigning Values, Specialized Constructors and Methods, Constant and Static Class Members,

Inheritance, Overview of Inheritance, Defining Base and Derived Classes, Constructor and

Destructor Calls, Input and Output in C++ Programs, Input and Output in C++ Programs,

Standard Streams, Manipulators, Unformatted Input and Output.

UNIT II

Introduction to JAVA Tools

Introduction to Object Orientated Programming, Abstraction, Object Oriented Programming

Principles, Features of JAVA, Introduction to Java byte code, Java Virtual machine. Differences

between C++ and JAVA

REFERENCES:

1. Let Us C: BalaGuruswami, TATA McGraw Hill.

2. Programming with C, C++: YashwantKanitkar


31

Course Code: CS3003

Course Name:Computer Lab - III

L T P C

0 0 2 1

List of Experiments

1. To write a simple program for understanding of C++ program structure without any

CLASS declaration. Program may be based on simple input output, understanding of

keyword using.

2. Write a C++ program to demonstrate concept of declaration of class with public &

private member, constructors, object creation using constructors, access restrictions,

defining member functions within and outside a class. Scope resolution operators,

accessing an object‟s data members and functions through different type of object handle

name of object, reference to object, pointer to object, assigning class objects to each

other.

3. Program involving multiple classes (without inheritance) to accomplish a task.

Demonstrate composition of class.

4. Demonstration Friend function friend classes and this pointer.

5. Demonstration dynamic memory management using new & delete & static class

members.

6. Demonstration of restrictions an operator overloading, operator functions as member

function and/ or friend function, overloading stream insertion and stream extraction,

operators, overloading operators etc.

7. Demonstrator use of protected members, public & private protected classes, multilevel

inheritance etc.

8. Demonstrating multiple inheritance, virtual functions, virtual base classes, abstract

classes


32


Course Name:OBJECT ORIENTED PROGRAMMING & C++

L T P C

3 1 0 4

Unit – 1 :( 8 Hours)

Object Oriented Paradigm: Evolution of programming paradigms, Structured verses object

oriented development, Elements of OOP, Objects, Classes, Multiple views of the same object,

Encapsulation and data abstraction, Inheritance, Delegation, Polymorphism, Message

communication, Merits and demerits of OO methodology.

Unit – II: (12 Hours) Stream based I/O, Comments, iostream library, Scope resolution operator, Variable declaration

and definition, Runtime memory management. Data Types, Operators and Expressions. Control

Flow, Arrays and Strings.

Unit –III: (10 Hours)

Modular Programming with Functions: Function components, Passing data to functions,

Function return data type, Library functions, Parameter passing, Return by reference, Parameter

passing, inline function, Function overloading, Function Templates, Arrays and functions,

Complete syntax of main(). Pointers and Runtime Binding.Classes and Objects.

Unit – 1V: (12 Hours)

Object Initialization and cleanup: Constructors, Parameterized constructors, Destructor,

Constructor overloading, Order of constructor and destructor, Dynamic initialization through

constructors, Constructors with dynamic operations, Copy constructors, Nested classes. Dynamic

Objects.Operator Overloading.Inheritance.Virtual Functions.


Generic Programming with Templates, Stream Computation with Files, Exception Handling,

Standard Template Library, Object Oriented System Development.

REFERENCES

1. K R Venugopa, Ravikumar, T Ravisankar, “Mastering C++”, 19th

Reprint, TataMcGraw-Hill,

2005.

2. E Balaguruswami, “Object Oriented Programming with C++”, 2nd

Edition, TataMcGraw-Hill,

2002

3. Stanly B lippman , “The C++ Primer”,AddisonWesly

4. Cohoon& Davidson, “C++ Program Design”, Tata McGraw-Hill


33


Course Name:JAVA Programming

L T P C

3 1 0 4

UNIT I

JAVA BASICS-REVIEW

Java Streaming – Components and events handling – Threading concepts – Networkingfeatures –

Byte code interpretation – Media Techniques.

UNIT II

JAVA DATA STRUCTURES

Lists – Linear Structures – Ordered Structures – Sorting – Trees.

UNIT III

ADVANCED NETWORKING AND BEANS

Client-Sever computing – Sockets – Content and Protocols handlers – Developing distributed

applications – RMI – Remote objects – Object serialization – Bean Concepts – Events in Bean

Box – Bean customization and persistence.

UNIT IV

JAVA DATABASE PROGRAMMING

Connecting to Databases – JDBC principles – Databases access – Interacting – Database search –

Accessing Multimedia databases – Database support in Web applications.

UNIT V

RELATED JAVA TECHNIQUES

3D graphics – JAR file format and creation – Internationalization – Swing Programming –

Advanced Java Scripting Techniques.

REFERENCES:

1. Ken Arnold, James Gosling and David Holmes, “The JAVA Programming Language”, 3rd

edition, Tata Mc-Graw Hill, 2007

2. Elliotte Rusty Harold, “ Java Network Programming”, O‟Reilly publishers, 2000

3. Patrick Naughton, “Complete Reference: Java2”, 7th edition, Tata Mc-Graw Hill, 2003

4. H.M.Deitel, P.J.Deitel, “Java : how to program”, Fifth edition, Prentice Hall of India

private limited.2005


34


Course Name:Fundamentals of Digital Signal Processing

L T P C

3 1 0 4

UNIT I

SIGNALS AND SYSTEMS

Basic elements of digital signal Processing –Concept of frequency in continuous time and

discrete time signals – Sampling theorem –Discrete time signals. Discrete time systems –

Analysis of Linear time invariant systems –Z transform –Convolution and correlation.

UNIT II

FAST FOURIER TRANSFORMS

Introduction to DFT – Efficient computation of DFT Properties of DFT – FFT algorithms –

Radix-2 and Radix-4 FFT algorithms – Decimation in Time – Decimation in Frequency

algorithms –Use of FFT algorithms in Linear Filtering and correlation.

UNIT III

IIR FILTER DESIGN

Structure of IIR – System Design of Discrete time IIR filter from continuous time filter – IIR

filter design by Impulse Invariance.Bilinear transformation – Approximation derivatives –

Design of IIR filter in the Frequency domain.

UNIT IV

FIR FILTER DESIGN

Symmetric &Antisymteric FIR filters – Linear phase filter – Windowing technique –

Rectangular, Kaiser windows – Frequency sampling techniques – Structure for FIR systems.

UNIT V

FINITE WORD LENGTH EFFECTS

Quantization noise – derivation for quantization noise power – Fixed point and binary floating

point number representation – comparison – over flow error – truncation error – co-efficient

quantization error - limit cycle oscillation – signal scaling – analytical model of sample and hold

operations – Application of DSP – Model of Speech Wave Form – Vocoder.

REFERENCES:

1. John G Proakis and Dimtris G Manolakis, “Digital Signal Processing Principles,

Algorithms and Application”, PHI/Pearson Education, 2000, 3rd Edition.

2. Alan V Oppenheim, Ronald W Schafer and John R Buck, “Discrete Time

SignalJohnyR.Johnson, “Introduction to Digital Signal Processing”, Prentice Hall

ofIndia/Pearson Education, 2002.

3. SanjitK.Mitra, “Digital Signal Processing: A Computer – Based Approach”,

TataMcGraw-Hill, 2001, Second Edition.


35


Course Name:OBJECT ORIENTED PROGRAMMING & C++

L T P C

0 0 2 1

Practical will be based on Paper Object Oriented Programming & C++: Covers UNIT-III,UNIT-

IV, UNIT-V, UNIT-VI of Syllabus


36


Course Name:JAVA Programming Laboratory

L T P C

0 0 2 1

1. Implementation of Interfaces and package.

2. Implementation of Multithreading and Exception Handling concepts.

3. Implementation of Applets.

4. Front End Development using swing and AWT.

5. Message transfer using TCP/IP Protocol.

6. Developing a simple Application using Servlets.

7. Developing a simple Application using JSP.

8. Developing a simple Application using JDBC.


37


Course Name:Fundamentals of Digital Signal Processing

L T P C

0 0 2 1

Practical will be based on Paper Fundamentals of Digital Signal Processing: Covers UNIT-

III,UNIT-IV, UNIT-V, UNIT-VI of Syllabus


38

Course Code: CS4002

Course Name:Web Designing Techniques

L T P C

3 0 0 3

UNIT I

Introduction to Networking Technology

Computer network, uses of computer networks, network hardware, network protocol, Reference

models: The OSI reference model, the TCP/IP Reference model, a comparison of the OSI and

TCP/IP reference models.Introduction of Ethernet, Hub, Client Server Architecture, Switch,

modem.

UNIT II

The World Wide Web (WWW) HTML History, Hypertext and Hypertext Markup Language.HTML Documents: Tags,

Elements of an HTML Document: Text Elements, Tag Elements, Structural elements of HTML

documents, Header tags, Body tags, Paragraphs, Title.

List: Numbered list, Non-Numbered lists, Definition lists

Formatting HTML Documents: Logical styles (source code, text enhancements, variables),

Physical Styles (Bold, Italic, underlined, crossed),

Managing images in html: Image format (quality, size, type), Importing images (scanners),

Tags used to insert images.

UNIT III

Frames

Tables in HTML documents: Tags used in table definition, Tags used for border thickness,

Tags used for cell spacing, Tags used for table size, Dividing table with lines, Dividing lines

with cells, Cell types: Titles cells, Data cells

Hypertext and Link in HTML Documents

URL/FTP/HTTP

Types of links: Internal Links, External Link, Link Tags, Links with images and buttons, Links

that send email messages Special effects in HTML documents.

UNIT IV

Web Designing with PHP (Introduction)

Orientation and First Steps: PHP's Place in the Web World, Basic Rules of PHP Programs,

Application of PHP on the internet. Advantages of PHP.

REFERENCES:

1. Herbert Schildt, "the Java 2 : Complete Reference", Fourth edition, TMH, 2002 (Unit IV,

Unit-V)(Chapters 1-11,13,17)

2. Ira Pohl, “Object oriented programming using C++”, Pearson Education Asia, 2003

3. BjarneStroustrup, “The C++ programming language”, Addison Wesley, 2000

4. John R.Hubbard, “Progranning with C++”, Schaums outline series, TMH, 2003

5. H.M.Deitel, P.J.Deitel, “Java : how to program”, Fifth edition, Prentice Hall of India private

limited.

6. E.Balagurusamy“ Object Oriented Programming with C++”, TMH 2/e


39

Course Code: CS4003

Course Name:Computer Lab - IV

L T P C

0 0 2 1

List of Exercises

Develop a static html page using style sheet to show your own profile.

• Add a page to show 5 photos and

• Add a page to show your academics in a table

• Add a page containing 5 links to your favorite website

• Add navigational links to all above pages (add menu).

2. Update your homepage, by creating few html file.

3. Use Cascading Style Sheets to format your all pages in a common format.

4. Basic programs:

• Write a simple "hello word" program.

• Write a program to accept two strings (name and age) from user. Print welcome statement.

• Write a program to create a calculator, which can support add, subtraction and multiply and

division operation.

• Write a program to take input parameters for a table (no. of rows and no. of columns), and

create the desired table.

• Create a "Contact Me" page -

• Ask user to enter his name, email ID,

• Use Java-Script to verify entered email address.

• Store submitted value in a MySql database.

• Display latest 5 submitted records in contact me page.

• Display above record with navigation support. (e.g. next, previous, first, last).


40


Course Name:Data Communication

L T P C

2 0 2 3


Evolution of modern communication system-PSTN-ISDN-Analog and digital signals-common

terminology-Voice channels-RS 232 serial communication-Data communication equipments

(DCE)-Data terminal equipments (DTE)-channel organization-Asynchronous and synchronous

protocols-Binary synchronous protocols (BSP)-Bit-oriented protocols (BOP)-Modes of channel

operation-simplex, half-duplex and full duplex-Modulation

Unit – II :( 10 Hours)

Overview-Network transmission media-connecting network devices-common physical topology-

connecting a simple network-controlling data transmission-ISO and OSI model-seven layers of

OSI model-network communication through OSI model-standards and open systems, TCP/IP

Protocol suite.


Client-server network OS-Peer-to-Peer network OS-Desktop OS-application software

Internetworking- Bridges and routers-Netware Internetworking-protocols-IPX-RIP-NLSP

service advertising protocols (SAP)-Netware core protocols(NCP)-Sequence of packet exchange

Gate ways-Basic ideas of WAN, ATM, FDDI, X.25, FRAME RELAY, ISDN AND SONET.

Unit – IV: (10 Hours)

Introduction-POPI-POP3-Point-to-point protocols (PPP)-link control protocols (LCP)-Network

control protocols (NCP)-Simple mail transfer protocols (SMTP)


Evolution-Services-Basic structure-Accessibility-Domain names-E0-mail-World wide Web-Web

browsers and server-Basic terminology-information retrieval-Archie-Gopher-FTP-Telnet-Finger-

Wais-Usenet news-Ping-Trace route-Nalookup- Search engines-Yellow pages and directories-

Web pages and HTML- Multimedia and communication-Net meeting-ICQ-Powwow-Internet

relay chat-Netiquette-Firewalls- Internet management-Security-Intranet - Corporate on-line

presentation of information.

REFERENCES

1. Leon-Garcia&Widjaja , “Communication Networks”, TataMcGraw-Hill

2. Andew S Tanenbaum, “Computer Networks”, Prentice Hall

3. Greenlaw&Hepp, “Fundamentals of the Internet and world wide Web”, Tata-McGraw Hill.

4. B.Forouzan, Data Communication and Networking, Tata McGRaw Hill, 1998


41


Course Name:Software Engineering

L T P C

2 0 2 3


Introduction to software engineering – computer based system engineering – project

management – activities, project planning, activity organization, project scheduling.

Unit – II: (10 Hours) Requirements engineering – requirements analysis – system models – requirements definition

and specification – software prototyping – formal specification – algebra specification – model –

based specification.


Software design-architectural design – object oriented design – function oriented design – real –

time systems design – user interface design – software reliability – programming for reliability –

software reuse.

Unit – 1V: (10 Hours) Verification and validation – defect testing – static verification – managing people – software

cost estimation – quality management – process improvement.

Unit – V: (10 Hours) CASE classification – integrated CASE – the CASE life cycle – CASE workbenches –

programming workbenches – meta – CASE workbenches – software engineering environments.

REFERENCES 1. Ian Sommerville, Software Engineering, 6/e, Pearson Education Asia, 2001.

2. R.S.Pressman, Software Engineering, 4/e, MacGraw Hill, 1997.

3. P.Jalote, An Integrated Approach to Software Engineering, Narosa, 1993


42


Course Name:DATA BASE MANAGEMENT SYSTEMS

L T P C

2 0 2 3


Databases and Database Users: Characteristics of database approach, Actors behind the scene,

Workers behind the scene. Advantages of using the DBMS approach, Database application,

Disadvantages. Database System-Concepts and Architecture: Data Models, Schema, and

Instances, Three schema architecture and data Independence, Database languages and interfaces,

The database system environment, Centralized and client/server architecture for DBMS,

Classification of DBMS.

Unit – II: (10 Hours) Data Modeling using the E-R Model: Entity types, Entity sets, Attributes, and Keys, Relationship

types, Weak entity types, EER modeling. The Relational Data Model and Relational Database

Constraints. Relational algebra and Relational calculus

Unit –III : (12 Hours)

Relational Commercial languages, Structured Query languages (SQL), Query by example.

Relational Database Design: Informal design guidelines for relation schema, Functional

dependencies, Normal forms, General definition of second and third normal forms, BCNF,

Properties of relational decompositions, Algorithms for relational database schema design,

Multi-valued dependencies and forth normal form, Join dependencies and fifth normal form.

Unit – 1V : (10 Hours) Algorithms for Query Processing and Optimization. Transaction Processing Concept:

Introduction, Transaction and system concept, Characterizing schedules, Concurrency control

technique, Database recovery concept, Recovery Technique.

Unit – V : (10 Hours)

Distributed Databases and Client –Sever Architecture: Concept, Transparency, Types of

distributed databases, Distributed query processing. Object oriented databases: Object structure,

Class hierarchy, Multiple inheritance, Object identity, Physical organization, Object oriented

queries.

REFERENCES

1. R Elmasri, S B Navathe, D V L N Somayajulu, S K Gupta, “Fundamentals of Database

Systems”, 4th

Edition, Pearson Education, 2007.

2. H.F. Korth, A Silberschatz and S. Sudarasan, “Database System Concepts”, Computer

Science Series, McGraw-Hill, 1997

3. C.J.Date, “An Introduction to Data Base Systems,” Volume L Addison Wesley, Reading,

MA, 1990

4. Database Management And Design – Hansen & Hansen – Prentice Hall of India.


43


Course Name:Elective IA:JAVA

L T P C

2 0 2 3


Fundamentals of Object Oriented Programming. Evolution : Features, Environment, JFC.

Constants, Variables & Data Types.

Unit – II: (12 Hours)

Operators and Expressions. Decision Making : Branching, Looping

Unit –III: (12 Hours) Classes, Objects and Methods.Arrays, Strings and Vectors.Interfaces.Packages.Multi threaded

Programming. Exceptions.

Unit – 1V:(10 Hours) Applet Programming.Graphic Programming.


Managing Input/Output files. Java Collection.JDBC. Concepts of J2EE

REFERENCES

1. E. Balaguruswami, “ Programming with Java a Primer”, 3rd

Edition, Tata McGraw-Hill, 2008

2. Andy Harris, “ Java 2-Fast and Easy Web development”, Prentice-Hall

3. Peter Rossbach&HendriskSchereiber, “Java – Server And Servlets”, Person Education

4. Vivek Sharma & Rajiv Sharma, “Developing E-commerce Sites” Person Education

5. Matt J Crouch , “Web Programming Wuith ASP”, Person Education


44


Course Name:Elective IB:.NET TECHNOLOGY

L T P C

2 0 2 3


Basic of the net framework: .net architecture, Managed code, Assemblies, Execution of

assembler code, .net framework class library, common type system, common language

specification, interoperability with unmanaged code.

Unit – II: (12 Hours) Introducing ASP.NET: Creating Web Forms, Adding ASP.NET Code to a page Handling page

events, Discussion: ASP vs. ASP.NET: working model of architecture of server controls, Add an

HTML server control to a page, Access the properties and methods of server controls in code,

Add event handlers for page events, Use the IsPostback property to handle postback forms,

Using Web Controls: Web controls, using intrinsic Controls, Using input Validation controls,

selecting controls for Applications. Bind two controls together

Unit –III: (12 Hours) Using Microsoft ADO.NET to Access Data: Overview of ADO.NET.Connecting to a Data

Source.Accessing Data with DataReaders.Binding to Extensible Markup language (XML) Data.

Unit – 1V: (10 Hours) Separating Code from Content: Advantages of Partitioning as ASP.NET page.Creating and

Using Code-Behind.Creating and Using User Controls. Creating and Using components.

Unit – V: (10 Hours) Using Trace in Microsoft ASP.NET Pages: Overview of Tracing. Trace information. Page-Level

Trace.Application, Level Trace.

REFERENCES 1. G.Buczek, “ ASP.NET Developers Guide”, TMH 2002

2. Richard Anderson, “Professional ASP.NET”, Wrox Press Ltd.

3. “.NET Framework Essentials”. 3rd

Edition (O‟Reilly)


45


Course Name:Elective IC:GRID COMPUTING

L T P C

2 0 2 3

UNIT – I

INTRODUCTION

The Grid - Past, Present, Future, A New Infrastructure for 21st Century Science - The Evolution

of the Grid - Grids and Grid Technologies, Programming models - A Look at a Grid Enabled

Server and Parallelization Techniques – Grid applications

UNIT – II

THE ANATOMY OF THE GRID

The concept of virtual organizations – Grid architecture – Grid architecture and relationship to

other Distributed Technologies – computational and data Grids, semantic grids

UNIT – III

THE OPEN GRID SERVICES ARCHITECTURE

Grid Management systems, security, Grid Grid-Enabling software and Gridenabling network

services, Data Grid - Virtualization Services for Data Grids, Peer-to-Peer Grids - Peer-to-Peer

Grid Databases for Web Service Discovery

UNIT – IV

THE OPEN GRID SERVICES INFRASTRUCTURE

Technical details of OSGI specification, service data concepts, Naming and Change

Management Recommendations – OGSA basic services

UNIT – V

APPLICATION CASE STUDY

Molecular Modeling for Drug Design and Brain Activity Analysis, Resource management and

scheduling, Setting up Grid, deployment of Grid software and tools, and application execution

REFERENCES:

1. Fran Bermn, Geoffrey Fox, Anthony Hey J.G., "Grid Computing: Making the Global

Infrastructure a Reality", Wiley, USA, 2003

2. Joshy Joseph, Craig Fallenstein, "Grid Computing", Pearson Education, New Delhi,

2004,

3. Ian Foster, Carl Kesselman, "The Grid2: Blueprint for a New Computing Infrastructure".

Morgan Kaufman, New Delhi, 2004

4. Ahmar Abbas, "Grid Computing: Practical Guide to Technology and Applications",

Delmar Thomson Learning, USA, 2004.


46


Course Name:Elective ID:SIMULATION & MODELLING

L T P C

2 0 2 3

UNIT-I: Introduction to Simulation: Areas of Application, Systems and system Environment,

Components of a System, Discrete and continuous systems, Types of Models. General

Principles: Concepts in Discrete-Event Simulation, List Processing.

UNIT -II: Statistical Models in Simulation: Review of Technology and concepts, Useful

Statistical Models, Discrete Distributions, Continuous Distributions, Poisson Process, Empirical

Distributions. Queuing Models: CharacteristiIT and notation, Transient and study state behavior

of Queues, Long Run Measures of Performance of Queuing Systems, Study state behavior of

Infinite population Markovian Models.

UNIT -III: Random Number Generation: Properties of Random Numbers, Generation of

Pseudo-Random Numbers, Techniques for generating random numbers, Tests for Random

Numbers. Random Variate Generation: Inverse transform technique, Direct Transformation for

the Normal Distribution, Convolution Method, Acceptance-Rejection Technique.

UNIT -IV: Input Modeling: Data Modeling, Identifying the Distribution with Data, Parameter

Estimation, Goodness-of-Fit Tests, Selecting Input models without Data, Multivariate and Time

series Input Models. Verification and Validation of Simulation Models: Model Building,

verification and validation, verification of simulation models, calibration and validation of

Models.

UNIT -V: Output Analysis for a Single Model: Stochastic Nature of Output Data, Types of

Simulations with Respect to output Analysis, Measure of Performance and their Estimation,

Output Analysis for Terminating Simulations, Output Analysis for Steady-state Simulations.

Comparisons and Evaluation of Alternative System Design: Comparison of Two system designs,

comparison of several system designs, Statistical Models for Estimating the Effect if Design

Alternatives, Meta Modeling.

TEXT.BOOK

1. Jerry Banks, John S.Carson, II and Barry L. Nelson, Discrete - Event System Simulation

2nd Edition References

2. Deo N, system Simulation and Digital Computer, Prentice hall of India

3. Gordan G, system Simulation 2nd

edn,Prentice Hall of India

4. Law am and Ketton W D , Simulation Modelling and Analysis, Mc-Graw Hill


47


Course Name:Mini Project

L T P C

2 1 2 4

Group project: A group contains at most three students.


48


Course Name:A.Web Programming

L T P C

2 0 2 3

Unit-1

WORLD WIDE WEB(WWW)- History, Working, Web Browsers and their versions, Its

functions, URLs, web sites, Portals. Concept of Search Engines, Search Engines, Search engines

types, searching the Web Servers, client and server techniques.

Unit-II

Internet basics:- Elements of the web, viewing web pages with a browser, using a browser for a

mail, News and chat, security and privacy issues. Internet advantage and disadvantage.Internet

Services.

Unit-III Introduction – history of html,sgml - structure of html document, web page layout, html tags and

types - font type, paragraph formatting, meta data, blockquote, hyperlinks, linking, comments,

white space, horizontal ruler, images, ordered and unordered lists, frames, tables, forms

Unit-IV

Web server and proxy server, Web caches, FAQS, Web browser like Internet Explorer, Netscape

Navigator, and Communication Suit, Internet Security issues, Embedded and Software based

firewall, Data encryption and Digital Signature and Certificates.

Unit-V The search and search engine for internet, Spiders, Robots, Bots, Internet Agents, Mobile agents,

meta search sites, outlook express and front page. Web Hosting and publishing Concept. Do‟s

and don‟ts for creating a good website.

Reference Books:

1. Deitel&Deitel, Goldberg, “Internet and world wide web- How to Program”, Pearson

Education Asia, 2001

2. Computer Networks – A.S. Tanenbaum.


49


Course Name:B.Introduction to Computers & Office Automation

L T P C

2 0 2 3

Module I (7 Hours)

Introduction to Computers-Types of Computers- DeskTop, Laptop, Notebook and Netbook –

Hardware: CPU, Input / Output Devices, Storage Devices–System – Software - Operating

Systems, Programming Languages, Application Software – Networks - LAN,WAN -Client-

Server.

Module II(13 Hours) Documentation Using MS-Word - Introduction to Office Automation, Creating & Editing

Document, Formatting Document, Auto-text, Autocorrect, Spelling and Grammar Tool,

Document Dictionary, Page Formatting, Bookmark, Advance Features of MS-Word-Mail Merge,

Macros, Tables, File Management, Printing, Styles, linking and embedding object, Template.

Module III(10 Hours) Electronic Spread Sheet using MS-Excel - Introduction to MS-Excel, Creating & Editing

Worksheet, Formatting and Essential Operations, Formulas and Functions, Charts, Advance

features of MS-Excel-Pivot table & Pivot Chart, Linking and Consolidation.

Module IV(10 Hours)

Presentation using MS-PowerPoint: Presentations, Creating, Manipulating & Enhancing Slides,

Organizational Charts, Excel Charts, Word Art, Layering art Objects, Animations and Sounds,

Inserting Animated Pictures or Accessing through Object, Inserting Recorded Sound Effect or

In-Built Sound Effect.

Module V(10 Hours)

Internet - History of Internet – Intranet and Extranet – DNS – Connections-Dial-up, ISDN, DSL,

T1, T3,WiFi,Wireless, and Satellite Communications--E-mail, Chat, Forum, Blog, and

Newsgroups – Browsers – Search Engines.

References: 1. Absolute Beginner‟s Guide to Computer Basics, Michael Miller, Prentice Hall.

2. Learn Microsoft Office – Russell A. Stultz–BPB Publication

3. Internet & World Wide Web – How to program, H.M.Deitel, P.J.Deitel, et al., Prentice Hall.


50


Course Name:Computer Network Security and Management

L T P C

3 0 0 3

Unit – 1: (8 Hours) Introduction & TCP/IP : TCP/IP Architecture. Transport Layer : TCP, UDP and SCTP, Port

Numbers, Standard Internet Services, Protocol usage by Common Internet application.

Unit – II : (10 Hours) Elementary Sockets : Sockets, TCP Sockets, TCP Client/Server.

Unit –III : (12 Hours) Elementary Sockets : UDP, SCTP, SCTP Client/Server. Domain Name System

Unit – 1V : (12 Hours) Advanced Sockets : Ipv4 & Ipv6 Interoperability, Advanced I/O functions

Unit – V : (12 Hours) Advanced Sockets : Unix Domain Protocol, Nonblocking I/O, Routing Sockets, Key management

Sockets.

REFERENCES 1. W. R. Stevens, B Fenner, A.M. Rudoff ,“ UNIX Network Programming, The Sockets

Networking API”, 3rd

Edition, PHI 2007

2. W.R.Stevens. “Unix Network Programming” PHI 1998

3. J.Martin. “TCP/IP Networking – Architecture, Administration and programming” Prentice

Hall 1994

4. D.E.Comer. “Internetworking with TCP/IP. Vol 1, Vol. 2, Vol. 3, Principles, Protocols and

architecture PHI 2000

5. Feit “TCP/IP”. McGraw Hill 1996

6. Stevens “TCP/IP Illustrated” Vol.1-3 Addison Wesley 1998


51


Course Name:Operating System

L T P C

3 0 0 3


Basic features of OS, I/O devices, Single user and multi-user OS, I/O utilities, Multitasking OS,

Various parts of OS, Loading of OS, Boot strapping, Different types of OS, Shell, File system,

Software tools, Program translation sequence, Compilers & interpreters, Linkers, Loaders,

Assemblers, Fundamentals of DOS and Windows.

Unit – II: (10 Hours) Process concept, Process scheduling, Types of schedulers, Scheduling and performance criteria,

Scheduling algorithms, Inter process communication and synchronization basic concepts, Mutual

exclusion, Semaphores, Critical section, Dead locks


Single process monitor, Multi-programming with fixed partitions and dynamic partitions,

Paging, Hardware support for paging, Address translation by associative memory sharing

system, Segmentation, Virtual memory, Demand paging with virtual memory management.

Unit – 1V: (10 Hours) File concept, Directories, Disk organization, Disk space management methods, Linked list, Bit

map, Disk allocation methods, Contiguous allocation, Non-contiguous allocation, Disk

scheduling, Different scheduling algorithms, File protection, Passwords access groups.


Case Study (Unix) : Basic commands, Permissions, Piping, Directory management, The shell,

Background process, File system, Terminals, Devises, Shell history, Vi editor, Basic operations.,

Mail, Shell programming, Simple Network Management Protocols, System calls, Sockets and

IPC, System administration.

REFERENCES

1. Deitel, “Operating systems” ,AddisionWesly

2. Andrew S Tanenbaum, “Operating Systems”, Prentice Hall

3. Vickery, “Unix Shell Programming”, Addison Wesly


52


Course Name:Elective II: A. Mobile Computing

L T P C

3 0 0 3

UNIT- I: (10 Hours)

Introduction: Wireless transmission, Frequencies for radio transmission, Signals, Antennas,

Signal Propagation, Multiplexing, Modulations, Spread spectrum, MAC, SDMA, FDMA,

TDMA, CDMA, Cellular Wireless Networks.

UNIT- II:(12 Hours)

Telecommunication systems: GSM, GPRS, DECT, UMTS, IMT-2000, Satellite Networks,

Basics, Parameters and Configurations, Capacity Allocation, FAMA and DAMA, Broadcast

Systems, DAB, DVB.

UNIT- III: (12 Hours)

Wireless LAN: IEEE 802.11, Architecture, Services, MAC, Physical layer, IEEE 802.11a -

802.11b standards, HIPERLAN, Blue Tooth.

UNIT- IV: (10 Hours)

Mobile IP,Dynamic Host Configuration Protocol, Routing, DSDV, DSR, Alternative Metrics.

UNIT- V: (10 Hours)

Traditional TCP, Classical TCP improvements, WAP, WAP 2.0.

REFERENCES: 1. Jochen Schiller, “Mobile Communications”, 2/e,PHI/Pearson Education, 2003.

2. William Stallings, “Wireless Communications and Networks”, PHI/Pearson Education, 2002.

3. KavehPahlavan, PrasanthKrishnamoorthy, “Principles of Wireless Networks”, PHI/Pearson

Education, 2003.

4. UweHansmann, LotharMerk, Martin S. Nicklons and Thomas Stober, “Principles of Mobile

Computing”, Springer, New York, 2003.

5. HazysztofWesolowshi, “Mobile Communication Systems”, John Wiley and Sons Ltd, 2002.


53


Course Name:Elective II: B. Data Mining & Warehousing

L T P C

3 0 0 3

UNIT – I

Introduction: Data mining application – data mining techniques – data mining case studies- the

future of data mining – data mining software - Association rules mining:

Introduction- basics- task and a naïve algorithm- apriori algorithm – improve the efficient of the

apriori algorithm – mining frequent pattern without candidate generation.

UNIT – II Classification :Introduction – decision tree – over fitting and pruning - DT rulesestimation

predictive accuracy of classification methods - other evaluation criteria for classification method

– classification software

UNIT – III

Cluster analysis: cluster analysis – types of data – computing distances-types of cluster analysis

methods - partitioned methods – hierarchical methods – density based methods – dealing with

large databases – quality and validity of cluster analysis methods – cluster analysis software.

UNIT – IV Web data mining: Introduction- web terminology and characteristics- locality and hierarchy in

the web- web content mining-web usage mining- web structure mining – web mining software -

Search engines: Search engines functionality- search engines architecture – ranking of web

pages.

UNIT – V Data warehousing: Introduction – Operational data sources- data warehousing – Data

warehousing design – Guidelines for data warehousing implementation – Data warehousing

metadata - Online analytical processing (OLAP): Introduction – OLAP characteristics of

OLAP system – Multidimensional view and data cube - Data cube implementation - Data cube

operations OLAP implementation guidelines

TEXT BOOK:

1. “Introduction to Data mining with case studies”, G.K. Gupta, PHI Private limited, New


54


Course Name:Elective II: C.Software Testing

L T P C

3 0 0 3

UNIT -I

Developing a test approach- addressing software system business risk-Defining a software

system testing strategy-development software system testing tactics-testing software using a life

cycle methodology-requirement phase testing. Self study: Development Software System Testing

Tactics

UNIT -II Design phase testing-program phase testing-Dest debugging and program peer view test tools

evaluating test results-installation phase testing-Acceptance testing Self Study: Installation phase

testing

UNIT -III

Trusting methodology for software maintenance-testing the correctness of the installing a

software change-testing the validity of software cost estimate-testing the progress of the software

system-inspecting test plan and test cases. Self Study: Inspecting test plan and test cases.

UNIT -IV Assessing client-server and LAN risks-A testing strategy for a rapid prototyping-testing

techniques-testing tools. Self Study: Testing Tools

UNIT -V Test documentation-reporting test results-final test reporting-evaluating test effectiveness-using

testing metrics-improving test process Self Study: Improving test process

TEXT BOOK: 1. William Perry, “Effective methods for software testing”, John-Wiley & Sons, Inc.,1995.

Reference Books:

1. Myers and Glenford.J, “ The Art of Software Testing”, John-Wiley & Sons, 1979.

2. Roger.S..Pressman, “Software Engineering-A Practitioner‟s Approach”, Mc-GrawHill, 5th

edition, 2001.

3. Marnie.L.Hutcheson, “ Software Testing fundamentals”, Wily-India, 2007

4. Boris Beizer, “Software Testing Techniques”, Dream Tech Press, Second Edition-


55


Course Name:Multimedia Technologies

L T P C

3 0 0 3

UNIT-I12 Hrs

Multimedia Basics: Multimedia: Definition, Multimedia Developers, Multimedia Project,

Multimedia Highway - Multimedia Applications: Business, Schools, Home, Public Places,

Virtual Reality - Stages of Multimedia Project: Planning & Costing, Designing & Producing,

Testing, Delivering - Multimedia Hardware: Macintosh Platform, Windows Platform,

Networking Mac & Windows Computers - Connections: SCSI, IDE, USB, Firmware (IEEE

1394). Memory & Storage Devices: RAM, ROM, Floppy & Hard Disks, Zip, Jaz, SyQuest

Drives, Optical storage Devices, CD, DVD - Input Devices: Keyboard, Mouse, Trackball, Touch

Screen, Magnetic Card Encoders and Readers, Graphics Tablets, Scanners, OCR, Infrared

Remotes, Voice Recognition Systems, Digital Cameras - Output Hardware: Audio Devices,

Amplifiers & Speakers, Monitors, Video Devices, Projectors, Printers - Communication Devices:

Modems, ISDN & DSL, Cable Modems - Basic Software Tools: Text Editing and Word

Processing Tools, OCR Software, Painting and Drawing Tools, 3-D Modeling and Animation

Tools. Image Editing Tools, Sound Editing Tools - Animation, Video and Digital Movie Tools –

Video Formats, Quick time for Windows & Macintosh, Microsoft Video for Windows, Movie

Editors, Compressing Movie files - Multimedia Authoring Tools – Multimedia Authoring,

Authoring Software - Types – Card or Page based Tools, Icon based Event-driven Tools, Time

based Tools - Cross-Platform Authoring.

UNIT-II 12Hrs

Text & Sound for Multimedia: Text:- Fonts, Faces, Cases - Text in Multimedia - Designing

with Text, Choosing Text Fonts, Symbols & Icons - Font Editing & Design Tools -

Fontographer, Making Pretty Text - Hyper Media & Hyper Text - Sound: Definition, Acoustic

Signals, Amplitude, Frequency, Sampling Rate, Quantization, Multimedia System Sounds -

Digital Audio – Digital Audio files, File size versus Quality, Setting proper Recording levels -

Editing Digital Recordings – Multiple Tracks, Trimming. Splicing and Assembly, Volume

Adjustments, Format Conversion, Resampling or Downsampling, Fade-in & Fade-out,

Equalization, Time Strecting, Digital Signal Processing(DSP), Reversing Sounds - MIDI, Audio

File Formats, MIDI versus Digital Audio, Sound for WWW, Adding Sound to Multimedia

Project, Red Book Standard.

UNIT-III 12Hrs

Graphics & Animation: Images & Graphics: Introduction - Making Still Images – Bitmaps,

Clipart, Bitmap Software - Capturing & Editing Images – Scanning Images, Vector Drawing -

Vector Graphics versus Bitmaps, Conversion between bitmaps & Drawn Images, 3D Drawing &

Rendering - Color:– Natural Light & Color - Computerized Color – Additive Color, Subtractive

Color, Monitors, Computer Color Models - Color Palettes, Dithering - Image File Formats –

Macintosh, Windows, Cross-Platform - Animation: Definition, Principles of Animation,

Animation by Computer - Animation Techniques – Cel Animation, Computer Animation,

Kinematics, Morphing, Animation File Formats.


56

UNIT-IV 12 Hrs

Analog & Digital Video: Video:- Understanding how Video Works - Broadcast Video

Standards – NTSC, PAL, SECAM, ATSC DTV, HDTV - Analog Video – Overscan and Safe

Title Area, Video Color, Interlacing Effects, Text & Titles for Television - Digital Video –

Digital Video Architectures, Digital Video Compression (MPEG 1, 2, 4, 7, 21) - Video

Recording & Tape Formats – Composite Analog Video, Component Analog Video (S-Video,

Three Channel Component – RGB, YUV, Chrominance, Luminance) - Composite Digital,

Component Digital, ATSC – Digital TV, Comparison of Formats - Shooting &Editig Video –

Shooting Platform, Lighting, Chroma Keys, Composition, Optimizing Video Files for CD-ROM.

UNIT-V 12Hrs Designing & Delivering Multimedia: Designing Multimedia:- Structure, Navigation, Hotspots,

Hyperlinks, Buttons, Icons - Designing the user Interface – Expert Modes, GUIs, Graphical

Approaches, Audio Interfaces - A Multimedia Design Case History, Producing Multimedia -

Delivering Multimedia – Testing, Alpha Testing, Beta Testing, Polishing to Gold - CD

Technology, CD Standards (Red, Yellow, Green & Orange Book Standards), White Book, DVD.

Textbook:

1. Multimedia: Making It Work – Tay Vaughan (TATA McGRAW-HILL)

References: 1. Multimedia: Computing Communications & Applications – Ralf Steinmetz and Klara

Nahrstedt, Pearson Education

2. Multimedia BASICS – Weixel, Fulton, Barksdale, Morse, Thomson Brooks/Cole –

ESWAR Press

3. Multimedia & Web Design – Vikas Gupta, Dreamtech Press

4. Adobe Premiere Pro Bible – Droblas, Greenberg , Wiley – India

5. Digital Multimedia – Chapman & Chapman, Wiley – Dreamtech

6. Fundamentals of Multimedia – ZeNinan Li, Mark Drew, Pearson – PrenticeHall


57


Course Name:Project

L T P C

3 0 2 4

Individual project


58


Course Name:A. Cryptography & Network Security

L T P C

3 0 0 3

UNIT-I Introduction to security attacks, services and mechanism, introduction to cryptography.

Conventional Encryption: Conventional encryption model, classical encryption techniques-

substitution ciphers and transposition ciphers, cryptanalysis, stereography, stream and block

ciphers. Modern Block Ciphers: Block ciphers principals, Shannon‟s theory of confusion and

diffusion, fiestal structure, data encryption standard(DES), strength of DES, differential and

linear crypt analysis of DES, block cipher modes of operations, triple DES, IDEA encryption and

decryption, strength of IDEA, confidentiality using conventional encryption, traffic

confidentiality, key distribution, random number generation.

UNIT-II

Introduction to graph, ring and field, prime and relative prime numbers, modular arithmetic,

Fermat‟s and Euler‟s theorem, primality testing, Euclid‟s Algorithm, Chinese Remainder

theorem, discrete logarithms. Principals of public key crypto systems, RSA algorithm, security of

RSA, key management, Diffle-Hellman key exchange algorithm, introductory idea of Elliptic

curve cryptography, Elganel encryption.

UNIT-III Message Authentication and Hash Function: Authentication requirements, authentication

functions, message authentication code, hash functions, birthday attacks, security of hash

functions and MACS, MD5 message digest algorithm, Secure hash algorithm(SHA). Digital

Signatures: Digital Signatures, authentication protocols, digital signature standards (DSS), proof

of digital signature algorithm.

UNIT-IV

Authentication Applications: Kerberos and X.509, directory authentication service, electronic

mail security-pretty good privacy (PGP), S/MIME.

UNIT-V

IP Security: Architecture, Authentication header, Encapsulating security payloads, combining

security associations, key management. Web Security: Secure socket layer and transport layer

security, secure electronic transaction (SET). System Security: Intruders, Viruses and related

threads, firewall design principals, trusted systems.

Books: 1. William Stallings, “Cryptography and Network Security: Principals and

Practice”, Prentice Hall, New Jersy.

2. Johannes A. Buchmann, “Introduction to Cryptography”, Springer-Verlag.

3. Bruce Schiener, “Applied Cryptography”.


59


Course Name:B. Image Processing

L T P C

3 0 0 3

UNIT-I

Introduction and Fundamentals Motivation and Perspective, Applications, Components of Image Processing System, Element of

Visual Perception, A Simple Image Model, Sampling and Quantization.

Image Enhancement in Spatial Domain Introduction; Basic Gray Level Functions – Piecewise-Linear Transformation Functions:

Contrast Stretching; Histogram Specification; Histogram Equalization; Local Enhancement;

Enhancement using Arithmetic/Logic Operations – Image Subtraction, Image Averaging; Basics

of Spatial Filtering; Smoothing - Mean filter, Ordered Statistic Filter; Sharpening – The

Laplacian.

UNIT-II

Image Enhancement in Frequency Domain Fourier Transform and the Frequency Domain, Basis of Filtering in Frequency Domain, Filters –

Low-pass, High-pass; Correspondence Between Filtering in Spatial and Frequency Domain;

Smoothing Frequency Domain Filters – Gaussian Lowpass Filters; Sharpening Frequency

Domain Filters – Gaussian Highpass Filters; HomomorphicFiltering.

Image Restoration

A Model of Restoration Process, Noise Models, Restoration in the presence of Noise only-

Spatial Filtering – Mean Filters: Arithmetic Mean filter, Geometric Mean Filter, Order Statistic

Filters – Median Filter, Max and Min filters; Periodic Noise Reduction by Frequency Domain

Filtering – Bandpass Filters; Minimum Mean-square Error Restoration.

UNIT-III

Color Image Processing Color Fundamentals, Color Models, Converting Colors to different models, Color

Transformation, Smoothing and Sharpening, Color Segmentation.

Morphological Image Processing

Introduction, Logic Operations involving Binary Images, Dilation and Erosion, Opening and

Closing, Morphological Algorithms – Boundary Extraction, Region Filling, Extraction of

Connected Components, Convex Hull, Thinning, Thickening

UNIT-IV

Registration

Introduction, Geometric Transformation – Plane to Plane transformation, Mapping, Stereo

Imaging – Algorithms to Establish Correspondence, Algorithms to Recover Depth

Segmentation Introduction, Region Extraction, Pixel-Based Approach, Multi-level Thresholding, Local

Thresholding, Region-based Approach, Edge and Line Detection: Edge Detection, Edge

Operators, Pattern Fitting Approach, Edge Linking and Edge Following, Edge Elements

Extraction by Thresholding, Edge Detector Performance, Line Detection, Corner Detection.


60

UNIT-V

Feature Extraction Representation, Topological Attributes, Geometric Attributes

Description Boundary-based Description, Region-based Description, Relationship.

Object Recognition

Deterministic Methods, Clustering, Statistical Classification, Syntactic Recognition, Tree

Search, Graph Matching

Books:

1. Digital Image Processing 2nd Edition, Rafael C. Gonzalvez and Richard E. Woods.

Published by: Pearson Education.

2. Digital Image Processing and Computer Vision, R.J. Schalkoff. Published by: John Wiley

and Sons, NY.

3. Fundamentals of Digital Image Processing, A.K. Jain. Published by Prentice