MASTER OF COMPUTER APPLICATIONS (2 YEARS)

REGULATIONS – 2021
CHOICE BASED CREDIT SYSTEM
1. PROGRAMME EDUCATIONAL OBJECTIVES (PEOs):
Graduates will be able to:
I.

II.

III.

IV.

2. PROGRAM OUTCOMES (POs)

1.

2.

3.

4.

5.

6.

PEO/PO Mapping:

POs
PEO
PO1 PO2 PO3 PO4 PO5 PO6

I.

II.

III.

IV.

(3-High, 2- Medium, 1- Low)

1
 MAPPING OF COURSE OUTCOMES AND PROGRAMME OUTCOMES

COURSE NAME PO1 PO2 PO3 PO4 PO5 PO6

2.5 0.2 2 2 1.2 2.4

Probability and Statics of Data Analysis
3 2.4 0.4 1.4 - 0.6
Research Methodology and IPR
2.5 1 3 2 1.8 2
Advanced Data Structures and Algorithms
SEMESTER I

Database Technologies
2.2 1 3 3 2.2 2.6
Python Programming

Advanced Operating System

Advanced Data Structures and Algorithms
2.6 1 3 3 2.8 2.8
Laboratory
1.8 1 3 2.6 2 2.2
Python Programming Laboratory
YEAR 1

1 2.6 2.2 1 1 1
Communication Skills Enhancement – I

Full Stack Web Development 1.8 1 2.6 2 2.6 2.4

Advanced Java Programming

Data Communications and Networks

SEMESTER II

Mobile Application Development 2.4 1 2.4 2.4 2 2.4

Advanced Operating System

Full Stack Web Development Laboratory 2.2 1 2.4 2 2.6 2.6

Advanced Java Programming Laboratory

1 2 1 1 1 1
Communication Skills Enhancement – II

Mobile Computing
SEMESTER III

Internet of Things 2 1 2.4 2 2 2.4

Mini Project
2 1 2 2 2 2
Internet of Things Laboratory
YEAR II

SEMESTER IV

Project Work 3 3 3 3 3 3

2
 PROFESSIONAL ELECTIVE COURSES [PEC]

S.NO COURSE TITLE PO1 PO2 PO3 PO4 PO5 PO6

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28

3
 MASTER OF COMPUTER APPLICATIONS (2 YEARS)
REGULATIONS – 2021
CHOICE BASED CREDIT SYSTEM
I TO IV SEMESTERS CURRICULA AND SYLLABUS
SEMESTER I
PERIODS TOTAL
S.N COURS CATEGOR PER WEEK CONTAC CREDIT
COURSE TITLE
O E CODE Y T S
T P
L PERIODS
THEORY
1 Probability and Statics of Data Analysis FC 3 1 0 4 4
2 Research Methodology and IPR RMC 2 0 0 2 2
Advanced Data Structures and
PCC 3 0 0 3 3
3 Algorithms
4 Database Technologies PCC 3 0 0 3 3
5 Python Programming PCC 3 0 0 3 3
6 Advanced Operating System PCC 3 1 0 4 4
7 Audit Course - I* AC 2 0 0 2 0
PRACTICALS
Advanced Data Structures and
PCC 0 0 4 4 2
8 Algorithms Laboratory
9 Python Programming Laboratory PCC 0 0 4 4 2
10 Communication Skills Enhancement – I EEC 0 0 2 2 1
1
TOTAL 1 12 32 24
9
*Audit course is optional
SEMESTER II
PERIODS TOTAL
COURS PER WEEK
S.NO COURSE TITLE CATEGORY CONTACT CREDITS
E CODE
L T P PERIODS
THEORY
1 Full Stack Web Development PCC 3 0 0 3 3
2 Advanced Java Programming PCC 3 0 0 3 3
3 Data Communications and Networks PCC 3 0 0 3 3
4 Cryptography and Network Security PCC 3 0 2 5 4
5 Advanced Operating System PCC 3 0 0 3 3
6 Professional Elective I PEC 3 0 0 3 3
7 Audit Course - II* AC 2 0 0 2 0
PRACTICALS
8 Full Stack Web Development Laboratory PCC 0 0 4 4 2
9 Advanced Java Programming Laboratory PCC 0 0 4 4 2
10 Communication Skills Enhancement – II EEC 0 0 2 2 1
TOTAL 20 1 12 32 24
*Audit course is optional

4
 SEMESTER III

PERIODS TOTAL
COURS PER WEEK
S.NO COURSE TITLE CATEGORY CONTACT CREDITS
E CODE
L T P PERIODS
THEORY
1 Machine Learning PCC 3 0 0 3 3
2 Internet of Things PCC 3 0 0 3 3
3 Professional Elective II PEC 3 0 0 3 3
4 Professional Elective III PEC 3 0 0 5 3
5 Professional Elective IV PEC 3 0 2 3 4
6 Open Elective OEC 3 0 0 3 3
PRACTICALS
7 Mini Project EEC 0 0 4 4 2
8 Internet of Things Laboratory PCC 0 0 4 4 2
TOTAL 18 0 10 28 23

SEMESTER IV
PERIODS TOTAL
COURS PER WEEK
S.NO COURSE TITLE CATEGORY CONTACT CREDITS
E CODE
L T P PERIODS
PRACTICALS
1 Project Work EEC 0 0 24 24 12
TOTAL 0 0 24 24 12

TOTAL NO. OF CREDITS: 83

PROFESSIONAL ELECTIVES
SEMESTER II, ELECTIVE I

COURSE CONTACT
S.NO COURSE TITLE CATEGORY L P T C
CODE PERIODS
1 Cyber Security PEC 3 3 0 0 3
2 Block chain Technologies PEC 3 3 0 0 3
3 E-Learning Techniques PEC 3 3 0 0 3
4 Professional Ethics in IT PEC 3 3 0 0 3
5 Wireless Networks PEC 3 3 0 0 3
6 Big Data Analytics PEC 3 3 0 0 3
7 Digital Marketing PEC 3 3 0 0 3
8 Cloud Computing PEC 3 3 0 0 3

SEMESTER III, ELECTIVE II

5
 COURSE CONTACT
S.NO COURSE TITLE CATEGORY L P T C
CODE PERIODS
1 DevOps and Micro services PEC 3 3 0 0 3
2 Ethical Hacking PEC 3 3 0 0 3
Software Testing and
3 PEC 3 3 0 0 3
Automation
4 TCP/IPV6 Protocol Suite PEC 3 3 0 0 3
5 Information Security PEC 3 3 0 0 3
6 E-Commerce PEC 3 3 0 0 3
7 Linux Administration PEC 3 3 0 0 3

SEMESTER III, ELECTIVE III

COURSE CONTACT
S.NO COURSE TITLE CATEGORY L P T C
CODE PERIODS
1 Robotic Process Automation PEC 3 3 0 0 3
2 Organizational Behaviour PEC 3 3 0 0 3
3 Web Designing PEC 3 3 0 0 3
Data Mining and Data
4 PEC 3 3 0 0 3
Warehousing Techniques
5 Business Data Analytics PEC 3 3 0 0 3
6 SQL PEC 3 3 0 0 3
7 PHP and MYSQL PEC 3 3 0 0 3

SEMESTER III, ELECTIVE IV

COURSE CONTACT
S.NO COURSE TITLE CATEGORY L P T C
CODE PERIODS
1 C# and .NET PEC 5 3 0 2 4
2 Mongo DB PEC 5 3 0 2 4
Network Programming and
3 PEC 5 3 0 2 4
Security
User Interface Design and
4 PEC 5 3 0 2 4
User Experience
5 Artificial Intelligence PEC 5 3 0 2 4
Relational Database
6 PEC 5 3 0 2 4
Management System

AUDIT COURSES (AC)

Registration for any of these courses is optional to students

PERIODS
COURSE PER WEEK
S.NO COURSE TITLE CATEGORY CREDITS
CODE
L T P
1 English for Research Paper Writing 2 0 0 0
2 Disaster Management 2 0 0 0
3 Constitution of India 2 0 0 0
4 இக்கால இலக்கியம் 2 0 0 0
BRIDGE COURSES
(For the M.C.A students admitted under non-computer-science background category)

6
 CONTACT
S.NO COURSE CODE COURSE TITLE PERIODS L T P C

Classes are to be conducted and completed before the start of the class of first semester,
Examinations Will be conducted along with first semester

1 Android Programming 5 3 0 2 4
Problem Solving and Programming
2 in C++ 5 3 0 2 4
Classes are to be conducted and completed before the start of the class of first semester,
Examinations Will be conducted along with first semester
3 Operating System 3 3 0 0 3
4 Data Structures and Algorithms 5 3 0 2 4
Classes are to be conducted and completed before the start of the class of first semester,
Examinations Will be conducted along with first semester
5 Software Engineering 3 3 0 0 3
6 OOPs 3 3 0 0 3

LIST OF OPEN ELECTIVES FOR PG PROGRAMMES

PERIODS
PER
S.NO COURSE CODE COURSE TITLE WEEK CREDITS
L T P
1 3 0 0 3
2 3 0 0 3
3 3 0 0 3
4 3 0 0 3
5 3 0 0 3
6 3 0 0 3
7 3 0 0 3
8 3 0 0 3
9 3 0 0 3
10 3 0 0 3
11 3 0 0 3
12 3 0 0 3
13 3 0 0 3
14 3 0 0 3
15 3 0 0 3
16 3 0 0 3
17 3 0 0 3
18 3 0 0 3
19 3 0 0 3
20 3 0 0 3
21 3 0 0 3
22 3 0 0 3
23 3 0 0 3

7
 24 3 0 0 3
25 3 0 0 3

FOUNDATION COURSES (FC)

PERIODS PER WEEK

COURS SEMESTE
S.NO COURSE TITLE CREDITS
E CODE Lectur R
Tutorial Practical
e

1 3 1 0 4 1

Course code PROBABILITY AND STATISTICS FOR DATA LTPC

ANALYTICS 3 1 0 4

8
COURSE OBJECTIVE
1. To construct a well-defined knowledge of Probability.
2. To interpret measures of central tendency, dispersion, and association.
3. To introduce Correlation concepts to understand the relation between two random
variables
4. To describe some basic concepts of statistical methods for testing the hypothesis
5. To educate the design of experiment techniques to solve various engineering
problems

UNIT I PROBABILITY 12

Definition — Axioms of Probability Conditional Probability — Total Probability Baye's

— —

Theorem
(Without proof).

UNIT II DESCRIPTIVE STATISTICS 12

Collection of Data-Classification-Tabulation-Graphical Representation — Simple Bar Chart — Pie

Chart -Measures of Central Tendency - Mean Median —Mode, Measures of Dispersion - Range Quartile
— —

Deviation Standard Deviation Coefficient of Variation.

— —

UNIT III CORRELATION AND REGRESSION 12

Correlation — Karl Pearson's correlation coefficient — Spearman's Rank Correlation — Regression

lines (problems based on Raw data only).

UNIT IV HYPOTHESIS TESTING 12

Large sample test - Test of significance for single mean and difference of means -Small sample test —
t test for single mean and difference of mean - F test for variance, Chi — Square test for independence of
attributes.

UNIT V ANALYSIS OF VARIANCE 12

Introduction- - Completely Randomized Design - Randomized Block Design - Latin Square Design.

COURSE OUTCOME

At the end of the course, students will be able to

1. Understand the concepts of probability.

2. Understand the concepts of Descriptive Statistics
3.Compute correlation and predict unknown values using regression.
4. Classify the statistical methods of testing the hypothesis.
5. Apply Design of Experiment techniques to solve various engineering problems.

REFERENCES:

T1 Veerarajan T., Probability, Statistics and Random Processes, Tata McGraw-Hill, 2"4 Edition,
New Delhi, April 19, 2017.

CO-PO Mapping

9
 POs
CO
PO1 PO2 PO3 PO4 PO5 PO6

Avg

Course Code RESEARCH METHODOLOGY AND IPR LTPC

2002

UNIT I RESEARCH DESIGN 6

Overview of research process and design, Use of Secondary and exploratory data to answer the
research question, Qualitative research, Observation studies, Experiments and Surveys.

UNIT II DATA COLLECTION AND SOURCES 6

Measurements, Measurement Scales, Questionnaires and Instruments, Sampling and methods. Data -
Preparing, Exploring, examining and displaying.

UNIT III DATA ANALYSIS AND REPORTING 6

Overview of Multivariate analysis, Hypotheses testing and Measures of Association.

Presenting Insights and findings using written reports and oral presentation.

UNIT IV INTELLECTUAL PROPERTY RIGHTS 6

Intellectual Property – The concept of IPR, Evolution and development of concept of IPR, IPR
development process, Trade secrets, utility Models, IPR & Biodiversity, Role of WIPO and WTO in IPR
establishments, Right of Property, Common rules of IPR practices, Types and Features of IPR Agreement,
Trademark, Functions of UNESCO in IPR maintenance.

UNIT V PATENTS 6

Patents – objectives and benefits of patent, Concept, features of patent, Inventive step, Specification,
Types of patent application, process E-filling, Examination of patent, Grant of patent, Revocation, Equitable
Assignments, Licences, Licensing of related patents, patent agents, Registration of patent agents.

TOTAL: 30 PERIODS

REFERENCES:

10
 1. Cooper Donald R, Schindler Pamela S and Sharma JK, “Business Research Methods”, Tata
McGraw Hill Education, 11e (2012).
2. Catherine J. Holland, “Intellectual property: Patents, Trademarks, Copyrights, Trade
Secrets”, Entrepreneur Press, 2007.
3. David Hunt, Long Nguyen, Matthew Rodgers, “Patent searching: tools & techniques”,
Wiley, 2007.
4. The Institute of Company Secretaries of India, Statutory body under an Act of
parliament, “Professional Programme Intellectual Property Rights, Law and practice”,
September 2013.

Course Outcomes:

At the end of this course, the students will have the ability to

1. Formulate and Design research problem

2. Understand and Comprehend the Data Collection Methods
3. Perform Data analysis and acquire Insights
4. Understand IPR and follow research ethics
5. Understand and Practice Drafting and filing a Patent in research and development

CO-PO Mapping:

POs
CO
1 2 3 4 5 6
1 3 3 - 1 - 1
2 3 2 - 2 - 1
3 3 2 2 2 - 1
4 3 2 - 1 - -
5 3 3 - 1 - -
Avg 3 2.4 0.4 1.4 - 0.6

MC4101 ADVANCED DATA STRUCTURES AND ALGORITHMS LTPC

3 0 0 3
COURSE OBJECTIVES:

11
  To understand the usage of algorithms in computing
 To learn and use hierarchical data structures and its operations
 To learn the usage of graphs and its applications
 To select and design data structures and algorithms that is appropriate for problems
 To study about NP Completeness of problems.

UNIT I ROLE OF ALGORITHMS IN COMPUTING & COMPLEXITY ANALYSIS 9

Algorithms – Algorithms as a Technology -Time and Space complexity of algorithms-

Asymptotic analysis-Average and worst-case analysis-Asymptotic notation-Importance of
efficient algorithms- Program performance measurement - Recurrences: The Substitution Method
– The Recursion- Tree Method- Data structures and algorithms.

UNIT II HIERARCHICAL DATA STRUCTURES 9

Binary Search Trees: Basics – Querying a Binary search tree – Insertion and Deletion- Red Black
trees: Properties of Red-Black Trees – Rotations – Insertion – Deletion -B-Trees: Definition of B trees
– Basic operations on B-Trees – Deleting a key from a B-Tree- Heap – Heap Implementation –
Disjoint Sets - Fibonacci Heaps: structure – Merge able-heap operations- Decreasing a key and
deleting a node-Bounding the maximum degree.

UNIT III GRAPHS 9

Elementary Graph Algorithms: Representations of Graphs – Breadth-First Search – Depth-First

Search – Topological Sort – Strongly Connected Components- Minimum Spanning Trees: Growing a
Minimum Spanning Tree – Kruskal and Prim- Single-Source Shortest Paths: The Bellman-Ford
algorithm – Single-Source Shortest paths in Directed Acyclic Graphs – Dijkstra‘s Algorithm;
Dynamic Programming - All-Pairs Shortest Paths: Shortest Paths and Matrix Multiplication – The
Floyd-Warshall Algorithm

UNIT IV ALGORITHM DESIGN TECHNIQUES 9

Dynamic Programming: Matrix-Chain Multiplication – Elements of Dynamic Programming –

Longest Common Subsequence- Greedy Algorithms: – Elements of the Greedy Strategy- An Activity-
Selection Problem - Huffman Coding.

UNIT V NP COMPLETE AND NP HARD 9

NP-Completeness: Polynomial Time – Polynomial-Time Verification – NP- Completeness and

Reducibility – NP-Completeness Proofs – NP-Complete Problems.

TOTAL: 45 PERIODS

COURSE OUTCOMES:

CO1: Design data structures and algorithms to solve computing problems.

CO2: Choose and implement efficient data structures and apply them to solve problems.
CO3: Design algorithms using graph structure and various string-matching algorithms to
solve real-life problems.
CO4: Design one’s own algorithm for an unknown problem. CO5: Apply suitable design
strategy for problem solving.

REFERENCES

12
1. S.Sridhar,” Design and Analysis of Algorithms”, Oxford University Press, 1st
Edition, 2014.
2. Adam Drozdex, “Data Structures and Algorithms in C++”, Cengage Learning,
4th Edition, 2013.
3. T.H. Cormen, C.E.Leiserson, R.L. Rivest and C.Stein, "Introduction to
Algorithms", Prentice Hall of India, 3rd Edition, 2012.
4. Mark Allen Weiss, “Data Structures and Algorithms in C++”, Pearson Education,
3rd Edition, 2009.
5. E. Horowitz, S. Sahni and S. Rajasekaran, “Fundamentals of Computer
Algorithms”, University Press, 2nd Edition, 2008.
6. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data Structures and
Algorithms”, Pearson Education, Reprint 2006.

CO-PO Mapping

POs
CO
PO1 PO2 PO3 PO4 PO5 PO6

1 2 1 3 2 1 2

2 2 1 3 2 2 2

3 2 1 3 2 2 2

4 3 1 3 2 2 2

5 3 1 3 2 2 2

Avg 2.5 1 3 2 1.8 2

13