school of computer science scheme of studies master …

1

SCHOOL OF COMPUTER SCIENCE

SCHEME OF STUDIES

Master of Computer Applications

(2016 Batch)

2

SCHEME OF STUDIES

MCA Degree Programme

1st Year

SEMESTER – I

S.N. Course No. Course Name L-T-P Cr.

1 MCA-101 A Computer Programming 4-0-0 4

2 MCA-102 A Discrete Structures 4-0-0 4

3 MCA-104 A Data Communication and Networking 3-0-0 3

4 MCA-106 A Web Development 3-0-0 4

5 MCA-108 A Data Structures and its application 4-0-0 4

6 EN-105 A Technical Communication 3-0-0 3

PRACTICAL/DRAWING/DESIGN


1 MCA-151 A Computer Programming Lab 0-0-3 2

2 MCA-154 A Data Structures and its application Lab 0-0-3 2

3 MCA-156 A Web Development Lab 0-0-3 2

21-0-9 28

SEMESTER – II


1 MCA-103 A Relational DBMS 3-0-0 4

2 MCA-105 A Object Oriented Programming USING C++ 3-0-0 3

3 MCA-107 A Computer Organization and Architecture 3-0-0 3

4 MCA-109 A Operating Systems 3-0-0 3

5 MCA-110 A Analysis and Design of Algorithms 3-0-0 4

6 MCA-111 A Software Engineering Principles 3-0-0 4



1 MCA-153 A Relational DBMS Lab 0-0-3 2

2 MCA-155 A Object Oriented Programming USING C++

Lab 0-0-3 2

3 MCA-159 A Operating System lab 0-0-3 2

18-0-9 (30) 27

3

SCHEME OF STUDIES


2nd

Year (1st yr for Lateral entry)

SEMESTER – III (semester –I for Lateral Entry)


1 MCA-201 A Computer Graphics and Multimedia 4-0-0 4

2 MCA-206 A Core and Advanced Java 4-0-0 4

3 MCA-208 A Programming Using C# 3-0-0 3

4 MCA-215 A Computer Software Testing 3-0-0 3

5 MCA-218 A Object Oriented Software Engineering & UML 3-0-0 3

6 MCA-219 A Cyber Laws and Intellectual Property Right 3-0-0 3



1 MCA-251 A Computer Graphics and Multimedia Lab 0-0-3 2

2 MCA-256 A Core and Advance Java Lab 0-0-3 2

3 MCA-258 A C# Programming Lab 0-0-3 2

20-0-9 26

SEMESTER – IV (Semester- II for Lateral Entry)


1 MCA-209 A Data Mining and Data Warehousing 4-0-0 4

2 MCA-213 A Advanced Operating System 3-0-0 3

3 MCA -214 A Soft Computing techniques 4-0-0 4

4 MCA-216 A Cloud Computing 4-0-0 4

5 MCA-220 A Cryptography & Data Compression 3-0-0 3

6 MCA-221 A Big Data Analysis 3-0-0 3



1 MCA-259 A Data Mining and Data Warehousing Lab 0-0-3 2

2 MCA-266 A Cloud Computing Lab 0-0-3 2

3 MCA- 271 A Big Data Analysis Lab 0-0-3 2

21-0-9 27

4

SCHEME OF STUDIES


3rd

Yr (2nd

Yr for Lateral entry)



1 MCA-351 A Artificial Intelligence Lab 0-0-3 2

2 MCA-354 A Android Applications development Lab 0-0-3 2

3 MCA-381 A Minor project 0-0-8 4

17-0-14 25

3rd

year

SEMESTER – VI ( Semester IV for lateral entry)


1 MCA-371 A Internship 0-0-32 12

2 Elective ( CST) 3-0-0 3

3 MCA-391 A Seminar*** 0-0-4 2

3-0-36 17

SEMESTER – V (Semester III for lateral Entry)


1 MCA-301 A Artificial Intelligence 4-0-0 4

2 MCA-303 A Introduction to ERP 3-0-0 3

3 MCA-304 A Android Applications development 4-0-0 4

4 Elective -1 3-0-0 3

5 Elective -2 3-0-0 3

5

LIST OF ELECTIVES


Elective -1


1. CA-1309 A Network Security & Management 3-0-0 3

2. CA-1425 A Information Storage and Management 3-0-0 3

3. CA-1401 A Introduction to XML 3-0-0 3

4. CA-1323 A Advanced Computer Architecture 3-0-0 3

5. MCA-302 A System Network Administration 3-0-0 3

6. CA-1326 A Expert System 3-0-0 3

7. CA-1327 A Natural language processing 3-0-0 3

MCA-211 A Information Technology &Management 3-0-0 3

ELECTIVE -2


1 CA-1328 A Digital Image Processing 3-0-0 3

2 CA-1406 A EMBEDDED SYSTEM DESIGN 3-0-0 3

3 CA-1307 A Neural Network 3-0-0 3

4 MCA-210 A Software Project Management 3-0-0 3

5 CA-1324 A Advanced Database Management System 3-0-0 3

6 MCA-212 A Mobile Computing 3-0-0 3

7 CA-1421 A Compiler Design 3-0-0 3

8 CA-1424 A Distributed computing 3-0-0 3

9 CA-1310 A

3 D multimedia & Animation

3-0-0 3

6

1st Year

School of Computer Science

7

MCA-101 A COMPUTER PROGRAMMING L-T-P Cr

4-0-0 4

OBJECTIVE

To introduce the students the basic of C and Logic behind the implementation of different

features of C like different data types , function, array, control statements, pointers, structures,

file processing and recursion

1. INTRODUCTION TO COMPUTER SYSTEM: Computer Fundamentals: Definition,

Block Diagram along with Computer components, Characteristics & classification of

computers, hardware & software, types of software, Introduction to Compiler, Assembler,

and Interpreter, Operating System, Definition, functions, data representation – bits and bytes

and operations of data, radix number system – decimal, binary, octal, hexadecimal numbers

and their inter conversions, representation of information inside the computers.

2. BASICS OF PROGRAMMING AND OVERVIEW OF C PROGRAMMING: Programming Fundamental, Problem definition, Algorithm, Flow charts and their symbols

Types of programming languages, Translators, Introduction to C, Structure of C program, C

character set, Identifier and Keywords, Data types, constants, variables, Declaration,

expressions, statements, Symbolic constants, type conversion, Types of operators, Input and

output functions in C, header files, common programming errors, Control Statements,

Sequencing, Selection, Condition and iteration.

3. COMPOSITE DATA TYPES: Declaring, Referencing and initializing arrays, array

subscript, using for loop for sequential access, multi-dimensional array, String basics string

library functions, assignment and substring, concatenation, string comparison. Declaration

and Initialization of structure, structure within structure, Array of structure

4. FUNCTIONS AND POINTERS: Definition of function, function prototype, Purpose of

main function, passing parameters, Scope of function, recursion, Call by value and

reference, Types of storage classes, Scope of variable: Global and local, static variables,

Recursion.. Pointer variables, initializing pointers, pointer operators, pointer expressions,

pointers and arrays, pointer and functions,

5. DYNAMIC MEMORY ALLOCATION AND FILE PROCESSING: C's dynamic

allocation functions. Streams and file types, opening and closing a data file, input and output

operations, text mode versus binary mode, formatted input output operations with files,

random access to files.

Text Book:- Let Us C by Yashwant Kanetkar; BPB Publication, New Delhi.

Reference Books :-

1. Programming in C by Schaum Series, McGraw Hills Publishers, New Delhi.

2. Exploring C by Yashwant Kanetkar; BPB Publications, New Delhi.

3. Application Programming in C by RS Salaria, Khanna Book Publishing Co. (P) Ltd., New

Delhi.

4. Programming in C by R Subburaj, Vikas Publishing House Pvt. Ltd., Jangpura, New Delhi.

5. Programming with C Language by C Balaguruswami, Tata McGraw Hill, New Delhi.

6. Programming in C by BP Mahapatra, Khanna Publishers, New Delhi

8

MCA-102 A DISCRETE STRUCTURE

L T P Cr

4 0 0 4

OBJECTIVE: To lay mathematical foundation for the fundamentals of various computational

structures such as Boolean algebra, propositional logic, graph and trees.

PRE-REQUISITES: Knowledge of Data Structure

1. SET THEORY: Introduction to set theory; set operations; algebra of sets: duality,

finite and infinite sets, classes of sets, power sets, multi sets, Cartesian product,

representation of relations, types of relation, equivalence relations and partitions,

partial ordering relations and lattices; function and its types, composition of function and

relations; cardinality and inverse relations

2. PROPOSITIONAL CALCULUS AND TECHNIQUES OF COUNTING: Basic

operations: AND (Λ), OR (V), NOT (~), truth value of a compound statement,

propositions, tautologies, contradictions, Permutations with and without repetition,

combination.

.RECURSION AND RECURRENCE RELATION: Polynomials and their evaluation;

sequences, introduction to AP, GP and AG series, partial fractions; linear recurrence

relation with constant coefficients; homogeneous solutions, particular solutions, total

solution of a recurrence relation using generating functions.

3. ALGEBRIC STRUCTURES: Definition and examples of a monoid, semigroup,

groups and rings; homomorphism, isomorphism and automorphism; subgroups and normal

subgroups; cyclic groups, integral domain and fields; co-sets; Lag range„s theorem

4. GRAPHS: Introduction to graphs, directed and undirected graphs; homomorphic and

isomorphic graphs; subgraphs; cut points and bridges; multigraph and weighted graph;

paths and circuits, shortest path in weighted graphs; Eulerian path and circuits, Hamilton

paths and circuits; planar graphs; Euler„s formula.

TEXT BOOK

Liu C. L., ―Elements of Discrete Mathem atics‖, McGraw Hill, 1989

REFERENCE BOOKS

1. Johnson Bough R., ―Discrete Mathematics‖, 5th Edition, Pearson Education, 2001

2. Graham Ronald, Knuth Donald E. and Patashik Oren, ―Concrete Mathematics: A

Foundation for Computer Science‖ , Addison-Wesley, 1989

3. Gersting Judith L., ―Mathematical Structures for Computer Science‖, Computer Science

Press, 1993

4. Chtewynd A. and Diggle P.. , Discrete Mathem atics‖ , Modular Mathematics Series,

Edward Arnold, London, 1995

5. Lipshutz S ., ―S chaums Outline series: Theory and problems of Probability‖, McGraw Hill

Singapore, 1982

9

6. Kolm an B. and Busby R. C., ―Discrete Mathematical Structures‖, Prentice Hall of India, 1996

7. Trembley and Manohar, ―Discrete Mathematical Structures with Applications to Com

puters‖, McGraw Hill, 1995

10

MCA-104 A DATA COMMUNICATION AND

NETWORKING

L-T-P Cr

3-0-0 3

OBJECTIVE

To have a fundamental understanding of the design, performance and state of the art of wireless

communication systems, Topics covered include state of the art wireless standards and research

and thus changes substantially form one offering of this course to the next

PRE-REQUISITES: Knowledge of computers hardware and software

1. Introduction to Networks and LAN: Overview of networks: topologies, LAN, MAN, WAN.

Network reference Models: OSI and TCP/IP, Layers and their functions and protocols.

Networking Devices: Hubs, Switches, Repeater, etc. Internet working devices: Bridges, Router,

gateways etc., Data Transmission media, Switching Techniques, Modulation and multiplexing

techniques. Overview of LAN: LAN standards, Channel access methods: CSMA, CSMA/CD,

Token ring. Ethernet: layered architecture, Fast Ethernet: layered architecture, Gigabit Ethernet

(IEEE 802.3z):

2. Network Layer and Transport Layer: Point -to Pont Networks, Introduction to Internet

Protocol, IP Datagram, IP Addressing, routing, IP packet, IP address, IPv4 & IPv6. Congestion

Control & Quality of services (QoS) –Congestion Control in TCP & Frame Relay Network;

QOS; Flow Characteristics; Technique to improve Congestion Control; Scheduling; traffic

shaping, Transport layer Protocols: TCP functions, segments and connections. UDP, TCP verses

UDP.

3. Wide Area Networks: Introduction to WAN, WAN technologies: SONET/SDH, ATM: ATM

cell, layered architecture, ATM signaling, addressing and applications. Frame Relay Technology

Overview and Standards. ISDN & B-ISDN: Technology Overview, Interfaces and Channels,

Layered Protocol architecture and Frame Format.

4. Internet Suite of Protocols: Application Layer: Introduction to application layer and

protocols, WWW, HTTP, DNS. E-Mail and protocols: SMTP, IMAP and MIME. File transfer

protocols: FTP and TFTP. Network management protocol: SNMP. Voice over IP (VoIP).

5. Network Management and Security: Simple Network Management Protocol (SNNP). Data

Encryption & Cryptographic techniques. Firewalls: types, architecture and applications, V-

LANs: architecture and applications, Internet Security protocol (IPsec).

1. Text Book:- Tanenbaum Andrew S., “Computer Networks”, 4th Edition, Pearson

Education/Prentice Hall of India, 2003.

REFERENCE BOOKS

1. Forouzan Behrouz A, “Data Communications and Networking”, Tata McGraw Hill. 2. Stallings William, “Data and Computer Communication”, 5th Edition, Prentice Hall of

India, 1997. 3. Fred Halsall, “Data Communications, Computer Networks and Open Systems”, 4th

edition, Addison Wesley, Low Price Edition, 2000. 4. Tittel E. D., “Computer Networking”, Tata McGraw Hill, 2002

11

5. Comer D. E., “Internetworking with TCP/IP”, Volume 1, 3rd Edition, Prentice Hall of India, 1995.

12

MCA-106A WEB DEVELOPMENT L T P Cr

4 0 0 5

1. HYPERTEXT MARKUP LANGUAGE:Plugin‟s and Helper Application,XML and

XHTML, The Anatomy of HTML, Structure and other semantic elements of HTML 4.1,HTML

5: HTML responsive, HTML entities, HTML 5 canvas, HTML API, HTML5 Data Storage,

HTML5 Plugin‟s HTML5 Audio and Video, HTML5 Geolocation.

2. Power of CSS: CSS Introduction, Syntax and different CSS properties, CSS3: Rounded

Corner, border images, CSS3 transitions and animations, CSS3 multiple columns, CSS3 box

sizing, Responsive Web Designing: Introduction, viewport, Grid View, Media Query: add a

breakpoint, including breakpoint, orientation, Bootstrap3.

3. CLIENT SIDEPROGRAMMING: Introduction to JavaScript syntax: output, Comments,

variables, functions, operators, conditions, switch, loop; JavaScript event handling, objects and

functions, J Query: Introduction, Selectors, J Query Events and Effects, J Query HTML.

4. SERVER SIDE PROGRAMMING: Basics of PHP: Installation, syntax, variables, output,

data types,operators, conditional loop i.e. if-else, switch; while loop, for loop, multidimensional

arrays, Predefined PHP Functions and creating user defined functions; PHP form handling and

database connectivity; Managing Sessions: Using Session Variables, Destroying a Session;

Cookies: Storing Data in Cookies , Setting Cookies.

5. AJAX and My SQL: Introduction to AJAX, AJAX Request and Response, AJAX Events,

MySQL Introduction, Installation, SQL Syntax: Where, And, OR, Update, Delete, SQL Joins,

Create DB, Create Table, SQL Keys, SQL Functions: Avg, Count, Max, Min, Sum, Group By,

UCase, LCase, AJAX and PHP.

Textbook:

Uttam K. Roy, “Web Technology”, Oxford Publication

References:

1. Musciano Chuck, “HTML & XHTML: The Definitive Guide”, Bill Kennedy, 4th Edition,

2000

2. Holzner Steven, “XHTML Black Book”, Paraglyph Press, 2000

3. Uttam K. Roy, “Web Technology”, Oxford Publication

4. Kamal Raj, “Internet and Web Technologies”, Tata McGraw Hill, 2002

5. GodboleAchyut S. and KahateAtul, “Web Technologies, Tata McGraw Hill, 2003

6. Roger S. Pressman,David Lowe, “Web Engineering”.Tata McGraw Hill Publication, 2007

13

MCA-108 A DATA STRUCTURES AND ITS APPLICATIONS L T P Cr

4 0 0 4

OBJECTIVE

To relay the theoretical and practical fundamental knowledge of most commonly used algorithms

and data structure

PRE-REQUISITES: Knowledge of basic computer programming

SYLLABUS

1. INTRODUCTION TO DATA STRUCTURES AND TIME COMPLEXITY: Definition

of data structures and abstract data types; linear vs. non-linear data types; Static and Dynamic

implementations; Arrays; 2; Examples and real life applications. Time Complexity;

Asymptotic Notations; Running Times; Best Case; Worst Case; Average Case; Introduction

to Recursion.

2. STACKS AND QUEUES: The Stacks: Definition; Array based implementation of stacks;

Examples: Infix; postfix; prefix representation; Conversions; Applications; definition of

Queues; Circular Queue; Array based implementation of Queues.

3. LINKED LISTS: Lists; different types of linked lists; Linked List implementation of stacks

and queues; Implementation of Singly linked Lists and Circular Linked List; Applications;

4. TREES AND GRAPHS:: Definition of trees and Binary trees; Properties of Binary trees

and Implementation; Binary Traversal pre-order; post order; In- order traversal; Binary

Search Trees; Implementations. Definition of Undirected and Directed Graphs; The Array

based implementation of graphs; Adjacency matrix; path matrix implementation; The Linked

List representation of graphs; Graph Traversal – Breadth first Traversal; Depth first

Traversal;

5. SORTING AND SEARCHING: Introduction; selection; insertions; bubble sort; Efficiency

of above algorithms; Shell sort; Merge sort; Quick sort; Heap sort, Searching Algorithms:

Straight Sequential Search; Binary Search (recursive & non–recursive Algorithms).

TEXT BOOK

A.K. Sharma – Data structure Using C, 2nd

edition pearson 2013

Langsam, Augentem M.J. and Tenenbaum A. M., ―Data Structures using C & C++‖,

Prentice Hall of India, 2009.

REFERENCE BOOKS

1. Aho A. V., Hopcroft J. E. and Ullman T. D., ―Data Structures and Algorithms‖, Original

Edition, Addison-Wesley, Low Priced Edition, 1983.

2. Horowitz Ellis and S ahni S artaj, ―Fundamentals of Data Structures‖, Addison-Wesley Pub,

1984.

3. Horowitz, S ahni and Rajasekaran, ―Fundamentals of Computer Algorithms‖ 2007.

4. Kruse Robert, ―Data Structures and Program Design in C‖, Prentice Hall of India, 1994

5. Lipschetz Jr. Seymour, ―Theory & Problems of Data Structures‖, S chaum „s Outline, Tata

McGraw Hill

14

6. Weiss Mark Allen, ―Data Structures and Algorithms Analysis in C‖, Pearson Education,

2000

7. Corm en T . H . et al., ―Introduction to Algorithms‖, 2nd Edition, Prentice Hall of India,

2001.

8. Dasgupta Sanjay, Christos P. and Vazirani Umesh, ―Algorithms‖, Tata McGraw Hill, 2008

15

EN-105 A TECHNICAL COMMUNICATION L T P Cr

3 0 0 3

Objective : The subject aims to strengthen the communication ability of the students, to nurture

their business communication and presentation skills, leading to their holistic personality

development and overall assisting them in developing managerial capacity.

UNIT 1: Communication skills& Vocabulary Building

Nature and significance of communication, Types of communication,Barriers of Communication

Reading, Writing , Speaking and Listening Skills.

A Selected list of Homophones, Foreign words & Business Terms

UNIT 2: Effective Communication & Personality Development

Fluency Enhancement Game/Activities.Team Building skill, Leadership skill development. Body

language in GD; Types of GD. Mock Group Discussion. Expressing opinions & disagreements;

GD in the selection process; Creative Brainstorming,Self introduction in front of the Interview

board; Public speaking tips; Humorous speech

UNIT3: Internal Communication&Technology in Education:- Meeting- Need and importance of

Meeting. Role of the chairperson.; Agenda; Minutes; Notice; Memo; Memorandum; Circular,

Role of the chairperson, Role of the Participants.

Fusion of Management, Nature of participation in different group activities, seminars,

conferences and workshops, Technology and communication.

UNIT 4: Employment & Business Related Development

CV & Job application; Covering letter; Inquiry, Order, Credit and Status enquiry; Complaints,

Claims, Adjustment and Collection letter

UNIT 5: Corporate communication & FacingInterviews:- Public Relations(PR); Tools of PR;

External and Internal Measures of PR,Tools of presentation, oral presentation skill, removal of

stage fear. Activities based on PowerPoint Presentation, process of interview andbody language

in an interview.

TEXT BOOKS:

1. Pal Rajender, Korlahalli,”Essentials of Business Communications” S.Chand and Sons.

2. Lesikar,Pedit,”Business Communication and Managerial skills, All India Book Travellers.

3. T.N. CHHABRA, “ Business Communication concepts and skills, Sun India Publications.

REFERENCE BOOKS:

1.Flatley,Lesikar” Basic Business Communication skills for empowering the internet

generation”, All India Traveller booksellers

2.Hewing Martin, “Advanced Business Communication “, Cambridge University Press

16

MCA-151A A Computer programming Lab

L-T-P

0-0-2

CR

2

List of Experiments

SEQUENTIAL CONTROL STATEMENTS

1 Write a program to Print HELLO

2 Write a program to add two numbers

3 Write a program to calculate simple interest

4 Write a program to calculate average of three numbers

5 Write a program to swap two numbers

6 Write a program to illustrate mixed data types

7 Write a program to calculate area and circumfrence of circle

8 Write a program to evaluate a polynomial expression

9 Write a program to add digits of a four digit number

10 Write a program to check whether the person if eligible for voting or not

CONDITIONAL CONTROL STATEMENTS

11 Write a program to find gratest of two numbers

12 Write a program to find out which type of triangle it is

13 Write a program to find out greatest of three numbers

14 Write a program to evaluate performance of the student

15 Write a program to make a basic calculator

LOOP CONTROL STATEMENTS

16 Write a program to print fibonacci upto the given limit

17 Write a program to find the sum of digits of a number

18 Write a program to find factorial of a number

19 Write a program to print table of any number

ARRAYS AND STRINGS

20 Write a program to enter the elements in a one dimensional array

17

21 Write a program to find the sum and average of five numbers

22 Write a program to sort the array elements

23 Write a program to enter the marks of 50 students an calculate the average

24 Write a program to add 2 matrix

25 Write a program to multiply 2 matrices

26 Write a program to calculate the length of string

27 Write a program to concatenate 2 strings

28 Write a program to reverse the string

29 Write a program to count the numbers of characters in a string

30 Write a program that converts lower case characters to upper case

31 Write a program without using predefined functions to check weather the string is

palindrome or not

FUNCTIONS

32 Write a program using function to find the largest of three numbers

33 Write a program using function to swap two numbers using call by value

34 Write a program using function to swap two numbers using call by refrence

35 Write a program using function to sum the digits of a number

36 Write a program to calculate factorial of a number using recursive function

37 Write a program to print first n fibonacci using recursive function

POINTERS

38 Write a program to illustrate the concept of chain of pointers

39 Wrie a program to calculate the area and perimeter of circle using pointers

40 Wrie a program to find largest of three numbers

STRUCTURES

41 Write a program to read an employee record using structure and print it

42 Write a program to prepare salary chart of employee using array of structures

FILE HANDLING

43. Write a program to Create a file and store text and display the contents

18

MCA-158 A DATA STRUCTURE AND ITS APPLICATION LAB L T P Cr

0 0 3 2

LIST OF EXPERIMENTS

1. Search an element in a two-dimensional array using linear search.

2. Using iteration and recursion concepts write programs for finding the element in the

array using Binary Search Method

3. Inserting & deleting an element in the array

4. Tower of Hanoi problem using recursion

5. Perform following operations on matrices using functions only

a) Addition b) Subtraction c) Multiplication d) Transpose

6. Static & dynamic Implementation of stack ( push & pop operat ion)

7. Implementation of Circular queue (insert & delelte operation)

8. Create a linear linked list & perform operations such as insert, delete, update,

reverse in the link list

9. Create a circular linked list & perform operations such as insert, delete

10. Implement binary search tree. (Insertion and Deletion in Binary Search Tree)

11. Simulates the various tree traversal algorithms

12. Implementation Bubble, Insertion & selection sort.

13. Implementation of quick sort

14. Implementation of merge sort

15. Implementation of heap sort

16. Simulate various graph traversing algorithms.

REFERENCE BOOKS

1. A.K. Sharma – Data structure Using C, 2nd

edition pearson 2013

2. R. S. Salaria -Data Structure Using C

3. Kruse Robert, ―Data Structures and Program Design in C‖, Prentice Hall of India,

1994

4. Lipschitz Jr. Seymour, ―Theory & Problems of Data Structures‖, Schaum„s Outline, 2nd

Edition, Tata McGraw Hill

19

MCA-156 A Web Development Lab

L T P Cr

0 0 3 2

List of Experiment

HTML

I a Simple HTML

I b Hyper Links

I c Using Frames

I d Registration Form with Table

CSS

II a Inline Style , Internal Style ,and external Style Sheets

JAVA SCRIPT

III a

Use user defined function to get array of values and sort them in ascending

order

III b Demonstrate String and Math Object‟s predefined methods

III c Demonstrate Array Objects and Date Object‟s predefined methods

III d Exception Handling

III e Calendar Creation : Display all month

Event Handling

• Validation of registration form

III f

• Open a Window from the current window

• Change color of background at each click of button or refresh of a

page

• Display calendar for the month and year selected from combo box

• OnMouseover event

XML

VI a Create a any catalog

VI b Display the catalog created using CSS and XSL

PHP

VII a File operation

VII b Regular Expression, Array, Math, Date functions

20

MCA-103 A RELATION DATABASE MANAGEMENT SYSTEM L T P Cr

3 0 0 3

OBJECTIVE

To provide knowledge about various organizations and management information systems,

keeping in view the aspects of share ability, availability, evolvability and integrity

PRE-REQUISITES

Knowledge of data structures, discrete mathematical structures

1. INTRODUCTION: What is database, Purpose of database system; advantages of using

DBMS; database concept and architecture; data abstraction; data models; instances and

schema; data independence; schema architecture; database languages; database administrator;

database users

2. DATA MODELING: Entity sets attributes and keys, relationships (ER); database modeling

using entity; type role and structural constraints, weak and strong entity types; enhanced

entity-relationship (EER), ER diagram design of an E-R database schema; specialization and

generalization

3. RELATIONAL MODEL: Relational model: relational model -basic concepts, enforcing

data integrity constraints, Relational algebra: introduction, Selection and projection, set

operations, renaming, Joins, Division, syntax, semantics. Operators; extended relational

algebra operations, Calculus: Tuple relational calculus, Domain relational Calculus; Codd's

rules.

4. DATABASE DESIGN AND SQL: Database design process; relational database design,

anomalies in a database; functional dependencies membership and minimal covers normal

forms, multi-valued dependencies, join dependencies, inclusion dependencies; reduction of

an E-R schema to tables; effect of de-normalization on database performance, Query-by-

example (QBE), Introduction to SQL, basic queries in SQL, advanced queries in SQL,

functions in SQL; basic data retrieval, aggregation, categorization, updates in SQLs; views in

SQL.

5. TRANSACTION PROCESSING: Desirable properties of transactions, implementation of

atomicity and durability; reconsistent model, read only and write only model; concurrent

executions, schedules and recoverability; serializability of schedules concurrency control;

serializability algorithms; testing for serializability; precedence graph; concurrency control,

deadlock handling - detection and resolution.

TEXT BOOK

Silberschatz A., Korth H. F. and Sudarshan S., “Database System Concepts”,6th edition,

McGraw-Hill, International Edition,

2010

21

Steven Feuerstein, Bill Pribyl , “Oracle PL/SQL”, O'Reilly Media , 4th

Edition, 2005

REFERENCE BOOKS

1. Desai Bipin, “Introduction to Database Management System”, Galgotia Publications,

1991

2. Elmasri R. and Navathe S. B., “Fundamentals of Database Systems”, 6th edition,

Addison-Wesley, Low Priced Edition, 2010

3. Date C. J., “An Introduction to Database Systems”, 8th edition, Addison-Wesley, Low

Priced Edition, 2003

4. Date C. J. and Darwen H., “A Guide to the SQL Standard”, 4th edition, Addison-Wesley,

2003

5. Hansen G. W. and Hansen J. V., “Database Management and Design”, 2nd edition,

Prentice- Hall of India, Eastern Economy Edition, 1999

6. Majumdar A. K. and Bhattacharyya P., “Database Management Systems”, 5th edition,

Tata McGraw- Hill Publishing, 1999

7. Looms, “Data Management & File Structure”, Prentice Hall of India, 1989

http://shop.oreilly.com/product/9780596009779.do#tab_04_0

22

MCA-105 A OBJECT ORIENTED PROGRAMMING USING C++ L T P Cr

4 0 0 4

OBJECTIVE: Providing a sound conceptual understanding of the fundamental concepts of computing hardware, software, networking and services; build programming logic and thereby developing skills in problem solving using C++ programming language; Introduce the concept of object orientation and on how to handle data in different forms; Emphasize the concepts and constructs rather than on language features.

.

1. OBJECT ORIENTED CONCEPTS& INTRODUCTION TO C++: Introduction to

objects and object oriented programming, difference between procedure oriented & Object

oriented programming; main feature of Object oriented programming: Class, Object,

encapsulation (information hiding); Polymorphism: overloading, inheritance, overriding

methods, abstract classes, access modifiers: controlling access to a class; method, or variable

(public, protected, private, package); other modifiers; Basics of C++,Simple C++ Programs,

preprocessors directives, Namespace, Memory management operators in C++, Inline

function, default arguments, & reference types

2. CLASSES AND DATA ABSTRACTION: Introduction; structure definitions;

accessing members of structures; class scope and accessing class members; separating

interface from implementation; controlling access function and utility functions, initializing

class objects: constructors, usingdefault arguments with constructors; using

destructors; classes : const(constant) object and const member functions, object

as member of classes, friend function and friend classes; using this pointer, dynamic

memory allocation with new and delete; static class members& function; container

classes and integrators;.

3. OPERATOR OVERLOADING, TEMPLATE &EXCETION HANDLING:

Introduction; fundamentals of operator overloading; restrictions on operators overloading;

operator functions as class members vs. as friend functions; overloading, <<; >> overloading

unary operators; overloading binary operators. Function templates; overloading template

functions; class template; class templates and non- type parameters; basics of C++

exception handling: try, throw, catch, throwing an exception, catching an exception, re-

throwing an exception

4. INHERITANCE, VIRTUAL FUNCTIONS AND POLYMORPHISM: Introduction,

inheritance: base classes and derived classes, protected members; casting base-class pointers

to derived-class pointers; using member functions; overriding base–class members in a

derived class; public, protected and private inheritance; using constructors

and destructors in derived classes; implicit derived–class object to base-class object

conversion; composition vs. inheritance; virtual functions; abstract base classes and

concrete classes; polymorphism; new classes and dynamic binding; virtual destructors;

polymorphism; dynamic binding.

5. FILES AND I/O STREAMS: Files and streams; creating a sequential access file; reading

data from a sequential access file; updating sequential access files, random access

23

files; creating a random access file; writing data randomly to a random access file;

reading data sequentially from a random access file; stream input/output classes and

objects; stream output; stream input; unformatted I/O (with read and write); stream

manipulators; stream format states; stream error states.

TEXT BOOK

1. Balagurusam y , E., ―Object Oriented Programming with C++‖, Prentice Hall of India, 2008

S childt, Herbert ―C++: The Complete Reference‖, Tata McGraw Hill, 3rd Ed, 2008

REFERENCE BOOKS

2. Kamthane, ―Object Oriented Programming with ANSI and Turbo C++‖, Pearson

Education

3. Lafore, Robert, ―Object Oriented Programming in Turbo C++‖, The WAITE Group Press,

1994


5. Bhave, ―Object Oriented Programming with C++‖, Pearson Education.

24

MCA-107A Computer Organization and Architecture L T P Cr

3-0-0 3

1. Introduction of Computer and Computer Arithmetic: Store Program Concept, Flynn‟s

Classification of computers, Von Neumann Architecture, Generation of Computer, Classification

of Computers, Addition And Subtraction With Signed-Magnitude, Multiplication Algorithm,

Booth Multiplication Algorithm, Array Multiplier, Division Algorithm, Hardware Algorithm,

Divide Overflow, Floating-Point Arithmetic Operations, BCD Adder, BCD Subtraction.

2. Organization of a computer: Stack Organization, Register Stack, Memory Stack, Instruction

Formats, Three- Address Instructions, Two – Address Instructions, One- Address Instructions,

ZeroAddress Instructions, RISC Instructions, Addressing Modes Reduced Instruction Set

Computer, CISC Characteristics RISC Characteristics.

3. Input Output and Memory Organization: Modes of Transfer, Priority Interrupt, DMA,

Input-Output Processor (IOP), CPUIOP Communication, Memory Hierarchy, Main Memory,

Auxiliary Memory, Cache Memory, Virtual Memory. Address Space and Memory Space, cache

memory: associative &direct mapped cache organizations.

4. Pipelining and Superscalar Techniques: Linear pipeline processor – asynchronous and

synchronous model, clocking and timing control, speedup, efficiency and throughput. Nonlinear

Pipeline Processor – reservation and latency analysis, collision free scheduling; Instruction

Pipeline Design – principles & mechanisms; dynamic instruction scheduling, branch handling

techniques, branch prediction.Arithmetic Pipeline Design - computer arithmetic principles,

static Arithmetic pipeline.

5. Multiprocessor Architectures: Symmetric shared memory architectures, distributed shared

memory architectures, models of memory consistency, cache coherence problem, Snoopy cache

coherence protocol, directory-based protocols, design challenges of directory protocols, memory

based directory protocols, cache based directory protocols, protocol design tradeoffs,

synchronization,

Text Books:

1. Kai Hwang, “Advanced computer architecture”; TMH, 1993.

2. “Computer System Architecture”, M.Morris Mano

References: -

1. “Computer System Architecture”, John. P. Hayes.

2. “Computer Architecture and parallel Processing “, Hwang K. Briggs.

3. D.Sima, T.Fountain, P.Kasuk, “Advanced Computer Architecture-A Design space

Approach,” Addison Wesley, 1997.

25

MCA-109 A OPERATING SYSTEMS L T P Cr

3 0 0 3

OBJECTIVE

To provide the knowledge of internals, different types and purpose of operating systems

PRE-REQUISITES

Knowledge of computer organization and architecture programming skills

1. INTRODUCTION: Introduction to operating system concepts (including multitasking, multiprogramming, multi user, multithreading, etc)., types of operating systems: batch operating system, time-sharing systems, distributed OS, network OS, real time OS, embedded and smart card OS, various operating system services, architecture, system programs and calls.

2. PROCESS MANAGEMENT: Process concept, Life cycle and implementation of process, Thread usage and implementation in user space and in kernel, process scheduling, operation on processes, CPU scheduling, scheduling criteria, scheduling algorithms -First Come First Serve (FCFS), Shortest-Job-First (SJF), priority scheduling, Round Robin (RR), multilevel feedback queue scheduling. Deadlocks, Deadlock characteristics, prevention, avoidance using banker‟s algorithm, detection and recovery; Critical section problems, mutual exclusion with busy waiting, Process synchronization, semaphores: binary and counting semaphores, Classical IPC problems: dining philosophers‟ problem, readers-writers problem.

3. MEMORY MANAGEMENT: Logical & physical address space, swapping, contiguous memory allocation, non-contiguous memory allocation paging and segmentation techniques, segmentation with paging, virtual memory management - demand paging & page-replacement algorithms, demand segmentation.

4. I/O AND FILE YSTEMS: I/O hardware, device controllers, interrupt handlers, device drivers, application I/O interface, kernel, transforming I/O requests, performance issues,Different types of files and their access methods, directory structures, various allocation methods, disk scheduling and management and its associated algorithms, introduction to distributed file system.

5. LINUX/UNIX SYSTEM: LINUX/UNIX architecture, UNIX system calls for processes and file system management, basic commands of LINUX/UNIX, shell interpreter, shell scripts.

TEXT BOOK

1. William Stallings, Operating System: Internals and Design Principles, Prentice Hall, 8th

Edition, 2014, ISBN10: 0133805913 • ISBN13: 9780133805918

26

2. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, Operating System Concepts,

John Wiley & Sons ,Inc., 9th Edition,2012, ISBN 9781118063330

3. Maurice J. Bach, “Design of UNIX Operating System”, PHI

4. T1: Silberchatz et al, “Operating System Concepts”, 5th

edition, Addison-Wesley, 1998

REFERENCE BOOKS

1. Tom Adelstein and Bill Lubanovic, Linux System Administration, O'Reilly Media, Inc.,

1st Edition, 2007.ISBN10: 0596009526 | ISBN13: 9780596009526

2. Harvey M. Deitel, Operating Systems, Prentice Hall, 3rd Edition,2003, ISBN10:

0131828274 | ISBN13: 9780131828278

3. Andrew S. Tanenbaum, Modern Operating System, Prentice Hall, 3rd Edition,

2007,ISBN10: 0136006639 | ISBN13: 9780136006633

4. Operating System in depth by Thomson

5. Tanenbaum A., “Modern Operating Systems”, Prentice-Hall, 1992

6. Stallings William, “Operating Systems Internals and Design Principles”, 4th edition,

Prentice-Hall, 2001

7. Dhamdhere D. M., “Operating System”, 2nd

Edition, Tata McGraw Hill, 1999

8. Kernighan Brian and Pike Rob, “The Unix Programming Environment”, Prentice Hall of

India, 1984

9. Bach Maurich, “Design of the Unix Operating System”, Prentice Hall of India, 1986

10. Muster John, “Introduction to UNIX and LINUX”, Tata McGraw Hill, 2003

11. Ritchie Colin, “Operating System Incorporating Unix & Windows”, Tata McGraw Hill,

1974

12. Madnick Stuart and Donovan John, “Operating Systems”, Tata McGraw Hill, 2001

13. Deitel, “Operating Systems”, Addison-Wesley, 1990

14. SinghalMukesh and Shivaratri N.G., “Operating Systems”, Tata McGraw Hill, 2003

27

MCA-110A ANALYSIS & DESIGN OF ALGORITHMS L T P Cr

4 0 0 4

Objective:

To relay the theoretical and practical aspects of design of algorithms

PRE-REQUISITES

Knowledge of fundamentals of basic computer programming for implementing

algorithms.

1. BRIEF REVIEW: Growth of functions, Asymptotic Notations, Representation of Graphs,

Breadth First Search, Depth First Search and Data Structures for Disjoint Sets.

2. DIVIDE AND CONQUER: General method; binary search; merge sort; quick sort; selection

sort; Strassen„s matrix multiplication algorithms and analysis of algorithms for these problems.

3. GREEDY AND DYNAMIC ALGORITHMS : Activity selection; Fractional Knapsack, Job

Sequencing with dead line; task scheduling problem. Matrix multiplications; 0/1 knapsack; the

traveling salesperson problem.

4. ELEMENTARY GRAPH ALGORITHM AND TREES: Representation of Graph; Breadth-

first search, Depth first search; topological sort; strongly connected components , Growing a

minimum spanning tree; Kruskal & Prims algorithms; Single source shortest path: Dijkstra‟s

algorithm.

5. BACK TRACKING: General method; 8 queens‟ problem; graph colouring; Hamiltonian

cycles; analysis of these problems. Introduction to NP hard & NP complete

TEXT BOOKS

Cormen Thomas H., Leiserson Charles E. and Rivest Ronald L., “Introduction to Algorithms”,

Tata McGraw Hill, 1990

REFERENCES:

1. A. V. Aho, J. E. Hopcroft, J. D. Ullman, “The Design and Analysis of Computer Algorithms”,

Addition Wesley, 1998.

2. Ellis Horowitz and Sartaz Sahani, “Computer Algorithms”, Galgotia Publications, 1999.

3. D. E. Knuth, “The Art of Computer Programming”, 2 ndEd., Addison Wesley, 1998.

4. Trembley Jean Paul and Bunt Richard B., “Introduction to Computers Science - An

Algorithms Approach”, Tata McGraw Hill, 2002

28

MCA-111A Software Engineering Principles L T P Cr

3 0 0 3

UNIT-I:- Software Processes: Processes projects and products, Component software processes,

characteristics of a software process, software Development Process, project management

process, software configuration management process, software configuration management

process, process management process. Software requirement Analysis and Specification:

Software requirement, need for SRS, requirement process, problem analysis, analysis issues.

Informal approach, structured analysis, object oriented modeling, other modeling approaches,

prototyping, requirement specification, characteristics of an SRS, component of an SRS,

specification languages, structure of requirement document validation requirement reviews, other

method metrics, size measures, quality metrics.

UNIT-II- Planning Software Project:- Cost estimation, uncertainties in cost estimation,

building cost estimation models, on size estimation, COCOMO model, project scheduling,

average duration estimation, project scheduling and milestones, staffing and personnel planning,

rayleigh curve, personnel plan, team structure, software configuration management plans, quality

assurance plans, verification and validation, project monitoring plans, risk management.

UNIT-III- Function Oriented Design:- Design principles, coupling, cohesion, design notation

and specification, structured design methodology, verification, network metrics, stability metrics,

information flow metrics Software Testing.

UNIT-IV- Testing Methods : Software testing fundamentals, test case design, white box

testing, control structure testing, black-box testing, testing for specialized environments.

Software Testing Strategies: A Strategic Approach to software testing, strategic issues, unit

testing, validation testing, system testing, the art of debugging

UNIT-V - Re-Engineering : Software re-engineering, software maintenance, a software

reengineering process model, reverse engineering, reverse engineering user interfaces,

restructuring, code restructuring, data restructuring, forward engineering the economics of

reengineering. Client/Server software Engineering: The structure of client/server systems,

software engineering for c/s systems, analysis modeling issues, design for C/S systems, testing

issues. Computer-Aided software Engineering: What is case, building blocks for case, a

taxonomy of case tools, integrated case environments, the integration architecture, the case

repository.

29

Text Books:

1. Presman Roger, Software, Engineering: A Practitioner‟s Approach Tata McGraw Hill, New

Delhi.

2. Jalote Pankaj, An Integrated Approach to Software Engineering Narosa, New Delhi.

Reference Books:

1. R.E. Fairly. Software Engineering Concepts. McGraw Hill, Inc 1985.

2. Poyce, Software Project Management, Addison-Wesly.

3. Sommerville , Software Engineering, Addison-Wesly.

30

MCA-153 A Relational DATABASE MANAGEMENT SYSTEMS

LAB

L T P Cr

0 0 3 2

1. Introduction to PL/SQL

2. Write a program to carry out

a. Creation of table

b. Insertion of data into table

c. Viewing of data into table: All rows and all columns, Selected columns and all

rows, Selected rows and all columns, Selected rows and selected columns,

Elimination of duplicates from selected statements, Sorting of data into a table.

d. Deletion of data from given table: Removal of all rows, Removal of selected rows

e. Updating of table contents: Updating all rows, Updating of record conditionally

f. Modifying the structure of table: Adding new column, Modifying existing column

g. Renaming tables

h. Destroying tables

i. Examining objects created by user: Finding tables created by user, Finding

column details of table created

j. Computation on table data: Arithmetic operators, Logical operators ( AND, OR,

NOT), Range searching ( BETWEEN, NOT BETWEEN), Pattern matching

(LIKE, IN, NOT IN)

3. Oracle set functions (Scalar, Group & Pattern Matching Operator): AVG, SUM, MIN,

MAX, COUNT, COUNT(*), ABS, ROUND, LENGTH, SUBSTR, POWER, SQRT,

LOWER, UPPER, LPAD, RPAD, LTRIM, RTRIM

4. Data constraints at column level and at table level: NULL value concept, UNIQUE

constraints, Primary key constraint, Foreign key constraint, Check constraint.

5. VIEWS: Creation of views, Renaming of columns in view, Selection, Updation, Destroy

6. Grouping Data from tables in SQL

7. INDEXES

8. SEQUENCES

9. Granting and Revoking Permissions in SQL

10. CURSORS & its Applications

11. Create Function and use Cursor in Function

12. TRIGGERS

13. Hands on Exercises

REFERENCE BOOKS

1. SQL, PL/SQL the Programming Language of Oracle, Ivan Bayross

2. Date C. J. and Darwen H., “A Guide to the SQL Standard”, 4th edition, Addison-Wesley,

2003

3. Desai Bipin, “Introduction to Database Management System”, Galgotia Publications, 1991

4. Date C. J., “An Introduction to Database Systems”, 8th edition, Addison-Wesley, Low Priced

Edition

31

43. Write a program to Create a file and store text and display the contents.

MCA-155 A OBJECT ORIENTED PROGRAMMING USING C++LAB L T P Cr

0 0 3 2

LIST OF EXPERIMENTS:

BASIC CONCEPT OF C++

1. Write a program to show the concept reference type, call by reference & return by reference in C++

2. Write a program to show the concept of default arguments in C++

3. Write a program to show the concept of inline function

4. Write a program to show the concept of dynamic memory management in C++

5. Write a program to show the concept of function overloading

CLASS & OBJECTS

6. Write a C++ program to show the concept of class & object

7. Write A C++ program showing function taking objects as a arguments and function returning objects

8. Write C++ programs to show the concept of static data member & static member function

9. Write C++ program to show the concept of friend function

10. Write C++ program to show the concept of different type of constructor

11. Write C++ program to show the concept of destructor

OPERATOR OVERLOADING

12. Write a C++ program showing overloading of unary operator using member function & friend function

13. Write a C++ program showing overloading of binary operator using member function & friend function

14. Write a C++ program showing overloading of << and >> operators

INHERITANCE

15. Write a C++ program to show the concept of multilevel inheritance

16. Write a program to show the concept of multiple inheritance

17. Write a C++ program to show the concept of hybrid inheritance

32

18. Write a program to show the concept of virtual base class

DYNAMIC BINDING & VIRTUAL FUNCTION

19. Write a C++ to show the concept of virtual function to implement dynamic binding

20. Write a C++ program to show the concept of pure virtual function & abstract class

FILES HANDLING

21. Write C++ programs for creating, reading& writing sequential access file

22. Write C++ programs for creating, reading & writing random access file

TEMPLATES

23. Write a C++ program to show the concept of class template

24. Write a C++ program to show the concept of function template

TEXT BOOK


7. Schildt, Herbert ―C++: The Complete Reference‖, Tata McGraw Hill, 3rd Ed, 2008

REFERENCE BOOKS

8. Kamthane, ―Object Oriented Programming with ANSI and Turbo C++‖, Pearson Education

9. Lafore, Robert, ―Object Oriented Programming in Turbo C++‖, The WAITE Group Press, 1994


11. Bhave, ―Object Oriented Programming with C++‖, Pearson Education.

33

MCA-159 A Operating System lab L T P Cr

0 0 3 2

List of Experiments

Part – 1 : Introduction to Operating System

1 Operating System: Concept & Services

2 Process Management

3 Memory Management

4 File System

5 Deadlocks

Part – 2 : Windows 2003 Operating System

6 Study of Windows 2003 Operating System

7 Various services available in Windows 2003 Server

8 Internal/system commands for network and system monitoring in Windows

2003 Server

9 Difference between the Windows 2003 Server and Windows 2003 Client

software

Part – 3 : Linux Operating System

10 Study of Linux Operating System

11 Internal System commands and Control Structure in Linux OS

12 Processes and Threads in Linux Operating System

13 Systems and Function Calls in Linux OS

14 Writing of shell scripts in Linux OS

15 AWK Programming in Linux OS

Part – 4 : MacOS : Case Study

16 Study of MacOS Features

17 Internal System commands for network and system monitoring in MacOS

18 Primitive Communications Tool in MacOS

19 Message Queues used in MacOS

20 Pipes: Unnamed Pipes, Named Pipes in MacOS

34

2nd

Year


35

MCA 201A Computer Graphics and Multimedia L T P Cr

4 0 0 4

1. INTRODUCTION: What is computer graphics, computer graphics applications, computer

graphics hardware and software, two dimensional graphics primitives: points and lines, line drawing

algorithms: DDA, Bresenhem; circle drawing algorithms: using polar coordinates, Bresenhem circle

drawing, midpoint circle drawing algorithm; polygon filling algorithm, boundary filled algorithm,

scan-line algorithm, flood fill algorithm.

2. TWO DIMENSIONAL VIEWING Clipping : The 2-D viewing pipeline, windows, viewports,

window to View port mapping; clipping: point, clipping line (algorithms): 4 bit code algorithm,

Sutherland-Cohen algorithm, parametric line clipping algorithm (Cyrus Beck). Sutherland-Hodgeman

polygon clipping algorithm

3. 2D TRANSFORMATION & 3D GRAPHICS: :, Homogeneous coordinates system, two

dimensional transformations: transformations, translation, scaling, rotation, reflection, shearing,

transformation, composite transformation. Three dimensional graphics concept, matrix

Representation of 3-D transformations, composition of 3-D transformation.

4. BASICS OF MULTIMEDIA TECHNOLOGY & Applications

Computers, communication and entertainment, multimedia an introduction; framework for

multimedia systems; multimedia devices; CD Audio, CD-ROM, CD-I, presentation devices and the

user interface; multimedia presentation and authoring; professional development tools;

APPLICATIONS OF ENVIRONMENT IN VARIOUS FIELDS.

5. LAN AND MULTIMEDIA: internet, World WideWeb and multimedia distribution network:

ATM & ADSL; multimedia servers and databases; vector graphics; 3D graphics programs;

animation techniques; shading; anti aliasing; morphing; video on demand.

Text book

1. Computer Graphics – Donald Hearn & M.Pauline Baker, Prentice Hall of India

and References:

1. Rogers, "Procedural Elements of Computer Graphics", McGraw Hill

2. Asthana, Sinha, "Computer Graphics", Addison Wesley Newman and Sproul, "Principle

of Interactive Computer Graphics", McGraw Hill

3. Steven Harrington, "Computer Graphics", A Programming Approach, 2nd Edition

36

4. Rogar and Adams, "Mathematical Elements of Computer Graphics", McGraw Hill.

5 Villamil and Molina, “An Introduction to Multimedia”,MacMillan, 1997

6 Lozano, “Multimedia: Sound & Video”, Prentice Hall of India/Que, 1997

7 Parekh Ranjan, “Principle of Multimedia”, Tata McGraw Hill, 2006

8 Villamil and Molina, “Multimedia: Production, Planning and Delivery”, Que, 1997

9. Sinclair, “Multimedia on the PC”, BPB Publications

10. Vaughan Tay, “Multimedia: Making It Work”, 6th

Edition, Tata McGraw Hill, 2004

11. Shuman James E., “Multimedia in Action”, Wadsworth Publications, 1997

12. Judith Jeff Coate, “Multimedia in Practice”, Prentice Hall of India, 1995

13. Koegel John F., “Multimedia Systems”, Addison Wesley Ltd., 1994

14. Halsall and Fred, “Multimedia Communications”, Addison Wesley, 2001

37

MCA-206 A CORE AND ADVANCE JAVA

L T P Cr

4 0 0 4

OBJECTIVE

To relay the theoretical and practical knowledge of Advanced Java programming language

PRE-REQUISITES

Basic Knowledge of programming language and object oriented programming

1. CORE JAVA: Introduction to Java; Data types; variables; operators; Arrays; Control

Statements; Classes & Methods; Inheritance; Exception Handling; Multithreading;

Collections; I/O streams; AWT & Applet Programming; Swings.

2. NETWORK PROGRAMMING & JAVA DATABASE CONNECTIVITY: Networking

basics; Socket; port; Proxy servers; Internet addressing and URL; java.net –networking classes

and interfaces; Implementing TCP/IP based Server and Client. Classes to be covered Socket;

ServerSocket; IP Address; URL connections: Types of JDBC Drivers; Writing JDBC applications

using select; insert; delete; update; Types of Statement objects (Statement; PreparedStatement and

CallableStatement); ResultSet; ResultsetMetaData; Inserting and updating records.

3. REMOTE METHOD INVOCATION AND JAVA BEANS: Introduction of RMI &

Architecture; Implementing RMI Methods; Introduction to Java Bean; Rules for writing a Simple

Bean; Using Beans to Build an Application.

4. SERVLETS: Configuring directory structure for a web application; Servlet API Overview;

Writing and running Simple Servlet. Servlet Life; Cycle; GenericServlet and HttpServlet;

ServletConfig & ServletContext; Writing servlet to Handle Get and Post Methods; Reading user

request data; Concept of cookie; Reading and writing cookies

5. JAVA SERVER PAGES & STRUCTS: Why JSP? JSP Directives; writing simple JSP page;

Scripting Elements; JSP Actions: JSP & Java Beans; JSP Actions: include; forward and plugin;

Managing sessions using JSP; JSP & Databases; Error Handling in JSP; Writing custom tags;

Different scopes in a JSP page; Using JDBC in JSP; Study and Development of a Web

Application and an Assignment. A Web Application Framework – struts-config.xml;

Understanding MVC architecture; Action\Servlet; Action\Form; Action\Mapping; Action classes.

REFERENCE BOOKS

1. Horetmann Cay and Cornell Gary, “Core JavaTM

2, Volume II – Advanced Features”, 7th

Edition,

Pearson Publisher, 2004.

2. Horetmann Cay and Cornell Gary, “Core Java Volume – I”, Pearson Education.

3. Callway Dustin R., “Inside Servlets”, Pearson Education.

4. Goodwill James and Bryan Morgan, “Developing Java Servlets”, Techmedia.

5. “Java Server Programming, Volume I and II”, Wrox Press.

6. Keogh Jim, “The Complete Reference J2EE”, Tata McGraw Hill.

7. O‟Reilly, “Servlet and JSP”.

8. Naughton Parick, Schildt Herbert, ”Java TM 2: The Complete Reference, Third Edition”, Tata

MacGraw-Hill Publishing Company Limited NEW DELHI.

38

MCA-208 A PROGRAMMING USING C# L-T-P Cr

3-1-0 4

OBJECTIVE To equip students with C# programming Concepts

1. PHILOSOPHY OF .NET AND ITS. MAJOR COMPONENTS: Origin of .NET technology; .NET platform; benefits and limitations of .NET; building blocks of .NET framework; .NET programming languages; .NET types and namespaces. Understanding CLR; CTS and CLS; Developing C# Applications using Visual Studio .Net

2. EVOLUTION OF C#: comparison among C++; Java and C#; benefits of C#; object-oriented programming using C#

3. C# PROGRAMMING: introduction to C#; creating a C# program; types in C#; classes; inheritance and polymorphism; methods; statements and control; arrays and strings; interfaces; abstract and base classes.

4. STATEMENTS AND CONTROL: properties and indexers; delegates and their usefulness; attributes; I/O in C#; exception and error handling in C#; C# and windows application.

5. ADO .NETAND ASP .NET: Comparison of ADO and ADO. NET; introduction to data access with ADO.NET components of ADO.NET; Comparison of ASP and ASP .NET; features of ASP .NET; features provided by ASP .NET; web forms and their components; web services.

REFERENCE BOOKS

1. Balaguruswammy, E, “Programming in C#”, Tata McGraw Hill 2. Jain, V K, “The Complete Guide to C# Programming”, IDG Books India. 3. Pappas & Murray, “C# Essentials”, Prentice Hall of India 4. Gunnerson Eric, “A programmer‟s Introduction to C#”, IDG Books 5. Wakefield, “C# and .NET Web Developers Guide”, IDG Books India

39

MCA-215 A COMPUTER SOFTWARE

TESTING

L T P Cr 3 0 0 3

OBJECTIVE

To develop deep understanding about computer software testing methodologies and tools

PRE-REQUISITES

Knowledge of programming, software engineering, software project management

1. FUNDAMENTALS & TESTING TYPES: First, second and later cycles of testing, Objectives and limits of testing, Overview of software development stages, Planning and Design stages and testing during these stages. Glass box code, Regression and Black box testing, Software errors, Categories of software error

2. REPORTING BUGS&PROBLEM TRACKING SYSTEM: Problem reports, Content and Characteristics of Problem Report, analysis and Tactics for analyzing a reproducible bug, Making a bug reproducible; Objective of Problem Tracking System, tasks of the system, Problem tracking overview, users of the tracking system, mechanics of the database

3. TEST CASE DESIGN: Characteristics of a good test, equivalence classes and boundary values, visible state transitions, Race conditions and other time dependencies, load testing. Error guessing, Function equivalence testing, Regression Testing, General issues in configuration testing, printer testing

4. LOCALIZATION AND USER MANUALS TESTING: Translated text expands, Character sets, Keyboards, Text filters, Loading, saving, importing, and exporting high and low ASCII, Operating system Language, Hot keys, Error message identifiers, Hyphenation rules, Spelling rules, Sorting Rules, Uppercase and Lowercase conversion, Printers, Sizes of paper, CPU„s and video, Rodents, Data formats and setup options, Rulers and measurements, Culture-bound Graphics and output, European product compatibility, Memory availability, automated testing, Testing User Manuals, Effective documentation, documentation tester„s objective, How testing documentation contributes to software reliability

5. TESTING TOOLS &MANAGEMENT ISSUES OF TESTING: Fundamental tools, automated acceptance and regression tests, standards, translucent box testing Overall objective of the test plan: product or tool? Detailed objective, type of test, strategy for developing components of test planning documents, components of test planning documents, documenting test materials: Software Development tradeoffs and models, Quality-related costs, The development time line, Product design, alpha, Pre-beta, Beta, User Interface freeze, Pre- final, Final integrity testing, Project post-mortems, Legal consequences of defective software, Managing and role of a testing group, independent test agencies

TEXT BOOK

Cem Kaner,Jack Falk and Hung Quoc Nguyen, ―Testing Computer Software‖, 2nd Edition,

Wiley, 1999.

REFERENCE BOOKS

1. Craig, Jaskiel, ―Systematic Software Testing‖, Artech House, 2002

2. Aditya P. Mathur, ―Foundation of Software T esting ‖, 1st Edition, Pearson Education,

2008

3. Bauersfeld, ―Software by Design: Creating People Friendly Software‖, M&T Books, New York,

1994

4. Beck, ―Test Driven Development‖, Addison-Wesley Signature Series, Library of Congress

40

Catalogingin-Publication, 5th Edition, 2004.

5. Elfriede Dustin, ―Effective Software Testing: 50 Specific Ways to Improve Your T esting ‖,

1st Edition, Addison-Wesley, 2002.

6. Freedman, Weinberg, ―Handbook of Walkthroug hs, Inspections & Technical Reviews‖, 3rd

Edition, Dorset House, 1990.

41

MCA-218 A Object oriented software Engineering & UML L T P Cr

3 0 0 3

UNIT I

Introduction: Object Oriented system concepts and Principles, Object Oriented system development,

Component reuse, The common process framework for Object Oriented processes, System

Development and Methodologies, object oriented software estimation.

UNIT II

System development: System as model building, model architecture, The importance of modeling,

principle of modeling, object oriented modeling, Introduction to Object oriented

Methodologies such as Unified Modeling Language, Overview of UML, conceptual model of UML,

architecture, software development lifecycle using Rational Unified Process

UNIT III

Object Oriented Analysis: requirement model, analysis model, Object oriented analysis using

methods of Rumbaugh. Software Design: Software design Models, Object oriented methodologies of

Booch, design model, System development using various UML Diagrams.

UNIT IV

UML Methodology: Detailed study of various UML Diagrams, System Analysis using UML

Diagrams

UNIT V

Object Oriented Testing and metrics: Path Testing, State based testing, Class Testing, object oriented

metrics. Applications & Tools: A complete case study of Software development using above

Methodologies, Concepts of Computer-Aided Software Engineering and knowledge about current

CASE tools use in the industry.

Text Books:

1. R . S. Pressman, “Software Engineering – A practitioner‟s approach”, 5th Ed., McGraw Hill Int.

Ed., 2001.

2. I. Jacobson, M. Christerson, P. Jonsson, G. Overgaard, “Object Oriented Software Engineering”,

2nd Edition, Pearson Education, 2007.

3. G. Booch, J Rumbaugh, I Jacobson, “The Unified Modeling Language User Guide” 11th Ed.,

Pearson Education, 2003.

4. Y.Singh, R.Malhotra, "Object Orinted Software Engineering", PHI Learning, 2012.

Reference Books:

42

1 I. Sommerville, “Software Engineering”, Addison Wesley, 2004

MCA-219 A Cyber Laws and Intellectual Property Right

L T P Cr

0 0 3 2

Unit I Intellectual Property & Information Technology IPR:- Introduction, Protection of

Intellectual Property Copyright, Related Rights, Patents, Industrial Designs, Trademark, Unfair

Competition. Information Technology Related Intellectual Property Rights Computer Software and

Intellectual Property-Objective, Copyright Protection, Reproducing, Defences, Patent Protection.

Database and Data Protection-Objective, Need for Protection, UK Data Protection Act, 1998, US Safe

Harbor Principle, Enforcement. Protection of Semiconductor Chips-Objectives Justification of

protection, Criteria, Subject-matter of Protection, WIPO Treaty, TRIPs, SCPA. Domain Name

Protection-Objectives, domain name and Intellectual Property, Registration of domain names,

disputes under Intellectual Property Rights, Jurisdictional Issues, and International Perspective.

Unit II Patents (Ownership and Enforcement of Intellectual Property):- Patents-Objectives,

Rights, Assignments, Defences in case of Infringement CopyrightObjectives, Rights, Transfer of

Copyright, work of employment Infringement, Defences for infringement Trademarks-Objectives,

Rights, Protection of good will, Infringement, Passing off, Defences. Designs-Objectives, Rights,

Assignments, Infringements, Defences of Design Infringement

Unit III Enforcement of Intellectual Property Rights:- Civil Remedies, Criminal Remedies,

Border Security measures. Practical Aspects of Licencing – Benefits, Determinative factors,

important clauses, licensing clauses.

Unit VI Cyber Law:- Basic Concepts of Technology and Law : Understanding the Technology of

Internet, Scope of Cyber Laws, Cyber Jurisprudence Law of Digital Contracts : The Essence of

Digital Contracts, The System of Digital Signatures, The Role and Function of Certifying Authorities,

The Science of Cryptography Intellectual Property Issues in Cyber Space: Domain Names and

Related issues, Copyright in the Digital Media, Patents in the Cyber World. Rights of Netizens and E-

Governance : Privacy and Freedom Issues in the Cyber World, EGovernance, Cyber Crimes and

Cyber Laws

Unit VI Information Technology Act 2000:- Information Technology Act-2000-1, Information

Technology Act-2000-2 (Sec 14 to 42 and Certifying authority Rules), Information Technology Act-

2000-3 (Sec 43 to 45 and Sec 65 to 78), Information Technology Act-2000-4(Sec 46 to Sec 64 and

CRAT Rules), Information Technology Act-2000-5 (Sec 79 to 90), Information Technology Act-

2000-6 ( Sec 91-94) Amendments in 2008.

43

MCA-251 A Computer Graphics and Multimedia L T P Cr

0 0 3 2

List of Experiments

PART -1 Basics/Inbuilt functions in computer graphics

1 To draw a line using inbuilt functions.

2 To draw a circle/Ellipse using inbuilt functions.

3 To draw a rectangle using inbuilt functions.

4 To change the background and foreground color using inbuilt functions.

5 To fill area using inbuilt functions.

6 To draw a triangle using inbuilt functions and a circle is centered at each corner of

the triangle.

PART-2 Line/circle/ellipse drawing algorithms

7 To draw a line using DDA Line drawing algorithm.

8 To draw a line using Bresenhem Line drawing algorithm.

9 To draw a circle using eight way symmetry.

10 To draw a circle using incremental circle drawing algorithm.

11 To draw a circle using mid point/Bresenhem circle drawing algorithm.

12 To draw an Ellipse using midpoint ellipse drawing algorithm.

PART-3 Polygon Filling/Area Filling/Region filling

13 Polygon filling/area filling using boundary fill algorithm.

14 Polygon filling/area filling using flood fill algorithm.

15 Polygon filling/area filling using Scan line algorithm.

PART-4 2D Clipping/2D Transformation /Window to View port mapping

16 To clip a line using Midpoint Line clipping algorithm.

17 To clip a line using Cohen Sutherland /Four bit op-code line clipping algorithm.

18 To clip a line using Cyrus Back line clipping algorithm.

19 To implement a clock.

20 To implement a screen saver.

21 To transform a 2D object (Line, Rectangle, circle) using

1 Translation

2 Scaling

3 Rotation

4 Reflection

5 Shearing

22 To transform a 2D object (Line, Rectangle, circle) using Homogenous Coordinate

system.

1 Translation

2 Scaling

44

3 Rotation

4 Reflection

5 Shearing

23 To transform window to view port.

24 To zoom an object.

25 To perform reverse zooming.

PART-5 Projection and 3D Transformation

26 To perform perspective projection.

27 To perform parallel projection.

28 To perform 3D Transformation.

1 Translation

2 Scaling

3 Rotation

List of Experiments Based on Multimedia

29 Create Motion Tweening using Macromedia Flash(Moving Ball).

30 Create Spot Light using Macromedia Flash.

31 Create Shape Tweening using Macromedia Flash.

32 Create Shadow of building that change according to position of Sun using

Macromedia Flash.

33 Create and show the use of guided layer using Macromedia Flash(Any Example).

34 Create Animated Pool Table.

35 Create Animated Birthday card.

36 Create Bow & Arrow hitting a Ball.

37 Create Masking Effect with Motion Twinning.

38 Create Animation of Moving Car.

45

MCA-256 A CORE AND ADVANCE JAVA LAB L T P Cr

0 0 3 2

LIST OF EXPERIMENTS

Part -1 : Simple classes and methods

1 Write a program to print “Hello Java”.

2 Write a program to find the area of a room using two classes.

3 Program that calculates and prints the simple interest using the formula: simple

interest=PNR/100 Input values P, N, R should be accepted as command line input

as below, e.g. java Simple interest 5 10 15

4 Write a program to find the greatest of the following numbers:

325, 712, 478

Part -2 : Array implementation

5 Write a program to tell that how many numbers are evens and odds in the

followings: 50, 65, 56, 71, 81

6 Write a program to sort the following numbers in ascending orders.

55, 40, 80, 65, 71

7 Write a program to print a pattern like:

1

2 2

3 3 3

4 4 4 4

5 5 5 5 5

Part -3 : Command line arguments, String Implementation

46

8 Write a program to implement command line arguments.

9 Write a program to arrange the following words in dictionary order.

Madras, Delhi, Ahmadabad, Calcutta, Bombay

Part -4 : Implementation of constructor & method overloading, overriding, nesting

10 Write a program to find the area of a room using Constructor.

11 Write a program to implement methods overloading.

12 Write a program to implement static keyword.

13 Write a program to implement “nesting of methods”.

14 Write a program to implement overriding of methods.

Part -5 : Inheritance, Package

15 Write a program to implement single inheritance.

16 Write a program to implement multiple inheritance.

17 Write a program to create your own package and use that package in another

program to print “ Hello package”.

Part -6 : Multithreading, Exception Handling, Applet programming

18 Write a program to implement multithreading using the system function like

yield(), stop(), sleep().

19 Write a program to implement multiple try/catch statements.

20 Write a program to print “Hello Java” using applet programming.

Part -7 : File Handling, Java Networking

21 Write a program to copy the content of one file into another using character

stream classes.

22 Write a program to copy the content of one file into another using byte stream

classes.

23 Write a program to find the IP address of a Local machine.

47

24 Write a program to find the IP address of a Remote machine.

25 Write a program to find the protocol, port number, host name, file name from a

URL address.

Part -8 : Awt, Swing, Collection, Java Database Connectivity

26 Write a program to implement a calculator in AWT

27 Write the programs to implement the followings in:-

JTable, JList, JTree, JCombobox, JColorChooser, JProgressBar

28 Write the programs to implement the followings in Collection:-

ArrayList, Vector, Map

29 Create a Java application to insert data in the product table using the Statement

object.

30 Create a Java application to execute a stored procedure that retrieves and displays

the information from the customer table.

Part -9 : Java RMI and Java Beans

31 Write a program to implement Java RMI.

32 Write a program to create a simple java bean.

Part -10 : Java server & JSP

33 Write a program to create a web page using Java server programming.

34 Write a program to create a web page using JSP.

48

CA-258 A C# PROGRAMMING LAB L-T-P Cr

0-0-3 2

LIST OF EXPERIMENTS

1. Write a program in C# illustrating the use of sequence, conditional and iteration construct.

2. Write a program in C# illustrating various operators like logical, arithmetical, relational, etc.

3. Write a program in C# illustrating overloading of various operators.

4. Write a program in C# illustrating use of friend, inline and Static Member functions, default arguments.

5. Write a program in C# illustrating use of destructor and various types of constructor.

6. Write a program in C# illustrating various forms of inheritance.

7. Write a program in C# illustrating use of virtual functions, Virtual base class, delegates.

8. Write a program in C# illustrating file operations.

9. Write a program in C# illustrating simple web applications using ASP.net

10. Write a program in C# illustrating use of Active X Controls.

49

MCA-209 A

Data Mining and Data Warehousing

L T P Cr

3 0 0 3

OBJECTIVE

This course introduces basic concepts, tasks, methods, and techniques in data mining. The

emphasis is on various data mining problems and their solutions. Students will develop an

understanding of the data mining process and issues, learn various techniques for data mining,

and apply the techniques in solving data mining problems using data mining tools and systems.

Students will also be exposed to a sample of data mining applications.

SYLLABUS:

1. DATA WAREHOUSING: Definition, usage and trends. DBMS vs data warehouse, data

marts, metadata, multidimensional data mode, data cubes, schemas for multidimensional

database: stars, snowflakes and fact constellations.

2. DATA WAREHOUSE ARCHITECTUREANDIMPLEMENTATION: OLTP vs. OLAP,

ROLAP vs MOLAP, types of OLAP, servers, 3-Tier data warehouse architecture, distributed and

virtual data warehouses, data warehouse manager, Computation of data cubes, OLAP queries

manager, data warehouse back end tools, complex aggregation at multiple granularities, tuning

and testing of data warehouse.

3. DATA MINING &ITS CURRENT TRENDS: Definition and task, KDD versus data

mining, data mining techniques, Spatial databases, multimedia databases, time series and

sequence data, mining text databases and mining Word Wide Web tools and applications.

Strategy and business model current trends in data mining, open research area should be added in

the course.

4. DATA MINING QUERY LANGUAGES: Data specification, specifying knowledge,

hierarchy specification, pattern presentation and visualization specification, data mining

languages and standardization of data mining.

5. DATA MINING TECHNIQUES: Association rules, clustering techniques and

implementation, decision tree knowledge discovery through neural networks and genetic

algorithm, rough sets, support vector machines and fuzzy techniques.

Text Book:- Data Mining Techbniques by ArjunPujri,PHI, Publication

References:

1. Berson, “Data Warehousing, Data-Mining & OLAP”, TMH

50

2. Mallach, “Decision Support and Data Warehousing System”, TMH

3. Bhavani Thura-is-ingham, “Data-Mining Technologies, Techniques Tools & Trends”,

CRC Press

4. Navathe, “Fundamental of Database System”, Pearson Education

5. Margaret H. Dunham, “Data-Mining. Introductory & Advanced Topics”, Pearson

Education

6. Pieter Adriaans, Dolf Zantinge, “Data-Mining”, Pearson Education

51

MCA-213A ADVANCE OPERATING SYSTEMS L T P Cr

3 0 0 3

OBJECTIVE

To provide the knowledge of internals, different types and purpose of operating systems

PRE-REQUISITES

Knowledge of computer organization and architecture, programming skills

1. INTRODUCTION: Introduction to history of operating systems; early batch

systems; multiprogramming; timesharing; Real time systems; Distributed OS and

Multiprocessor OS; Processes; Files; System calls; Shell; Layered structure v/s

monolithic structure of OS.

2. PROCESS& MEMORY MANAGEMENT: Processor Scheduling, CPU

scheduling, scheduling criteria, scheduling algorithms -First Come First Serve

(FCFS), Shortest-Job-First(SJF), Priority Scheduling, Round Robin(RR).Logical &

Physical Address Space; swapping; paging and segmentation techniques;

segmentation with paging; Demand Paging & Page-Replacement Algorithms;.

3. FILE SYSTEM: Different types of files and their access methods; directory

structures; various allocation methods; disk scheduling and management

4. PROCESS-SYNCHRONIZATION & DEADLOCKS: Critical Section; Mutual

exclusion, Process cooperation,; Deadlocks: deadlock prevention; avoidance and

detection; deadlock recovery;: Dining philosophers problem; semaphores.

5. DISTRIBUTED SYSTEMS& Linux: Introduction; Communications in distributed

systems; layered protocols; ATM networks; Client Server model; RPC. Introduction

of Linux; Commands of Linux; Usage; Advantages & Disadvantages

TEXT BOOKS

Silberchatz et al, “Operating System Concepts”, 5th

edition, Addison-Wesley, 1998.

REFERENCE BOOKS

1. A. Tanenbaum, “Modern Operating Systems”, Prentice-Hall, 1992

2. William Stallings, “Operating Systems Internals and Design Principles”, 4th

edition, Prentice-

Hall, 2001

3. Dhamdhere, “Operating system”, 2nd Edition, Tata McGraw Hill.

4. Madnik, Donovan, “Operating Systems”,Tata McGraw Hill.

5. Deitel,”Operating Systems”, Addison-Wesley, 1990

6. Sumitabha Das, “Unix- Concept and applications”, Tata McGraw Hill, 2002

53

MCA-214A SOFT COMPUTING TECHNIQUES L T P Cr

3 0 2 5

OBJECTIVE To introduce about incorporating more mathematical approach (beyond conventional logic system) into the artificial intelligence approaches for problem solving such as fuzzy logic, genetic algorithms, etc.

1. INTRODUCTION: Comparison of soft computing methods: neural networks, fuzzy logic, genetic algorithm with conventional artificial intelligence (hard computing).Least-square methods for system identification, recursive least square estimator; LSE for nonlinear models; derivative based optimization: descent methods, Newton‟s method, conjugate gradient methods; nonlinear least-squares problems: Gauss Newton method, Levenberg- Marquardt method.

2. NEURAL NETWORKS: Different architectures; back-propagation algorithm; hybrid learning rule; supervised learning- perceptrons, back-propagation multilayer perceptrons, radial basis function networks; unsupervised learning – competitive learning network, Kohonen self-organizing networks, the Hopfield network.

3. FUZZY SET THEORY: Basic definition and terminology; basic concepts of fuzzy logic; set theoretic operators; membership functions: formulation and parameterization; fuzzy union, intersection and complement; fuzzy rules and fuzzy reasoning; fuzzy inference systems: Mamdani and Sugeno fuzzy models.

4. NEURO-FUZZY MODELLING: Adaptive neuro-fuzzy inference systems; neuro-fuzzy controller-feedback control; back propagation through time and real-time recurrent learning; gradient-free optimization.

5. GENETIC ALGORITHMS:Genetic algorithm, Fundamentals, basic concepts, working principle, encoding, fitness function, reproduction, Genetic modeling: Inheritance operator, cross over, inversion & deletion, mutation operator, Bitwise operator, Applications & advances in GA, Differences & similarities between GA & other traditional method

Text Book:- S.N Shivnandam & Deepa “ Soft Computing Techniques” Wiley publication.

REFERENCE BOOKS

1. Rajase, Kharan S. and VijayalakshmiPai S. A., “Neural Networks, Fuzzy Logic & Genetic Algorithms”, Prentice-Hall of India, 2003

2. Kecman Vojislav, “Learning and Soft Computing”, MIT Press, 2001 3. Konar Amit, “Artificial Intelligence and Soft Computing – Behavioural and Cognitive

Modeling of the Human Brain”, Special Indian Edition, CRC Press, 2008 4. Goldberg David E., “Genetic Algorithms”, Pearson Education, 2003. 5. Sivanandam, “Introduction to Neural Networks with MATLAB 6.0”, Tata McGraw Hill

54

6. Kumar Satish, “Neural Networks: Classroom Approach”, Tata McGraw Hill

7. Yen John and Langari Reza, “Fuzzy Logic, Intelligence, Control, and Information”, Pearson Education, 2003.

8. Zurada Jack N., “Introduction to Neural Networks”, Jaico Publishers. 9. Haykin Simon, “Neural Networks”, Prentice Hall, 1993/Pearson Education, 1999. 10. Koza J., “Genetic Programming”, MIT Press, 1993

55

MCA-216A Cloud Computing L T P Cr

3 0 0 3

1. CLOUD ARCHITECTURE AND MODEL : Technologies for Network-Based System –

System Models for Distributed and Cloud Computing – NIST Cloud Computing Reference

Architecture. Cloud Models:- Characteristics – Cloud Services – Cloud models (IaaS, PaaS,

SaaS) – Public vs Private Cloud –Cloud Solutions - Cloud ecosystem – Service management –

Computing on demand.

2. VIRTUALIZATION : Basics of Virtualization - Types of Virtualization - Implementation

Levels of Virtualization - Virtualization Structures - Tools and Mechanisms - Virtualization of

CPU, Memory, I/O Devices - Virtual Clusters and Resource management – Virtualization for

Data-center Automation.

3. CLOUD INFRASTRUCTURE : Architectural Design of Compute and Storage Clouds –

Layered Cloud Architecture Development – Design Challenges - Inter Cloud Resource

Management – Resource Provisioning and Platform Deployment – Global Exchange of Cloud

Resources.

4. PROGRAMMING MODEL: Parallel and Distributed Programming Paradigms –

MapReduce , Twister and Iterative MapReduce – Hadoop Library from Apache – Mapping

Applications - Programming Support - Google App Engine, Amazon AWS - Cloud Software

Environments -Eucalyptus, Open Nebula, OpenStack, Aneka, CloudSim

5. SECURITY IN THE CLOUD : Security Overview – Cloud Security Challenges and Risks –

Software-as-a-Service Security – Security Governance – Risk Management – Security

Monitoring – Security Architecture Design – Data Security – Application Security – Virtual

Machine Security - Identity Management and Access Control – Autonomic Security.

Text Book:-

Rajkumar Buyya, Christian Vecchiola, S.Thamarai Selvi, „Mastering Cloud Computing”,

TMGH,2013. 10. Gautam Shroff,Enterprise Cloud Computing,Cambridge University Press,2011

REFERENCES:

1. Kai Hwang, Geoffrey C Fox, Jack G Dongarra, “Distributed and Cloud Computing, From

Parallel Processing to the Internet of Things”, Morgan Kaufmann Publishers, 2012.

2. John W.Rittinghouse and James F.Ransome, “Cloud Computing: Implementation,

Management, and Security”, CRC Press, 2010.

3. Toby Velte, Anthony Velte, Robert Elsenpeter, “Cloud Computing, A Practical Approach”,

TMH, 2009.

56

4. Kumar Saurabh, “Cloud Computing – insights into New-Era Infrastructure”, Wiley

India,2011.

5. George Reese, “Cloud Application Architectures: Building Applications and Infrastructure in

the Cloud” O'Reilly

6. James E. Smith, Ravi Nair, “Virtual Machines: Versatile Platforms for Systems and

Processes”, Elsevier/Morgan Kaufmann, 2005.

7. Katarina Stanoevska-Slabeva, Thomas Wozniak, Santi Ristol, “Grid and Cloud Computing –

A Business Perspective on Technology and Applications”, Springer.

8. Ronald L. Krutz, Russell Dean Vines, “Cloud Security – A comprehensive Guide to Secure

Cloud Computing”, Wiley – India, 2010.

10. Michael Miller, Cloud Computing,Que Publishing,2008

11. Nick Antonopoulos, Cloud computing,Springer Publications,2010

57

MCA-220A CRYPTOGRAPHY AND DATA

COMPRESSION

L T P Cr

3 0 0 3

OBJECTIVE

The course will provide a down-to-earth overview of cryptographic techniques applicable in an

IT environment, and outline the constraints and limitations of realistic secure systems. A running

theme is the tradeoff between usability and security of a system. Also covered are a number of

compression techniques - data compression and data encryption are, in some respects, closely

related. A working knowledge of C is assumed and essential.

1. COMPRESSION: Packing; Huffman coding; run length encoding; Lempel-Ziv-Welch; Phil

Katz‟s PKZIP; Delta modulation; JPEG.

2. ERROR DETECTION AND CORRECTION: Parity; 1, 2, n-dimensions, Hamming

codes; p-out-of-q codes

3. CRYPTOGRAPHY: Vocabulary; history, steganography – visual, textual; cipher hiding;

false errors; public key cryptography - authentication, signatures, deniability

4. MATHEMATICS: Information; confusion; diffusion; modular arithmetic; inverses;

Fermat‟s little theorem, Chinese remainder theorem; factoring; prime numbers; discrete

logarithms

5. ALGORITHMS: DES; AES (Rijndael); IDEA; one time pad; secret sharing and splitting;

RSA; elliptic curves; modes; random numbers

REFERENCE BOOKS

1. IEEE, “Integration of Data Compression and Cryptography: Another Way to Increase the

Information Security”, IEEE Computer Society

2. Schneier B., “Applied Cryptography: Protocols, Algorithms and Source Code in C”, 2nd

edition, Wiley, 1996.

3. Desai Suhag, “Security in Computing”, Pearson Education

4. Trappe W. and Washington L., “Introduction to Cryptography”, 2nd edition, Pearson

Education, 2006

58

MCA-221A Big Data Analysis L T P Cr

3 0 0 3

OBJECTIVE: The basics of Hadoop, the basics of Analytics – Concepts, Data preparation –

merging, managing missing numbers sampling, Data visualization and Basic statistics.

UNIT 1 INTRODUCTION TO BIG DATA

Introduction – distributed file system – Big Data and its importance, Four Vs, Drivers for Big

data, Big data analytics, Big data applications. Algorithms using map reduce, Matrix-Vector

Multiplication by Map Reduce, Challenges for processing big data, Using big data in businesses.

Unit-2 Introduction to Hadoop

Introduction to Hadoop, why we use Hadoop, History of Hadoop, Use cases of Hadoop, Big

Data – Apache Hadoop – Moving Data in and out of Hadoop – Understanding inputs and outputs

of MapReduce - Data Serialization.

Unit-3 HADOOP Architecture

Hadoop Architecture, Hadoop Storage: HDFS, Common Hadoop Shell commands , Anatomy of

File Write and Read., Name Node, Secondary Name Node, and Data Node, Hadoop MapReduce

paradigm, Map and Reduce tasks, Job, Task trackers - Cluster Setup – SSH & Hadoop

Configuration – HDFS Administering –Monitoring & Maintenance.

Unit-4 Hadoop Ecosystem and YARN

Learning MapReduce concepts and framework, Testing and Debugging Map Reduce

Applications, Background of YARN; Hadoop YARN architecture; advantages of YARN,

working with YARN, backward compatibility with YARN, YARN Commands, log management

etc.

Unit-5 HIVE and HBASE Introduction to Hive and HBASE, HIVE: Architecture, Managing tables, data types, schemas,

partitions, HBASE: Architecture, Schema design; Advance Indexing - PIG, Zookeeper - how it

helps in monitoring a cluster, HBase uses Zookeeper and how to Build Applications with

Zookeeper., HBASE commands, HIVE Vs RDMS, HBASE Vs RDMS.

REFERENCES

1. Boris lublinsky, Kevin t. Smith, Alexey Yakubovich, “Professional Hadoop Solutions”, Wiley,

ISBN: 9788126551071, 2015.

2. Chris Eaton, Dirk deroos et al. , “Understanding Big data ”, McGraw Hill, 2012.

3. Tom White, “HADOOP: The definitive Guide” , O Reilly 2012. 6 IT2015 SRM(E&T)

4. Vignesh Prajapati, “Big Data Analytics with R and Haoop”, Packet Publishing 2013.

5. Tom Plunkett, Brian Macdonald et al, “Oracle Big Data Handbook”, Oracle Press, 2014.

6. http://www.bigdatauniversity.com/

7. Jy Liebowitz, “Big Data and Business analytics”,CRC press, 2013.

http://www.bigdatauniversity.com/

59

MCA-259 A

Data Mining and Data Warehousing

L T P Cr

0 0 3 2

List of Experiment

1 Study Of Tanagra As A Data-Mining Tool :

2 Study Of Weka As A Data-Mining Tool:

3 Importing and viewing data in TANAGRA:

4 Defining status of data using Tanagra

5 Program to apply instance selection on given data using Tanagra.

6 Program to apply clustering algorithms on given data by using Tanagra tool.

7 Program to apply A Priori algorithms on given data using Tanagra:

8 Program to generate decision tree using Weka tool:

9 Program to use Weka tool to perform clustering:

10 Program to visualize all attributes of Preprocess using Weka

11 Program for processing the data using Weka

12 Program for Classification of Data using Neural Network

13 Program for Classification of Data using Bayesian Network

14 What attributes do you think might be crucial in making the analysis of diabetes?

Come up with some simple rules in plain English using your selected attributes

using diabetes. arff database

15 What attributes do you think might be crucial in making the analysis of contact-

lenses? Come up with some simple rules in plain English using your selected

attributes using contact Lenses. arff

60

MCA-271A Big Data Analysis LAB L T P Cr

002 2

Objective: The objective of this lab is to learn how to set up an environment for running

Distributed Hadoop applications.

1. Implement the following Data structures in Java

a)Linked Lists

b) Stacks

c) Queues

d) Set

2. Perform setting up and Installing Hadoop in its three operating modes:

Standalone Pseudo distributed fully distributed.

3. Perform Frequently used Hadoop shell commands.

4. Implement the following file management tasks in Hadoop:

Adding files and directories

Retrieving files

Deleting files

5. Implement the following file management tasks in Hadoop:

Adding files and directories Retrieving files Deleting files

6. Run a basic Word Count Map Reduce program to understand Map Reduce Paradigm.

7. Write a Map Reduce program that mines weather data. Weather sensors collecting

data every hour at many locations across the globe gather a large volume of log data,

which is a good candidate for analysis with MapReduce, since it is semi structured

and record-oriented.

8. Implement Matrix Multiplication with Hadoop Map Reduce.

9. Install and Run Pig then write Pig Latin scripts to sort, group, join, project, and filter

your data.

10. Install and Run Hive then use Hive to create, alter, and drop databases & tables.

61

3rd

Year


62

MCA-301A ARTIFICIAL INTELLIGENCE L-T-P Cr

4-0-0 4

PRE-REQUISITES:Knowledge of data structures,mathematics,algorithm

1. INTRODUCTION TO AI AND SEARCH TECHNIQUES: Foundation and history of AI;

data, information and knowledge; agents,AI problems and techniques – AI programming

languages, problem space representation with examples; blind search strategies, breadth first

search, depth first search, heuristic search techniques: hill climbing: best first search, A *

algorithm AO* algorithm, Means-ends analysis.

2. KNOWLEDGE REPRESENTATION ISSUES AND STRUCTURE: predicate logic; logic

programming; constraint propagation; representing knowledge using rules, semantic nets,

partitioned nets, parallel implementation of semantic nets; frames, common sense reasoning and

thematic role frames; architecture of knowledge based system; rule based systems; forward and

backward chaining; frame based systems.

3. REASONING UNDER UNCERTAINITY: Reasoning under uncertainty, non monotonic

reasoning; review of probability; Bayes‟ probabilistic interferences and Dempster Shafer theory;

symbolic reasoning under uncertainty; statistical reasoning, fuzzy reasoning.

4. PLANNING & GAME PLAYING: Minimax search procedure; goal stack planning; non

linear planning, hierarchical planning, planning in situational calculus; representation for

planning; partial order planning algorithm

5. LEARNING AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE:: Basic

concepts; rote learning, learning by taking advices, learning by problem solving, learning from

examples, discovery as learning, learning by analogy; explanation based learning; neural nets;

genetic algorithm ,Principles of natural language processing; expert systems, knowledge

acquisition concepts; AI application to robotics, and current trends in intelligent systems

REFERENCE BOOKS

1. Rich Elaine and Knight Kevin, “Artificial Intelligence”, 3rd Edition, Tata McGraw Hill,

1991

2. Nilson Nils J., “Artificial Intelligence”, McGraw-Hill, New York 1971

3. Russell Stuart and Norvig Peter, “Artificial Intelligence: A Modern Approach”,

Prentice Hall of India, 1998

4. Negnevitsky, “Artificial Intelligence: A Guide to Intelligent System”, Pearson

63

Education, 2004.

5. Patterson O. W., “Introduction to Artificial Intelligence & Expert Systems”, Prentice

Hall of India, 1996.

6. Winston Patrick Henry, “Artificial Intelligence”, 3rd Edition, Addition Wesley, 1992

7. Clockson & Mellish, “Programming PROLOG”, 3rd Edition, Narosa Publications,

2002.

64

MCA-303 A INTRODUCTION TO

ERP

L T P Cr

3-0 0 3

OBJECTIVE

To provide knowledge about the enterprise resource planning tools, models and techniques

PRE-REQUISITES

Knowledge of internet and web development, data mining, computer networks, software

engineering

Unit 1. ENTERPRISE RESOURCE PLANNING and its related technologies: ERP

overview; need of ERP; growth of ERP; benefit; Proper and improper ERP implementation; data

ware housing; data mining;

Unit 2.ERP AND RELATED TECHNOLOGIES: data warehousing, data mining; online

analytical processing (OLTP); supply chain management (SCM); customer relationship

management (CRM).

Unit 3. ERP MODULES AND VENDORS: Finance; production planning, control &

maintenance, sales & distribution- General Ledger and Normal Ledger; human resource

management (HRM); inventory control system; quality management; ERP market.

Unit 4 ERP IMPLEMENTATION LIFE CYCLE& FUTURE DIRECTIVES IN ERP:

evaluation and selection of ERP package ;project planning; implementation team training &

testing ; end user training & going live; post evaluation & maintenance; introduction to hidden

costs, vendors, consultant employees, Critical factors guiding selection and evaluation, strategies

for successful implementation, critical success and failure factors.

Unit 5. ERP MARKET and ERP CASE STUDIES: Market place; Study of Open Source and

commercial ERP tools Study (Marketplace – Dynamics – SAP AG – Oracle – PeopleSoft – JD

Edwards. Post implementation review of ERP packages in manufacturing, services, and other

organizations; using ERP tool: either sap or oracle format to case study.

TEXT BOOK

1. Leon, Alexis, “Enterprise Resource Planning”, Tata McGraw-Hill, 1999

REFERENCE BOOKS

2. Garg, V.K. ,&Venkitakrishnan, N.K. , “ERP Ware: ERP Implementation Framework”

3. Leon, Alexis, “ERP Concepts and Planning”, Tata McGraw-Hill

4. Motiwalla, Luvai F. , Thompson, Jeff, “Enterprise System for Management”, Pearson

Education

5. Mary Sumner, “Enterprise Resource Planning”, Pearson Education, 2007

65

MCA-304 A Android Application Development L T P Cr

3 0 0 3

Objective :- This course introduces mobile application development for the Android platform.

Android is a software stack for mobile devices that includes an operating system, middleware

and key applications. The Android SDK provides the tools and APIs necessary to begin

developing applications on the Android platform using the Java programming language. Students

will learn skills for creating and deploying Android applications, with particular emphasis on

software engineering topics including software architecture, software process, usability, and

deployment.

Pre-Requisites Experience in Object Oriented programming language Knowledge in XML

format

Unit 1 Basic Concepts:- About Android , Smart phones future, Installing the SDK, Creating

Android Emulator Installing Eclipse Installing Android Development Tools Choosing

which Android version to use

Unit 2:- Android Architecture and set Interface Widgets:- Android Stack Android applications

structure, Creating a project Working with the AndroidManifest.xml Using the log system

Activities, Application context Intents Activity life cycle Supporting multiple screen sizes

Unit 3:-:- Text controls Notification and Toast Button controls Toggle buttons Images,

Parameters on Intents Pending intents Status bar notifications Toast notifications

Unit 4:- Menu and Dialog;- Localization Options menu Context menu Dialogs Alert dialog

Custom dialog Dialog as Activity Using string arrays Creating lists Custom lists Chapter

11 – Location and Maps Google maps Using GPS to find current location

Unit 5:- Web Services HTTP Client XML and JSON, Services Service lifecycle

Foreground service Ch Publishing Your App Preparing for publishing Signing and preparing

the graphics Publishing to the Android Market

66

CS-351 A ARTIFICIAL INTELLIGENCE LAB L T P Cr

0-0-2 1

LIST OF EXPERIMENTS

1. Study of Prolog programming language.

2. Write a program to find out route distance between two cities using Prolog.

3. Write a program to implement Tower of Hanoi using Prolog.

4. Write a program to calculate factorial of a number using Prolog.

5. Write a program to implement Hardware simulation using Gates using Prolog.

6. Write a program to implement family relationship using Prolog.

7. Write a program to implement logon with recursion using Prolog.

8. Write a program to print the list of customer having different colored cars with price and

model available using Prolog.

9. Write a program to implement water jug problem using Prolog.

10. Write a program to implement Breadth First Search using Prolog.

11. Write a program to implement Depth First Search using Prolog.

12. Write a program to implement five House logic puzzle problem using Prolog.

13. Write a program to analyze Grammar of sentences using Prolog.

14. Write a program to solve 8-Queens problem using Prolog.

15. Write a program to solve Monkey Banana problem using Prolog.

67

MCA-354 A Android Application Development Lab L T P Cr

0 0 3 2

List of Experiments:

1. Installing Android Machine

2. Creating a simple “Hello World” application

3. Adding an action bar to android app to make application interactive

4 Build user interfaces using Views, Menus and Notifications

5. Saving key-value pairs of simple data types in a shared preferences file and

saving arbitrary files in Android's file system.

6. Handle file operations in Android application program.

7. Build an android application with multiple screens.

8. Learning Android Emulator to emulate android apps on various devices.

9. Use of Intents to perform basic interaction with apps.

10. Using Android styles and themes to make application

11. Learn to use Android Debug Bridge to debug system and application

68

MCA-211 A Information Technology &Management L T P Cr

3 0 0 3

Course Objective: The objective of the course aims to introduce about Information technology

plays an important role in today‟s business world. Majority of the companies rely on this for the

purpose of data processing, fast communications and acquiring market intelligence. Information

technology helps business improve the processes of business it drives revenue growth, helps

them achieve cost efficiency and more importantly, ensures they increase revenue growth while

maintaining a competitive edge in the market place. As a business owner, you have to decide

whether information technology is for you or not and the only way to do this is by looking at

some of the factors that make it essential.

Course Outcomes: On the completion of this course student will be able to Understand how to

manage IT services appropriately.

Unit-1 Introduction: Evolution of computer, Computer basics, Network and internet, computing resources, information technology.

Unit-2 IT infrastructure: IT infrastructure management, infrastructure, IT Infrastructure management, challenges in IT infrastructure management, design issues of IT organizations and IT infrastructure, determining customers‟ requirements, IT systems management process, IT service management process, information system design process, patterns for IT systems management, IT infrastructure library.

Unit-3 Service Delivery Process & Support Process: Service level management, financial management, IT service continuity management, capacity management, availability management. Support process: Configuration management, incident management, problem management, change management, release management.

Unit-4 Storage Management: Introduction to storage, backup and storage, archive and re-trieve, disaster recovery, space management, database and application protection, Bare Machine Recovery (BMR), data retention.

Unit-5 Security Management & IT Ethics: Introduction, computer security, internet security,

physical security, identity management, access control, intrusion detection ,IT Ethics:

Introduction, intellectual property, privacy and law, computer forensics, ethics and internet,

cyber crimes ,Emerging trends in IT: Introduction, E-commerce, Electronic data interchange,

Global system for mobile communication, Bluetooth, infrared technology .

69

Text Book:

1. Phalguni Gupta, Surya Prakash, Umarani Jayaraman, IT Infrastructure and its Management, Tata McGraw Hill Education Private Limited, ISBN-13: 978-0070699793, 2009.

2. Simon Adams, ITIL V3 Foundation Handbook Updated Edition, Stationery Office Books (TSO) Publisher, 2009.

References:

1. Ivanka Menken, ITIL V3 Foundation Certification Exam Preparation Course in a Book for Passing the ITIL V3 Foundation Exam, Second Edition (The Art of Service), 2009.

2. Van Haren, Passing the ITIL Foundation, Van Haren Publishing, 2011.

70

MCA-302 A SYSTEM & NETWORK ADMINISTRATION L T P Cr

3 1 0 4

OBJECTIVE To lay a strong foundation for overall system and network management

PRE-REQUISITES

Knowledge of computer organization and architecture, operating system, computer networks

1. INTRODUCTION TO SYSTEMS AND NETWORK ADMINISTRATION: Scope of systems and network administration; goals of systems and network administration; system components and their management, advanced scanning concepts and tools; advanced sniffer

2. OPERATING SYSTEMS UTILITIES&HOST MANAGEMENT: Windows and Unix variants; file systems and standards (UFS, NFS, NTFS); processes and job control; privileged, user and group accounts; logs and audits; HOST MANAGEMENT: Booting and shutting down of an operating system; formatting, partitioning and building a file system; file system layout; concept of swap space; OS installation; installation and configuration of devices and drivers

3. SERVER CONFIGURATION & TROUBLESHOOTING: Linux/Windows server configuration; super user/ administrator privileges; user management, controlling user resources; disk space allocation and quotas; process management (monitoring, killing/stopping, monitoring activity); file system repair, backup and restoration; integrating multiple operating systems; system sharing; authentication process

4. NETWORK ADMINISTRATION&MANAGEMENT SERVICES: Introduction to network administration approaches; addressing and Subnetting: fixed vs. variable masks, VLAN principles and configuration, routing concepts, static and dynamic routing; routing protocols (RIP, OSPF, BGP), ADVANCED NETWORK MANAGEMENT SERVICES: Configuring a Linux/Windows box as a router; dial-up configuration & authentication: PPP, RAS; configuring a DNS server; configuring Sendmail service; configuring a web server; configuring a proxy server; TCP/IP troubleshooting (ping, traceroute, ifconfig, netstat, ipconfig, network management).

5. NETWORK SECURITY: Security planning; categories of security; access control and monitoring: wrappers; firewalls: filtering rules, detection and prevention of Denial of Service (DOS) attacks; automatic identification of configuration loop holes; security information resources: cert, installing and upgrading system software, use of scripting tools

REFERENCE BOOKS

1. Burgess Mark, “Principles of Network and System Administration”, John Wiley and Sons Ltd., 2000

2. Forouzan, “Cryptography and Network Security”, McGraw Hill,2007 3. Endler, “Hacking Exposed VoIP: Voice over IP Security Secrets and Solutions”, McGraw-

Hill, 2006

71

4. Hunt Craig, “TCP/IP Network Administration”, 3rd Edition, O‟Reilly and Associates Inc., 2002.

5. Splading George, “Windows 2000 Administration”, McGraw-Hill, 2000 6. Kirch Olaf and Dawson, Terry “Linux Network Administrator‟s Guide”, 2nd Edition, O‟Reilly

and Associates Inc./Shroff Publishers & Distributors, 2000, 7. William Stallings, “Cryptography and Network Security: Principles and Practices”,

Prentice Hall, 5th edition, 2010 8. Subramaniam S., “Network Management: Principles & Practice”, Addison Wesley, 1999

72

CA-1323 A ADVANCED COMPUTER ARCHITECTURE L T P Cr

3 0 0 3

OBJECTIVE

To introduce various technological aspects about parallelism in super computing,

microprocessors supporting such high scale computing, other hardware architectures, ultimately

leading to high performance computing through grid computing.

1. PARALLEL COMPUTER MODELS AND PROGRAM: The state of computing; multiprocessors and multicomputer; multivector and SIMD computers; architectural development tracks. Conditions of parallelism; data and resource dependences; hardware and software parallelism; program partitioning and scheduling; grain size and latency; program flow mechanisms; control flow versus data flow; data flow architecture; demand driven mechanisms; comparisons of flow mechanisms

2. SYSTEMS INTERCONNECT ARCHITECTURES: Network properties and routing; static interconnection networks; dynamic interconnection networks; multiprocessor system interconnects; hierarchical bus systems; crossbar switch and multiport memory; multistage and combining network.

3. PROCESSORS AND MEMORY HIERARCHY: Advanced processor technology; instruction-set architectures; CISC scalar processors; RISC scalar processors; superscalar processors; VLIW architectures; vector and symbolic processors; memory technology: hierarchical memory technology, inclusion, coherence and locality, memory capacity planning, virtual memory technology

4. BACKPLANE BUS SYSTEM AND VECTOR PROCESSING: Backplane bus specification; addressing and timing protocols; arbitration transaction and interrupt; cache addressing models; direct mapping and associative caches. Vector instruction types; vector-access memory schemes; synchronous parallel processing: SIMD architecture and programming principles, SIMD parallel algorithms, SIMD computers and performance enhancement;

5. PIPELINING: Linear pipeline processor; nonlinear pipeline processor; instruction pipeline design; mechanisms for instruction pipelining; dynamic instruction scheduling; branch handling techniques; arithmetic pipeline design; computer arithmetic principles; static arithmetic pipeline; multifunctional arithmetic pipelines.

REFERENCE BOOKS

1. Hwang Kai and Briggs A., “Advance Computer Architecture”, Tata McGraw Hill, 1993 2. Hwang Kai and Briggs A., “Computer Architecture and Parallel Processing”, International

Edition, McGraw-Hill, 1984 3. Hennessy John L. and Patterson David A., “Computer Architecture: A Quantitative

Approach”, 4th Edition, Morgan Kaufmann (An Imprint of Elsevier), 2006 4. Flynn Michael J., “Pipelined and Parallel Processor Design”, 1st Edition, Narosa

Publications, 1995 5. Sima Dezso, Fountain Terence and Kacsuk Peter, “Advanced Computer Architectures”, 1st

Edition, Pearson Education/Addison Wesley, 1997

73

CA-1401A INTRODUCTION TO XML L T P Cr

3 0 0 3

PRE-REQUISITES: Knowledge of internet and web development, data mining, computer

networks, DBMS.

Unit 1 - XML Fundamentals

Introducing the extensible Markup Language (XML); Extending and Adopting Markup Languages

From SGML to XML and XHTML; Benefits and Drawbacks of XML ; Representing Mixed Data

and Context with XML; Creating an XML Document; Defining Structure; Rules for Well-Formed

and Valid XML; Changing XML Documents, XML and Web Services; HTML with XML; XML

and e-Commerce.

Unit 2 - XML Syntax & Namespaces

Tag Attributes and Naming Rules; Empty and Non-Empty Elements; Processing Instructions for

XML; Accessing Data from XML Elements; XML Namespaces; Prefixes and Declarations; Default

and Multiple Namespaces.

Unit 3 - XML Document Type Definition (DTD)

XML DTD as an XML Schema; Creating a DTD; Declaring and creating Internal and External

DTD; Element Conditions and Quantifiers, Referencing DTD Declarations; Validating DTD

Compliance, Style sheet Languages; Using Style Sheets with XML; Page Layout with Cascading

Style Sheets (CSS); XSL and XSLT, Transforming XML with XSLT, Beginning an XSLT Style

Sheet.

Unit 4 - XML Schema Definition (XSD)

Element and Attribute Declarations; Simple, Complex, and Built-in Types; Named and Anonymous

Types; Associating XML with a Schema; Validating XSD Compliance.

Unit 5 - XQuery and XPath

Why XQuery and XPath; XPath Nodes and Syntax; Seven Node Types; Node Paths and Predicates;

Node Axes and Functions: XQuery structure and usage XPath and XSD in Xquery; Terms and

Syntax; Selecting and Filtering elements.

TEXT BOOK

1. . An Introduction to XML and Web Technologies, by Anders Moller & Michael

Schwartzbach; ISBN : 978-0-321-26966-9, Addison-Wesley Professional

2. Learning XML , O‟reilly by Erik T. Ray

REFERENCE Books

1. 1. XML in a nutshell, by Elliotte Rusty Harold & W. Scott Means Reference Books: ISBN :

978-0-596-00764-5.

2. Definitive XML Schema, by Priscilla Walmsley ISBN : 978-0-130-65567-7, Prentice Hall

74

CA-1327 A NATURAL LANGUAGE PROCESSING

L T P Cr

3 0 0 3

OBJECTIVES:

The student should be made to:

Learn the techniques in natural language processing.

Be familiar with the natural language POS techniques.

Be exposed to machine translation.

Understand the ambiguity Resolution retrieval techniques.

1 INTRODUCTION TO NATURAL LANGUAGE UNDERSTANDING: The study of

natural Language and Natural Language Processing, applications of NLP, evaluating language

understanding systems,Role of Knowledge in Natural Language Processing , Phases of natural

Language Processing, Different levels of language analysis, representations and understanding,

organization of natural language understanding systems.

2. BASIC ENGLISH GRAMMARS:Basic English language has been discussed that include

word formation, basic English Grammar, Sentence formation , part of speech Linguistic

background: an outline of English syntax.Grammars and sentence structure, Charactertics of

good grammar.

3. PARSING AND SYNTACTIC ANALYSIS: Basic sentence structure in language

processing, Components of a general purpose grammar in language processing, Phases of

syntactic Analysis, Pashing Techniques, Parsing Algorithm, Types of Pashing technique: top-

down and bottom-up parsers, top-down chart parsing.

4. TRANSISTION NATWORK AND AUGUMENTED GRAMMARS:A finite state model

for analysis sentences, Transition Network, Purpose and Use of a transition network for language

processing, types of transition networks,Augmented Grammar, augmented transition networks ,

movement phenomenon in language, handling questions in context-free grammars,

Transformational Grammar.

5. SEMANTICSand AMBIGUITY RESOLUTION:Word senses and ambiguity,Word Sense

Disambiguation, encoding ambiguity in logical form, semantic analysis, Encoding uncertainty,

deterministic parser, word level morphology, introduction to HMMs and speech recognition,

parsing with CFGs, probabilistic parsing, Statistical methods, estimating probabilities, part-of-

speech tagging, Challenge of POS tagging, probabilistic context-free grammars, best first

parsing.

75

Indian language case studies.

Text Book

1 . Allen James, “Natural Language Understanding”, 2nd edition, Pearson Education, 2003.

2. Ela Kumar “” Natural Language Processing “, I.K International Publication House.

REFERENCE BOOKS 1. SiddiquiTanveer and Tiwary U. S., “Natural Language Processing and Information Retrieval”,

Oxford University Press, 2008

3. Winograd Terry, “Language as a Cognitive Process”, Addison Wesley, 1983

4. Gazder G., “Natural Language Processing in Prolog”, Addison Wesley, 1989

5. Jurafsky D. and Martin J. H., “Speech and Language Processing”, Pearson Education, 2002.

6. Manning Christopher D. and SchützeHinrich, “Foundations of Statistical Natural Language

Processing”, The MIT Press, Cambridge, Massachusetts.1999.

76

CA-1310A 3 D multimedia & Animation L T P Cr

3 1 0 4

OBJECTIVE

To provide basic knowledge of image compression, audio, video, sound, virtual reality,

intelligent multimedia systems etc

PRE-REQUISITES

Knowledge of computer graphics, programming, 3D geometry

1. BASICS OF MULTIMEDIA TECHNOLOGY: Computers; communication and

entertainment; multimedia an introduction; framework for multimedia systems; multimedia

devices; CD- Audio; CD-ROM; CD-I; presentation devices and the user interface;

multimedia presentation and authoring; professional development tools; internet; World

Wide Web & multimedia distribution network: ATM & ADSL; multimedia servers &

databases; vector graphics; 3D graphics programs

2. IMAGE COMPRESSION & STANDARDS: Making still images; editing and capturing

images; scanning images; computer color models; color palettes; vector drawing; 3D drawing

and rendering; JPEG: objectives and architecture; DCT encoding and quantization; statistical

coding; predictive lossless coding; performance; overview of other image file formats as

GIF; TIFF; BMP; PNG; etc.

3. Animation: Animation techniques; shading; anti aliasing; morphing; masking; video on

demand; Web design; Game design; Digital video editor; 3-D animator; AV Editor; 2d/3d

Animator; Animation curves and Events; Animation Properties; Controlling Animation:

Animator Component; Animator Controller layer; Animator Scripting; Character Animation:

Humanoid Avatars; Authoring Root Motion; Avatar Masks; Advantages and Disadvantages

4. VIDEO& Audio:Digital representation of sound; time domain sampled representation;

method of encoding the analog signals; sub-band coding; transmission of digital sound;

digital audio signal processing; stereophonic and quadraphonic signal processing; editing

sampled sound; MPEG Audio and motion video compression and decompression; brief

survey of speech recognition and generation; audio synthesis; musical instrument digital

interface digital video and image compression; DVI technology;

5. VIRTUAL REALITY: Applications of multimedia; intelligent multimedia system; desktop

virtual reality; VR operating system; virtual environment displays and orientation making;

visually coupled system requirements; intelligent VR software systems.APPLICATIONS OF

ENVIRONMENT IN VARIOUS FIELDS.

TEXT BOOK

Villamil and Molina, “An Introduction to Multimedia”, MacMillan, 1997

https://unity3d.com/learn/tutorials/topics/animation/humanoid-avatars?playlist=17099

https://unity3d.com/learn/tutorials/topics/animation/authoring-root-motion?playlist=17099

https://unity3d.com/learn/tutorials/topics/animation/avatar-masks?playlist=17099

77

REFERENCE BOOKS

1. Lozano, “Multimedia: Sound & Video”, Prentice Hall of India (Que), 1997

3. Ranjan Parekh, “Principle of Multimedia”, Tata McGraw Hill

4. Villamil and Molina, “Multimedia: Production, Planning and Delivery”, Que, 1997

5. Sinclair, “Multimedia on the PC”, BPB Publications

6. Tay Vaughan, “Multimedia: Making It Work”, Fifth edition, Tata McGraw Hill, 1994

7. James E Shuman, “Multimedia in Action”, Wadsworth Publications, 1997

8. Jeff Coate Judith, “Multimedia in Practice”, Prentice Hall of India, 1995

9. John F. Koegel, “Multimedia Systems”, Addison Wesley Ltd.

10. Halsall and Fred, “Multimedia Communications”, Addison Wesley, 2001

78

CA-1324 ADVANCED DATABASE MANAGEMENT

SYSTEMS

L T P Cr

3 0 0 3

OBJECTIVE To bring out various issues related to advanced computing with respect to database management systems such as parallelism in implementation, data backup and recovery management, intelligent data mining techniques, standards, etc.

PRE-REQUISITES: Knowledge of database management systems

1. DATA MODELS: EER model and relationship to the OO model; object oriented data model and ODMG standard; other data models - NIAM, GOOD, ORM

2. QUERY OPTIMISATION: Query execution algorithms; heuristics in query execution; cost estimation in query execution; semantic query optimisation; database transactions and recovery procedures: transaction processing concepts, transaction and system concepts, desirable properties of a transaction, schedules and recoverability, serializability of schedules; transaction support in SQL; recovery techniques; database backup; concurrency control, locking techniques for concurrency control, concurrency control techniques; granularity of data items

3. CLIENT/SERVER COMPUTING: Client/Server concepts; 2-tier and 3-tier client/server systems; client/server architecture and the internet; client /database server models; technology components of client/server systems; application development in client/server systems

4. DISTRIBUTED DATABASES: Reliability and commit protocols; fragmentation and distribution; view integration; distributed database design; distributed algorithms for data management; heterogeneous and federated database systems,deductive database systems;

deductive object oriented database systems

5. DATA WAREHOUSING, COMMERCIAL AND RESEARCH PROTOTYPE : Basic concepts; data warehouse architecture; data characteristics; reconciled data layer data transformations; derived data layer user interface. ,Parallel database; multimedia database, mobile database; digital libraries; temporal database

REFERENCE BOOKS

1. Ramakrishnan Raghu, “Database Management System”, McGraw Hill, 3rd

Ed., 2003 2. Elmasri R. and Navathe S. B., “Fundamentals of Database Systems”, 3rd Edition, Addison

Wesley, Low Priced Edition, 2000. 3. Tamer M. and Valduricz, “Principles of Distributed Database Systems”, 2nd Edition, LPE

Pearson Edition. 4. Silbershatz A., Korth H. F. and Sudarshan S., “Database System Concepts”, 3rd Edition,

McGraw-Hill, International Edition, 1997. 5. Desai Bipin C., “An Introduction to Database Systems”, Galgotia Pub. 6. lioffer Feffray A., Prescotl Mary B.and McFadden Fred R., “Modern Database

Management”, 6th Edition, Pearson Education.

79

MCA-212 A MOBILE COMPUTING L T P Cr

3 0 0 3

OBJECTIVE

Recent developments in portable devices and high-bandwidth, ubiquitous wireless networks has made mobile computing a reality. Indeed, it is widely predicted that within the next few years‟ access to Internet services will be primarily from wireless devices, with desktop browsing the exception. Such predictions are based on the huge growth in the wireless phone market and the success of wireless data services. This course will help in understanding fundamental concepts, current developments in mobile communication systems and wireless computer networks.

PRE-REQUISITES

Computer Networks and wireless communication

1. INTRODUCTION TO WIRELESS TRANSMISSION AND MEDIUM ACCESS CONTROL: Applications, A short history of wireless communication, Frequency for radio transmission, Signals, Antennas, Signal propagation, Multiplexing, Modulation, Spread spectrum, Cellular systems.

2. MEDIUM ACCESS CONTROL: Motivation for a specialized MAC: Hidden and Exposed terminals. Near and Far terminals; SDMA, FDMA, TDMA: Fixed TDM, Classical Aloha, Slotted Aloha, Carrier sense multiple access, Demand assigned multiple access, PRMA packet reservation multiple access, Reservation TDMA, Multiple access with collision avoidance, Polling, Inhibit sense multiple access; CDMA: Spread Aloha multiple access

3. TELECOMMUNICATION , SATELLITE & BROADCAST SYSTEMS: GSM: Mobile services, System architecture, Radio interface, Protocols, Localization And Calling, Handover, Security, New data services; DECT: System architecture, Protocol architecture; TETRA, UMTS and IMT-2000: UMTS Basic architecture, UTRA FDD mode, UTRA TDD mode, Applications, Basics: GEO, LEO, MEO; Routing, Localization, Handover, Examples, Cyclic repetition of data, Digital audio, broadcasting: Multimedia object transfer protocol; Digital video broadcasting

4. WIRELESS LAN: Infrared vs. Radio transmission, Infrastructure and Ad hoc Networks, IEEE 802.11: System architecture, Protocol architecture, Physical layer, Medium access control layer, MAC management, Future development; HIPERLAN: Protocol architecture, Physical layer, Channel access control. Sublayer, Medium access control Sublayer, Information bases And Networking; Bluetooth: User scenarios, Physical layer, MAC layer, Networking. Security, Link management.

5. MOBILE NETWORK AND TRANSPORT LAYER: Mobile IP: Goals, assumptions and requirements, Entities and terminology, IP packet delivery, Agent advertisement and discovery, Registration, Tunnelling and Encapsulation , Optimizations, Reverse tunnelling, Ipv6; Dynamic host configuration protocol, Ad hoc networks: Routing, Destination sequence distance vector,

80

Dynamic source routing, Hierarchical algorithms, Alternative metrics, Traditional TCP: Congestion control, Slow start, Fast retransmit/fast recovery, Implications on mobility; Indirect TCP, Snooping TCP, Mobile TCP, Fast retransmit/fast recovery, Transmission/time-out freezing, Selective retransmission, Transaction oriented TCP, Traditional TCP: Congestion control, Slow start, Fast retransmit/fast recovery, Implications on mobility; Indirect TCP, Snooping TCP, Mobile TCP, Fast retransmit/fast recovery, Transmission/time-out freezing, Selective retransmission, Transaction oriented TCP

REFERENCE BOOKS

1. Jochen Schiller, “Mobile Communications”, Addison Wesley/Pearson Education, 2005

2. Garg Kumkum, ”Mobile Computing”, Pearson Education, 2006

3. Talukder Asoke K. and Yavagal R. R., “Mobile Computing”, Tata McGraw-Hill, 2005.

4. Uwe Hansman, Lothar Merk, Martin S. Nicklous and Thomas Stober, “Principles of Mobile

Computing”, 2nd Edition, Springer-Verlag, 2003, ISBN 81-7722-468-9

5. Dharma Prakash Agrawal and Qing-An Zeng, “Introduction to Wireless and Mobile

Systems”, 2nd edition, 2006

6. Stallings William, “Wireless Communications and Networks”, Pearson Education, 2009

7. Yi-Bing Lin and Imrich Chlamtac, “Wireless and Mobile Network Architectures”, John

Wiley & Sons, 2004, ISBN 9971-51-366-8

8. Rappaport, “Wireless Communications Principles and Practices” Prentice Hall, 2nd edition,

2006.

81

CA-1309 A NETWORK SECURITY & MANAGEMENT L T P Cr

3 0 0 4

OBJECTIVE The main objective behind this course is to learn about the various network attacks and preventing attacks. This course is designed to cover Application security, Network security, Web security etc.

PRE-REQUISITES

Knowledge of data communications and computer networks, computer programming, data structures, mathematics, telecom network. Knowledge of digital signal processing is desirable

1. Attacks on Computers & Computer Security: Introduction; The need of Security ; Security Approaches; Principal of Security; Types of Attacks

2. Cryptography : Introduction; Plain Text & Cipher Text; Substitution Techniques; Transposition Techniques; Types of Cryptography; Steganography; Symmetric Key Algorithm: Algorithm Types and Modes, DES; Asymmetric Key Algorithm: RSA, Digital Signatures

3. Digital Certificates and Public Key Infrastructure: Digital Certificates ; Private Key Management; The PKIX Model ; Public Key Cryptography Standards; Creating Digital certificates using Java

4. Internet Security Protocols: Introduction; Secure Socket Layer(SSL); Secure Electronic Transaction(SET); Electronic Money; Email security; Wireless application protocol (WAP);Security in GSM: Security in 3G

5. User Authentication and Kerberos: Introduction ; Authentication Basics; Passwords; Authentication Tokens; Certificate Based Authentication; Biometric Authentication; Kerberos

REFERENCE BOOKS

1. Atuk Kahate , “Cryptography and Network Security”, 3rd

Edition, Tata Mcgraw Hill

REFERENCE BOOKS

2. Stallings William, “Cryptography and Network Security”, 4th Edition, Prentice-Hall, Englewood Cliffs, 2006

3. Mani Subramanian, “Network Management Principles & Practices”, Addison Wesley, 1999 4. Kauffman C., Perlman R. and Spenser M., “Network Security”, 2nd Edition, Prentice Hall,

2002. 5. Menezes Alfred, van Oorschot Paul, and Vanstone Scott, “Handbook of Applied

Cryptography”, CRC Press, NY, 2004. 6. Bellovin S. and Chesvick W., “Internet Security and Firewalls”, 2nd Edition, Addison

Wesley, 1998. Schneier Bruce, “Applied Cryptography”, Wiley Student Edition, 2nd Edition

82

CA-1425A INFORMATION STORAGE & MANAGEMENT L T P Cr

3 0 0 3

OBJECTIVE

Using a “building block” approach, the ISM curriculum provides a core understanding of storage

technologies and progresses into system architectures, introduction to networked storage, and

introduction to information availability. The course provides a comprehensive introduction to data

storage technology fundamentals. Students will gain knowledge of the core logical and physical

components that make up a storage systems infrastructure.

PRE-REQUISITES

Knowledge of computer networks

1. INTRODUCTION: Meeting today's data storage needs - data creation; data creation:

individuals, business; categories of data; data storage models; common data storage media

and solutions - tape storage systems, optical data storage, disk based storage, Data Center

Infrastructure:: Example; key requirements of storage systems management activities.

2. STORAGE SYSTEMS ARCHITECTURE:Storage system environment; components of a

host; connectivity; physical disks; RAID array; disk storage systems; data flow exercise.

3. NETWORKED STORAGE and BUSINESS CONTINUITY:Direct Attached Storage

(DAS), Network Attached Storage (NAS), Fiber Channel Storage Area Network (FC SAN),

IP Storage Area Network (IP SAN), Content Addressed Storage (CAS),Introduction to

Business Continuity, overview, backup and recovery, local replication, remote replication.

4. MONITORING AND MANAGING THE DATA CENTER:Areas of the data center to

monitor; considerations for monitoring the data center; techniques for managing the data

center.

5. SECURING STORAGE AND STORAGE VIRTUALIZATION: Securing the storage

infrastructure; virtualization technologies.

REFERENCE BOOKS

1. Osborne Marc Farley, “Building Storage Networks”, Tata McGraw Hill

2. Spalding Robert, “Storage Networks: The Complete Reference“, Tata McGraw Hill

3. Gupta Meeta, “Storage Area Network Fundamentals”, Pearson Education Limited

4. Kowalski Gerald J. and Maybury Mark T., “Information Storage & Retrieval Systems

Theory & Implementation”, BS Publications

5. Thejendra B. S., “Disaster Recovery & Business Continuity”, Shroff Publishers &

Distributors, EMC – Students Kit.

83

CA-1305 A INTRODUCTION TO E-COMMERCE L T P Cr

3 0 0 3

Pre-requites

Knowledge of internet and web development, data mining, computer networks, software

engineering.

1. INTRODUCTION TO E-COMMERCE: Benefits; impact of e-commerce; classification of

e-commerce; application of e-commerce technology; business models; framework of e-

commerce.; business to business; business to customer; customer to customer; advantages and

disadvantages of e-commerce; electronic commerce environment and opportunities: back ground

– the electronic commerce environment – electronic market place technologies.

2. NETWORK INFRASTRUCTURE OF E-COMMERCE: Network infrastructure to e-

commerce & internet; lan; ethernet ( ieee 802.3); wan; internet; tcp/ip reference model; domain

names; internet industry structure; ftp applications; protocols required for ecommerce; HTTP;

CGI 3; firewalls; securing web service; secure payment system transaction security (SET);

cryptology; digital signatures

3. ELECTRONIC PAYMENT SYSTEM and EDI: Introduction to electronic cash and

electronic payment schemes – internet monitory payment; different models; framework; prepaid

and post-paid payment model and security requirements – payment and purchase order process –

online electronic cash. Search tools: directories; search engines; Meta search engines. EDI & E-

content:Business Trade Cycle; EDI; EDI Fact, Electronic content.

4. E-BUSSINESS: Business requirements – concepts; payment processing. launching your e

business- marketing an e-business; public relations; consumer communication; news groups &

forums; exchanging links; web rings; e-business back end systems; business record

maintenance; back up procedures and disaster recovery plans.

5. M-COMMERCE, ADVERTISING & CRM: Introduction to mobile commerce; framework;

applications; design methodology and advantages; future trends in m-commerce. Supply chain

management in e-commerce. Internet Advertising; Models of Internet advertising; sponsoring

content; Corporate Website; Weaknesses in Internet advertising; web auctions. E-retailing; Role

of retailing in E-commerce; E-marketing and advertising. CRM in e-commerce. Case Study:

discussion on a corporate web site. E-commerce legal issues and cyber laws.

TEXT BOOK

1- Chaffey, Dave, “E-business and E-commerce Management”, Pearson Education

REFERENCE BOOKS

84

1. Kalakota, Ravi, Whinston Andrew B . , “E-Commerce-A Manager‟s guide”, Addison

Wesley.

2. David Whetley; E-commerce concepts.

3. M- commerce; Norman Sadeh; Wiley.

85

CA-1328 A Digital Image Processing L T P Cr

3 0 0 3

AIM:

To introduce the student to various image processing techniques.

OBJECTIVES:

To study the image fundamentals and mathematical transforms necessary for image processing.

To study the image enhancement techniques

To study image restoration procedures.

To study the image compression procedures.

To study the image segmentation and representation techniques.

UNIT I DIGITAL IMAGE FUNDAMENTALS

Elements of digital image processing systems, Vidicon and Digital Camera working principles, Elements

of visual perception, brightness, contrast, hue, saturation, mach band effect, Color image fundamentals-

RGB, HIS models, Image sampling, Quantization, dither, Two-dimensional mathematic cal preliminaries,

2D transforms-DFT, DCT, KLT,SVD.

UNIT-II :- IMAGE ENHANCEMENT

Histogram equalization and specification techniques, Noise distributions, Spatial averaging, Directional

Smoothing, Median, Geometric mean, Harmonic mean, Contra harmonic mean filters, Homomorphism

filtering, Color image enhancement.

UNIT-III IMAGE RESTORATION

Image Restoration- degradation model, unconstrained restoration Lagrange multiplier and Constrained

restoration, Inverse filtering-removal of blur caused by uniform linear motion, Wiener filtering,

Geometric transformations-spatial transformations.

UNITIV :- IMAGE SEGMENTATION

Edge detection, Edge linking via Hough transform, Thresholding Region based segmentation.

Region growing, Region splitting and Merging. Segmentation by morphological water sheds. Basic

concepts. Dam construction. Watershed. Segmentation algorithm.

UNITV :- IMAGE COMPRESSION

Need for data compression, Huffman, Run Length Encoding, Shift codes, Arithmetic coding,

Vector Quantization, Transform coding, JPEG standard, MPEG.

Text Book

86

1. Rafael C. Gonzalez, Richard E. Woods, Digital Image Processing', Pearson, Second Edition,

2004.

2. AnilK. Jain, Fundamentals of Digital Image Processing', Pearson2002.

Refrences:-

1.Kenneth R. Castleman, Digital Image Processing, Pearson, 2006.

2. Rafael C. Gonzalez, Richard E.Woods, Steven Eddins, 'Digital Image Processing using

MATLAB', Pearson Education, Inc., 2004.

3. D, E. Dudgeonand RM. Mersereau, Multidimensional Digital Signal Processing', Prentice

Hall Professional Technical Reference, 1990.

4.William K. Pratt, Digital Image Processing', John Wiley, New York, 2002.

5.Milan SonkaetaI, 'Image Processing, Analysis and Machine Vision', Brookes/Cole, Vikas

Publishing House, 2nd

edition, 1999.