Scheme of Examination and Syllabus for Master of Computer ...

Scheme of Examination

and Syllabus

for

Master of Computer Applications

Batch 2019 Onwards

SGT University,

Gurgaon, Haryana

MCA (2019-2020)

Sem

L

T

P

hr/

week

Credits

I

Computer

Organization and

Architecture

3-1-0(4)

Problem Solving

and Programming

with C

3-0-0(3)

Computer and

Internet

Fundamentals

3-0-0(3)

Discrete Structure

3-1-0(4)

Human Values & Ethics

3-0-0(3)

Problem

Solving and Programming

with C Lab

0-0-4(2)

Web

Development Lab using

PHP

0-0-4(2)

Personality Development

and

Communication

Skills – I

0-0-2(1)

15 2 10 27 22

II

Operating

System

3-0-0(3)

Relational Data Base Management

Systems

3-0-0(3)

Object

Oriented

Programming

with C++

3-0-0(3)

Data and File

Structures 3-0-0(3)

PE-I 3-0-0(3)

Relational

Data Base

Management Systems Lab

0-0-2(1)

Object

Oriented Programming

with C++

Lab 0-0-4(2)

Data and File Structures Lab

0-0-4(2)

Operating

System Lab 0-0-2(1)

15 0 12 27 21

III

Software

Engineering

3-1-0(4)

Theory of Computation

3-1-0(4)

Data

Communication

and Networks 3-0-0(3)

Java Programming

3-1-0(4)

PE-II

3-0-0(3)

Data

Communicati

on and

Networks Lab

0-0-4(2)

Java

Programming

Lab 0-0-4(2)

Colloquium I

0-0-2(1)

15 3 10 28 23

IV Cloud

Computing

3-0-0(3)

Computer

Graphics and

Multimedia 3-1-0(4)

Analysis &

Design of

Algorithms 3-1-0(4)

PE-III

3-0-0(3)

Artificial Intelligence

3-0-0(3)

Computer

Graphics and Multimedia

Lab 0-0-4(2)

Artificial

Intelligence

Lab 0-0-4(2)

Cloud Computing

0-0-2(1)

ColloquiumII

0-0-2(1)

15 2 12 29 23

V

Advanced

Web

Technologies

3-0-0(3)

Software Project

Management 3-0-0(3)

PE-IV

3-0-0(3)

PE-V

3-0-0(3)

PE-VI

3-0-0(3)

Software Testing

2-0-0(2)

Software

Testing Lab 0-0-2(1)

Advanced

Web

Technologies

Lab

0-0-2(1)

Minor

Project 0-0-6(3)

17 0 10 27 22

VI Dissertation

0-0-0(10)

Dissertation

Seminar

0-0-0(5)

0 0 0 0 15

Total 77 7 54 138 126

Program Electives

Information Retrieval System

Enterprise Resource Planning

System Networking & Administration

Organizational Behaviour

Management Information System

Enterprise Computing in Java

Digital Signal Processing

Advanced Database Management

Systems

Mobile Computing

Advanced Computer Networks

Distributed DBMS and Object

Oriented Databases

Microprocessor and Interfacing

Operation Research

Object Oriented Analysis and Design

Software Quality Assurance

Programming in Python

Distributed Operating Systems

Advanced Computer Architecture and Parallel Processing

Compiler Design

Embedded System

Computer Oriented Statistical Numerical Methods

Business Process Management and

Intelligence

Data Warehousing and Data Mining

IT Network Security

IT System Security

Information Security Fundamentals

Ethical Hacking

Cyber Security

SGT University, Gurgaon, Haryana

Scheme of Master of Computer Applications for Batch 2019 onwards

Master of Computer Applications Semester – I

Paper Title

L T P Total

Int. Ext. Total Credits

Code

Computer Organization and Architecture 3 1 - 4 40 60 100 4

Problem Solving and Programming with C 3 - - 3 40 60 100 3

Computer and Internet Fundamentals 3 - - 3 40 60 100 3

Discrete Structure 3 1 - 4 40 60 100 4

Human Values & Ethics 3 - - 3 40 60 100 3

PRACTICAL

Problem Solving and Programming with C Lab - - 4 4 20 30 50 2

Web Development Lab using PHP - - 4 4 20 30 50 2

Personality Development and - - 2 2

20 30 50 1

Communication Skills - I

Total 15 2 10 27 260 390 650 22

Master of Computer Applications Semester – II

Paper Title

L T P Total

Int. Ext. Total Credits

Code

Operating System 3 - - 3 40 60 100 3

Relational Data Base Management 3 - - 3

40 60 100 3

Systems

Object Oriented Programming with C++ 3 - - 3 40 60 100 3

Data and File Structures 3 - - 3 40 60 100 3

Program Electives I 3 - - 3

40 60 100 3

PRACTICAL

Relational Data Base Management

Systems Lab - - 2 2 20 30 50 1

Data & File Structure-Lab - - 4 4 20 30 50 2

Object Oriented Programming with C++ Lab - - 4 4 20 30 50 2

Operating System Lab - - 2 2 20 30 50 1

Total 15 - 12 27 280 420 700 21

Int: Internal, Ext: External


Scheme of Master of Computer Applications for Batch 2019 onwards

Master of Computer Applications Semester – III

Paper Title L T P Total Int. Ext. Total Credits

Code

Software Engineering 3 1 - 4 40 60 100 4

Theory of Computation 3 1 - 4 40 60 100 4

Data Communication and Networks 3 - - 3 40 60 100 3

Java Programming 3 1 - 4 40 60 100 4

Program Electives II 3 - - 3 40 60 100 3

PRACTICAL

Data Communication & Networks Lab - - 4 4 20 30 50 2

Java Programming Lab - - 4 4 20 30 50 2

Colloquium I - - 2 2 20 30 50 1

Total 15 3 10 28 260 390 650 23

Master of Computer Applications Semester – IV


Code

Cloud Computing 3 - - 3 40 60 100 3

Computer Graphics and Multimedia 3 1 - 4 40 60 100 4

Analysis & Design of Algorithms 3 1 - 4 40 60 100 4

Program Electives III 3 - - 3 40 60 100 3

Artificial Intelligence 3 - - 3 40 60 100 3

PRACTICAL

Computer Graphics & Multimedia Lab - - 4 4 20 30 50 2

Artificial Intelligence Lab - - 4 4 20 30 50 2

Cloud Computing Lab - - 2 2 20 30 50 1

Colloquium II - - 2 2 20 30 50 1

Total 15 2 12 28 280 420 700 23



Scheme of Master of Computer Applications for Batch 2019 onwards Master of Computer Applications Semester – V


Code

Advanced Web Technologies 3 - - 3 40 60 100 3

Software Project Management 3 - - 3 40 60 100 3

Software Testing 2 - - 2 40 60 100 2

Program Electives IV 3 - - 3 40 60 100 3

Program Electives V 3 - - 3 40 60 100 3

Program Electives VI 3 - - 3 40 60 100 3

Software Testing Lab - - 2 2 20 30 50 1

Advanced Web Tech. Lab - - 2 2 20 30 50 1

Minor Project - - 6 6 20 30 50 3

Total 18 - 10 27 300 450 750 22



Scheme of Master of Computer Applications for Batch 2019 onwards Master of Computer Applications Semester – VI


Code

Dissertation - - - - 120 180 300 10

Dissertation Seminar - - - - 40 60 100 5

Total - - - - 160 240 400 15


Note: The student will submit a synopsis for approval from the departmental committee in a

specified format. The student will have to present the progress of the work through seminars

and progress reports.

MCA 1st

Semester

COMPUTER ORGANIZATION AND ARCHITECTURE

L T P Cr External Marks: 60

3 1 - 4 Internal Marks: 40

Time Duration: 3 Hrs. Total Marks: 100

NOTE: Ten questions are to be set in all by the examiners by taking three questions from

each unit and one compulsory question having 05 short answer type questions from all the

units. Students will be required to attempt six questions in all including compulsory Question i.e. question No. 1 and by selecting not more than two questions from each unit.

OBJECTIVES

To have a thorough understanding of the basic structure and operation of a digital computer.

To discuss in detail the operation of the arithmetic unit including the algorithms & implementation of fixed-point and floating-point addition, subtraction, multiplication & division.

To study the hierarchical memory system including cache memories and virtual memory and different ways of communicating with I/O devices and standard I/O interfaces.

Unit I: Basic structure of computers

Functional Modules - Basic operational concepts - Bus structures - Software performance –

Memory locations and addresses – Memory operations – Instruction and instruction sequencing –

Addressing modes – Assembly language – Basic I/O operations– Stacks and queues.

Unit II: Basic processing Module

Fundamental concepts – Execution of a complete instruction – Multiple bus organization –

Hardwired control – Micro programmed control - Pipelining – Basic concepts – Data hazards –

Instruction hazards – Influence on Instruction sets – Data path and control consideration –

Superscalar operation.

Unit III: Memory System

Basic concepts – Semiconductor RAMs - ROMs – Speed - size and cost – Cache memories -

Performance consideration – Virtual memory- Memory Management requirements – Secondary

storage.

TEXT BOOK

Mano, M. Morris Digital Logic and Computer Design, Pearson Education First Edition,

2016.

REFERENCE BOOKS Rajaraman, V., Radhakrishanan,T., An Introduction To Digital Computer

Design,Prentice Hall of India Pvt. Ltd., 4th Ed. Hayes, J.P., Computer Architecture and Organization, McGraw Hill, 2012, Third Ed.

MCA 1st

Semester

PROBLEM SOLVING AND PROGRAMMING WITH C


3 - - 3 Internal Marks: 40





OBJECTIVES:

To facilitate the development and application of problem-solving skills in students. This subject will teach them programming logic, use of programming instructions,

syntax and program structure. This subject will also create foundation for student to learn other complex programming languages like C++, Java etc.

UNIT – I

An introduction to programming languages-their need and evolution, An introduction to various problem solving techniques- algorithms, flowcharts, pseudo code, decision table,

Structured programming concepts, Modular Programming, Programming methodologies: top-down and bottom-up programming, Characteristics of good programming language.

UNIT – II

Elements of C: C character set, identifiers and keywords, Data types: declaration and

definition. Operators: Arithmetic, relational, logical, bitwise, unary, assignment and conditional operators and their hierarchy & associativity, Data input / output. Control statements: Sequencing, Selection: if and switch statement; alternation. Control

Statements: for, while, and do-while loop; break, continue.

Functions : Definition, prototype, passing parameters, recursion.

UNIT – III

Arrays, structures, union, string.

Pointers: Declaration, operations on pointers, array of pointers, pointers to arrays. C Files: Their Importance and Need, File structure, Opening and Closing of Files, File

Opening Modes, Types of Files-Text and Binary Files, Reading and Writing onto File, Random Access.

TEXT BOOK

Let Us C by Yashwant Kanetkar , BPB Publications.16th Edition 2017

REFERENCE BOOKS

The C Programming Language by Dennis M Ritchie, Brian W. Kernigham, 2nd Edition, PHI, 2015.

Computer Fundamentals and Programming in C, Reema Theraja, Oxford 2nd Edition, 2016.

Gottfried, Programming with C, Tata McGraw Hill.

Problem Solving with C, Keith Harrow, J. Jones, Pearson Education.

MCA 1st

Semester

COMPUTER AND INTERNET FUNDAMENTALS







OBJECTIVES: This course is designed to provide you with experience in using modern technologies to create e-Commerce or web-based systems and aware them about hardware, software & Internet

UNIT-I

Computer Fundamentals: Computer components, characteristics & classification of

computers, hardware & software, peripheral devices. Algorithmic Development.

Programming languages: Low level programming languages: Machine and Assembly

languages. High level languages. Translation process- Assembler, Complier, Interpreter.

Operating System Principles: Concept of process, multi-programming. Functions of an

operating system, User interface and Windows, working with Windows operating systems.

UNIT-II

Introduction to Networks and its Features, Types of Networks. Internet: working of internet, Diff. b/w internet, Intranet &extranet, Modems: Types of Modems, Modes of connecting to

internet, internet service providers (ISPs), Internet address. (IPV4 &IPV6). DNS: Domain Name System, Types of DNS. World Wide Web: Introduction, miscellaneous Web Browser, searching the WWW: Directories search engines and Meta Search Engines, working of the search engines,

TCP/IP, UDP: formats & difference. Introduction to Browser, Coast-to-Coast Surfing, Web Page Installation, Web Page Setup, Using front page express, plug –ins.

UNIT-III

Internet Tools: Telnet and FTP, HTTP, gopher commands, SMTP, MIME, Newsgroups.

Electronic Mail: introduction, advantages and disadvantages, user Ids, pass words, e-mail address, message components, message composition, E-mail inner workings, mailing lists,

chat rooms and secure mails, PICO, PINE. HTML: Hypertext mark-up language, basics of HTML & formatting and hyperlink

creation, commands of HTML, DHTML, Difference b/w HTML and XML.

TEXT BOOK

1. P.K.Sinha, Priti Sinha, Computer Fundamentals, BPB Publications, sixth Edition

2003.

REFERENCE BOOKS

Fundamentals of the Internet and the Word Wide Web, Raymond Greenlaw and Ellen Hepp, TMH, New Delhi Second Edition

Internet and Word Wide programming, Deitel, Deitel & Nieto, Pearson Education, New Delhi Fourth Edition, 2009.

Mastering HTML, CSS & Javascript Web Publishing, Lemay Laura, B P B Publications, 2016. kkMastering HTML, CSS & Javascript Web Publishing

MCA 1st Semester

DISCRETE STRUCTURES

L

3

T

1

P -

Cr

4

External Marks: 60

Internal Marks: 40

Time Duration: 3 Hrs.

Total Marks: 100


each unit and one compulsory question having 05 short answer type questions from all the units. Students will be required to attempt six questions in all including compulsory

Question i.e. question No. 1 and by selecting not more than two questions from each unit.

OBJECTIVES: To extend student‟s mathematical maturity and ability to deal with abstraction and to introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems.

UNIT-I

Set Theory: Introduction to set theory, Set operations, Algebra of sets, combination of sets,

Duality, Finite and Infinite sets, Classes of sets, Power Sets, Multi sets, Cartesian Product,

Representation of relations, Types of relation, Binary relations, Equivalence relations and

partitions , Partial ordering relations and lattices. Mathematics Induction, Principle of

Inclusion &Exclusion, Propositions .Function and its types, Composition of function and

relations, Cardinality and inverse relations, Functions & Pigeon hole principles. Propositional Calculus: Basic operations: AND (^), OR (v), NOT (~), Truth value of a

compound statement, propositions, tautologies, contradictions. Techniques of Counting: Rules of sum and product, Permutations with and without repetition, Combination. Modular Arithmetic, Grammars, Language, Regular Expressions, Finite State Machine.

UNIT-II

Sequence, Series And Recurrence Relation :Polynomials and their evaluation,

Sequences, Introduction to AP, GP and AG series, partial fractions, linear recurrence relation with constant coefficients, Homogeneous solutions, Particular solutions, Total

solution of a recurrence relation using generating functions. Latices and boolean algebra: Relations to partial ordering, Lattices, Hasse Diagram, Axiomatic definition of Boolean Algebra as algebraic structures with two operations,

Boolean Functions, Representing Boolean Functions, Switching Circuits, Gate Circuits. Algebric Structures Definition, elementary properties of algebraic structure, examples of a

monoid, Semigroup, permutation groups, Groups and rings, Homomorphism, Isomorphism

and Automorphism, Subgroups and Normal subgroups, Cyclic groups, Integral domain and fields, Cosets, Lagrange‟s theorem, Rings, Division.

UNIT-III

Graphs And Trees: Introduction to graphs, Directed and Undirected graphs, Homomorphic

and Isomorphic graphs, Subgraphs, Cut points and Bridges, Multigraph and Weighted

graph, Paths and circuits, Shortest path in weighted graphs, Eurelian path and circuits, Hamilton paths and circuits, Planar graphs, Euler‟s formula, Trees, polish notation, Rooted

trees, Spanning trees & cut trees, Binary trees and its traversals.

TEXT BOOK

A Text Book of Discrete Mathematics, DR. Swapan Kumar Sarkar, S.Chand

Publication, 2015.

REFERENCE BOOKS Discrete Mathematics (Oxford Higher Education), by S.K. Chakraborty, Oxford

University Press, 2010. Discrete Mathematics, Schaum‟s Outline series: McGraw-Hills Singapore, Revised

Third edition 2017.

Discrete Mathematical Structures with Applications to Computers by Trembley &

Manohar, MGH, 1st Edition 201,7 New Delhi.

MCA 1st

Semester

HUMAN VALUES AND ETHICS







OBJECTIVE: This paper intends to acquaint the student with basic human values i.e.

ethical, spiritual, social, civic and national to develop group and social attitudes, team work,

group work and place the student on the path of self confidence and self-sacrifice.

UNIT -I

Group and Social Values: Patriotism, respect to law, patience belongingness to a group, co-operation, sharing, hospitality, leadership, respect for parents, teachers and elders,

dignity for labour, good manners and etiquette, diligence, self exploration, punctuality and regularity

UNIT-II

Ethical Values: Courage to stand for truth, forgiveness, friendliness, honesty, respect for all religions, service and helpfulness, sympathy.

UNIT-III

Ethics and Business: Why be ethical in business, How might ethical decision-making work,

corporate culture and ethical leadership, corporate social responsibility, the role of business

in society, employer/employee rights and duties (internal issues), sexual harassment, technology and privacy, ethical issues with consumers (external issues) marketing and sales,

advertising

TEXT BOOK

1. Tripathi, A.N., Human Values, New Age International Publishers.

REFERENCE BOOKS

1. Gupta, Ananda Das, Human Values in Management, Ashgate Publishing Limited. 2. Hartman, Laura P. and Joe DesJardins, Business Ethics: Decision-Making for

Personal Integrity & Social Responsibility. McGraw-Hill/Irwin. 3. Arthur, John. Studying Philosophy: A Guide for the Perplexed. Pearson/Prentice

Hall.

MCA 1st

Semester

PROBLEM SOLVING AND PROGRAMMING WITH C LAB


- - 4 2 Internal Marks: 20


NOTE: Five questions are to be set in all by the examiners. Students will be required to

execute and attempt three questions in all including.

List of Programs for C Language not limiting to:

[1] WAP to read one integer and one float type variable, calculate sum, difference, product and division of them and display the results in formatted manner.

[2] WAP to find volume of a cylinder using formula:

[3] WAP to divide a number with 2 using bitwise operator [4] WAP to read a number between 1 to 7 and print day of the week using switch

statement. [5] WAP to find the commission on a salesman's total sales

a) If sales <100, then there is no commission.

b) If 100>= sales <=500, then commission = 10% of sales.

c) If sales > 500, then commission = 100+8% of sales above 500

[6] WAP to generate a series of prime numbers between 2 to n.

[7] WAP to print

1

12

123

1234

12345

1234

123

12

1

[8] WAP that prints a given positive integer in reverse order and also sum of the individual digits involved in the given integer.

[9] Write a C program to find the exponential series of 1+x+x2/2!+x

3/3!+.......+x

n/n!

[10] WAP to read and display all the elements of 1-d array. [11] WAP to sort a list of numbers using following method:

Selection sort

Bubble sort

[12] WAP to search for a particular number using method: Linear search Binary search

[13] WAP to enter a string and check if it is palindrome or not. [14] WAP to find a substring in a given string S.

http://cprogramskills.blogspot.com/2010/03/write-c-program-to-find-commission-on.html

[15] WAP to create a function to calculate factorial of a number and calculate sum of series

S=1/!1+2/!2+3/!3-------n terms. [16] WAP to declare the two matrices using pointers read them and calculate

their product using functions. [17] Write a program to find largest among 3 numbers using macros. [18] Write a program to create structure student having members name, roll no, marks

obtained and percentage. Enter the data of 10 students and display their result.

[19] WAP to create a data file and display its contents on the screen.

[20] WAP to search a particular record in data file.

MCA 1st

Semester

WEB DEVELOPMENT LAB USING PHP






List of Programs not limiting to:

[1] Create a Web page depicting yours personal and academic details.

[2] Create a Web page to list students with 1st

, 2nd

and 3rd

division. [3] Create a Web page applying anchor tag with various properties on it. [4] Create a home page of your own Institute. [5] Create a web page for student‟s information. Show links on your page for every

detail. For e.g., Complete Resume, Address, contact address, qualification etc. [6] Create a Web Page using tables. Use Images as buttons normal text and text as link

in table. [7] Create a following table using HTML Tags:

Weather

Maximum Minimum

Summer 32-40° C 25-30° C

Winter 18-25° C 08-12° C

[8] Create a Web Page for your Time Table in table format.

[9] Create a T.V Schedule on a Web Page in tabular form.

[10] Create a Web Page and apply Meta tag with properties on it. [11] Create a Web page which displays the map of Punjab and provides information

about Mohali, Jalandhar, Ludhiana, and Patiala cities when a user clicks on a particular city.

[12] Create a Web Page for an “English Dictionary” using Frames (only for vowels). [13] Create a Web Page using frames and divide it in four parts. And display your

university site, your resume, Time Table and home of your institute in each portion. [14] Create a Web Page for admission form. [15] Create a Web page of your own details using tables embedding form tags in table

cells. [16] Create a web page using Cascading Style Sheet having following characteristics:-

Create right and left spaces of the text using id and class.

Sets background color of Important Paragraph.

[17] Create a web page using Cascading Style Sheet having following characteristics:- Underline unselected links, turns off underlying during the click and puts a line

through already visited links.

Sets background color “Cyan” of every paragraph and blue to every division.

[18] Create and fill an examination form using form and validate them. [19] Create a T.V. Schedule using XML and embed it in HTML.

MCA 1st

Semester

PERSONALITY DEVELOPMENT AND COMMUNICATION SKILLS

L

-

T

-

P 2

Cr

1

Internal Marks: 20

External Marks: 30

Total Marks: 50


Objectives:

To encourage the all round development of students by focusing on English Communication.

To make student aware about the importance, the role and the content of communication through instruction, knowledge acquisition, and practice

To develop and nurture the soft skills that help develop student as a team member, leader, and all round professional in long run have been identified and listed here for references.

UNIT-I Business Communication: Meaning and Definition, its importance, process, classification, channels, Principles of effective communication; Barriers to effective communication. Oral Communication: Developing Listening and Speaking skills through various activities

such as Group Discussion, Presentation Skills, Role Play, Speech, Extempore Speaking, Interpretation and Description

UNIT-II Written Communication: Developing writing skills through business letters, Notice, Memorandums, E-mail, Essay writing, Précis writing, Comprehension writing. Curriculum

Vitae: Drafting curriculum vitae; writing job application letters.

UNIT-III

Interview Skills: Meaning, types, process and preparation for interview; Holding mock

interviews. Meeting Skills: Meaning, types, purpose, Agenda of meeting, Minutes of meeting; Holding

mock meetings. Vocabulary Building and Grammar: One word substitution, Antonyms, Synonyms, Homonyms; Sentence formation.

TEXT BOOKS

1. Communication Skill for Effective Mgmt., Ghanekar,EP

REFERENCE BOOK:

1. English for Technical communication,Laxminarayanan,Scitech

2. Simon Sweeney, “English for Communication”, CUP

3. Leo Jones and Richard Alexander, “New International Business English”, CUP

MCA 2nd Semester

OPERATING SYSTEM

L

3

T

-

P -

Cr

3

External Marks: 60

Internal Marks: 40


Total Marks: 100




OBJECTIVES: The basic concepts and use of Operating system and its working with architecture.

UNIT-I Introductory Concepts: Operating system functions and characteristics, historical evolution of operating system, Real time system, Distributed system, Methodologies for implementation of O/S service, system calls, system programs, Interrupt mechanisms. Processes: Process model, Process states, process hierarchies, implementation of Processes, data structures used such as Process table, PCB creation of processes, context switching, exit of Processes. Inter-process communication: Race conditions, critical sections, problems of mutual exclusion, Peterson’s solution, producer-customer problem, Reader Writer‟s Problem, Dining Philosophers Problem, semaphores, monitors, message passing.

UNIT-II Process scheduling: objective, preemptive vs. non-preemptive scheduling, comparative

assessment of different algorithms such as round robin, priority bases scheduling. FCFS.

SJF, multiple queues with feedback Deadlocks: Conditions, modeling, detection and recovery, deadlock avoidance, deadlock

prevention. Memory Management: Multiprogramming with fixed partition, variable partitions, virtual

memory, paging, demand paging, design and implementation issues in paging such as page

tables, inverted page tables, page replacement algorithms, page fault handling, working set model, local vs. global allocation, page size, segmentation with paging.

UNIT-III File systems: File type, attributes, access and security, file operations, directory structures, path names, directory operations, implementation of file systems, implementation of file and

file operation calls, implementation of directories, sharing of files, disk space management, block allocation, free space management, logical file system, physical file system. Device management: Techniques for device management, dedicated devices, shared devices, virtual devices; device characteristics, hardware considerations: input & output devices, storage devices: independent device operation, buffering, multiple paths, device allocation considerations.

TEXT BOOK

Operating System Concepts, Abraham Silberschatz, Gelvin, Wiley; Eighth & Wiley Student edition, 2009.

REFERENCE BOOKS

2. Operating System Concepts by Peterson, J.L. & Silberschatz, A. Addison Wesley, New

Delhi, 3rd

Revised Edition. 3. Operating System by Stalling Willam Stallings, Pearson Education; 2019 edition. 4. OPERATING SYSTEMS: Design and implementation, TANENBAUM & WOODHULL,

3rd

Edition, 2011.

MCA 2nd

Semester

RELATIONAL DATABASE MANAGEMENT SYSTEMS







OBJECTIVES:

To understand the internal storage structures using file/ indexing techniques which will help in physical databases.

To learn the fundamentals of data models and to conceptualize and depict a database system using ER diagrams.

To study SQL and relational database design. To know the fundamental concepts of transaction processing- concurrency control

techniques and recovery procedure.

UNIT-I Introduction: Overview of Database Management System: Various views of data Models,

Schemes and Introduction to database Languages & Environments, Advantages of DBMS

over file processing systems, Responsibility of Database Administrator. Three level

architecture of Database Systems: Introduction to client/Server architecture. Data Models:

E-R Diagram (Entity Relationship), mapping Constraints, keys, Reduction of E-R diagram

into tables.

UNIT-II Network & Hierarchical Models, File Organization: Sequential File, index sequential files, direct files, Hashing, B-trees Index files, Inverted Lists., Relational Models, Relational

Algebra & various operations (set operations, select, project, join, division), Order, Relational calculus: Domain, Tuple, Well Formed Formula, specification, quantifiers,

Introduction to Query Language, QBE.

UNIT-III

Integrity constrains, functional dependencies & Normalization, 1st

, 2nd

, 3rd

and BCNF. Introduction to Distributed Data processing, Concurrency control: Transactions, Time stamping, Lock-based Protocols, Serializability and Recovery Techniques.

TEXT BOOK

Fundamentals of Database Systems by R. Elmasri and S.B. Navathe, 6th

Edition, Pearson Education, New Delhi.

REFERENCE BOOKS

An Introduction to Database Systems by C.J. Date, 8th

Edition, Pearson Education, 2006.

Database System Concepts by A. Silberschatz, H.F.Korth and S.Sudarshan, 6th

Edition, McGraw-Hill, Indian Edition, 2013.

A Guide to the SQL Standard, Data,C. and Darwen, H.4th Edition, Reading, Addison-Wesley Publications, New Delhi.

Database Management Systems, Raghu Ramakrishnan, McGraw Hill Education; Third edition, 2014.

MCA 2nd

Semester

OBJECT ORIENTED PROGRAMMING WITH C++







OBJECTIVES:

To understand the object oriented life cycle.

To understand relationships, identify objects, services and attributes.

To understand the Object Oriented Design process.

To understand about software quality and usability.

UNIT-I

Introduction to C++, C++ standard library, Basics of a typical C++ Environment, Object Oriented Concepts, Introduction to objects and object oriented programming, Abstraction,

Encapsulation, Access Modifiers: controlling access to a class, method or variable (public,

protected, private). Classes and Data Abstraction: Introduction, structure definition, accessing members of a

structure, class scope and accessing class members, separating interface from

implementation, controlling access function and utility functions, Constructors, Dynamic

memory allocation with new and delete, destructors (Examples form C++), constant object

and const member function (use of const in C++), object as member of classes, friend

function and friend classes, using “this” pointer, static class member, function overloading

(Implementation in C++). UNIT-II

Operator Overloading : Introduction, fundamentals of operator overloading, restriction on

operators overloading , operator function as class members vs. as friend functions, overloading unary operator , overloading binary operators. Inheritance :Introduction , inheritance: base class, protected members, casting base class

pointer to derived- class pointers, using member functions, Types of Inheritance, public,

protected and private inheritance, using constructors and destructors in derived classes,

implicit derived class object to base class object conversion , composition Vs. inheritance. Virtual Functions and Polymorphism: Introduction to virtual function, abstract base class

and concrete class, polymorphism, dynamic binding, virtual destructor, Implementation in C++ using virtual function.

UNIT-III

Files and I/O Streams: Files and streams, creating a sequential access file, reading data

from A Sequential access file, updating Sequential Access file, Random Access File ,

Creating A Random Access File, Writing data Randomly To a random Access file, Reading Data Sequentially from A Random Access File. Templates: Function Template, Overloading Template Function, Class Template, Class

Template and Non- Type Parameters, Templates and Inheritance. Exception Handling: Introduction, Basic of C++ Exception Handling: Try, Catch, Throwing, Catching and Re–throwing an Exception, Exception specification, Processing Unexpected Exception.

TEXT BOOK Object Oriented Programming in Turbo C+ + by Robert Lafore, Pearson Education,

New Delhi, 4th

Edition, 2008.

REFERENCE BOOKS Object Oriented Programming Using C++ by Kamthane, Pearson Education, New

Delhi, 1st edition 2006.

Mastering object Oriented Programming with C++, R.S. Salaria, Salaria Publishing House.

The Complete Reference in C++ by Herbert Schildt, TMH, New Delhi, 4th

Edition,

2017. Object Oriented Programming with C++ by E Balagurusamy, Tata McGraw- Hill,

New Delhi, Seventh edition, 2017.

MCA 2nd Semester DATA AND FILE STRUCTURES

L

3

T

-

P -

Cr

3

External Marks: 60

Internal Marks: 40


Total Marks: 100



units. Students will be required to attempt six questions in all including compulsory


OBJECTIVES:

learn new data & file structure concepts and algorithms. learn when and where these concepts would be used in real-word applications and

programming contexts. apply many of these concepts/algorithms by using them in programming projects.

UNIT-I

Introduction to Data Structure: Data types, Abstract Data types, Arrays, Arrays as abstract

data type, Arrays row major and column major, Sequences, Big Oh notations. Stack:

Definition and Example, Representing Stack using static implementation, Applications, Infix, Prefix and postfix, Converting infix to postfix Expression, Evaluation Matching

parentheses, Recursion and Simulating Recursion. Queues: Definition and examples, Representing Queues using static implementation, Circular queues, Priority queues, Double-ended queues.

UNIT-II

Linked Lists: List Types (singly, doubly, singly circular, doubly circular), Operations on all

types of Lists – create, insert, delete Generalized Lists Applications, Dynamic implementation of stack and queues, Polynomial Addition, Dynamic Memory Allocation –

First- Fit, Best – Fit, Worst-fit Trees: Concept Rooted Tree Binary Tree – Linked and static Representation, Tree

Traversals (Pre-order, In-order, Post-order using recursion), Binary Search Tree (create, delete, search, insert, display), AVL Trees.

UNIT-III

Graphs: Representation using C Adjacency matrix and adjacency lists BFS and DFS by

static and dynamic implementation, Finding shortest path (Dijkstra‟s Algorithm)

Searching: Sequential, Binary, Hashing, Hash tables, Hash functions, Overflow handling

techniques. Sorting: Bubble sort, Insertion sort, Quick sort (recursive), Merge sort, Heap sort and

Bucket sort. File structures: Indexing (primary, secondary, clustered, un-clustered, dense, sparse), Hash index, B+ trees and ISAM.

TEXT BOOK 1. Data Structures with C (Schaum's Outline Series), Seymour Lipschutz, McGraw Hill

Education; 1st edition, 2017. 2. Database Management Systems – Ramkrishnan Gehrke (McGraw Hill Third Edition)

REFERENCE BOOKS

1. Data Structures Using C, Balagurusamy, McGraw Hill Education; First edition, 2016

2. Data Structures Using C , Aaron Tenenbaum, Pearson Education India; 2nd

edition,

2015

3. Data Structures Using C, Reema Thareja, Oxford Publisher; 2 edition, 2014.

MCA 2nd

Semester

COMPUTER ORIENTED STATISTICAL AND NUMERICAL METHODS







OBJECTIVES:

To introduce linear programming in technological environments

To introduce the concept of dynamic programming

To solve real life / simulated problems.

UNIT – I

Computer Arithmatic : Floating point representation of numbers, arithmatic operations with normalized floating point numbers and their consequences. Error in number representation - pitfalls in computing. Iterative Methods: Bisection, False position, Newton-Raphson methods, Discussion of convergences, Polynomial evaluation, Solving polynomial equations (Bairstow's Method).

UNIT – II

Solving of Simultaneous Linear Equations and ordinary Differential Equations: Gauss

elimination method, Ill-conditioned equations, Gauss-Seidal iterative method, Taylors series and Euler methods, Runge-kutta methods, Predictor corrector methods. Numerical Differentiation and Integration : Differentiation formulae based on polynomial

fit, Pitfalls in differentiation, Trapezoidal, Simpson's rules and Gaussian Quadrature.

Interpolation and Approximation : Polynomial interpolation, Polynomial fitting and other curve

interpolation, Difference tables, Inverse fitting. Approximation of functions by

Taylor series and Chebyshev polynomials.

UNIT – III

Statistical methods: Sample distributions, Test of Significance, n2, t and F test. Analysis of Variance : Definition, Assumptions, Cochran's Theorem, One-way classification, ANOVA Table, Two-way classification (with one observation per cell). Time Series Analysis : Components and Analysis of Time Series, Measurement of Trend, Seasonal fluctuations and Cyclic movement.

TEXT BOOK

Rajaraman V., Computer Oriented Numerical Methods, Prentice Hall, India.

REFERENCE BOOKS

Anderson, Statistical Modelling, McGraw Publishing House.

Computer Oriented Numerical Methods, R.S. Salaria, Khanna Book Publishing Company, Delhi.

3. Gupta S.P. and Kapoor, V.K., Fundamentals of Mathematical statistics, Sultan Chand and Sons.

Gupta S.P. and Kapoor, V.K., Fundamentals of Applied statistics, Sultan Chand &

Sons.

Graybill, Introduction to Statistics, McGraw Publishing House.

MCA 2nd Semester

RELATIONAL DATA BASE MANAGEMENT SYSTEMS LAB

L

-

T

-

P 2

Cr

1

External Marks: 30

Internal Marks: 20


Total Marks: 50




Creating Database

Creating a Database Creating a Table

Specifying Relational Data Types

Specifying Constraints

Creating Indexes

INSERT statement

Using SELECT and INSERT together DELETE, UPDATE, TRUNCATE statements

DROP, ALTER statements

The SELECT statement

Using the WHERE clause

Using Logical Operators in the WHERE clause

Using IN, BETWEEN, LIKE , ORDER BY, GROUP BY and HAVINGClause

Using Aggregate Functions

Combining Tables Using JOINS

sub- queries

Database Management

Creating Views

Creating Column Aliases Creating Database Users

Using GRANT and REVOKE Cursors in Oracle PL / SQL

Writing Oracle PL / SQL Stored Procedures

MCA 2nd

Semester

OBJECT ORIENTED PROGRAMMING WITH C++ LAB







1. Write a program to generate prime number series between 1-100.

2. Write a program to find the root of quadratic equation(ax^2+bx+c).

3. Write a program to evaluate the salary of person.

4. Write a program to print the format

1 121

12321

1234321

5. Write a program to swap two numbers by call by reference.

6. Write a program to print Armstrong number up to 1000.

7. Write a program to add two matrices using classes and objects..

8. Write a program to multiply two matrices using classes and objects.

9. Write a program to dynamically and allocate and de allocate memory.

10. Write a program to illustrate the concept of friend function.

11. Write a program that illustrates the concept of constructor and destructor.

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

13. Write a program to concatenate two strings by overloading logical And operator.

14. Write a program to overload >=operator to compare two strings.

15. Write a program to illustrate the concept of operator overloading using friend function. 16. Write C++ programs that illustrate how the following forms of inheritance are

supported: a) Single inheritance, b) Multiple inheritance, c) Multilevel inheritance, d) Hierarchical inheritance

17. Write a C++ program that illustrates how run time polymorphism is achieved using virtual functions.

18. Write a C++ program that illustrates the role of abstract class in building class hierarchy.

19. Write a C++ program to display the contents of a text file.

20. Write a C++ program which copies one file to another.

21. Write a C++ program to change a specific character in a file.

22. Write a program to Bubble sort using function template.

23. Write a program to implements class stack for different data types. 24. Write a program to illustrate how exception is handled using Try Catch block and

Throw statements. 25. Write a program to demonstrate exception specification

MCA 2nd

Semester

DATA & FILE STRUCTURE LAB






1. BASIC TECHNIQUES: Swapping of the contents of two variables- Finding the sum of digits of a given number- Reversing a given number.

2. DECISION MAKING: Finding the largest and the smallest of a given array- solving a quadratic equation- selecting an operation based on a menu.

3. LOOPING TECHNIQUES & ARRAYS: Finding the sum to n terms of a sine series-Matrix Multiplication- Transpose-Polynomial addition- Polynomial Multiplication-Sorting algorithmsSearching algorithms.

4. CHARACTERS AND STRING HANDLING: Finding the length of string-reversal of string concatenation of two strings-checking whether it is a palindrome or not- converting upper case alphabets to lowercase and vice versa in a string.

5. POINTERS, STRUCTURES AND UNIONS: Finding the sum of all elements of an array using pointers- Swapping the contents of two variables using pointers- Finding the first and second rank holders and printing their names and roll numbers, in a class of 60 students using structuresDefining a complex number as structure and wring a program to illustrate the operations on complex numbers-Some examples of Unions.

6. FILES & OTHER TOPICS: Copying and concatenation of files- Bit wise operations-Command line parameters- C preprocessor directives- Macros.

7. Implementation of ADT Linked list. 8. Implementation of Stack using arrays. 9. Implementation of Queue using arrays. 10. Conversion of prefix expression into post-fix form using stacks. 11. Implementation of Binary tree and its Traversals a)Preorder b)Inorder c)Postorder. 12. Write a C Programming to implement the following Sorting techniques a)Bubblesort b)Quick sort c)Merge sort d)Heap Sort

MCA 2nd

Semester

OPERATING SYSTEM LAB






1. Basics of UNIX commands.

2. Shell programming

3. Implementation of CPU scheduling. a) Round Robin b) SJF c) FCFS d) Priority

4. Implement all file allocation strategies

5. Implement Semaphores

6. Implement ll File Organization Techniques a

7. Implement Bankers algorithm for Dead Lock Avoidance

8. Implement an Algorithm for Dead Lock Detection

9. Implement the all page replacement algorithms a) FIFO b) LRU c) LFU

10. Implement Shared memory and IPC

11. Implement Paging Technique f memory management.

12. Implement Threading & Synchronization Applications

MCA 3RD

Semester

SOFTWARE ENGINEERING

L

3

T

1

P -

Cr

4

External Marks: 60

Internal Marks: 40


Total Marks: 100




OBJECTIVES:

To Know the Basics of Software Architecture

To Understand various phases of Software Development Cycle

UNIT-1

Introduction: Programs vs. software products, emergence of software engineering, software life cycle, models; waterfall, prototype, evolutionary and spiral model, Software Characteristics, Applications, Software crisis. Software project management: Project management concepts, software process and project metrics Project planning, project size estimation metrics, Empirical estimation techniques,

COCOMO, A Heuristic estimation techniques, staffing level estimation, team structures,

staffing, risk analysis and management, project scheduling and tracking. Requirement Analysis and specification: Requirements engineering, partitioning Software, prototyping, Prototyping methods and tools, Specification principles, Representation, the software requirements specification and reviews, Analysis Modeling,

UNIT-II

Data Modeling, Functional Modeling and information flow: Data flow diagrams, Behavioral

Modeling, The mechanics of structured analysis: Creating entity/ relationship diagram, data flow model, control flow model, the control and process specification, The data dictionary,

Other classical analysis methods. System Design: Design concepts and principles: the design process: Design and software

quality, design principles, Design concepts: Abstraction, refinement, modularity, software architecture, control hierarchy, structural partitioning, data structure, information hiding, and

Effective modular design: Functional independence, Cohesion, Coupling, Design Heuristics for effective modularity; the design model; Design documentation.

UNIT-III

Testing and maintenance: Software Testing Techniques, Software testing fundamentals: objectives principles, testability; test case design, Unit testing: white box testing, basis path

testing: Control structure testing: Black box testing, testing for specialized environments, architectures and applications. Software Testing Strategies; Verification and validation,

Integration testing, Validation testing, alpha and beta testing, System testing: Recovery

testing, security testing, stress testing, performance testing; The art of debugging, process debugging approaches. Software re-engineering: Reverse engineering, restructuring, forward engineering. Software Reliability and Quality Assurance: Quality concepts, Software quality assurance : SQA activities; Software reviews; cost impact of software defects, defect amplification and

removal; formal technical reviews: The review meeting, review reporting record keeping,

review guidelines; Formal approaches to SQA;

TEXT BOOK

Software Engineering - A Practitioner‟s Approach, Roger S. Pressman, MGH Publications, New Delhi, Eighth edition, 2019.

REFERENCE BOOKS

An Integrated Approach to Software Engineering by Pankaj Jalote, Narosa Publications, New Delhi, 2010.

Fundamentals of Software Engineering, Rajib Mall, PHI Learning; Fifth edition,

2019.

Software Engineering by Ian Summerville, Pearson Education, 10th Edition, 2017. Software Engineering, K.K. Aggarwal, NEW AGE publication; 3rd edition, 2008.

MCA 3rd

Semester

THEORY OF COMPUTATION







OBJECTIVES:

What can be computed and how fast it can be done? Use of Automata and Language theory in the development of different modules of a

compiler as a case study. UNIT-1

Automata and Language Theory: Overview of Theoretical Computer Science ( including

computationally intractable problems) , Introduction to System software including various

phases / Modules in the design of a typical compiler , Chomsky Classification, Finite

Automata, Deterministic Finite Automata (DFA), Non-Deterministic Finite Automata

(NFA),statement of Kleen's Theorem, Regular Expressions, Equivalence of DFAs, NFAs

and Regular Expressions, Closure properties of Regular Language, Non-Regular Languages,

Pumping Lemma. Myhill Nerode Theorem, Use of Regular expressions in the Design of

scanner (lexical analyzer). Introduction to JFLAP Simulation.

UNIT-II

Context Free Languages: Context Free Grammar (CFG), Parse Trees, Push Down Automata

(deterministic and nondeterministic) (PDA), Equivalence of CFGs and PDAs, Closure properties of CFLs, Pumping Lemma, Parsing ( including LL(1) , SLR and LR(1) Parsing

Method). UNIT-III

Turing Machines and Computability Theory: Definition of Turing Machine, Extensions of

Turing machines, Non – deterministic Turing machines, Equivalence of various Turing Machine Formalisms, Church–Turing Thesis, Decidability, Halting Problem, Reducibility,

and Recursion Theorem.

TEXT BOOK

1. Theory of Computer Science: Automata, Languages and Computation, Mishra K.L.P,

Prentice Hall India Learning Private Limited; 3 edition, 2006.

REFERENCE BOOKS

J. C. Martin, “Introduction to Languages and the Theory of Computation”, TMH,

3rd Ed. 2007.

M. Sipser, “Introduction to the Theory of Computation”, Cengage Publication, 2006.

Introduction to the Theory of Computation, Michael Sipser, Cengage; 3rd edition, 2014.

MCA 3rd

Semester

DATA COMMUNICATION AND NETWORKS







OBJECTIVES:

To understand the concepts of data communication and to study the functions of different layers used in communication the data over network.

To introduce IEEE standards employed in computer networking. To make the students to get familiarized with different protocols and network components.

UNIT – 1

Introduction of Computer Networks, description of LAN, WAN, MAN & wireless networks Basic terminology of computer networks: - Bandwidth, physical and logical networks, Bridge, switch, HUB, Modem SCU/DSU OSI Reference Model: Laying architecture of networks, OSI model, Function of each

layer, Services and Protocols of each Layer. Physical Layer: Representation of a bit on physical modem that is in wired network, optical network and wireless network, AM,FM and PM. Different types of media –twisted pair unshielded twisted pair, coaxial cable, optical Fiber cable and wireless.

UNIT-II

Data Link Layer: framing error control and flow control. Error detection & correction CRC block codes parity and check sum, elementary data link protocol, sliding window protocol,

channel allocation problem-static and dynamic. Multiple Access protocol-ALOHA, CSMA/CU, Token ring, FDDI. Network Layer: network layer addressing, network layer datagram, IP addressed Classes. Sub netting-Sub network, Subnet mask, Routing algorithm-optionally principle, Shortest

path routing, hierarchical routing, Broadcast routing, Multicast routing, DHCP, Routing protocol.

UNIT-III

Transport layer: Layer-4 protocol TCP & UDP. Three-way hand shakes open connection. Introduction to Network Management: Remote Monitoring Techniques: Polling, Traps, Performance Management, Introduction to Network Operating System: Client- Server Infrastructure, WINDOWS nt/2000.

TCP/IP : Introduction History of TCP/IP, Protocols, Internet Protocol , Transmission

control, User Datagram Protocol , IP Address classes, Subnet addressing ,Internet Email-SMTP, POP, IMAP, FTP NNTP, HTTP, SNMP, TELNET, Application Layer: Domain name system, E-mail, File transfer protocol, HTTP, HTTPS, World Wide Web.

TEXT BOOK

Computer Networks: Tanenbaum, PHI, New Delhi, 5th

Edition, 2013.

REFERENCE BOOKS

Data Communication & Networking, Frouzen Tata McGraw Hill Publications, 5th

Edition, 2017.

Computer Networking: A Top-Down Approach, Kurose James F., Pearson Education; Sixth

edition, 2017.

Computer Networks - A System Approach, Elsevier; Fifth edition, 2011.

MCA 3rd Semester

JAVA PROGRAMMING

L

3

T

1

P -

Cr

4

External Marks: 60

Internal Marks: 40


Total Marks: 100




OBJECTIVES:

how to write Java code according to Object-Oriented Programming principles

how to design GUI applications and Applets using AWT

how to develop multithreaded and Networking applications and how to create dynamic pages.

UNIT 1

Importance and features of Java: Language Construct of java including Keywords,

constants, variables and looping and decision making construct, Classes and their

implementation, Introduction to JVM and its architecture including set of instructions.

Overview of JVM Programming. Internal and detailed explanation of a valid .class file

format. Instrumentation of a .class file, Byte code engineering libraries, Overview of class

loaders and Sandbox model of security. Introducing classes, objects and methods: defining a class, adding variables and methods,

creating objects, constructors, class inheritance. Arrays and String: Creating an array, one and two dimensional arrays, string array and methods, Classes: String and String Buffer

classes, Wrapper classes: Basics types, using super, Multilevel hierarchy abstract and final classes, Object class, Packages and interfaces, Access protection, Extending Interfaces,

packages.

UNIT 2

Exception Handling: Fundamentals exception types, uncaught exceptions, throw, throw, final, built in exception, creating your own exceptions, Multithreaded Programming:

Fundamentals, Java thread model: priorities, synchronization, messaging, thread classes,

Runnable interface, inter thread Communication, suspending, resuming and stopping threads. Input/Output Programming: Basics, Streams, Byte and Character Stream, predefined

streams, Reading and writing from console and files. Using Standard Java Packages (lang, util, io, net). Networking: Basics, networking classes and interfaces, using java.net package, doing TCP/IP and Data-gram Programming, RMI (Remote Method Invocation).

UNIT-III

Event Handling: Different Mechanism, the Delegation Event Model, Event Classes, Event

Listener Interfaces, Adapter and Inner Classes, Working with windows, Graphics and Text,

using AWT controls, Layout managers and menus, handling Image, animation, sound and video, Java Applet. The Collection Framework: The Collection Interface, Collection Classes, Working with

Maps & Sets. JDBC: Introduction to DBMS & RDBMS, DBC API, JDBC Application Architecture, Obtaining a Connection, JDBC Models: Two Tier and Three Tier Model, ResultSet, Prepared Statement, Callable Statement. RMI (Remote Method Invocation): Introduction, Steps in creating a Remote Object, Generating Stub & Skeleton, RMI Architecture, RMI packages.

TEXT BOOKS

1. Patrick Naughton and Herbertz Schildt, “Java-2: The Complete Reference”, TMH, 2. Tenth edition, 2017.

REFERENCE BOOKS

1. E. Balaguruswamy, “Programming with Java: A Primer”, McGraw-Hill; Sixth edition, 2019.

2. Core Java: An Integrated Approach, New: Includes All Versions upto Java 8, R. Nageswara Rao, DreamTech Press, 2016.

3. Advanced Java Programming, Uttam Roy, Oxford University Press; UK ed. Edition, 2015. 4. Horstmann, “Computing Concepts with Java 2 Essentials”, John Wiley. 5. Decker and Hirshfield, “Programming Java: A Introduction to Programming Using

JAVA”, Vikas Publication, 2000. 6. Head First Java: A Brain-Friendly Guide,2nd Edition, Kathy Sierra, Shroff

Second edition, 2009. 7. Mastering HTML, CSS & Javascript Web Publishing, Laura Lemay, BPB Publications; First

edition,2016.

MCA 3rd

Semester

BUSINESS PROCESS MANAGEMENT AND INTELLIGENCE







OBJECTIVES: • Discuss the concept of placing business data into context thereby creating information • Explain the basic processes for moving data from the source systems to the Data

Warehouse databases • List some representative technologies for populating a data warehouse

• Describe information integration • Discuss the key elements and issues of a typical project plan for implementing a Data

Warehouse and Business Intelligence system

UNIT-1

BPM concepts, life cycle, BPM technology, Concepts of BPA and BPM, Turning data into information- Business and data, Challenges for Business and data, Data,

Information, Insight, Data decision challenge, Operational versus Informational data, Data Warehouse architecture, What is a Data Warehouse, Logical tiers in a Data Warehouse,

concept of Data Mart, Data Warehouse process flow, Dynamic Warehousing.

UNIT-II

System Development Approaches, System Analysis & Design-Definition, characteristics

and elements of a system, information gathering tools MIS basic concepts, Importance, Need , Characteristics, Nature and Scope of MIS, MIS functions, MIS structure, MIS

classification , Management support system, General support system.

UNIT-III

Decision Support System: Decision making concept, Simon‟s model of decision making,

Types of decisions, Methods for decision making, Decision support processes, Decision support users, DW and DSS, Business Intelligence areas, Information as a service, Explicit

and tacit knowledge, Knowledge lifecycle, Value of information, Extending beyond the Data Warehouse. Data Modeling and Metadata, Data Warehouse modeling and design, The challenges, Requirements capturing, Modeling, Modeling process, Modeling techniques - Entity relationship modeling, Temporal modeling, Multidimensional modeling.

TEXT BOOKS

1. Machiaswedge, Business Process Management, (Concept Language and Architecture

) Springer, 2014

REFERENCE BOOKS

1. Business intelligence for the enterprise by Mike Biere, IBM

2. Changing Business with Data Insight, IBM

3. Business Process Management by Farouk Toumani & Karsten Wolf , Springer

4. Business Intelligence by David Loshin, IBM

5. Working with Cognos Report Builder, IBM

MCA 3rd

Semester

DATA COMMUNICATION & NETWORKS LAB




COURSE OBJECTIVES

The objective of this course is to:

Familiarize students with different Networks components such as switch, routers

etc.

Make them comfortable in socket programming and internet programming.

COURSE OUTCOMES

At the end of course the student will be able to:

1. Understand basic Network Commands.

2. Understand the basic functioning of Switches and routers etc.

3. Understand functioning of different layers.

4. Write program for client and server using socket programming.

LIST OF EXPERIMENTS:

1. Introduction to basic Linux networking commands. (Commands like ipconfig,

getmac, tracert, pathping, arp, ping, netstat, finger etc.)

2. Implement bit stuffing and de-stuffing

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

4. Implement cyclic redundancy check (CRC).

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

6. Implement Dijkstra’s algorithm to compute a shortest path through graph.

7. Take a 64-bit plain text and encrypt the same using DES algorithm.

8. Using RSA algorithm encrypts a text data and decrypts the same.

9. Implementation of the link state routing protocols.

10. Implementation of LZW compression and decompression algorithms.

MCA 3rd

Semester

JAVA PROGRAMMING LAB

L T P Cr

- - 4 2

Internal Marks: 20

External Marks: 30

List of Experiments not limiting to:

1. (a) Make a program to implement an integer stack, which can hold 10 values.

(b) Implement Function overloading concept.

2.(a) Write a program to implement the concept of inheritance having a base class

representing a person, derived from this class make two classes, one about the students

and other about employees. Input & output this information about students &

employees.

(b) Make a program to implement the concept of Package. 3. Make a program to copy the contents of source file into destination file, properly

handling the exceptions. 4. Make a program to implement the buffering concept in which producer produc es the

data and consumer consumes it using the threading concept. 5. Make a program to implement the matrix multiplication & copying a file using

Multithreading concept. 6. Create an Applet Creating Thread which will move a String Continuously. 7. Make a program using applets which will handle mouse events on client side. 8. Make a program using applets which will handle key events on client side. 9. Make a program which will hold end to end communications between client & server

using connection less service. (Use sockets to make TCP server & clients).

10. Implement UDP server & UDP clients establish connection between them using ports. 11. Make a program using servlets and a web page using HTML so as to print the dynamic

response from the servlets when the web page is submitted. 12. Create a database using MS-Access and access this database in your program using

JDBC. 13. Make a Frame window having fields regarding user information & extract the values

from the database in that field on the click event of button next. 14. Make a program using JSP & a WEB page using HTML so as to print the dynamic

response from the JSP when the web page is submitted. (Using any web server) 15. Make a program which creates a cookie on the server side using servlets & when server

returns a response to the user also send cookies to clients for later retrieve its data from

that client.

MCA 3rd Semester

COLLOQUIUM I

L

-

T

-

P 2

Cr

1

External Marks: 30

Internal Marks: 20


Total Marks: 50

Note: An academic seminar usually led by a different lecturer and on a different topic at

each meeting or similarly to a tutorial led by students.

https://en.wikipedia.org/wiki/Seminar

MCA 4th Semester

CLOUD COMPUTING

L

3

T

-

P -

Cr

3

External Marks: 60

Internal Marks: 40


Total Marks: 100




OBJECTIVES:

Discuss the concept of placing business data into context thereby creating information

List some representative technologies for populating a cloud computing

Describe cloud computing concepts.

UNIT I

Cloud Computing definition, private, public and hybrid cloud. Cloud types; IaaS, PaaS,

SaaS. Benefits and challenges of cloud computing, public vs private clouds, role of

virtualization in enabling the cloud; Business Agility,Benefits and challenges to Cloud

architecture. Application availability, performance, security and disaster recovery; next

generation Cloud Applications. Technologies and the processes required when deploying

web services; Deploying a web service from inside and outside a cloud architecture,

advantages and disadvantages

UNIT II

Setting up your own cloud: Build private cloud using open source tools, understanding

plugins, setting your own cloud environment, integration of public and private cloud.

Reliability, availability and security of services deployed from the cloud. Performance and

scalability of services, tools and technologies used to manage cloud services deployment;

Cloud Economics,Cloud Computing infrastructures available for implementing cloud based

services. Economics of choosing a Cloud platform for an organization, based on application

requirements, economic constraints and business needs (e.g Amazon, Microsoft and Google,

Salesforce.com, Ubuntu and Redhat).

UNIT III

Application development: Service creation environments to develop cloud based

applications. Development environments for service development; Amazon, Azure, Google

App.Coud it model,Analysis of Case Studies when deciding to adopt cloud computing

architecture. How to decide if the cloud is right for your requirements. Cloud based service,

applications and development platform deployment so as to improve the total cost of

ownership (TCO).

TEXT BOOK

1. Cloud Computing: Concepts, Technology & Architecture, Erl, Pearson Education India; 1 edition, 2014

REFERENCE BOOKS

1. Toby Velte, Anthony Velte, Robert Elsenpeter, “Cloud Computing, A Practical

Approach” McGraw-Hill Osborne Media; 1 edition [ISBN: 0071626948], 2009.

2. Distributed and Cloud Computing, 1st edition, Morgan Kaufmann, 2011.

3. Dimitris N. Chorafas, “Cloud Computing Strategies” CRC Press; 1 edition [ISBN:

1439834539],2010.

4. Distributed and Cloud Computing, 1st edition, Morgan Kaufmann, 2011.

5. Cloud Security: A Comprehensive Guide to Secure Cloud Computing, Ronald L. Krutz, John

Wiley & Sons, 2010. 6. Gautam Shroff, “Enterprise Cloud Computing Technology Architecture

7. Applications”, Cambridge University Press; 1 edition,[ISBN: 978- 0521137355],

2010.

MCA 4th

Semester

COMPUTER GRAPHICS AND MULTIMEDIA







OBJECTIVES:

Students will demonstrate an understanding of contemporary graphics hardware. Students will create interactive graphics applications in C++ using one or more

graphics application programming interfaces. Students will write program functions to implement graphics primitives.

Students will write programs that demonstrate geometrical transformations. Students will demonstrate an understanding of the use of object hierarchy in

graphics applications.

UNIT-1

Introduction: What is Computer Graphics, Computer Graphics Applications, Computer

Graphics hardware and Software , Two dimensional Graphics primitives: Points and Lines,

Point plotting Techniques: Coordinate system , Increment method , Line drawing algorithm : DDA, Bresenham„s circle drawing algorithm: Using polar coordinates, Mid point circle drawing algorithms, filled area algorithm: Scan line, Polygon filling algorithms, Boundary filled algorithms. Point & Positioning devices: light pen, mouse, Tablet, Input technique, positioning technique, and character recognition. Two Dimensional Geometric transformations: Translation, Scaling, Rotation, Other Transformations Reflection, shear, Homogenous Coordinate System.

UNIT-II

Clipping: point & line clipping algorithm, 4 bit code algorithm. 4 bit code algorithm Cohen –Sutherland line clipping algorithms, Liang –Barsky line clipping algorithms Polygon clipping: Sutherland – Hodge land Polygon clipping algorithm. Curve clipping, Text clipping. Two Dimensional Viewing: Viewing pipeline, Window to view port transformation, Window to view port mapping Three Dimensional Geometric transformations: Translation, Scaling and Rotation Three Dimensional Viewing: Viewing pipeline, viewing coordinates, Projection: Parallel, perspective

UNIT-III

Representation of 3-D curves and surfaces: Curved lines and surfaces, spline

representations, interpolation and approximation splines, parametric continuity conditions.

Bezier curves and surfaces: Bezier curves, properties of Bezier curves, Bezier surfaces B-spline curves and surfaces. Hidden Surfaces removal: Hidden surface elimination, depth buffer algorithm, scan line coherence algorithm, priority algorithm. Multimedia: An introduction; Framework for multimedia systems; multimedia devices, professional development tools; Image Compression & Standards: Making still images; editing and capturing images; scanning images;

TEXT BOOKS

Computer Graphics, 2nd

Ed., Hearn & Baker –PHI, New Delhi, 2002.

REFERENCE BOOKS

Computer Graphics Principles and Practice, 2nd

Edition by Foley, Van Dam, Feiner and Hughes.-Addison-Wesley Pub Company.

Principles of Computer Graphics Theory & Practice Using Open GL and Maya University Press,Hyderabad.

Graphics Programming with C By Yashwant Kanetkar, BPB Publications, New Delhi.

Computer Graphics Principles and Practice in C: Principles & Practice in C, Andries van Dam; F. Hughes John; James D. Foley; Steven K. Feiner, Pearson Education India; 2nd edition, 2002.

Schaum Outline Computer Graphics, Xiant, McGraw Hill Education, 2017.

MCA 4th

Semester

ANALYSIS & DESIGN OF ALGORITHMS







OBJECTIVES: Date Structures are an integral part of algorithm design and Discrete Structures covers topics like graph theory.

UNIT-1

Introduction: Algorithm, Analyzing algorithm, Designing algorithm, Concept of algorithmic efficiency, Run time analysis of algorithms, Asymptotic Notations. Divide and Conquer: Structure of divide and conquer algorithms; examples; binary search, quick sort, Strassen Multiplication; Analysis of divide and conquer run time, recurrence relations. Greedy Method: Overview of the Greedy Paradigm, Examples of Exact Optimization solution (minimum cost spanning tree), approximate solution (Knapsack problem), Single source shortest paths.

UNIT-II

Dynamic Programming: Overview, Difference between Dynamic Programming and Divide and Conquer, Applications: Shortest path in graph, Matrix Multiplication, Traveling salesman Problem, Longest Common sequence. Back Tracking: Overview, 8-queen problem, Graph Coloring Problem and Knapsack problem

UNIT-III

Branch and Bound: LC Searching Bounding, FIFO Branch and Bound, LC Branch and

Bound Application: 0/1 Knapsack Problem, Traveling Salesman Problem Graph Searching and Traversal: Overview, Traversal methods(depth first and breadth first

search)Trees: Review of Trees, Binary Search Tree, Traversal, Insertion & Deletion in

Binary Search Tree, B-Trees, Basic operations on B-Trees Computational Complexity:

Complexity measures, Polynomial vs. non-polynomial time complexity; NP-hard and NP-complete classes, examples.

TEXT BOOKS

1. Fundamentals of Computer Algorithms. 2nd

Edition, E. Horowitz, S. Sahni, and S.Rajsekran, University Press, Hyderabad.

2. Introduction of Computer Algorithm, T. H Cormen, Leiserson, Rivest and Stein, PHI, New Delhi.

3. Design and Analysis of Algorithms, P. Himanshu, H.B. Dave, Pearson Education.

REFERENCE BOOKS

1. Computer Algorithms, Sara Basse, A.V. Gilder, Addison Wesley, New Delhi. 2. Fundamentals of Data Structure, E. Horowitz, S. Sahni, and S.Rajsekran University

Press, Hyderabad

MCA 4th

Semester

DATA WAREHOUSING AND DATA MINING







UNIT I

Data warehousing Concepts: 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.Data warehouse process & architecture, OLTP vs OLAP, ROLAP vs MOLAP, types of OLAP, servers, 3-Tier data warehouse architecture, distributed and virtual data warehouses, data warehouse manager.Data warehouse implementation, computation of data cubes, modelling OLAP

data, OLAP queries manager, data warehouse backend tools, complex aggregation at multiple granularities, tuning and testing of data warehouse.

UNIT II

Data mining definition & task, KDD versus data mining, data mining techniques, tools and

applications.Data mining query languages, data specification, specifying knowledge,

hierarchy specification, pattern presentation &visualisation specification, data mining

languages and standardisation of data mining.Data mining techniques: Association rules,

Clustering techniques, Decision tree knowledge discovery through Neural Networks &

Genetic Algorithm, Rough Sets, Support Victor Machines and Fuzzy techniques.

UNIT III

Mining complex data objects, Spatial databases, Multimedia databases, Time series and Sequence data mining Text Databases and mining Word Wide Web.

TEXT BOOKS

1. Data Warehousing In the Real World; Sam Anahory & Dennis Murray; 1997, Pearson 2. Data Mining- Concepts & Techniques; Jiawei Han & Micheline Kamber- 2001, Morgan Kaufmann. 3. Data Mining Techniques; Arun Pujar; 2001, University Press; Hyderbad.

REFERENCE BOOKS

1. Data Mining; Pieter Adriaans & Dolf Zantinge; 1997, Pearson,

2. Data Warehousing, Data Miniing and OLTP; Alex Berson, 1997, Mc Graw Hill.

3. Data warehousing System; Mallach; 2000, Mc Graw Hill.

4. Building the Data Warehouse; W.H. Inman, 1996, John Wiley & Sons.

5. Developing the Data Warehouses; W.H Ionhman,C.Klelly, John Wiley & Sons. 6. Managing the Data Warehouses; W.H.Inman, C.L.Gassey, John Wiley & Sons. .

MCA 4th

Semester

ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS







OBJECTIVE:

• To display the utilization of reason as well as logic without human interference. • To promote interdisciplinary exchanges between Artificial Intelligence and other fields

of information processing.

UNIT - I

Introduction: Background and history, Overview of AI applications areas. The predicate calculus: Syntax and semantic for propositional logic and FOPL, Clausal form, inference rules, resolution and unification. Knowledge representation: Network representation-Associative network & conceptual graphs, structured representation- Frames & Scripts.

UNIT - II

Search strategies: Strategies for state space search-data driven and goal driven search; Search algorithms- uninformed search (depth first, breadth first, depth first with iterative

deepening) and informed search (Hill climbing, best first, A* algorithm, mini-max etc.), computational complexity, Properties of search algorithms-Admissibility, Monotonicity,

Optimality, Dominance, etc. Production system: Types of production system, Control of search in production system.

UNIT - III

Rule based expert systems: Architecture, development, managing uncertainty in expert systems(Bayesian probability theory, Stanford certainty factor algebra, Nonmonotonic logic

and reasoning with beliefs, Fuzzy logic, Dempter/Shaffer and other approaches to uncertainty. Knowledge acquisition: Types of learning, learning automata, genetic algorithms, intelligent editors, learning by induction.

TEXT BOOKS

1. George F. Luger, William A. Stubblefield, Artificial Intelligence, The Benjamin / Cummings Publishing Company, Inc.

REFERENCE BOOKS

Dan W. Patterson Introduction to Artificial Intelligence and Expert system PHI. Eugene Charniak, Drew McDermott Introduction to Artificial Intelligence Addison

Wesley. Guide to expert systems, Donald A. Waterman, Pearson Education.

Nils J. Nilsson Principles of Artificial Intelligence Narosa publishing house. Jackson Peter, Introduction to Expert systems, 3rd ed., (Addison Wesley).

MCA 4th Semester COMPUTER GRAPHICS & MULTIMEDIA LAB

L

-

T

-

P 4

Cr

2

External Marks: 30

Internal Marks: 20


List of programs to be developed:

1. Write a program for 2D line drawing as Raster Graphics

Display.

2. Write a program for circle drawing as Raster Graphics

Display.

3. Write a program for polygon filling as Raster Graphics

Display

4. Write a program for line clipping.

5. Write a program for polygon clipping.

6. Write a program for displaying 3D objects as 2D display using perspective transformation.

7. Write a program for rotation of a 3D object about arbitrary

axis.

8. Write a program for Hidden surface removal from a 3D

object.

Note: At least 5 to 10 more exercises to be given by the teacher

concerned.

Total Marks: 50

MCA 4th Semester ARTIFICIAL INTELLIGENCE LAB

L

-

T

-

P 4

Cr

2

External Marks: 30

Internal Marks: 20


Total Marks: 50

List of Experiments Analysis & Design of Algorithms to be implemented in Java

and not limiting to:

1. Study of Prolog.

2. Write simple fact for the statements using PROLOG.

3. Write predicates One converts centigrade temperatures to Fahrenheit, the other checks if a temperature is below freezing.

4. Write a program to solve the Monkey Banana problem.

5. WAP in turbo prolog for medical diagnosis and show the advantage and disadvantage of green and red cuts.

6. WAP to implement factorial, fibonacci of a given number.

7. Write a program to solve 4-Queen problem.

8. Write a program to solve traveling salesman problem.

Note: At least 5 to 10 more exercises to be given by the teacher concerned.

MCA 4th Semester CLOUD COMPUTING LAB

L

-

T

-

P 2

Cr

1

External Marks: 30

Internal Marks: 20


List of Experiments

Use Eucalyptus or Open Nebula or equivalent to set up the cloud and demonstrate.

1. Find procedure to run the virtual machine of different configuration. Check how many virtual machines can be

utilized at particular time.

2. Find procedure to attach virtual block to the virtual machine and check whether it holds

the data even after the release of the virtual machine.

3. Install a C compiler in the virtual machine and execute a sample program.

4. Show the virtual machine migration based on the certain condition from one node to the

other.

5. Find procedure to install storage controller and interact with it.

6. Find procedure to set up the one node Hadoop cluster.

7. Mount the one node Hadoop cluster using FUSE.

8. Write a program to use the API's of Hadoop to interact with it.

9. Write a wordcount program to demonstrate the use of Map and Reduce tasks

Note: At least 5 to 10 more exercises to be given by the teacher concerned.

Total

Marks

50

MCA 4th Semester

COLLOQUIUM II

L

-

T

-

P 2

Cr

1

External Marks: 30

Internal Marks: 20


Total Marks: 50

NOTE: Is related to seminar, extempore which is in curriculum.

MCA 5th Semester ADVANCED WEB TECHNOLOGIES

L

3

T

-

P -

Cr

3

External Marks: 60

Internal Marks: 40


Total Marks: 100




OBJECTIVE:

How to design and develop a dynamic website. Basic knowledge of web services which are useful for the same.

UNIT – I HTML & CSS

HTML :- Basics of HTML, formatting and fonts, hyperlink, tables, images, forms, XHTML,

Meta tags, Browser architecture and Web site structure. Overview and features of HTML5.

Style Sheets: Introduction to CSS, Need for CSS, basic syntax and structure using CSS,

background images, colors and properties, manipulating texts, using fonts, borders and boxes,

margins, padding lists, positioning using CSS.

UNIT – II

Java Script:-

Introduction, Client-Side JavaScript, Server-Side JavaScript, JavaScript Objects, JavaScript

Security, Operators, Statements, Document and its associated objects, Events and Event

Handlers, Core JavaScript (Properties and Methods of Each)

UNIT – III

PHP (Hypertext Preprocessor): Introduction, syntax, variables, strings, operators, if-else, loop,

switch, array, function, form, mail, file upload, session, error, exception, filter, PHP-ODBC.

MYSQL: Introduction to Database and MYSQL, RDBMS-Understanding Tables, Records &

Fields, SQL language, MYSQL queries.

Working with MYSQL Admin: Working with PHP My admin, data types, creating Database

and tables, dropping Database and tables, adding fields, selecting table, Altering fields

properties.

TEXT BOOK :

1. PHP for the Web: Visual QuickStart Guide, Ullman, Pearson Education; Fifth edition, 2017.

REFERENCE BOOKS:

1. Web Technologies: HTML, JAVASCRIPT, PHP, JAVA, JSP, ASP.NET, XML and Ajax,

Black Book: HTML, Javascript, PHP, Java, Jsp, XML and Ajax, Black Book, Kogent

Learning Solutions Inc., Dreamtech Press; 1 edition, 2009.

2. Mastering HTML, CSS & Javascript Web Publishing, Laura Lemay, BPB Publications; First

edition, 2016.

3. Beginning HTML5 with CSS3, Christopher Murphy , Apress publisher,1st ed. Edition, 2012.

MCA 5th

Semester

SOFTWARE PROJECT MANAGEMENT







OBJECTIVE: Develop the concepts that are seen as central to the effective management of

software projects. How a project can be monitored, controlled and assessed.

UNIT - I

Introduction: Introduction to software project management and control whether software

projects are different from other types of projects,The scope of project management. The

management of project life cycle. Defining effective project objectives where there are multiple stakeholders. Software Tools for Project Management. Project Planning: Creation of a project plan -step by step approach, The analysis of

project characteristics in order to select the best general approach, Plan Execution, Scope Management, Use of Software (Microsoft Project) to Assist in Project Planning Activities.

UNIT - II

Project Scheduling: Time Management, Project Network Diagram, Critical path Analysis, PERT, Use of Software (Microsoft Project) to Assist in Project Scheduling. Project Cost Management: Resource planning, Cost Estimation (Types, Expert Judgment, Estimation by Analogy, COCOMO). Project Quality Management: Stages, Quality Planning, Quality Assurance, Quality

Control, Quality Standards, Tools and Techniques for Quality Control.

UNIT - III

Project Human Resource Management: Definition, Key to managing People, Organization Planning, Issues in Project Staff Acquisition and Team Development, Using

Software to Assist in Human Resource Management, Communication Planning, Information Distribution, Performance Reporting.

Project Risk Management: Common Sources of Risk in IT projects, Risk Identification, Risk Quantification, Risk Response Development and Control. Project Procurement Management: Procurement Planning, Solicitation, Source Selection, Contract Administration.

Introduction to Project Management Process Groups, Project Controlling and Configuration Management.

TEXT BOOKS:

Bob Hughes, Mike Cotterell, “Software Project Management” Tata McGraw-Hill, 3rd Ed.

REFERENCE BOOKS

S.A. Kelkar, “Software Project Management - A Concise Study”, PHI, Reviseda. Edition,2003.

Pankaj Jalote, “ Software Project Management in Practice”, Pearson Education, 3rd Ed. ,2010.

Kathy Schwalbe ,“Information Technology Project Management, THOMSON Course Technology, ” International Student Edition, 2003.

Henry, J., “Software Project Management – A Real-World Guide to Success”, Addison-Wesley, 2004.

Robert T. Futrell, “Quality Software Project Management”, Pearson, 2010.

Robert T. Futrell, “Quality Software Project Management”, Pearson, 2010.

MCA 5th

Semester

INFORMATION RETRIEVAL SYSTEM







OBJECTIVE:

To present the scientific underpinnings of the field of Information Search and Retrieval. Basic information retrieval concepts and more advanced techniques for information filtering

and decision support.

UNIT - I

Basic Concepts – Retrieval Process – Modeling – Classic Information Retrieval – Set

Theoretic, Algebraic and Probabilistic Models – Structured Text Retrieval Models – Retrieval Evaluation –Word Sense Disambiguation, Languages – Key Word based

Querying – Pattern Matching – Structural Queries – Query Operations – User Relevance

Feedback – Local and Global Analysis – Text and Multimedia languages.

UNIT - II

Text operations and user interface: Document Preprocessing – Clustering – Text Compression - Indexing and Searching – Inverted files – Boolean Queries – Sequential

searching – Pattern matching – User Interface and Visualization – Human Computer

Interaction – Access Process – Starting Points –Query Specification - Context – User relevance Judgment – Interface for Search.

UNIT - III

Multimedia information retrieval: Data Models – Query Languages – Spatial Access

Models – Generic Approach – One Dimensional Time Series – Two Dimensional Color Images – Feature Extraction. Applications: Searching the Web – Challenges – Characterizing the Web – Search Engines

– Browsing – Meta-searchers – Online IR systems – Online Public Access Catalogs –

Digital Libraries – Architectural Issues – Document Models, Representations and Access – Prototypes and Standards.

TEXT BOOKS:

Modern Information Retrieval, Ricardo Baeza-Yate, Berthier Ribeiro-Neto, Pearson

Education Asia, 2005.

REFERENCE BOOKS:

Introduction to Modern Information Retrieval, G.G. Chowdhury, Neal- Schuman

Publishers; 3rd edition, 20010. Speech and Language Processing, Daniel Jurafsky and James H. Martin, Pearson

Education, 2013 David A. Grossman, Ophir Frieder, “ Information Retrieval: Algorithms,

and Heuristics”, Springer; 2nd ed, 2004

MCA 5th

Semester

ADVANCED COMPUTER ARCHITECTURE AND PARALLEL PROCESSING







OBJECTIVE: to develop the foundations for analyzing the benefits of design options in

computer architecture to give some experience of the application of these techniques

UNIT - I

Parallel computer models: The state of computing, Multiprocessors and multicomputers, Multivector and SIMD computers, Architectural development tracks. Program and network properties: 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.

UNIT - II

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

UNIT - III

Backplane Bus System: Backplane bus specification, Addressing and timing protocols, Arbitration transaction and interrupt, Cache addressing models, Direct mapping and associative caches. 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. Vector Processing Principles: Vector instruction types, Vector-access memory schemes.

Text books

Kai Hwang, “Advanced computer architecture”; McGraw Hill Education; Third

edition, 2017.

REFERENCE BOOKS

J. P. Hayes, “Computer Architecture and Organization”, MGH, 1998.

Computer Architecture, Pipelined and Parallel Processor Design, M. J. Flynn, Narosa

Publishing,

A. Patterson, J. L. Hennessy, “Computer Architecture: A Quantitative Approach”,

Morgan Kauffmann.

Computer Architecture and Parallel Processing, Hwang and Briggs, MGH.

Richard Y. Kain, “Advance Computer Architecture - A System Design Approach”,

PHI.

MCA 5th

Semester

ADVANCED COMPUTER NETWORKS







OBJECTIVE:

To grasp the current directions of computer networks research.

To fill in gaps in students‟ networking knowledge.

To better understand experimental methodology.

UNIT - I

Introduction : Overview of computer network, seven- layer architecture, TCP/IP suite of

protocol, etc, Mac protocol for high speed LANS, MAN‟s & WIRLESS LANs (for example, FDDI, DQDB, HIPPI, Gigabit Ethernet, Wireless Ethernet etc) Fast access

technologies.(For example, ADSL, cable Modem Etc.), Wi Fi, Wimax.

UNIT - II

IPV6: Why IPV6, basic protocol, extension & option, support for QS, Security, etc,

neighbour discover, auto-configuration, routing, Change to other protocols, Application programming interface for IPV6.6 bone. ATM: Introduction, ATM reference Model, AAL

layers, AAL0, AA1, AAL2, AAL3/4, AAL5. Mobility in network, mobile, Security related issues. IP Multicasting: Multicasting routing protocols, address assignment, session discovery, etc.

UNIT - III

TCP extensions for high – speed networks, transaction – oriented application, other new option in TCP. Network security at various layers: Secure-HTTP, SSP, ESP, Authentication header, key distribution protocols, Digital signatures, digital certificates.

TEXT BOOKS:

1. Computer Networks, Tanenbaum, Pearson Education India; 5 edition,

2013.

REFERENCE BOOKS:

1.Cryptography and Network Security, William Stalling, Pearson Education; Seventh

edition, 2017.2.TCP/IP Protocol Suite, Frouzan,, Tata Mc Grew Hill, 4th Ed., 2017.

MCA 5th

Semester

OBJECT ORIENTED ANALYSIS AND DESIGN







OBJECTIVE: To give students a detailed understanding of processes and techniques for building

large object-oriented software systems To develop skills to evolve object-oriented systems from analysis, to design, To implement and to understand most of the major object-oriented technologies

including basic OO concepts, processes, languages, databases, user interfaces, frameworks, and design patterns.

UNIT - I

Review of Object modeling, new paradigm, object oriented thinking-rethinking, Objects

and Classes. Links and association, Generalization and specialization, Inheritance, Grouping concepts, aggregation, composition , abstracts classes, Polymorphism, Metadata,

Constraints, Reuse. Object Oriented Lifecycle Model, Introduction to Object Oriented Methodology, Overview of various object oriented methodologies- OOD, HOOD, OMT, CRC, OOA, OOSA, OOSE, OOSD, OORASS.

UNIT - II

Architecture: Introduction, System development is model building, model architecture, requirements model, analysis model, the design model, the implementation model, test model. Analysis: Introduction, the requirements model, the analysis model. Construction: Introduction, the design model, block design, working with construction. Testing: introduction, on testing, unit testing, integration testing, system testing, the testing process.

UNIT - III

Modeling with UML: Origin of UML, 4+1 view architecture of UML, Basic Building Blocks of UML, A Conceptual Model of UML, Basic Structural Modeling, UML Diagrams. Case Studies.

TEXT BOOKS

1. Object Oriented Software Engineering, Ivar Jacobson, Seventh Impression , Pearson, 2009.

REFERENCE BOOKS

Grady Booch, James Rumbaugh, Ivar Jacobson, “The UML User Guide”, 2nd Edition, Pearson, 2008.

Stephen R. Scach, “Classical & Object Oriented Software Engineering with UML and Java”, McGraw Hill.

Richard C. Lee, William M. Tepfenhard, “UML and C++, A Practical guide to object oriented Development”, Pearson.

Bernd Bruegge, ”Object Oriented Software Engineering”, Pearson, 2nd Ed., 2008.

James R. Rumbaugh , Michael R. Blaha , William Lorensen , Frederick Eddy

,William Premerlani , “Object-Oriented Modeling and Design “, 2nd Edition, PHI, 2007.

Mahesh P. Matha, “Object Oriented Analysis and Design using UML”, PHI, 2008. Michael R. Blaha, James R. Runbaugh, “Object Oriented Modeling and

Design with UML”, Pearson, 2nd Ed.

MCA 5th Semester SOFTWARE TESTING

L

2

T

0

P -

Cr

2

External Marks: 60

Internal Marks: 40


Total Marks: 100




OBJECTIVE:

Appreciate the fundamentals of software testing and its application through the software life cycle.

Develop skills in designing and executing software tests suitable for different stages in the software life cycle.

Understand and appreciate the role of software testing in systems development, deployment and maintenance.

Develop a continuing interest in software testing, and obtain satisfaction from its study and practice.

Appreciate the responsibilities of software testers within software projects, the profession and the wider community.

UNIT - I

Introduction: What is software testing and why it is so hard?, Some Software Failures, Error, Fault, Failure, Incident, Test Cases, Testing Process, Limitations of Testing, V

Shaped Software Life Cycle Model, No absolute proof of correctness, Overview of Graph Theory. Verification Testing: Verification Methods, SRS Verification, Software Design Document Verification, Code Reviews, User Documentation Verification, Software Project Audits.

Functional Testing: Boundary Value Analysis, Equivalence Class Testing, Decision Table

Based Testing, Cause Effect Graphing Technique. Structural Testing: Identification of Independent Paths: Control Flow Graph, DD-Paths, Cyclomatic Complexity, Graph Matrix, Control Flow Testing, Data Flow Testing, Slice Based Testing, Mutation testing.

UNIT - II

Use Case Testing: Use Case Diagrams and Use Cases, Generation of Test Cases from Use

Cases, Applicability. Validity Checks: Strategy for Data Validity, Guidelines for Generating Validity Checks. Database testing. Selection, Minimization,

Prioritization of test cases for Regression Testing: Regression Testing, Regression Test Case Selection, Prioritization guidelines, Priority category Scheme, Code Coverage Techniques for Prioritization of Test Cases, Risk Analysis.

UNIT - III

Testing Activities: Unit Testing, Levels of Testing, Integration Testing, System Testing, Debugging Object Oriented Testing: Issues in Object Oriented Testing, Path testing, Class Testing, state based testing, Object Oriented Integration and System Testing. Metrics and Models in Software Testing: What are Software Metrics, categories of Metrics, object Oriented Metrics used in testing, What should we measure during testing?, Software Quality Attributes. Prediction Model: Reliability Modes, Fault Prediction Model.

TEXT BOOKS

1.Effective Methods for Software Testing, William Perry, John Wiley & Sons, New York, Van Nostrand Reinhold, New York, 2nd Ed., 2006.

REFERENCE BOOKS

1. Software Testing A Craftsman‟s approach, Paul C. Jorgenson, CRC Press.

2. Testing Computer Software, Cem Kaner, Jack Falk, Nguyen Quoc, Van

NostrandReinhold, New York, 2nd Ed.

3. Foundation of Software Testing, Aditya P. Mathur, Pearson, 2008.4. Software Engineering – A Practitioner‟s Approach, Roger S. Pressman, McGraw-

Hill International Edition, New Delhi, 5th Ed..5. Software Engineering, K. K. Aggarwal & Yogesh Singh, New Age International

a. Publishers, New Delhi, 3rd Ed.

MCA 5th

Semester

MICROPROCESSOR AND INTERFACING







OBJECTIVE:

Know basics of microprocessor-based Systems.

Know basics of assembly language. Know the process of compilation from high level language to assembly language

to machine language. Know interaction between hardware and software, i.e. `interfacing'.

UNIT - I

Computer Number Systems, Codes, and Digital Devices: Computer Number Systems and

Codes, Microprocessor Evolution and Types, the 8086 microprocessor family-overview,

8086 internal architecture, introduction to programming the 8086, addressing modes of

8086.8086 Family Assembly Language Programming: Program Development Steps,

Constructing the machine codes for 8086 instructions, writing programs for use with an

assembler, assembly language program development tools.

UNIT - II

Implementing Standard Program Structures in 8086 Assembly Language: Simple Sequence

Programs, Jumps, Flags, and Conditional Jumps, If-Then, if-then-else, and multiple if-then

else programs, while-do programs, while-do programs, repeat-until programs, instruction

timing and delay loops Strings, Procedures, and macros: the 8086 string instructions,

writing and using procedures, writing and using assembler macros 8086 Instruction

Descriptions and Assembler Directives.

UNIT - III

8086 System Connections, Timing, and Troubleshooting: A basic 8086 microcomputer System, An example Minimum-mode System, the SDK-86, Troubleshooting a simple 8086- based microcomputer, Timing Diagrams 8086 Interrupts and Interrupt Applications:

8086 interrupts and Interrupt Responses, Hardware Interrupt Applications.

Interfacing 8086 with 8255, 8254, 8259, 8253, 8251, 8259, 8279. Brief Introduction to Architecture of 80186, 80286, 80386, 80486, 8087 and Pentium architecture.

TEXT BOOKS

V. Hall, “Microprocessors and Interfacing”, TMH, 2nd Ed.

REFERENCE BOOKS

Microprocessors and Interfacing, M. Saravanan N. Senthil Kumar, Oxford University

Press, 2012.

Barry B, “The Intel Microproccessors Architecture, Programming and Interfacing”,

Pearson, 8th Ed., 2009.

John Uffenbeck, “The 8086 / 8088 Family Design Programming and Interfacing”,

PHI, 2009. Frank Tsui, Orlando Karan, “Essentials of Software Engineering”, Jones and

Bartletts, 2nd. Ed., 2010.

MCA 5th

Semester

ADVANCED DATABASE MANAGEMENT SYSTEMS







OBJECTIVE:

to provide you with the advanced information about database management system and their development.

provides the conceptual background necessary to design and develop distributed database system for real life applications.

UNIT - I

Review of traditional DBMS’s, relational algebra and relational calculus, design principles, normalization, transaction and concurrency control, recovery management. Design Process: Design process, design evaluation, modeling process, E-R model, and semantic data model, object oriented model, models and mapping normalization and denormalization. Data warehousing, OLAP and data mining.

UNIT - II

Architecture: Architecture of SQL server, SQL server and Oracle sever tuning, SQL server tuning, Oracle server tuning, OS tuning (Microsoft OS‟s).

UNIT - III

Distributed Database Management Systems, Components, levels of data & process distribution, transparency features, data fragmentation, data replication, Client Server Systems, Principles, components, ODBC, ADO, JDBC and JSQL overview.

Text books

Introduction to Database Systems, J. Date, Pearson Education, 8th edition.

REFERENCE BOOKS

Object-Oriented Database System: Design and Implementation for Advanced Applications,

Hiroshi Ishikawa, Springer, 2012.

Object Oriented Database Design, J. L. Warrington ,Morgan Kaufman.

Database Modeling and Design, T. J. Tewrey, Morgan Kaufman.

MCA 5th Semester MOBILE COMPUTING

L

3

T

1

P -

Cr

4

External Marks: 60

Internal Marks: 40


Total Marks: 100




OBJECTIVE:

will learn the principles of Mobile Computing and its enabling technologies

explore a young but rich body of exciting ideas, solutions, and paradigm shifts.

UNIT - I

Cellular Mobile Wireless Networks: Systems and Design Fundamentals, Propagation

Models Description of Cellular system, Frequency Reuse, Co channel and Adjacent

channel interference, Propagation Models for Wireless Networks, Multipart Effects in

Mobile Communication, Models for Multipart Reception Evolution of Modern Mobile

Wireless Communication System – First Generation Wireless Networks, Second

Generation (2G) Wireless Cellular Networks, Major 2G standards, 2.5G Wireless

Networks, Third Generation 3G Wireless Networks, Wireless Local Area Networks

(WLANs), All-IP Network: Vision for 4GIssues in Mobile computing, Wireless Multiple

Access protocols , channel Allocation.

UNIT - II

Data management issues: mobility, wireless communication and portability, data replication Schemes, basic concept of multihopping, Adaptive Clustering for mobile Network, Multicluster Architecture.

UNIT - III

Location Management: Introduction, Location Based Services, Automatically Locating Mobile Users, Locating and Organizing Services, Is Use and future directions, mobile IP, Comparison of TCP wireless. Transaction management: Introduction, Data Dissemination, Cache Consistency, Mobile transaction processing, mobile database research directions, Security fault tolerance for mobile N/W.

TEXT BOOKS

Mobile Communications, Schiller, Pearson Education India; 2 edition, 2008.

REFERENCE BOOKS

Mobile Computing, Shambhu Upadhyaya, Abhjeet Chaudhary, Keviven Kwiat, Mark Weises , Kliuwer Acadmic Publishers.

Principles of Mobile computing, UIWE Hansmann, Other Merk , Martin-S-Nickious, Thomas Stohe, Springer international Edition.

Mobile Computing, Sipra DasBit, Biplab K. Sikdar, PHI, 2009.

MCA 5th

Semester

SOFTWARE QUALITY ASSURANCE







OBJECTIVE:

Basic Concepts of Software Quality.

Software Quality Assurance. Formal Technical Reviews.

How it can be implemented. Describe how to conduct formal technical reviews and why they are the most

important SQA activity. UNIT - I

Concepts and Overview: Concepts of Software Quality, Quality Attributes, Software Quality Control and Software Quality Assurance, Evolution of SQA, Major SQA activities,

Major SQA issues, Zero defect Software, Elements of a complete Software Quality System.

Software Quality Assurance: The Philosophy of Assurance, The Meaning of Quality, The Relationship of Assurance to the Software Life-Cycle, SQA Techniques.

UNIT - II

Tailoring the Software Quality Assurance Program: Reviews, Walkthrough, Inspection, and Configuration Audits. Evaluation: Software Requirements, Preliminary design, Detailed design, Coding and Unit Test, Integration and Testing, System Testing, types of Evaluations. Testing: Types of testing, Test Planning and conduct, Who does the testing? Configuration Management: Configuration Management Components, Maintaining Product Integrity, Change Management, Version Control, Metrics, Configuration Management Planning. Error Reporting: Identification of Defect, Analysis of Defect, Correction of Defect, Implementation of Correction, Regression Testing, Categorization of Defect, Relationship of Development Phases.

UNIT - III

Defect Analysis: Analyzing concepts, Locating data, Defect Repair and closure, Selecting metrics, Collecting measurements, Quality tools, Implementing defect analysis, Program Unit Complexity.

Corrective Action as to Cause: Identifying the Requirement for Corrective Action, Determining the Action to be Taken, Implementing the Correcting the corrective Action,

Periodic Review of Actions Taken. Traceability, Records, Software Quality Program Planning,Software Quality System Plan, Software Documentation.

TEXT BOOKS

Robert Dunn, “Software Quality Concepts and Plans”, Prentice-Hall.

REFERENCE BOOKS

K.K. Aggarwal & Yogesh Singh, “Software Engineering”, New Age

International Publishers, 3rd Ed., 2008. Daniel Freedman, Gerald Weinberg, “Handbook of Walkthroughs, Inspections and

Technical Reviews”, Dorset House Publishing. Mordechai Ben-Menachem, Gary S. Marless,“Software Quality Producing Practical

Consistent Software”, Cengage Learning, 2nd Ed., 2009. Stephen H. Kan, “Metrics and Models in Software Quality Engineering”, Pearson,

2nd Ed., 2003.

MCA 5th Semester COMPILER DESIGN

L

3

T

-

P -

Cr

3

External Marks: 60

Internal Marks: 40


Total Marks: 100




OBJECTIVE:

To introduce the major concept areas of language translation and compiler design

To develop an awareness of the function and complexity of modern compilers. To provide practical, hands on experience in compiler design.

UNIT - I

Compiler Structure: Analysis-synthesis model of compilation, various phases of a compiler,

tool based approach to compiler construction. Lexical analysis: Interface with input parser and symbol table, token, lexeme and patterns, difficulties in lexical analysis, error reporting

and implementation. Regular grammar & language definition, Transition diagrams, design

of a typical scanner using LEX or Flex.

UNIT - II

Syntax Analysis: Context free grammars, ambiguity, associability, precedence, top down

parsing, top down parsing, recursive descent parsing, transformation on the grammars, predictive parsing LL(1) grammar, Nor LL(1) grammar, Bottom up parsing, operator

precedence grammars, LR parsers (SLR, LALR, LR), Design of a typical parser using YACCor Bison. Syntax directed definitions: Inherited and synthesized attributes, dependency graph,

evaluation order, bottom up and top down evaluation of attributes, L- and S-attributed definitions. Type checking: type: type system, type expressions, structural and name

equivalence of types, type conversion, overloaded function and operators, polymorphic function.

UNIT - III

Run time system: storage organization, activation tree, activation record, parameter passing

symbol table, dynamic storage allocation. Intermediate code generation: intermediate representation, translation of declarations, assignments, Intermediate Code generation for

control flow, Boolean expressions and procedure calls, implementation issues. Code generation and instruction selection: Issues, basic blocks and flow graphs, register allocation, code

generation, DAG representation of programs, code generation from DAGS, peep hole optimization, code generator generators, specification of machine. Code optimization: source of optimizations, optimization of basic blocks, loops, global dataflow analysis, solution to iterative dataflow equations, code improving transformations, dealing with aliases, data flow analysis of structured flow graphs.

TEXT BOOKS

K. C. Louden, “Compiler Construction, Principle and Practice”, Cengage Publication 6

th Ed. ,2009.

REFERENCE BOOKS

S. S. Muchnick Harcourt Asra, “Advanced Compiler Design implementation”,Morgan Kaufman, 2006.

Alfred V. Aho, Ravi Sethi and Jeffrey, “Compilers Priciples, Techniques and Tools”,

D. Ullman, Pearson.Principles of compiler Design, V.Raghvan, TMH, 2009.

Compiler Design in C, Alan I. Holub, PHI, 2009.

MCA 5th

Semester

OPERATIONAL RESEARCH







OBJECTIVE:

To introduce students to use quantitive methods and techniques for effective decisions–making.

To model formulation and applications that are used in solving business decision problems.

UNIT - I

Introduction to operations research, Overview of OR modeling. Linear Programming (LP):

Assumptions of LP models, LP problem formulation, Graphical methods for solving LP

problems. The Simplex method, Big M-method and Two-Phase simplex method, Duality:

Definition of the dual problem, relationship between the primal and dual solutions,

Economic interpretation of duality, the dual Simplex method, sensitivity analysis.

Transportation and Assignment problems. Integer programming models, Cutting Plane

method, Branch and Bound method.

UNIT - II

JobSequencing Models: Sequencing problems, Johnson‟s algorithm for processing n jobs on two machines and n jobs on three machines, Processing 2 jobs on n machines using graphical method. Review of Network models, minimal spanning tree algorithm, and shortest route problems:

Dijkstra‟s algorithm, Maximal flow model, maximal flow algorithm, min-cut, min-cut

Max-flow theorem.

UNIT - III

Project Scheduling by CPM/PERT: Designing an activity network, Critical path calculations, Determination of floats, Program Evaluation and Review Technique (PERT). Cost-Time analysis of projects : crashing activities in a project. Queuing systems, Elements of queuing model, role of exponential distribution, birth and death models, steady statemeasures of performance, single server models ,multiple-server

models, machine servicing model, Pollaczek-Khintchine formula, queuing decision models. Multi criteria Decision making, Introduction to Game theory, Zero-sum Game.

TEXT BOOKS

H. Taha, “Operations Research: An Introduction”, PHI, 8th Ed., 2009.

REFERENCE BOOKS

J. K. Sharma, “Operation Research Theory and Applications”, 3rd Edition, Macmillan, India.

Hilier and Liebermann, “Introduction to Operations Research”, McGraw-Hill, 8th Ed., 2009.

Wayne Winston, “Operations Research: Applications and Algorithms”, Cengage, 4th Ed., 2009.

G. Srinivasan, “Operational Research Principles and Applications”, PHI, 2nd Ed., 2008. A.M. Natarajan, P. Balasubramani, A. Tamilarasi, “Operational Research”, Pearson, 4th Ed., 2009.

MCA 5th

Semester

DISTRIBUTED OPERATING SYSTEMS







OBJECTIVE:

Provides an introduction to the fundamentals of distributed computer systems, assuming the availability of facilities for data transmission.

Designed to examine the fundamental principles of distributed systems

UNIT - I

Introduction on : Introduction on to Distributed Sys t e m, Goals of Distributed system, H a

r d w a r e and Software concepts , Design issues. Communication in distributed system: Layered protocols, ATM networks, Client – Server model, Remote Procedure Calls and

Group Communication. Middleware and Distributed Operating Systems. Synchronization in Distributed System: Clock synchronization, Mutual Exclusion, Election algorithm, the Bully algorithm, a Ring algorithm, Atomic Transactions, Deadlock in Distributed Systems, Distributed Deadlock Prevention, Distributed Deadlock Detection.

UNIT - II

Processes and Processors in distributed systems: Threads, System models, Processors Allocation, Scheduling in Distributed System, Real Time Distributed Systems. Distributed file systems: Distributed file system Design, Distributed file system Implementation, Trends in Distributed file systems.

UNIT - III

Distributed Shared Memory: What is shared memory, Consistency models, Page based distributed shared memory, shared variables distributed shared memory. Case study MACH: Introduction to MACH, process management in MACH, communication in MACH, UNIX emulation in MACH.

TEXT BOOK

Distributed Operating System , Andrew S. Tanenbaum, PHI.

REFERENCE BOOK: Operating System Concepts , P.S.Gill, Firewall Media

MCA 5th

Semester

EMBEDDED SYSTEMS







OBJECTIVE:

knowledge about the basic functions of embedded systems.

knowledge about the basic structure of embedded systems. knowledge about the applications of embedded systems.

UNIT - I

Real time operating system overview, exposure to Windows CE, QNX, Micro kernels and

Pc/OS of introduction to process models. Interrupt routines in an RTOs environment, encapsulating semaphores and queues, hard real-time scheduling considerations, saving

memory space. 16 & 32 bit microprocessor and micro-controller and DSP hardware with reference to Embedded system.

UNIT - II

Embedded software development tools and compilers – host and target machines, linker/ locators for embedded software, cross compilers, cross assemblers and tool chairs, gce compiler, basic concept of device drivers, serial communication interface device driver.

UNIT - III

System synthesis of Hardware/ software co-emulation, simulation speed of emulators. JTAG OCD Communication protocols with special reference to embedded system. TCP/IP, VDP wireless protocols, IRDA, Blue tooth IEEE 8.8.11.

TEXT BOOKS

An embedded system primer by David E Simon, Addison-Wesley

REFERENCE BOOKS

TCP/IP Lean: Web servers for embedded systems by Jeramy Bentham.

Programming for Embedded system by Dreamtech software team, John wiley. Real –time programming: A guide to 32 bit embedded development, Rick

Grehan, AW.

MCA 5th

Semester

MANAGEMENT INFORMATION SYSTEM







OBJECTIVE:

This course will equip students with skills to analysis information requirements for managerial decision making.

UNIT – I

Data and Information. MIS- need and concepts, factors influencing MIS and characteristics

of MIS. Technology of MIS. Structure of MIS. Decision Making and role of MIS. Data

communication. Basic H/W required, Channel features and concept of Distributed Data bases Decision Support System: Overview, components and classification, steps in

constructing a DSS, role in business, group decision support system.

UNIT - II

Information system for strategic advantage, strategic role for information system, breaking business barriers, business process reengineering, improving business qualities. Planning for

MIS; System Development Methodologies; Conceptual and detailed designs of MIS. Information system analysis and design, information SDLC, hardware and software

acquisition, system testing, documentation and its tools, conversion methods.

UNIT - III

System implementation Strategies and process; System Evaluation and Maintenance. Applications – cross –functional MIWS; ERP; CRM; SCM; Transaction Processing;

Artificial Intelligence technologies in business: neural network, fuzzy logic, virtual reality; Executive information system.

Text books

1. Jawadekar, Management Information Systems , TMH, N Delhi. 2.

REFERENCE BOOKS

1. Mckeown, Information Technology and the Networked Economy, Thomson Learn ing, Bombay.

2. Brien, James, Management Information System, Tata McGraw Hill, Delhi.

3. Stair, Principles of Management System, Thomson Learning, Bombay. 4. Brady, Cases in MIS , Thomson Learning, Bombay.

5. Murdick & Ross, Management Information System, PHI, Delhi.

MCA 5th Semester ORGANIZATIONAL BEHAVIOR

L

3

T

-

P -

Cr

3

External Marks: 60

Internal Marks: 40


Total Marks: 100



units. Students will be required to attempt six questions in all including compulsory


OBJECTIVE:

Explain and apply principles of organizational behavior and management. Understanding management and organizational behavior with reference to key

organizations in the IT sector- Apple, Intel, Cisco, Infosys, Google, IBM. Identify individual and organizational practices for managing workplace stress. Understand group dynamics, and specifically the way individuals within a group

work together to attain certain goals. Understand organizational culture and managing change in organizations.

UNIT – I

Introduction to OB and Management Principles: Conceptual Framework; Challenges and

Opportunities for OB ;Managerial Implications ;Evolution of Management Principles ;

Scientific Management Theories ; Taylor and Scientific Management, Fayol‟s

Administrative Management, Bureaucracy, Hawthorne Experiments and Human Relations,

Social System Approach ;Management Vs. Administration, Management Skills, Levels of

Management, Characteristics of Quality Managers. Evolution of Management: Early

contributions. UNIT - II

Planning: Types, Process & barriers, Management by Objectives; Organizational context of

decisions, Types & process of decision making ; Controlling; Organizing: Concept,

Organisation Theories, Forms of Organisational Structure, Combining Jobs:

Departmentation, Span of Control, Delegation of Authority, Authority & Responsibility,

Staffing: Concept, System Approach, Manpower Planning, Job Design, Recruitment &

Selection, Training & Development.

UNIT - III

Organizational structure & Design, Organizational Designs; Emerging Design Options Different Organizational Structures; Organizational Culture (creation and sustenance of cultures)

, Importance of Culture; Managing Culture; High performance culture, Learning

organizations, Orgnaizational climate, Total Quality Management, Techniques of TQM, Re-

engineering, Empowerment, Benchmarking, Downsizing, Controlling: Concept, Types of

Control, Methods: Pre-control: Concurrent Control: Post-control, An Integrated Control

System, Model for Managing Change, Forces for Change, resistance to change,

Management of resistance. Individual Determinants of organizational, Behaviours; Motivation, Motivation and

Performance, Theories Of Motivation, Approaches for Improving Motivation, Pay and Job

Performance, Quality of Work Life, Morale Building, Performance Appraisal, Job Anxiety

& Stress, Analysing, Interpersonal relations, Group Dynamics, Management of

Organizational Conflicts, Management of Change, Leadership Styles & Influence Ethics and

leadership.

TEXT BOOKS

1. Stephen P. Robbins, David & Decenzo, “Fundamentals of Management”, Pearson

Education, 9th Ed. , 2008.

REFERENCE BOOKS

Singh & Chabra, “Organization Theory & Behavior”, Educational & Technical Publisher,2005.

T.N. Chhabra, R. K. Chopra and Archana Despande, “Leading Issues in Management & Organizational Behavior (Text & Cases)”, Sun India Publications, 2009.

Robbins, S. P., Judge, T. A. and Sanghi. S, “Organizational Behavior”, Pearson, 2009.

J. S. Chandan, “Organizational Behavior”, Vikas Publishing House, 2004. Udai Pareek, “Understanding Organizational Behavior”, Oxford University Press 1st

Ed.,2004.

MCA 5th

Semester

SYSTEM & NETWORK ADMINISTRATION







OBJECTIVE:

To Install the Linux operating system, and apply operating system updates, and configuration changes.

To Install and configure new hardware/software

To Manage user accounts

To Perform backups of data

To Assess system security

UNIT – I

N/w Administration: Introduction to networks, TCP/IP model, IP addressing, Subnetting

NAT, VLAN. Basic Concepts of proxy server, web server, DNS, Firewall, Router, Mail

Server and their respective configuration settings. Various Interconnecting Devices; Hub,

Switch, Bridges, Routers, Gateway, repeater, brouter. Knowledge about various network

related commands : ping, netstat, tracert, traceroute, ifconfg, ipconfig etc. Steps followed in

establishing a network.

UNIT - II

Security: Concept of Security, its need, issues, cryptography techniques :ciphers,

substitution cipher, transposition, symmetric key algorithms like AES, DES, public key algo's like RSA, Authentication algorithms IPSEC, VAN, Digital Signatures, IDS, Firewall.

Types of attacks, access control list, filtering rules.

UNIT - III

Host Administration: Introduction to system Administration, what are the necessary issues

to be tackled in host management, installation of Unix, Linux, windows OS, formatting file systems like FAT, NTFS, etc., Booting process in various OS, User accounts, group

accounts, passwords, shadow passwords, directory structure of analysis of host machine and how to improve the systems performance. Unix Commands: Knowledge of UNIX commands, administration based commands, Shell scripting, AWK, Perl.

TEXT BOOKS

The unix programming environment, Brain Kemighen & Rob Pike, Pearson

Education India; 1 edition, 2015.

REFERENCE BOOKS Design of the Unix operating system, AT&T Bell Labs Maurice J. Bach, Pearson

Education India; 1 edition, 2015.

Advanced Unix programmer's Guide, Stephen Prato Bpb publisher, 2008.

Unix Concepts and applications-Featuring SCO Unix and Linux, Sumitabha Das

MCA 5th

Semester

ENTERPRISE RESOURCE PLANNING







OBJECTIVE:

To Improve Service Experience

To Enhance Competitiveness

To Modernize Business Processes and Systems

To Automate Business Solutions

To Increase Operating Efficiency

To Provide Access to Standardized College Data

UNIT – I

ERP: Enterprise Perspective: An Overview, Features of ERP, MIS Integration, ERP drivers,

Trends in ERP, ERP in India. 2. ERP: System Perspective: Management Information

System, Operations Support System, DSS, Transaction Processing System, Network

Structure of ERP System, ERP Work flow, Process modeling for ERP Systems,

Communication in ERP Systems, OLTP, (On Line Transaction Processing), OLAP (On

Line Analytical Processing), Enterprise Integration Application Tools for ERP.

UNIT - II

ERP: Resource Management Perspective: Business Modules in ERP Packages, Finance,

Production, Human Resource, Plant Maintenance, Materials Management, Quality Management, Sales and Distribution, Resource Management, Business Process

Reengineering, Relationship between ERP & BPR, ERP Implementation Life Cycle, Implementation methodology, ERP Project Management & Monitoring.

UNIT - III

ERP: Key Issues: ERP and E,Commerce, ERP Culture, ERP and CRM, ERP and SCM, ERP

Selection Issues, ERP in Public Sector Enterprises, Pre and Post Implementation Issues, ERP Vendors, Key ERP Consultants in India, Future Directions in ERP.

TEXT BOOKS

Alexis, Leon, ERP Demystified. Tata McGraw Hill.

REFERENCE BOOKS

Garg, V.K. and Venket, Krishna, N.K., ERP Concepts and Practices, PHI Publications.

Sadagopan, S. ERP: A Managerial perspective. Tata McGraw Hill. Langenalter, A. Gary, Enterprise Resources Planning and Beyond. St. Lucie

Press, USA.

Imhoff, C. Loftis Lisa & Geiger, G. Jonathan, Building the Customer Centric Enterprise. John Wiley & Sons.

Shankar, Ravi & Jaiswal, S., Enterprise Resource Planning. Galgotia Publications. Diwan, Parag & Sharma, Sunil, Enterprise Resource Planning: Manager‟s Guide.

Excel Books.

MCA 5th Semester SOFTWARE TESTING LAB

L

-

T

-

P 2

Cr

1

External Marks: 30

Internal Marks: 20


List of the Programs not limiting to:

1) Write programs in C language to demonstrate the working of the

following constructs:

i) do...while

ii) while....do

iii) if...else

iv) switch

v) for

2) A program written in C language for Matrix Multiplication fails‖

Introspect the causes for its failure and write down the possible

reasons for its failure.

3) Take any system (e.g. ATM system) and study its system

specifications and report the various bugs.

4) Write the test cases for any known application(e.g. Banking

application)

5) Create a test plan document for any application (e.g. Library

Management System)

6) Study of any testing tool (e.g.Winrunner)

7) Study of any web testing tool (e.g. Selenium)

8) Study of any bug tracking tool (e.g. Bugzilla, bugbit)

9) Study of any test management tool (e.g. Test Director)

10) Study of any open source-testing tool (e.g. Test Link)

Total Marks: 50

MCA 5th Semester ADVANCED WEB TECHNOLOGIES LAB

L

-

T

-

P 2

Cr

1

External Marks: 30

Internal Marks: 20


Total Marks: 50

List of the Programs not limiting to:

1 Create a Web Page using basic tags in html 5

2 Write a program to create all types of list in HTML

3 Create a table using Html 5 and CSS

4 Write a program using labels, radio buttons, and submit buttons

5 Create a simple webpage using HTML

6 Use frames to Include Images and Videos.

7 Add a Cascading Style sheet for designing the web page.

8 Design a web page with validation using JavaScript.

9 How to make all fields of a form mandatory in java script

10 A a Create a registration form and validate it using java script

11 Perform data base connectivity in PHP

12 P Create a dynamic web page using PHP

MCA 5th Semester MINOR PROJECT

L

-

T

-

P 6

Cr

3

External Marks: 30

Internal Marks: 20


Total Marks: 50

(GUIDELINES FOR MINOR PROJECT)

The aim of the Minor Project(s) is to lay a foundation for Major Project to be carried out by the student during 6th Semester of MCA Programme.

Each student should carry out Minor Project(s) using the software development tools/languages/technologies that they have learnt and/or have studied during the concerned semester.

It should be compulsorily done by the student in-house under the supervision of the staff(s) assigned by Head of the Department/Director/Principal.

The Minor Project(s) will be assessed by the concerned supervisor(s) and shall award marks out of 25 for each student as Internal Assessment.

MCA 5th Semester DIGITAL SIGNAL PROCESSING

L

3

T

-

P -

Cr

3

External Marks: 60

Internal Marks: 40


Total Marks: 100




OBJECTIVE:

To study DFT and its computation

To study the design techniques for digital filters

To study the finite word length effects in signal processing

To study the non-parametric methods of power spectrum estimations

To study the fundamentals of digital signal processors.

UNIT – I

DISCRETE FOURIER TRANSFORM: DFT and its properties, Relation between DTFT and DFT, FFT computations using Decimation in time and Decimation in frequency algorithms, Overlap-add and save methods. INFINITE IMPULSE RESPONSE DIGITAL FILTERS: Review of design of analogue Butterworth and Chebyshev Filters, Frequency transformation in analogue domain - Design

of IIR digital filters using impulse invariance technique - Design of digital filters using bilinear transform - pre warping - Realization using direct, cascade and parallel forms.

UNIT – II

FINITE IMPULSE RESPONSE DIGITAL FILTERS:Symmetric and Antisymmetric FIR

filters - Linear phase FIR filters - Design using Hamming, Hanning and Blackmann Windows - Frequency sampling method - Realization of FIR filters - Transversal, Linear

phase and Polyphase structures.

UNIT - III

FINITE WORD LENGTH EFFECTS : Fixed point and floating point number

representations - Comparison - Truncation and Rounding errors - Quantization noise - derivation for quantization noise power - coefficient quantization error - Product

quantization error - Overflow error - Roundoff noise power - limit cycle oscillations due to product roundoff and overflow errors - signal scaling. MULTIRATE SIGNAL PROCESSING: Introduction to Multirate signal processing-Decimation-Interpolation-Polyphase implementation of FIR filters for interpolator and

decimator -Multistage implementation of sampling rate conversion- Design of narrow band filters - Applications of Multirate signal processing.

TEXT BOOK

John G Proakis and Manolakis, " Digital Signal Processing Principles, Algorithms and Applications", Pearson, Fourth Edition, 2007.

REFERENCE BOOKS

E.C. Ifeachor and B.W. Jervis, " Digital signal processing - A practical approach", Second edition, Pearson, 2002.

S.Salivahanan, A. Vallavaraj, C. Gnanapriya, Digital Signal Processing, TMH /McGraw Hill International, 2007

Johny R. Johnson, Introduction to Digital Signal Processing, PHI, 2006.

MCA 5th

Semester

ENTERPRISE COMPUTING IN JAVA







OBJECTIVE:

will learn about J2EE technology and will be able todevelop dynamic websites will explain how Enterprise JavaBeans (EJBs)contain the application's business

logic and business data.

UNIT – I

Introduction to J2EE and building J2EE applications, MVC architecture, Introduction to

servlets and it‟s life cycle , problems with cgi-perl interface , generic and http servlet ,

servlet configuration, various session tracking techniques, servlet context, servlet configuration, servlet colloboration.

UNIT – II

JSP Basics and Architecture: JSP directives, Scripting elements, standard actions, implicit objects, jsp design strategies. Struts: Introduction of Struts and its architecture, advantages and application of Struts.

UNIT - III

EJB fundamentals: Motivation for EJB, EJB Echo system, J2EE technologies, Enterprise beans and types, distributed objects and middleware, developing EJB components, remote local and home interface, bean class and deployment descriptor. Introducing session beans: Session beans life time, statefull and Stateless session beans beans, lifecycle of session beans. Introducing Entity beans: persistence concepts, features of entitiy beans , entity context, Introduction to JMS & Message driven beans.

TEXT BOOK

Ed Roman, Scott W Ambler, Tyler Jewell, “Mastering Enterprise Java Beans”,

Wiley, 2nd

Ed., 2005.

REFERENCE BOOKS

Ted Neward, “Effective Enterprise Java”, Eddison -Wesley, 2004.

Jim Farley, William Crawford, “ Java Enterprise in a Nutshell”, O‟Reilly and

Associates, 3rd Ed.

Subrahamanyam Allamaraju, Cedric Buest, “Professional Java Server

Programming, J2EE, Apress, 1.3 Ed., 2005. Austin Sincock , “Enterprise Java for SAP” , A Press Publications.

Joe Wigglesworth and McMilan Paula, “Java Programming: Advanced Topic”,

Thomson, 3rd Ed., 2003.

MCA 5th

Semester

DISTRIBUTED DBMS AND OBJECT ORIENTED DATABASES







OBJECTIVE:

to design and implementation issues in distributed database systems to give knowledge about Distributed database design, Distributed query processing,

Distributed query optimization, Distributed transaction management to provide knowledge about Distributed concurrency control, Distributed reliability

protocols and Multidatabase systems.

UNIT – I

Distributed DBMS features and needs, Reference Architecture, Levels of Distribution

Transparency, Replication, Distributed database design – Fragmentation, allocation criteria, Storage mechanisms, Translation of Global Queries / Global Query Optimization, Query

Execution and access plan.

UNIT – II

Concurrency control – 2 phase locks, distributed deadlocks, time based and quorum based protocols, comparison reliability – non-blocking commitment protocols, Partitioned networks, Check points and Cold starts. Management of Distributed Transactions – 2 phase unit protocols, Architectural aspects, Node and link failure recoveries, Distributed data dictionary management, Distributed database administration.

UNIT - III

Heterogeneous database-federated database, reference architecture, loosely and tightly coupled, Alternative architectures, Development tasks, operation – global task management,

Client server databases – SQL server, Open database connectivity, Constructing an Application. Advance Database Concept: Object Oriented Databases Introduction, Advantages and Disadvantages, Spatial Databases, Multimedia Databases, Deductive Databases, Temporal Databases.

TEXT BOOK

M. Tamer Ozsu, Patrick Valduriez, “Principles of Distributed Databases System”,

Pearson, 2nd Ed., 2009.

REFERENCE BOOKS

Lin Wujuan, Veeravalli Bhardwaj, “Object Management is Distributed Database Systems”, Kluwer Academic Publishes, UK, 2003.

V. K. Jain, “Advanced DBMS”, Cyber Tech Publications. Shivendra Goel, Divya Goel, “ Distributed Database Management System”, Sun

India Publications, 2009. Chhanda Ray, “Distributed Database System”, Pearson, 2009.

MCA 5th

Semester

IT NETWORK SECURITY







OBJECTIVE:

Describe various communications networks and their main components.

Identify the advantages and disadvantages of a network.

Define the terminology associated with computer networks.

Identify the components associated with computer networks.

Develop a networking plan for yourself or a client.

UNIT I INTRODUCTION

Security Mechanisms - Security Services - Security Attacks - Model for Network Security -

Classical Ciphers.

UNIT II CRYPTOGRAPHIC ALGORITHMS

Number Theory - Modern Block Ciphers: DES, 3DES, AES, Blowfish, IDEA, CAST-128 -

Stream Cipher - Public Key Cryptography : RSA, Diffie-Hellman, Elgamal, ECC.

UNIT III INTRUSION DETECTION SYSTEM

Architecture - Types - Soft Computing and data mining techniques for the design of

IDSSNORT.

UNIT IV FIREWALL AND TRUSTED SYSTEMS

Virus - Worms - Firewall Design Principles: Firewall Characteristics -Types of Firewalls

Firewall Configurations - Trusted Systems-Data Access Control - Trusted systems -Trojan Horse

Defense, SEIM & LOGS, Basic concepts - Types - MIB - Log formats - Mobile transaction Logs

- Log tools

TEXT BOOKS

1. Industrial Network Security: Securing Critical Infrastructure Networks by Eric D.

Knapp and Joel Thomas Langill, 2nd

Edition, 2014

REFERENCE BOOKS

1. William Stallings, "Cryptography and Network Security" , 5th Ed., Pearson, 2010.

2. Bruce Schneir, "Applied cryptography", 2nd Ed., , John Wiley, 1996.

3. Jacob Babin et.al., "Security in Log Management",Syngress, 2006

https://www.amazon.com/Industrial-Network-Security-Securing-Infrastructure/dp/0124201148/ref=sr_1_8?keywords=network+security+books&qid=1563441666&s=books&sr=1-8

https://www.amazon.com/Eric-D-Knapp/e/B002BLVG0Y?ref=sr_ntt_srch_lnk_8&qid=1563441666&sr=1-8

https://www.amazon.com/Eric-D-Knapp/e/B002BLVG0Y?ref=sr_ntt_srch_lnk_8&qid=1563441666&sr=1-8

MCA 5th

Semester

IT SYSTEM SECURITY







OBJECTIVE:

In information security, integrity means maintaining and assuring accuracy and completion of

data over its entire life-cycle.

It means that changes can be done only by authorized entities and only through authorized

mechanism.

Securing integrity of data is extremely important.

UNIT- I Basics of computer security

Overview o Definition of terms Security goals, Shortcomings, Attack and defense, Encryption

and cryptography, Ciphers and codes, Public key algorithms, Key distribution, Digital signature,

Pretty good privacy

UNIT- II Software security & Database security Malicious code, Worms, Intruders, Error detection and correction

OS protection policies, Integrity constraints, Multi phase commit protocols

UNIT-III Trusted systems & Network security Memory protection, Access control matrix, User authentication, Security models, Disaster

recovery, Threats in networks, Privacy enhanced email, DS authentication

UNIT-IV Web and electronic commerce Threats on the web, Secure socket layer, Client-side certificates, Applet security model

Security policy: case study

TEXT BOOKS

1. Certified Information Systems Security Professional Official Study Guide, Mike

Chapple,2nd

edition, 2018

REFERENCE BOOK

1. Network and System Security,2nd Edition by John Vacca, 2016

2. Computer System Security: Basic Concepts and Solved Exercises by Gildas Avoine,

Philippe Oechslin, Pascal Junod, 2007

3. Security Requirements Engineering: A Framework for Representation and

Analysis. Charles Haley, Robin Laney, Jonathan Moffett, and Bashar Nuseibeh. IEEE

Transactions on Software Engineering, 34(1):133-153, Jan. 2008

https://www.amazon.com/Mike-Chapple/e/B001IO9T6I/ref=dp_byline_cont_book_1

https://www.amazon.com/Mike-Chapple/e/B001IO9T6I/ref=dp_byline_cont_book_1

http://oro.open.ac.uk/10058

http://oro.open.ac.uk/10058

MCA 5th

Semester

INFORMATION SECURITY FUNDAMENTALS







OBJECTIVE

Protect the company and its assets.

Manage Risks by Identifying assets, discovering threats and estimating the risk

Provide direction for security activities by framing of information security policies,

procedures, standards, guidelines and baselines

Information Classification & Security Organization

Unit -1: The Security Problem in Computing:

The meaning of computer Security, Computer Criminals, Methods of Defense, Elementary

Cryptography: Substitution Ciphers, Transpositions, Making “Good” Encryption algorithms, The

Data Encryption Standard, The AES Encryption Algorithms, Public Key Encryptions, Uses of

Encryption.

Unit- II: Program Security:

Secure Programs, Nonmalicious Program Errors, viruses and other malicious code, Targeted

Malicious code, controls Against Program Threats, Protection in General- Purpose operating

system protected objects and methods of protection memory and addmens protection, File

protection Mechanisms, User Authentication Designing Trusted O.S: Security polices, models of

security, trusted O.S design, Assurance in trusted O.S. Implementation examples.

Unit- III: Data base Security:

Security requirements, Reliability and integrity, Sensitive data, Inference, multilevel database,

proposals for multilevel security. Security in Network: Threats in Network, Network Security

Controls, Firewalls, Intrusion Detection Systems, Secure E-Mail.

Unit- IV: Administering Security:

Security Planning, Risk Analysis, Organizational Security policies, Physical Security. Legal

Privacy and Ethical Issues in Computer Security: Protecting Programs and data, Information and

the law, Rights of Employees and Employers, Software failures, Computer Crime, Praia, Ethical

issues in Computer Security, case studies of Ethics.

TEXT BOOKS

1. Fundamentals of Information Systems Security by David Kim,3rd

Edition 2016

REFERENCE BOOKS

1. Information Security Fundamentals, by Thomas R. Peltier,2nd

Edition, 2014

2. The Basics of Information Security: Understanding the Fundamentals of Info Sec by

Jason Andress,2nd

edition, 2014

https://www.amazon.com/Basics-Information-Security-Understanding-Fundamentals/dp/0128007443/ref=sr_1_fkmr0_2?keywords=1.+Information+Security+Fundamentals%2C+Second+Edition+by+Thomas+R.+Peltier+books&qid=1563442981&s=books&sr=1-2-fkmr0

MCA 5th

Semester

ETHICAL HACKING







OBJECTIVE:

In this process, if the penetration testing is successful, the owner of the system will end up with a

more secure computer system or network system. After all the penetration testing is completed,

the ethical hacker, the one who’s doing the legal hacking, will recommend security solutions and

may even help implement them.

Unit-I Introduction to Ethical Hacking Introduction, Networking & Basics, Foot Printing, Google Hacking, Scanning, Windows

Hacking, Linux Hacking, Trojans & Backdoors, Virus & Worms, Proxy & Packet Filtering,

Denial of Service, Sniffer, Social Engineering,

Unit-II Fundamentals of Hacking

Cryptography, Wireless Hacking, Firewall & Honeypots, IDS & IPS, Vulnerability, Penetration

Testing, Session Hijacking, Hacking Web Servers, SQL Injection, Cross Site Scripting, Exploit

Writing, Buffer Overflow, Reverse Engineering, Email Hacking, Incident Handling & Response,

Bluetooth Hacking, Mobiles Phone Hacking

Unit-III Fundamentals of Computer Fraud & Ethical issues

Threat concepts – Framework for predicting inside attacks –

Managing the threat – Strategic Planning Process. Architecture strategies for computer fraud

prevention – Protection of Web sites – Intrusion detection system – NIDS, HIDS – Penetrating

testing process – Web Services – Reducing transaction risks. professional and ethical issues

likely to face the domain of ethical hacking. ethical responsibilities, professional integrity and

making appropriate use of the tools and techniques associated with ethical hacking

TEXT BOOKS

1. Hands-On Ethical Hacking and Network Defense by Michael T. Simpson, Kent

Backman, James Corley,2016.

REFERENCE BOOKS

1. Official Certified Ethical Hacker Review Guide – By Steven DeFino, Barry Kaufman,

Nick Valenteen, 2012

The Basics of Hacking and Penetration Testing: Ethical Hacking and Penetration Testing

Made Easy (Syngress Basics Series),2013

MCA 5th

Semester

CYBER SECURITY







OBJECTIVE:

Respond to, resolve, and recover from cyber incidents and attacks through timely

information sharing, collaboration, and action

Establish a legal and regulatory framework to enable a safe and vibrant cyberspace

Foster a culture of cyber security that promotes safe and appropriate use of cyberspace

Develop and cultivate national cyber security capabilities

Unit-I The Security Environment: Threats, vulnerabilities, and consequences, Advanced persistent threats, The state of security

today. Principles of Cybersecurity: The interrelated components of the computing environment,

Cybersecurity Management Concepts: Security governance, Management models, roles, and

functions.

Unit-II Security Plans and Policies: Levels of planning Planning misalignment, The System Security Plan (SSP), Policy

development and implementation. Security Standards and Controls, Certification and

accreditation (C&A). Risk Management : Principles of risk, Types of risk, Risk strategies, The

Risk Management Framework.

Unit-III Issues in Cyber Security: Private ordering solutions, Regulation and Jurisdiction for global Cyber security, Copy Right-

source of risks, Pirates, Internet Infringement, Fair Use, postings, criminal liability, First

Amendments, Data Loss. Legal Aspects of Cyber Security : Ethics, Legal Developments, Cyber

security in Society, Security in cyber laws.

TEXT BOOKS 1. Cyber security Essentials by by Charles J. Brooks, Christopher Grow, et al, 2018

REFERENCES BOOKS

1. Cyber security – Attack and Defense Strategies by Yuri Diogenes, 2018

2. Jonathan Rosenoer,“Cyber Law: The law of the Internet”, Springer-Verlag, 1997.

3. Mark F Grady, Fransesco Parisi, “The Law and Economics of Cyber Security”,

Cambridge University Press, 2006.

https://www.amazon.com/Cybersecurity-Essentials-Charles-J-Brooks/dp/1119362393/ref=sr_1_1?keywords=cybersecurity+books&qid=1563443748&s=books&sr=1-1

Scheme of Examination and Syllabus for Master of Computer ...

Documents

Transcript of Scheme of Examination and Syllabus for Master of Computer ...