SCHOOL OF COMPUTER SCIENCE Scheme of Studies and Syllabus BCA -MCA · PDF file ·...

1

SCHOOL OF COMPUTER SCIENCE

Scheme of Studies and Syllabus

BCA -MCA in Computer Science and

Engineering

(2016-2017 Batch)

2

SCHEME OF STUDIES BCA and BCA, MCA Integrated Degree Programme

1st Year

SEMESTER – I

THEORY

Course

No. Course Name

Periods Cr

L-T-P

CA-1101 A Computer programming 4-0-0 4

CA-1108 A Internet and Web Development 4-0-0 4

MA-1104 A Mathematics – I 4-0-0 4

EN-1101 A Technical Communication 3-0-0 3

PH-1104 A Basics of Physics 3-0-0 3

BA-247 A Accounting and Financial Management 3-0-0 4

PRACTICALS/PDP

Course No. Course Name Periods

Cr

L-T-P

CA-1151 A Computer Programming Lab 0-0-3 1

CA-1157 A PC Software Lab 0-0-2 1

CA-1158 A Internet and Web Development Lab 0-0-2 1

PDA 192 A Personality Development Skills 0-0-2 2

PDA-191 Co-curricular Activities - 1*

TOTAL CONTACT HOURS TOTAL CREDITS

18-4- 10 (32) 27

3

SCHEME OF STUDIES BCA, MCA Integrated Degree Programme

1st Year

SEMESTER– II THEORY


Cr

L-T-P

CA-1102A Data Structures using C 4-0-0 4

CA-1104A Object Oriented Programming using C++ 4-0-0 4

CA-1106A Discrete structure 3-0-0 3

EC-1101 A Basics of Digital Electronics 4-0-0 4

MA-1105A Mathematics-II 4-0-0 4

CE-101 A Environmental Science and Ecology 2-0-0 2

PRACTICALS/PDP


Cr

L-T-P

CA-1152 A Data Structures Using C Lab 0-0-3 1

CA-1154A Object Oriented Programming using C++ Lab 0-0-3 1

PD-251 A MAT LAB 0-0-2 2

PDA-191 Co-curricular Activities - 1*


17-4-8 (29) 24+1*

4

SCHEME OF STUDIES BCA, MCA (Integrated) Degree Programme

2nd

Year

Semester-III

THEORY

SI.

No. Course No Course Name

Periods Cr

L-T-P

1 CA-1201 A Operating Systems 4-0-0 4

2 CA1202A Computer Architecture & Organization 4-0-0 4

3 CA-1206A Multimedia Technologies 4-0-0 4

4 CA-1210A Computer Networks 3-0-0 3

5 CA-1212A Core Java 4-0-0 4

6 CA-1213 A Database Management System 4-0-0 4

PRACTICAL / DRAWING / DESIGN

SI.

No. Course No. Course Name

Periods Cr

L-T-P

1 CA1256A Multimedia Technologies Lab 0-0-2 1

2 CA-1262A Core java Lab 0-0-2 1

3 CA-1263 A Database Management System Lab 0-0-3 1

4 PD-292 A Effective Communications** 0-0-2 2

5 PD-291 Co-Curricular Activities 1*


18-5-8(31) 28

5

2nd

Year

Semester-IV

THEORY

SI.


Periods Cr

L-T-P

1 CA-1204A Computer Graphics 4-0-0 4

2 CA-1205A Design and Analysis of Algorithms 4-0-0 4

3 CA-1207A Linux and Shell Programming 3-0-0 3

4 CA-1208A Applied Numerical Techniques 3-0-0 3

5 CA-1209A IT Management 3-0-0 3

6 CA-1211A Rapid Application Development 3-1-0 4


SI.


Periods Cr

L-T-P

1 CA-1254A Computer Graphics Lab 0-0-2 1

2 CA-1257A Linux and Shell Programming Lab 0-0-2 1

3 CA-1261A Rapid Application Development Lab 0-0-2 1

4 PD 293 A INTERPERSONAL SKILLS 0-0-2 2



18-4-8(30) 26+1*

6

SCHEME OF STUDIES

BCA, MCA (Integrated) Degree Programme

3rd

Year

Semester-V

THEORY

SI.


Periods Cr

L-T-P

1 CA-1302A Software Engineering Principles 4-0-0 4

2 CA-1303A Programming Using C# 4-0-0 4

3 CA-1304A Artificial Intelligence 4-0-0 4

4 CA-1305A Introduction to E-commerce 3-0-0 3

5 Elective – I 3-0-0 3


SI.


Periods Cr

L-T-P

2 CA-1353A Programming Using C# Lab 0-0-2 1

CA-1354A Artificial Intelligence Lab 0-0-2 1

3 CA-1381A Minor project -1 0-0-10 5

3 PD-392 A Problem Solving Skills 0-0-2 2



15-3-14(32) 27 +1*

7

3rd

Yr Year

Semester-VI

THEORY

SI.

No.

Course

No Course Name

Periods Cr

L-T-P 1 CA-1306 A Software Project Management 3-0-0 3

2 CA-1307 A Neural Network 4-0-0 4

3 CA-1309 A Network security & management 3-0-0 3

4 CA-1310 Python Programming 3-0-0 3

5 Elective -2 3-0-0 3

6 CA-1382 Project 0-0-8 4


SI.


Periods Cr

L-T-P

1 CA-1357 Neural network lab 0-0-2 1

2 CA-1360 Python Programming Lab 0-0-2 1



18-3-8(29) 22+1*

8

BCA MCA Integrated Degree Programme

4th

Year (1st yr for Lateral entry)

SEMESTER – vii (semester –I for Lateral Entry)

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

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

PRACTICAL/DRAWING/DESIGN


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 – VIII (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

9

SCHEME OF STUDIES

BCA MCA Integrated Degree Programme

5TH

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

5TH

year

SEMESTER – X ( 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

LIST OF ELECTIVES

SEMESTER – IX(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

10

BCA and BCA MCA integrated Degree Programme

Elective -1

S.N. Course No. Course Name L-T-P Cr. 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

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

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

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

ELECTIVE -2

S.N. Course No. Course Name L-T-P Cr. 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

11

Ist Year

School of Computer Science

12

Detailed Syllabus

CA-1101 A COMPUTER PROGRAMMING USING C 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. COMPUTER FUNDAMENTALS AND PROGRAMMING BASIC: Computer Fundamentals:

Definition, Block Diagram, classification of Computer software (Application / System Software),

radix number system – decimal, binary, octal, hexadecimal numbers and their inter conversions.

Types of programming languages (Machine Language, Assembly Languages, High level

Languages), Introduction to Compiler, Assembler, and Interpreter, Operating System,

Programming Fundamental, Algorithm, Flow charts and their symbols.

2. OVERVIEW OF C PROGRAMMING & CONTROL STATEMENTS: Introduction to C,

Structure of C program, C character set, Identifier and Keywords, Data types, constants, variables,

Declaration, expressions, type conversion, Types of operators, Input and output functions in C,

header files, common programming errors, Control Statements & loops: Sequencing, Selection: if

and switch statements, iteration: for loop, while loop, do while loop, break & continue statements

3. ARRAYS AND STRING HANDLING: Declaring, Referencing and initializing arrays, array

subscript, using for loop for sequential access, Using array element as a function argument, multi-

dimensional array, String basics string library functions, assignment and substring, concatenation,

string comparison.

4. FUNCTION AND POINTERS: Defining a function, accessing a function, function prototypes,

passing arguments to a function, call by value and reference, Types of storage classes, Scope of

variable: Global, local, static variables, Recursion. Pointer variables, Declaring & initializing

pointers, operations on pointers, pointer expressions, pointers and arrays, pointer and functions,

C's dynamic allocation functions.

5. STRUCTURE, UNION AND FILE PROCESSING: Declaration and Initialization of structure,

accessing members of a structure, Union, Pre-processor directives, file processing: Introduction,

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, structures read and write in files,

TEXT BOOK

1. Computer Fundamentals, P.K Sinha, 5th Edition, BPB Publications.

2. Yashwant kanitkar,” Let Us C”, by BPB Publication.

REFERENCE BOOKS

1. Dennis, M. Ritchie and Brian, W. Kernigham, “The C Programming Language, Prentice Hall

of India, 2nd Edition, 1988

2. Hanly Jeri R, & E. B. Koffman , “Problem Solving and Program Design in C”, Pearson

Publication, 5th Edition, 2008.

3. Byron, C. Gottfried, “Theory and Problem of Programming with C”, Tata McGraw Hill

4. E.Balagurusamy “C – programming” Tata McGray Hill.

5. Schildt, Herbert “The Complete Reference C”, 4th Edition, Tata McGraw Hill, 2004

13

CA-1108 A Internet and Web Development L-T-P Cr

3-1-2 4

Objective:

It aims to provide students will be familiarized with Internet Structure and with the basic

protocols which provides knowledge of a proficiency in basic techniques for the development

of Web-based applications.

Pre-Requisites:

Knowledge of Web, and basics of Computer and Internet.

1. INTRODUCTION TO Web and Hosting: The idea of hypertext and hyper media; how

the browser works: MIME types, plug-ins and helper applications; XML, XHTML, XSLT

and the W3C,Hosting and Domains: Choosing a domain name, Selecting a hosting company

,Blog hosting services and how they could work for your website; Hosting management tools

through the browser such as cPanel.

2.HYPERTEXT MARKUP LANGUAGE: The anatomy of an HTML document; marking

up for structure and style: ordered and unordered lists, Structuring content with HTML using

natural divisions , Marquee, Anchor Tag, Email Link; embedding images and controlling

appearance, table creation: Frames and Nesting, iframes, forms, Semantic elements of

HTML5, HTML5 Form elements, Media tags in HTML5, HTML5 Data Storage

3 Power of CSS: Introduction to Cascading Style Sheet: Selector, Declaration and

declaration block. Types of CSS: Inline, Internal and Internal style specifications within

HTML. Types of Selector; Building & Applying Class Selectors; ID Selector using Div Tags;

CSS Properties: Table,List,Fonts,Link,Margins,Background,Colors.

4. Client Side Programming: Introduction to JavaScript syntax: output, Comments,

variables, functions, operators, conditions, switch, loop; JavaScript object model: Window,

Location and History object model; HTML DOM: Introduction to DOM: methods, event

handling, JavaScript Functions, Forms validation and regular expressions.

5. Search Engine Optimization: What is Search Engine Optimization? Natural vs. paid

search and a look at how Google and other search engines work. Maximizing natural search

with page titles, meta tags and page content; importance of inbound links in search rankings.

Search engine marketing.

Textbook:

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

14

References Books:

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

2000.

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

3. Guy W.Lecky-Thompson, “Web Programmin”, Cengage Learning, 2008.

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

Web References:

1. http://W3schools.com.

2. http://www.uniweb.be/

3. http://www.sagaciousindia.com/

http://www.uniweb.be/

http://www.sagaciousindia.com/

15

EN-1101 A TECHNICAL COMMUNICATION L-T-P Cr.

3-0-0 3

OBJECTIVE To make students understand the concepts related to language development communication skills.

1. INFORMAL CONVERSATION Vs FORMAL EXPRESSION, TYPES OF COMMUNICATION: Oral, Writing and Reading- Word- Power- Vocabulary- Jargon- rate of speech; pitch; tone- Clarity of voice, Verbal and non-verbal communication; barriers to effective communication- kinesics.

2. TECHNICAL PRESENTATION: Types of presentation- video conferencing- participation in meetings- chairing sessions.

3. FORMAL AND INFORMAL INTERVIEWS: Ambiance and polemics- interviewing in different settings and for different purposes e.g. eliciting and giving information; recruiting; performance appraisal.

4. WRITTEN COMMUNICATION: Differences between spoken and written communication- features of effective writing such “as clarity; brevity; appropriate tone clarity; balance etc.

5. LETTER-WRITING: Business forma culture-style-effectiveness; promptness- Analysis of sample letters collected from industry- email; fax.

TEXT BOOK: Pal Rajendra, Korlaha, Hi, J,S., “Essentials of Business Communication”, Sultan Chand & Sons

REFERENCE BOOKS

1. Rutherford, Andrea, J., “Basic Communication Skills for Technology”, Pearson Education Asia. 2. Prasad, V., “Advanced Communication Skills”, Atma Ram Publications, New Delhi. 3. Madhukar, R., K, “Business Communication”, Vikas Publishing House Pvt. Ltd.

16

CA-1151 A Computer Programming Lab L-T-P Cr.

0-0-2 1

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

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

17

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

18

CA-1157 A PC Software Lab

L-T-P Cr

0-0-2 1

LIST OF EXPERIMENTS/EXERCISES

1. All commands specified using windows

2. Introduction to MS-Word: introduction to word processing, its features.

3. MS Word: formatting documents, paragraph formatting, indents.

4. Page formatting, header and footer, bullets and numbering.

5. Ms-Word: tabs, tables, formatting the tables, finding and replacing text, mail merging etc.

6. Introduction to MS-Excel, introduction to electronic spreadsheets, feature of MS-Excel

7. Entering data, entering series, editing data, cell referencing, ranges, formulae, functions, auto sum,

copying formula

8. MS Excel: formatting data, creating charts, creating database, sorting data, filtering etc.

9. Introduction to MS PowerPoint, PowerPoint, features of MS-PowerPoint clipping, slide animation,

slide shows, formatting etc.

10. Ms-PowerPoint presentation (10-15 slides) on (i) evolution of computers (ii) search engines

19

CA-1158 A Internet and Web Development Lab L-T-P Cr

0-0-2 1

List of Practicals:

1. Design a web page using: Physical and Logical tags of HTML.

2. Design a web page using

Ordered List

3.2 Unordered Lists

3.3 Nested Lists

3. Design a web page to show the use of image as a hyperlink.

4. Design a web-page using frames and linking.

5. Code to create a bookmark.

6. Design a web-page showing the use of forms using HTML 4.01 and HTML 5 Tags.

7. Design a page using basic tags of HTML 5.0.

8. Design a web-page using style sheets (External, Internal and Inline)

9. Write a Program to print if the no is even or odd using JavaScript.

10. Input a number and find the difference of the sum of factors and non-factors.

11. WAP in JavaScript to print the pattern

12345

1234

123

12

1

12. WAP to Accept an Array of 10 numbers and display the sum of elements.

13. WAP to find greatest of all elements of an array.

14. Design a web-page to show different validation checking using Java Script.

15. WAP in PHP code for calculating S.I.

16. WAP to Calculate factorial of a number.

17. WAP to print the table of 10.

18. WAP to print the sum of diagonal elements.

19. WAP to enter 5

20

CA-1102 A DATA STRUCTURES USING C L-T-P Cr

3-0-0 3

OBJECTIVE:

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

Structures.

PRE-REQUISITES:

Knowledge of basic computer programming

1. INTRODUCTION TO DATA STRUCTURES AND RUNNING TIME: Definition of data

structures and abstract data types; linear vs. non-linear data types; primitive vs. non-primitive data

types; Static and Dynamic implementations; Arrays:1,2-dimensional arrays, search, insertion,

deletion in 1-D.Time Complexity; Big – Oh - notation; 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; definition of Queues; Array based

implementation of Queues. Circular queue.

3. LINKED LISTS: Lists; Types of Linked list, Operations on Linked list; Circular Linked list;

Linked List based implementation of stacks; Linked List implementation of Queues; 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.

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 ALGORITHMS: Introduction; Sorting by exchange; selection;

insertions; bubble sort; Merge sort; Quick sort; Searching Algorithms: Straight Sequential Search;

Binary Search (recursive & non–recursive Algorithms).

TEXT BOOK

Aho, A.V, Hopcroft, J. E., Ullman, T. D., “Data Structures and Algorithms”, Original Edition,

Addison-Wesley, Low Priced Edition, 1999

REFERENCE BOOKS

1. A. M. Tenenbaum, Langsam, Moshe J. Augentem, “Data Structures using C”, Prentice Hall of

India

2. Ellis, Horowitz, SartajSahni, “Fundamentals of Data Structures”, Addison-Wesley Pub, 1983

3. Mark Allen Weiss, “Data Structures and Algorithms Analysis in C”,Pearson Education, 2000

21

CA-1104A OBJECT ORIENTED PROGRAMMING USING C++ L-T-P Cr

4-0-0 4

OBJECTIVE:

To 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 objects and object oriented programming;

Difference between procedural oriented and objected oriented paradigm ,features of objected

oriented programming: encapsulation (information hiding); Abstraction, Inheritance,

Polymorphism, dynamic binding, access modifiers: introduction to C++, simple C++ programs,

function overloading, Inline function, reference type, default arguments, concept of namespace

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

members of structures; class scope and accessing class members; controlling access to a class;

method; or variable (public; protected; private; separating interface from implementation;

controlling access function and utility functions; initializing class objects: constructors; default,

parameterized and copy constructor; 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;

3. OPERATOR OVERLOADING& TEMPLATES: 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.

Concept of Templates & generic programming, Function Templates, class templates

4. INHERITANCE; VIRTUAL FUNCTIONS AND POLYMORPHISM: Introduction;

inheritance: base classes and derived classes; protected members; single, multiple, multilevel,

hierarchical, inheritance; overriding base–class members in a derived class; public; protected and

private inheritance; using constructors and destructors in derived classes.casting base-class

pointers to derived-class pointers;, virtual function & dynamic binding

5. FILES, I/O STREAMS& EXCEPTION HANDLING: Files and streams;stream input/output

classes and objectsfile modes, opening a file, creating & writing to a sequential access file;

reading data from a sequential access file; updating sequential access files; unformatted I/O

(with read and write);,reading & writing objects, file pointers and related functions, stream

manipulators.Basics of C++ exception handling: try; throw; catch; throwing an exception;

catching an exception.

TEXT BOOK:

Balagurusamy, E., “Object Oriented Programming with C++”, Prentice Hall of India, 2008.

REFERENCE BOOKS

1. Kamthane, “Object Oriented Programming with ANSI and Turbo C++”, Pearson Education

2. Lafore, Robert, “Object Oriented Programming in Turbo C++”, The WAITE Group Press, 1994

3. Schildt, Herbert “C++: The Complete Reference”, Tata McGraw Hill, 3rd Ed, 2008

Bhave, “Object Oriented Programming with C++”, Pearson Education

22

CA-1106A DISCRETE STRUCTURES L T P Cr

3 0 0 3

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: Basic operations: AND (Λ), OR (V), NOT (~), truth value of a

Compound statement, propositions, tautologies, contradictions.

3. TECHNIQUES OF COUNTING: Permutations with and without repetition, combination.

4. ALGEBRIC STRUCTURES: Definition and examples of a monoid, semi group, groups and

Rings; homomorphism, isomorphism and auto Orphism; subgroups and normal subgroups; cyclic

groups, integral domain and fields; co-sets; Lagrange‟s theorem

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

Graphs; sub graphs; 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, Spanning tree

TEXT BOOK

1. Liu C. L., “Elements of Discrete Mathematics”, 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 Mathematics”, Modular Mathematics Series,Edward

Arnold, London, 1995

5. Lipshutz S., “Schaums Outline series: Theory and problems of Probability”, McGraw Hill

Singapore,1986.

6. 6. Kolman B. and Busby R. C., “Discrete Mathematical Structures”, Prentice Hall of India,

1996

7. Trembley and Manohar, “Discrete Mathematical Structures with Applications to Computers”

McGraw Hill, 1995

23

CA-1152 A DATA STRUCTURES USING C LAB L-T-P Cr

0-0-2 1


1. Write a program to search an element in an array using linear search. 2. Using iteration & recursion concepts write programs for finding the element in the array using Binary Search

Method 3. Write a program to perform following operations on matrices using functions only

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

4. Write a program for static implementation of Stack 5. Write a program for static implementation of Queue 6. Write a program to create a linked list & perform operations such as insert, delete, update, reverse in the

link list 7. Write a program to create a linked list & perform operations such as insert, delete in the Circular link list 8. Write a program to implement binary search tree. (Insertion and Deletion in Binary Search Tree) 9. Write a program which simulates the various tree traversal algorithms. 10. Write a program to implement bubble sort 11. Write a program to implement selection sort 12. Write a program to implement insertion sort 13. Write a program to implement quick sort

Write program to implement merge sort

24

CA-1154 A OBJECT ORIENTED PROGRAMMING using C++ LAB L-T-P Cr

0-0-2 1


1. Write a program for Basic/Simple logic building in C++

2. Write a program to implement function overloading

3. Write a program to implement the concept of class and object

4. Write a program to implement the concept of friend function

5. Write a program to implement the concept of static data member

6. Write a program using the concept of constructor & destructor

7. Write a program to Implement operator overloading

8. Write a program to Implement single inheritance

9. Write a program to Implement Multiple inheritance

10. Write a program to Implement Virtual function

11. Write a program to create, read & write sequential file

12. Write a program to create, read & write random access file

13. Write a program to implement function template

14. Write a program to implement class template

15. Write a program for exception handling

Reference book

1. Barkakati, Nabajyoti, “Object Oriented Programming in C++”, Prentice Hall of India, 2001. 2. Schildt, Herbert, “C++: The Complete Reference”, Tata McGraw Hill, 4

th Edition, 2003

25

PD-251 A MATLAB L T P Cr

0-0-2 1

OBJECTIVE

MATLAB is a powerful language for technical computing. It is widely used in universities and colleges for courses

in mathematics, science and especially in engineering. In industry the software is used in research, development

and design. This course is intended for students who are using MATLAB for the first time and have little or no

experience in computer programming.

1. BASIC STRUCTURE and FEATURES OF MATLAB: Command window; figure window; editor window and

help window; arithmetic operations with scalars, order of precedence; using MATLAB as a calculator; display

formats; elementary math built-in functions; scalar variables, assignment operator; predefined variables; useful

commands for managing variables; applications in problem solving.

2. CREATING ARRAYS – one dimensional, two dimensional; array addressing; built-in functions for handling

arrays; mathematical operations with matrices; strings and strings as variables; generation of random numbers;

examples of MATLAB applications.

3. SCRIPT FILES: Creating and saving a script file, current directory; output commands

4. TWO – DIMENSIONAL PLOTS: Plot command; line specifiers plot of a given data; plot of a function; plotting

multiple graphs in the same plot.

5. FUNCTIONS AND FUNCTION FILES: Creating a function file; input and output arguments; function body;

comment lines; saving a function files; using a function file; programming in MATLAB.

TEXT BOOK

Gilat Amos, “MATLAB: An Introduction with Applications”, John Wiley & Sons, Inc (Wiley Student Edition), 2008

REFERENCE BOOK

Herniter, E. Marc, “Programming in MATLAB”, Brooks/Cole, Thomson Learning

26

2nd

Year

School of Computer

Science

27

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. PROCESS MANAGEMENT: Functionalities and Objectives of OS, historical evolution of

operating systems, types of operating system, O/S service system calls, system programs, Process

States, Process Control Block, Processor Scheduling, CPU scheduling, scheduling criteria,

scheduling algorithms

2. PROCESS-SYNCHRONIZATION & DEADLOCKS: Critical Section; Mutual exclusion,

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

recovery;: Dining philosophers problem; semaphores.

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;.

4. FILE SYSTEM: Different types of files and their access methods; directory structures; various

allocation methods; disk scheduling and management.

5. I/O SYSTEMS: I/O Hardware; Device Controllers; Interrupt Handlers; Device Drivers;

Application I/O Interface; Kernel; Transforming I/O requests; Performance Issues. TEXT BOOK: Silberchatz et al, ―Operating System Concepts‖, 5th edition, Addison-Wesley, 1998

REFERENCE BOOKS:

1. Tanenbaum A., ―Modern Operating Systems‖, Prentice-Hall, 1992

2. Stallings William, ―Operating Systems Internals and Design P rinciples‖ , 4th edition, Prentice-Hall,

2001

3. Dhamdhere D. M., ―Operating System‖, 2nd Edition, Tata McGraw Hill, 1999

4. Kernighan Brian and Pike Rob, ―The Unix Programming Environment‖, Prentice Hall of India,

1984

5. Bach Maurich, ―Design of the Unix Operating System ‖, Prentice Hall of India, 1986

6. Muster John, ―Introduction to UNIX and LINUX‖, Tata McGraw Hill, 2003

7. Ritchie Colin, ―Operating System Incorporating Unix & Windows‖, Tata McGraw Hill, 1974

8. Madnick Stuart and Donovan John, ―Operating Systems‖, Tata McGraw Hill, 2001

CA-1201 A OPERATING SYSTEMS L T P Cr 4 0 0 4

28

OBJECTIVE: To provide basic knowledge of internals of microprocessor, its architecture, components, terminologies, etc. at minute level and ultimately about the working of a digital computer hardware as a whole.

PRE-REQUISITES: Knowledge of data structures, microprocessors and interfacing,

1. GENERAL SYSTEM ARCHITECTURE: k-map, number system, FF, Boolean algebra,

design of logic gates. Functions and block diagram of computer, store program control

concept, Flynn„s classification of computers (SISD, MISD, MIMD); multilevel viewpoint of a

machine: digital logic, operating systems, high level language; structured I/O; performance

metrics; MIPS, MFLOPS, GFLOPS and TFLOPS.

2. INSTRUCTION SET ARCHITECTURE: Instruction codes, instruction set formats (fixed,

variable, hybrid); types of instructions, memory reference, register reference, I/O reference;

addressing modes: register, immediate, direct, indirect, indexed; operations in the

instruction set; arithmetic and logical, data transfer, control flow; types of interrupts;

timing and control; instruction set based classification of processors (RISC, CISC, and

their comparison).

3. BASIC NON PIPELINED CPU ARCHITECTURE: CPU Architecture types

(accumulator, register, stack, memory/ register) detailed data path of a typical register based

CPU, fetch-decode-execute cycle (typically 3 to 5 stage); micro-instruction formats,

implementation of control unit: hardwired and micro-programmed, control memory,

microinstruction sequencing.

4. MEMORY HIERARCHY & I/O TECHNIQUES: Need for a memory hierarchy

(Locality of Reference Principle, memory hierarchy in practice: cache, main memory and

secondary memory, memory parameters: access/ cycle time, cost per bit); main memory

(semiconductor RAM & ROM organization, memory expansion, static & dynamic memory

types); cache memory: associative &direct mapped cache organizations. .Internal memory,

High speed memory.

5. INTRODUCTION TO PARALLELISM: Goals of parallelism (exploitation of concurrency,

throughput enhancement); Amdahl„s law; instruction level parallelism (pipelining, super

scaling-basic features); processor level parallelism (multiprocessor systems overview).,

parallel processing concept, processing power and buses of a microprocessor, components of

microprocessor; I/O ports.

TEXT BOOK

1. Carpinelli, ―Computer Organization & Architecture‖ Tata McGraw Hill, 2001

REFERENCE BOOKS 1. Stallings. W, ―Computer Organization &Architecture: Designing For

Performance‖, 6th Edition, Prentice Hall of India, 2002/ Pearson Education Asia, 2003

2. Mano M Morris, ―Computer System Architecture‖, 3rd Edition, Prentice Hall of India Publication, 2001

/ Pearson Education Asia, 2003

3. Rajaraman V. and Radhakrishnan T, ―Introduction to Digital Computer Design‖, 4th Edition, Prentice

Hall of India 2004.

4. Stalling William, ―Computer Organization and Architecture‖, 7th Edition, Prentice Hall of India, 2005.

CA-1202 A COMPUTER ORGANIZATION AND ARCHITECTURE L T P Cr

4 0 0 4

29

CA-1206 A MULTIMEDIA TECHNOLOGIES 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: Introduction and application of multimedia,

framework for multimedia systems; multimedia authoring tools, concept of multimedia project,

stages, interactive and non interactive multimedia, different storage device

2. MULTIMEDIA Distribution:: internet; World Wide Web & multimedia distribution network:

ATM & ADSL; multimedia servers & databases; Animation :introduction types of animation,

morphing, ,color modes, importance of text, Unicode.

3.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.

4.AUDIO: Digital representation of sound; time domain sampled representation; method of encoding

the analog signals; sub-band coding; Fourier method; transmission of digital sound; digital audio

signal processing; stereophonic and quadraphonic signal processing; editing sampled sound; MPEG

Audio; audio compression and decompression; brief survey of speech recognition and generation;

audio synthesis; musical instrument digital interface

5. VIDEO: digital video and image compression; MPEG motion video compression standard; DVI

technology; time base media representation and delivery. Video on demand. 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.

TEXT BOOK

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

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.

30

CA-1210 A COMPUTER NETWORK 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. OSI REFERENCE MODEL AND NETWORK ARCHITECTURE: Introduction to Computer Networks;

Example networks ARPANET; Internet; Private Networks; Network Topologies: Bus-; Star-;

Ring-; Hybrid-; Tree -; Complete -; Irregular –Topology, Types of Networks: Local Area

Networks; Metropolitan Area Networks; Wide Area Networks; Layering architecture of

networks; OSI model; Functions of each layer; Services and Protocols of each layer.

2. TCP/IP: Introduction; History of TCP/IP; Layers of TCP/IP; Protocols; Internet Protocol;

Transmission Control Protocol; User Datagram Protocol; IP Addressing; IP address classes;

Subnet Addressing; Internet Control Protocols; ARP; RARP; ICMP; Application Layer;

Domain Name System; Email – SMTP; POP; IMAP; FTP; NNTP; HTTP; Overview of IP

version 6.

3. LOCAL AREA NETWORKS: Introduction to LANs; Features of LANs; Components of

LANs; Usage of LANs; LAN Standards; IEEE 802 standards; Channel Access Methods;

Aloha; CSMA; CSMA/CD; Token Passing; Ethernet; Layer 2 & 3 switching; Fast Ethernet

and Gigabit Ethernet; Token Ring; LAN interconnecting devices: Hubs; Switches; Bridges;

Routers; Gateways.

4. WIDE AREA NETWORKS: Introduction of WANs; Routing; Congestion Control; Quality

of Service, WAN Technologies; Synchronous Digital Hierarchy (SDH)/ Synchronous Optical

Network (SONET); Asynchronous Transfer Mode (ATM); Frame Relay.

5. APPLICATION LAYER: Remote Logging, Electronic Mail, SMTP, POP , IMAP FTP,

WWW, HTTP, SNMP, Network Security: Services, Message Confidentiality, Authentication,

Integrity, Firewalls.

TEXT BOOK

1. Forouzan Behrouz A., “Data Communications and Networking”, Tata McGraw Hill 2006.

REFERENCE BOOKS

1. Tanennbaum Andrew S, “Computer Networks”, 4th Edition, Pearson Education/Prentice Hall

of India, 2003.

2. Stallings William, “Data and Computer Communication”, 5th Edition, Prentice Hall of India,

199

31

CA-1212 A CORE JAVA L T P Cr

4 0 0 4

OBJECTIVE

To relay the theoretical and practical knowledge of Java programming language

PRE-REQUISITES

Basic Knowledge of programming language and object oriented programming

1. INTRODUCTION TO JAVA & PRINCIPLES OF OBJECT ORIENTED

PROGRAMMING: Basic Concepts of OOP and it‟s Benefits; Application of OOP, Features of

Java. Data types & Operators available in java; Control Structures: if, while, do while, for, switch;

Break & Continue Statement; Arrays and Strings: Arrays, Arrays of Characters; String handling

Using String Class; Operations on String Handling Using; String Buffer Class.

2. OBJECT-ORIENTATION: Object-Oriented Programming in Java, Java Program Structure.

Defining of a Class, Definition of Methods, Constructors, Creating Objects of a Class, Assigning

Object Reference Variables, The keyword “this”, Defining and Using a Class, Automatic Garbage

Collection. Extending Class and Inheritance: Using Existing Classes, Class Inheritance, Choosing

Base Class, Access Attributes, Polymorphism, Multiple Levels of Inheritance, Abstraction

through Abstract Classes, Using Final Modifier, the Universal Super class-Object Class.

3. PACKAGE & EXCEPTION: Understanding Packages, Defining a Package, Packaging up your

Classes, Adding Classes from a Package to your Program, Understanding CLASSPATH,

Standard Packages, Access Protection in Packages, Concept of Interface. Exception Handling:

The Idea behind Exceptions, Types of Exceptions, Dealing with Exceptions, Exception Objects,

Defining Your Own Exceptions, Checked and Unchecked Exceptions.

4. MULTITHREADING PROGRAMMING: The Java Thread Model, Understanding Threads,

The Main Thread, Creating a Thread: extending Thread and implementing Runnable, Creating

Multiple Threads, Thread Priorities, Synchronization, Deadlocks inter-thread communication,

Deadlocks. Input/Output in Java: I/O Basic, Byte and Character Structure, I/O Classes, Reading

Console Input, Writing to Console Output, Reading and Writing on Files, Random Access Files,

Storing and Retrieving Objects from File. Stream Benefits.

5. JAVA DATA BASE CONNECTIVITY (JDBC): Database Connectivity- Relation Databases;

JDBC API; Reusing Database Objects; Transactions; Advance Techniques. Java Utilities

(java.util Package) The Collection Framework : Collections of Objects; Collection Types; Sets

Sequence Map; Understanding Hashing; Use of Array List & Vector.

TEXT BOOK:

Balaguruswamy , E., ““Programming with Java”, Tata Mcgraw Hill.

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

32

CA-1213 A DATABASE MANAGEMENT SYSTEM

L-T-P Cr

4-0-0 4

OBJECTIVE :

To provide knowledge about various organizations and management information systems, keeping in

view the aspects of shareability, availability, evolvability and integrity.

1. INTRODUCTION: Purpose of database system; characteristics of database approach; advantages

of using DBMS; database concept and architecture; data abstraction, data models; instances and

schema; data independence; schema architecture; database languages; database manager; database

administrator; database users.

2. DATA MODELING: Introduction to Hierarchical model, Network model. Relational model, E-R

Model, Entity sets attributes and keys; relationships (ER); database modelling using entity; type role

and structural constraints; weak and strong entity types; entity-relationship diagram-basic concepts;

Enforcing Data Integrity Constraints; Relational-Algebra Operations; Introduction on views; Codd's

Rules.

3. NORMALIZATION& SQL: Database design process; relational database design; relation

schema; anomalies in a database; functional dependencies; 1NF, 2NF, 3NF and BCNF. ; Reduction of

an E-R schema to Tables; Introduction to SQL; basic queries in SQL; advanced queries in SQL;

functions in SQL; basic data retrieval; updates in SQLs, views in SQL.

4. FILE ORGANIZATION: indexing and hashing; overview of file organization techniques;

secondary storage devices; operations in files; heap files and sorted files; ; Indexing and Hashing-

Basic concepts; Static Hashing; Dynamic Hashing; ordered indices; single level ordered index; multi-

level index.

5. TRANSACTION PROCESSING & QUERY PROCESSING: Desirable properties of

transactions; implementation of atomicity and durability; schedules and recoverability; serializability

of schedules; concurrency control. Deadlock handling - detection and resolution.

TEXT BOOK

1. Silberschatz A., Korth H. F. and Sudarshan S., “Database System Concepts”, 3rd edition, McGraw-

Hill, International Edition, 1997

REFERENCE BOOKS

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

Edition,

2000 .

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

3. Elmasri R. and Navathe S. B., “Fundamentals of Database Systems”, 3rd edition, Addison-Wesley,

Low Priced Edition, 2000

33

CA-1256A MULTIMEDIA TECHNOLOGIES LAB L T P Cr

0 0 2 1

List of Experiments

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

2. Design a moving ball in V-shape

3. Design a moving ball in W-shape

4. Design shape tweening – Object to Object

5. Design shape tweening – Object to Alphabet

6. Design shape tweening – Alphabet to Object

7. Create Spot Light using Macromedia Flash.

8. Implement Splitting of Ball

9. Create Animated Pool Table.

10. Create Bow & Arrow hitting a Ball.

11. Write any Text with the illusion of pen writing letters.

34

CA-1262 A CORE JAVA LAB L T P Cr

0 0 2 1

LIST OF EXPERIMENTS

The following programs on different topic are to be done in this lab.

1. Sample Program

(a) Write a Java program to print “Hello Java”

2. Operators and Expressions

(a) Write a java program to find the area of a rectangle.

(b) To write a java program to find the result of the following expressions

(i) (a<<2) +(b>>2)

(ii) (b>0)

(iii)(a+b*100)/10

(iv) a & b

Assume a=10, b=5

(c) To write a java program to print the individual digits of a 3 digit number using

Command line arguments.

3. Decision making statements

(a) Write a java program to read two integers and print the larger number. followed

by the words “is larger”. If the numbers are equal print the message “These

numbers are equal”

(b) Write a java program to read an integer and find whether the number is odd or

even.

(c) Write a java program to find the number of and sum of all integers greater than

100 and less than 200 that are divisible by 7.

4. Looping Statements

(a) Write a Java program to find the sum of digits of a given number.

(b) Write a java program to find the first 15 terms of Fibonacci sequence.

(c) Write a java program to print the Armstrong numbers.

(d) Given a number, write a program using while loop to reverse the digits of the

number.

For example, the number

12345

should be written as 54321.

5. Array & Strings

(a) Write a java program to find the largest and smallest number in an array.

(b) Write a java program to multiply two matrices.

(c) Write a java program to sort the following numbers in descending order.

{55, 40, 80, 65, 71}

(d) Write a java program that creates a string object and initializes it with your name

and performs the following operations

(i) To find the length of the string object using appropriate String method.

(ii) To find whether the character „a‟ is present in the string. If yes find the

number of times „a‟ appear in the name and the location where it appears.

(e) Write a java program to arrange the following word in alphabetical order

35

{Madras, Delhi, Ahmadabad, Calcutta, Bombay}

(f) Write a java program to create a StringBuffer object and illustrate how to append

characters and to display the capacity and length of the StringBuffer.

6. Classes & Objects

(a) Write a java program to display total marks of 5 students using student class.

Given the following attributes: Regno(int), Name(string), Marks in subjects(Integer

Array), Total (int).

(b) Write a java program to find the area of a room using constructor.

(c) Write a java program to implement method overloading.

(d) Write a java program to show the use of “static” members.

(e) Write a java program to implement the nesting of methods.

7. Inheritance

(a) Write a java program to implement single inheritance using “super” keyword.

(b) Write a java program to implement method overriding.

(c) Write a java program to implement multiple inheritances.

8. Package & Multithreading

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

program to print “ Hello package”.

(b) Write a program to implement multithreading using the system function like

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

9. Exception Handling & File handling

(a) Write a java program to implement multiple try/catch statements.

(b) Write a program to copy the content of one file into another using character stream

classes.

(c) Write a program to copy the content of one file into another using byte stream

classes

10. Database Connectivity

(a) Write a programme to connect java application GUI with database.(JDBC)

(b) Write a program to select all the information of a table named as “Student”.

TEXT BOOK Herbert Schildt , “The Complete Reference Java 2 fifth edition, McGraw

Hill.

REFERENCE BOOKS

1. Balaguruswamy , E., ““Programming with Java”, Tata Mcgraw Hill.


36

CA-1263A DATABASE MANAGEMENT SYSTEM LAB L-T-P Cr

0-0-2 1


1. Introduction to SQL.

2. Write a query for:

(i) Creation of table.

(ii) Insertion of data into table

(iii) Displaying the data of table.

(iv) Deletion of data from table

(v) Updating the data

(vi) Modifying the structure of a table.

3. Finding unique names of all salesmen, deletion of the structure of a table, use of delete command

with conditions, updating records of a table with conditions, altering structure of a table and

changing size of existing column in the table

4. Arithmetic operators, logical operators and pattern matching operator.

5. Key constraints: primary key constraints, foreign key constraints, not null constraints and unique

constraints; use of check constraints.

6. Aggregate and mathematical functions: count, count(*), Avg, max, min, sum, lower, upper, power

, sqrt.

7. Creating views from single and multiple tables, drop views and creating index on the table and

drop them.

8. Binary operations in Relational Algebra: Union, Intersection, Set Difference, Join, Cartesian

product.

9. Grouping of data into tables and listing records in ascending order or descending order.

10. Creation of sequences and explain use of sequences.

11. Access permissions in SQL.

37

CA-1204 A COMPUTER GRAPHICS L T P Cr

3 1 0 4

OBJECTIVE

Students completing this course are expected to be able to:

Write programs Using C/C++/ OpenGL graphics environment.

Use polygonal and other modelling methods to describe scenes.

Understand and be able to apply geometric transformations.

Create basic animations.

PRE-REQUISITES: Knowledge of computer programming

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

hardware and software, basic graphics system and standards; Raster Scan and Random Scan graphics;

Raster-Scan Display System, Video Controller, Random-Scan Display processor, frame buffer.

2 ALGORITHMS: Two dimensional graphics primitives: points and lines, line drawing algorithms:

DDA, Bresenham‟s; circle drawing algorithms: using polar coordinates, Bresenham‟s circle drawing,

midpoint circle drawing algorithm.

3. TWO AND THREE DIMENSIONAL TRANSFORMATION: Two dimensional

transformations: translation, scaling, rotation, reflection, shearing, transformation, Homogeneous

coordinates system, 2D composite transformation: matrix Representation of 3-D transformations,

composition of 3-D transformation;

4. TWO DIMENSIONAL VIEWING AND 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

5. THREE DIMENSION VIEWING AND HIDDEN SURFACE REMOVAL: viewing in 3D:

projections, types of projections; the mathematics of planner geometric projections; coordinate

systems: Introduction to hidden surface removal; the Z- buffer algorithm, scan-line algorithm, area

sub-division algorithm.

Text Book:-

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

Reference Book: 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

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

38

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. MATHEMATICAL PRELIMINARIES: Role of algorithm in computing;

mathematical preliminaries; review of growth functions; solution of difference equations;

analysis in terms of space and time complexity.

2. SORTING: Insertion sort; merge sort; heap sort; quick sort; radix sort, bucket sort,

bubble sort, selection sort.

3. ADVANCED DATA STRUCTURES: Stack; queue; linked list; binary search trees; red

black trees.

4. DYNAMIC PROGRAMMING AND GREEDY ALGORITHM: Matrix

multiplications; longest common subsequence, Huffman coding; task scheduling problem.

5. ELEMENTARY GRAPH ALGORITHM AND MINIMUM SPANNING TREE:

Representation of graph; breadth-first search; depth first search; topological sort; strongly

connected components, Growing a minimum spanning tree; Kruskal & Prims algorithms.

TEXT BOOK:

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

Algorithms”, Tata McGraw Hill, 1990.

REFERENCE BOOKS

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”, 2nd

Ed., Addison Wesley, 1998

CA-1205 A DESIGN & ANALYSIS OF ALGORITHMS L T P Cr

3 1 0 4

39

CA-1207A LINUX AND SHELL PROGRAMMING L-T-P Cr

3-1-0 4

Objective: The objective of the course aims to introduce about open source operating system

as We can use Linux as Server OS or as standalone OS on our PC, Shell scripting & IPC etc.

UNIT-1 : UNIX UTILITIES: Introduction to UNIX file system; vi editor; file handling

utilities; security by file permissions; process utilities; disk utilities; networking commands;

cp; mv; In; rm; unlink; mkdir; rmdir; du; df; mount; umount; find; ps; who; w; finger; arp; ftp;

telnet; rlogin; text processing utilities and backup utilities; detailed commands to be covered

are cat; tail; head; sort; nl; uniq; gerep; egrep; fgrep; cut; paste; join; tee; pg; comm.; cmp;

diff; tr; awk; tar; cpio.

UNIT-2 : PROBLEM SOVING APPROACHES IN UNIX: Using single commands; using

compound commands; shell scripts; C programs; building own command library of programs;

working with the Bourneshell : what is a shell; shell responsibilities; pipes and input

redirection; output redirection; shell script examples.

UNIT-3: UNIX FILES: UNIX file structure; directories; files and devices; system calls;

library functions; usage of open; creat; read write; close; Ileek; stat; fstat; octl; umask; dup;

dup2; the standard I/O ( fopen; fclose; fflush; fseek; fgetc; getc; getchar; fputc; putc; putchar;

fgets; gets); formatted I/O; strem errors; streams and file descriptors; file and directory

maintenance (chmod; chown; unlink; link; symlink; mkdir; rmdir; chdir; getcwd).

UNIT-4:UNIX PROCESS AND SIGNALS AND INTER-PROCESS COMMUNICATION:

what is process; process structure; starting new process; waiting for a process; zombie

process; process control; process identifiers; system call interface for process management-

fork; vfork; exit; wait; waitpid; exec; system.

introduction to IPC; IPC between processes on a single computer system; IPC between

process on different systems; file and record locking; other UNIX locking techniques; pipes;

FIFO; streams and messages

UNIT-5:MESSAGE QUEUES AND SEMAPHORES: UNIX system-V messages; UNIX

kernel support for message; UNIX APls for messages client/server example.UNIX system-V

semaphores; UNIX kernel support for semaphores; Unix APls for semaphores; Shared

Memory- UNIX system-V shared memory.

TEXT BOOKS:

W. R. Stevens, “Unix Network Programming”, Pearson/PHI.

REFERENCE BOOKS:

Sumitabha Dass,”Unix Concepts and Application”, 3rd Edition, Tata McGraw Hill.

40

CA-1209A IT Management

L T P Cr

3 0 0 3

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

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.

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.

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

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.

41

CA-1211 A RAPID APPLICATION DEVELOPMENT L T P Cr

4-0 0 4

Objective :- The course on RAD focuses on building applications within a very short time

period. After successful completion of this course the students will be able to obtain a firm

foundation on RAD concepts and methodologies and acquire sufficient working knowledge

in RAD tools.

PRE-REQUISITES

Knowledge of programming in C, C++, JAVA

1. Rapid Application Development: Introduction to RAD Definition, history; importance strategy; constraints; advantages and disadvantages; customer oriented development;

2. Different RAD tools: Introduction of different RAD tools; open source versus licensed software builder; Easy Eclipse, Visual studio .net and its. Major components: Various applications build using visual studio; familiarity with IDE visual studio.

3. .NET Overview & Getting Started with Visual Basic.Net:: Building blocks of .NET framework, Architecture; .NET programming languages; MSIL, Metadata, Common Language Runtime, CTS,CLS, Managed code; what‟s new in VB.Net, building VB.Net Application, Operators, Methods, Properties, Conditionals and Loops.

4. Implementing OOP using Visual Basic.Net: Structures, Object-Oriented features, Procedures, function & Collection, Exception Handling, SDI and MDI Application.

5. WindowsFormControls & Data Access: Form, Button, Textbox, Label, Linkbutton, Checkbox, Listbox, Combobox,Radiobutton,Calender,DateTimepicker,DialogBox:Font,Color,Openfile,Savefile,Print;Contextmenu,Picturebox,Progressbar,Richtextbox;OLE, DAO Introduction to data access with ADO.NET; components of ADO.NET. Two Applications in VB.NET

Text Book

1. The Complete Reference Visual Basic .NET, Tata McGRAW- Hill Edition, Jeffrey R. Shapiro

REFERENCE BOOKS:

2. Visual Basic.Net Programming, Black Book, Dreamtech Press.

42

CA-1254 A COMPUTER GRAPHICS LAB L T P Cr

0 0 2 1

LIST OF EXPERIMENTS

1. Write a program for 2D line as raster graphics display using Bresenhem line drawing algorithm

2. Write a program for 2D line drawing as raster graphics display using DDA line drawing algorithm

3. Write a program for circle drawing as raster graphics display using mid point circle drawing algorithm

4. Write a program for circle drawing as raster graphics display using Bresenhems circle drawing algorithm

5. Write a program for Transformation operations using

a) 2D Translation Transformation

b) 2D Scaling Transformation

c) 2D Rotation Transformation

6. Write a program for line clipping

7. Write a program for polygon clipping

8. Write a program for display 3D object as 2D raster graphics display using perspective transformation

9. Write a program for rotation for 3D object about arbitrary axis

10. Write a program to create screen saver using graphics Commands

REFERENCE BOOKS

1. Pradeep Bhatia, “Computer Graphics”, 2nd

Edition, I K Publishers, 2009. 2. Computer Graphics by Donald Hearn and M. Pauline Baker, 2nd Edition, Prentice Hall of India, 1999 3. Procedural Elements for Computer Graphics, David F. Rogers, Tata McGraw Hill, Second Edition, 2001

43

CA-1257 A LINUX & SHELL PROGRAMMING LAB L T P Cr

0 0 2 1

LIST OF EXPERIMENTS

1. Study of Linux Operating System

2. Internal System commands and Control Structure in Linux OS

3. Processes and Threads in Linux Operating System

4. Systems and Function Calls in Linux OS

5. Writing of shell scripts in Linux OS

6. AWK Programming in Linux OS

7. Write a shell script to generate a multiplication table.

8. Write a shell script that copies multiple files to a directory.

9. Write a shell script that counts that number of lines and words present in a given file.

10. Write a shell script that displays the list of all files in the given directory.

11. Write a shell script (small calculator) that adds, subtracts, multiplies and divides the given two integers.

12. There are two division options: one returns the quotient and the other returns reminder. The script

requires 3 arguments: The operation to be used and two integer numbers. The options are add (-a), subtract

(-s), multiply (-m), quotient (-c) and reminder (-r).

13. Write a shell script to reverse the rows and columns of a matrix.

REFERENCE BOOK

Rochkind, M.J., “Advanced Unix Programming”, 2nd

Edition, Pearson Education.

44

CA-1261 A RAPID APPLICATION DEVELOPMENT LAB L T P Cr

0 0 2 1


1. Program to create 3 forms and perform the following tasks:

a. Calculate addition of 5 numbers

b. Calculate factorial of a number

c. Find whether a given number is even or odd

2. Program to create an employee registration form.

3. Program to create a form and perform the following array operations:

a. Sorting of elements of array

b. Searching a number in an array

c. Merging of 2 given arrays

4. Program to show error handling mechanism in vb.

5. Program to show common dialog control and menu based operations.

6. Program to show functioning of a calculator.

7. Program to create an employee registration form and save the employee records in

random files.

8. Program to show employee record and department records using ado control.

9. Program to create data reports in VB

a. Data report showing employee records stored in database.

b. Data report showing employee list according to their respective departments.

10. Program to create a data report in VB to show the salary details of the employee whose id

is entered.

45

3rd

Year


46

CA-1302 A SOFTWARE ENGINEERING PRINCIPLES L T P Cr

4 0 0 4

OBJECTIVE

To provide basic knowledge of properties of software and its development processes, software

quality, CASE tools, etc.

PRE-REQUISITES: Knowledge of computer programming, principles of management

1- Introduction: Introduction to Software Engineering, Definition of Software Engineering,

Software Components, Software Characteristics, Software Crisis, Software Engineering

Processes, Similarity and Differences from Conventional Engineering Processes,

Applications, Software Myths. Software Development Life Cycle Model: Water Fall Model,

Prototype Model, Spiral Model, Evolutionary Development Models, Iterative Enhancement

Models.

2- Software Requirement Specifications: Requirement Engineering Process: Elicitation,

Analysis, Documentation, Review and Management of User Needs, Feasibility Study,

Information Modeling, Data Flow Diagrams, Control Flow Model, SRS Document, IEEE

Standards for SRS, Data Dictionary.

3- Software Design: Basic Concept of Software Design, Architectural Design, Low Level

Design: Modularization, Design Structure Charts, Flow Charts, Coupling and Cohesion

Measures, Design Strategies: Function Oriented Design, Top-Down and Bottom-Up Design.

4- Coding & Software Testing and Maintenance: Top-Down and Bottom –Up programming,

structured programming, Code Inspection, Compliance with Design and Coding Standards.

Testing Objectives, Unit Testing, Integration Testing, Acceptance Testing, Regression

Testing, Top-Down and Bottom-Up Testing Strategies: Test Drivers and Test Stubs,

Structural Testing (White Box Testing), Functional Testing (Black Box Testing), Alpha and

Beta Testing of Products. Need for Maintenance, Categories of Maintenance: Preventive,

Corrective and Perfective Maintenance, Cost of Maintenance, Software Re-Engineering,

Reverse Engineering.

5- Software Measurement & Matrices: Function Point (FP) Based Measures, Cyclomatic

Complexity Measures: Control Flow Graphs. Estimation of Various Parameters such as Cost,

Efforts, Schedule/Duration, Constructive Cost Models (COCOMO), Resource Allocation

Models, Software Risk Analysis and Management. , Quality Assurance, Quality Control,

Software Quality Attributes, Software Quality Assurance (SQA): Verification and Validation

TEXT BOOK:

Pressman Roger S., “Software Engineering – A Practitioner‟s Approach”, 6th Edition, McGraw Hill,

2004.

REFERENCE BOOKS

1. Aggarwal KK, Singh, Yogesh, “Software Engineering”, New Age International, 2000.

2. Jalote Pankaj,”An Integrated Approach to Software Engineering”, 3rd

edition, Narosa, 2005.

3. Sommerville Ian, Pearson Education, “Software Engineering”, 5th edition, Addison Wesley, 1999.

47

CA-1303 A PROGRAMMING USING C# L-T-P Cr

4-0--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; I/O in C#; exception and error handling in C#.

5. ADO .NET AND 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.

TEXT BOOK: Balaguruswammy, E, “Programming in C#”, Tata McGraw Hill REFERENCE BOOKS

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

48

CA-1304 A ARTIFICIAL INTELLIGENCE L T P Cr

4 0 0 4

OBJECTIVE To introduce about artificial intelligence approaches to problem solving, various issues involved and application areas PRE-REQUISITES Knowledge of neural networks, data structures

1. Introduction: Definition of Artificial Intelligence (AI), Evolution of Computing History of AI,

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

problem space representation with examples, Applications of Artificial Intelligence.

2. Search strategies Game Playing: Breadth first search; Depth first search; heuristic search

techniques: Hill climbing: Best first search; A* algorithm; AO* algorithm; Minimax search

procedure.

3. Production System & knowledge base representation: Production rules, the working memory,

Recognize-act cycle, conflict resolution by Meta rules, Architecture of production system. Semantic

net, Frames.

4. Propositional Logic and Predicate Logic: Proposition, tautologies, Theorem proving, forward

chaining, backward chaining, method of substitution, Alphabet of first order logic(FOL), predicate,

well formed formula, clause form, algorithm for writing sentence into clause form, Unification of

predicates, unification algorithm, resolution Robinson‟s interface rule.

5. Reasoning Under Uncertainty: reasoning under uncertainty; non monotonic reasoning; review

of probability; Baye‟s probabilistic interferences and Dempster Shafer theory; Heuristic methods;

Fuzzy reasoning.

TEXT BOOK

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

REFERENCE BOOKS

1. Nils J Nilson, “Artificial Intelligence”, Harcourt Asia Pvt. Ltd.

2. Stuart Russell and Peter Norvig, “Artificial Intelligence: A Modern Approach”, Prentice Hall of

India, 1998

3. O. W. Patterson, “Introduction to Artificial Intelligence & Expert Systems”, Prentice Hall of India

4. Patrick Henry Winston, “Artificial Intelligence”, 3rd Edition, Addition Wesley, 1992

5. Programming PROLOG, Clockson & Mellish, Narosa Publications

49

CA-1305 A INTRODUCTION TO E-COMMERCE L T P Cr

3 0 0 3

Pre-Requisites:

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

1. Kalakota, Ravi, Whinston Andrew B . , “E-Commerce-A Manager‟s guide”, Addison

Wesley.

2. David Whetley; E-commerce concepts.

50

CA-1353A Programming Using C# Lab

L-T-P Cr

0-1-2 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.

51

CA-1354 A ARTIFICIAL INTELLIGENCE LAB L T P Cr

0-0-2 1

LIST OF EXPERIMENTS

1. Study of Prolog programming language

2. Write programs to use iterative structures using Prolog (at least 3 programs)

3. Write programs to demonstrate inferencing/ deductive logic using Prolog (at least 3 programs)

4. Write a program to solve 8 queens problem using Prolog.

5. Solve any problem using depth first search using Prolog.

6. Solve any problem using best first search using Prolog.

7. Solve 8-puzzle problem using best first search using Prolog

8. Solve Robot (traversal) problem using means End Analysis using Prolog.

9. Solve traveling salesman problem using Prolog.

10. Write program to exhibit the ability of building an Expert System using Prolog

11. Study the properties and issues of Natural Language Processing

12. Study the grammar mapping issues in language translation from English to Hindi and vice versa

REFERENCE BOOKS

1. Clockson & Mellish, “Programming PROLOG”, Narosa Publications, 3rd Edition, 2002. 2. Winston Patrick Henry, “Artificial Intelligence”, 3rd Edition, Addition Wesley, 1992

52

CA-1306A

SOFTWARE PROJECT MANAGEMENT

L T P Cr

4 0 0 3

OBJECTIVE To provide the foundation required for becoming a good software project manager by

means of planning, evaluation and estimation, risk management, allocation and monitoring of

resources, controlling software quality PRE-REQUISITES Knowledge of software engineering and

the basic principles of management.

1. INTRODUCTION: Definition of a Software Project (SP), SP vs. other types of projects activities

covered by SPM; categorizing SPs; project as a system; management control, requirement

specification; information and control in organization

STEPWISE PROJECT PLANNING: Introduction, selecting a project; identifying project scope and

objectives; identifying project infrastructure, analyzing project characteristics; identifying project

products and activities; estimate efforts each activity; identifying activity risk; allocate resources;

review/ publicize plan

2. PROJECT EVALUATION AND ESTIMATION: Cost benefit analysis; cash flow forecasting;

cost benefit evaluation techniques; risk evaluation; Selection of an appropriate project report;

Choosing technologies, choice of process model, structured methods: rapid application development,

water fall, V-process-, spiral- models; Prototyping;

ACTIVITY PLANNING : Objectives of activity planning; project schedule; projects and activities;

sequencing and scheduling activities, network planning model; representation of lagged activities;

adding the time dimension, backward and forward pass; identifying critical path; activity throat,

shortening project; precedence networks;

3. RESOURCE ALLOCATION AND MONITORING THE CONTROL: Introduction, the nature

of resources, identifying resource requirements; scheduling resources creating critical paths; counting

the cost; being specific; publishing the resource schedule; cost schedules, the scheduling sequence;

Monitoring the control: Introduction, creating the frame work, collecting the data, visualizing

progress, cost monitoring, earned value, prioritizing monitoring, getting the project back to target,

change control

4. MANAGING CONTRACTS AND PEOPLE:, Introduction, types of contract, stages in contract,

placement, typical terms of a contract, contract management, acceptance, Managing people and

organizing terms: Introduction, understanding behavior, organizational behavior: a back ground,

selecting the right person for the job, instruction in the best methods, motivation, working in groups,

becoming a team, decision making, leadership, organizational structures, conclusion, further exercises

5. SOFTWARE QUALITY: Introduction; the place of software quality in project planning; the

importance of software quality; defining software quality, ISO 9126; Practical software quality

measures; product versus process quality management; 46 external standards; techniques to help

enhance software quality; Study of any software project management software: viz Project 2005 or

equivalent.

53

TEXT BOOKS:

1. Bob Hughes and Mike Cotterell, ―Software Project Manag em ent‖, 2nd Edition, Tata McGraw

Hill, 1999

REFERENCE BOOKS

1. Futrell, ―Software Quality & Project Manag em ent‖, Pearson Education, 2002.

2. Jalote Pankaj, Software Project Management, Pearson Education, 2002.

3. Gopalaswam y Ramesh, ―Managing Global Software Projects‖, Tata McGraw Hill, 2001

4. Pressman Roger S., ―Software Engineering – A Practitioner„s Approach‖, 5th Edition, McGraw

Hill, 2001

5. Walker Royce, ―Software Project Manag em ent‖, Addison Wesley, 1998

6. Maylor, ―Project Manag em ent‖, Third Edition, 2003.

7. Demarco Tom, ―Controlling Software Project Management and Measurem ent‖, Prentice Hall,

1982 8. Glib Tom and Susannah Finzi, ―Principles of Software Engineering Management‖, Addison

Wesley, 1998.

54

CA-1307 A

Neural Networks

L T P Cr

4 0 0 3

Objective:

To study various algorithms and their implementation in real life and in different domains.

Pre-Requisites:

Knowledge of Applied Mathematics and basic calculation techniques of matrices.

Unit-1: Overview of biological neurons: Structure of biological neurons relevant to ANNs.

Unit-2: Fundamental concepts of Artificial Neural Networks: Models of ANNs; Feed

forward & feedback networks; learning rules; Hebbian learning rule, perception learning rule,

delta learning rule, Widrow-Hoff learning rule, correction learning rule, Winner lake all

learning rule, etc.

Unit-3: Single layer Perception Classifier: Classification model, Features & Decision

regions; training & classification using discrete perception, algorithm, single layer continuous

perception networks for linearly separable classifications.

Unit-4: Multi-layer Feed forward Networks: linearly non-separable pattern classification,

Delta learning rule for multi-perceptron layer, generalized delta learning rule, Error back

propagation training, learning factors, Examples.

Unit-5: Single layer feed back Networks: Basic Concepts, Hopfield networks, Training &

Examples, associative memories

Text Books:

Introduction to artificial neural systems by Jacek M. Zurada, 1994, Jaico Publ.House.

Reference Books:

1. Neural Networks :A Comprehensive formulation , Simon Haykin, 1998, AW

2. Neural Networks , Kosko, 1992, PHI.

3. Neural Network Fundamentals N.K. Bose , P. Liang, 2002, T.M.H

55

CA-1309 A NETWORK SECURITY & MANAGEMENT L T P Cr

3 1 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

56

CA-1310 A Python Programming L-T-P Cr

4-0-0 4

OBJECTIVE

To build programming logic and thereby developing skills in problem solving using Python

programming language; To be able to do testing and debugging of code written in Python Emphasize

the concepts and constructs rather than on language features.

UNIT 1: Planning the Computer Program and Problem solving techniques: Concept of problem

solving, Problem definition, Program design, Debugging, Types of errors in programming,

Documentation. Flow charting, decision table, algorithms, structured programming concepts,

Programming methodologies viz. Top-down and bottom-up programming.

UNIT 2: Overview of Programming & Introduction to Python: Structure of a Python

Program, Elements of Python. Python Interpreter, Using Python as calculator, Python shell,

Indentation. Atoms, Identifiers and keywords, Literals, Strings, Operators (Arithmetic Operator,

Relation a l operator, Logical or Boolean operator, Assignment, Operator, Ternary operator ,Bit

wise operator, Increment or Decrement operator).

UNIT 3: Creating Python Programs: Input and Output Statements, Control Statements(Looping-

while Loop, for Loop ,Loop Control ,Conditional Statement-if...else, Difference between break

,continue and pass).

UNIT4: Structures& Functions: Numbers, Strings, Lists, Tuples, Dictionary, Date & Time,

Modules, Defining Functions, Exit function, default arguments.

UNIT 5: Classes, Object-oriented Programming and Exception: Abstract Data Types and

Classes, Inheritance, Encapsulation and information hiding, Handling exceptions

Text Books:

1. John V Guttag. “Introduction to Computation and Programming Using Python”, Prentice Hall

of India

Refernce Books:

1. T. Budd, Exploring Python, TMH, 1st Ed, 2011

2. Python Tutorial/Documentation www.python.or2010

3. Allen Downey, Jeffrey Elkner, Chris Meyers ,How to think like a computer scientist :Learning

with Python,Freelyavailableonline.2012

4. http://docs.python.org/3/tutorial/index.html

5. http://interactivepython.org/courselib/static/pythonds

6. http://www.ibiblio.org/g2swap/byteofpython/read/

http://www.python.or/

http://docs.python.org/3/tutorial/index.html

http://interactivepython.org/courselib/static/pythonds

http://www.ibiblio.org/g2swap/byteofpython/read/

57

CA-1357 A NEURAL NETWORK LAB L T P Cr

0 0 2 1

LIST OF EXPERIMENTS

1. Study of NN toolbox

2. Study of Matlab functions

3. To perform basic matrix operations.

4. To plot the following

(a) A straight line

(b) A sine curve.

5. To generate a few activation functions that is used in neural networks in MatLab.

6. To plot hard limit transfer function.

7. To generate XOR function using McCullock Pitts Neural Network in MatLab.

8. To generate AND-NOT function using McCullock Pitts Neural Network in MatLab.

9. To use Hebbian Network to classify 2-Dimentional input pattern.

10. Write a MATLAB program for perceptron net for an and function with bipolar input and targets.

REFERENCE BOOKS

1. Haykin Simon, ―Neural Networks: A Comprehensive Formulation‖, Addison Wesley

59

4th

Year

School Of Computer Science

60

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.

1. 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

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


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

Edition, Tata McGraw Hill, 2004

61

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

62

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.


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.

63

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

3-1-0 4

OBJECTIVE To equip students with C# programming Concepts

6. 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

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

8. 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.

9. 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.

10. 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

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

64

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

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.

65

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:

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

66

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.

67

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

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.

68

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.

69

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

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.

70

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.

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.

71

MCA-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.

72

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

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

73

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

74

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

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 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

MCA-216A Cloud Computing L T P Cr

75

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.

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

76

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.

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

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

77

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

78

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/

79

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

80

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.

81

5th

Year


82

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

83

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.

84

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

85

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

86

CS-351 A ARTIFICIAL INTELLIGENCE LAB L T P Cr

0-0-2 1

LIST OF EXPERIMENTS

13. Study of Prolog programming language.

14. Write a program to find out route distance between two cities using Prolog.

15. Write a program to implement Tower of Hanoi using Prolog.

16. Write a program to calculate factorial of a number using Prolog.

17. Write a program to implement Hardware simulation using Gates using Prolog.

18. Write a program to implement family relationship using Prolog.

19. Write a program to implement logon with recursion using Prolog.

20. Write a program to print the list of customer having different colored cars with price and

model available using Prolog.

21. Write a program to implement water jug problem using Prolog.

22. Write a program to implement Breadth First Search using Prolog.

23. Write a program to implement Depth First Search using Prolog.

24. Write a program to implement five House logic puzzle problem using Prolog.

25. Write a program to analyze Grammar of sentences using Prolog.

26. Write a program to solve 8-Queens problem using Prolog.

27. Write a program to solve Monkey Banana problem using Prolog.

87

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

88

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 .

89

Text Book:

3. Phalguni Gupta, Surya Prakash, Umarani Jayaraman, IT Infrastructure and its Management, Tata McGraw Hill Education Private Limited, ISBN-13: 978-0070699793, 2009.

4. Simon Adams, ITIL V3 Foundation Handbook Updated Edition, Stationery Office Books (TSO) Publisher, 2009.

References:

3. 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.

4. Van Haren, Passing the ITIL Foundation, Van Haren Publishing, 2011.

90

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

91

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 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

92

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

93

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

94

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.

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

95

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.

96

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

97

REFERENCE BOOKS

2. Lozano, “Multimedia: Sound & Video”, Prentice Hall of India (Que), 1997

10. Ranjan Parekh, “Principle of Multimedia”, Tata McGraw Hill

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


13. Tay Vaughan, “Multimedia: Making It Work”, Fifth edition, Tata McGraw Hill, 1994

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

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

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

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

CA-1324 A 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

98

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.

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

99

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, 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.

100

CA-1309 A NETWORK SECURITY & MANAGEMENT L T P Cr

3 0 0 3

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

6. Attacks on Computers & Computer Security: Introduction; The need of Security ; Security Approaches; Principal of Security; Types of Attacks

7. 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

8. Digital Certificates and Public Key Infrastructure: Digital Certificates ; Private Key Management; The PKIX Model ; Public Key Cryptography Standards; Creating Digital certificates using Java

9. 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

10. User Authentication and Kerberos: Introduction ; Authentication Basics; Passwords; Authentication Tokens; Certificate Based Authentication; Biometric Authentication; Kerberos

REFERENCE BOOKS

7. Atuk Kahate , “Cryptography and Network Security”, 3rd

Edition, Tata Mcgraw Hill

REFERENCE BOOKS

8. Stallings William, “Cryptography and Network Security”, 4th Edition, Prentice-Hall, Englewood Cliffs, 2006

9. Mani Subramanian, “Network Management Principles & Practices”, Addison Wesley, 1999

10. Kauffman C., Perlman R. and Spenser M., “Network Security”, 2nd Edition, Prentice Hall, 2002.

11. Menezes Alfred, van Oorschot Paul, and Vanstone Scott, “Handbook of Applied Cryptography”, CRC Press, NY, 2004.

101

12. Bellovin S. and Chesvick W., “Internet Security and Firewalls”, 2nd Edition, Addison Wesley, 1998.

Schneier Bruce, “Applied Cryptography”, Wiley Student Edition, 2nd Edition

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.

103

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

2- Chaffey, Dave, “E-business and E-commerce Management”, Pearson Education

REFERENCE BOOKS

104

3. Kalakota, Ravi, Whinston Andrew B . , “E-Commerce-A Manager‟s guide”, Addison

Wesley.

4. David Whetley; E-commerce concepts.

5. M- commerce; Norman Sadeh; Wiley.

105

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

106

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.

SCHOOL OF COMPUTER SCIENCE Scheme of Studies and Syllabus BCA -MCA · PDF file ·...

Documents

Transcript of SCHOOL OF COMPUTER SCIENCE Scheme of Studies and Syllabus BCA -MCA · PDF file ·...