Master of Computer Applications 2024-2025

Semester III
24CAP301A MACHINE LEARNING 5H-4C
Instruction Hours / week: L: 5 T: 0 P: 0 Marks: Internal: 40 External: 60 Total:
100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To define the types and theory of machine learning.
 To describe the classification models of machine learning.
 To explain the techniques of distance-based models of machine learning.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes (COs) Blooms Level

CO1 Summarize the Machine Learning Fundamentals Understanding
CO2 Analyze the concepts of Proficiency in Data Preparation and
Analyzing
Preprocessing
CO3 Develop the Skilful Model Evaluation and Feature Engineering
Creating
of machine learning.
CO4 Analyze the Classification and Regression Techniques Analyzing
CO5 Develop the program using python libraries for implementing
Creating
machine learning techniques.

UNIT I MACHINE LEARNING FUNDAMENTALS 12

HOURS
Machine Learning Landscape: Introduction- Types of Machine Learning Systems- Main Challenges of
Machine Learning- Testing and Validating-End to End Machine Learning Project: Working with Real
Data- Discover and visualize the data to gain insights Prepare the data for Machine Learning algorithms-
Select and Train a model-Fine-Tune the model.
UNIT II FEATURE ENGINEERING 12 HOURS
Motivation towards Feature Engineering - Basic Feature engineering processes- Feature Selection-
Dimensionality Reduction: The Curse of Dimensionality - Main Approaches for Dimensionality
Reduction-PCA-Kernel PCA-LLE- Other Dimensionality Reduction Techniques.
UNIT III CONCEPTS OF CLASSIFICATION AND REGRESSION 12 HOURS
Classification: Training a Binary Classifier – Performance Measures - Multiclass Classification- Error
Analysis- Multilabel Classification and Multioutput Classification-Training Models: Linear Regression-
 Gradient Descent- Polynomial Regression Learning Curves.

UNIT IV SUPERVISED LEARNING 12 HOURS

Classification: Introduction-Example-Classification Model-Learning Steps- Common classification
algorithms- K-Nearest Neighbor Decision Tree-Random Forest Model - Support Vector Machines.
Regression: Introduction-Example-Multiple linear regression Assumptions and problems in Regression
Analysis- Improving the accuracy.
UNIT V UNSUPERVISED LEARNING AND ARTIFICIAL NEURAL NETWORK 12 HOURS
Introduction - Unsupervised Learning Vs Supervised Learning – Applications – Clustering - Introduction-
Biological neuron - Artificial Neuron- Types of activation function-Architectures of NN – Learning
process in ANN – Backpropagation.
TOTAL: 60 HOURS
TEXT BOOKS:
1. AurelienGeron, (2019). Hands – On Machine Learning with SciKit-Learn, Keras & Tensor Flow –
Concepts, Tools and Techniques to Build Intelligent Systems, 2nd Edition, O’Reilly Media.
2. SaikatDutt, Subramanian Chandramouli and Amit Kumar Das, (2019). Machine Learning, 1st
Edition, Pearson Education, India.
REFERENCE BOOKS:
1. Henrik Brink, Joseph W Richards, Mark Fetherolf, (2018). Real World Machine Learning, 1st
Edition Reprint, Dreamtech Press, New Delhi.
WEBSITE LINKS:
1. https://www.geeksforgeeks.org/machine-learning/
2. https://www.linkedin.com/pulse/artificial-intelligenceai-its-case-study-aachal- choudhary

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - - - - - - - - 1 1 - - - - 3 -
CO2 3 - 2 2 3 2 - 2 3 - - - - - - - 2
CO3 3 - 3 3 2 3 - 3 - - - - - - - - 1
CO4 3 - 2 2 3 2 - 2 3 - - - - - - - -
CO5 3 - 3 3 2 3 - 3 - - - - - - - - -
Average 3 - 2.5 2.5 2.5 2.5 - 2.5 3 1 1 - - - - 3 1.5
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025

Semester III
24CAP302 CYBER SECURITY 5H-4C
Instruction Hours / week: L: 5 T: 0 P: 0 Marks: Internal: 40 External: 60 Total:
100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To systematically educate the necessity to understand the impact of cyber-crimes and threats with
solutions in a global and societal context.
 To select suitable ethical principles and commit to professional responsibilities and human values
and contribute value and wealth for the benefit of the society
 To learn about Risk assessment, plan suitable security controls, audit and compliance.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes (COs) Blooms Level

CO1 Outline the principles of cyber security and to identify threats and risks Understanding
CO2 Explain how to secure physical assets and develop system security
Understanding
controls.
CO3 Explain how to apply security for Business applications and Network
Understanding
Communications.
CO4 Summarize the technical means to achieve security. Understanding
CO5 Explain monitor and audit security measures. Understanding

UNIT I PLANNING FOR CYBER SECURITY 12

HOURS
Best Practices-Standards and a plan of Action-Security Governance Principles, components and
Approach- Information Risk Management-Asset Identification-Threat Identification-
Vulnerability Identification-Risk Assessment Approaches-Likelihood and Impact Assessment-Risk
Determination, Evaluation and Treatment- Security Management Function-Security Policy-Acceptable
Use Policy- Security Management Best Practices – Security Models: Bell La Padula model, Biba
Integrity Model - Chinese Wall model.
UNIT II SECURITY CONTROLS 12
HOURS People Management-Human Resource Security-Security Awareness and Education-Information
Management- Information Classification and handling-Privacy-Documents and Record Management-
Physical Asset Management-Office Equipment-Industrial Control Systems-Mobile Device Security-
 System Development-Incorporating Security into SDLC - Disaster management and Incident.

UNIT III – CYBER SECURITY FOR BUSINESS APPLICATIONS NETWORKS 12

HOURS
Business Application Management-Corporate Business Application Security-End user Developed
Applications-System Access- Authentication Mechanisms-Access Control-System Management- Virtual
Servers-Network Storage Systems-Network Management Concepts-Firewall-IP Security- Electronic
Communications – Case study on OWASP vulnerabilities using OWASP ZAP tool.
UNIT IV TECHNICAL SECURITY 12
HOURS
Supply Chain Management-Cloud Security-Security Architecture-Malware Protection-Intrusion
Detection-Digital Rights Management-Cryptographic Techniques-Threat and Incident Management-
Vulnerability Management - Security Event Management - Forensic Investigations- Local
Environment Management-Business Continuity.
UNIT V SECURITY ASSESSMENT 12 HOURS
Security Monitoring and Improvement-Security Audit-Security Performance-Information Risk Reporting
- Information Security Compliance Monitoring-Security Monitoring and Improvement Best Practices –
Cyber laws.
TEXT BOOKS:
1. William Stallings, 2019. Effective Cyber Security - A guide to using Best Practices and
Standards, Addison-Wesley Professional, First Edition.
2. Adam Shostack, 2014. Threat Modelling - Designing for Security, Wiley Publications, First
Edition.
REFERENCE BOOKS
1. Patrick Engebretson, 2013. The Basics of Hacking and Penetration Testing: Ethical Hacking and
Penetration Testing Made Easy, 2nd Edition, Syngress.
2. Charles P. Pfleeger, Shari Lawrence Pfleeger, Jonathan Margulies, 2015. Security in
Computing”, Fifth Edition, Prentice Hall.
WEBSITE LINKS
1. https://esu.desire2learn.com/
2. https://www.javatpoint.com/what-is-cyber-security
3. https://www.techtarget.com/searchsecurity/definition/cybersecurity
PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - 1 - 1 1 - - - 1 2 - - - - 1 -
CO2 3 - 1 - - - - - - - - - 1 - - - 2
CO3 3 - 2 - - - - 2 2 - - - 1 - - - -
CO4 3 - 1 - - 1 - 2 2 - - - - - - - -
 CO5 3 - 1 1 1 - - 1 2 - - - 1 - - - -
Average 3 - 1.2 1 1 1 - 1.7 2 1 2 - 1 - - 1 2
CO, PO, PSO Mapping
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025

Semester III
24CAP303A RESEARCH METHODOLOGY AND IPR 5H-3C
Instruction Hours/week: L:5 T:0 P:0 Marks: Internal:40 External:60 Total:100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To select appropriate research methods based on the nature of their research questions and
objectives.
 To learn techniques for conducting literature reviews and critically evaluating existing research.
 To communicate research findings effectively through written reports, presentations, and
academic papers.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:
COs Course Outcomes (COs) Blooms Level
CO1 Summarize the various research designs and techniques. Understanding
CO2 Compare various sources of information for literature review and data
Analyzing
collection.
CO3 Analyze the data and generate the report. Analyzing
CO4 Illustrate the concept of Intellectual Property Rights. Understanding
CO5 Summarize scientific writing skills, academic writing, patenting and
Understanding
avoid the common mistakes in the field of research methodology.

UNIT I RESEARCH DESIGN 12

HOURS
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 12 HOURS
Measurements, Measurement Scales, Questionnaires and Instruments, Sampling and methods. Data -
Preparing, Exploring, examining and displaying.
UNIT III DATA ANALYSIS AND REPORTING 12
HOURS
 Overview of Multivariate analysis, Hypothesis testing and Measures of Association. Presenting Insights
and findings using written reports and oral presentation.
UNIT IV INTELLECTUAL PROPERTY RIGHTS 12
HOURS
Intellectual Property – The concept of IPR, Evolution and development of concept of IPR, IPR
development process, Trade secrets, utility Models, IPR & Bio diversity, 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 12 HOURS
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, Licenses, Licensing of related patents, patent agents, Registration of patent
agents.
TOTAL: 60 HOURS
TEXT BOOKS:
1. Cooper Donald R, Schindler Pamela S and Sharma JK, (2012). Business Research Methods, Tata
McGraw Hill Education, 11th Edition.
2. Catherine J. Holland, (2012). Intellectual property: Patents, Trademarks, Copyrights, Trade Secrets,
Entrepreneur Press, 3rd Edition.
REFERENCE BOOKS:
1. David Hunt, Long Nguyen, Matthew Rodgers, (2007). Patent searching: tools & techniques, Wiley.
2. The Institute of Company Secretaries of India, Statutory body under an Act of parliament,
(2013). Professional Programme Intellectual Property Rights, Law and practice.

WEBSITE LINKS:
1. https://esu.desire2learn.com/
2. https://www.reading.ac.uk/research-services/research-data-management/data-management-
planning/intellectual-property-rights-and-research-data
3. https://en.wikipedia.org/wiki/Intellectual_property

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - 1 - - 1 - - - 1 - - - - - 3 -
CO2 3 - - - 1 - - - 1 - - - - - - - -
CO3 3 - 2 3 3 2 - 1 3 - - - - - - - 2
CO4 3 - - - 1 - - - 1 - - - 2 2 - - -
CO5 3 - 1 2 - 1 - 1 - - 2 - - 3 - - -
Average 3 - 1.3 2.5 1.7 1.3 - 1 1.7 1 2 - 2 2.5 - 3 2
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
Semester III
24CAP311A MACHINE LEARNING – PRACTICAL 5H-2C
Instruction Hours / week: L: 0 T: 0 P: 4 Marks: Internal: 40 External: 60 Total:
100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 Perform data manipulation, aggregation, and transformation operations.
 Compute descriptive statistics such as mean, median, variance, and standard deviation.
 Analyze relationships between variables using correlation and covariance.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:
COs Course Outcomes (COs) Blooms Level
CO1 Demonstrate the machine learning problems using Python Understanding
CO2 Implement algorithms to solve simple machine learning problems Creating

CO3 Implement the Advanced Model Skills Creating

CO4 Implement the Probabilistic Models Creating
CO5 Analyze the performance of machine learning solutions on practical Analyzing
datasets
List of Experiments TOTAL: 60 HOURS
1. Exploration of a Data Set in the IDE, to perform various pandas operations.
2. Exploration of a Data Set in the IDE , to perform various numpy operations.
3. Write a python program to calculate mean, median, variance, standard deviation and exploring
relationship between variables of the given numerical data.
4. Implement various data preprocessing techniques on real time dataset using python.
5. Develop a python code to perform dimensionality reduction using PCA.
6. Write a python code to perform different visualization for the given data set.
7. Construct a python program to find the attribute with maximum information gain and gain ratio
and construct the decision tree for the given data.
8. Develop a python program to implement K-NN algorithm for the given data.
9. Develop a python program to implement Random Forest Algorithm for the given data.
10. Construct a python program to implement Support Vector Machines learning algorithm for the
given data.
11. Write a python program to implement Naïve Bayes Classifier Algorithm for the given data.
12. Construct a python code to implement Simple Linear regression for the given data.
 13. Develop a python code to implement Multi Linear regression algorithms for the given data set.
14. Write a python program to implement k-means clustering algorithm.
15. Implement Multi-Layer Artificial Neural Network analysis for the given dataset using python
code.
TEXT BOOKS
1. AurelienGeron, (2019). Hands – On Machine Learning with SciKit-Learn, Keras & Tensor Flow
– Concepts, Tools and Techniques to Build Intelligent Systems, 2nd Edition, O’Reilly Media.
2. SaikatDutt, Subramanian Chandramouli and Amit Kumar Das, (2019. Machine Learning, 1 st
Edition, Pearson Education, India.
REFERENCE BOOKS
1. Henrik Brink, Joseph W Richards, Mark Fetherolf, Real World Machine Learning, 1 st Edition
Reprint, Dreamtech Press, New Delhi, 2018.
WEBSITE LINKS
1. https://www.geeksforgeeks.org/machine-learning/
2. https://www.linkedin.com/pulse/artificial-intelligenceai-its-case-study-aachal-choudhary

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - - - - - - - 2 2 2 - - - - 3 -
CO2 3 - 3 3 3 2 - 1 3 - - - - - - - 2
CO3 3 - 3 3 3 2 - 1 3 - - - - 2 - - -
CO4 3 - 3 3 3 2 - 1 3 - - - 2 - - - 1
CO5 3 - 2 2 2 1 1 1 2 - - - - - - - -
Average 3 - 2.8 2.8 2.8 1.8 1 1 2.6 2 2 - 2 2 - 3 1.5
CO, PO, PSO Mapping
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
SEMESTER-II
24CAP204D DATA MINING AND DATA WAREHOUSING 5H-3C
Instruction Hours / week: L: 5 T: 0 P: 0 Marks: Internal: 40 External: 60 Total:
100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To gain the knowledge of the concepts and techniques in data mining
 To understand the data mining functionalities and pattern classification.
 To understand the cleaning and clustering process of data mining.
COURSE OUTCOMES (COs):
Upon completion of this course, Students will able to
COs Course Outcomes Blooms Level

CO1 Summarize the principle concepts of datamining and data mining. Understanding

CO2 Explain the classification and regression algorithms. Understanding

CO3 Compare various mining rules. Analyzing

CO4 Classify the types of data mining. Understanding

CO5 Illustrate the essentials of Data modeling. Understanding

UNIT I INTRODUCTION 10 HOURS

Motivation and importance, Data Mining, Relational Databases, Data Warehouses, Transactional
Databases, Advanced Database Systems and Advanced Database Applications, Data Mining
Functionalities, Pattern Classification of Data Mining Systems, Major issues in Data Mining. Pre-process
the Data- Data Cleaning, Data Integration and Transformation.
UNIT II CLASSIFICATION AND REGRESSION ALGORITHMS 10 HOURS
Naïve Bayes – Multiple Regression Analysis – Logistic Regression – k-Nearest Neighbour Classification
– GMDH –Computing and Genetic Algorithms. Support Vector Machines: LinearSVM - SVM with
soft margin – Linear kernel – Proximal SVM – Generating Datasets.Cluster Analysis: Partitional
Clusterings – k-medoids – Birch
UNIT III MINING RULE 10 HOURS
Mining Frequent Patterns, Association rule Mining : Associations and Correlations: Basic Concepts –
Frequent Item Set Mining Methods – Apriori Algorithm: Finding Frequent Itemsets by Confined
Candidate Generation – Generating Association Rules from Frequent Itemsets – Improving the Efficiency
of Apriori – A Pattern–Growth Approach for Mining Frequent Itemsets – Mining Frequent Itemsets
Using the Vertical Data Format – Mining Closed and Max Patterns – Pattern Evaluation Methods –
Constraint–Based Frequent Pattern Mining.
UNIT IV TYPES OF MINING 10 HOURS
Mining Complex Types of Data: Mining Spatial Databases – Time- series and Sequence Data – Text
Databases – Web Data Mining – Multimedia Data Mining- Search Engines- - Applications of Machine
Learning in Data Mining- Machine learning VS Data Mining.
UNIT V DATA WAREHOUSE AND OLAP TECHNOLOGY 10
HOURS
Data Warehouse: Basic Concepts – Data Warehouse Modeling – Data Cube and OLAP – Data
Warehouse Design and Usage: A Business Analysis Framework for Data Warehouse Design – Data
Warehouse Design Process – Architecture of Data Warehousing- Data Mart- Data Warehouse Usage for
Information Processing – From Online Analytical Processing to Multidimensional Data Mining – Data
Warehouse Implementation.
TOTAL: 50 HOURS
TEXT BOOKS:
1. Jiawei Han and Micheline Kamber, ( 2011). Data Mining Concepts and Techniques, 3rd
Edition, Elsivier, India.
2. G.K.Gupta, (2006). Introduction to Data Mining with Case Studies, Prentice Hall India,
NewDelhi.
3. Soman.K.P, Shyam Divakar and V. Ajay, ( 2008). Insight to Data Mining- Theory and
Practical, Prentice Hall India, New Delhi.
REFERENCE BOOKS:
1. Gupta.G.K., (2006). Introduction to Data Mining with Case Studies, Prentice Hall India,
NewDelhi.
2. Kantardzic, (2005). Mining Concepts, Models, Methods and Algorithms, IEEE Press – A John
Wiley& Sons.
WEBSITE LINKS:
1. https://www.thearling.com/text/dmwhite/dmwhite.htm
2. https://www.classcentral.com/course/swayam-data-mining-9821
CO, PO, PSO Mapping
COs PO PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9PO10 PO11 PO12 PO13 PO14 PO15 PSO1PSO2
1
CO1 3 - - 1 - 1 - - 1 1 1 - - - - 3 -
CO2 3 - 2 3 - 2 - 2 2 - - - - - - 1 -
CO3 3 - 2 3 - 1 - 1 1 - - - - - - - 2
CO4 3 - - - - 2 - 1 - - 1 - - - - - -
CO5 3 - - 1 - - - - - - 1 - - - - - -
Average 3 - 2 2 - 1.5 - 1.3 1.3 1 1 - - - - 2 2
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation

Master of Computer Applications 2024-2025

Semester II
24CAP204N CRYPTOGRAPHY AND NETWORK SECURITY 5H-3C
Instruction Hours/week: L:5 T:0 P:0 Marks: Internal:40 External:60 Total:100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To teach fundamental aspects of security in a modern networked environment with the focus on
system design aspects and cryptography in the specific context of network.
 To build protection mechanisms in order to secure computer networks.
 To write coding to encrypt “Plain Text” into “Cipher Text” and vice versa, using different
encryption algorithms.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Classify the symmetric encryption techniques and illustrate
Analyzing
various public key cryptographic techniques
CO2 Illustrate the message authentication and hash algorithms. Understanding
CO3 Analyze Security Risks and Mitigation Strategies Analyzing
CO4 Summarize the basic concepts of web security Understanding
CO5 Summarize about the blockchain technology. Understanding

UNIT I- INTRODUCTION TO CRYPTOGRAPHY 10

HOURS
Introduction to Cryptography – Security Attacks – Security Services – Security Algorithm – Stream
cipher and Block cipher – Symmetric and Asymmetric – Key Cryptosystem; SymmetricKey Algorithms:
Introduction – DES – Triple DES – AES – IDEA – Blowfish – RC5.
UNIT II- PUBLIC KEY CRYPTOSYSTEM 10
HOURS
 Public Key Cryptosystem: RSA Algorithm – Key Management – Diffie-Hell man key exchange –
Introduction to Elliptic Curve Cryptography; MessageAuthentication and Hash functions – Hash and Mac
Algorithm – Digital Signatures and Authentication Protocol.
UNIT III NETWORK SECURITY PRACTICE 10 HOURS
Authentication Applications – Kerberos – X.509 Authentication Services and Encryption Techniques: E-
mail security – PGP – s/MIME – IP Security.
UNIT IV WEB SECURITY AND STEGANOGRAPHY 10 HOURS
Web Security – Secure Socket Layer – Secure Electronic Transaction; System Security – Intruders and
Viruses – Firewalls – Password Security. Case Study: Network Forensic – Security Audit; Other
Security Mechanism: Introduction to Stenography – Quantum Cryptography – Water Marking – DNA
Cryptography.
UNIT V BASICS OF BLOCKCHAIN TECHNOLOGY 10
HOURS
Distributed Database, Two General Problem, Byzantine General Problem and Fault Tolerance, Hadoop
Distributed File System, Distributed Hash Table, ASIC resistance, Turing Complete. Cryptography:
ECDSA, Memory Hard Algorithm, and Zero Knowledge Proof.
TOTAL HOURS: 50
TEXT BOOKS:
1. William Stallings, (2013). Cryptography and Network Security, 6th Edition. Pearson
Education, New Delhi.
2. Menezes, P. Van Oorschot and Vanstone, (2010). Hand Book of Applied Cryptography, 2nd
Edition. CRC Press, New Delhi.
REFERENCE BOOKS:
1. Ankit Fadia, (2010). Network Security, 2nd Edition. McMillan India Ltd, New Delhi.
2. Bruce Schneir, (2006). Applied Cryptography, 2nd Edition. CRC Press, New Delhi.

WEBSITE LINKS
1. williamstallings.com/Crypto3e.html
2. u.cs.biu.ac.il/~herzbea/book.html

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - 3 1 2 2 - 1 2 1 2 - - - - - -
CO2 3 - - - - - - - 1 - 1 - - - - - -
CO3 3 - 2 2 3 2 - 2 3 - - - - - - 2 3
CO4 3 - - - - - - - - - - - - - - - -
CO5 3 - - - 1 2 - - - - - - - - - - -
Average 3 - 2.5 1.5 2 2 - 1.5 2 1 1.5 - - - - 2 3
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation

Master of Computer Applications 2024-2025

Semester II
24CAP204S OBJECT ORIENTED SOFTWARE ENGINEERING 5H-3C
Instruction Hours/week: L:5 T:0 P:0 Marks: Internal:40 External:60
Total:100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To teach techniques and methodologies for analyzing and designing software systems using
object-oriented principles.
 To emphasize the importance of software quality assurance and testing in object-oriented
software development.
 To introduce testing techniques such as unit testing, integration testing, and acceptance testing,
with a focus on how OOP facilitates testing practices.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes (COs) Blooms Level

CO1 Demonstrate the phases in object-oriented software development Understanding

CO2 Summarize fundamental concepts of requirements engineering

Understanding
and analysis.
CO3 Compare the different approach for object-oriented design and its
Analyzing
methods
CO4 Explain about how to perform object-oriented testing and how to
Understanding
maintain software
 CO5 Measure the various quality metrics and to ensure risk
Evaluating
management.
UNIT I SOFTWARE DEVELOPMENT AND PROCESS MODELS 10
HOURS
Introduction to Software Development – Challenges – An Engineering Perspective – Object Orientation –
Software Development Process – Iterative Development Process – Process Models – Life Cycle Models –
Unified Process – Iterative and Incremental – Agile Processes.
UNIT II MODELLING OO SYSTEMS 10 HOURS
Object Oriented Analysis (OOA / Coad-Yourdon), Object Oriented Design (OOD/Booch), Hierarchical
Object- O r i e n t e d Design (HOOD), Object Modeling Technique (OMT) – Requirement Elicitation –
Use Cases – SRS Document – OOA - Identification of Classes and Relationships, Identifying State and
Behavior – OOD - Interaction Diagrams – Sequence Diagram – Collaboration Diagrams - Unified
Modeling Language and Tools.
UNIT III DESIGN PATTERNS 10
HOURS
Design Principles – Design Patterns – GRASP – GoF – Dynamic Object Modeling – Static Object
Modeling – Prompt Engineering Formal and Agile Methodologies: The Nature of software- Software
Engineering – Software Process Models – Prescriptive process model–Specialized process model- The
Unified Process – Agile Development: Agile Process – Extreme Programming-Other Agile process
UNIT IV SYSTEM TESTING 10 HOURS
Software testing: Software Verification Techniques – Object Oriented Checklist :- Functional Testing –
Structural Testing – Class Testing – Mutation Testing – Levels of Testing – Static and Dynamic Testing
Tools - Software Maintenance – Categories – Challenges of Software Maintenance – Maintenance of
Object Oriented Software – Regression Testing
UNIT V SOFTWARE QUALITY AND METRICS 10 HOURS
Software testing: Software Verification Techniques – Object Oriented Checklist :- Functional Testing –
Structural Testing – Class Testing – Mutation Testing – Levels of Testing – Static and Dynamic Testing
Tools - Software Maintenance – Categories – Challenges of Software Maintenance – Maintenance of
Object Oriented Software – Regression Testing.
TOTAL HOURS:50
TEXT BOOKS:
1. Yogesh Singh, RuchikaMalhotra, (2012). Object – Oriented Software Engineering, First edition,
PHI Learning Private Limited.
2. Ivar Jacobson. Magnus Christerson, PatrikJonsson, Gunnar Overgaard, (2009). Object Oriented
Software Engineering, A Use Case Driven Approach, Pearson Education, Seventh Impression.

REFERENCE BOOKS:
1. Grady Booch, Robert A. Maksimchuk, Michael W. Engle, Bobbi J. Young, Jim Conallen, Kelli A.
 Houston, (2010). Object Oriented Analysis & Design with Applications, Third Edition, Pearson
Education.
2. Roger S. Pressman, (2015). Software Engineering: A Practitioner’s Approach, 8th Edition, Tata
McGraw-Hill Education.
CO, PO, PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - 1 1 - 2 - - 1 - - - - - - - -
CO2 3 - - - - - - 1 1 - 1 - - - - - 2
CO3 3 - - - - 1 - 2 - - 1 - - - - - -
CO4 3 - 1 - - - - - 2 - - - - - - - -
CO5 3 - 1 - - 3 - - - - - - - - - 1 -
Average 3 - 1 1 - 2 - 1.5 1.3 - 1 - - - - 1 2
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
Semester II
24CAP204W ADVANCED WEB TECHNOLOGY 5H-3C

Instruction Hours/week: L:5 T:0 P:0 Marks: Internal:40 External:60 Total:100

End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To delve into advanced topics in HTML5, CSS3, and JavaScript, including newer features and
best practices.
 To explore responsive web design techniques and frameworks like Bootstrap for building
modern, mobile-friendly web interfaces.
 To teach advanced JavaScript frameworks and libraries such as React.js, Vue.js, or Angular for
creating interactive and dynamic web applications.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:
COs Course Outcomes Blooms Level

CO1 Explain the Core Concepts of the Web Understanding

CO2 Design the web pages using Cascading Style Sheet Creating
CO3 Develop the JavaScript for DOM Manipulation Applying
CO4 Design dynamic documents using JavaScript Creating
CO5 Summarize the Browser Event Models Understanding
UNIT I WEB FUNDAMENTALS 10
HOURS
Web Fundamentals: Internet, WWW, Web Browsers and Web Servers, URLs, MIME, HTTP, Security,
the Web Programmers Toolbox. Introduction to XHTML: Basic syntax, Standard structure, Basic text
markup, Images, Hypertext Links. Lists, Tables, Forms, Frames, Syntactic differences between HTML
and XHTML.
UNIT II INTRODUCTION TO HTML5 10
HOURS
New features of HTML5, HTML5 DocType, HTML5 Structure, Tags- nav, section, article, aside, header,
footer, HTML5 Form Elements- Search, tel, url, email, number and range, HTML5 Media tags- Audio
and video. Cascading Style Sheets: Introduction, Levels of style sheets, Style specification formats,
Selector forms, Property value forms, Font properties, List properties, Color, Alignment of text, The box
model, Background images, The <span> and <div> tags, Conflict resolution.
UNIT III THE BASICS OF JAVASCRIPT 10
HOURS
Overview of JavaScript, Object orientation and JavaScript, general Syntactic characteristics, Primitives,
operations, and expressions, Screen output and keyboard input, Control statements, Object creation and
modification, Arrays, Functions, Constructors, Pattern matching using regular expressions, Errors in
scripts. JavaScript and XHTML Documents: The JavaScript Execution Environment, The Document
Object Model, Elements Access in Java Script, Events and Event Handling, Handling Events from Body
Elements, Handling Events from Text Box and password Elements, The DOM2 Model, The navigator
Object, Dom Tree Traversal and Modification.
UNIT IV DYNAMIC DOCUMENTS WITH JAVASCRIPT 10 HOURS
Introduction, Positioning Elements, 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. Introduction to XML: Introduction, Syntax
of XML, XML Document Structure, Document type definitions, Namespaces, XML schemas, displaying
raw XML documents, Displaying XML documents with CSS, Web services.
UNIT V INTRODUCTION TO JQUERY 10 HOURS
Introducing jQuery, jQuery fundamentals, Creating the wrapped element set, bringing pages to life with
jQuery, Understanding the browser event models, The jQuery Event Model, Sprucing up with animations
and effects.
TOTAL HOURS:50
TEXT BOOKS:
1. Harvey & Paul Deitel & Associates, Harvey Deitel and Abbey Deitel, “Internet and World Wide
Web - How to Program”, 5th Edition, Pearson Education, 2011.
2. Achyut S Godbole and Atul Kahate, “Web Technologies”, 2nd Edition, Tata McGraw Hill, 2012.
REFERENCE BOOKS:
 1. Thomas A Powell, Fritz Schneider, “JavaScript: The Complete Reference”, 3rd Edition, Tata
McGraw Hill, 2013.
WEBSITE LINKS:
1. https://www.w3schools.com/css/css_intro.asp
2. https://www.yaldex.com/javascript_tutorial_2/LiB0004.html
CO, PO, PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - - 1 - - - - 1 - 1 - - - - 1 -
CO2 3 - 1 - - 1 - 2 1 - 1 - - - - - 1
CO3 3 - 2 3 2 3 - 2 - - - - - - - - 1
CO4 3 - - - 3 1 - 1 1 - - - - - - - -
CO5 3 - 1 - - - - 1 - - - - - - - 2 -
Average 3 - 1.3 2 2.5 1.7 - 1.5 1 - 1 - - - - 1.5 1
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
Semester II
24CAP204DS FOUNDATION OF DATA SCIENCE 5H-3C
Instruction Hours/week: L:5 T:0 P:0 Marks: Internal:40 External:60
Total:100
End Semester Exam: 3Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To study the basic concepts of Data Science and data lifecycle.
 To understand the theoretical and mathematical aspects of Data Science models.
 To learn common random variables and their uses, and with the use of empirical distributions.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Explain the key concepts in data science, including tools and approaches Understanding

CO2 Summarize the concepts in data collection, sampling and probabilistic

Understanding
models
CO3 Compare the various techniques in data normalization Analyzing
CO4 Analyze the mathematical formulation of machine learning and statistical
Analyzing
models to visualize the data in various methods.
CO5 Analyze a suitable data science technique to solve an information analytics
Analyzing
problem

UNIT I INTRODUCTION 10
HOURS
The Big Picture: What is Data Science? –The data life cycle: pre-processing, analysis, post- processing–
Preprocessing: Data gathering, cleansing, visualization, and understanding (Mean, Variance, Standard
Deviation. Percentiles.) –Data Storage (Relational databases, e.g. MySQL)
UNIT II SAMPLING 10
HOURS
Sampling – Probability Models for Statistical Methods: Discrete and continuous probability distributions,
density functions. Random variables, expected values, variance, correlation.
UNIT III DATA NORMALIZATION 10
HOURS
Data Normalization (z-values, transforms) –Random processes –Data Management: Tools for Data
 Analysis, Case Study: Data analysis using Python-Arrays, Visualization.
UNIT IV MAJOR TECHNIQUES IN DATA SCIENCE 10
HOURS
Major Techniques in Data Science: Data mining, Data warehousing, Data mining vs Data warehouse–
Machine Learning-Supervised Learning, Unsupervised Learning.
UNIT V- BUSINESS INTELLIGENCE 10
HOURS
Business Intelligence–Descriptive Analytics, Diagnostic Analytics, Predictive Analytics, Prescriptive
Analytics–Cloud computing-definition, Cloud services, types of clouds, some of commercial and non-
commercial cloud service providers.

TEXT BOOKS:
1. Saltz Jeffrey S, (2019). An Introduction to Data Science, Second Edition, Sage Publications Inc.
2. Peter Bruce & Andrew Bruce, (2017). Practical Statistics for Data Scientists, First Edition, O’Reilly
Publication
3. Murtaza Haider, (2015). Getting Started with Data Science: Making Sense of Data with Analytics,
First Edition, IBM Press.
REFERENCE BOOKS:
1. Glenn J. Myatt, Wayne P. Johnson, (2014). Making Sense of Data I: A Practical Guide to
Exploratory Data Analysis and Data Mining, Second Edition, John Wiley & Son Publication.
2. Dawn Griffiths, (2008). Head First Statistics, First Edition, O’Reilly Publication.

WEBSITE LINKS:
1. https://www.inferentialthinking.com/chapters/intro
2. https://www.openintro.org/stat/
3. https://swayam.gov.in/nd1_noc20_cs36/preview
4. https://swayam.gov.in/nd1_noc19_cs60/preview
5. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-0002-i

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - - - - - - - 3 - 1 - - - - 1 -
CO2 3 - - - 2 - - 1 - - - - - - - - -
CO3 3 - - - - 1 - - - - 1 - - - - - 2
CO4 3 - 3 2 3 2 - 2 3 - 1 - - - - - -
CO5 3 - 3 2 3 2 - 2 3 - - - - - - - -
Average 3 - 3 2 2.7 1.7 - 1.7 3 - 1 - - - - 1 2
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025

Semester II
24CAP205D DISTRIBUTED DATABASE MANAGEMENT SYSTEM 5H-3C
Instruction Hours/week: L:5 T:0 P:0 Marks: Internal:40 External:60 Total:100
End Semester Exam: 3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To design good performing distributed database schemas.
 To create optimized query execution plan.
 To efficiently distribute and manage the data.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Summarize the basic concept of database management systems Understanding
CO2 Analyze Distribution Transparency concepts, including location Analyzing
transparency, fragmentation transparency, and replication transparency
CO3 Explain the Master Concurrency Control in Distributed Database Understanding
Systems
CO4 Demonstrate how to handle the deadlock in the database operation Understanding
CO5 Analyze the various database security techniques for protecting data Analyzing
security

UNIT I – INTRODUCTION TO DATABASE CONCEPTS 10

HOURS
Database concepts: Data Models- Database Operations- Database Management-DB Clients,
Servers, and Environments. DBE Architecture: Services- Components and Subsystems- Sites -
Expected Services-Expected Subsystems- Typical DBMS Services– DBE Taxonomy: COS Distribution
and Deployment- COS Closeness or Openness-Schema and Data Visibility- Schema and Data Control.
UNIT II – DESIGN ALTERNATIVES AND FRAGMENTATION 10 HOURS
Data Distribution Alternatives: Design Alternatives - Localized Data - Distributed Data.
Fragmentation: Vertical Fragmentation- Horizontal Fragmentation - Distribution
Transparency: Location Transparency-Fragmentation Transparency - Replication Transparency - Location,
Fragmentation, and Replication Transparencies.
UNIT III QUERY OPTIMIZATION 10
HOURS
Query Optimization: Sample Database- Query Processing in Centralized Systems: Query Parsing and
 Translation - Query Optimization- Query Processing in Distributed Systems- Heterogeneous Database
Systems - Concurrency Control in Distributed Database Systems.
UNIT IV DEADLOCK HANDLING 10
HOURS
Deadlock Handling: Deadlock Definition- Deadlocks in Centralized Systems- Deadlocks in Distributed
Systems- Distributed Deadlock Detection. Replication Control: Replication Control Scenarios. Failure
and Commit Protocols: Terminology- Commit Protocols.
UNIT V DDBE SECURITY 10
HOURS
DDBE Security: Cryptography- Securing Data. Traditional DDBE Architectures: Classifying the
Traditional DDBMS Architecture- The MDBS Architecture Classifications- Approaches for Developing
A DDBE- Deployment of DDBE Software.
TOTAL: 50 HOURS
TEXT BOOKS:
1. Saeed K. Rahimi And Frank S. Haug, (2010). Distributed Database Management Systems : A
Practical Approach, 1st Edition, A John Wiley & Sons, Inc., Publication.
2. Tamer Ozus M,Patrick Valduriez ,S.Sridhar, (2006). Principle Of Distributed Database Systems, 1st
Edition , Pearson Education.

REFERENCE BOOKS:
1. William M.New Man, Robort F.Sproull, (2004). Principles of Interactive Computer Graphics, 1st
Edition, Pearson Education.

WEBSITE LINKS:
1. http://www.en.wikipedia.org/wiki/Distributed_computing
2. www.webopedia.com/TERM/D/distributed_computing.html
3. www.tech-faq.com/distributed-computing.shtml
4. http://www.inf.unibz.it/dis/teaching/DDB/ln/ddb01.pdf

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - - - - 1 - - 1 1 1 - - - - - 2
CO2 3 - 3 2 3 2 - 2 3 - - - - - - - -
CO3 3 - - 1 - - - - 1 - - - - - - 1 -
CO4 3 - - - 2 - - - - - 1 - - - - - -
CO5 3 - 3 2 3 2 - 2 3 - - - - - - - -
Average 3 - 3 1.7 2.7 1.7 - 2 2 1 1 - - - - 1 2
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
Semester II
24CAP205N TCP/IP 5H-4C
Instruction Hours/week: L:5 T:0 P:0 Marks: Internal:40 External:60 Total:100
End Semester Exam: 3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To learn about IPv4 forwarding and routing.
 To learn the Domain Name System (DNS).
 To know the Architectural Overview of the TCP/IP Protocol Suite.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Summarize the TCP/IP protocol suite, including its layered architecture,
Understanding
individual protocols within each layer
CO2 Outline the knowledge of ICMP Message Types and Formats Understanding
CO3 Explain the routing and routed protocols in TCP/IP Understanding
CO4 Demonstrate to deploy and manage robust and scalable network
Understanding
infrastructures in enterprise environments
CO5 Analyze to manage secure and efficient remote access solutions using
Analyzing
protocols such as FTP, SMTP, and SNMP

UNIT I INTRODUCTION 10
HOURS
Introduction: WAN, WAN technologies - Internetworking concepts - Protocols and Standards - TCP/IP
protocol suite - Internetworking Devices – Routing Concept - Classful IP Addressing – Subnetting –
Super netting – Classless Addressing.
UNIT II ARP & RARP 10
HOURS
ARP & RARP – Proxy ARP – ARP over ATM – ARP and RARP Protocol Format. IP Datagram-
Fragmentation – Options – IP Datagram Format – Routing IP Datagrams – Checksum. IP Package ICMP:
Types of Messages - Message Format – Error Reporting – Query – Checksum - ICMP Package.
UNIT III ROUTING AND ROUTED PROTOCOLS 10
HOURS
Routing and Routed Protocols- Inter and Intra Routing Protocol- Autonomous Systems – Routing Table -
Interior Gateway Protocols – Exterior Gateway Protocols – Routing in Internet. Group Management –
 IGMP Message – IGMP Operation – Process to Process Communication.
UNIT IV UDP OPERATION 10 HOURS
UDP Operation – TCP Services conjunction control - Flow Control – Multicast Routing – Multicast
Routing Protocols. BOOTP - DHCP – Address Discovery and Binding. DNS – Name Space – DNS in
Internet – Resolution – Resource Records. TELNET.
UNIT V REMOTE LOGIN 10 HOURS
Remote Login - FTP – SMTP – SNMP. IP over ATM Wan – Cells – Routing the Cells. Mobile IP:
Addressing – Agents – Agent discovery – Registration – Data Transfer – VPN.
TOTAL: 50 HOURS
TEXT BOOKS:
1. Behrouz A. Forouzan, (2010). TCP/IP Protocol Suite, 4th Edition. New Delhi: Tata McGraw Hill
Publication.
2. Douglas E. Comer, (2000). Internetworking With TCP/IP, Vol 1: Principles Protocols and
Architecture, 4th Edition. New Delhi: Pearson Education.
REFERENCE BOOKS:
1. William Stallings, (1997). Data and Computer Communication, 5th Edition. New Delhi: Prentice
Hall of India.
WEBSITE LINKS:
1. en.wikipedia.org/wiki/Internet_protocol_suite
2. http://docwiki.cisco.com/wiki/Introduction_to_WAN_Technologies
3. www.yale.edu/pclt/COMM/TCPIP.HTM
4. www.w3schools.com/tcpip/default.asp

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - 1 - 1 - - - 1 1 1 - - - - - -
CO2 3 - - 1 - - - - - - 1 - - - - 2 -
CO3 3 - 1 - - 1 - 1 1 - - - - - - - 3
CO4 3 - 1 1 - - - 2 2 - - - - - - - -
CO5 3 - 3 2 3 2 - 3 3 - - - - - - - -
Average 3 - 1.5 1.3 2 1.5 - 2 1.8 1 1 - - - - 2 3
CO, PO, PSO Mapping
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
Semester II
24CAP205S SOFTWARE DESIGN USING UML 5H-3C
Instruction Hours/week: L:5 T:0 P:0 Marks: Internal:40 External:60 Total:100
End Semester Exam: 3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To integrate UML diagrams into different phases of the software development life cycle,
including requirements analysis, design, implementation, testing, deployment, and maintenance.
 To practice modeling complex software systems using multiple UML diagrams, demonstrating
relationships and interactions between components.
 To enhance communication among project stakeholders (e.g., developers, clients, testers) through
clear and precise UML diagrams.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Summarize the fundamentals of object modelling Understanding
CO2 Demonstrate conceptual classes within a domain, distinguishing
Understanding
them from other types of classes
CO3 Analyze the dynamic and architectural modelling UML diagrams Analyzing
CO4 Illustrate the various architectural design elements, interface
Understanding
design elements, component-level diagram element
CO5 Compare and contrast traditional software development models
Analyzing
(e.g., Waterfall) with Agile models

UNIT I UNIFIED PROCESS AND USECASE DIAGRAMS 10 HOURS

Introduction to OOAD with OO Basics - Unified Process – UML diagrams – Use Case –Case study – the
Next Gen POS system, Inception -Use case Modelling – Relating Use cases – include, extend and
generalization – When to use Use-cases.

UNIT II STATIC UML DIAGRAMS 10 HOURS

Class Diagram–– Elaboration – Domain Model – Finding conceptual classes and description classes –
Associations – Attributes – Domain model refinement – Finding conceptual class Hierarchies –
 Aggregation and Composition - Relationship between sequence diagrams and use cases – When to use
Class Diagrams.
UNIT III DYNAMIC AND ARCHITECTURAL MODELLING UML DIAGRAMS 10
HOURS
Dynamic Diagrams – UML interaction diagrams - System sequence diagram – Collaboration diagram –
When to use Communication Diagrams - State machine diagram and Modelling –When to use State
Diagrams - Activity diagram – When to use activity diagrams Implementation Diagrams - UML package
diagram - When to use package diagrams - Component and Deployment Diagrams – When to use
Component and Deployment diagrams.
UNIT IV DESIGN PATTERNS AND ELEMENTS 10
HOURS
Design Patterns: GRASP-Designing objects with responsibilities –Applying GoF design patterns –
Creational Patterns, Structural Patterns, Behavioral Patterns, Design Elements: 54 Architectural design
elements - Interface design elements - Component level diagram elements - Deployment level design
elements, Mapping design to code.
UNIT V – AGILE METHODOLOGIES 10
HOURS
Theories for Agile Management – Agile Software Development – Traditional Model vs. Agile Model -
Classification of Agile Methods – Agile Manifesto and Principles – Agile Project Management – Agile
Team Interactions – Ethics in Agile Teams - Agility in Design, Testing – Agile Documentations – Agile
Drivers, Capabilities and Values
TOTAL: 50 HOURS
TEXT BOOKS:
1. Craig Larman, (2005). Applying UML and Patterns: An Introduction to Object-Oriented Analysis
and Design and Iterative Development, Third Edition, Pearson Education.
2. Ali Bahrami, (1999). Object Oriented Systems Development, McGraw Hill International Edition.

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - - - - - - - - - 3 - - - - 3 -
CO2 3 - - 1 2 - - - 1 - - - - - - - -
CO3 3 - 3 2 3 2 - 1 3 - 2 - - - - - 2
CO4 3 - - - - 1 - - - - - - - - - - -
CO5 3 - 3 2 3 2 - 1 3 - - - - - - - 1
Average 3 - 3 1.7 2.7 1.7 - 1 2.3 - 2.5 - - - - 3 1.5
CO, PO, PSO Mapping
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
Semester II
24CAP205W SEMANTIC WEB AND ONTOLOGIES 5H-3C
Instruction Hours/week: L:5 T:0 P:0 Marks: Internal:40 External:60 Total:100
End Semester Exam: 3Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To represent data from a chosen problem in XML with appropriate semantic tags obtained or
derived from the ontology.
 To understand the semantic relationships among these data elements using Resource.
 To design and implement a web services application that “discovers” the data and/or other
Description Framework (RDF).
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:
COs Course Outcomes Blooms Level

CO1 Analyze fundamental concepts, advantages and limits of the

Analyzing
semantic web
CO2 Demonstrate the semantic relationships among these data elements
Understanding
using Resource
CO3 Explain the RDF framework and associated technologies for
Understanding
developing semantic web
CO4 Analyze the various languages and properties of Web Ontologies Analyzing

CO5 Summarize semantic Web Tools like Jena and SPARL for
Understanding
developing architecture for semantic web

UNIT I INTRODUCTION 10
HOURS
Introduction to the Syntactic web and Semantic Web – Evolution of the Web – The visual and syntactic
web – Levels of Semantics – Metadata for web information - The semantic web architecture and
technologies –Contrasting Semantic with Conventional Technologies –Semantic Modeling - Potential of
 semantic web solutions and challenges of adoption.
UNIT II ONTOLOGICAL ENGINEERING 10
HOURS
Ontologies – Taxonomies –Topic Maps – Classifying Ontologies – Terminological aspects: concepts,
terms, relations between them – Complex Objects –Subclasses and Sub-properties definitions – Upper
Ontologies – Quality – Uses - Types of terminological resources for ontology building – Methods and
methodologies for building ontologies – Multilingual Ontologies -Ontology Development process and
Life cycle – Methods for Ontology Learning – Ontology Evolution – Versioning.
UNIT III STRUCTURING AND DESCRIBING WEB RESOURCES 10 HOURS
Structured Web Documents - XML – Structuring – Namespaces – Addressing – Querying – Processing -
RDF – RDF Data Model – Serialization Formats- RDF Vocabulary –Inferencing - RDFS – basic Idea –
Classes – Properties- Utility Properties – RDFS Modeling for Combinations and Patterns- Transitivity.
UNIT IV WEB ONTOLOGY LANGUAGE 10 HOURS
OWL – Sub-Languages – Basic Notions -Classes- Defining and Using Properties – Domain and Range –
Describing Properties - Data Types – Counting and Sets- Negative Property Assertions – Advanced Class
Description – Equivalence – Owl Logic – Knowledge Graph.
UNIT V SEMANTIC WEB TOOLS AND APPLICATIONS 10 HOURS
Development Tools for Semantic Web – Jena Framework – SPARL –Querying semantic web - Semantic
Wikis - Semantic Web Services – Modeling and aggregating social network data - Ontological
representation of social relationships, Aggregating and reasoning with social network data Understand
semantic web basics, architecture and technologies
TOTAL: 50 HOURS
TEXT BOOKS:
1. Grigoris Antoniou, Frank van Harmelen, (2012). 3rd Edition, A Semantic Web Primer,.,MIT
Press, USA.
2. Liyang Yu, (2011). A Developer's Guide to the Semantic Web, First Edition ,Springer.
3. John Hebeler, Matthew Fisher, Ryan Blace and Andrew Perez-Lopez, (2009). Semantic Web
Programming”, First Edition Wiley.
REFERENCE BOOKS:
1. Robert M. Colomb, (2007). Ontology and the Semantic Web, Volume 156 Frontiers in Artificial
Intelligence and Applications (Frontier in Artificial Intelligence and Applications), IOS Press.
2. Dean Allemang and James Hendler, (2011). Semantic Web for the Working Ontologist: Effective
Modeling in RDFS and OWL, Second Edition, Morgan Kaufmann.
3. Karin Breitman, Marco Antonio Casanova and Walt Truszkowski, (2010). Semantic Web:
Concepts, Technologies and Applications (NASA Monographs in Systems and Software
Engineering), Springer.
CO, PO, PSO Mapping
CO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - 3 3 3 2 - 2 3 - - - - - - - 1
CO2 3 - - - - - - - - 1 1 - - - - 1 -
CO3 3 - 1 - 2 - - - 1 - - - - - - - 2
CO4 3 - 3 3 3 2 - 2 3 - - - - - - - -
CO5 3 - - - - 1 - - 1 - - - - - - - -
Average 3 - 2.3 3 2.7 1.7 - 2 2 1 1 - - - - 1 1.5
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
Semester II
24CAP205DS NATURAL LANGUAGE PROCESSING 5H-3C
Instruction Hours/week: L:5 T:0 P:0 Marks: Internal:40 External:60 Total:100
End Semester Exam: 3Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To introduce the fundamental concepts and techniques of natural language processing (NLP).
 To understand of the models and algorithms in the field of NLP.
 To demonstrate the computational properties of natural languages.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Summarize the fundamental concepts and techniques of natural
Understanding
language processing (NLP)
CO2 Analyze the models and algorithms in the field of N-Gram Models Analyzing
CO3 Explain the Probabilistic Context-Free Grammars (PCFGs) Understanding
CO4 Analyze the commonly used algorithms for processing linguistic
Analyzing
information.
CO5 Illustrate about statistical approaches to discourse analysis,
Understanding
language generation, and machine translation

UNIT I Introduction to NLP 10

HOURS
Introduction – Models -and Algorithms - The Turing Test -Regular Expressions Basic Regular
Expression Patterns -Finite State Automata -Regular Languages and FSAs – Morphology - Inflectional
Morphology - Derivational Morphology – Finite – State Morphological Parsing - Combining an FST
Lexicon and Rules -Porter Stemmer.
UNIT II N-GRAMS MODELS 10
HOURS
N-grams Models of Syntax - Counting Words - Unsmoothed N-grams – Smoothing-Backoff - Deleted
Interpolation – Entropy - English Word Classes - Tag sets for English -Part of Speech Tagging -Rule-
Based Part of Speech Tagging - Stochastic Part of Speech Tagging – Transformation-Based Tagging.
UNIT III CONTEXT FREE GRAMMARS 10
HOURS
Context Free Grammars for English Syntax- Context-Free Rules and Trees – Sentence-Level
Constructions –Agreement – Sub Categorization – Parsing – Top-down – Early Parsing -Feature
Structures - Probabilistic Context-Free Grammars.
UNIT IV- REPRESENTING MEANING 10 HOURS
Representing Meaning - Meaning Structure of Language - First Order Predicate Calculus-
Representing Linguistically Relevant Concepts -Syntax-Driven Semantic Analysis -Semantic
Attachments - Syntax-Driven Analyzer - Robust Analysis - Lexemes and Their Senses - Internal
Structure - Word Sense Disambiguation -Information Retrieval.
UNIT V- DISCOURSE 10
HOURS
Discourse -Reference Resolution - Text Coherence -Discourse Structure - Dialog and Conversational
Agents - Dialog Acts – Interpretation – Coherence -Conversational Agents - Language Generation –
Architecture -Surface Realizations – Discourse Planning – Machine Translation -Transfer
Metaphor – Interlingua – Statistical Approaches.
TOTAL:50 HOURS
TEXT BOOKS:
1. D. Jurafsky and J. Martin, (2020). Speech and Language Processing: An Introduction to
Natural Language Processing, Computational Linguistics, and Speech Recognition.
2. Daniel J and James H. Martin, Speech and language processing, (2009). An introduction to
natural language processing, computational linguistics & speech recognition, Prentice hall.

REFERENCE BOOKS:
1. Lan H Written and Elbef, MarkA.Hall, ( 2013). Data Mining: Practical Machine Learning
Tools And Techniques, Morgan Kaufmann.
WEBSITE LINKS:
1. https://www.onlinecourses.swayam2.ac.in/aic20_sp06/preview
2. https://www.onlinecourses.swayam2.ac.in/arp19_ap79/preview
3. https://www.tutorialspoint.com/natural_language_processing/index.html

CO, PO, PSO Mapping

 PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - - - 2 - - - - 1 1 - - - - 1 -
CO2 3 - 3 2 3 2 - 2 3 - - - - - - - 2
CO3 3 - 2 - - - - - 1 - - - - - - - 2
CO4 3 - 3 2 3 2 - 2 3 - - - - - - - -
CO5 3 - - - - 1 1 - - - - - - - - - -
Average 3 - 2.7 2 2.7 1.7 1 2 2.3 1 1 - - - - 1 2
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation

Master of Computer Applications 2024-2025

Semester II
24CAP304D INTRODUCTION TO NOSQL DATABASE 4H-3C
Instruction Hours/week: L:4 T:0 P:0 Marks: Internal:40 External:60 Total:100
End Semester Exam: 3Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To discuss how NoSQL databases are designed to handle large volumes of structured, semi-
structured, and unstructured data more efficiently than traditional SQL databases.
 To ensure high availability and fault tolerance, often through distributed architecture and data
replication strategies.
 To provide examples of typical use cases where NoSQL databases excel, such as content
management systems, IoT data storage, real-time analytics, and large-scale e-commerce
platforms.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Compare different types of NoSQL Databases Analyzing
CO2 Compare and contrast RDBMS with different NoSQL databases Analyzing

CO3 Analyze the detailed performance tune of Document-oriented NoSQL

Analyzing
databases.
CO4 Summarize the Column-oriented NoSQL Databases Understanding
 CO5 Analyze performance tune of Key-Value Pair NoSQL databases Analyzing

UNIT I OVERVIEW OF NOSQL 9 HOURS

Overview and History of NoSQL Databases. Definition of the Four Types of NoSQL Database, The
Value of Relational Databases, Getting at Persistent Data, Concurrency, Integration, Impedance
Mismatch, Application and Integration Databases, Attack of the Clusters, The Emergence of NoSQL,Key
Points.
UNIT II COMPARISION OF RDBMS 10
HOURS
Comparison of relational databases to new NoSQL stores, MongoDB, Cassandra, HBASE, Neo4j use and
deployment, Application, RDBMS approach, Challenges NoSQL approach, Key-Value and Document
Data Models, Column-Family Stores, Aggregate-Oriented Databases. Replication and sharding,
MapReduce on databases. Distribution Models, Single Server, Sharding, Master- Slave Replication, Peer-
to-Peer Replication, Combining Sharding and Replication.
UNIT III DATABASE AND WEB ANALYTICS 10
HOURS
NoSQL Key/Value databases using MongoDB, Document Databases, Document oriented Database
Features, Consistency, Transactions, Availability, Query Features, Scaling, Suitable Use Cases, Event
Logging, Content Management Systems, Blogging Platforms, Web Analytics or Real-Time Analytics, E-
Commerce Applications, Complex Transactions Spanning Different Operations, Queries against Varying
Aggregate Structure.
UNIT IV COLUMN ORIENTED NOSQL 9 HOURS
Column- oriented NoSQL databases using Apache HBASE, Column-oriented NoSQL databases using
Apache Cassandra, Architecture of HBASE, Column-Family Data Store Features,
Consistency,Transactions, Availability, Query Features, Scaling, Suitable Use Cases, Event Logging.
UNIT V KEY VALUES 10
HOURS
NoSQL Key/Value databases using Riak, Key-Value Databases,Key-Value Store, Key-Value Store
Features, Consistency, Transactions, Query Features, Structure of Data, Scaling, Suitable Use
Cases,Storing Session Information, User Profiles, Preferences, Shopping Cart Data,Relationships among
Data, Multi operation Transactions, Query by Data, Operations by Sets. Graph NoSQL databases using
Neo4, NoSQL database development tools and programming languages, Graph Databases, Graph
Database. Features, Consistency, Transactions, Availability, Query Features, Scaling, Suitable Use Cases.
TOTAL: 60 HOURS

TEXT BOOKS:
1. Sadalage, P. & Fowler, (2019). NoSQL Distilled: A Brief Guide to the Emerging World of
Polyglot Persistence, 1st Edition, Wiley Publications.
WEBSITE LINKS:
1. https://www.ibm.com/cloud/learn/nosql-databases
2. https://www.coursera.org/lecture/nosql-databases/introduction-to-nosql-VdRNp
3. https://www.geeksforgeeks.org/introduction-to-nosql/
4. https://www.javatpoint.com/nosql-database

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - 3 2 3 2 - - 3 1 - - - - - 2 -
CO2 3 - 3 2 3 3 - 1 3 - - - - - - - -
CO3 3 - 3 2 3 2 - - 2 - - - - - - - -
CO4 3 - - - - - - - - - 1 - - - - - -
CO5 3 - 3 2 3 3 - 1 2 - - - - - - - 2
Average 3 - 3 2 3 2.5 - 1 2.5 1 1 - - - - 2 2
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation

Master of Computer Applications 2024-

2025
Semester III
24CAP304N SOFTWARE DEFINED NETWORK 4H-3C
Instruction Hours/week: L:4 T:0 P:0 Marks: Internal:40 External:60
Total:100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To learn the fundamentals of software defined networks.
 To understand the separation of the data plane and the control plane.
 To study about the SDN Programming.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Summarize the fundamental concepts of Software defined network. Understanding

CO2 Analyze the protocols and the controllers. Analyzing

 CO3 Explain the Networking technique for Application Development. Understanding

CO4 Analyze and Understand the SDN applications in other environments. Analyzing

CO5 Analyze the Future of SDN(5G). Analyzing

UNIT I INTRODUCING SDN 12

HOURS
History of Software Defined Networking (SDN) – Modern Data Center – Traditional Switch Architecture
– Why SDN – Evolution of SDN – How SDN Works – Centralized and Distributed Control and Date
Planes.
UNIT II SDN ABSTRACTIONS 9
HOURS
How SDN Works - The Openflow Protocol - SDN Controllers: Introduction - General Concepts -
VMware - Nicira - VMware/Nicira - OpenFlow-Related - Mininet - NOX/POX - Trema - Ryu - Big
Switch Networks/Floodlight - Layer 3 Centric - Plexxi - Cisco OnePK.
UNIT III PROGRAMMING SDN'S 10
HOURS
Network Programmability - Network Function Virtualization - NetApp Development, Network Slicing
UNIT IV SDN APPLICATIONS AND USE CASES 10
HOURS
SDN in the Data Center - SDN in Other Environments - SDN Applications - SDN Use Cases - The Open
Network Operating System 3.
UNIT V SDN'S FUTURE AND PERSPECTIVES 10
HOURS
SDN Open Source - SDN Futures - Final Thoughts and Conclusions
TOTAL: 60 HOURS
TEXT BOOKS:
1. Paul Goransson and Chuck Black, (2014). Software Defined Networks: A Comprehensive
Approach, Morgan Kaufmann Publications.
2. Thomas D. Nadeau & Ken Gray, (2013). SDN - Software Defined Networks, O'Reilly
Publications.
3. Siamak Azodolmolky, (2013). Software Defined Networking with Open Flow, Packt Publishing.
4. Kreutz, Diego, (2015). Software-defined networking: A comprehensive survey, Proceedings of the
IEEE 103.1.
5. Nunes, Bruno AA, (2014). A survey of software-defined networking: Past, present, and future of
programmable networks Communications Surveys & Tutorials, IEEE 16.3.

REFERENCE BOOKS:
 1. Lantz, Bob, Brandon Heller, and Nick McKeown, (2010). A network in a laptop: rapid
prototyping for software-defined networks, Proceedings of the 9th ACM SIGCOMM Workshop
on Hot Topics in Networks, ACM.
2. Monsanto, Christopher, (2013). Composing software defined networks, Presented as part of the
10th USENIX Symposium on Networked Systems Design and Implementation (NSDI 13).

WEBSITE LINKS
1. https://www.geeksforgeeks.org/software-defined-

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - - - - - - - 1 1 - - - - - - -
CO2 3 - 3 2 3 2 - 2 - - - - - - - 1 2
CO3 3 - - 2 - 1 - - - - - - - - - - 3
CO4 3 - - - 3 2 - 2 1 - 1 - - - - - -
CO5 3 - 3 2 3 2 - 1 1 - - - - - - - -
Average 3 - 3 2 3 1.8 - 1.7 1 1 1 - - - - 1 2.5
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
Semester III
24CAP304S SOFTWARE TESTING AND QUALITY ASSURANCE 5H-
3C
Instruction Hours/week: L:5 T:0 P:0 Marks: Internal:40 External:60 Total:100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To implement processes and methodologies to improve the overall quality of the software
product.
 To measure and evaluate the performance metrics of the software, such as response times,
throughput, and scalability, to ensure it meets performance requirements.
 To ensure that the software complies with relevant regulatory, legal, and industry standards.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Analyze the testing techniques to deliver a product free from bugs Analyzing

CO2 Explain Path Testing, Path Sensitizing Basics Understanding

CO3 Illustrate the effective transaction flow and data flow testing Understanding
CO4 Analyze the Integration of Hybrid Metrics for Comprehensive
Analyzing
Assessment
CO5 Demonstrate the Proficiency in Project Management Strategies and
Understanding
Risk Management Integration.

UNIT I – INTRODUCTION TO TESTING 8

HOURS
Introduction: Purpose of Testing – Dichotomies - Model for Testing – consequences of bugs- Taxonomy
for bugs
UNIT II – FLOW GRAPHS AND PATH TESTING 8
HOURS
Flow/Graphs and Path Testing: Path testing basics-predicates, path predicates and Achievable paths –
Path sensitizing– path instrumentation-implementation and application of path testing
UNIT III INTRODUCTION TO FLOW TESTING 8
HOURS
Transaction flow testing: – Transaction flow - Transaction flow testing techniques – implementation
 comments – testability tips -Data flow testing basics-Data flow testing strategies.
UNIT IV – DOMAINS AND PATHS 8
HOURS
Domains and paths-Nice Domains and Ugly Domains-Domain Testing-Domains and interface testing-
Domains and testability-Metrics-Linguistic metrics-structural metrics- Hybrid metrics- metrics
implementations-Testability tips
UNIT V – RISK ANALYSIS 8 HOURS
Risk Analysis: Benefits of Risk analysis – Project Management Strategies and Risk – MITs riskAnalysis
– MITs Ranking Criteria - Using Risk Ranking in Forensics –Test estimation process- MIT totals
worksheet-Sizing worksheet
TOTAL: 40 HOURS
TEXT BOOKS:
1. Boris Beizer, (2003). Software Testing Techniques, II Edition., Dream Tech India, New Delhi.
2. Marnie L Hutcheson, (2003). Software testing fundamentals, 1st Edition, Wiley, DreamTech
India, New Delhi.

REFERENCE BOOKS:
1. Burnstein, (2003). Practical Software Testing, Springer International Edition.
2. Dorothy Graham,Rex Black, (2011). Foundations of Software Testing - ISTQBCertification, 3rd
Edition, Cengage Learning.
3. R.Rajani, and P.P.Oak, (2004). Software Testing, Tata Mcgraw Hill, New Delhi.

WEBSITE LINKS:
1. http://my.safaribooksonline.com
2. http://www2.sas.com
3. http://www.softwaretesting fundamentals.com
4. www.cs.cmu.edu
5. www.softwaretesting management.con
6. http://www.java2novice.com/junit-examples/test-list-objects/

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - 3 2 3 1 - 1 2 - - - - - - 1 -
CO2 3 - 2 - - - - - - 1 2 - - - - - -
CO3 3 - - - - - - - 1 - - - - - - - 1
CO4 3 - 3 2 3 1 - 1 2 - - - 1 2 - - -
CO5 3 - - 1 2 1 - 1 - - 1 - - - - - -
Average 3 - 2.7 1.7 2.7 1 - 1 1.7 1 1.5 - 1 2 - 1 1
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
Semester III
24CAP304W FULL STACK WEB DEVELOPMENT 5H-3C
Instruction Hours/week: L:5 T:0 P:0 Marks: Internal:40 External:60 Total:100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To gain proficiency in developing both client-side (front-end) and server-side (back-end)
components of web applications.
 To develop robust back-end services and APIs using server-side technologies
 To implement database solutions (SQL or NoSQL) and manage data storage, retrieval, and
manipulation efficiently to support application functionality and performance requirements.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Summarize the introduction about CSS and JavaScript Understanding
CO2 Analyze the Server side programming with NodeJs Analyzing
CO3 Demonstrate the MongoDB connection with NodeJs Understanding
CO4 Illustrate to create interactive and responsive user interfaces Understanding

CO5 Analyze the horizontal scaling strategies to handle increased traffic

Analyzing
and workload

UNIT I INTRODUCTION TO CSS AND JAVASCRIPT 8

HOURS
Introduction to Web: Server - Client - Communication Protocol (HTTP) – Structure of HTML
Documents – Basic Markup tags – Working ith Text and Images with CSS– CSS Selectors – CSS
Flexbox - JavaScript: Data Types and Variables - Functions - Events – AJAX: GET and POST
UNIT II SERVERSIDE PROGRAMMING WITH NODE JS 8
HOURS
Introduction to Web Servers – Javascript in the Desktop with NodeJS – NPM – Serving files with the http
module – Introduction to the Express framework – Server-side rendering with Templating Engines –
Static Files - async/await - Fetching JSON from Express.
UNIT III ADVANCED NODE JS AND DATABASES 8
 HOURS
Introduction to NoSQL databases – MongoDB system overview - Basic querying with MongoDB shell –
Request body parsing in Express – NodeJS MongoDB connection – Adding and retrieving data to
MongoDB from NodeJS – Handling SQL databases from NodeJS – Handling Cookies in NodeJS –
Handling User Authentication with NodeJS.
UNIT IV ADVANCED CLIENT-SIDE PROGRAMMING 8 HOURS
React JS: ReactDOM - JSX - Components - Properties – Fetch API - State and Lifecycle - -JS Local
storage - Events - Lifting State Up - Composition and Inheritance
UNIT V APP IMPLEMENTATION IN CLOUD 8 HOURS
Cloud providers Overview – Virtual Private Cloud – Scaling (Horizontal and Vertical) – Virtual
Machines, Ethernet and Switches – Docker Container – Kubernetes

TEXT BOOKS:
1. David Flanagan, (2020). Java Script: The Definitive Guide, 7th Edition, O’Reilly Media, Inc.
2. Matt Frisbie, (2019). Professional JavaScript for Web Developers, 4th Edition, Wiley Publishing, Inc.
3. Alex Banks, Eve Porcello, (2020). Learning React, 2nd Edition, O’Reilly Media, Inc.

REFERENCE BOOKS:
1. Marc Wandschneider, (2016). Learning Node, 2nd Edition, Addison-Wesley Professional.
2. Joe Beda, Kelsey Hightower, Brendan Burns, (2017). Kubernetes: Up and Running, 1st
edition, Reilly Media.
3. Paul Zikopoulos, Christopher Bienko, Chris Backer, Chris Konarski, Sai Vennam, (2021).
Cloud Without Compromise, 1st Edition, O’Reilly Media.

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - - - - - - - 1 1 1 - - - - - -
CO2 3 - 3 2 3 2 - 2 2 - - - - - - 1 -
CO3 3 - - 1 - 1 - 1 - - 1 - - - - - 1
CO4 3 - - - 1 - - - - - - - - - - - -
CO5 3 - 3 2 3 2 - 2 2 - - - - - - - 2
Average 3 - 3 1.7 2.3 1.7 - 1.7 1.7 1 1 - - - - 1 1.5
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025

Semester III
24CAP304DS DATA PREPROCESSING AND VISUALIZATION 5H-3C
Instruction Hours/week: L:5 T:0 P:0 Marks: Internal:40 External:60
Total:100
End Semester Exam:3
Hours
PREREQUISITE:
Not Required.
COURSE OBJECTIVES (CO):
 To know the importance of data Visualization in the world of Data Analytics and Prediction
 To know the important libraries in Tableau
 To create charts using Tableau Tool
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Demonstrate to visualize data through seven stages of data Understanding

analysis process
CO2 Analyze the various hybrid types of data visualization Analyzing

CO3 Compare various stages of visualizing data Understanding

CO4 Analyze the standard maps to improve insights Analyzing

CO5 Evaluate an adhoc analysis to generate new data for Evaluating

forecasting

UNIT I CREATING VISUAL ANALYTICS WITH TABLEAU 9

HOURS Creating Visual Analytics with tableau desktop, connecting to your data-How to Connect to
your data, what are generated Values? Knowing when to use a direct connection, joining tables with
tableau, blending different data sources in a single worksheet.
UNIT II BUILDING YOUR FIRST VISUALIZATION 9
HOURS Building your first Visualization- How Me works- Chart types, Text Tables, Maps, bar chart,
Line charts, Area Fill charts and Pie charts, scatter plot, Bullet graph, Gantt charts, Sorting data in
tableau, Enhancing Views with filters, sets groups and hierarchies.
UNIT III CREATING CALCULATIONS 10
HOURS Creating calculations to enhance your data- What is aggregation, what are calculated values and
table calculations, Using the calculation dialog box to create, Building formulas using table calculations,
 Using table calculation functions

UNIT IV USING MAPS TO IMPROVE INSIGHTS 10

HOURS Using maps to improve insights-Create a Standard Map View, Plotting your own locations on a
map, Replace Tableau’s standard maps, Shaping data to enable Point-to-Point
mapping.
UNIT V DEVELOPING AN ADHOC ANALYSIS 10
HOURS
Developing an Adhoc analysis environment- generating new data with forecasts, providing self-evidence
adhoc analysis with parameters, Editing views in tableau Server.

TEXT BOOKS:
1. Joshua N. Millign, (2019). Learning Tableau, Third Edition- Packt publications.
2. Cole Nussbaumer Knaflic, (2014). Storytelling with Data: A Data Visualization Guide for
Business Professional.
3. Noah Iliinsky, Julie Steele, (2011). Designing Data Visualizations: Representing Informational
Relationships.

REFERENCE BOOKS:
1. Ashutosh Nandeshwar, (2009). Tableau Data Visualizaton Cookbook, PACKT publishing.
2. Hadley Wickham, (2009), ggplot2: Elegant Graphics for Data Analysis.
3. Alexandru C. Telea, (2007). Data Visualization principles and practice, Second Edition, CRC
Publications

WEBSITE LINKS:
1. https://www.tableau.com/
2. https://www.tutorialspoint.com/tableau/index.htm
3. https://www.coursera.org/specializations/data-visualization
4. https://towardsdatascience.com/tableau-visualizations

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO
CO
1 2 3 4 5 6 7 8 9 10
CO1 3 - 2 1 1 1 - 1 3 1 1 - - - - - -
CO2 3 - 3 2 3 1 - 2 - - - - - - - 1 2
CO3 3 - - - - - - - 1 - 2 - - - - - -
CO4 3 - 3 2 3 1 - 2 - - - - - - - - 2
CO5 3 - - - - - - - 3 - - - - - - - -
Average 3 - 2.7 1.7 2.3 1 - 1.7 2.3 1 1.5 - - - - 1 2
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation

Master of Computer Applications 2024-2025

Semester III
24CAP305D BIG DATA ANALYTICS 4H-3C
Instruction Hours/week: L:4 T:0 P:0 Marks: Internal:40 External:60
Total:100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required.
COURSE OBJECTIVES (CO):
 To understand the evolution and architecture of Big Data.
 To learn the virtualization concept of Big Data.
 To learn the Hadoop framework in processing Big Data.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Summarize the evolution and scope challenges of Data Management Understanding
in Big Data.
CO2 Explain the principles of data management to handle Big Data Understanding
effectively
CO3 Illustrate the suitability of different Big Data technologies for Understanding
specific use cases.
CO4 Summarize the concepts of Big Data Analytics. Understanding

CO5 Define the problem-solving skills with different strategies. Remembering

UNIT I FUNDAMENTALS OF BIG DATA 9

HOURS
The Evolution of Data Management Understanding the Waves of Managing Data- Defining BigData
- Big Data Management Architecture- The Big Data Journey -Big Data Types-Defining Structured Data-
Defining Unstructured Data-Putting Big Data Together.
UNIT II BIG DATA STACK 9
HOURS
Basics of Virtualization - The importance of virtualization to big data -Server virtualization Application
 virtualization - Network virtualization -Processor and memory virtualization Data and storage
virtualization.
UNIT III – HADOOP 10
HOURS
Hadoop - Hadoop Distributed File System - Hadoop MapReduce- The Hadoop foundation and
Ecosystem.
UNIT IV BIG DATA ANALYTICS 10
HOURS
Big Data Analytics-Text Analytics and Big Data-Customized Approaches for Analysis of Big Data.
UNIT V INTEGRATING DATA SOURCES 10
HOURS
Integrating Data Sources-Real-Time Data Streams and ComplexEvent Processing-
Operationalizing Big Data.

TEXT BOOKS
1. Michael Minelli, Michele Chambers, Ambiga Dhiraj, (2013). Big Data, Big Analytics: Emerging
Business Intelligence and Analytic Trends for Today’s Businesses, Wiley Publications, New Delhi.
2. Judith Hurwitz, Alan Nugent, Fern Halper, Marcia Kaufman, (2013). Big Data For Dummies, Wiley
India, New Delhi.

REFERENCE BOOKS:
1. Paul Zikopoulos, Dirk deRoos, Krishnan Parasuraman, Thomas Deutsch, James Giles,
DavidCorrigan, (2012). Harness the Power of Big Data The IBM Big Data Platform, Tata
McGrawHill Publications, New Delhi.
2. Zikopoulos, Paul, Chris Eaton, (2011). Understanding Big Data: Analytics for Enterprise Class
Hadoop and Streaming Data, Tata McGraw Hill Publications, New Delhi.

WEBSITE LINKS:
1. www.oracle.com/bigdata
2. www.planet-data.eu/sites/default/files/Big_Data_Tutorial_part4.pdf
3. www.ibm.com/developerworks/data

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO
CO
1 2 3 4 5 6 7 8 9 10
CO1 3 - 1 - 2 1 - 2 3 - 2 - - - - - -
CO2 3 - - 1 3 2 - 1 - 2 1 - - - - - 1
CO3 3 - 2 - - - - 1 2 - - - - - - - -
 CO4 3 - - - - 1 - - 3 3 3 - - - - 2 -
CO5 3 - - 3 2 2 - 1 - - - - - - - - -
Average 3 - 1.5 2 2.3 1.5 - 1.3 2.7 2.5 2 - - - - 2 1
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
Semester III
24CAP305N INTERNET OF THINGS 4H-3C
Instruction Hours/week: L:4 T:0 P:0 Marks: Internal:40 External:60 Total:100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To understand the Introduction to IoT and Architectural Overview of IoT
 To understand the various IoT Protocols (Datalink, Network, Transport, Session, Service)
 To understand the communication technologies in IoT Know the IoT protocols and web of things

COURSE OUTCOMES (COs):

Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Explain the fundamental concepts of Internet of Things. Understanding
CO2 Analyze the protocols, standardization efforts, and security. Analyzing
CO3 Analyze the Web of Things with the Internet of Things. Analyzing
CO4 Demonstrate the integration of Internet of Things. Understanding
CO5 Summarize the role of IoT in enhancing autonomy and agility. Understand

UNIT I – INTRODUCTION 9
HOURS
Internet Layers - Protocols - Packets - Services - Performance parameters - Peer-to-peer networks Sensor
networks - Multimedia - IOT Definitions and Functional Requirements – Motivation – Architecture -
Web 3.0 View of IoT– Ubiquitous IoT Applications – Four Pillars of IoT – DNAof IoT - The Toolkit
Approach for End-user Participation in the Internet of Things. Middleware for IoT: Overview –
Communication middleware for IoT –IoT Information Security.
UNIT II IOT PROTOCOLS 9
HOURS
Protocol Standardization for IoT – Efforts – M2M and WSN Protocols – SCADA and RFID Protocols –
Issues with IoT Standardization – Unified Data Standards – Protocols – IEEE 802.15.4 – BACNet
Protocol – point-to-point protocols - Ethernet protocals - cellular Internet access protocol - Machine-to-
machine protocol - Modbus – KNX – Zigbee Architecture – Network layer – APS layer – Security.
UNIT III WEB OF THINGS 10
HOURS
Web of Things versus Internet of Things – Two Pillars of the Web – Architecture Standardization for
WoT– Platform Middleware for WoT – Unified Multitier WoT Architecture – WoT Portals and Business
Intelligence. Cloud of Things: Grid/SOA and Cloud Computing – Cloud Middleware – Cloud Standards
– Cloud Providers and Systems – Mobile Cloud Computing – The Cloud of Things Architecture.

UNIT IV INTEGRATING IOT 10

HOURS
Integrated Billing Solutions in the Internet of Things Business Models for the Internet of Things Network
Dynamics: Population Models – Information Cascades - Network Effects - Network Dynamics: Structural
Models - Cascading Behavior in Networks - The Small- World Phenomenon.
UNIT V APPLICATIONS 10
HOURS
The Role of the Internet of Things for Increased Autonomy and Agility in Collaborative Production
Environments - Resource Management in the Internet of Things: Clustering, Synchronization and
Software Agents. Applications - Smart Grid – Electrical Vehicle Charging Domain Specific IoT: Home
Automation-Agriculture-Health and Lifestyle monitoring system-Cities-Smart Parking-Smart Roads-
Surveillance. Industry: Machine Diagnosis-Indoor Air Quality Monitoring System.

TEXT BOOKS:
1. Olivier Hersent, Omar Elloumi and David Boswarthick, ( 2012). The Internet of Things:
Applications to the Smart Grid and Building Automation. Wiley.
2. Olivier Hersent, David Boswarthick, Omar Elloumi, ( 2012). The Internet of Things –
Keyapplications and Protocols, Wiley.
3. Honbo Zhou, ( 2012). The Internet of Things in the Cloud: A Middleware Perspective,
CRCPress
REFERENCE BOOKS:
1. Dieter Uckelmann; Mark Harrison; Florian Michahelles- (Eds.), ( 2011).
Architecting the Internet of Things, Springer.
2. David Easley and Jon Kleinberg, ( 2010). Networks, Crowds, and Markets: Reasoning About a
Highly Connected World , Cambridge University Press.
WEBSITE LINKS:
1. https://www.ibm.com/blogs/internet-of-things/what-is-the-iot
2. https://www.i-scoop.eu/internet-of-things-guide
3. https://iot-analytics.com
CO, PO, PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - - - - 1 - - 3 3 2 - - - - - -
 CO2 3 - 3 2 2 1 - 2 - - - - - - - 3 3
CO3 3 - - 2 2 1 - 2 - - - - - - - - 2
CO4 3 - - - - - - - - - 1 - - - - - -
CO5 3 - - - - 1 - 1 - - - - - - - - 1
Average 3 - 3 2 2 1 - 1.7 3 3 1.5 - - - - 3 2
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
Semester III
24CAP305S SOFTWARE METRICS 4H-3C
Instruction Hours/week: L:4 T:0 P:0 Marks: Internal:40 External:60
Total:100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To understand the basic terminology and state fundamental facts about software metrics and
process models.
 To identify the essential elements of a given metric or model, describe the interrelationships
among its various elements
 To understand software process assessment cycles, complexity metrics and models.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Explain the basic terminology and state fundamental facts about Understanding
software metrics and process models
CO2 Identify the basic quality tools in software development Remembering
CO3 Analyze the software process metrics in the process of Analyzing
software testing
CO4 Measure and analyze customer satisfaction in development of Analyzing
software
CO5 Assess the software project using the metrics Analyzing

UNIT I INTRODUCTION 9
HOURS
Software quality-popular views-the role of the customer-software quality- Total quality management.
Software development process models-the spiral model-iterative development process-The Cleanroom
Methodology-Process Maturity Framework and Quality standards. Fundamentals of Measurement
Theory-Level of measurement- Reliability and validity- Measurement Errors.
UNIT II APPLYING THE SEVEN BASIC QUALITY TOOLS 9
HOURS Applying the seven basic quality tools in software development-Defect removal
effectiveness- The Rayleigh Model-Exponential distribution and reliability growth models-Quality
management models.
UNIT III PROCESS METRICS FOR SOFTWARE TESTING 10
 HOURS Process metrics for software testing-Complexity metrics and models-Metrics and lessons
learned for object-oriented projects-Availability metrics.

UNIT IV MEASURING AND ANALYZING 10

HOURS Measuring and analyzing customer satisfaction-Conducting in-process quality assessments.
UNIT-V - SOFTWARE PROJECT ASSESSMENTS 10
HOURS
Software project assessments-Dos and Don’ts of software process improvement-Using function point
metrics to measure software process improvement-Concluding remarks.
TEXT BOOKS:
1. Norman Fenton, (2014). Software Metrics: A Rigorous and Practical Approach, Third Edition,
Chapman & Hall/CRC Innovations in Software Engineering and Software Development Series.
2. Stephen H.Kan, (2013). Metrics and Models in Software Quality Engineering, Second Edition,
Pearson India.
3. C. Ravindranath Pandian, (2003). Software Metrics: A Guide to Planning, Analysis, and Application.

WEBSITE LINKS:
1. https://www.digimat.in/nptel/courses/video/106101061/L21.html

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - - - - - - - - 1 2 - - - - - -
CO2 3 - - 1 - 1 - 2 - 2 2 - - - - - -
CO3 3 - 2 3 3 2 - 2 3 - - - - - - 2 -
CO4 3 - 2 2 3 2 - 2 3 - - - - - - - 2
CO5 3 - 2 2 3 2 - 2 3 - - - - - - 1 -
Average 3 - 2 2 3 1.8 - 2 3 1.5 2 - - - - 1.5 2
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
Semester III
24CAP305W SERVICE ORIENTED ARCHITECTURE 4H-3C
Instruction Hours/week: L:4 T:0 P:0 Marks: Internal:40 External:60 Total:100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To enable seamless communication and interaction between heterogeneous systems and
technologies.
 To establish policies and mechanisms for governing service interactions, access control, data
privacy, and compliance with regulatory requirements.
 To provide a foundational approach for transitioning to microservices architecture.

COURSE OUTCOMES (COs):

Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Construct to build applications based on XML Applying
CO2 Explain the service orientation concepts, benefits of SOA Understanding
CO3 Analyze the various web services and WS standards Analyzing
CO4 Compare the various web services extensions to develop solutions Understanding
CO5 Illustrate service modeling, service-oriented analysis and design for Understanding
application development

UNIT I INTRODUCTION TO XML 8 HOURS

XML document structure – Well-formed and valid documents – DTD – XML Schema – Parsing XML
using DOM, SAX – XPath - XML Transformation and XSL – X Query.
UNIT II SERVICE ORIENTED ARCHITECTURE (SOA) BASICS 8 HOURS
Characteristics of SOA, Benefits of SOA, Comparing SOA with Client-Server and Distributed architectures
– Principles of Service Orientation – Service layers.
UNIT III WEB SERVICES (WS) AND STANDARDS 8 HOURS
Web Services Platform – Service descriptions – WSDL – Messaging with SOAP – Service discovery –
UDDI – Service-Level Interaction Patterns – Orchestration and Choreography.
UNIT IV WEB SERVICES EXTENSIONS 8 HOURS
WS Addressing – WS Reliable Messaging – WS Policy – WS Coordination – WS Transactions – WS
Security – Examples.
 UNIT V SERVICE ORIENTED ANALYSIS AND DESIGN 8 HOURS
SOA delivery strategies – Service oriented analysis – Service Modelling – Service oriented design –
Standards and composition guidelines – Service design – Business process design – Case Study.

TEXT BOOKS:
1. Thomas Erl, (2005), Service Oriented Architecture: Concepts, Technology and Design, Pearson
Education.
2. Sandeep Chatterjee and James Webber, (2004). Developing Enterprise Web Services: An
Architect's Guide, Prentice Hall.
2. James McGovern, Sameer Tyagi, Michael E Stevens and Sunil Mathew, (2003). Java Web
Services Architecture, Elsevier.

REFERENCE BOOKS:
1. Ron Schmelzer et al, (2002). XML and Web Services, Pearson Education.
2. Frank P.Coyle, (2002). XML, Web Services and the Data Revolution, Pearson Education.
3. Thomas Erl, (2005). Service Oriented Architecture: Concepts, Technology, and Design, Pearson
Education

WEBSITE LINKS
1. https://www.w3schools.com/xml/xml_whatis.asp
2. https://www.javatpoint.com/service-oriented-architecture

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - 3 3 2 3 - 2 3 - - - - - - - -
CO2 3 - - - - - - - - 2 1 - - - - - -
CO3 3 - 3 2 3 2 - 3 3 - - - - - - 2 2
CO4 3 - - - - - - 1 - 2 1 - 2 - - - -
CO5 3 - 2 2 - 3 - 2 2 - - - - - - - -
Average 3 - 2.7 2.3 2.5 2.7 - 2 2.7 2 1 - 2 - - 2 2
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
 Master of Computer Applications 2024-2025

Semester III
24CAP305DS DEEP LEARNING
4H-3C
Instruction Hours/week: L:4 T:0 P:0 Marks: Internal:40 External:60
Total:100
End Semester Exam:3 Hours
PREREQUISITE:
Not Requiredbability and Statistics, Digital Communication, Programming Skills.
COURSE OBJECTIVES (CO):
 To understand the basic ideas and principles of Neural Networks
 To design the feed forward neural networks for real world problems
 To apply the concept of CNN for image classification

COURSE OUTCOMES (COs):

Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms

Level
CO1 Summarize the basic ideas and principles of Neural Understan
Networks ding
CO2 Analyze feed forward neural networks for real world problems. Analyzing

CO3 Analyze different deep learning models in Image related Analyzing

projects.
CO4 Compare various deep learning applications using RNN. Understan
ding
CO5 Analyze various deep learning applications using the tool Analyzing
TensorFlow/Keras

UNIT I INTRODUCTION TO NEURAL NETWORKS 9

HOURS
Basic concept of Neurons – Perceptron Algorithm – Feed Forward and Back Propagation Networks.
UNIT II Feed Forward Neural Networks 9
HOURS Feed Forward Neural Networks – Gradient Descent – Back Propagation Algorithm –
Vanishing Gradient problem – Mitigation – RelU Heuristics for Avoiding Bad Local Minima –
Heuristics for Faster Training.
 UNIT III Convolution Neural Networks 10
HOURS Nestors Accelerated Gradient Descent – Regularization – Dropout. CNN Architectures –
Convolution – Pooling Layers – Transfer Learning – Image Classification using Transfer
Learning.
UNIT IV- Recurrent Neural Networks 10
HOURS RNN, LSTM, GRU, Encoder/Decoder Architectures – Autoencoders – Standard- Sparse –
Denoising – Contractive- Variational Autoencoders – Adversarial Generative Networks –
Autoencoder and DBM- Image Segmentation – Object Detection – Automatic Image
Captioning– Image generation with Generative Adversarial Networks – Video to Text with LSTM
Models.
UNIT V- Case Studies Using CNN & RNN 10 HOURS
Attention Models for Computer Vision – Case Study: Named Entity Recognition – Opinion Mining
using Recurrent Neural Networks – Parsing and Sentiment Analysis using Recursive Neural
Networks – Sentence Classification using Convolutional Neural Networks – Dialogue
Generation with LSTMs.

TEXT BOOKS:
1. Francois Chollet, (2018). Deep Learning with Python, First Edition, Manning Publications.
2. Ragav Venkatesan, Baoxin Li, (2018). Convolutional Neural Networks in Visual Computing, First
Edition, CRC Press.
3. Navin Kumar Manaswi, (2018). Deep Learning with Applications Using Python, First Edition, A
press.

REFERENCE BOOKS:
1. Phil Kim, (2017). Matlab Deep Learning: With Machine Learning, Neural Networks and Artificial
Intelligence, Third Edition, A Press.
2. Ian Good Fellow, Yoshua Bengio and Aaron Courville, (2017). Deep Learning, First Edition, MIT
Press.
3. Joshua F. Wiley, (2016). Deep Learning Essentials, First Edition, Packt Publications.

WEBSITE LINKS:
1. www.ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-s191- introduction- to-deep-
learning-january-iap-2020/
2. www.kaggle.com/learn/intro-to-deep-learning

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
 CO1 3 - - - - - - - 3 1 1 - - - - - -
CO2 3 - 3 2 3 2 - 2 3 - - - - - - 2 -
CO3 3 - 3 - 3 2 - 2 3 - - - - - - - 2
CO4 3 - 1 - - 3 1 1 - 1 - - 1 - - - -
CO5 3 - 3 2 3 2 1 2 3 - - - - - - - 1
1
Average 3 - 2.5 2 3 2.3 1 1.8 3 1 1 - 1 - - 2 .
5
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-20

Semester III
24CAP313D NOSQL DATABASE-PRACTICAL 3H-2C
Instruction Hours/week: L:0 T:0 P:3 Marks: Internal:40 External:60 Total:100
End Semester Exam: 3 Hours
PREREQUISITE:
Not Required.
COURSE OBJECTIVES (CO):
 To explore different types of NoSQL databases (document-based, key-value, column-family,
graph-based) and their use cases.
 To implement SSL/TLS encryption and role-based access control (RBAC) to secure data.
 To optimize database configurations and indexes based on performance metrics.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Create indexes on fields in your database to improve query Creating

performance
CO2 Implement different concurrency control mechanisms Creating

CO3 Experiment with transactions or atomic operations to ensure data Creating

integrity
CO4 Evaluate performance metrics Evaluating

CO5 Design to handle scalability and fault tolerance. Creating

List of Programs 36 HOURS

1. Install a NoSQL database of your choice (such as MongoDB, Cassandra, Redis, Neo4j, etc.) on
your local machine.
2. Practice creating, reading, updating, and deleting data in your chosen NoSQL database. Get
comfortable with the syntax and APIs provided by the database.
3. Design a simple data model for a sample application and implement it in your NoSQL database.
Consider the structure of your data and how it will be queried.
4. Experiment with creating indexes on fields in your database to improve query performance.
Analyze query execution plans to understand optimization opportunities.
5. Set up a clustered environment or replica set in your NoSQL database to understand how it
handles scalability and fault tolerance.
 6. Practice backing up and restoring data in your NoSQL database. Understand the different backup
strategies supported by the database.
7. Explore how your chosen NoSQL database handles concurrent writes and reads. Experiment with
different concurrency control mechanisms if applicable.
8. Experiment transactions or atomic operations with NoSQL database to understand how they work
and their limitations.
9. Configure authentication and authorization mechanisms in your NoSQL database to ensure data
security. Explore features like SSL/TLS encryption and role-based access control.
10. Write scripts to simulate various workloads (read-heavy, write-heavy, mixed) and measure the
performance of your NoSQL database under different scenarios.
11. Develop a sample application (web, mobile, or desktop) that interacts with your NoSQL
database. Implement CRUD operations and other features using the database's API.
12. Set up monitoring and alerting for your NoSQL database to track performance metrics, detect
issues, and take proactive action when necessary
TEXT BOOKS:
1. Sadalage, P. & Fowler, (2019). NoSQL Distilled: A Brief Guide to the Emerging World of
Polyglot Persistence, 1st Edition, Wiley Publications.

WEBSITE LINKS:
1. https://www.ibm.com/cloud/learn/nosql-databases
2. https://www.coursera.org/lecture/nosql-databases/introduction-to-nosql-VdRNp
3. https://www.geeksforgeeks.org/introduction-to-nosql/
4. https://www.javatpoint.com/nosql-database

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - 3 3 - 2 - 2 3 1 2 - - - - 2 -
CO2 3 - 3 3 - 2 - 2 3 2 2 - - - - - 2
CO3 3 - 3 3 3 3 - 3 3 - - - - - - - -
CO4 3 - 3 3 3 3 - 3 3 - 1 - - - - - 2
CO5 3 - 1 1 1 2 - 2 3 - - - - - - - -
Average 3 - 2.6 2.6 2.3 2.4 - 2.4 3 1.5 1.7 - - - - 2 2
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025

Semester III
24CAP313N SOFTWARE DEFINED NETWORK – PRACTICAL 3H-2C
Instruction Hours/week: L:0 T:0 P:3 Marks: Internal:40 External:60 Total:100
End Semester Exam: 3 Hours
PREREQUISITE:
Not Required.
COURSE OBJECTIVES (CO):
 To configure virtual network topologies and experiment with different network configurations.
 To gain proficiency in configuring and managing OpenFlow controllers and switches.
 To implement network-wide changes dynamically using SDN principles.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Summarize the concepts of Mininet and legacy networks Understanding
CO2 Design the controllers for transmitting messages Creating
CO3 Apply the Networking technique for configuring network Applying
CO4 Develop the SDN applications Creating
CO5 Apply the protocols and routing techniques Applying

LIST OF PROGRAMS 36 HOURS

1. Introduction to Mininet
2. Legacy Networks: BGP Example as a Distributed System and Autonomous Forwarding
Decisions
3. Early Efforts of SDN: MPLS Example of a Control Plane that Establishes Semi-static
Forwarding Paths
4. Introduction to SDN- SDN Network Configuration
5. Configuring VXLAN to Provide Network Traffic Isolation
6. OpenFlow Protocol Management
7. Routing within an SDN network
8. Incremental Deployment of SDN Networks within Legacy Networks
9. Configuring Virtual Private LAN Service (VPLS)
10. Applying Equal-cost Multi-path Protocol (ECMP) within SDN networks
 TEXT BOOKS:
1. Paul Goransson and Chuck Black, (2014). Software Defined Networks: A Comprehensive
Approach, Morgan Kaufmann Publications.
2. Thomas D. Nadeau & Ken Gray, (2013). SDN - Software Defined Networks, O'Reilly
Publications.
3. Siamak Azodolmolky, (2013). Software Defined Networking with Open Flow, Packt Publishing.
4. Kreutz, Diego, (2015). Software-defined networking: A comprehensive survey, Proceedings of the
IEEE 103.1.
5. Nunes, Bruno AA, (2014). A survey of software-defined networking: Past, present, and future of
programmable networks Communications Surveys & Tutorials, IEEE 16.3.
REFERENCE BOOKS:
1. Lantz, Bob, Brandon Heller, and Nick McKeown, (2010). A network in a laptop: rapid
prototyping for software-defined networks, Proceedings of the 9th ACM SIGCOMM Workshop
on Hot Topics in Networks, ACM.
2. Monsanto, Christopher, (2013). Composing software defined networks, Presented as part of the
10th USENIX Symposium on Networked Systems Design and Implementation (NSDI 13).

WEBSITE LINKS
1. https://www.geeksforgeeks.org/software-defined-

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - - - - - - - 1 2 2 - - - - - -
CO2 3 - 2 1 2 1 - 1 2 - - - - - - - -
CO3 3 - 3 2 3 2 - 1 3 - - - - - - 1 -
CO4 3 - 3 3 3 2 - 2 3 - - - - - - 1 1
CO5 3 - 3 2 3 2 - 2 3 - - - - - - - 1
Average 3 - 2.8 2 2.8 1.8 - 1.5 2.4 2 2 - - - - 1 1
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025

Semester III
24CAP313S SOFTWARE TESTING AND QUALITY ASSURANCE -PRACTICAL 3H-2C
Instruction Hours/week: L:0 T:0 P:3 Marks: Internal:40 External:60 Total:100
End Semester Exam: 3 Hours
PREREQUISITE:
 Algebra, Probability and Statistics, Digital Communication, Programming Skills.
COURSE OBJECTIVES (CO):
 To measure software performance under various load conditions through stress testing, load
testing, and scalability testing.
 To identify performance bottlenecks and optimize software to handle expected user loads.
 To implement security testing techniques to ensure the protection of sensitive data and system
integrity.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Design effective test cases by identifying test scenarios Creating

CO2 Evaluate system performance under various load conditions Evaluating

CO3 Apply security testing using specialized tools Applying

CO4 Implement the integration on individual components or modules Creating

CO5 Analyze test metrics to assess testing progress Analyzing

List of Programs 36 HOURS

1. Create a test plan outlining the testing approach, test objectives, scope, resources, and schedule.
2. Write test cases based on requirements, covering both positive and negative scenarios, boundary
cases, and edge cases.
3. Execute test cases manually or using automated testing tools to validate the functionality of the
software.
4. Document any defects or issues found during testing, including steps to reproduce and
severity/priority classification.
5. Track defects through their lifecycle, from discovery to resolution, using a defect tracking system
or issue management tool.
6. Perform regression testing to ensure that new changes or fixes haven't introduced unintended side
effects or regressions.
 7. Test the integration of individual components or modules to ensure they work together as
expected.
8. Measure the performance of the software under various load conditions, including stress testing,
load testing, and scalability testing.
9. Evaluate the security of the software by identifying and mitigating potential vulnerabilities, such
as SQL injection, cross-site scripting, and authentication flaws.
10. Develop automated test scripts using testing frameworks and tools to increase efficiency and
repeatability of testing activities.
11. Track and analyze key metrics related to testing, such as defect density, test coverage, and test
execution status, and generate reports for stakeholders.
TEXT BOOKS
1. Dorothy Graham,Rex Black, and et.al, (2011). Foundations of Software Testing -
ISTQBCertification, 3rd Edition, Cengage Learning.
2. R.Rajani, and P.P.Oak, (2004). Software Testing, Tata Mcgraw Hill, New Delhi.
3. Boris Beizer, (2003). Software Testing Techniques, II Edition., Dream Tech India, NewDelhi.
4. Marnie L Hutcheson, (2003). Software testing fundamentals, 1st Edison, Wiley, DreamTech
India, New Delhi.
5. Burnstein, (2003). Practical Software Testing, Springer International Edition.

WEBSITE LINKS
1. http://my.safaribooksonline.com
2. http://www2.sas.com
3. http://www.softwaretesting fundamentals.com
4. www.cs.cmu.edu

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - 2 - 1 - - 1 1 1 1 - - - - - -
CO2 3 - 3 3 2 3 - 2 3 - - - - - - - -
CO3 3 - 3 2 3 3 - 3 3 - - - - - - 2 1
CO4 3 - 3 3 3 3 - 3 3 - - - - - - - 2
CO5 3 - 2 - 3 1 - 1 2 - - - - - - 2 -
Average 3 - 2.6 2.7 2.4 2.5 - 2 2.4 1 1 - - - - 2 1.5
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
Semester III
24CAP313W FULL STACK WEB DEVELOPMENT – PRACTICAL 3H-2C
Instruction Hours / week: L:0 T:0 P:3 Marks: Internal: 40 External: 60Total:
100
End Semester Exam: 3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (COS):
 To learn to create interactive forms and validate user input using client-side JavaScript.
 To develop proficiency in CRUD operations with a NoSQL database (MongoDB), integrating
with a Node.js backend.
 To implement a full-stack application using React for the front-end and Node.js for the back-end,
utilizing JSON file storage.
COURSE OUTCOMES (COS):
Upon completion of this course, Students will able to

COs Course Outcomes Blooms Level

CO1 Implement the client side of the web application using java script Creating

CO2 Develop and deploy server side applications using NodeJS Creating

CO3 Develop a web application using NodeJS and Express Creating

CO4 Implement a SPA using React Creating

CO5 Develop a full stack single page application using React, NodeJS, and a Creating
Database (MongoDB or SQL)

LIST OF PROGRAMS 36
HOURS

1. Create a form and validate the contents of the form using JavaScript.
2. Get data using Fetch API from an open-source endpoint and display the contents in the
form of a card.
3. Create a NodeJS server that serves static HTML and CSS files to the user without using
Express.
4. Create a NodeJS server using Express that stores data from a form as a JSON file and
displays it in another page. The redirect page should be prepared using Handlebars.
 5. Create a NodeJS server using Express that creates, reads, updates and deletes students'
details and stores them in MongoDB database. The information about the user should be
obtained from a HTML form.
6. Create a NodeJS server that creates, reads, updates and deletes event details and stores them
in a MySQL database. The information about the user should be obtained from a HTML
form.
7. Create a counter using ReactJS
8. Create a Todo application using ReactJS. Store the data to a JSON file using a simple
NodeJS server and retrieve the information from the same during page reloads.
9. Create a simple Sign up and Login mechanism and authenticate the user using cookies. The
user information can be stored in either MongoDB or MySQL and the server should be built
using NodeJS and Express Framework.
10. Create and deploy a virtual machine using a virtual box that can be accessed from the host
computer using SSH.
11. Create a docker container that will deploy a NodeJS ping server using the NodeJS image.

TEXT BOOKS:

1. David Flanagan, (2020) .Java Script: The Definitive Guide, O’Reilly Media, Inc, 7th
Edition.
2. Matt Frisbie, (2019). Professional JavaScript for Web Developers, Wiley Publishing, Inc,
4th Edition, ISBN: 978-1-119-36656-0.
3. Alex Banks, Eve Porcello, , (2020). Learning React , O’Reilly Media, Inc, 2nd Edition
4. Marc Wandschneider, 2016. Learning Node, Addison-Wesley Professional, 2nd Edition.

REFERENCE BOOKS:

1. Joe Beda, Kelsey Hightower, Brendan Burns, (2017). Kubernetes: Up and Running,
O’Reilly Media, 1st edition,
2. Paul Zikopoulos, Christopher Bienko, Chris Backer, Chris Konarski, Sai Vennam, (2021).
Cloud without Compromise, O’Reilly Media, 1st edition

CO, PO, PSO Mapping

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PO13 PO14 PO15 PSO1 PSO2

CO1 3 - 3 3 2 2 - 2 3 1 1 - - - - - -
CO2 3 - 3 3 2 2 - 2 3 1 1 - - - - 2 2
CO3 3 - 3 3 2 2 - 2 3 1 1 - - - - - 1
CO4 3 - 3 3 2 2 - 2 3 1 1 - - - - - 1
CO5 3 - 3 3 2 2 - 2 3 1 1 - - - - - 2
CO 3 0 3 3 2 2 0 2 3 1 1 0 0 0 0 2 2
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation

Master of Computer Applications 2024-2025

Semester III
24CAP313DS DATA VISUALIZATION –PRACTICAL 3H-2C
Instruction Hours / week: L:0 T:0 P:3 Marks: Internal: 40 External: 60Total:
100
End Semester Exam: 3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To know the importance of data Visualization in the world of Data
Analytics and Prediction
 To learn the important libraries in Tableau
 To create charts using Tableau Tool
COURSE OUTCOMES (COs):
Upon completion of this course, Students will able to

COs Course Outcomes Blooms Level

CO1 Examine data through seven stages of data analysis process Analyzing

CO2 Compare various hybrid types of data visualization Analyzing

CO3 Analyze various stages of visualizing data Analyzing

CO4 Create charts using Tableau Tool Creating

CO5 Analyze and aggregate data using Tableau Tool Analyzing

LIST OF PROGRAMS 36 HOURS

1. Connect to data Sources
2. Create Univariate Charts
3. Create Bivariate and Multivariate charts
4. Create Maps
5. Calculate user-defined fields
6. Create a workbook data extract
 7. Save a workbook on a Tableau server and web
8. Export images, data.

TEXT BOOKS
1. Joshua N. Millign, (2019). Learning Tableau , Third Edition- Packt publications Student Activity
2. Cole Nussbaumer Knaflic , (2014). Storytelling with Data: A Data Visualization Guide for Business
Professionals
3. Noah Iliinsky, Julie Steele , (2011), Designing Data Visualizations: Representing Informational
Relationships
4. Ashutosh Nandeshwar, (2009), Tableau Data Visualizaton Cookbook, PACKT publishing.
5. Hadley Wickham , (2009), ggplot2: Elegant Graphics for Data Analysis
6. Alexandru C. Telea , (2007). Data Visualization principles and practice, Second Edition, CRC
Publications
WEBSITE LINKS
1. https://www.tableau.com/
2. https://www.tutorialspoint.com/tableau/index.htm
3. https://www.coursera.org/specializations/data-visualization
4. https://towardsdatascience.com/tableau-visualizations

CO, PO, PSO Mapping

COs PO PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9PO10 PO11 PO12 PO13 PO14 PO15 PSO1PSO2
1
CO1 3 - 1 - - 2 - 2 1 1 1 - - - - - 1
CO2 3 - 1 - - - - - - 1 - - 1 - - - -
CO3 3 - 3 2 3 2 - 2 2 - - - - - - 1 -
CO4 3 - 2 - 2 2 - 2 2 - - - - - - - -
CO5 3 - 3 2 3 2 - 2 2 - - - - - - - 1
CO 3 0 2 2 3 2 0 2 2 1 1 0 1 0 0 1 1
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
Semester III
24CAP391 INTERNSHIP 0H –2C
Instruction Hours / week: L:0 T:0 P:3 Marks: Internal: 40 External: 60Total:
100
End Semester Exam: 3 Hours
Master of Computer Applications 2024-2025
Semester III
24CAP491 PROJECT AND VIVA VOCE 12C
Instruction Hours / week: L:0 T:0 P:3 Marks: Internal: 40 External: 60Total:
100
End Semester Exam: 3 Hours
Master of Computer Applications 2024-2025

Semester I
24CAP101B PROBLEM SOLVING AND PROGRAMMING IN C
Instruction Hours/week: L:0 T:0 P:0 Marks: Internal:40 External:60 Total:100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To develop algorithms to solve simple to complex problems using structured and modular
programming techniques in C
 To train students in identifying and fixing errors (bugs) in programs using debugging tools and
techniques
 To write modular and reusable code using functions and libraries in C
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes (COs) Blooms Level

CO1 Analyze the efficiency of algorithms to determine their performance Analyzing
characteristics
CO2 Explain to write algorithms using programming languages Understanding
CO3 Summarize the programming concepts such as variables, constants, Understanding
operators, expressions, control statements
CO4 Explain how to work with arrays, strings, functions, and pointers Understanding
CO5 Evaluate file management operations Evaluating

UNIT I INTRODUCTION TO COMPUTER PROBLEM SOLVING

Introduction – The Problem Solving aspect – Top down design – Implementation of algorithm – Program
Verification – The efficiency of algorithms – The analysis of algorithms – Fundamental Algorithms
UNIT II PROGRAMMING AND ALGORITHMS
Programs and Programming – building blocks for simple programs -pseudo code representation – flow
charts - Programming Languages - compiler –Interpreter, Loader and Linker - Program execution –
Classification of Programming Language - Structured Programming Concept – Illustrated Problems:
Algorithm to check whether a given number is Armstrong number or not- Find factorial of a number
UNIT III BASICS OF ‘C’, INPUT / OUTPUT & CONTROL STATEMENTS
Introduction- Identifier – Keywords - Variables – Constants – I/O Statements - Operators – Initialization
Expressions – Expression Evaluation – Lvalues and Rvalues – Type Conversion in C –Formatted input
and output functions - Specifying Test Condition for Selection and Iteration- Conditional Execution - and
 Selection – Iteration and Repetitive Execution- go to Statement – Nested Loops- Continue and break
statements.
UNIT IV ARRAYS, STRINGS, FUNCTIONS AND POINTERS
Array – One dimensional Character Arrays- Multidimensional Arrays- Arrays of Strings – Two-
dimensional character array – functions - parameter passing mechanism scope – storage classes –
recursion - comparing iteration and recursion- pointers – pointer operators - uses of pointers- arrays and
pointers – pointers and strings - pointer indirection pointers to
functions - Dynamic memory allocation.
UNIT V USER-DEFINED DATATYPES & FILES
Structures – initialization - nested structures – structures and arrays – structures and pointers - union–
type def and enumeration types - bit fields - File Management in C – Files and Streams – File handling
functions – Sequential access file- Random access file – Command line arguments.

TEXT BOOKS:
1. Sprankle, M., & Hubbard, J, (2019). Problem Solving and Programming Concepts, 9th Edition,
Pearson.
2. King, K. N, (2015). C Programming: A Modern Approach, 3rd Edition, W. W. Norton &
Company.

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - 2 2 3 2 - 2 3 - - - - - - 2 -
CO2 3 - - 1 - - - - - - 3 - - - - - -
CO3 3 - 1 - - - - - - 3 - - - - - 1 -
CO4 3 - - 2 - 1 - 1 2 1 2 - - - - - -
CO5 3 - 3 3 3 2 - 2 3 - - - - - - - 2
Average 3 - 2 2 3 1.7 - 1.7 2.7 2 2.5 - - - - 1.5 2
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
Semester I
24CAP102B DATA STRUCTURES
Instruction Hours/week: L:0 T:0 P:0 Marks: Internal:40 External:60 Total:100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To introduce students to various fundamental data structures such as arrays, linked lists, stacks,
queues, trees, and graphs.
 To illustrate how data structures can be applied to solve various computational problems
efficiently.
 To introduce advanced data structures like AVL trees, red-black trees, hash tables, heaps, and
advanced graph algorithms.

COURSE OUTCOMES (COs):

Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Explain the linear data structures Understanding
CO2 Construct a tree and perform various operations on a tree alone with Understanding
implementation.
CO3 Examine the solution for solving various computing problems using graph Analyzing
data structure
CO4 Make use of Hashing Techniques to generate hash address and to resolve Applying
the collision on it
CO5 Evaluate sorting, searching and merging of input elements Evaluating

UNIT I LINKED LISTS, STACKS AND QUEUES

Introduction - Representation and Operations: Linear Linked List - Doubly Linked List– Circular Linked
List – Header Linked Lists Applications of Linked list -Stacks: Operations on stacks-Representation of a
stack in memory – Applications of stack – Queues: Operations – Representation of Queues in memory –
Applications of Queues.
UNIT II TREES
Introduction – Tree terminology – Binary trees – Tournament trees – Binary search trees: Representation
of a binary and Binary search tree –Operations on binary and Binary search tree – Creation – Traversal –
AVL Trees – Threaded binary trees – B Tree – B+ Trees - Heaps.
 UNIT III GRAPHS
Introduction – Graph terminology – Representation of Graphs –Operations on Graphs – Applications of
Graph - Topological Sort – Minimum Spanning Tree – Finding Shortest paths - Articulation Points,
Bridges, and Biconnected Components, Strongly connected components – Eulerian Tour – Hamiltonian
Tour.
UNIT IV HASH TABLES AND HASHING
Introduction – Direct Address table - Hash Table – Hash Function – Resolving collisions: Synonyms
Chaining– Open Addressing - Rehashing.
UNIT V SORTING, SEARCHING AND MERGING
Introduction – Bubble sort – Selection sort –Insertion Sort – Bucket / Radix Sort - Merge Sort – Quick
Sort – Heap Sort – Tree sort – Shell Sort – Searching: Linear – Binary search – Merging.

TEXT BOOKS
1. R.S.Salaria, (2022). Data structures & Algorithms Using C, 5th Edition, Khanna Book Publishing
Co.Pvt. Ltd.,SRS Enterprises, New Delhi.
2. ReemaThareja., (2018). Data Structures using C, 2nd Edition, Oxford University Press, New Delhi.
3. Jean Paul Tremblay and Paul G. Sorensen, (2017). An Introduction to Data Structures with
Applications, 2nd Edition, Tata McGraw Hill, New Delhi.

WEBSITE LINKS
1. https://www.geeksforgeeks.org/learn-data-structures-and-algorithms-dsa-tutorial/
2. https://techdevguide.withgoogle.com/paths/data-structures-and-algorithms/
3. https://www.programiz.com/dsa

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - - - - - - - 1 1 1 - - - - - -
CO2 3 - - 1 2 1 - 1 2 1 - - - - - - -
CO3 3 - 3 2 3 2 - 2 2 - - - - - - 2 1
CO4 3 - 3 2 3 2 - 2 2 - 1 - - - - - -
CO5 3 - 3 3 - 3 - - 2 - - - - - - - 2
Average 3 - 3 2 2.7 2 - 1.7 1.8 1 1 - - - - 2 1.5
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
 Master of Computer Applications 2024-2025
Semester II
24CAP201B COMPUTER ORGANIZATION AND ARCHITECTURE
Instruction Hours/week: L:0 T:0 P:0 Marks: Internal:40 External:60
Total:100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To introduce students to the basic building blocks of a computer system, including the CPU,
memory, input/output devices, and storage units.
 To discuss parallel processing architectures (multi-core processors, GPUs) and distributed
computing systems.
 To learn about input and output devices, controllers, and communication interfaces.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Explain the basic structure and operations of a computer Understanding
CO2 Summarize the arithmetic and logic unit Understanding
CO3 Explain the memory hierarchies, cache memories and virtual memories Understanding
CO4 Demonstrate the basic concepts and functions of Operating Systems Understanding
CO5 Illustrate Process and various Scheduling Algorithms of OS Understanding

UNIT I BASIC STRUCTURE AND ARITHMETIC OPERATIONS

Functional Units – Basic Operational Concepts – Instructions: Language of the Computer – Operations,
Operands – Instruction representation – Logical operations – Decision Making – MIPS Addressing -
Arithmetic for Computers
UNIT II PROGRAMMING AND ALGORITHMS
A Basic MIPS implementation – Building a Datapath – Control Implementation Scheme –
Pipelining – Pipelined datapath and control – Handling Data Hazards & Control Hazards – Exceptions
UNIT III MEMORY & I/O SYSTEMS
Memory Hierarchy - Memory technologies – cache memory – measuring and improving cache
performance – virtual memory –-Accessing I/O Devices – Interrupts – Direct Memory Access – Bus
structure –Interface circuits – USB.
UNIT IV OPERATING SYSTEMS OVERVIEW
 Operating system overview-objectives and functions, Evolution of Operating System- Operating System
Structure - System Calls- Processes – Process Concept, Inter-process Communication
UNIT V PROCESS MANAGEMENT
CPU Scheduling – Scheduling criteria, Scheduling algorithms, Multiple-processor scheduling, Threads
Overview– The critical-section problem, Semaphores, Classical problems of synchronization, Critical
regions.

TEXT BOOKS
1. David A. Patterson and John L. Hennessy, (2013). Computer Organization and Design: The
Hardware/Software Interface, Fifth Edition, Morgan Kaufmann / Elsevier.
2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky and Naraig Manjikian, (2012). Computer
Organization and Embedded Systems, Sixth Edition, Tata McGraw Hill.
3. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, (2012). Operating System Concepts, 9th
Edition, John Wiley and Sons Inc.
4. John P. Hayes, (2012). Computer Architecture and Organization, Third Edition, Tata McGraw Hill.
5. John L. Hennessey and David A. Patterson, (2012). Computer Architecture – A Quantitative
Approach, Fifth Edition, Morgan Kaufmann / Elsevier Publishers.
6. Andrew S. Tanenbaum, (2014). Modern Operating Systems, 4th Edition, Pearson Education.

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - 1 - - - - - - 2 1 - - - - - -
CO2 3 - 1 - - - - - - 2 1 - - - - - 1
CO3 3 - 1 - 1 1 - 1 2 - - - - - - 1 -
CO4 3 - 1 1 1 1 - 1 2 - - - - - - - -
CO5 3 - 1 2 2 2 - 1 2 - - - - - - - -
Average 3 - 1 1.5 1.3 1.3 - 1 2 2 1 - - - - 1 1
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
Semester II
24CAP202B DATABASE MANAGEMENT SYSTEMS
Instruction Hours/week: L:0 T:0 P:0 Marks: Internal:40 External:60 Total:100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To introduce students to fundamental concepts of databases, including data models (relational,
hierarchical, network, object-oriented), schema, and instances.
 To emphasize mechanisms for ensuring data integrity (constraints, transactions) and security
(authentication, authorization, encryption)
 To explore techniques for optimizing query performance, indexing strategies, and understanding
query execution plans.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Explain the fundamentals of data models and conceptualize and depict a Understanding
database system using ER diagram
CO2 Illustrate the SQL and relational database design Understanding
CO3 Explain about data storage techniques and query processing Understanding
CO4 Extend transaction processing, concurrency control techniques and Understanding
recovery procedures.
CO5 Summarize about files and indexing Understanding

UNIT I INTRODUCTION
File systems versus Database systems – Data Models – DBMS Architecture – Data Independence – Data
Modeling using Entity – Relationship Model –E-R Modeling.
UNIT II RELATIONAL MODEL AND QUERY EVALUATION
Relational Model Concepts – Relational Algebra – SQL – Basic Queries – Complex SQL Queries –
Views – Constraints.
UNIT III DATABASE DESIGN & APPLICATION DEVELOPMENT
Functional Dependencies – Non-loss Decomposition – First, Second, Third Normal Forms, Dependency
Preservation – Boyce/Codd Normal Form – Multi-valued Dependencies and Fourth Normal Form – Join
Dependencies and Fifth Normal Form.
 UNIT IV TRANSACTION PROCESSING
Quey Pocessing-Transaction Processing – Properties of Transactions - Serializability – Transaction
support in SQL - Locking Techniques –Validation Techniques –– Recovery concepts – Shadow paging –
Log Based Recovery.
UNIT V FILES AND INDEXING
File operations – Hashing Techniques – Indexing – Single level and Multi level indexing.

TEXT BOOKS
1. Abraham Silberschatz, Henry F.Korth and S.Sundarshan, (2017). Database System Concepts,
Seventh Edition, McGraw Hill.
2. RamezElamassri and ShankantBNavathe, (2017). Fundamentals of Database Systems, Seventh
Edition, Pearson Education Delhi.
3. RaghuRamakrishnan, (2015), Database Management Systems, Fourth Edition, McGrawHill
College Publications.
4. Lee Chao, (2010). Database Development and Management, 1st Edition, Auerbach Publications.
5. Carlos Coronel, Peter Rob, and Stephen Morris, (2013). Database Principles Fundamentals of
Design, Implementation, and Management, 10th Edition, Course Technology, Cengage Learning.
6. C.J. Date, (2003). An Introduction to Database Systems, Eighth Edition, Pearson Education
Delhi.

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - 1 - - - - - - 2 1 - - - - 1 -
CO2 3 - 1 - 1 1 - 1 2 - - - - - - - -
CO3 3 - 1 1 1 1 - 1 2 - - - - - - - 1
CO4 3 - 1 2 2 2 - 1 2 - - - - - - - -
CO5 3 - 1 1.5 1.3 1.3 - 1 2 2 1 - - - - 1 1
Average 3 - 1 - - - - - - 2 1 - - - - 1 -
CO, PO, PSO Mapping
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
Master of Computer Applications 2024-2025
Semester II
24CAP301B OPERATING SYSTEMS
Instruction Hours/week: L:0 T:0 P:0 Marks: Internal:40 External:60
Total:100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To learn basic concepts such as processes, threads, scheduling, memory management, file
systems, and I/O systems.
 To study file system organization, file operations, directory structures, and storage allocation
methods.
 To discuss OS security mechanisms, access control, authentication, and protection against
malicious attacks.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Summarize the basic structure and operations of a computer Understanding
CO2 Demonstrate the arithmetic and logic unit and implementation of fixed-point Understanding
and floating point arithmetic unit
CO3 Compare the different ways of communication with I/O devices Analyzing
CO4 Explain the basic concepts and functions of Operating Systems Understanding
CO5 Demonstrate Process and various Scheduling Algorithms of OS Understanding

UNIT I BASIC STRUCTURE AND ARITHMETIC OPERATIONS

Functional Units – Basic Operational Concepts – Instructions: Language of the Computer – Operations,
Operands – Instruction representation – Logical operations – Decision Making – MIPS Addressing
Arithmetic for Computers.
UNIT II PROGRAMMING AND ALGORITHMS
A Basic MIPS implementation – Building a Datapath – Control Implementation Scheme – Pipelining –
Pipelined data path and control – Handling Data Hazards & Control Hazards – Exceptions.
 UNIT III MEMORY & I/O SYSTEMS
Memory Hierarchy - Memory technologies – cache memory – measuring and improving cache
performance – virtual memory –-Accessing I/O Devices – Interrupts – Direct Memory Access – Bus
structure –Interface circuits – USB.

UNIT IV OPERATING SYSTEMS OVERVIEW

Operating system overview-objectives and functions, Evolution of Operating System- Operating System
Structure - System Calls- Processes – Process Concept, Inter-process Communication.
UNIT V PROCESS MANAGEMENT
CPU Scheduling – Scheduling criteria, Scheduling algorithms, Multiple-processor scheduling, Threads
Overview– The critical-section problem, Semaphores, Classical problems of synchronization, Critical
regions.
TEXT BOOKS
1. John P. Hayes, (2012). Computer Architecture and Organization, Third Edition, Tata McGraw Hill.
2. Andrew S. Tanenbaum, (2014). Modern Operating Systems, 4th Edition, Pearson Education.

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
CO1 3 - 1 - - - - - - 2 1 - - - - - -
CO2 3 - 1 - - - - - - 2 1 - - - - - -
CO3 3 - 1 - 1 1 - 1 2 - - - - - - - 1
CO4 3 - 1 1 1 1 - 1 2 - - - - - - - -
CO5 3 - 1 2 2 2 - 1 2 - - - - - - 1 -
1.
Average 3 - 1 1.3 1.3 - 1 2 2 1 - - - - 1 1
5
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation
 Master of Computer Applications 2024-2025
Semester II
24CAP302B WEB DESIGNING
Instruction Hours/week: L:0 T:0 P:0 Marks: Internal:40 External:60
Total:100
End Semester Exam:3 Hours
PREREQUISITE:
Not Required
COURSE OBJECTIVES (CO):
 To introduce the basic principles of design, including layout, typography, color theory, and
visual hierarchy.
 To learn HTML (Hypertext Markup Language) and CSS (Cascading Style Sheets) for
structuring and styling web content.
 To learn graphic design concepts relevant to web applications, including icons, images, and
multimedia elements.
COURSE OUTCOMES (COs):
Upon completion of this course, the student will be able to:

COs Course Outcomes Blooms Level

CO1 Summarize the fundamentals of web page. Understanding

CO2 Explain the basic HTML tags. Understanding

CO3 Explain how to design web using various IDE. Understanding

CO4 Illustrate about Frames and Tables. Understanding

CO5 Design Cascading Style Sheet. Creating

UNIT I WEB PAGE OVERVIEW

 Elements of a web page. Types of Sites, personal sites, small business sites, large business sites, online
business sites, Educational institution sites, Government sites, Blogs, twitter, Matching format to
audience, creating guidelines; creating a site structure, writing for the web, download time, methods for
creating pages, publishing a site, Addressing a web site, Absolute & Relative addresses, URL. Static and
dynamic websites.

UNIT II – HTML TAGS

Head content, adding a title, Body content, Paragraph breaks, Line breaks, Horizontal lines, Fonts and
text size, Text color, Headings, Aligning text, Lists, Background color.
UNIT III – HTML – IDE
About HTML editors, Net beans, Dream Viewer, the editing environment effective page design, Uniform
style, finding design ideas, Heading, Lists, using white space, splitting the text, colors and background,
creating pages with Save As.
UNIT IV – FRAMES AND TABLES
Frames and tables, animation effects, creating forms, Images, Image formats for the web, obtaining
images, image size, editing images, thumbnails, images and text, rollover images, Navigation, types of
hyperlinks, navigation bars, linking to external sites, email links, creating image maps, image maps in
action, site maps, three-click navigation, site linkage.
UNIT V – CASCADING SYTLE SHEET
Creating and editing cascading style sheets, adding sound - types of sound files, linking to sound files,
embedding sound files, Video, Analog video, Digital video, webcams, animation, downloading
animations, flash Publishing, testing, transferring to the web, registering a site, marketing a site,
maintaining a site, Domain names, web hosting.

TEXT BOOKS
1. Duckett, J, (2019). HTML and CSS: Design and Build Websites , 2nd ,Edition, John Wiley &
Sons.
2. Robbins, J., & Robbins, J. C, (2020). Learning Web Design: A Beginner's Guide to HTML, CSS,
JavaScript, and Web Graphics, 5th Edition, O'Reilly Media.
3. Castro, E. A., & Hyslop, E, (2021). HTML, XHTML, and CSS All-in-One For Dummies, 3rd
Edition.
4. Niederst Robbins, J, (2019). HTML5 Pocket Reference, 5th Edition, O'Reilly Media.
5. McFarland, D, (2022). CSS: The Missing Manual, 5th Edition, O'Reilly Media.

CO, PO, PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2
 CO1 3 - 1 - - - - - - 2 1 - - - - 1 -
CO2 3 - 1 - - - - - - 2 1 - - - - - -
CO3 3 - 1 - 1 1 - 1 2 - - - - - - - 1
CO4 3 - 1 1 1 1 - 1 2 - - - - - - - -
CO5 3 - 1 2 2 2 - 1 2 - - - - - - - -
Average 3 - 1 1.5 1.3 1.3 - 1 2 2 1 - - - - 1 1
1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation