Scheme & Syllabus for

MASTER OF COMPUTER APPLICATIONS

DEPARTMENT OF MASTER OF COMPUTER APPLICATIONS

2023-25
 MCA (Master of Computer Applications) : 2023-25

Vision

Equipping students with computing and programming domain expertise with the state
of the art technology solutions to enable them to meet global professional challenges.

Mission

The department strives to create a conducive environment equipping students to work

in teams and have
• Professional Ethics
• Sound Technical Knowledge
• Skills to Handle Technological Challenges

2
Department of Master of Computer Applications
 MCA (Master of Computer Applications) : 2023-25

Off-Campus Centre, Nitte - 574 110, Karkala

Established under Section 3 of UGC Act 1956
Accredited with ‘A+’ Grade by NAAC

Program Educational Objectives

PEO1 To think critically, work creatively, communicate effectively, and become
technologically competent.
PEO2 To be able to update themselves in areas and technologies relevant to their career.
PEO3 To function in supportive/ leadership roles with ethical responsibilities and high regard
towards societal needs.
PEO4 To develop team work ability, lead initiatives and manage task effectively.
Program Outcomes
PO1 Ability to apply knowledge of mathematics, science and engineering.
PO2 Identify, formulate, research literature, and analyze complex engineering problems.
PO3 Ability to design a system, component or processes to meet desired needs within
realistic constraints such as economic, environmental, social, political, ethical, health
and safety, manufacturability and sustainability.
PO4 Ability to design and conduct experiments, as well as analyze and interpret data.
PO5 Apply appropriate techniques, resources, and modern engineering and IT tools to
complex engineering activities.
PO6 Knowledge to assess societal, health, safety, legal, and cultural issues.
PO7 The broad education necessary to understand the impact of engineering solutions in
global, economic environmental and societal context.
PO8 Understanding of professional and ethical responsibility.
PO9 Ability to function effectively as an individual/member/leader in multidisciplinary
teams.
PO10 Ability to communicate effectively.
PO11 Recognition of the need for and an ability to engage in lifelong learning.
PO12 A knowledge of contemporary issues.
Program Specific Outcomes
PSO1 To empower the students to exemplify themselves in the field of Information
Technology ensuring credibility, integrity and ethical standards.
PSO2 Adopt research practices and trending technologies such as Artificial Intelligence
and Machine Learning, Internet of Things, Cloud Computing and Data Analytics to
solve real world problems.

3
Department of Master of Computer Applications
 MCA (Master of Computer Applications) : 2023-25

Master of Computer Applications

CREDIT DISTRIBUTION

Sl. No. Category Minimum Credits to be earned

for the MCA degree
1 Core Subjects 57 (43 +14 Lab)
2 Elective Subjects 15
3 Research Methodology and Publication Ethics 02
4 Seminar 01
5 Mini Project 04
6 Internship 03
7 Major Project 18
Total Credits to be earned 100

4
Department of Master of Computer Applications
 MCA (Master of Computer Applications) : 2023-25

I SEMESTER MCA

1. 22MCA101 - Data Structures with Algorithms - 04 Credits

2. 22MCA102 - Advanced Database Systems - 04 Credits
3. 22MCA103 - Computer Organization and Architecture - 04 Credits
4. 22MCA104 - Mathematical Foundation for Computer Applications - 04 Credits
5. 22MCA105 - Software Engineering and Testing - 04 Credits
6. 22MCA106 - Research Methodology and Publication Ethics - 02 Credits
7. 22MCA107 - Data Structures with Algorithms Lab - 02 Credits
8. 22MCA108 - Advanced Database Systems Lab - 02 Credits
9. 22MCA109 - Fundamentals of Programming – Bridge Course - 00 Credits

Total Credits - 26 Credits

II Semester MCA

1. 22MCA201 - Data Communication and Networks - 03 Credits

2. 22MCA202 - Enterprise Java - 03 Credits
3. 22MCA203 - Operating Systems with UNIX - 03 Credits
4. 22MCA204 - Data Warehousing and Data Mining - 04 Credits
5. 22MCA205 - Professional Communication and Ethics - 02 Credits
6. 22MCA21X - Elective – I - 03 Credits
7. 22MCA22X - Elective – II - 03 Credits
8. 22MCA206 - Data Communication and Networks Lab - 02 Credits
9. 22MCA207 - Enterprise Java Lab - 02 Credits
10. 22MCA208 - Operating Systems with UNIX Lab - 02 Credits
11. 22MCA209 - Technical Seminar and Report Writing - 01 Credits

Total Credits - 28 Credits

Electives :

Elective Group – I Elective Group – II

22MCA211 - Digital Image Processing & Pattern 22MCA221 - E-Commerce
Recognition
22MCA212 - Environmental Studies and Green IT 22MCA222 - Health Care Analytics
22MCA213 - Soft Computing 22MCA223 - Accountancy and Financial
Management
22MCA214 - Parallel Processing 22MCA224 - Bioinformatics
22MCA215 - Distributed Computing 22MCA225 - .NET Framework and C#

5
Department of Master of Computer Applications
 MCA (Master of Computer Applications) : 2023-25

III SEMESTER MCA

1. 22MCA301 - Artificial Intelligence and Machine Learning - 04 Credits

2. 22MCA302 - Advanced Web Technologies - 04 Credits
3. 22MCA33X - Elective – III - 03 Credits
4. 22MCA34X - Elective – IV - 03 Credits
5. 22MCA35X - Elective – V - 03 Credits
6. 22MCA303 - Artificial Intelligence and Machine Learning Lab - 02 Credits
7. 22MCA304 - Advanced Web Technologies Lab - 02 Credits
8. 22MCA305 - Mini Project Lab - 04 Credits

Total Credits - 25 Credits

Electives :

Elective Group – III Elective Group – IV Elective Group – V

22MCA331 - Mobile Computing & 22MCA341 - Cyber Forensics 22MCA351 - Management
Application Development Information Systems
22MCA332 - Digital and Social Media 22MCA342 - Network and Cyber 22MCA352 - Time Series
Marketing Security Analysis and Prediction
22MCA333 - Software Risk Identification 22MCA343 - Block Chain 22MCA353 - Cloud Computing and
And Management Technology Big Data Analytics
22MCA334 - Industrial and Medical IOT 22MCA344 - Quantum Information 22MCA354 - Natural Language
and Cryptography Processing

IV SEMESTER MCA

1. 22MCA401 - Internship - 03 Credits

2. 22MCA402 - Major Project - 18 Credits

Total Credits - 21 Credits

6
Department of Master of Computer Applications
 MCA (Master of Computer Applications) : 2023-25

MCA : Scheme of Teaching and Examinations 2023-25

Outcome Based Education (OBE) and Choice Based Credit System (CBCS)
(Effective from the academic year 2022-23)

I Semester MCA - Scheme

Teachi
Contact
Marks
Sl. Course ng Hour/week SEE
Code Subject Depart
Credits
No Type L T P CIE SEE Hours
ment

Data Structures with

1 PCC 22MCA101 MCA 3 1 0 50 50 03 04
Algorithms

Advanced Database
2 PCC 22MCA102 MCA 3 1 0 50 50 03 04
Systems
Computer
3 PCC 22MCA103 Organization and MCA 3 1 0 50 50 03 04
Architecture
Mathematical
Foundation for
4 PCC 22MCA104 MCA 3 1 0 50 50 03 04
Computer
Applications
Software Engineering
5 PCC 22MCA105 MCA 3 1 0 50 50 03 04
and Testing
Research
6 PCC 22MCA106 Methodology and MCA 2 0 0 50 50 03 02
Publication Ethics
Data Structures with
6 PCC 22MCA107 MCA 0 0 4 50 50 03 02
Algorithms Lab
Advanced Database
7 PCC 22MCA108 MCA 0 0 4 50 50 03 02
Systems Lab
Fundamentals of
8 PCC 22MCA109 Programming - Bridge MCA 0 0 4 -- -- -- 00
Course
Total 17 05 12 400 400 24 26

7
Department of Master of Computer Applications
 MCA (Master of Computer Applications) : 2023-25

II Semester MCA – Scheme

Contact
Teachi Marks
Sl. Course ng Hours/week SEE
Code Subject Depart
Credits
No Type Hours
ment L T P CIE SEE

Data Communication and

1 PCC 22MCA201 MCA 3 0 0 50 50 03 03
Networks

2 PCC 22MCA202 Enterprise Java MCA 3 0 0 50 50 03 03

Operating Systems with

3 PCC 22MCA203 MCA 3 0 0 50 50 03 03
UNIX
Data Warehousing and Data
4 PCC 22MCA204 MCA 3 1 0 50 50 03 04
Mining
Professional
5 PCC 22MCA205 MCA 1 1 0 50 50 03 02
Communication and Ethics
6 PCE 22MCA21X Elective - I MCA 3 0 0 50 50 03 03

7 PCE 22MCA22X Elective - II MCA 3 0 0 50 50 03 03

Data Communication and
8 PCC 22MCA206 MCA 0 0 4 50 50 03 02
Networks Lab
9 PCC 22MCA207 Enterprise Java Lab MCA 0 0 4 50 50 03 02
Operating Systems with
10 PCC 22MCA208 MCA 0 0 4 50 50 03 02
UNIX Lab
PCC 22MCA209 Technical Seminar and MCA 0 0 2 50 -- -- 01
11
Report Writing
Total 19 02 14 550 500 30 28

8
Department of Master of Computer Applications
 MCA (Master of Computer Applications) : 2023-25

III Semester MCA - Scheme

Contact
Teaching Marks
Sl. Course Hours/week SEE
Code Subject Departm Credits
No type ent Hours
L T P CIE SEE

1 PCC 22MCA301 Artificial Intelligence MCA 3 1 0 50 50 03 04

and Machine Learning

2 Advanced Web 3 1 0 50 50 03 04
PCC 22MCA302 MCA
Technologies

3 PCE 22MCA33X Elective – III MCA 3 0 0 50 50 03 03

4 PCE 22MCA34X Elective – IV MCA 3 0 0 50 50 03 03

5 PCE 22MCA35X Elective – V MCA 3 0 0 50 50 03 03

Artificial Intelligence
6 PCC 22MCA303 and Machine Learning MCA 0 0 4 50 50 03 02
Lab
7 PCC 22MCA304 Advanced Web 0 0 4 50 50 03 02
MCA
Technologies Lab
8 PCC 22MCA305 Mini Project MCA 0 0 4+9* 50 50 03 04

Total 15 02 21 400 400 24 25

* Self Learning

IV Semester MCA – Scheme

Contact SEE Marks Credits

Sl.
Code Subject Hours/week CIE Marks
No.
Evaluation Viva-Voce

1 22MCA401 Internship Full Time 50 -- 50 03

2 22MCA402 Major Project Full Time 100 100 100 18

Note: PCC: Professional Core Course, PEC: Professional Elective Course

L –Lecture, T – Tutorial, P- Practical
CIE: Continuous Internal Evaluation
SEE: Semester End Examination.

9
Department of Master of Computer Applications
 Syllabus of I Semester MCA (Master of Computer Applications)

Data Structures with Algorithms

Course Code: 22MCA101 Course Type PCC
Teaching Hours/Week (L: T: P: S) 3:1:0:0 Credits 04
Total Teaching Hours 52 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications

Prerequisites :
Student must have basic knowledge of C programming.
Course Objectives:
1. Understand the concept of Data structures and ADT. Implement the Stack data structures.
2. Study and implement the concept of Recursion. Implement the Queue data structures.
3. Study the concept of Linked lists and implement. Understand the Implementation of Stack
and Queue data structures dynamically using linked lists.
4. Learn the complexity of the algorithms and analyze the algorithms. Understand the
Implementation of Tree Data structures.
5. Implement and Illustrate various Sorting and Searching Techniques. Define and implement
Graph Data Structures.
UNIT - I
Introduction : 06 Hours
Introduction to data structure, Abstract data type, Overview of C: Data types in C,
Arrays, Structures and Pointers.

Stacks : 04 Hours
Definition and Primitive operations, Representing and implementing stacks in C,
Applications of stacks: Evaluating a postfix expression, converting an expression from
infix to postfix.

UNIT - II
Recursion : 06 Hours
Recursion: definition and processes, Implementation of recursion program in C,
Examples (Factorial function, Multiplication of natural numbers, Fibonacci sequence,
Binary search, Towers of Hanoi problem).

Queues : 04 Hours
Definition and Primitive operations, C implementation of ordinary queues and circular
queues.

UNIT - III
Lists : 10 Hours
Introduction to Linked lists, Types of linked lists, C implementation of Singly Linked
Lists, Doubly linked lists, Circular lists, Stacks and Queues.

10
Department of Master of Computer Applications
 UNIT - IV
Analysis of Algorithm : 05 Hours
Introduction, Fundamentals of the Analysis of Algorithm Efficiency Notion of
Algorithm, Fundamentals of Algorithmic Problem Solving, Analysis Framework,
Asymptotic Notations and Basic efficiency classes, Mathematical analysis of Recursive
and Non-recursive algorithms.

Binary trees : 05 Hours

Operations on binary trees, Applications of binary trees. Binary tree representation:
Node representation of binary tree, Array representation of binary trees, Binary tree
traversals and related properties, Threaded binary trees.

UNIT - V
Sorting : 04 Hours
Brute Force: Selection Sort and Bubble Sort. Divide-and-Conquer Mergesort,
Quicksort, Decrease-and-Conquer Insertion Sort, Shell sort.

Searching : 03 Hours
Sequential searching, Indexed sequential search, Binary search, Binary Tree Search.

Graphs : 05 Hours
Definitions, Application of graphs, C representation of graphs, Graph traversals, Depth
First and Breadth First Search, Topological sorting. Greedy Technique Prim’s
Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm.

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

1. Understand and demonstrate the concepts of Data Structures and ADT. Implement the
Stack Data Structures statically and demonstrate the applications.
2. Implement the Recursion Techniques. Understand and Implement the Queue Data
Structures statically.
3. Understand the concept of Linked lists and implement. Discuss the Implementation of
Stack and Queue data structures dynamically.
4. Discuss the complexity of the algorithms and analyze the algorithms. Implement Tree
Data structures.
5. Implement and Illustrate various Sorting and Searching Techniques. Describe and
Implement Graph Data Structures.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓Course Outcomes 1 2
22MCA101.1 3 3 3 3 2 3 3 2 3 3 3 2
22MCA101.2 3 3 2 2 3 3 3 3 3 2 3 2
22MCA101.3 3 3 2 2 3 3 3 3 3 2 3 2
22MCA101.4 3 3 3 3 2 3 3 3 3 3 3 2
22MCA101.5 3 3 3 3 2 3 3 3 3 3 3 2
1: Low 2: Medium 3: High

11
Department of Master of Computer Applications
TEXT BOOKS:
1. Yedidyah Langsam and Moshe J Augenstein and Aaron M Tenanbaum: Data Structures
using C and C++, Second Edition, Pearson Education Asia, 2002.
2. Jean-Paul Tremblay: An Introduction to Data Structures with applications, Tata McGRAW
Hill
3. Introduction to the Design and Analysis of Algorithms. Anany Levitin, Pearson
Education, 2nd Edition.
4. Horowitz E., Sahani S., Rajashekharan S: Computer Algorithm, Galgotia Publications.
REFERENCE BOOKS:
1. Robert L Kruse : Data Structures and Program Design , Third Edition, Prentice – Hall of
India.
2. Mark Allen Weiss : Data Structures and Algorithm Analysis in C, Second Edition, Pearson
Education Asia, 1997.
3. Richard F Giberg and Behrouz A Forouzan : Data Structures - A Pseudocode Approach with
C, Third Reprint, Thomson Course Technology, 2005.
4. A.M. Padma Reddy : Systematic Approach to Data structures (with C), Seventh Edition
2007.
5. Coreman T.H., Leiserson C.E., and Rivest R.L.: Introduction to algorithms, PHI.

12
Department of Master of Computer Applications
 Syllabus of I Semester MCA (Master of Computer Applications)

Advanced Database Systems

Course Code: 22MCA102 Course Type PCC
Teaching Hours/Week (L: T: P: S) 3:1:0:0 Credits 04
Total Teaching Hours 52 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Prerequisites :

Student must have basic knowledge of computer system- hardware/software and File Programming.

Course Objectives:
1. Understand the importance of database management systems and have thorough
understanding of terminologies used
2. Implement concepts of relational model using SQL.
3. Use the features of PL/SQL to write procedural programs
4. Design the databases and to use different levels of normalization
5. Understand the working of NoSQL, Mongodb, its features.
UNIT - I
Introduction to Database and Entity-Relationship Model : 10 Hours
Introduction, Characteristics of Database approach, Advantages and Implications of
using DBMS approach, Disadvantages of DBMS. Data Models, Entity Types, Entity
Sets, Attributes and Keys, Relationship types, Relationship Sets, Roles and Structural
Constraints, Weak Entity Types, Refining the ER Design.
UNIT - II
SQL- The Relational Database Standard : 12 Hours
SQL Data Definition and Data Types, Specifying basic constraints in SQL, statements
in SQL, Aggregate functions, Complex SQL Queries. Sub-queries and co-related sub-
queries, Joins and Views in SQL.
UNIT - III
Introduction to PL/SQL : 10 Hours
Introduction, The PL/SQL execution environment, The PL/SQL syntax and block
structure. Locks, Cursors, Error handling, Stored procedures, Database Triggers.
UNIT - IV
Relational Database Design : 07 Hours
Informal Design Guidelines for Relation Schema's, Functional Dependencies, Normal
Forms, Closure sets, Decomposition.
Transaction Processing : 03 Hours
Introduction to Transaction Processing, Transaction States, Desirable Properties of
Transactions.
UNIT - V
Introduction to NoSQL : 03 Hours
Where it is used, Types of NoSQL databases, Why NoSQL, Advantages of NoSQL,
Use of NoSQL in industry, SQL versus NoSQL,Comparison of SQL NoSQL
NewSQL.

13
Department of Master of Computer Applications
Introduction to MongoDB : 07 Hours
What is MongoDB? Why MongoDB? Using JSON, Creating or generating unique
key, Support for dynamic queries, Storing binary data, Terms used in RDMS and
MongoDB, Data types in MongoDB, MongoDB Query Language: Insert method,
Save method, Update method, Remove method, Find method, Dealing with Null
values, Count, Limit, Sort, Skip, Arrays, Aggregate Functions.
Course Outcomes : At the end of the course student will be able to
1. Get familiarize with fundamentals of database system, its terminologies and ER modeling.
2. Acquire knowledge on SQL and to be able to write SQL queries
3. Learn the syntax of procedural database language PL/SQL and to be able to write
procedural programs
4. Learn database design guidelines and applying normalization at different levels to
accomplish the same.
5. Understand the importance of NoSQL and the features of MongoDB to handle data.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓Course Outcomes 1 2
22MCA102.1 3 3 3 3 3
22MCA102.2 3 3 2 3 3
22MCA102.3 3 2 2 3 3
22MCA102.4 3 2 2 2 3
22MCA102.5 3 3 3 3 3
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Elmasri and Navathe: Fundamentals of Database Systems, Seventh Edition 2016
2. Ivan Bayross : Commercial Application Development using Oracle Developer 2000
3. Seema Acharya, Subhashini Chellappan, “Big Data Analytics”, 1st Edition, Wiley, 2015
4. Raghu Ramakrishnan and Johannes Gehrke : Database Management Systems, Sixth
Edition, Mcgraw-Hill
REFERENCE BOOKS:
1. Silberscchatz, Korth and Sudarshan: Database Systems Concepts, Sixth Edition, McGraw-
Hill
2. Alexis Leon, Mathews Leon: Database Management Systems, Vikas Publishing House
3. Connolly: Database Systems: A practical approach to design implementation and
management, Third edition, Person Education
E Books / MOOCs/ NPTEL
1. NOC : Fundamentals of Database Systems(Course sponsored by Aricent), IIT Kanpur, Dr.
Arnab Bhattacharya
https://nptel.ac.in/courses/106104135
2. Oracle PL/SQL Language Pocket Reference, 5th Edition: A Guide to Oracle's PL/SQL
Language Fundamentals
https://www.pdfdrive.com/oracle-plsql-language-pocket-reference-5th-edition-a-guide-to-
oracles-plsql-language-fundamentals-d167357800.html

14
Department of Master of Computer Applications
 Syllabus of I Semester MCA (Master of Computer Applications)

Computer Organization and Architecture

Course Code: 22MCA103 Course Type PCC
Teaching Hours/Week (L:T:P: S) 3:1:0:0 Credits 04
Total Teaching Hours 52 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Prerequisites :

Student must have some basic knowledge of computer hardware and basic mathematics.

Course Objectives:
1.
To understand the basics of number systems, conversion and logic gates
2.
To demonstrate proficiency in using Karnaugh maps for simplifying Boolean expressions and
applying tabulation methods, as well as understanding the functionality and application of
various data processing circuits.
3.
To develop a thorough understanding of arithmetic circuits and the arithmetic unit.
4. To develop a comprehensive understanding of machine instructions, memory operations,
addressing modes, and subroutines.
5. To understand the organization and functionality of Input/Output (I/O) devices, interrupts,
and memory systems.
UNIT - I
Number Systems and Digital Logic and Combinational Logic Gates 2 Hours
Number Systems: Binary, Octal and Hexadecimal number systems. Conversion
between Decimal, Binary and Hexadecimal number systems, Binary Coded
Decimal.
Digital Logic 3 Hours
Overview of Basic Gates and Universal Logic Gates, Realization of Boolean
expressions using basic and universal gates, Exclusive OR Gate, Exclusive
NOR Gate, Positive and Negative Logic.
Combinational Logic Gates 4 Hours
Boolean Laws and Theorems, Demorgan’s theorem, Simplifying Boolean
Expression using Boolean postulates, Sum-of-Products Method, Product-of-sums
method,Product-of-sums simplification.
UNIT -II
Karnaugh Simplification 06 Hours
Karnaugh Maps with Two, Three, Four, Five, Six Variables. Don't care conditions,
Tabulation method.
Data Processing Circuits: 06 Hours
Multiplexers, Demultiplexers, Decoders, BCD to Decimal Decoders, Seven Segment
Decoders, Encoders, Parity Generators and Checkers, Magnitude Comparator.
UNIT - III
Arithmetic Circuits and Arithmetic Unit 6 Hours
Binary Addition, Binary Subtraction, Unsigned Binary Numbers, Sign-Magnitude
15
Department of Master of Computer Applications
Numbers, 2’s Complement representation, Arithmetic building blocks, Parallel
Adders/Subtractors, Adder-Subtractor, Fast Adder.
Binary Multiplication, Multiplication of Positive Numbers, Binary Multipliers, Signed- 6 Hours
Operand Multiplication, Fast Multiplication, Integer Division, Floating-Point Numbers
& Operations.
Unit - IV
Machine Instruction and Programs 09 Hours
Basic operational concepts on machine instruction, Memory Location and Addresses,
Memory Operations; Instructions & Instruction Sequencing; Addressing Modes, Stacks
and Queues, Subroutines, Subroutine nesting and processor stack, parameter passing.
Unit - V
Input/Output Organization Accessing I/O 5 Hours
Devices, Interrupts, Interrupt Hardware, Enabling and Disabling Interrupts, Exceptions,
Handling Multiple Devices, Controlling Device Requests, Buses, Direct Memory
Access.
Memory System: 5 Hours
Semiconductor RAM Memories, Read-Only Memories, Cache Memories - Mapping
Functions.

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

1. Convert the number from one numbering system to another and realize the logic expression using
Basic/ universal gates.
2. Demonstrate proficiency in using Karnaugh maps for simplifying Boolean expressions and
applying tabulation methods, as well as understanding the functionality and application of various
data processing circuits, such as multiplexers, decoders, encoders, and comparators.
3. To represent numbers in 2’s complement andperform addition and subtraction of binary, binary
multiplication, division, and analyze and design logic circuits for Adders, Subtractors and Fast
Adders.
4. Analyze and interpret machine instructions, memory operations, addressing modes, and
subroutines to effectively write the programs.
5. Demonstrate a comprehensive understanding of the organization and functionality of
input/output (I/O) devices, interrupts, memory systems, and their interactions in a computer
system.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO1 PSO2
↓ Course Outcomes
22MCA103.1 3 2 3 2 2 2 3
22MCA103.2 2 2 3 2 2 2 3
22MCA103.3 2 2 3 2 2 2 3
22MCA103.4 3 2 2 2 2 2 3
22MCA103.5 2 2 3 2 2 2 3
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Roger L Tokheim : Digital Electronics Principles and Applications, Sixth Edition, McGraw
Hill, 2004
2. M Morris Mano, “Digital Logic and Computer Design”, 10th Edition, Pearson, 2008
16
Department of Master of Computer Applications
 3. Carl Hamacher, Z Varnesic and S Zaky : Computer Organization, Fifth Edition, McGraw
Hill, 2002
REFERENCE BOOKS:
1. Stephen Brown, Zvonko Vranesic, “Fundamentals of Digital Logic Design with VHDL”,
2nd Edition, Tata McGraw Hill, 2005.
2. Donald P Leach, Albert Paul Malvino & Goutam Saha, “Digital Principles and
Applications”, 8th Edition, Tata McGraw Hill, 2015
E Books / MOOCs/ NPTEL
1. [PDF] Computer Organization and Architecture Books Collection Free Download –
Learnengineering.in

17
Department of Master of Computer Applications
 Syllabus of I Semester MCA (Master of Computer Applications)

Mathematical Foundation for Computer Applications

Course Code: 22MCA104 Course Type PCC
Teaching Hours/Week (L:T:P: S) 3:1:0:0 Credits 04
Total Teaching Hours 52 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications

Prerequisites :

Students should have knowledge of basic mathematics.

Course Objectives:
1. Understand operations on set theory, Solve example problems on set operations
2. Understand and solve problems on addition subtraction and multiplication of matrices.
3. Solve problems on eigen values and eigen vectors
4. Find mean, variance and covariance of to discrete and continuous random variable
5. Solve problems related to Graphs
UNIT - I
Set theory and operations on sets : 05 Hours
Introduction, Venn Diagrams, subsets, The size of a set, power sets, cartesian products,
Using set notations with quantifiers, Truth sets and quantifies
Operations on sets : Introduction, set identities, generalizes unions and intersections,
computer representations of sets

Cardinality : 05 Hours
Introduction, countable sets, an uncountable set
Inclusion-exclusion principle : Introduction, the principle of inclusion exclusion
Matrices : Introduction, matrix arithmetic, transposes and powers of matrices, Zero-
one matrices
eigen values and eigen vectors :
Finding Eigen values and Eigen vectors : Introduction, Procedure to find Eigen values,
Procedure to find Eigen Vectors

UNIT - II
Propositional Logic : Introduction, Propositions, Conditional statements, Converse, 05 Hours
Contrapositive and Inverse statements, Biconditional statements, Truth tables of
Compound propositions, Precedence of logical operators, logic and bit operations
Applications of Propositional Logic :
Introduction, Translating English sentences, System Specifications, Logic Circuits,
Logic Puzzles

Propositional Equivalences : 05 Hours

Introduction, Logical Equivalences, Using De Morgan’s Laws, Constructing new
18
Department of Master of Computer Applications
logical equivalences, Propositional satisfiability, solving satisfiability problems
Predicates and Quantifiers :
Introduction, Predicates, Preconditions and post conditions, Quantifiers : Universal
quantifier and existential quantifiers and uniqueness quantifiers

UNIT - III
Relations and their Properties : 05 Hours
Functions as relations, relations on a set, properties of relations, combining relations
n-ary Relations and their Applications :
Introduction, n-ary relations, databases and relations, operations on n-ary relations,
SQL

Representing Relations : Introduction, representing relations using Matrices, 05 Hours

representing using diagraphs
Closures of Relations : Introduction, closures, paths in directed graphs, transitive
closures, Warshall’s algorithm.
Equivalence relations : Introduction, Equivalence relations, equivalence classes,
equivalence classes and partitions

UNIT - IV
The concept of probability : 06 Hours
Introduction, Sample space and events
The axioms of probability :
Introduction, Properties of Probability, Bayes' Theorem, Basics of Probability, Concept
of random variable

Discrete probability distributions : 06 Hours

Introduction, Probability distribution for discrete random variable, expected values,
Mean, variance and co-variance
Continuous probability distributions :
Introduction, Probability density function, expected values, Mean, variance and co-
variance Binomial and normal distribution

UNIT - V
Graph Models Graph Terminology and Special Types of Graphs : 05 Hours
Introduction, Basic Terminology, some special simple graphs, Bipartite Graphs,
Bipartite Graphs and matchings, some applications of special types of graphs, new
graphs from old

Representing Graphs and Graph Isomorphism : Introduction, Representing Graphs, 05 Hours

Adjacency Matrices, Incidence Matrices, Isomorphism of graphs, Determining whether
two simple graphs are isomorphic
Euler and Hamilton Paths : Introduction, Euler paths and circuits, Hamilton paths
and circuits, Applications of Hamilton Circuits

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

1. Able to solve problems effectively on set operations.

19
Department of Master of Computer Applications
 2. Understand and solve problems on addition subtraction and multiplication of matrices.
3. Translate sentences based on mathematical logic and solve problems related to applications
of mathematical logic
4. Should be able to find mean, variance and covariance of to discrete and continuous random
variable
5. Solve problems related to Graphs

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA104.1 3 3 3 3 3 3 3 3 2
22MCA104.2 3 3 3 3 3 3 3 3 3
22MCA104.3 3 3 3 3 3 3 3 3 3
22MCA104.4 3 3 3 3 3 3 3 3 3
22MCA104.5 3 3 3 3 3 3 3 3 2
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Kenneth H Rosen, “Discrete Mathematics and its Applications”, McGraw Hill Publications, 7th
edition. (Chapters 2.1,2.2,2.5, 2.6,6.2,8.5,8.6,10.1 to 10.8)
2. Wolpole Myers Ye “Probability and Statistics for engineers and Scientist” Pearson
Education, 8th edition
REFERENCE BOOKS:
1. Richard A Johnson and C.B Gupta “Probability and statistics for engineers” Pearson Education.
2. J.K Sharma “Discrete Mathematics”, Mac Millian Publishers India, 3rd edition, 2011.
E Books / MOOCs/ NPTEL
1. H. Pishro-Nik, "Introduction to probability, statistics, and random processes", available
at https://www.probabilitycourse.com, Kappa Research LLC, 2014.

20
Department of Master of Computer Applications
 Syllabus of I Semester MCA (Master of Computer Applications)

Software Engineering and Testing

Course Code: 22MCA105 Course Type PCC
Teaching Hours/Week (L:T:P: S) 3:1:0:0 Credits 04
Total Teaching Hours 52 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Prerequisites :
Students should have knowledge of basic programming.
Course Objectives:
1. To introduce and describe on outline process models for requirements engineering, software
development, testing and evolution.
2. To describe Agile development techniques and to describe functional and non-functional
requirements
3. To understand the different system models and software designs.
4. To understand the verification and validation testing methods.
5. To describe the Organizational approaches of testing.
UNIT - I
Introduction: Professional software development; Software Engineering and Testing. 02 Hours
Software processes: Software processes Models; The waterfall model, Incremental 04 Hours
development, Integration and configuration.
Process activities: Software specification, Software design and implementation, 04 Hours
Software validation, Software evolution.
UNIT - II
Agile Software development: Agile methods, Agile development techniques. 03 Hours
Software requirements: Functional and non-functional requirements; Requirements 07 Hours
engineering Process, Requirement elicitation, Requirement specification, Requirement
Validation.
UNIT-III
System models: Context models; Interaction models; sequence diagram Structured 05 Hours
methods; class diagram, generalization, Aggregation. Behavioral Models-Data driven
modeling; Event driven modeling, Model driven engineering.
Software Design: Object-oriented design using the UML-System context and 05 Hours
interactions, Architecture design, Object class identification, Design models.
UNIT - IV
The Six Essentials of Software Testing: The Six Essentials of Software Testing 02 Hours
Testing Methods : Verification testing: Basic verification methods, Verifying 05 Hours
documents at different phases. Three critical success factors for implementing
verification.

Validation testing: Validation overview, Validation methods-Black box methods, 05 Hours

White box methods.
UNIT - V
Validation activities: Low level Testing, High level Testing. 02 Hours

21
Department of Master of Computer Applications
Software testing tools : Categorizing test tools, tool acquisition. 03 Hours
Organizational approaches to testing : Organizing and reorganizing testing, 05 Hours
Structural design elements, Approaches to organizing the test function.
Course Outcomes: At the end of the course student will be able to
1. Understand what is Software Engineering and Testing and its importance.
2. Understand the phases and activities of the software development process
3. Apply several Software Engineering and Testing techniques.
4. Understand the relevance of validation and verification in Software Engineering and Testing
process.
5. Create meaningful test plans and other critical test deliverables
Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA105.1 3 2 2 2 3 3 2 3 2
22MCA105.2 3 3 3 3 2 3 2 3 3 2
22MCA105.3 3 3 2 2 1 2 3 2
22MCA105.4 3 3 3 2 2 3 1 3 2
22MCA105.5 3 3 3 3 3 2 1 1 1 3 2
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Ian Somerville: Software Engineering, 10th edition, Pearson Education Ltd
2. Edward Kit: Software Testing in the Real World, Addison – Wesley
REFERENCE BOOKS:
1. William Perry: Effective Methods for Software Testing, Second Edition, John Wiley.
2. Bezier B: Software Testing Techniques, Second Edition, Wan Nostrand Reinluold.
3. Myers G J: The Art of Software Testing, John Wiley.
4. Roger S. pressman: Software Engineering – A practitioners approach, 7th edition, Mcgraw-
Hill

22
Department of Master of Computer Applications
 Syllabus of I Semester MCA (Master of Computer Applications)

Research Methodology and Publication Ethics

Course Code: 22MCA106 Course Type PCC
Teaching Hours/Week (L:T:P: S) 2:0:0:0 Credits 02
Total Teaching Hours 26 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Prerequisites :

1. Essential qualifications for understanding a research.

2. Intellectual curiosity, personal ambition to gain recognition, to serve the society.

Course Objectives:
1. To understand the Meaning, Objectives and Characteristics of research
2. To understand how to select and define the research problem.
3. To understand Research design and methods
4. To understand Philosophy, Ethics and Scientific Conduct in research
5. To understand Intellectual Property Rights
UNIT - I
Meaning, Objectives and Characteristics of research - Research methods Vs 04 Hours
Methodology –Types of research –Descriptive Vs. Analytical, Applied Vs.
Fundamental, Quantitative Vs. Qualitative, Conceptual Vs. Empirical – Research
process – Criteria of good research.

UNIT - II
Developing a research plan. Defining the research problem - Selecting the problem - 05 Hours
Necessity of defining the problem -Techniques involved in defining the problem -
Importance of literature review in defining a problem - Survey of literature - Primary
and secondary sources

UNIT - III
Research design and methods – Research design – Basic Principles- Need of research design – 06 Hours
Features of good design– Important concepts relating to research design.
Sampling design - Steps in sampling design - Characteristics of a good sample design - Types
of sample designs – Measurement and scaling techniques – Methods of data collection –
Collection of primary data – Data collection instruments

Unit - IV
Philosophy and Ethics, Scientific Conduct: Ethics: definition, moral philosophy, nature of 06 Hours
moral judgments and reactions. Scientific Conduct Ethics with respect to science and
research. Intellectual honesty and research integrity.

Unit - V
Intellectual Property Rights : The Concept, Intellectual Property System in India, 05 Hours
Development of TRIPS Complied Regime in India, Patents Act, 1970, Trade Mark
Act, 1999,The Designs Act, 2000, The Geographical Indications of Goods
(Registration and Protection) Act1999, Copyright Act,1957
23
Department of Master of Computer Applications
Course Outcomes: At the end of the course student will be able to
1. Understand and explain the Meaning, Objectives and Characteristics of research
2. Understand and explain how to select and define a research problem.
3. Understand and explain research design and methods
4. Understand and explain the philosophy, ethics and scientific conduct in research
5. Understand and explain intellectual property rights

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA106.1 3 3 3 3 3 3 3 3 3 3 3 3 3 3
22MCA106.2 3 3 3 3 3 3 3 3 3 3 3 3 3 3
22MCA106.3 3 3 3 3 3 3 3 3 3 3 3 3 3 3
22MCA106.4 3 3 3 3 3 3 3 3 3 3 3 3 3 3
22MCA106.5 3 3 3 2 3 3 3 3 3 3 3 3 3 3
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Garg, B.L., Karadia, R., Agarwal, F. and Agarwal, U.K., 2002. An Introduction to Research
Methodology, RBSA Publishers.
2. Kothari, C. R., 1990. Research Methodology : Methods and Techniques. New Age
International. 418 p.
3. Anderson, T. W., An Introduction to Multivariate Statistical Analysis, Wiley Eastern Pvt.,
Ltd., New Delhi
REFERENCE BOOKS:
1. Sinha, S. C. and Dhiman, A. K., 2002. Research Methodology, EssEss Publications. 2 volumes.
2. Day, R.A., 1992. How to Write and Publish a Scientific Paper, Cambridge University Press.
3. Fink, A., 2009. Conducting Research Literature Reviews: From the Internet to Paper. Sage
Publications
4. Coley, S. M. and Scheinberg, C. A., 1990, "Proposal Writing", Sage Publications.
5. Intellectual Property Rights in the Global Economy : Keith Eugene Maskus, Institute for
International Economics, Washington, DC, 2000
6. Subbarau N R – Handbook on Intellectual Property Law and Practice-S Viswanathan
Printers and Publishing Private Limited. 1998

24
Department of Master of Computer Applications
 Syllabus of I Semester MCA (Master of Computer Applications)

Data Structures with Algorithms Lab

Course Code: 22MCA107 Course Type: PCC Lab
Teaching Hours/Week (L:T:P:S): 0:0:4:0 Credits: 02
Total Teaching Hours: 26 CIE + SEE Marks: 50+50
Teaching Department: Master of Computer Applications
Prerequisites :
Student must have basic knowledge of C programming.
Course Objectives:
1. Implement the primitive data structures such as arrays and structures.
2. Implement Stack, Queue data structures statically.
3. Implement the non linear data structures such as Linked list, Binary Trees, Graphs.
4. Implement different sorting methods and searching methods
List of Experiments
1. C programs to demonstrate the operations of stack. (using arrays and structures).
2. C programs to convert the valid infix arithmetic expression to postfix and prefix form.
3. Evaluate postfix expression.
4. Recursive C programs to
i) Find Factorial of a number
ii) Find Fibonacci of a number
iii) Solve Towers of Hanoi Problem
iv) Find GCD of two numbers
v) Find multiplication of two numbers
5. C programs using pointers.
6. C programs to simulate the working of simple queue, circular queue and priority queue
using arrays and structures.
7. C programs to demonstrate the operations of singly & doubly linked list. (operations like
insert a node at the front, at the back, at the specified position; delete a node from the
front end, from the back end, from the specified position; search a node, if the info field is
specified;
display all the nodes in the list).
8. Implement stack and queues using singly linked list.
9. C programs on binary trees. (Construct a binary search tree and Traverse the tree using all
the methods i.e., inorder, preorder, postorder).
10. C programs to demonstrate the different searching techniques over a list of integers.
(Linear search, Binary search).
11. C programs to sort a list using different sorting techniques.
(Bubble sort selection sort, quick sort, simple insertion sort, shell sort, merge sort, Heap
sort, Binary tree sort).

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

1. Static implementation of Stack and Queue data structures. Understand the concept of
25
Department of Master of Computer Applications
 Recursive programs. Understand the implementation details of linked lists. Dynamic
Implementation of Stack and Queue data structures.
2. Understand the implementation details of Binary tree and Graph data structures. Implement
and Illustrate various Sorting and Searching Techniques

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓Course Outcomes 1 2
22MCA107.1 3 3 3 3 2 3 3 2 3 3 3 2
22MCA107.2 3 3 2 2 3 3 3 3 3 2 3 2
1: Low 2: Medium 3: High

REFERENCE BOOKS:
1. Yedidyah Langsam and Moshe J Augenstein and Aaron M Tenanbaum: Data Structures
using C and C++, Second Edition, Pearson Education Asia, 2002.
2. Jean-Paul Tremblay: An Introduction to Data Structures with applications, Tata
McGRAW Hill
3. Introduction to the Design and Analysis of Algorithms. Anany Levitin, Pearson
Education, 2nd Edition.
4. Horowitz E., Sahani S., Rajashekharan S: Computer Algorithm, Galgotia Publications.

26
Department of Master of Computer Applications
 Syllabus of I Semester MCA (Master of Computer Applications)

Advanced Database systems Lab

Course Code: 22MCA108 Course Type: PCC Lab
Teaching Hours/Week (L: T: P: S): 0:0:4:0 Credits: 02
Total Teaching Hours: 30 CIE + SEE Marks: 50+50
Teaching Department: Master of Computer Applications
Prerequisites :

Student must have basic knowledge of computer system- hardware/software and File Programming.

Course Objectives:
1. Populate and query a database using SQL DML/DDL commands
2. Declare and enforce integrity constraints on a database using a state-of-the-art RDBMS
3. Programming PL/SQL including stored procedures, Cursors and triggers.
4. Perform MongoDB CRUD operations.
List of Experiments
1. Exercise on creating tables.
2. Exercise on altering tables, dropping tables.
3. Exercise on giving table level constraints, field level constraints.
4. Exercise on insertion, retrieval, deletion and modification of data values.
5. Exercise on ORDER BY, GROUP BY, HAVING clauses.
6. Exercise on Aggregate functions in SQL.
7. Exercise on Joins, Unions, Sub queries, Nested Sub queries, Co-related sub-queries.
8. Exercise on creating views, dropping views.
9. Exercise on PL/SQL : control structures, connecting tables.
10. Exercise on PL/SQL : Cursors, Triggers, Exception handling.
11. Exercise on MongoDB.
12. Design & Implementation of a Database.

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

1. Understand and use data base language statements to query, update, and manage a database
using SQL and PL/SQL.
2. Understand the concepts used in performing CRUD operations using NoSQL database like
MongoDB.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓Course Outcomes 1 2
22MCA108.1 3 3 3 3 3
22MCA108.2 2 3 2 3 3
1: Low 2: Medium 3: High

27
Department of Master of Computer Applications
REFERENCE BOOKS:
1. Elmasri and Navathe: Fundamentals of Database Systems, Seventh Edition 2016
2. Ivan Bayross : Commercial Application Development using Oracle Developer 2000
3. Seema Acharya, Subhashini Chellappan, “Big Data Analytics”, 1st Edition, Wiley, 2015
E Resources
1. NOC: Fundamentals of Database Systems (Course sponsored by Aricent), IIT Kanpur, Dr.
Arnab Bhattacharya
https://nptel.ac.in/courses/106104135
2. Oracle PL/SQL Language Pocket Reference, 5th Edition: A Guide to Oracle's PL/SQL
Language Fundamentals
https://www.pdfdrive.com/oracle-plsql-language-pocket-reference-5th-edition-a-guide-to-
oracles-plsql-language-fundamentals-d167357800.html

28
Department of Master of Computer Applications
 Syllabus of I Semester MCA (Master of Computer Applications)

Fundamentals of Programming – Bridge Course

Course Code: 22MCA109 Course Type: PCC Lab
Teaching Hours/Week (L:T:P:S): 0:0:4:0 Credits: 00
Total Teaching Hours: 26 CIE + SEE Marks: 50+50
Teaching Department: Master of Computer Applications
Course Objectives:
1. Learn the basics of programming structure and module.
2. Study the concept of decision making statements, loop controlling structures.
3. Learn and execute programs on arrays and structures.
4. Gain knowledge about pointers and execute the programs using pointers.
List of Experiments
1. Simple C programs with input – output statements.
2. C programs with decision making statements.
3. C programs using loop control structures.
4. C programs using arrays.
5. C programs using structures.
6. C programs using pointers.

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

1. Understand the basics of programming structure and module. Demonstrate the concept of
decision making statements, loop controlling structures. Execute simple programs,
programs using arrays and structures.
2. Understand the concepts of functions and subroutine, execute the programs. Understand the
pointer concepts and execute the programs using pointers.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA109.1 3 3 3 3 2 3 3 3 3 3 3 2
22MCA109.2 3 3 2 2 3 2 3 3 3 2 3 2
1: Low 2: Medium 3: High

29
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

Data Communication and Computer Networks

Course Code: 22MCA201 Course Type: PCC
Teaching Hours/Week (L: T: P: S) 3:0:0:0 Credits: 03
Total Teaching Hours: 39 CIE + SEE Marks: 50+50
Teaching Department: Master of Computer Applications
Prerequisites :

Student must have some basic knowledge of computer system hardware and software.

Course Objectives: This Course will enable students to

1. To Understand the fundamental concepts of computer networks and familiarize with the
Transmission Media, Error Detection & Correction methods.
2. To understand and apply protocols, technologies, and design principles of the application
layer and the data link layer in network communication.
3. To Understand the purpose and functionality of the transport layer, learn about transport
layer protocols, mechanisms, and services, and explore the impact of transport layer on
network communication.
4. To Understand the network layer's role in routing, addressing, and forwarding, learn about
network layer protocols and algorithms,
5. To Understand the concept of congestion control in network communication, learn about
different congestion control algorithms and mechanisms
UNIT-I
Introduction:
Data Communications, computer Networks 01 Hours

Networks Protocols and Architecture:

OSI: The model, The OSI Layers; TCP/IP Protocol Architecture : The TCP/IP layers. 03 Hours

Data Encoding and Communication Interfaces: 05 Hours

Digital Data Digital Signals: None turn to zero(NRZ), Multilevel Binary, Biphase,
Modulation Rate, scrambling techniques, Digital Data Analog Signals: Encoding
Techniques; Analog Data Digital Signals: Pulse Code Modulation, Asynchronous
&Synchronous Transmission; Types of Errors; Error Detection: Parity Check, Cyclic
Redundancy Check(CRC):arithmetic modulo, polynomial, digital logic, Error Correction:
Block Code Principles.
UNIT-II
Data Link Control: 03 Hours
Flow Control: Stop and Wait &Sliding Window Flow Controls; Error Control: Stop and
Wait ARQ, GO-Back-N ARQ, Selective-Reject ARQ; High-level Data Link Control:
Basic Characteristics, Frame Structure.

30
Department of Master of Computer Applications
Application Layer: 04 Hours
DNS- The Domain Name System: The DNS Name Space, Resource Records, Name
Servers; Electronic mail: Architecture and Services, The User Agent, Message Formats:
MIME, Message Transfer: SMTP, Final Delivery:POP3,IMAP, HTTP.

UNIT-III
The Transport Layer: 07 Hours
The Transport Service: Services Provided to the Upper Layers, Transport Service
Primitives, Berkley Sockets; Elements of Transport Protocols: Addressing, Connection
Establishment, Connection Release. The Internet Transport Protocols: UDP: Introduction
to UDP, Remote Procedure Call; The Internet Transport Protocols: TCP: Introduction to
TCP, The TCP Service Model, The TCP Protocol, The TCP Segment Header

UNIT-IV
08 Hours
Network layer:
Network layer design issues: Store and Forward packet Switching, Services Provided to
the Transport Layer, Implementation of Connection less Service, Implementation of
Connection-Oriented Service, Comparison of Virtual Circuit and Datagram Subnets;
Routing algorithms: The Optimality Principal, Shortest Path Routing, Flooding, Distance
Vector Routing, Link state Routing, Hierarchical Routing, Broadcast Routing, Multicast
Routing.

UNIT-V
Congestion Control: 08 Hours
Congestion Control Algorithms: General Principles of Congestion Control, Congestion
Prevention Policies, Congestion Control in Virtual-Circuit Subnets, Congestion Control
in Datagram Subnets, Load Shedding, Jitter Control; Quality of Service: Requirements,
Techniques for Achieving Good Quality of Service, Integrated Services, Differentiated
Services; Inter-networking: How networks differ, How Networks Can Be Connected,
Concatenated Virtual Circuits, Tunneling, Fragmentation,Ipv6.

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

1. Understand the concepts of computer networks, Data Transmission and Data Encoding
Techniques. how the data is transmitted in the Physical Layer and usage of the different
Layers in the Data Transmission.
2. Demonstrate proficiency in developing and deploying network applications, implementing
data link layer protocols.
3. Apply transport layer protocols and mechanisms to ensure reliable and efficient data
transmission, and understand the relationship between the transport layer and other layers in
the network architecture.
4. Apply network layer protocols and algorithms to enable efficient routing and forwarding of
data packets.
5. Apply congestion control algorithms and mechanisms to regulate and optimize network
traffic flow, analyze and design and implement effective congestion control solutions in
network environments.

31
Department of Master of Computer Applications
Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA201.1 3 3 3 3 3 3 3 3 3
22MCA201.2 2 3 2 2 3 2 2 2 2
22MCA201.3 3 3 2 3 2 2 3 3 3
22MCA201.4 3 2 3 3 3 3 3 3 3
22MCA201.5 3 3 3 3 3 3 3 3 3
1: Low 2: Medium 3: High

TEXTBOOKS:
1. William Stallings: Data and Computer Communication, Eighth Edition, Pearson Education
2. lberto Leon - Garcia and Indra Widjaja , Communication Networks -Fundamental Concepts
and Key architectures, Tata McGraw-Hill, 2000.
3. Andrew S. Tanenbaum: Computer Networks, Fourth Edition, Pearson Education, Asia,
2008.
REFERENCE BOOKS:
1. Behrouz A. Forouzan: Data Communications and Networking, Tata McGraw-Hill
2. Achyut S Godbole: Data Communications and Networks, Tata McGraw-Hill.
E Books / MOOCs/ NPTEL:
1. https://open.umn.edu/opentextbooks/textbooks/353
2. https://freecomputerbooks.com/An-Introduction-to-Computer-Networks-by-Peter-Dordal.html
3. https://onlinecourses.swayam2http://nptel.ac.in/courses/106105081/.ac.in/cec22_cs05/preview
4 http://nptel.ac.in/courses/106105081/

32
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

Enterprise Java
Course Code: 22MCA202 Course Type PCC
Teaching Hours/Week (L:T:P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Prerequisites :

Student must have basic knowledge of Object-Oriented Programming concepts.

Course Objectives:
1. To understand Input/Output using Java and use Class fundamentals, Objects, Methods,
Polymorphism,
2. To understand Inheritance, Abstraction, Package creation and Exceptions handling in Java
3. To understand Multithreaded Programming concepts using Java, develop GUI Applications in
Java using Swing packages and Event handling.
4. To understand and use Networking concepts, Distributed computing using RMI, JDBC for
Database connectivity and Component development using Java Beans.
5. To understand Web application development, Using Servlets, Spring Boot.
UNIT - I
Introduction to JAVA : 10 Hours
Introducing classes: Class fundamentals; Declaring objects; Assigning object
reference variables; Introducing methods; Constructors; The this keyword;
Overloading methods; Introducing access control; Understanding static: Introducing
final; introducing nested and inner classes; String class, StringBuilder class.
Stream Classes:
Reading and writing files; Stream classes; Byte Streams (InputStream;
OutputStream; FileInputStream; FileOutputStream; DataInputStream,
DataOutputStream); Character streams(Reader; Writer, FileReader, FileWriter,
BufferedReader, BufferedWriter); Serialization: Serializable, ObjectOutputStream,
ObjectInputStream.

UNIT -II
Object Oriented Fundamentals and Exception Handling 06 Hours
Inheritance :
Inheritance basics; Using super; Creating a multilevel hierarchy; Method overriding;
Dynamic method dispatch; Using Abstract class; Using final with inheritance,
Aggregation.
Packages and Interfaces : Packages; Access protection; Importing packages;
Interfaces.
Exception handling :
Exception- handling fundamentals; Exception types; Uncaught exceptions; Using try
and catch; Multiple catch clauses; Nested try statements; throw; throws; finally;
Java’s built-in exceptions; Creating your own exception sub-classes;
33
Department of Master of Computer Applications
 UNIT - III
The Collection Framework, Multithreaded Programming and Event Handling, 08 Hours
AWT and Swings:
The Collection Framework:
The Collection interfaces: The Collection interface, The List interface, The Set
interface; The collection classes: The ArrayList class, The LinkedList class, The
Hashset class, The LinkedHashSet class
Multithreaded programming:
Java Thread model; Main thread; Creating a thread; Creating multiple threads; Using
isAlive() and join(); Synchronization; Interthread communication;

Event Handling, AWT and Swings :

Event Handling:
Two event handling mechanisms; Delegation event model; Event classes; Sources of
events; EventListener interfaces; Using the Delegation Event Model;
Swings :
JApplet; JFrame; Labels; Text fields; Buttons; Check boxes; RadioButtons; Adapter
classes

Unit - IV
Networking, RMI, JDBC and Java Beans : 08 Hours
Networking basics: Java and the net; InetAddress; TCP/IP client sockets; URL:
URLConnection; TCP/IP server sockets; Datagrams.
RMI :
Remote Method Invocation (RMI): Remote Method Invocation concept; Server side;
Client side.
JDBC :
JDBC objects: Concept of JDBC; JDBC driver types; JDBC packages; Brief
overview of the JDBC process; Database connection; Associating the JDBC/ODBC
bridge with the database; Statement objects; ResultSet; Transaction Processing.
Java Beans :
Introduction to Java Beans; Advantages of Java Beans; JAR files; Introspection;
Developing a simple Bean; Using bound properties; Using BeanInfo Interface;
Constrained properties.

Unit - V
Servlets and Spring Boot : 07 Hours
Servlets :
Background; Life cycle of a Servlet; Simple Servlet; Servlet API; javax.servlet
package; Reading Servlet parameter; javax.servlet.http package; Handling HTTP
requests and responses; Using Cookies, Session Objects.
Spring Boot :
What is Spring Boot?, Advantages of Spring Boot, Spring Boot Features, Spring
Boot Architecture, Spring Initializer, Creating a Spring Boot Project, Spring Boot
Project Components, Spring Boot Database, Spring Boot View.

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

34
Department of Master of Computer Applications
 1. Create Java applications based on Object Oriented Programming concepts.
2. Handle Exceptions and implement Multithreaded Programming concepts using Java
3. Create applications that employ Swing for GUI development, package hierarchies that may be
deployed as executable JARs as well as understand the use of various Input/Output packages.
4. Understand and implement Networking concepts, Distributed computing using RMI, JDBC
for Database connectivity and Component development using Java Beans.
5. Understand and implement Web application development Using Servlets, Spring Boot.

Course Outcomes Mapping with Program Outcomes & PSO

Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA202.1 3 3 3 3 3 3 3
22MCA202.2 3 3 3 3 3 3 3
22MCA202.3 3 3 3 3 3 3 3
22MCA202.4 3 3 3 3 3 3 3
22MCA202.5 3 3 3 3 3 3 3
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Herbert Schildt : Java: The Complete Reference, Eleventh Edition, Tata McGraw Hill.,
2019
2. Java Server Programming Java EE 7 (J2EE 1.7), Black Book, Dreamtech press 2014
3. Mastering Spring Boot 2.0: Build modern, cloud-native, and distributed systems using
Spring Boot, Dinesh Rajput, Pack Publishing Ltd., 2018
REFERENCE BOOKS:
1. Dr. Donald Doherty and Rick Leinecker : JavaBeans Unleashed
2. James Goodwill : Developing Java Servlets
3. Karl Avedal, Danny Ayers : Professional JSP
4. Steven Holzner : Java 2 Black Book
5. Ed Roman : Mastering Enterprise JavaBeans
6. Jim Keogh : The Complete Reference J2EE, Tata McGraw Hill, 2008.

35
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

Operating Systems with UNIX

Course Code: 22MCA203 Course Type PCC
Teaching Hours/Week (L:T:P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications

Prerequisites :

Student should have knowledge about computer organization, different parts of computer system
and also high level languages like C.

Course Objectives:
1. Understand the principles and services of operating systems
2. Analyse fundamental operating system abstractions like process, threads, files, semaphores
and IPC
3. Know the benefits of concurrency and synchronization and apply them to write concurrent
programs.
4. Learn the philosophy behind Unix Operating System along with its architecture.
5. Write Shell scripts and Use Unix commands appropriately.
UNIT - I
Introduction to Operating Systems : 04 Hours
System Structure What operating systems do; Computer System Organization; Computer
System Architecture; Operating System Operations; Operating System Services; System Calls;
Types of System Calls; System Programs;

Operating System Structure : Virtual Machines; System boot. Overview of Process, 04 Hours
Process Concept; Process Scheduling; Operations on Processes; Inter – Process
Communication; Multi – Threaded Programming: Overview: Multithreading Models.

UNIT - II
Process Management Process Scheduling: 04 Hours
Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Multiple Processor
Scheduling

Process Synchronization Synchronization: 03 Hours

The Critical Section Problem: Peterson’s Solution; Semaphores; Classical Problems of
Synchronization.

UNIT - III
Deadlocks: System model; Deadlock Characterization, Methods for handling 04 Hours
deadlocks; Deadlock Prevention; Deadlock Avoidance; Deadlock Detection and
Recovery from deadlock.

36
Department of Master of Computer Applications
Memory Management Memory Management Strategies: 04 Hours
Background, Swapping; Contiguous Memory Allocation; Paging; Segmentation;
Virtual Memory Management; Background; Demand Paging; Page Replacement.

UNIT - IV
The File System: 04 Hours
The File, What’s in a File name? The Parent-Child Relationship, The HOME
Variable: The Home Directory, pwd, cd, mkdir, rmdir, Absolute Pathnames, Relative
Pathnames, The Unix File System. Basic File Attributes: ls options, File Ownership,
File Permissions, chmod, Directory Permissions, Changing the File Ownership More
File Attributes: File Systems and Inodes, Hard Links, Symbolic Links, The Directory,
umask, Modification and Access Times, find. The Shell: The Shell’s Interpretive
Cycle, Shell Offerings

Pattern Matching-The Wild-cards, Escaping and Quoting, Redirection: The Three 04 Hours
Standard Files, Two Special Files: /dev/null and /dev/tty, pipes, tee: Creating a Tee,
Command Substitution.

UNIT - V
The Process: Process Basics, ps: Process Status, System Processes, Mechanism of 04 Hours
Process Creation, Internal and External Commands, Running Jobs in Background,
Killing Processes with Signals, Job Control, at and batch, cron.

Essential Shell Programming: Shell Variables, Environment Variables, Shell Scripts, 04 Hours
read, Using Command Line Arguments, exit and exit status of command, The Logical
Operators, The if Conditional, using test and [] to Evaluate Expression, The case
Conditional, expr, while: looping, for: looping with a list, set and shift.

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

1. Understand the principles and services of operating systems
2. Identify fundamental operating system abstractions like process, threads, files, semaphores
and IPC
3. Assess the benefits of concurrency and synchronization and apply them to write concurrent
programs.
4. Learn the philosophy behind Unix Operating System along with its architecture.
5. Understand the philosophy behind Unix Operating System along with its architecture.
Write Shell scripts and Use Unix commands appropriately.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA203.1 3 3 3 3 3 3 3 3 3
22MCA203.2 3 3 3 3 3 3 3 3 2
22MCA203.3 3 3 3 3 3 3 3 3 2
22MCA203.4 3 3 3 3 3 3 3 3 2
22MCA203.5 3 3 3 3 3 3 3 3 2
1: Low 2: Medium 3: High
37
Department of Master of Computer Applications
TEXT BOOKS:
1. Sumitabha Das: UNIX Concepts and Applications, 4th Edition, Tata McGraw Hill, 2006
2. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: Operating Systems Principles,
8th Edition, Wiley – India
REFERENCE BOOKS:
1. UNIX: The Complete Reference: Kenneth Roson et al, Osborne/McGraw Hill, 2000
2. Using UNIX: Steve Montsugu, 2nd Edition, Prentice Hall India, 1999
3. UNIX and Shell Programming: M G Venkatesh Murthy, Pearson Education Asia, 2005
Behrouz A Forouzan and Richard F Gilberg
4. D M Dhamdhere: Operating Systems – A Concept Based Approach, 2nd Edition, Tata
McGraw – Hill, 2002
E Books / MOOCs/ NPTEL
1. https://www.oreilly.com/library/view/learning-the-unix/1565923901/

38
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

Data Warehousing and Data Mining

Course Code: 22MCA204 Course Type PCC
Teaching Hours/Week (L:T:P: S) 3:1:0:0 Credits 04
Total Teaching Hours 52 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Prerequisites :

Student must possess basic knowledge of computer system- hardware and software, Database
Management Systems and Statistics

Course Objectives:
1. Provide the student with an understanding of the concepts of data warehousing, its
architecture and modelling
2. Explain the Knowledge Discovery Process and get notion of Data Mining
3. Learn the Preprocessing techniques required for Data Mining
4. Describe the data mining tasks of Association Analysis, Classification and Clustering and
also study their well-known techniques
5. Test real data sets using popular data mining tools
UNIT - I
Data Warehousing & modeling: 12 Hours
Basic Concepts: Data Warehousing: A multitier Architecture, Data warehouse models:
Enterprise warehouse, Data mart and virtual warehouse, Extraction, Transformation
and loading, Data Cube: A multidimensional data model, Stars, Snowflakes and Fact
constellations: Schemas for multidimensional Data models, Dimensions: The role of
concept Hierarchies, Measures: Their Categorization and computation, Typical OLAP
Operations

UNIT - II
Data warehouse implementation: 06 Hours
Efficient Data Cube computation: An overview, Indexing OLAP Data: Bitmap index
and join index, Efficient processing of OLAP Queries, OLAP server Architecture
ROLAP versus MOLAP Versus HOLAP

Introduction to Data mining: 04 Hours

Introduction- What is data mining, Challenges, Data Mining Tasks, Data: Types of
Data, Data Quality, Data Preprocessing, Measures of Similarity and Dissimilarity.

UNIT - III
Association Analysis : 10 Hours
Problem Definition, Frequent Item set Generation, Rule generation. Alternative
Methods for Generating Frequent Item sets, FPGrowth Algorithm, Evaluation of
Association Patterns.

39
Department of Master of Computer Applications
 UNIT - IV
Classification : 10 Hours
Decision Trees Induction, Method for Comparing Classifiers, Rule Based Classifiers,
Nearest Neighbor Classifiers, Bayesian Classifiers

UNIT - V
Clustering Analysis : 10 Hours
Overview, K-Means, Agglomerative Hierarchical Clustering, DBSCAN, Cluster
Evaluation, Density-Based Clustering, Graph-Based Clustering, Scalable Clustering
Algorithms.

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

1. Describe the architecture of Data Warehouses and compare design schemas
2. Apply various preprocessing tasks and define Data Mining
3. Explain Association rule mining and apply association algorithms
4. Apply various classification techniques and algorithms and evaluate them
5. Describe various clustering techniques and apply algorithms

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes
1 2
22MCA204.1 3 3 2 2 1 1 1 3
22MCA204.2 3 2 1 1 1 3
22MCA204.3 2 3 3 2 1 3
22MCA204.4 2 2 2 3 3 1 3
22MCA204.5 3 2 3 1 2 1 3
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Pang-Ning Tan, Michael Steinbach, Vipin Kumar: Introduction to Data Mining, Pearson,
First impression, 2014.
2. Jiawei Han, Micheline Kamber, Jian Pei: Data Mining -Concepts and Techniques, 3rd
Edition, Morgan Kaufmann Publisher, 2012.

REFERENCE BOOKS:
1. Arun K. Pujari : Data Mining Techniques, 2nd Edition, Universities Press, 2009.
2. Sam Anahory, Dennis Murray: Data Warehousing in the Real World, Pearson, Tenth
Impression, 2012.
3. Michael J. Berry, Gordon S. Linoff: Mastering Data Mining, Wiley Edition, second edition,
2012

E Books / MOOCs/ NPTEL

1. NPTEL Course on Data Mining, IIT Kharagpur

40
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

Professional Communication and Ethics

Course Code: 22MCA205 Course Type PCC
Teaching Hours/Week (L:T:P: S) 1:1:0:0 Credits 02
Total Teaching Hours 26 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications

Prerequisites :

Learner must have essential knowledge of English language communication.

Course Objectives:
1. To comprehend the process of Communication, and the basics of Technical communication
and develop good Presentation skills
2. To enhance personality development in social and professional context and to possess
knowledge of the Concept of leadership
3. To impart better writing skills by sensitizing the learners to the dynamics of effective
writing
4. To recognize the importance of time management and stress management
5. To be aware of ethics in engineering practice and professional responsibilities
UNIT - I
Communication Skills : 10 Hours
The Concept and Process of Communication, Methods of Communication,
Communication Cycle & Feedback
Organizational Communication :
Importance and Types of Organizational Communication Effective Communication
and Barriers to Communication
Effective Presentation Strategies :
Defining the purpose of presentation, preparation and understanding nuances of
delivery

UNIT - II
Basic Language Skills and Language through Literature : 12 Hours
Grammar and Usage: correct errors, choose correct forms out of alternative choices,
join clauses, rewrite sentences as directed.

Listening and Writing Skills :

Types of listening and Barriers to effective listening, Application letters and Resume
writing and Email etiquettes

Self-Enhancement :
Self-Assessment, Types of Personality, Johari window and SWOT Analysis and
Interpersonal Skills Perceptions and Attitudes, Values and Belief Systems and General
Etiquettes, Theories of leadership.
41
Department of Master of Computer Applications
 UNIT - III
Engineering Practice Ethics and Professional responsibilities : 04 Hours
Rights and responsibilities regarding intellectual property, Workplace rights and
responsibilities, Responsibilities for environment and society
Stress and Time Management :
Identifying the Stress Source, Signs of Stress, Healthier ways to deal with Stress,
Time Management, Four Ds of Decision Taking

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

1. Understand the concept of communication in everyday process and at organizations
2. Improved communication, interaction and presentation of ideas
3. Develop progressive attitude at workplace and in society at large and apprehend
Leadership styles
4. Identify ethics and professional skills effectively
5. Recognize the importance of time management and stress management

Course Outcomes Mapping with Program Outcomes & PSO

Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO

↓ Course Outcomes 1 2
22MCA205.1 2 3 3 3 1 3
22MCA205.2 3 3 3 1 3
22MCA205.3 2 3 3 2 1 3
22MCA205.4 3 3 2 1 3
22MCA205.5 3 2 2 3 3 1 3
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Meenakshi Raman and Sangeeta Sharma: Technical Communication - Principles and
Practices, Oxford University Press 2004.
2. George Reynolds: Ethics in Information Technology, Thomson Course Technology,2003.
3. Ray French: Cross Culture Management, Universities Press
4. Urmila Rai: Business Communication, Himalaya Publishing House
REFERENCE BOOKS:
1. M. Ashraf Rizvi: Effective Technical Communication by, Ist Edition, Tata McGrawHill.
2. Mike W Martin and Ronald Scherzinger: Ethics in Engineering,3rd Edition Tata McGraw
Hill.
3. C.S Rayudu: Communication, Himalaya Publishing House
4. "Communicating at work – Principles and Practices for Business and the Professions" -
Ronald B Adler & Jeanne Marquardt Elmhurst; McGraw-Hill College; Sixth Edition.
5. “Organizational Behaviour”, - Stephen P Robbins; Prentice Hall, India.
6. “Organizational Behaviour”, - Fred Luthans; McGraw Hill International Edition.

42
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

Digital Image Processing & Pattern Recognition

Course Code: 22MCA211 Course Type PCE
Teaching Hours/Week (L:T:P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Prerequisites:

Linear Algebra, Differential Equations, Probability and Statistics, Calculus, Signals and systems,
Digital Electronics (just basic), Basic Programming skills, Basic of Computer Graphics.

Course Objectives:
1. Understand the fundamental concepts in Digital image processing. To study different types
of image acquisition methods and basics of intensity transformations and histogram
processing
2. Compare Spatial domain concept and Frequency domain concepts. To compare and contrast
Correlation and convolution techniques.
3. Learn different types of noise models, Compression methods and filtering techniques. To
study different basic morphological algorithms and operations and fundamentals of Image
Segmentation.
4. Study the basics of Pattern Recognition.
5. Compare and contrast Clustering and Classification. And to study different types of
classification algorithms.
UNIT-I
Introduction, Digital Image Fundamentals: 05 Hours
Elements of visual perception, light and electromagnetic spectrum, image sensing and
acquisition, image sampling and quantization, some basic relationship between pixels.

Intensity Transformations: 03 Hours

Basics of intensity transformations, histogram processing

UNIT-II
Spatial Filtering: Fundamentals of spatial filtering, smoothing and sharpening filters. 04 Hours

Frequency domain Filtering : 04 Hours

Background, preliminary concepts, sampling, Fourier transforms and DFT, 2-D DFT
and properties, frequency domain filtering, low pass filters, high pass filters.

UNIT-III
Image restoration and Reconstruction 03 Hours
Noise models, restoration in the presence of noise, inverse filtering.

Image Compression : 02 Hours

Fundamentals, basic compression methods.
43
Department of Master of Computer Applications
Morphological Image Processing : 02 Hours
Preliminaries, erosion and dilation, opening and closing, basic morphological
algorithms.

Image Segmentation : 03 Hours

Fundamentals, point, line and edge detection, thresholding, region based segmentation.

UNIT – IV
Pattern Recognition : 03 Hrs
Introduction - What is Pattern Recognition?, Clustering vs Classification; Applications;

Clustering : 03 Hrs
Overview of clustering; Different distance functions and similarity measures, K-means
clustering.

UNIT – V
Classification : 07Hrs
Bayes decision rule, Minimum distance classifier, K-NN Classifier, Single and
Multilayer perceptron, training set and test sets, standardization and normalization.

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

1. Understand the fundamental concepts in Digital image processing. Explain different types
of image acquisition methods and basics of intensity transformations and histogram
processing.
2. Compare Spatial domain concept and Frequency domain concepts. Compare and contrast
Correlation and convolution techniques.
3. Describe different types of noise models, different types of filtering techniques and basic
compression methods. Discuss the different basic morphological algorithms and operations.
Understand the basics of segmentation.
4. Understand the basics of Pattern Recognition
5. Compare and contrast Clustering and Classification. Explain different types of
classification algorithms.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA211.1 3 3 3 3 2 3 3 3 3 3 3 3
22MCA211.2 3 3 2 2 3 2 3 3 3 2 3 3
22MCA211.3 3 3 2 2 3 2 3 3 3 2 3 3
22MCA211.4 3 3 3 3 2 2 3 3 3 3 3 3
22MCA211.5 3 3 3 3 2 3 3 3 3 3 3 3
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Rafael C. Gonzalez & Richard E. Woods : Digital Image Processing, 3rd edition, PHI 2008
2. R.O. Duda, P.E. Hartand D.G. Stork, Pattern Classification, John Wiley. 2010
44
Department of Master of Computer Applications
REFERENCE BOOKS:
1. Anil K. Jain : Fundamentals of Digital Image Processing, Prentice Hall, 1995
2. William K. Pratt, John Wiley & Sons Inc : Digital Image Processing, 3rd edition, 2001
3. Statistical Pattern Recognition; K. Fukunaga; Academic Press, 2000
4. S. Theodoridis and K. Koutroumbas, Pattern Recognition, 4th Ed., Academic Press, 2009
5. Robert Schalkoff, Pattern Recognition: Statistical, Structural and Neural Approaches, John
Wiley & Sons, Inc.1992

45
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

Environmental Studies and Green IT

Course Code: 22MCA212 Course Type PCE
Teaching Hours/Week (L:T:P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Course Objectives:
1. Understand the importance of environment.
2. Understand the concepts of Green IT.
3. Understand the best practices of Green IT.
4. Understand tools related to Green IT.
5. Create digital documents related to Green IT.
UNIT - I
Environmental studies: Scope and importance of environmental studies, environment 07 Hours
and its components, ecosystem, environmental pollution; Air, water, soil, Thermal,
nuclear and solid waste management, e-waste management
UNIT - II
Winning with Green IT- Basic Green Concepts, Green and IT, IT Ecosystem, Why 10 Hours
Green IT now, Do’s and Don’ts of Green IT, Making business case for Green IT,
Policies for change, balancing carbon Foot print, Standards and Metrics, Emerging
standards with IT practices, reviewing Established and emerging Standards Assessing
organization’s current energy and needs, Understanding energy terms and terminology,
Building Audit for energy requirement, policy based management, Efficiency factors,
Carbon reduction options, putting a master plan for go green
UNIT - III
Greening the data center, foundation for Green data management, formalizing best 10 Hours
practices for Green IT, Information life cycle management, Tired storage architecture,
Going greener with Hosted Data Center Services, maximizing data center efficiency-
proper site selection, consolidating physical infrastructure, usage of green servers,
managing servers for energy efficiency, planning data center cooling factors- basics of
cooling system, bench marking cooling system’s efficiency , managing the storage
system from green perspective, managing the network to become green
UNIT - IV
Virtualization, understanding virtualization, building virtual infrastructure, enabling 06 Hours
virtual, using energy efficient machines, desktop virtualization, usage of thin client,
collaboration tools – text, voice, video, Video conference, Tele Presence Paperless
office, changing printing habits,
UNIT - V
Using digital documents, evaluating green gadgetry, powering gadgets intelligently, 06 Hours
greening the facility, lighting for less, landscaping in a sustainable way, Improving the
indoor environment, recycling throughout the office, usage of renewable energy, safe
disposal policy
Course Outcomes: At the end of the course student will be able to
1. Implement projects on solid and e-waste management.
2. Understand emerging standards related to Green IT.
46
Department of Master of Computer Applications
3. Identify best practices related to Green IT.
4. Apply tools related to Green IT.
5. Analyse digital documents related to Green IT.
Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes

Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO1 PSO2

↓ Course Outcomes 1
22MCA212.1 2 2 2 2 1
22MCA212.2 2 2 2 2 1
22MCA212.3 2 2 2 1 2 1
22MCA212.4 2 2 2 1 2 1
22MCA212.5 2 2 2 1 2 1
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Brain W. Kernighan and Rob Pike: The Practice of Programming, Addison – Wesley;
1999
REFERENCE BOOKS:
1. Carol Baroudi, Jeffrey Hill, Arnold Reinhold, JhanaSenxian : Green IT For Dummies, For
Dummies
2. BabakAkhgar; Colin Pattinson; Mohammad Dastbaz : Green Cloud Computing and Risk
Management, Morgan Kaufmann
3. Xiaodong Liu; Yang Li : Green Services engineering, Optimization, and Modeling in the
Technological Age, IGI Global
4. Basak : Environmental Studies, Pearson
E Books / MOOCs/ NPTEL
1. https://nptel.ac.in/courses/120108004

47
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

Soft Computing
Course Code: 22MCA213 Course Type PCE
Teaching Hours/Week (L:T:P:S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Prerequisites :

1.Critical thinking and problem solving skills.

2.A strong mathematical background.

Course Objectives:
1. Comprehend soft computing techniques and its applications.
2. Understand the artificial neural networks and its applications
3. Analyze the single-objective optimization problems using GAs
4. Develop the fuzzy logic sets and membership function and defuzzification
techniques.
5. Design of Hybrid system for solving the real life problems
UNIT - I
Neural Networks: 08 Hours
History, overview of biological Neuro-system, Mathematical Models of Neurons, ANN
architecture, Learning rules, Learning Paradigms-Supervised, Unsupervised and
reinforcement Learning, ANN training Algorithms perceptions, Training rules, Delta,
Back Propagation Algorithm, Multilayer Perceptron Model, Hopfield Networks,
Associative Memories, Applications of Artificial Neural Networks.
UNIT - II
Fuzzy Logic: Introduction to Fuzzy Logic, Classical and Fuzzy Sets: Overview of 07 Hours
Classical Sets, Membership Function, Fuzzy rule generation.
UNIT - III
Operations on Fuzzy Sets, Fuzzy Arithmetic, Fuzzy Logic, Uncertainty based 10 Hours
Information: Compliment, Intersections, Unions, Combinations of Operations,
Aggregation Operations .Fuzzy Numbers, Linguistic Variables, Arithmetic Operations
on Intervals & Numbers, Lattice of Fuzzy Numbers, Fuzzy Equations. Classical Logic,
Multivalve Logics, Fuzzy Propositions, Fuzzy Qualifiers, Linguistic Hedges.
Information & Uncertainty, Non specificity of Fuzzy & Crisp Sets, Fuzziness of Fuzzy
Sets.

UNIT - IV
Introduction of Neuro-Fuzzy Systems: Architecture of Neuro Fuzzy Networks, 08 Hours
Applications of Fuzzy Logic: Medicine, Economics etc.
Unit - V
Genetic Algorithms: An Overview, GA in problem solving, Implementation of GA. 06 Hours

48
Department of Master of Computer Applications
Course Outcomes: At the end of the course student will be able to
1. To understand the soft computing technique’s correlation with mathematical models.
2. To learn fuzzy logic and applications
3. To solve single-objective optimization and its applications using GAs.
4. To understand the Artificial neural network and its applications
5. To Implement genetic algorithms

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA213.1 1 2 3 3 2 2 1 3 2 1 1
22MCA213.2 2 1 3 1 2 1 1 2
22MCA213.3 2 1 2 1 3 2 1 3 1
22MCA213.4 3 2 3 3 1 1
22MCA213.5 2 2 3 3 2 2 1
1: Low 2: Medium 3: High

TEXT BOOKS :
1. Anderson J.A.: An Introduction to Neural Networks, PHI, 1999
2. Hertz J. Krogh, R.G. Palmer: Introduction to the Theory of Neural Computation, Addison -
Wesley, 1991
REFERENCE BOOKS:
1. G.J. Klir & B. Yuan: Fuzzy Sets & Fuzzy Logic, PHI, 1995
2. Melanie Mitchell: An Introduction to Genetic Algorithm, PHI, 1998
E Books / MOOCs/ NPTEL
1. Soft Computing, Samir Roy, Udit Chakraborty, Pearson Education India, 2013.
2. NPTEL Course: Introduction To Soft Computing , By Prof. Debasis Samanta | IIT
Kharagpur

49
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

Parallel Processing
Course Code: 22MCA214 Course Type PCE
Teaching Hours/Week (L:T:P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications

Prerequisites:

Fundamentals of Computer Organization.

Course Objectives:
1. Understand how to write and execute parallel programs
2. Study the concept of Distributed Memory Programming with MPI
3. Learn about Shared Memory Programming with Pthreads
4. Compare and contrast Shared Memory Programming with Pthreads and Shared Memory
Programming with OpenMP
5. Gain knowledge about Parallel Program Development and Parallel Algorithms
UNIT - I
Introduction to Parallel Processing : 04 Hours
Computing Need of Performance, Building Parallel Systems, Why to Write Parallel
Programs? How to Write Parallel Programs? Approach: Concurrent, Parallel,
Distributed.

Parallel Hardware and Parallel Software : 04 Hours

Background, Modifications to the von Neumann Model, Parallel Hardware, Parallel
Software, Input and Output, Performance, Parallel Program Design and Writing and
Running Parallel Programs.

UNIT - II
Distributed Memory Programming with MPI : 07 Hours
Getting Started, The Trapezoidal Rule in MPI, Dealing with I/O, Collective
Communication, MPI Derived Data types, A Parallel Sorting Algorithm.

UNIT - III
Shared Memory Programming with Pthreads : 08 Hours
Processes, Threads and Pthreads, Hello, World program ,Matrix-Vector Multiplication,
Critical Sections Busy-Waiting, Mutexes, Producer-Consumer Synchronization and
Semaphores, Barriers and Condition Variables, Read-Write Locks, Caches, Cache-
Coherence, and False Sharing and Thread-Safety.

50
Department of Master of Computer Applications
 UNIT - IV
Shared Memory Programming with OpenMP : 08 Hours
Introduction to OpenMP, The Trapezoidal Rulem Scope of Variables, The Reduction
Clause, The Parallel For Directive, More About Loops in OpenMP: Sorting,
Scheduling Loops, Producers and Consumers, Caches, Cache-Coherence, and False
Sharing and Thread-Safety.

UNIT - V
Parallel Program Development and Parallel Algorithms : 08 Hours
Two N-Body Solvers, Tree Search and Case Studies.

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

1. Explain how to write and execute parallel programs and why to write parallel programs
2. Demonstrate the concept of Distributed Memory Programming with MPI
3. Discuss about Shared Memory Programming with Pthreads
4. Compare and contrast Shared Memory Programming with Pthreads and Shared Memory
Programming with OpenMP
5. Explain about Parallel Program Development and Parallel Algorithms

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA214.1 3 3 3 3 2 3 3 3 3 3 3 2
22MCA214.2 3 3 2 2 3 2 3 3 3 2 3 2
22MCA214.3 3 3 2 2 3 2 3 3 3 2 3 2
22MCA214.4 3 3 3 3 2 2 3 3 3 3 3 2
22MCA214.5 3 3 3 3 2 3 3 3 3 3 3 2
1: Low 2: Medium 3: High

TEXT BOOKS:
1. An Introduction to Parallel Programming by Peter s. Pacheco. 2011. I Edition, Morgan
Kaufmann publishers
REFERENCE BOOKS:
1. Using OpenMP: Portable Shared Memory Parallel Programming, Gabriele Jost and
Ruudvander Pas The MIT Press (October 12, 2007)
2. Using MPI - 2nd Edition: Portable Parallel Programming with the Message Passing
Interface, William Group and Ewing Lusk, 1999, 2nd edition, MIT Press
3. Pthreads Programming: A Posix Standard for Better Multiprocessing, Dick Buttlar,
Jacqueline Farrell & Bradford Nichols .1996, I Edition , Oreilly
4. Introduction to Parallel Computing, by Niranjan N. Chiplunkar, Raju K., Wiley, 2020

51
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

Distributed Computing
Course Code: 22MCA215 Course Type PCE
Teaching Hours/Week (L: T: P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications

Prerequisites :
Student must have basic knowledge of Basics of Operating System, Unix System, System
Programming.
Course Objectives:
1. To learn issues related to clock Synchronization and the need for global state in distributed
systems.
2. To learn distributed Scheduling and Load Balancing and RPC algorithms.
3. To understand the significance of agreement, fault tolerance and recovery protocols in
Distributed Systems
4. To learn the characteristics of Distributed File Systems
5. To understand the security issues, access control and fault tolerance in Distributed
Computing
UNIT - I
Distributed System, Communication : 08 Hours
Introduction to Distributed System: Goals, Hardware concepts, Software concepts, and
Client-Server model. Examples of distributed systems.
Communication: Layered protocols, Remote procedures call, Remote object
invocation, Message-oriented communication, Stream-oriented communication.
Scheduling and Load Balancing: List Scheduling, Static Load Balancing, Dynamic
Load Balancing, Moore's Algorithm.

UNIT - II
Processes, Naming, Synchronization : 08 Hours
Processes : Threads, Clients, Servers, Code Migration, Software agent.
Naming: Naming entities, Locating mobile entities, Removing un-referenced entities.
Synchronization : Clock synchronization, Logical clocks, Global state, Election
algorithms, Mutual exclusion, Distributed transactions.

UNIT - III
Consistency and Replication, Fault Tolerance, Security : 07 Hours
Consistency and Replication: Introduction, Data centric consistency models, Client
centric consistency models, Replica management, Distribution protocols, Consistency
protocols

UNIT - IV
Fault Tolerance, Security : 08 Hours
Fault Tolerance: Introduction, Process resilience, Reliable client server communication,
52
Department of Master of Computer Applications
Reliable group communication. Distributed commit, Recovery.
Security: Introduction, Secure channels, Access control, Security management.

UNIT - V
Distributed File Systems : 08 Hours
Distributed File System: Architecture, Processes, Communication, Naming,
Synchronization, Consistency and replication, Fault tolerance, Security, Sun network
file system, CODA files system.
Case Study: CORBA, Distributed COM, Globe, Comparison of CORBA and DCOM,
Globe.

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

1. Demonstrate knowledge of the basic elements and concepts related to distributed system
technologies
2. Analyze the various techniques used for clock synchronization and mutual exclusion
3. Demonstrate the concepts of Resource and Process management and synchronization
algorithms
4. Understand the concepts of Replication, Fault Tolerance and Security
5. Apply the knowledge of Distributed File System to analyze various file systems like NFS,
AFS and the experience in building large-scale distributed applications.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓Course Outcomes 1 2
22MCA215.1 3 2 3 2 2 2 3 3 2
22MCA215.2 2 3 3 3 2 2 3
22MCA215.3 2 2 3 2 2 3 2
22MCA215.4 2 2 2 2 2 3 2
22MCA215.5 3 2 2 2 2 2
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Andrew S. Tanenbaum, Maarten van Steen, Distributed Systems: Principles and Paradigms,
2nd Edition, 2016
2.
1. G. Coulouris, J. Dollimore, and T. Kindberg, Distributed Systems: Concepts and Design,
Pearson Education, Fifth Edition, 2011

REFERENCE BOOKS:
1. M. Singhal, N. Shivaratri, Advanced Concepts in Operating Systems, TMH
2. M. L. Liu, Distributed Computing Principles and Applications, Pearson Addison Wesley,
2004
E Books / MOOCs/ NPTEL
1. https://onlinecourses.nptel.ac.in/noc21_cs87/preview

53
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

E-Commerce
Course Code: 22MCA221 Course Type PCE
Teaching Hours/Week (L:T:P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications

Prerequisites :

Advanced Web Technologies

Course Objectives:
1. Understand the importance of E-Commerce.
2. Understand the services of E-Commerce.
3. Understand the importance of EDI technology.
4. Apply tools related to security of E-commerce.
5. Understand threats related to E-commerce.
UNIT - I
E-commerce and its Technological Aspects Overview of developments in 06 Hours
Information Technology and Defining E-Commerce: The scope of E commerce,
Electronic Market, Electronic Data Interchange, Internet Commerce, Benefits and
limitations of E-Commerce, Produce a generic framework for E-Commerce,
Architectural framework of Electronic Commerce, Web based E Commerce
Architecture.
UNIT - II
Consumer Oriented E Commerce E-Retailing: Traditional retailing and e- Retailing, 07 Hours
Benefits of e retailing, Key success factors, Models of e-retailing, Features of e
retailing. E services: Categories of e-services, Web-enabled services, matchmaking
services, Information-selling on the web,
e entertainment, Auctions and other specialized services. Business to Business
Electronic Commerce
UNIT - III
Electronic Data Interchange: Benefits of EDI, EDI technology, EDI standards, EDI 10 Hours
communications, EDI Implementation, EDI Agreements, and EDI Security. Electronic
Payment Systems, Need of Electronic Payment System: Study and examine the use of
Electronic Payment system and the protocols used, Study Electronic Fund Transfer and
secure electronic transaction protocol for credit card payment. Digital economy:
Identify the methods of payments on the net. Electronic Cash, cheques and credit cards
on the Internet.

UNIT - IV
Security in E Commerce Threats in Computer Systems:Virus, Cyber Crime 08 Hours
Network Security: Encryption, Protecting Web server with a Firewall: Firewall and the
Security Policy, Network Firewalls and Application Firewalls, Proxy Server.
54
Department of Master of Computer Applications
 UNIT - V
Threats in e-Ecommerce : Basic Ethical Concepts, Candidate Ethical principles 08 Hours
Privacy and Information Rights: Information collected at E-Commerce Websites, The
Concept of Privacy, Legal protections Intellectual Property Rights: Types of
Intellectual Property protection
Course Outcomes: At the end of the course student will be able to
1. Understand the overall framework of E-commerce
2. Compare different e-retailing techniques.
3. Apply tools related to EDI technology.
4. Protect E-commerce from threats
5. Identify threats related to E-commerce.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA221.1 2 2 2 1 1
22MCA221.2 1 1 2 1 1
22MCA221.3 2 2 2 1 1
22MCA221.4 1 2 2 1 1
22MCA221.5 1 2 2 1 1
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Elias. M. Awad, Electronic Commerce & quot;, Prentice-Hall of India Pvt Ltd.
2. Ravi Kalakota, Andrew B. Whinston, Electronic Commerce-A Manager’s guide
Addison-Wesley.
3. Efraim Turban, Jae Lee, David King, H. Michael Chung, “Electronic Commerce A
Managerial Perspective”, Addison-Wesley.
4. Elias M Award, “Electronic Commerce from Vision to Fulfillment”, 3rd Edition, PHI, Judy
Strauss, Adel El-Ansary, Raymond Frost, “E-Marketing”, 3RDEdition, Pearson Education.
E Books / MOOCs/ NPTEL
1. https://onlinecourses.swayam2.ac.in/cec19_cm01/preview

55
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

Healthcare Analytics
Course Code: 23MCA222 22MCA222 Course Type PCE
Teaching Hours/Week (L:T:P:S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Prerequisites :
Knowledge of mathematics and statistics. Ability to learn with data storage, data warehousing, and
mining.
Course Objectives:
1. Understand the role that data analytics plays in healthcare operations
2. Be familiar with the characteristics of healthcare data, associated data systems, and
analytics tools
3. Understand the organizational needs and process to enact healthcare data analytics
4. Understand the Biomedical Information Mining and clinical applications
5. Mining of statistical model and visual analytics for health care
UNIT - I
Fundamentals of Healthcare Analytics : 06 Hours
Components of healthcare analytics, Data and information – Measurement, Metrics,
and Indicators. From data to knowledge. Analytics building blocks. Descriptive,
predictive, and prescriptive analytics. Healthcare analytics applications – an
introduction

Medical Images and Analytics : 04 Hours

Overview of Digital Imaging and Communications in Medicine (DICOM) standards.
Biomedical image analysis – biomedical Imaging modalities, object detection, image
segmentation, image registration, feature extraction.
UNIT - II
Mining of sensor data in healthcare : 08 Hours
Challenges of healthcare data analysis. Biomedical signal analysis – types of
biomedical signals, correlation analysis.
UNIT - III
Genomic Data and Analytics : 06 Hours
Genomic data analysis for personalized medicine – genomic data generation -
Microarray data, Next-Generation Sequencing, Public Database, Predictive models for
integrating clinical and genomic data – introduction, issues and challenges in
integrating clinical and genomic data, different types of integration.
UNIT - IV
Biomedical Information Mining and Social Media Analytics : 09 Hours
Electronic Health Records(EHR)-components of EHR, coding systems, benefits and
challenges of EHR. Natural language processing – core NLP Components –
Morphological Analysis, Lexical Analysis, Syntactic Analysis, Semantic Analysis,
Data Encoding, mining information from clinical text, challenges of processing clinical
reports, clinical applications.
56
Department of Master of Computer Applications
Social media analysis for healthcare
Social media analysis for detection and tracking of infectious disease. Social Media
Analysis for Public Health Research.
Unit - V
Advanced Healthcare Data Analytics : 06 Hours
Basic statistical prediction models, Alternative clinical prediction models, Survival
models, Evaluation and validation. Temporal data mining for healthcare data –
Association analysis, Temporal pattern mining.

Visual analytics for healthcare – Visual analytics for clinical workflow, visual
analytics for clinicians and patients.

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

1. To understand fundamentals of Healthcare Analytics
2. To create biomedical analytics
3. To perform genomic data and analytics
4. To understand social media analytics
5. Understand health care Analysis

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA222.1 1 2 3 3 2 2 1 3 2 2 3
22MCA222.2 2 1 3 3 1 1 1 3
22MCA222.3 2 1 2 1 3 2 1 3 3
22MCA222.4 3 2 3 3 1 3
22MCA222.5 2 2 3 3 2 1 3
1: Low 2: Medium 3: High

TEXT BOOKS :
1. C.K. Reddy and C.C. Aggarwal, Healthcare Data Analytics 2015
2. Christo ElMorr and Hossam Ali-Hassan, Analytics in Healthcare A Practical Introduction,
2019
REFERENCE BOOKS:
1. Adam Bohr and Kaveh Memarzadeh, “Artificial Intelligence in Healthcare”, Academic
Press, 2020.
2. H. Yangand E.K. Lee, Health care Analytics: From Data to Knowledge to Healthcare
Improvement, 2016
3. Richard Bibb, Dominic Egg beer and Abby Paterson, Medical Modelling, “The Application
of Advanced Design and Rapid Prototyping Techniques in Medicine”, 2nd Edition, 2015
E Books / MOOCs/ NPTEL
1. E-Book: Healthcare Analytics Made Simple
2. BIG DATA ANALYTICS FOR HEALTHCARE-source: Source: www.coursera.org

57
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

Accountancy and Financial Management

Course Code: 22MCA223 Course Type PCE
Teaching Hours/Week (L:T:P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50

Teaching Department: Master of Computer Applications

Course Objectives:
1. To understand the fundamentals of Accounting
2. To understand the Fundamentals of Cost Accounting
3. To understand Ratio Analysis
4. To understand Funds Flow Analysis and Cash Flow Analysis
5. To understand Budgeting
UNIT – I
Accounting: 08 Hours
Meaning and Definition of Accounting, Features, Objectives/Functions of Accounting.
Accounting concepts and conventions. Classification of accounts and rules of debit and
credit.
Journal: Meaning uses and problems on Journal Entries. Ledger : Meaning, uses and
problems on preparation of Ledger accounts. Trial Balance: Meaning, objectives and
problems on preparation of Trial Balance.

UNIT - II
Fundamentals of Cost Accounting: 08 Hours
Fundamentals of Cost Accounting: Meaning and Definition of Cost, Costing and Cost
Accounting: Objectives, Advantages and Disadvantages of Cost Accounting. Methods
of costing (Meaning Only). Classification of Cost: On the basis of elements, functions
and variability. Cost Sheet : Meaning, Uses and simple problems on preparation of
statement of cost (Preparation of Estimated Cost Sheet is excluded)
Marginal Costing:
Marginal Costing : Meaning and Definition of Marginal Cost and Marginal Costing.
Break-even-analysis: Meaning and significance. Break-even-chart: Meaning,
assumptions and uses contribution, P/V ratio, Margin of safety, Angle of Incidence.
Problems on Marginal Costing.

UNIT - III
Ratio Analysis: 08 Hours
Ratio Analysis: Meaning of Ratio Analysis, Advantages of Ratio Analysis, Limitations
of Ratio Analysis, Classification of Accounting Ratios-Liquidity Ratios, Leverage
Ratios, Activity Ratios, Probability Ratios. Simple problems on Computation of ratios

58
Department of Master of Computer Applications
 Unit – IV
Funds: 08 Hours
Funds Flow Analysis and Cash Flow Analysis: Meaning, Uses and Limitations of
Funds Flow and Cash Flow Statement. Differences between Cash Flow Analysis and
Funds Flow Analysis. Preparation of Funds Flow statements and cash Flow statements,
simple problems.

Unit – V
Budgetary Control: 07 Hours
Budgetary Control: Meaning of Budget and Budgetary control-Budgetary control as a
Management Tool-Limitations of budgetary control. Classification of budgets,
Problems on preparation of Flexible budget only.

Capital Budgeting:
Capital Budgeting Decisions: Meaning and Definition of Capital Budgeting, Objectives
of Capital Budgeting, Role of Capital Budgeting and Limitations of Capital Budgeting-
Factors affecting Capital Budgeting Decisions.

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

1. Understand and explain the fundamentals of Accounting
2. Understand and explain cost accounting and its types
3. Understand and explain ratio analysis
4. Understand and analyse funds flow cash flow
5. Understand and implement budgeting

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA223.1 2 1 2 2 2 2 2
22MCA223.2 2 1 2 2 2 2 2
22MCA223.3 2 1 2 2 2 2 2
22MCA223.4 2 1 2 2 2 2 2
22MCA223.5 2 1 2 2 2 2 2
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Jawahar Lal : Accounting for Management, Fourth Edition, Himalaya Publishing, 2006.
2. I M Pandey : Financial Management, Ninth Edition, Vikas Publishing, 2005.
REFERENCE BOOKS:
1. S N Maheshwari, Sultan: Financial and Management Accounting, Chand & Sons
2. Richard M Lynch, and Robert W Williamson: Accounting for Management, Third
Edition, Tata McGraw Hill.
3. Sukhla Grewal : Accountancy, First Edition, Sultan Chand & Sons
4. R L Gupta and Radha Swamy: Advanced Accounting, Tenth Edition, Sultan Chand & Sons.

59
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

Bioinformatics
Course Code: 22MCA224 Course Type PCE
Teaching Hours/Week (L:T:P:S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications

Prerequisites :
Basic knowledge of Data Analytics and Biology
Course Objectives:
1. Adapt basic knowledge on various techniques and areas of applications in bioinformatics.
2. Analyze common problem in bioinformatics, alignment techniques, ethical issues, public
data sources, and evolutionary modeling.
3. Evaluate the main databases at the NCBI resources.
4. Discover the practical use of tools for specific bioinformatics areas
5. Adopt important parameters for drug discovery
UNIT - I
Introduction to Bioinformatics : 7 Hours
What is bioinformatics: overview, major databases in bioinformatics, molecular
biology, Central DogmaData retrieval tools, gene structure Prokaryotic and Eukaryotic
genomes, sequence assembly, Gene mapping, networking and hardware fundamentals,
Internet and world wide web.
Unit - II
Sequence Alignment : 8 Hours
Alignment of Pairs of Sequences: Introduction, biological motivation of alignment
problems. Methods of Sequence Alignments-Dot Matrix Method, Using Scoring
Matrices. Measuring sequence detection efficiency, Dynamic Programming, Pair wise
database searching.

Unit - III
Gene Prediction : 9 Hours
Gene Identification and Prediction: Introduction, Basis of Gene Prediction, gene
perdition Methods: Feature based approach, other gene prediction tools, Conventional
determination of Open Reading Frames (ORF), Multiple Sequence Alignment :
Definition And Goal, The Consensus, Computational Complexity, Manual Methods,
Simultaneous Methods, Progressive Methods, Databases of Multiple Alignments And
Searching
Unit - IV
Secondary database Searching : 7 Hours
Secondary Database Searching: Importance And Need of Secondary Database
Searches, Secondary Database Structure and Building a Sequence Search Protocol,
structural and functional interpretation.

60
Department of Master of Computer Applications
 Unit - V
Drug Discovery : 8 Hours
Analysis Packages : Analysis Package Structure, Commercial Databases, Commercial
Software, Comprehensive Packages, Packages Specializing in DNA Analysis, Intranet
Packages, Internet Packages. Introduction: Areas influencing drug discovery,
important parameters in drug discovery, drug discovery technologies, target discovery
strategy, Strategy to identify possible drug targets.

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

1. Adapt the biological knowledge about molecular biology, gene mapping and networking.
2. Analyse methods of Sequence Alignments
3. Build gene perdition Methods: Feature based approach, other gene prediction tools
4. Demonstrate building a Sequence Search Protocol
5. Explain drug discovery technologies, strategy to identify possible drug targets
Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA224.1 2 3 2 3 3 2 3 2 2
22MCA224.2 3 2 2 2 1 2
22MCA224.3 2 2 3 3 3 2 1 1
22MCA224.4 1 2 3 2 2 1 1
22MCA224.5 1 2 2 3 1 1 2 3 3 1
1: Low 2: Medium 3: High

TEXT BOOKS:
1. T. K. Attwood, D. J. Parry-Smith, and S. Phukan, “Introduction to Bioinformatics”,
Pearson Education, 2001
2. S.C Rostogi , Mendiratta, P. Rasogi, “ Bio Informatics: methods and Applications”,
Second edition, PHI 2006

REFERENCE BOOKS:
1. Arthur M. Lesk, “Introduction to Bioinformatics”, Second Edition, Oxford University Press,
2005
2. Vittal R. Srinivas, “Bioinformatics – A Modern Approach”, Prentice-Hall of India Pvt. Ltd.,
2005
3. Jean Mickel Clavere & Cadrienotredom “Bio Informatics– A beginners guide” Wiley
Dream Tech, 2003

E Books / MOOCs/ NPTEL

1. Bioinformatics: Tools and Applications 2009th Edition, Kindle Edition
2. Bioinformatics –Algorithms and Applications

61
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

.NET Framework and C#

Course Code: 22MCA225 Course Type PCE
Teaching Hours/Week (L:T:P:S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Prerequisites :

Student must have some basic knowledge of computer system hardware and software
Course Objectives:
1. Understand the .NET framework.
2. Understand the concept of class hierarchy, method overloading. Overriding abstract classes
and interfaces, exception handling, I/O stream classes.
3. Understand the use of events and delegates, Use of multi-threading.
4. Understanding multithreading and I/O stream concepts.
5. Data access with ADO.NET
UNIT - I
Introduction to the .NET Platform : 03 Hours
Benefits of .NET Framework, Architecture of .NET Framework 4.0, Components of
.NET Framework 4.0: CLR, CTS, Metadata and Assemblies, .NET Framework Class
Library, Windows Forms.

Introducing C# : 04 Hours
Need of C#, C# Pre-processor Directives, Creating a Simple C# Console Application,
Identifiers and Keywords. Data Types, Variables and Constants: Value Types,
Reference Types, Type Conversions, Boxing and Unboxing, Variables and Constants.
Operator Precedence, Using the ?? (Null Coalescing)Operator, Using the :: (Scope
Resolution) Operator and Using the is and as Operators.

UNIT - II
Classes, Objects and Structures : 02 Hours
Classes and Objects: Creating a Class, Creating an Object, Using this Keyword,
Creating an Array of Objects, Using the Nested Classes, Defining Partial Classes and
methods, Static Classes and Static Class Members, Structures: Syntax of a struct and
Access Modifiers for structs, Enumerations.

Arrays and Strings : 01 Hours

Arrays, Multidimensional arrays, jagged arrays, Assigning array references, Foreach
loop, Strings of operator overloading

Methods : 01 Hours
Controlling access to class members, Pass objects to methods, Using ref and out
parameters, Using a variable number of arguments, Returning objects, Method
overloading, Constructors, Garbage collection and destructors, Overloading
constructors.
62
Department of Master of Computer Applications
Properties, Object- Oriented Programming Concepts : 03 Hours
Read-only Property, Static Property, Accessibility of accessors and Anonymous types.
Indexers, Encapsulation: Encapsulation using accessors and mutators, Encapsulation
using Properties.
Inheritance: Inheritance and Constructors, Sealed Classes and Sealed Methods,
Extension methods. Polymorphism: Compile time Polymorphism/ Overloading,
Runtime Polymorphism/ Overriding. Abstraction: Abstract classes, Abstract methods.
Interfaces: Syntax of Interfaces, Implementation of Interfaces, Interfaces and
Inheritance.

UNIT - III
Delegates, Events and Exception Handling : 05 Hours
Delegates: Creating and using Delegates, Multicasting with Delegates.
Events: Event Sources, Event Handlers, Events and Delegates, Multiple Event
Handlers. Exception Handling: System exception class, Exception handling
fundamentals, Consequences of an uncaught exception, Using multiple catch
statements, Catching all exceptions, Nested try blocks, Throwing an exception, Using
finally, Commonly used exceptions.

Namespaces, the Preprocessor and Assemblies : 03 Hours

Namespaces, Preprocessor, Assemblies and the internal access modifier; Runtime Type
ID, Reflection and Attributes: Runtime type definition, Reflection, Using Reflection,
Attributes, Using the built-in attributes

UNIT - IV
Multithreaded Programming : 03 Hours
Multithreading Fundamentals, Thread class, Determining the end of Thread,
IsBackground property, Thread priorities, Synchronization, Thread communication
using Wait(), Pulse(), PulseAll(), Using MethodImplAttribute, Suspending resuming
stopping threads, Determining threads state, Using the Main thread, Starting a separate
task
Working with Collections, Building Components : 02 Hours
Collections overview, Collection interfaces, Dictionary entry structure, General-
purpose collection class, Storing bits and BitArray, Specialized collections, Accessing a
collection using an enumerator.
Introduction to components, Overview of C# component, IComponent, Simple
component, Overriding Dispose(), Employing the using statement, Containers.
Using I/O : 02 Hours
C#'s I/O built in streams, Stream classes, Console I/O, FileStream and Byte-Oriented
file I/O, Character based file I/O, Redirecting the standard streams, Reading and
writing binary data, Using memory stream, Using StringReader and StringWriter.
UNIT - V
Graphical User Interface with Windows Forms : 03 Hours
Introduction, Windows Forms, Event Handling: A Simple Event- Driven GUI, Visual
Studio Generated GUI Code, Delegates and Event- Handling Mechanism, Another Way
to Create Event Handlers, Locating Event Information. Control Properties and Layout,
Labels, TextBoxes and Buttons, GroupBoxes and Panels, CheckBoxes and
63
Department of Master of Computer Applications
RadioButtons, ToolTips, Mouse-Event Handling, Keyboard-Event Handling.
Data Access with ADO.NET : 05 Hours
Data Access with ADO.NET: The need for ADO.NET, Faces of ADO.NET, Role of
ADO.NET Data Providers, Understanding the ADO.NET Namespaces, Types of
System.Data, Examining the DataColumn type, Examining the DataRow Type, Details
of the DataTable, Building a complete DataTable, Understanding the DataView
type
Understanding the role of the DataSet, Expressing relations using the DataRelation
type, Building a simple Test Database, Selecting a Data Provider, Types of the
System.Data.OleDb Namespace, Working with the Connected Layer of ADO.NET,
Working with the OleDbDataReader, Inserting, updating, and deleting records using
OleDbCommand, Executing a stored Procedure using OleDbCommand, Disconnected
layer and the OleDbDataAdapter type, Working with the SQL Data Provider.
Web Development Using .Net : 02 Hours
Introduction to MVC AND Razor.: Defining MVC, Basics of routing. Client Solutions
: JavaScript JQuery
Course Outcomes: At the end of the course student will be able to
1. To understand .net framework and c# program structure
2. To perform polymorphism and to use abstract classes
3. Use memory stream string reader and string writer, delegates and events.
4. To create multiple threads communication
5. Access and store data into backend databases using ADO.NET

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA225.1 3 3 3 1 2 1 1 1 2 3 2
22MCA225.2 1 1 3 3 2 1 1 1 1 1 1 1 3 3
22MCA225.3 1 1 1 1 1 1 1 1 2 3 1 1 3 3
22MCA225.4 1 1 1 1 3 1 1 1 1 1 1 1 3 2
22MCA225.5 1 3 1 2 1 1 1 1 1 1 1 1 3 3
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Herbert Schildt, The Complete Reference C#, TATA McGRAW-HILL edition
Chapters: 1 – 25
2. Andrew Troelsen, C# and .NET Platform ,Apress, 1st edition,2001. Chapter 17
REFERENCE BOOKS:
1. Ben Albahari, Peter Drayton and Brad Merril, "C# Essentials", SPD, 2001
2. "Microsoft C# Language Specifications", WP Publishers and Distributors Pvt. Ltd., 2001
E Books / MOOCs/ NPTEL
1. Object Oriented Programming using c#
2. C# 7.0 in a Nutshell: The Definitive Reference

64
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

Data Communication and Networks Lab

Course Code: 22MCA206 Course Type: PCC Lab
Teaching Hours/Week (L: T: P: S): 0:0:4:0 Credits: 02
Total Teaching Hours: 48 CIE + SEE Marks: 50+50
Teaching Department: Master of Computer Applications

Prerequisites :
Student must have some basic knowledge of computer system hardware and software.
Course Objectives:
1. To get practical knowledge of working principles of various communication protocols
2. To analyze the various routing algorithms and To know the concept of data/packet transfer
between nodes.
3. Analyse structure and formats of TCP/IP layer protocols using network tools like network
simulators.
4. Implementing various network algorithms such as error control, error detection, routing and
security related algorithms.
List of Experiments

1. Implementation of error detection mechanisms

2. Implementation of the congestion control algorithms.
3. Implementation of routing algorithms.
4. Implementation of client / server programs using TCP and UDP.
5. Implementation of RSA algorithm for encryption/Decryption of message between client &
server.
6. Implementation of frame sorting logic, to order frames received from multiple senders.
7. Implementation of TELNET.
8. Simulation of Networking components using any Network Simulation software
9. Implementation of wireless technology
10. Use of Open NMS and TCL tool.

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

1. Understand the practical approach to network communication protocols.
2. Understand the various Routing Protocols/Algorithms and Internetworking.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓Course Outcomes 1 2
22MCA206.1 3 3 3 3 2 3 3 2 3 3 3 1
22MCA206.2 3 3 2 2 3 3 3 3 3 2 3 1
1: Low 2: Medium 3: High

65
Department of Master of Computer Applications
REFERENCE BOOKS:
1. Cisco CCNA Study Guide v2.71, Aaron Balchunas
2. CCNA, Study Guide, 6th Edition, TodLammle
E Resources
1. https://www.isi.edu/nsnam/ns/
2. https://www.geeksforgeeks.org/network-simulator-3/

66
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

Enterprise Java Lab

Course Code: 22MCA207 Course Type: PCC Lab
Teaching Hours/Week (L:T:P: S): 0:0:4:0 Credits: 02
Total Teaching Hours: 48 CIE + SEE Marks: 50+50
Teaching Department: Master of Computer Applications

Prerequisites :

Student must have basic knowledge of Object Oriented Programming concepts.

Course Objectives:
1. To understand and implement Object Oriented Programming in Java, handling of
exceptions and multithreaded programs.
2. To understand and implement network and distributed programming in Java
3. To understand Java APIs to connect to a backend database and development of Graphic
User Interface for Java Applications.
4. To understand and implement Java components as well as develop web applications in
Java.
List of Experiments
1. Programs to implement encapsulation, abstraction, inheritance and polymorphism
2. Programs to handle Exceptions
3. Implementation of Multithreading Programs.
4 Implementation of Stream classes.
5. Network programming using Sockets and Datagrams
6. Implementation of RMI
7. Implementation of Swing components
8. Programs to connect to backend databases using JDBC
9. Component development using BDK
10. Development of Server sided programs using servlets
11. Implementation of Spring Boot 2.0

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

1. Develop Java applications using Object Oriented Programming features, exception
handling, multithreading, networking and distributed computing features.
2. Develop Java applications that connect to a backend database, provide Graphic User
Interface, develop Custom components as well as web applications.
Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA207.1 3 3 3 3 3 3 3
22MCA207.2 3 3 3 3 3 3 3
1: Low 2: Medium 3: High

REFERENCE BOOKS:
1. Herbert Schildt : Java: The Complete Reference, Eleventh Edition, Tata McGraw
67
Department of Master of Computer Applications
 Hill., 2019
2. Java Server Programming Java EE 7 (J2EE 1.7), Black Book, Dreamtech press 2014
3. Mastering Spring Boot 2.0: Build modern, cloud-native, and distributed systems using
Spring Boot, Dinesh Rajput, Pack Publishing Ltd., 2018
4. Dr. Donald Doherty and Rick Leinecker : JavaBeans Unleashed
5. James Goodwill : Developing Java Servlets
6. Karl Avedal, Danny Ayers : Professional JSP
7. Ed Roman : Mastering Enterprise JavaBeans

68
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

Operating Systems with UNIX Lab

Course Code: 22MCA208 Course Type: PCC Lab
Teaching Hours/Week (L:T:P: S): 0:0:4:0 Credits: 02
Total Teaching Hours: 48 CIE + SEE Marks: 50+50
Teaching Department : Master of Computer Applications

Prerequisites

Student should have knowledge about computer organization, different parts of computer system
and also high level languages like C.

Course Objectives:
1. Should be able to implement all scheduling algorithms.
2. Should be able to implement Bankers algorithm.
3. Implement page replacement algorithm
4. Develop shell scripts and implement basic commands
List of Experiments
1. Write a program to create five child processes using system call fork() and display their
ids.
2. Write a program to implement FCFS scheduling algorithm to determine average waiting
time and average turnaround time.
3. Write a program to implement SJF scheduling algorithm (pre emptive and non-
preemptive) to determine average waiting time and average turnaround time.
4. Write a program to implement Round Robin scheduling algorithm to determine average
waiting time and average turnaround time.
5. Write a program to implement priority scheduling algorithm to determine average
waiting time and average turnaround time.
6. Implement Banker’s algorithm to determine whether the given system of ‘n’ number of
processes is in safe state and also implement the Resource request algorithm
7. Simulate the memory management page replacement algorithm FIFO and Calculate the
number of page faults for the given reference string.
8. Write a program to demonstrate Optimal page replacement algorithm to determine
number of page faults.
9. Simulate the memory management page replacement algorithm LRU. Calculate the
number of page faults for the given reference string.
10. Develop shell scripts to demonstrate the utility of basic Unix commands like echo, pwd,
who, grep, sort, cut, paste, pipe, tee, cat, more, tty, stty, spell and such other simple
commands/filters using appropriate Unix/Linux platform.
69
Department of Master of Computer Applications
Course Outcomes: At the end of the course student will be able to
1. Understand and implement fork system call and implement scheduling algorithms.
2. Implement bankers algorithm, page replacement algorithms, shell scripts and execute
basic UNIX commands

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA208.1 3 3 3 3 3 3 3 3 3 2
22MCA208.2 3 3 3 3 3 3 3 3 3 2
1: Low 2: Medium 3: High

REFERENCE BOOKS:
1. Sumitabha Das: UNIX Concepts and Applications, 4th Edition, Tata McGraw Hill, 2006.
2. UNIX: The Complete Reference: Kenneth Roson et al, Osborne/McGraw Hill, 2000.
E Resources
1. https://www.oreilly.com/library/view/learning-the-unix/1565923901/

70
Department of Master of Computer Applications
 Syllabus of II Semester MCA (Master of Computer Applications)

Technical Seminar and Report Writing

Course Code: 22MCA209 Course Type: Seminar
Teaching Hours/Week (L:T:P: S): 0:0:0:2 Credits: 01
Total Teaching Hours: 24 CIE Marks: 50
Teaching Department: Master of Computer Applications
Course Objectives:
1. To learn to prepare for a seminar on a technical topic and present it effectively using
overhead projectors and presentation software.
2. To learn to prepare a well formatted and well organized report with appropriate content
using report preparation software.

The student will prepare for a seminar on a technical topic and present it. A panel consisting faculty
members will evaluate the presentation and marks will be provided. The student will submit a report
on the same. For the preparation of the presentation the student will refer technical papers from
journals. The presentation will be prepared using LaTex tool.

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

1. Review a technical topic
2. Present effectively
3. help the students face placement interviews.
4. Prepare a well organized report with appropriate content

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA209.1 3 1 2 3 2 2 3 3 3 3 2
22MCA209.2 3 1 2 3 3 3 3 2
22MCA209.3 1 1 1 3 1 3 3 3 2
22MCA209.4 3 2
1: Low 2: Medium 3: High

REFERENCE BOOKS:
1. Naomi Karten, “Presentation Skills for Technical Professionals: Achieving Excellence
(Soft Skills for It Professionals)” – 23 Sept. 2010
2. Fink, A., 2009. Conducting Research Literature Reviews: From the Internet to Paper. Sage
Publications
3. Day, R .A., 1992. How to Write and Publish a Scientific Paper, Cambridge University Press.

71
Department of Master of Computer Applications
 Syllabus of III Semester MCA (Master of Computer Applications)

Artificial Intelligence and Machine Learning

Course Code: 22MCA301 Course Type PCC
Teaching Hours/Week (L:T:P: S) 3:1:0:0 Credits 04
Total Teaching Hours 52 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications

Prerequisites :

Student must have an understanding of statistics, probability, calculus, linear algebra and knowledge
of programming.

Course Objectives:
1. To understand the advantages and types of Artificial Intelligence
2. To understand machine learning, the need for machine learning and its types
3. To understand data preprocessing and its importance
4. To understand and implement supervised, unsupervised and deep learning algorithms.
5. To learn the performance evaluation of the models built.
UNIT - I
Artificial Intelligence: 10 Hours
What is AI; Why Artificial Intelligence; Goals of AI; Advantages and disadvantages of
AI; Applications of AI, Types of AI

UNIT - II
Machine learning: 10 Hours
What is ML; Need for ML; Challenges and applications of ML; classification:
Supervised, Unsupervised, Reinforcement learning, AI vs Machine learning, Data
Preprocessing.

UNIT - III
Regression: 12 Hours
Simple, Linear Regression, Multiple Regression, Polynomial Regression, Logistic
Regression, Decision Trees, Support Vector Machines, Naive Bayesian Learning,
Evaluating Regression model performance.

Unit - IV
Clustering: 08 Hours
K-Means Clustering, Hierarchical Clustering, K-NN, Principal Component Analysis,
Reinforcement Learning

Unit - V
Deep Learning and Artificial Neural Networks: 12 Hours
Introduction to deep learning, The Neuron, How do Neural network learn and work?
Gradient descent, Back Propagation, ANN in python, Convolutional Neural Networks.
72
Department of Master of Computer Applications
Course Outcomes: At the end of the course student will be able to
1. Understand the concepts of Artificial Intelligence and its types.
2. Differentiate between unsupervised and Supervised Learning
3. Understand and implement Data Preprocessing
4. Understand and implement machine learning and deep learning algorithms
5. Evaluate the performance of the model built.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO1 PSO2
↓ Course Outcomes
22MCA301.1 3 3 3 3 3 3 3 3 2 3 3 3 3 3
22MCA301.2 3 3 3 3 3 3 3 3 2 3 3 3 3 3
22MCA301.3 3 3 3 3 3 3 3 3 2 3 3 3 3 3
22MCA301.4 3 3 3 3 3 3 3 3 2 3 3 3 3 3
22MCA301.5 3 3 3 3 3 3 3 3 2 3 3 3 3 3
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Cosma Rohilla Shalizi, Advanced Data Analysis from an Elementary Point of View, 2015
2. Tom M Mitchell,“ Machine Lerning”,1st Edition, McGraw Hill Education, 2017.
3. Elaine Rich, Kevin K and S B Nair, “Artificial Intelligence”, 3rd Edition, McGraw Hill
Education, 2017
4. Saroj Kaushik, Artificial Intelligence, Cengage learning, 2014
REFERENCE BOOKS:
1. Introduction to Machine Learning with Python - A Guide for Data Scientists (Muller
Andreas)
2. Data Science: Concepts and Practice - By Vijay Kotu, Bala Deshpande 2nd edition,
Publisher -Morgan Kaufmann, 2018
3. Allen B. Downey, “Think Python: How to Think Like a Computer Scientist‘‘, 2nd edition,
Updated for Python 3, Shroff/O‘Reilly Publishers, 2016
4. Data Science For Dummies, Lillian Pierson, John Wiley & Sons, 21-Feb-2017

73
Department of Master of Computer Applications
 Syllabus of III Semester MCA (Master of Computer Applications)

Advanced Web Technologies

Course Code: 22MCA202 Course Type PCC
Teaching Hours/Week (L:T:P: S) 3-1-0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Prerequisites :
Student must have some basic knowledge of HTML, CSS, web browsers, development tools,
scripting language, front-end and back-end development.

Course Objectives:
1.
To understand and apply the principles of XHTML, CSS, HTML5, and Bootstrap, and develop the
skills to create structured web pages, implement effective styling, leverage the features of HTML5
for modern web development, and utilize Bootstrap for responsive and visually appealing designs.
2.
To understand PHP scripting language and its applications in web development.
3.
To understand JavaScript and its programming concepts, and overview of XML key
components.
4 To understand JavaScript execution environment and different event handler techniques.
5. To understand jQuery concept and its effects, and provide an introduction to AngularJS.
UNIT - I
XHTML, CSS, HTML5, BOOTSTRAP 2 Hours
XHTML: Standard Structure, Basic Text Markup, Lists, Tables, Forms, Frames.
CSS: Introduction, Levels of Style Sheets, Selector Forms, Property Value Forms, 3 Hours
Font Properties, List Properties, Color, Alignment of Text, The Box Model, The
<span> and <div> tags.
HTML5 : Introduction of html5, iframes, layout, responsive web design(view 3 Hours
port),computer code, new semantics elements in HTML5, Migration, canvas, svg, input
types, new form elements and attribute, google map, media(audio, video)
BOOTSTRAP: Introduction of Bootstrap, First Web Page with Bootstrap, Bootstrap 4 Hours
Grid system, CDN, Tables, Images, Jumbotron and Page Header, Wells, Alerts,
Buttons, Badges and Labels, Progress Bars, List Groups, Navigation Bar, Forms,
Form Inputs, Media Objects, Carousel Plug-in
UNIT -II
PHP 8 Hours
Overview of PHP and uses of PHP, General Syntactic Characteristics, Primitives,
Operations and expressions, Control Statements, Arrays, Functions, Pattern Matching,
Form Handling, Files,
Advanced PHP: 4 Hours
Cookies, Session tracking, Database Access with PHP and MySQL.
UNIT - III
JavaScript, XML 6 Hours
JavaScript
74
Department of Master of Computer Applications
Overview of JavaScript, Object Orientation and JavaScript, Syntactic Characteristics,
Screen Output and Keyboard Input, Control Statements, Object Creation and
Modification, Arrays, Functions, Constructors, Pattern Matching.
XML 4 Hours
Introduction, Syntax, Document Structure, Document Type Definitions, Namespaces,
XML Schemas, Displaying Raw XML Documents, Displaying XML Documents with
CSS.
Unit - IV
Dynamic Documents with JavaScript 8 Hours
JavaScript Execution Environment, The Document Object Model, Element Access in
JavaScript, Events and Event Handling, Handling Events from the Body Elements,
Button Elements, Text Box and Password Elements, The Navigator Object.

Introduction to dynamic documents, Positioning Element, Moving Elements, Element

Visibility, Changing Colors and Fonts, Dynamic Content, Stacking Elements,
Locating the Mouse Cursor, Reacting to a Mouse Click, Slow Movement of Elements,
Dragging and Dropping Elements.
Unit - V
JQUERY 5 Hours
Introduction,Syntax, selectors, events, JQuery HTML, Effects.

Introduction to Angular JS: 5 Hours

What is AngularJS? Angular Directives, AngularJS Expression, Angular Expression,
AngularJS Module, AngularJS Controller, AngularJS Filter.

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

1. Create well-structured web pages using XHTML, apply CSS styling techniques, utilize
HTML5 features for modern web development, and design responsive websites using
Bootstrap, demonstrating proficiency in web development with these technologies.
2. Develop proficiency in PHP programming by demonstrating knowledge of its manipulate
arrays, create functions, handle form data, manage files, utilize cookies and session
tracking, and interact with MySQL databases.
3. Develop proficiency in JavaScript programming as well as gain a solid understanding of
XML.
4. Develop proficiency in JavaScript for creating dynamic web documents.
5. Effectively use jQuery to manipulate HTML elements and enabling to apply jQuery for
dynamic web development and explore further possibilities with AngularJS.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO1 PSO2
↓ Course Outcomes
22MCA302.1 3 2 3 3 3 3 3 3 3 3 3 3
22MCA302.2 3 2 3 3 3 3 3 3 3 3 3 3
22MCA302.3 2 2 3 3 3 3 3 3 3 3 3 3
22MCA302.4 3 2 3 3 2 2 2 2 2 2 3 3
22MCA302.5 3 2 3 3 2 2 2 2 2 2 3 3
1: Low 2: Medium 3: High

75
Department of Master of Computer Applications
TEXT BOOKS:
1. Robert W. Sebesta: Programming with World Wide Web, IV Edition, Pearson
Education, 2008.
2. Snig Bhaumik: Bootstrap Essentials, PACKT publishing, open source
3. Bear Bibeault: JQuery in Action, Manning Publications.
4 Nicholas C Zakas et al: Professional AJAX, Wrox publications, 2006.
5 Francis Shanahan: Mashups, Wrox, 2007.
REFERENCE BOOKS:
1. M. Deitel, P.J. Deitel, A. B. Goldberg: Internet & World Wide Web, How to Program, 5th
Edition, Pearson Education, 2008
2 Chris Bates: Web Programming Building Internet Applications, 3rd Edition, Wiley
India, 2007.
3 Xue Bai et al: The Web Warrior Guide to Web Programming, Cengage Learning, 2001
4 Thomas A. Powel: Ajax The Complete reference, McGraw Hill, 2008.
5 Gottfried Vossen, Stephan Hagemann: Unleashing Web 2.0 From Concepts to
Creativity, Elsevier, 2007.
6 Steven Holzner : Ajax Bible Wiley India , 2007.
7 Justin Gehtland et al: A Web 2.0 primer Pragmatic Ajax, SPD Publications, 2006.
8 Eric Van derVlist et al: Professional Web 2.0 Programming, Wiley India, 2007.
9 Jake Spurlock: Bootstrap- Responsive Web Development, O’Reilly Media, 2014.

76
Department of Master of Computer Applications
 Syllabus of III Semester MCA (Master of Computer Applications)

Mobile Computing and Application Development

Course Code: 22MCA331 Course Type PCE
Teaching Hours/Week (L:T:P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Prerequisites :

Student should have basic knowledge of Computer networking and programming.

Course Objectives:
1. Introduce the student with concept of Mobile Computing and its architecture
2. Discuss the evolution of Mobile Communication system over different generations
3. Describe various components of Android Mobile Apps and use them in app development
4. Design applications using various UI controls supported by Android
5. Learn to work with data from various sources for Mobile Applications

UNIT - I
Introduction to Mobile Computing : 02 Hours
Introduction, Architecture for Mobile Computing

Evolution of Wireless Cellular Networks : 06 Hours

GSM: GSM Architecture, Entities, Call routing in GSM, GSM Addresses and
Identities, GPRS: Introduction, GPRS Network Architecture, GPRS Network
Operations, Third Generation Networks and features, Fourth Generation Networks and
features, Fifth Generation technology and benefits.

UNIT - II
Basics of Android : 08 Hours
Introduction to Android, Build your first app, Layouts, Views and Resources, Text and
Scrolling Views

UNIT - III
Activities and Intents : 08 Hours
Activities: Activity Life cycle and states, Intents: Implicit intents and Explicit intents

UNIT - IV
User Experience : 08 Hours
User Interaction: input controls, Menus, Screen navigation, Recycler View; Delightful
user experience: drawables, styles and themes.

UNIT - V
Working in the background : 03 Hours
Broadcasts, Services, Notifications

77
Department of Master of Computer Applications
Working with data : 04 Hours
Storing data, Working with SQLite database, Content Providers

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

1. Understand the architecture of Mobile Computing and evolution of Mobile Communication
technologies
2. Install and run basic Android applications on Mobile device and emulator
3. Summarize Activity Life cycle and develop apps with intents
4. Design Android applications with different Android user interface elements to give a
delightful experience to the user
5. Develop Android applications incorporating databases

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA331.1 3 3 2 2 1 1 1 1
22MCA331.2 3 2 1 1 1 2
22MCA331.3 2 3 3 2 1 2
22MCA331.4 2 2 2 3 3 1 2
22MCA331.5 3 2 3 1 2 1 3
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Dr. Ashok Talukder, Ms. Roopa Yavagal, Mr. Hasan Ahmed: Mobile Computing
Technology, Applications and Service Creation, 2nd Edition, Tata McGraw Hill, 2010
2. Alexander Kukushkin-Introduction to Mobile Network Engineering, 1st Edition, Wiley
2018
3. Erik Hellman, “Android Programming – Pushing the Limits”, 1st Edition, Wiley India
PvtLtd, 2014

REFERENCE BOOKS:
1. Dawn Griffiths and David Griffiths, “Head First Android Development”, 1st Edition,
O’Reilly SPD Publishers, 2015
2. J F DiMarzio, “Beginning Android Programming with Android Studio”, 4th Edition, Wiley
India Pvt Ltd, 2016. ISBN-13: 978-8126565580
3. Anubhav Pradhan, Anil V Deshpande, “Composing Mobile Apps” using Android, Wiley
2014, ISBN: 978-81-265-4660-2

E Books / MOOCs/ NPTEL

1. Google Developer Training Material
https://google-developer-training.github.io/android-developer-fundamentals-course-
concepts-v2/

78
Department of Master of Computer Applications
 Syllabus of III Semester MCA (Master of Computer Applications)

Digital and Social Media Marketing

Course Code: 22MCA332 Course Type PCE
Teaching Hours/Week (L: T: P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Prerequisites :
Student must have basic knowledge about management and Ideas on social media
Course Objectives:
1. To learn about basics of digital marketing
2. To learn concepts on Ad campaigns and internet marketing
3. To understand the significance of Social media marketing
4. To learn about SEO, SEM, Web Analytics, Mobile Marketing, Trends in Digital Advertising
5. To understand the social media strategies and channels.
UNIT - I
Introduction to Digital Marketing : 08 Hours
Evolution of Digital Marketing from traditional to modern era, Role of Internet; Current trends,
Info-graphics, implications for business & society; Emergence of digital marketing as a tool;
Drivers of the new marketing environment; Digital marketing strategy; P.O.E.M. framework,
Digital landscape, Digital marketing plan, Digital marketing models.

UNIT - II
Internet Marketing and Digital Marketing : 08 Hours
Mix – Internet Marketing, opportunities and challenges; Digital marketing framework; Digital
Marketing mix, Impact of digital channels on IMC; Search Engine Advertising: - Pay for Search
Advertisements, Ad Placement, Ad Ranks, Creating Ad Campaigns, Campaign Report Generation
Display marketing: - Types of Display Ads - Buying Models - Programmable Digital Marketing -
Analytical Tools - YouTube marketing.

UNIT - III
Social Media Marketing : 07 Hours
Role of Influencer Marketing, Tools & Plan– Introduction to social media platforms, penetration &
characteristics; Building a successful social media marketing strategy Facebook Marketing: -
Business through Facebook Marketing, Creating Advertising Campaigns, Adverts, Facebook
Marketing Tools Linkedin Marketing: - Introduction and Importance of Linkedin Marketing,
Framing Linkedin Strategy, Lead Generation through Linkedin, Content Strategy, Analytics and
Targeting Twitter Marketing : Introduction to Twitter Marketing, how twitter Marketing is
different than other forms of digital marketing, framing content strategy, Twitter Advertising
Campaigns Instagram and Snapchat: - Digital Marketing Strategies through Instagram and
Snapchat Mobile Marketing: Mobile Advertising, Forms of Mobile Marketing, Features, Mobile
Campaign Development, Mobile Advertising Analytics Introduction to social mediametrics

UNIT - IV
Introduction to SEO, SEM, Web Analytics, Mobile Marketing, Trends in Digital Advertising 08 Hours
:
Introduction and need for SEO, How to use internet & search engines; search engine and its
79
Department of Master of Computer Applications
working pattern, On-page and off-page optimization, SEO Tactics - Introduction to SEM Web
Analytics: - Google Analytics & Google AdWords; data collection for web analytics, multichannel
attribution, Universal analytics, Tracking code Trends in digital advertising

UNIT - V
Social Media Channels: 08 Hours
Introduction, Key terms and concepts, Traditional media vs Social media. Social media channels:
Social networking. Content creation, Bookmarking & aggregating and Location & social media.
Tracking social media campaigns. Social media marketing: Rules of engagement. Advantages and
challenges.
Social Media Strategy: Introduction, Key terms and concepts. Using social media to solve business
challenges. Step-by-step guide to creating a social media strategy. Documents and processes.
Dealing with opportunities and threats. Step-by-step guide for recovering from an online brand
attack. Social media risks and challenges

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

1. Recognize appropriate e-marketing objectives
2. Appreciate the e-commerce framework and technology.
3. Illustrate the use of search engine marketing, online advertising and marketing strategies.
4. Use social media & create temples.
5. Develop social media strategy’s to solve business problems.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓Course Outcomes 1 2
22MCA332.1 3 2 3 2 2 2 3 3 2
22MCA332.2 2 3 3 3 2 2 1
22MCA332.3 2 2 3 2 2 3 2
22MCA332.4 2 3 2 2 2 3 2
22MCA332.5 3 2 3 2 2 2 2
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Seema Gupta “Digital Marketing” Mc-Graw Hill 1st Edition – 2017
2.
1. Internet Marketing: Integrating Online and Offline Strategies. M. L. Roberts and Debra Zahay,
3rd edition, Cengage Publishing, 2013
REFERENCE BOOKS:
1. Digital Marketing: Strategy, Implementation and Practice, Chaffey D., Ellis-Chadwick, 5th
Edition, F., Pearson, 2012
2. Puneet Singh Bhatia “Fundamentals of Digital Marketing” Pearson 1st Edition–2017
E Books / MOOCs/ NPTEL
1. https://www.udemy.com/topic/social-media-marketing/

80
Department of Master of Computer Applications
 Syllabus of III Semester MCA (Master of Computer Applications)

Software Risk Identification and Management

Course Code: 22MCA333 Course Type PCE
Teaching Hours/Week (L: T: P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Prerequisites :
Student must have basic knowledge on software engineering and its development.
Course Objectives:
1. Understand the concepts and principles of Risk Management
2. Apply the concepts and principles of Continuous Risk Management
3. To learn about the activity planning and risk management principles.
4. To develop skills to manage the various supporting practices.
5. To Deploy Risk management and various environmental classes
UNIT - I
Introduction, risk items, risk resolution techniques, and heuristics risk list risk-action 08 Hours
list, risk-strategy model, risk-strategy, analysis.

UNIT - II
A Holistic Vision of Software Risk Management, Temporal Dimension, 08 Hours
Methodological Dimension, Human Dimension, Graphic Representation of the Holistic
Vision of Software Risk Management

UNIT - III
Software Risk Management Methodologies, Basic constructs to Risk Management, 07 Hours
Risk Management Paradigm, Risk Taxonomy, Risk Clinic

UNIT - IV
Supporting practices, Software Risk Evaluation (SRE) practice, Continuous Risk 08 Hours
Management (CRM), Team Risk Management (TRM), Methodological framework for
Software Risk Management (SRM), Software Capability Maturity Model (SW-
CMMSM), Software Acquisition-Capability Maturity Model (SA-CMMSM)

UNIT - V
Deployment of the SEI Risk Management program, Major classes within the 08 Hours
Hierarchy, Major elements of Risk within each class, Major attributes within each
element and class, Product engineering class, Development environment class,
Program constraints class

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

1. Understand Risk Management principles
2. Estimate the risks involved in various project activities
3. Gain extensive knowledge about activity planning in Risk management
4. Be able to use key methods and tools
81
Department of Master of Computer Applications
5. Be able to tailor Continuous Risk Management to a project.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓Course Outcomes 1 2
22MCA333.1 3 2 3 2 2 2 3 3 2
22MCA333.2 2 3 3 3 3 2 2 1
22MCA333.3 2 2 3 2 2 3 2
22MCA333.4 2 3 2 2 2 3 2
22MCA333.5 3 2 3 2 2 2 2 2
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Barry W. Boehm, “Software risk: management principles and practices”, reprinted from vol-
8.
2. Implementing Enterprise Risk Management, John Wiley & Son, Inc., Hoboken, New Jersey.
John R.S. Fraser, Betty J. Simkins, Kristina Narvaev, 2015

REFERENCE BOOKS:
1. Robert K. Wysocki ―Effective Software Project Management‖ – Wiley Publication, 2011.
2. Risk management notes [Online]. Available:
http://agile.csc.ncsu.edu/SEMaterials/RiskManagement.pdf
E Books / MOOCs/ NPTEL
1. https://www.udemy.com/course/introduction-to-software-project-risk-management/

82
Department of Master of Computer Applications
 Syllabus of III Semester MCA (Master of Computer Applications)

Industrial and Medical IOT

Course Code: 22MCA334 Course Type PCE
Teaching Hours/Week (L:T:P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department : Master of Computer Applications

Prerequisites :

Student must have a basic computer skills.

Course Objectives:
1. Introduce evolution of internet technology and need for IoT with its characteristics.
2. Discuss on IoT reference layer and various protocols and software with its application.
3, Train the students to build IoT systems using arduino, Raspberry Pi and open source IoT
platforms.
4. Make the students to apply IoT data for business solution in industrial IoT.
5. Understand the applications of medical IoT in various domain in secured manner.
UNIT - I
Introduction to IoT: 04 Hours
Defining IoT, Characteristics of IoT, Sensors, types of sensors, actuator and smart
object
Physical design of IoT :
Things in IoT, IoT protocol.

Logical design of IoT : 04 Hours

Functional blocks of IoT, Communication models & APIs.
IoT & M2M :
Machine to Machine, Difference between IoT and M2M

UNIT - II
IoT levels & Deployment templates 04 Hours
Developing IoTs :
IoT design methodology, Case study on IoT system for weather monitoring.

Applications of IoT : 04 Hours

Case study of home automation, Case study of smart parking and Case study of smart
irrigation.

UNIT - III
IoT Physical device & Endpoint : 08 Hours
Basic building blocks of an IoT device, Introduction to Raspberry Pi, About board,
Programming raspberry Pi with python, Introduction to arduino board, Programming
arduino device.

83
Department of Master of Computer Applications
 UNIT - IV
Industrial IoT : 07 Hours
What is IIOT? IOT Vs. IIOT, History of IIOT, Benefits of IIoT
IIoT-An analysis framework-review of existing IoT taxonomies, industry sector,
location, connectivity. Case Study

UNIT - V
Internet of Medical Things : 08 Hours
IoMT and Telehealth, Relation of IoMT with Telehealth and Telemedicine, Benefits of
IoMT, IoMT Provider Benefits, Challenges of implementing IoMT, IoMT Devices,
Importance of security for IoMT, IoMT Vs IoT.
Course Outcomes: At the end of the course student will be able to
1. Able to learn and understand the characteristics and protocols of Internet of Things .
2. Able to understand the design methodology of IoT with its application.
3, Able to understand the working of Raspberry Pi and Arduino board.
4. Able to know the functionality of industrial IoT.
5. Able to understand the functionalities of medical IoT.
Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA334.1 3 3 3 2 1 3 3 3
22MCA334.2 3 3 3 3 3 2 1 1 2 3 3
22MCA334.3 3 3 2 3 3 2 1 2 3 3
22MCA334.4 2 3 2 2 3 3 3
22MCA334.5 3 3 2 2 3 3 3
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Vijay Madisetti, Arshdeep Bahga, “Internet of Things: A Hands -On Approach”
2. David Hanes, Gonzalo Salgueiro, Rob Barton "IoT Fundamentals: Networking
Technologies, Protocols and Use Cases for the Internet of Things", 2019
REFERENCE BOOKS:
1. Francis daCosta, “Rethinking the Internet of Things: A Scalable Approach to Connecting
Everything”, 1st Edition, Apress Publications, 2013
2. Waltenegus Dargie, Christian Poellabauer, "Fundamentals of Wireless Sensor Networks:
Theory and Practice"
3. Hugh Boyes⁎, Bil Hallaq, Joe Cunningham, Tim Watson “The industrial internet of things
(IIoT): An analysis framework”. Published by Elsevier
E Books / MOOCs/ NPTEL
1. https://www.splunk.com/en_us/data-insider/what-is-the-internet-of-medical-things-
iomt.html#iomt-and-telehealth

84
Department of Master of Computer Applications
 Syllabus of III Semester MCA (Master of Computer Applications)

Cyber Forensics
Course Code: 22MCA341 Course Type PCE
Teaching Hours/Week (L: T: P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Prerequisites :

Data Communication and Computer Networks, Artificial Intelligence and Machine Learning

Course Objectives:
1. To study the fundamentals of Computer Forensics.
2. To learn to analyze and validate forensics data.
3. To study the tools and tactics associated with Cyber Forensics.
4. Understand the principles of web security and to guarantee a secure network by monitoring
and analyzing the nature of attacks through cyber/computer forensics software/tools.
5. To learn technical aspects & legal aspects related to cyber crime.
UNIT - I
INTRODUCTION TO COMPUTER FORENSICS : 08 Hours
Introduction to Traditional Computer Crime, Traditional problems associated with
Computer Crime. Introduction to Identity Theft & Identity Fraud. Types of CF
techniques - Incident and incident response methodology - Forensic duplication and
investigation. Preparation for IR: Creating response tool kit and IR team. - Forensics
Technology and Systems - Understanding Computer Investigation – Data Acquisition.
UNIT - II
EVIDENCE COLLECTION AND FORENSICS TOOLS : 08 Hours
Processing Crime and Incident Scenes – Working with Windows and DOS Systems.
Current Computer Forensics Tools: Software/ Hardware Tools.
UNIT - III
ANALYSIS AND VALIDATION : 08 Hours
Validating Forensics Data – Data Hiding Techniques – Performing Remote Acquisition
– Network Forensics – Email Investigations – Cell Phone and Mobile Devices
Forensics
UNIT - IV
ETHICAL HACKING : 08 Hours
Introduction to Ethical Hacking – Foot printing and Reconnaissance - Scanning
Networks - Enumeration – System ETHICAL HACKING IN WEB Hacking - Malware
Threats - Sniffing
UNIT - V
ETHICAL HACKING IN WEB : 07 Hours
Social Engineering - Denial of Service - Session Hijacking - Hacking Web servers -
Hacking Web Applications – SQL Injection - Hacking Wireless Networks - Hacking
Mobile Platforms.
Time
85
Department of Master of Computer Applications
1. Understand the basics of computer forensics
2. Apply a number of different computer forensic tools to a given scenario
3. Analyze and validate forensics data
4. Identify the vulnerabilities in a given network infrastructure
5. Implement real-world hacking techniques to test system security

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓Course Outcomes 1 2
22MCA341.1 3 3 3 3 3 3 2
22MCA341.2 3 3 2 3 3 3 2
22MCA341.3 3 2 2 3 3 3 2
22MCA341.4 3 2 2 2 2 3 2
22MCA341.5 3 3 3 3 3 3 2
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Bill Nelson, Amelia Phillips, Frank Enfinger, Christopher Steuart, ― Computer Forensics
and Investigations, Cengage Learning, India Edition, 2016
2. CEH official Certified Ethical Hacking Review Guide, Wiley India Edition, 2015
REFERENCE BOOKS:
1. John R.Vacca, ―Computer Forensics, Cengage Learning, 2005
2. Marjie T.Britz, ―Computer Forensics and Cyber Crime: An Introduction, 3rd Edition,
Prentice Hall, 2013
3. Ankit Fadia ― Ethical Hacking Second Edition, Macmillan India Ltd, 2006
4. Kenneth C.Brancik ―Insider Computer Fraud Auerbach Publications Taylor & Francis
Group–2008
E Books / MOOCs/ NPTEL
1. Digital Forensics With Open Source Tools: Using Open Source Platform Tools for
Performing Computer Forensics on Target Systems: Windows, MAC, Linux,
https://www.pdfdrive.com/digital-forensics-with-open-source-tools-using-open-source-
platform-tools-for-performing-computer-forensics-on-target-systems-windows-mac-linux-
unix-etc-d156711094.html

86
Department of Master of Computer Applications
 Syllabus of III Semester MCA (Master of Computer Applications)

Network and Cyber Security

Course Code: 22MCA342 Course Type PCE
Teaching Hours/Week (L:T:P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Prerequisites :

Student must have basic knowledge of Computer Networks

Course Objectives:
1. Understand the concepts of network and cyber security.
2. Apply key principles of cryptography.
3. Understand the concept of authentication.
4. Understand basic principles of cybercrime.
5. Apply tools to achieve security in cybercrime.
UNIT - I
Introduction to network and cyber security : 09 Hours
What is network security, Attacks on Computers and Computer Security: Need for
Security, Security Approaches, Principles of Security Types of Attacks.
What is cyber security, Substitution Techniques: Caesar Cipher, Monoalphabetic
Cipher, Playfair Cipher, Hill Cipher, Polyalphabetic Cipher, One Time Pad, rotor
machines, Steganography
UNIT - II
Public Key Cryptography : 08 Hours
Prime Numbers, Fermats and Eulers theorem, testing to Primality: Millar-Rabin
algorithm, Principles of Public Key Cryptosystem, RSA algorithm, Diffie-Hellman,
Key exchange.
Hash Functions :
Applications, Requirements and Security, Hash functions based on Cipher Block
chaining
UNIT - III
Authentication of Systems : 07 Hours
Remote user-authentication principles, Kerberos Version 4, Kerberos Version 5:
Environmental Shortcomings, X.509 Authentication Service: certificates, X.509
version3.
UNIT-IV
Introduction to Cybercrime : 07 Hours
Cybercrime: Definition and Origins of the Word Cybercrime and Information Security,
Who are Cybercriminals? Classifications of Cybercrimes, Cybercrime: The Legal
Perspectives, Cyberstalking, Cybercafe and Cybercrimes, Botnets: The Fuel for
Cybercrime, Attack Vector.
UNIT - V
Tools and Methods Used in Cybercrime : 08 Hours
Introduction , Proxy Servers and Anonymizers, Phishing, Password Cracking, Key
87
Department of Master of Computer Applications
loggers and Spywares , Virus and Worms, Trojan Horses and Backdoors,
Steganography, DoS and DDoS Attacks, SQL Injection, Buffer Overflow, Attacks on
Wireless Networks, Digital Signatures and the Indian IT Act, Cybercrime and
Punishment, Cyberlaw, Technology and Students: Indian Scenario
Course Outcomes: At the end of the course student will be able to
1. Provide security for the data over the network.
2. Implement algorithms related to cryptography.
3. Explain basic authentication principles.
4. Discuss various cybercrimes.
5. Identify cybercrime threats using tools.
Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes

Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO

↓ Course Outcomes 1 2
22MCA342.1 2 2 2 1 1 3 2
22MCA342.2 2 2 2 1 3 2
22MCA342.3 2 2 2 1 3 3 2
22MCA342.4 2 2 2 1 1 3 2
22MCA342.5 2 2 2 1 2 3 2
1: Low 2: Medium 3: High

TEXT BOOKS:
1. William Stallings, “Cryptography and Network Security – Principles and Practices”,
Prentice Hall of India, Sixth Edition
2. Sunit Belapure and Nina Godbole, “Cyber Security: Understanding Cyber Crimes,
Computer Forensics And Legal Perspectives”, Wiley India Pvt Ltd, ISBN: 978-81-265-
21791 Publish Date 2013
3. Cryptography and Network Security, AtulKahate, TMH, 2003
REFERENCE BOOKS:
1. Charlie Kaufman, Radia Perlman, Mike Speciner: Network Security-Private
Communication in Public World, 2nd edition Pearson Education,2003
E Books / MOOCs/ NPTEL
1. https://nptel.ac.in/courses/106106129

88
Department of Master of Computer Applications
 Syllabus of III Semester MCA (Master of Computer Applications)

Block Chain Technology

Course Code: 22MCA343 Course Type PCE
Teaching Hours/Week (L:T:P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications

Prerequisites :

Student must possess basic knowledge of internet, have Interest in learning Blockchain and
Computer with Mac, Windows, or Linux OS

Course Objectives:
1. To understand Block Chain, Blockchain Architecture and its Applications
2. To understand crypto currencies, Types and Applications
3. To understand Concept of Double Spending, Hashing, Mining, payment verification,
Resolving Conflicts and Creation of Blocks
4. To understand Crypto currency wallets and conversion to Fiat Currency.
5. To Understand Smart contracts, usage, application, working principle, Law and Regulations
UNIT - I
Introduction to Blockchain, How Blockchain works, Blockchain vs Bitcoin, Practical 07 Hours
applications, public and private key basics, pros and cons of Blockchain, Myths about
Bitcoin.

UNIT - II
Blockchain : Architecture, versions, variants, use cases, Life use cases of blockchain, 08 Hours
Blockchain vs shared Database, Introduction to crypto currencies, Types, Applications.

UNIT - III
Concept of Double Spending, Hashing, Mining, Proof of work. Introduction to Merkel 08 Hours
tree, Privacy, payment verification, Resolving Conflicts, Creation of Blocks

Unit - IV
Introduction to Bitcoin, key concepts of Bitcoin, Merits and De Merits Fork and 08 Hours
Segwits, Sending and Receiving bitcoins, choosing bitcoin wallet, Converting Bitcoins
to Fiat Currency.

Unit - V
Introduction to Ethereum, Advantages and Disadvantages, Ethereum vs Bitcoin, 08 Hours
Introduction to Smart contracts, usage, application, working principle, Law and
Regulations. Case Study.

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

1. Understand and explain Block Chain, blockchain architecture and its applications
89
Department of Master of Computer Applications
 2. Understand and explain crypto currencies, types and applications
3. Understand and explain the concept of double spending, hashing, mining, payment
verification, resolving conflicts and creation of blocks
4. Understand crypto currency wallets and conversion of crypto currency to fiat currency.
5. Understand and explain smart contracts, usage, application, working principle, law and
regulations in relation to crypto currency.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA343.1 3 2 3 3 3 3 3 1
22MCA343.2 2 3 2 2 2 3 3 1
22MCA343.3 3 3 3 3 2 3 3 1
22MCA343.4 2 2 3 2 3 3 3 1
22MCA343.5 2 3 2 3 2 3 3 1
1: Low 2: Medium 3: High
0
TEXT BOOKS:
1. Arshdeep Bikramaditya Signal, Gautam Dhameja, “Beginning Blockchain: A Beginner's
Guide to Building Blockchain Solutions”, APress
2. Bahga, Vijay Madisetti, “Blockchain Applications: A Hands-On Approach”. 31 January 2017
3. Melanie Swan, “Blockchain”, OReilly
REFERENCE BOOKS:
1. Aravind Narayan. Joseph Bonneau, “Bitcoin and Crypto currency Technologies”, princton
2. Arthu.T Books, “Bitcoin and Blockchain Basics: A non-technical introduction for beginners”

90
Department of Master of Computer Applications
 Syllabus of III Semester MCA (Master of Computer Applications)

Quantum Information and Cryptography

Course Code: 22MCA344 Course Type PCE
Teaching Hours/Week (L:T:P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications

Prerequisites :

Student must have basic knowledge on quantum mechanics, linear algebra, group theory and about
the analysis of algorithms.

Course Objectives:
1. To understand basics of Cryptography with encryption techniques.
2. To be able to secure a message over insecure channel by various means.
3. To provide an in-depth understanding of cryptography theories, algorithms and systems.
4. To defend the security attacks on information systems with secure algorithms
5. To understand the fundamental concepts on quantum computing.
UNIT - I
Foundations of Cryptography : 04 Hours
Information Security-Confidentiality, Integrity and Availability-Authentication,
Authorization and Non repudiation-Introduction to Plain Text, Cipher Text, Encryption
and Decryption Techniques, Secure Key, Hashing, Digital signature.

Classical Encryption techniques : 03 Hours

Symmetric cipher model, substitution techniques, transposition techniques.

UNIT - II
Conventional Symmetric Encryption Algorithms : 04 Hours
Block cipher principles, Feistel Cipher Network Structures, Data Encryption Standard,
Modes of Operation (ECB, CBC, OFB, CFB), Strength of DES.

Modern Symmetric Encryption Algorithms : 04 Hours

Blowfish, Key Distribution: Scenario, Hierarchical Key control, Session Key lifetime,
Transparent Key control, Decentralized key control.

UNIT - III
Public Key Cryptography : 04 Hours
Prime Numbers, Principles of public key Cryptosystems, RSA algorithm.

Other public key Cryptosystems: 04 Hours

Diffie-Hellman Key exchange Algorithms, Elgamal Cryptographic system, Elliptic
curve cryptography.

91
Department of Master of Computer Applications
 UNIT - IV
Message Authentication and Message Digest : 04 Hours
Authentication Requirements, Authentication Functions: Message Encryption, Message
Authentication Code, Hash Function, MD5: logic, Compression function

Digital Signatures : 04 Hours

Requirements, Direct digital signature, Arbitrated digital signature, Digital Signature
Standard (DSS and DSA)
UNIT - V
Quantum Information and Computing 08 Hours
What is Quantum computing, Superposition and Entanglement, Quantum Computer,
What are Quantum Bits, History of Quantum Computing, Applications of Quantum
Computing, Classical Computing Vs. Quantum Computing, Future of Quantum
Computing
Course Outcomes: At the end of the course student will be able to
1. Provide security of the data over the network.
2. Do research in the emerging areas of cryptography and network security.
3. Develop cryptographic algorithms for information security
4. Protect any network from the threats in the world.
5. Understand the basic concepts on quantum computing.
Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA344.1 3 3 3 3 3 2
22MCA344.2 3 3 3 3 3 3 3 2
22MCA344.3 3 3 3 3 2 3 3 2
22MCA344.4 3 2 2 3 2 3 2
22MCA344.5 3 3 3 3 2
1: Low 2: Medium 3: High

TEXT BOOKS:
1. William Stallings, “Cryptography and Network Security – Principles and Practices”,
Prentice Hall of India, 7th Edition, 2017 (ISBNNo.:978-0-13-44446-11)
2. D.R. Stinson, Cryptography: Theory and Practice, 3rd Edition, Boca Raton, FL: Chapman &
Hall/CRC, 2005. (ISBNNo.:978-1-58-488508-5)
REFERENCE BOOKS:
1. Charlie Kaufman, Radia Perlman, Mike Speciner : Network Security-Private
Communication in Public World, 2nd Edition Pearson Education
2. Atul Kahate, Cryptography and Network Security, Tata McGraw Hill
E Books / MOOCs/ NPTEL
1. https://www.javatpoint.com/what-is-quantum-computing

92
Department of Master of Computer Applications
 Syllabus of III Semester MCA (Master of Computer Applications)

Management Information Systems

Course Code: 22MCA351 Course Type PCE
Teaching Hours/Week (L:T:P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50

Teaching Department: Mater of Computer Applications

Course Objectives:
1. Describe the role of information technology and decision support systems in business
2. Introduce the fundamental principles of computer-based information systems and
design and develop an understanding of the principles and techniques used
3. Enable students understand the various knowledge representation methods and different
expert system structures
4. Introduce the various E-business models used by organizations
5. Enable the students to use information to assess the impact of the Internet and Internet
technology on electronic commerce and electronic business

UNIT - I
Systems Engineering : 02 Hours
System concepts, System control, Types of systems, Handling system complexity,
Classes of systems, General model of MIS, Need for system analysis

Information and Knowledge : 03 Hours

Information concepts, Classification of information, Methods of data and information
collection, Value of information

Introduction of MIS : 03 Hours

MIS: Concept, Definition, Role of the MIS, Impact of MIS, MIS and the user,
Management as a control system, MIS support to the management, Management
effectiveness and MIS, Organization as system. MIS: organization effectiveness

UNIT - II
Strategic Management of Business : 04 Hours
Concept of corporate planning, Essentiality of strategic planning, Development of the
business strategies, Type of strategies, Short-range planning, Tools of planning, MIS:
Strategic business planning

Development of MIS : 04 Hours

Development of long range plans of the MIS, Ascertaining the class of information,
Determining the information requirement, Development and implementation of the
MIS, Management of information quality in the MIS, Organization for development of
MIS, MIS development process model

93
Department of Master of Computer Applications
 UNIT - III
Role of ICT / IT Strategies /IT Solutions : 04 Hours
Planning fundamentals (real world cases), Organizational planning, planning for
competitive advantage (SWOT Analysis), Business models and planning. Business/IT
planning, identifying business/IT strategies, Implementation Challenges, Change
management, Developing business systems (real world case)

Business Process Re-Engineering : 04 Hours

Introduction, Business process, Process model of the organization, Value stream model
of the organization, what delay the business process, Relevance of information
technology, MIS and BPR

UNIT - IV
Technology of Information Systems : 04 Hours
Introduction, Data processing, Transaction processing, Application processing,
information system processing, TQM of information systems, Human factors & user
interface, Strategic nature of IT decision, MIS choice of information technology

Decision Making and DSS : 04 Hours

Decision making concepts; Decision making process, Decision-making by analytical
modeling, Behavioral concepts in decision making, Organizational decision-making,
Decision structure, DSS components, Management reporting alternatives

UNIT - V
Electronic Business Systems : 04 Hours
Enterprise business system – Introduction, cross-functional enterprises applications,
real world case, Functional business system, Introduction, marketing systems, sales
force automation, CIM, HRM, online accounting system, Customer relationship
management, ERP, Supply chain management (real world cases for the above)

Client Server Architecture and E-business Technology : 03 Hours

Client server architecture, implementation strategies, Introduction to E-business, model
of E-business, internet and World Wide Web, Intranet/Extranet, electronic, Impact of
Web on Strategic management, Web enables business management, MIS in Web
environment

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

1. Define MIS and analyze its significance in business organizations
2. Develop corporate planning and strategies using MIS
3. Apply SWOT Analysis and apply business
4. Summarize organizational decision-making process and also apply decision support systems
5. Analyze the role of various Electronic Business systems such CRM,ERP,SCM in
organizations

94
Department of Master of Computer Applications
Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA351.1 3 3 2 2 1 1 1 1
22MCA351.2 3 2 1 1 1 1
22MCA351.3 2 3 3 2 1 1
22MCA351.4 2 2 2 3 3 1 1
22MCA351.5 3 2 3 1 2 1 1
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Waman S Jawadekar : Management Information Systems , TataMcGraw Hill, 2009
2. James A O’Brien and George M Marakas : Management Information Systems, 7th Edition,
Tata McGraw Hill, 2006

REFERENCE BOOKS:
1. Ralph M Stair and George W Reynolds : Principles of Information Systems, 7th Edition,
Cengage Learning, 2010
2. Steven Alter: Information Systems - The Foundation of E-Business, 4th Edition, Pearson
Education Asia, 2011
3. Mahadeo Jaiswal and Monika Mital : Management Information System, 3rd Edition, Oxford
University Press
4. Effy Oz : Management Information Systems, 5th Edition, Cengage Learning, 2006

E Books / MOOCs/ NPTEL

1. NPTEL course on Management Information Systems, IIT Kharagpur

95
Department of Master of Computer Applications
 Syllabus of III Semester MCA (Master of Computer Applications)

Time Series Analysis and Prediction

Course Code: 22MCA352 Course Type PCE
Teaching Hours/Week (L:T:P: S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Prerequisites :

Mathematical Foundation for Computer Applications

Course Objectives:
1. Understand the fundamental advantage and necessity of forecasting in various situations.
2. Derive the properties of ARMA Models
3. Choose an appropriate ARIMA model for a given set of data and fit the model using an
appropriate package
4. Derive the properties of ARIMA and state-space models
5. Compute forecasts for a variety of linear methods and models
UNIT - I
Introduction : 08 Hours
Examples of Time Series, Objectives of Time Series Analysis , Some Simple Time
Series Models, Some Zero-Mean Models, Models with Trend and Seasonality, A
General Approach to Time Series Modeling, Stationary Models and the Auto-
correlation Function, The Sample Auto-correlation Function, A Model for the Lake
Huron Data, Estimation and Elimination of Trend and Seasonal Components,
Estimation and Elimination of Trend in the Absence of Seasonality, Estimation and
Elimination of Both Trend and Seasonality, Testing the Estimated Noise Sequence.

Stationary Processes, Basic Properties, Linear Processes, Introduction to ARMA

Processes, Properties of the Sample Mean and Autocorrelation Function, Estimation of
µ, Estimation of γ (·) and ρ(·), Forecasting Stationary Time Series, The Durbin–
Levinson.
UNIT - II
ARMA Model : 08 Hours
ARMA(p, q) Processes, The ACF and PACF of an ARMA(p, q) Process, Calculation
of the ACVF, The Autocorrelation Function, The Partial Autocorrelation Function,
Forecasting ARMA Processes.
Spectral Analysis, Spectral Densities, The Periodogram, Time-Invariant Linear Filters,
The Spectral Density of an ARMA Process.
UNIT - III
Modelling and Forecasting with ARMA Processes : 08 Hours
Preliminary Estimation, Yule–Walker Estimation, Burg’s Algorithm, The Innovations
Algorithm, The Hannan–Rissanen Algorithm, Maximum Likelihood Estimation,
Diagnostic Checking, Graph, The Sample ACF of the Residuals, Tests for
Randomness of the Residuals, Forecasting, Order Selection, The FPE Criterion, The
AICC Criterion.
96
Department of Master of Computer Applications
Nonstationary and Seasonal Time Series Models, ARIMA Models for Nonstationary
Time Series, Identification Techniques, Unit Roots in Time Series Models.
Unit - IV
State-Space Models: 08 Hours
State-Space Representations, The Basic Structural Model, State-Space Representation
of ARIMA Models , The Kalman Recursions, Estimation For State-Space Models,
State-Space Models with Missing Observations, The EM Algorithm, Generalized
State-Space Models, Parameter-Driven Models, Observation-Driven Models.
Forecasting: Introduction, Minimum Mean Square Error Forecasts, computation of
Forecasts, The ARIMA forecast as a Weighted Average of Previous Observations,
Updating Forecasts, Eventual Forecast Functions.
Unit - V
Seasonal Time Series Models : 07 Hours
General Concepts, Traditional Methods, Regression Method, Moving Average Method,
Seasonal ARIMA Models, Empirical Examples.
Exponential smoothing methods: Introduction, First-Order Exponential smoothing,
Modeling Time Series Data, Second-Order Exponential Smoothing, Higher-Order
Exponential Smoothing, Forecasting, Constant Process, Linear Trend Process,
Exponential Smoothing for Seasonal Data, Additive Seasonal Model, Multiplicative
Seasonal Model, Exponential Smoothers and Arima Models.

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

1. Differentiate between models with trend and Seasonal Components.
2. Interpret properties of ARMA models
3. Apply ARIMA model for the data
4. Interpret properties of State-Space Models
5. Implement linear models

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA352.1 3 3 3 2 3
22MCA352.2 3 3 3 2 3
22MCA352.3 3 3 3 2 3
23MCA352.4 3 3 3 2 3
22MCA352.5 2 2 2 2 2 3
1: Low 2: Medium 3: High

TEXT BOOKS :
1. Peter J. Brockwell, Richard A. Davis “Introduction to Time Series and Forecasting “,
2nd Edition, Springer Publishers
2. William W. S. Wei, “Time Series Analysis: Univariate and Multivariate Methods “, 2nd
Edition, 2006, Pearson Addison Wesley
3. Douglas C. Montgomery, Cheryl L. Jennings, “Introduction to Time Series Analysis and
Forecasting”, 2nd Edition, WILEY Publishers
REFERENCE BOOKS :
1. T M J A Cooray, “Applied Time Series: Analysis and Forecasting”, 2nd Edition, 2016,
97
Department of Master of Computer Applications
 Narosa Publishers.
2. Dr. Avishek Pal, Dr. PKS Prakash, “Practical Time Series Analysis”, 2nd Edition, 2017,
PACKT Publishers.
3. Robert H. Shumway, David S. Stoffer, “Time Series Analysis and Its Applications:
With R Examples”, 2nd Edition, 2015, Springer Publishers.
4. Chris Chatfield, “ The Analysis of Time Series: An Introduction“, 6th Ed, 2016, CRC
Press Publishers.
E Books / MOOCs/ NPTEL
1. https://nptel.ac.in/courses/103106123
2. https://onlinecourses.nptel.ac.in/noc21_ch28/preview
3. https://www.coursera.org/learn/practical-time-series-analysis#syllabus

98
Department of Master of Computer Applications
 Syllabus of III Semester MCA (Master of Computer Applications)

Cloud Computing and Big Data Analytics

Course Code: 22MCA353 Course Type PCE
Teaching Hours/Week (L:T:P:S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications

Prerequisites :

Student must have some basic knowledge of Core Java, database concepts, and any of the Linux
operating system flavors.

Course Objectives:
1. Understand the types, characteristics and challenges with digital data
2. Understand the concept of Big data Analytics and technology landscape
3. Understand the use of open source software framework called Hadoop
4. Understand different cloud computing service models and cloud security
5. Learn about multicloud computing and Cloud Computing in Business
UNIT - I
Types of Digital Data : 4 Hours
Classification of Digital Data, Structured Data, Sources of Structured Data, Ease of
Working with Structured Data, Semi-Structured Data, Sources of Semi-Structured Data,
Unstructured Data, Issues with “Unstructured” Data, How to Deal with Unstructured
Data.

Introduction to Big Data: 4 Hours

Characteristics of Data, Evolution of Big Data, Definition of Big Data, Volume,
Velocity, Variety, Challenges of Big Data, Other Characteristics of Data Which are Not
Definitional Traits of Big Data, Traditional Business Intelligence (BI) versus Big Data,
A Typical Data Warehouse Environment, A Typical Hadoop Environment, Coexistence
of Big Data and Data Warehouse.
Unit - II
Introduction to Big Data Analytics : 8 Hours
Big Data Analytics, Classification of Analytics, Greatest Challenges that Prevent
Businesses from Capitalizing on Big Data, Top Challenges Facing Big Data, Importance
of Big Data Analytics, Terminologies Used in Big Data Environment, In Memory
Analytics, In Database Processing, Symmetric Multiprocessor System, Massively
Parallel Processing, Difference between Parallel versus Distributed Systems, Shared
Nothing Architecture, Consistency, Availability, Partition Tolerance (CAP), Basically
Available Soft State Eventual Consistency (BASE)
Unit - III
Hadoop Techniques: : 7 Hours
Introducing Hadoop, RDBMS versus Hadoop, Hadoop versus SQL, Distributed
Computing Challenges, Key Aspects of Hadoop, Hadoop Components. Features of
Hadoop, Key Advantages of Hadoop, Versions of Hadoop, Hadoop 1.0, Hadoop 2.0,

99
Department of Master of Computer Applications
Overview of Hadoop Ecosystems, High Level Architecture of Hadoop, Hadoop
Distributed File System, HDFS Daemons, Anatomy of File Read, Anatomy of File
Write, Processing Data with Hadoop, MapReduce Daemons, MapReduce Example,
Managing Resources and Application with Hadoop YARN, Limitations of Hadoop 1.0
Architecture, HDFS Limitation, Hadoop 2: HDFS, Hadoop 2 YARN: Taking Hadoop
Beyond Batch, Hadoop Ecosystem.
Unit - IV
Cloud Computing definition, Cloud service models (IaaS, PaaS & SaaS) : 8 Hours
Cloud deployment models (Public, Private, Hybrid and Community Cloud), Private &
Public Cloud Definition, Characteristics of Private Cloud, Private Cloud deployment
models, Private Cloud Building blocks namely Physical Layer, Virtualization Layer,
Cloud Management Layer, When to opt for Public Cloud, Public Cloud Service Models.
Unit - V
Cloud Computing in terms of Application Security, Server Security, and Network 8 Hours
Security, multi-cloud management, Management System (e.g. RightScale Cloud
Management System), Cloud Computing in Business.

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

1. Classify the digital data
2. Understand the top challenges facing big database
3. Study components and advantages of Hadoop
4. Understand Cloud deployment models
5. Understand Server Security, and Network Security, application security.
Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA353.1 2 3 2 3 3 3 1 1
22MCA353.2 3 3 2 2 2 2
22MCA353.3 2 3 1 1 2 3 3
22MCA353.4 1 2 3 2 1 2 2 3
22MCA353.5 2 2 3 3 2 3 3 3
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Seema Acharya and Subhashini C: Big Data and Analytics, First Edition, Wiley India Pvt.
Ltd, 2015
2. Cloud Computing: Principles and paradigms By Raj Kumar Buyya, James Broberg,
Andrezei M. Goscinski, 2011
REFERENCE BOOKS:
1. Judith Hurwitz, Alan Nugent, Fern Halper, Marcia Kaufman: Big data for dummies
2. Tom White: Hadoop – The Definitive Guide
3. Chuck Lam: Hadoop in action
4. Dirk Deroos, Paul C. Zikopoulos, Roman B. Melnyk, Bruce Brown: Hadoop for dummies
E Books / MOOCs/ NPTEL
1. Big Data computing-nptel
2. Cloud Computing and Big Data, C. Catlett, W. Gentzsch, L. Grandinetti, IOS Press, 2013
100
Department of Master of Computer Applications
 Syllabus of III Semester MCA (Master of Computer Applications)

Natural Language Processing

Course Code: 22MCA354 Course Type PCE
Teaching Hours/Week (L:T:P:S) 3:0:0:0 Credits 03
Total Teaching Hours 39 CIE + SEE Marks 50+50
Teaching Department: Master of Computer Applications
Course Objectives:
1. To learn the basics of Natural Language Processing
2. Learn the finite-state morphological parsing process
3. To know about Syntactic Parsing
4. Understand the basic feature systems for English
5. To know the concept of Named entity recognition
UNIT - I
Introduction to Natural Language Processing :
The study of Language, Applications of NLA, Different levels of language analysis 04 Hours

Linguistic Background :
An outline of English syntax, The elements of simple noun phrases, verb phrases and
simple sentences, Particles, adjective phrases, adverbial phrases 04 Hours

UNIT - II
Finite-state morphological parsing : 04 Hours
Detecting and correcting spelling errors, Minimum edit distance, N-Grams - Counting
words in corpora, Simple(un-smoothed) n-grams;

Part – of - Speech Tagging - English word classes : 04 Hours

Tagsets for English, Hidden Markov Models - Markov chains, The Hidden Markov
Model.

UNIT - III
Syntactic Parsing: 04 Hours
Grammars and syntax structure, A top down parser

Depth first strategy vs Breadth first strategy : 04 Hours

Bottom up chart parser, Efficiency considerations, Transition Network Grammars, Top
down chart parser.

UNIT - IV
Features and Augmented Grammars : 04 Hours
Feature systems and augmented grammars

Basic feature systems for English : 04 Hours

person and number features; Binary features; Morphological analysis and the lexicon;
A simple grammar using features

101
Department of Master of Computer Applications
 UNIT - V
Applications: 04 Hours
Information Extraction – Named entity recognition, Relation detection and
classification

Temporal and event processing, Template filling : 03 Hours

Temporal and event processing, Template filling.

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

1. Basics of Natural Language Processing
2. Knows the concept of finite-state morphological parsing
3. Solves problems related to Syntactic Parsing
4. Learns the basic feature systems for English
5. Learns the basics of Named entity recognition

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA354.1 3 3 3 3 3 3 3 3 3
22MCA354.2 3 3 3 3 3 3 3 3 3
22MCA354.3 3 3 3 3 3 3 3 3 3
22MCA354.4 3 3 3 3 3 3 3 3 3
22MCA354.5 3 3 3 3 3 3 3 3 3
1: Low 2: Medium 3: High

TEXT BOOKS:
1. Jurafsky, D. and J. H. Martin, ”Speech and language processing: An Introduction to Natural
Language Processing, Computational Linguistics, and Speech Recognition”, 2nd Edition,
Prentice Hall, 2008
2. Allen, James, “Natural Language Understanding”, 2nd Edition, Benjamin/Cumming, 1995

REFERENCE BOOKS:
1. Steven Bird, S., Klein, E., Loper, E, “Natural Language Processing with Python-Analyzing
Text with the Natural Language Toolkit”, O'Reilly Media, 2010
2. Grant S Ingersoll, Thomas S. Morton, and Andrew L. Farris,” Taming text: how to find,
organize, and manipulate it” Manning Publications Co., 2013
3. Feldman Ronen, and James Sanger,” The text mining handbook: advanced approaches in
analyzing unstructured data”, Cambridge university press,2007
4. Christopher D Manning, and Hinrich Schütze,” Foundations of statistical natural language
processing”, MIT press, 1999

E Books / MOOCs/ NPTEL

1. http://tamingtext.com/2013/01/11/taming-text-print-copies-now-available/

102
Department of Master of Computer Applications
 Syllabus of III Semester MCA (Master of Computer Applications)

Artificial intelligence and Machine Learning Lab

Course Code: 22MCA303 Course Type: PCC Lab
Teaching Hours/Week (L:T:P: S): 0:0:4:0 Credits: 02
Total Teaching Hours: 48 CIE + SEE Marks: 50+50
Teaching Department: Master of Computer Applications
Prerequisites :

Student must have an understanding of statistics, probability, calculus, linear algebra and knowledge
of programming.
Course Objectives:
1. To understand and implement data preprocessing techniques.
2. To understand and implement Supervised and Unsupervised Machine Learning Algorithms.
3. To understand and implement Deep Learning Algorithms.
4. To understand and implement performance evaluation techniques for the model built.
List of Experiments

1. Write basic programs (Conditional, branching, looping, Methods and modules, classes and
objects, numpy, pandas, sklearn) using Python
2. Write Programs to demonstrate supervised and unsupervised learning
3. Write a program to demonstrate the working of the decision tree based ID3 algorithm. Use
an appropriate data set for building the decision tree and apply this knowledge to classify
a new sample.
4. Build an Artificial Neural Network by implementing the Back propagation algorithm and
test the same using appropriate data sets.
5. Write a program to implement the Naive Bayesian classifier for a sample training data set
stored as a .CSV file. Compute the accuracy of the classifier, considering few test data
sets.
6. Assuming a set of documents that need to be classified, use the Naive Bayesian Classifier
model to perform this task. Built-in Java classes/API can be used to write the program.
Calculate the accuracy, precision, and recall for your data set.
7. Write a program to construct a Bayesian network considering medical data. Use this
model to demonstrate the diagnosis of heart patients using standard Heart Disease Data
Set. You can use Java/Python ML library classes/API.
8. Apply k-Means algorithm to cluster a set of data stored in a .CSV file. You can add
Java/Python ML library classes/API in the program.
9. Write a program to implement k-Nearest Neighbor algorithm to classify the iris data set.
Print both correct and wrong predictions. Java/Python ML library classes can be used for
this problem.
10. Implement the non-parametric Locally Weighted Regression algorithm in order to fit data
points. Select appropriate data set for your experiment and draw graphs

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

1. Apply data preprocessing techniques, supervised and unsupervised machine learning
algorithms.
103
Department of Master of Computer Applications
 2. Apply deep learning algorithms and implement performance evaluation techniques.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO1 PSO2
↓ Course Outcomes 1 2
22MCA303.1 3 1 3 3 2 2 3 3 3
22MCA303.2 3 1 3 3 2 2 3 3 3
1: Low 2: Medium 3: High

REFERENCE BOOKS:
1. Cosma Rohilla Shalizi, Advanced Data Analysis from an Elementary Point of View,
2015
2. Tom M Mitchell,“ Machine Lerning”,1st Edition, McGraw Hill Education, 2017.
3. Elaine Rich, Kevin K and S B Nair, “Artificial Intelligence”, 3rd Edition, McGraw Hill
Education, 2017
4. Introduction to Machine Learning with Python - A Guide for Data Scientists (Muller
Andreas)
5. Allen B. Downey, “Think Python: How to Think Like a Computer Scientist‘‘, 2nd
Edition, Updated for Python 3, Shroff/O‘Reilly Publishers, 2016

104
Department of Master of Computer Applications
 Syllabus of III Semester MCA (Master of Computer Applications)

Advanced Web Technologies and Applications Lab

Course Code: 22MCA304 Course Type: PCC Lab
Teaching Hours/Week (L: T: P: S): 0:0:4:0 Credits: 02
Total Teaching Hours: 48 CIE + SEE Marks: 50+50
Teaching Department: Master of Computer Applications
Prerequisites

Student must have some basic knowledge of computer system hardware and software

Course Objectives:
1. To develop an ability to design and implement static and dynamic website
2. Use appropriate client-side or Server-side applications
3. Develop basic programming skills using Javascript and JQuery
4. Learn the language of web : HTML,CSS, Bootstrap, PHP, JSON
List of Experiments
1. Develop and demonstrate XHTML document that illustrate the use of images, tables,
links, formatting tools, lists, forms, frames and style sheets
2. Develop and demonstrate HTML5 document that illustrate the use of new semantics
elements, Migration, canvas, svg, input types, new form elements and attribute, google
map, media(audio, video).
3. Develop and demonstrate XHTML document that includes javascript for the following
a. I/O statements
b. Control statements
c. Arrays
d. Objects
e. Functions
f. Constructors
g. Event Handling through…
Body elements
Button elements
Text box and password elements
h. Element accessing, positioning and moving
i. Stacking and slow movements to elements
j. Dragging and dropping the elements
k. Element visibility
4. Develop and Demonstrate XHTML document that includes javascript for Pattern
Matching Using Regular Expressions
5. Design a XML document to store information and display the XML document.
6. Execute simple programs using PHP
7. Create a Web Application using PHP
8. Database programs using PHP
9. Simple programs using JQuey, JSON and AJAX
10. AJAX applications using various GUI components
11. Implementation of “Shopping cart” application using AJAX
105
Department of Master of Computer Applications
 12. AJAX application to keep track of user data and retrieve the session data
13. AJAX application to verify client side and server side data

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

1. Design and implement static and dynamic websites with good aesthetic sense of designing
and latest technical know-how's
2. Understand, analyze and apply the role of languages like HTML, Bootstrap, CSS, XML,
JavaScript, PHP and protocols in the workings of the web and web applications

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓Course Outcomes 1 2
22MCA304-1.1 3 3 3 3 2 3 3 2 3 3 3
22MCA304-1.2 3 3 2 2 3 3 3 3 3 2 3
1: Low 2: Medium 3: High

REFERENCE BOOKS:
1. Robert W. Sebesta: Programming with World Wide Web, 4th Edition, Pearson Education,
2008
2. M. Deitel, P.J. Deitel, A. B. Goldberg: Internet & World Wide Web, How to Program, 5th
Edition, Pearson Education, 2008
E Resources
1. https://onlinecourses.swayam2.ac.in/nou22_cs03/preview
2. https://onlinecourses.swayam2.ac.in/aic20_sp32/preview

106
Department of Master of Computer Applications
 Syllabus of III Semester MCA (Master of Computer Applications)

Mini Project
Course Code: 22MCA305 Course Type: PCC Lab
Teaching Hours/Week (L:T:P: S*): 0:0:4:9 Credits: 04
* Self Learning
Total Teaching Hours: 48 CIE + SEE Marks: 50+50
Teaching Department: Master of Computer Applications
Course Objectives:
1. To provide the student the experience of developing quality software solution by involving
in all the stages of the software development life cycle.
2. To learn to work in a team and present the work effectively.

The objective of the MCA mini project work is to provide the student the experience of developing
quality software solution by involving in all the stages of the software development life cycle like
requirements engineering, systems analysis, systems design, software development, testing strategies
and documentation with an overall emphasis on the development of reliable software systems. The
primary emphasis of the project work is to understand and gain the knowledge of the principles of
software engineering practices.
Mini project can be assigned to an individual student or to a group having not more than 3 students.
The mini project has to be carried out during the third semester of the MCA program. The CIE
marks awarded for the Mini-project work, shall be based on the evaluation of the work done in every
stage of the software development life cycle. A student has to submit a project report at the end of
the semester. Contribution to the Mini-project and the performance of each group member shall be
assessed individually in the semester end examination (SEE) conducted at the department

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

1. Understand and gain the knowledge of the principles of software engineering practices and
develop a correct software for a real world problem.
2. Work in a team, contribute to the project and present the work effectively.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA305.1 3 3 3 3 3 3 3 3 3 3 3 3 3 3
22MCA305.2 3 3 3 3 3 3 3 3 3 3 3 3 3 3
1: Low 2: Medium 3: High

REFERENCE BOOKS :
1. Roger S. Pressman, ―Software Engineering – A Practitioner’s Approach, Seventh
Edition, Mc Graw-Hill International Edition, 2010
2. Ali Bahrami, “Object oriented systems development using the unified modelling
language”, 1st Edition, McGraw-Hill, 1998
3. John Sonmez , “Soft Skills: The software developer's life manual”, 29 December 2014
4. Ian Sommerville, ―Software Engineering‖, 9th Edition, Pearson Education Asia, 2011

107
Department of Master of Computer Applications
 Syllabus of IV Semester MCA (Master of Computer Applications)

Internship
Course Code: 22MCA401 Course Type: PCC Lab
Teaching Hours/Week (L:T:P: S): 0:0:35:0 Credits: 03
Total Teaching Hours: 140/4 Weeks CIE + SEE Marks: 50+50
Teaching Department: Master of Computer Applications
Course Objectives:
1. To learn to integrate theory and practice and develop work habits and attitudes necessary for
job success
2. To develop communication, interpersonal and other critical skills in the job interview
process and build a record of work experience.

All the students admitted to the MCA course shall have to undergo mandatory internship of 4 weeks
during the vacation of II/III semester. A University examination shall be conducted during IV semester
and the prescribed credit shall be included in IV semester. Internship shall be considered as a head of
passing and shall be considered for the award of degree. Those, who do not takeup/complete the
internship shall be declared fail and shall have to complete during subsequent University examination
after satisfying the internship requirements.

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

1. Integrate theory and practice and develop work habits and attitudes necessary for job
success
2. Develop communication, interpersonal and other critical skills in the job interview process
and build a record of work experience.

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA401.1 3 2 3 2 3 2 2 2 2 2 2 3 3 2
22MCA401.2 3 3 2 3 3 3 3 3 3 3 2 3 3 2
1: Low 2: Medium 3: High

108
Department of Master of Computer Applications
 Syllabus of IV Semester MCA (Master of Computer Applications)

Major Project
Course Code: 22MCA402 Course Type: PCC Lab
Teaching Hours/Week (L:T:P: S): 0:0:35:0 Credits: 18
Total Teaching Hours: 560/4 months CIE + SEE Marks: 100+200
Teaching Department: Master of Computer Applications
Course Objectives:
1. to learn to develop quality and reliable software solution individually by involving in every
phase of the software development life cycle, prepare a project report, a technical paper and
present it effectively.
2. To learn to work in the industry as a professional.

The Master of Computer Applications (MCA) programme prepares the students to take up positions as
Systems Analysts, Systems Designers, Software Engineers, Programmers and Project Managers in any
field related to information technology. The MCA students have been imparted with comprehensive
knowledge and skills in core areas of computer science courses with equal emphasis on the theory and
practical. The students pursuing MCA at NMAMIT, Nitte are encouraged to spend at least six months
working on a project preferably in a software industry or any research organization.

The objective of the MCA project work is to develop quality software solution. During the development
of the project, a student should involve in all the stages of the software development life cycle like
requirements engineering, systems analysis, systems design, software development, testing strategies
and documentation with an overall emphasis on the development of reliable software systems. The
primary emphasis of the project work is to understand and gain the knowledge of the principles of
software engineering practices, so as to participate and manage large software engineering projects in
future.

The project work should be carried out individually. The project work needs to be carried out with
due care, and should be carried out with all seriousness by the students. Topics selected should be
complex and large enough to justify as a MCA project and 6 months of work. The project should be
genuine and original and should not be copied from anywhere else. If found copied, the project report
will be rejected and necessary action will be taken. The project work should compulsorily involve
software development.

Before finalizing a project, a student is required to discuss the details of the project with his/her
internal guide and proceed only on approval from the internal guide.

It is also mandatory for students to prepare a technical paper on the project and after the paper
being scrutinized by their respective internal guides, publish the paper in a scientific journal.

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

1. Work in the industry as a professional and develop quality and reliable software solution

109
Department of Master of Computer Applications
 effectively by applying software engineering concepts.
2. Prepare a project report and give effective presentation

Course Outcomes Mapping with Program Outcomes & Program Specific Outcomes
Program Outcomes→ 1 2 3 4 5 6 7 8 9 10 11 12 PSO PSO
↓ Course Outcomes 1 2
22MCA402.1 3 3 3 3 3 3 3 3 3 3 3 3 3 3
22MCA402.2 3 3 3 3 3 3 3 3 3 3 3 3 3 3
1: Low 2: Medium 3: High

REFERENCE BOOKS:
1. Roger S. Pressman, ―Software Engineering – A Practitioner‟s Approach‖, Seventh Edition,
Mc Graw-Hill International Edition, 2010
2. Ali Bahrami, “Object oriented systems development using the unified modelling language”, 1st
Edition, McGraw-Hill, 1998
3. John Sonmez , “Soft Skills: The software developer's life manual”, 29 December 2014
4. Ian Sommerville, ―Software Engineering‖, 9th Edition, Pearson Education Asia, 2011

110
Department of Master of Computer Applications