Master of Computer Applications (MCA)

Syllabus

2024-25

CREDIT
COURS

COURS

COURS
E TYPE

HRS/W
TEACH

TOTAL

TOTAL
NAME

TERM
CODE
SEM

MID
EEK

ESE
ING

S
E

E
L T P
COR WEB
I CCMCA111 3 1 4 30 70 100
E DEVELOPMENT
COR JAVA & DATA
I CCMCA112 3 1 4 30 70 100
E STRUCTURES
DATABASE
COR
I CCMCA113 MANAGEMENT 3 1 4 30 70 100
E
SYSTEM
COR ARTIFICIAL
I CCMCA114 3 3 30 70 100
E INTELLIGENCE
COR OPERATING
I CCMCA115 3 3 30 70 100
E SYSTEMS
COR COMPUTER
I CCMCA116 3 3 30 70 100
E NETWORKS
WEB
COR
I CCMCA121 DEVELOPMENT 4 2 30 70 100
E
LAB
Java & DATA
COR
I CCMCA122 STRUCTURES 4 2 30 70 100
E
LAB
DATABASE
COR
I CCMCA123 MANAGEMENT 4 2 30 70 100
E
SYSTEM LAB
I OTH SODECA SODECA 2 30 70 100
100
29
0

COR MACHINE
II CCMCA211 3 1 4 30 70 100
E LEARNING
COR FULL STACK
II CCMCA212 3 1 4 30 70 100
E DEVELOPMENT
COR
II CCMCA213 MongoDB 3 1 4 30 70 100
E
COR Cloud
II CCMCA214 3 3 30 70 100
E Computing
COR SOFTWARE
II CCMCA215 3 3 30 70 100
E ENGINEERING
INTELLECTUAL
COR
II CCMCA216 PROPERTY 3 3 30 70 100
E
RIGHTS
II COR CCMCA221 MACHINE 4 2 30 70 100

MCA NEP WEF 2024-25 1 | 57

 LEARNING IN
E
PYTHON LAB
FULL STACK
COR
II CCMCA222 DEVELOPMENT 4 2 30 70 100
E
LAB
COR
II CCMCA223 MongoDB LAB 4 2 30 70 100
E
II OTH SODECA SODECA 2 30 70 100
100
29
0

COMPULSORY (1 LR PAPER OR 2 MOOC CERTIFICATE OR OJT) 2 CREDITS CF TO NEXT SEM

Mandatory Training: 45 working days. Training during semester Break between (II & III
semester), of 100 marks. Evaluation will be done in semester-III examinations. Training can be
carried out in any MNC, Voluntary organization, NGO, MSME, Public sector Units, society, and
cooperative etc. on any research project dealing in IT and its related domain.
COR
III CCMCA311 DATA SCIENCE 3 1 4 30 70 100
E
COR ADVANCED
III CCMCA312 3 1 4 30 70 100
E JAVA
COR INFORMATION
III CCMCA313 3 1 4 30 70 100
E SECURITY
ANALYIS AND
COR
III CCMCA314 DESIGN OF 3 3 30 70 100
E
ALGORITHMS
ELEC
III CEMCA315 ELECTIVE 1 3 3 30 70 100
.
ELEC
III CEMCA316 ELECTIVE 2 3 3 30 70 100
.
COR DATA SCIENCE
III CCMCA321 4 2 30 70 100
E LAB
COR ADVANCED
III CCMCA322 4 2 30 70 100
E JAVA LAB
COR
III CCMCA323 ANDROID LAB 4 2 30 70 100
E
III OTH SODECA SODECA 2 30 70 100
INDUSTRIAL
III OJT TRAINING 2 30 70 100
PRESENTATION
110
31
0

COR BLOCKCHAIN
IV CCMCA411 3 1 4 30 70 100
E TECHNOLOGY
COR CYBER
IV CCMCA412 3 1 4 30 70 100
E FORENSICS
ELEC
IV CEMCA413 Elective 3 3 3 30 70 100
.
ELEC
IV CEMCA414 Elective 4 3 3 30 70 100
.
IV PRJ CCMCA421 PROJECT 12 30 70 100
IV PRJ CCMCA422 SEMINAR 2 30 70 100
IV OTH SODECA SODECA 2 30 70 100

MCA NEP WEF 2024-25 2 | 57

 28 700

List of Electives

ELECTIVE 1
 ADVANCE COMPUTER NETWORKS
 BIG DATA ANALYTICS
 SOFT COMPUTING
ELECTIVE 2
 INTERNET OF THINGS
 ADVANCED COMPUTER GRAPHICS
 DEEP LEARNING
ELECTIVE 3
 ETHICS IN AI & CS (COMP Sc)
 SOCIAL MEDIA ANAYLTICS
 GENERATIVE AI
ELECTIVE 4
 ENTREPRENEURIAL DEVELOPMENT
 NATURAL LANGUAGE PROCESSING
 COMPUTER VISION AND
AUGMENTED REALITY

Programme Outcomes (POs)

PO1 Computational Knowledge: Apply computing knowledge, mathematical

knowledge and domain knowledge to create and develop new models
for real world applications.
PO2 Problem Analysis: Identify, formulate, review research literature and
analyze complex problems using principles of mathematics, computing
sciences and relevant domains.
PO3 Design / Development of Solutions: Design, implement, test and
maintain solutions for systems, components or processes that meet
specific needs with consideration for public health safety, societal and
environmental issues.
PO4 Conduct investigations of complex Computing problems: Use Research–
based knowledge to analyze and interpret data to obtain viable
conclusions.
PO5 Modern Tool Usage: Use modern tools, techniques and skills to solve
complex and critical computing problems with an understanding of their
limitations.
PO6 Professional Ethics: Understand and apply ethical principles, cyber
regulations and commit to professional computing practice and
responsibilities.
PO7 Life-long Learning: Recognize the importance of self-learning for
continual development as a computing professional.
PO8 Communication Efficacy: Recognize the importance of communication
within the computing community and the society at large.
PO9 Societal and Environmental Concern: Understand and assess the local
and global influence of software solutions and responsibilities related to
professional computing practice.

MCA NEP WEF 2024-25 3 | 57

PO1 Individual and Team Work: Deliver effectively as an individual and as a
0 member or leader in diverse teams and in multidisciplinary
environments.
PO1 Innovation and Entrepreneurship: Adopt standardized computer
1 application practices with innovative ideas to succeed as an employee
or an entrepreneur.

Bridge Course [For students other than BCA / B.Sc. (CS/IT)] It will be an audit
course for Non-Computer Graduates. No Marks will be added. But Student has to
pass this Course; in order have basic knowledge of Computer Science.

MCA NEP WEF 2024-25 4 | 57

I SEM

Semester I
Course Code CCMCA111 Credits 4
Course Name Web Development Pds Per 3
Week
Course Type Theory
MID TERM 30 ESE MARKS 70 TOTAL 100
MARKS

S. No. Course Outcomes Lev

el
CO1 Understand the fundamental concepts of web development L1
technologies including HTML, CSS, and JavaScript.
CO2 Demonstrate proficiency in creating basic web pages using L3
HTML structure, CSS styling, and JavaScript for user
interaction.
CO3 Master PHP syntax, variables, and data types, and apply them L2
effectively in web development projects.
CO4 Implement control structures, functions, and form handling L3
techniques in PHP to create dynamic and interactive web
applications.
CO5 Integrate MySQL database with PHP applications, L3
demonstrating competency in executing queries, fetching data,
and error handling.
CO6 Design and implement web forms using HTML and PHP, L3
enabling users to submit data securely to a MySQL database
and perform CRUD operations.
CO7 Utilize PHP sessions and cookies to manage user data and L3
enhance the functionality of web applications.
CO8 Develop basic websites and blogs using WordPress, L3
demonstrating proficiency in content management and theme
customization.
CO9 Implement a web application using Laravel framework, L3
covering database configuration, model-view-controller
architecture, and RESTful routing.
CO10 Apply Laravel's features such as migrations, controllers, and L3
form handling to create dynamic web applications with CRUD
operations and user authentication.

UNI CCMCA111: Web Development HR C B

T S O T
1 Overview of web development technologies: HTML, CSS, 6
JavaScript, Basic HTML structure: tags, elements,
attributes, and semantic markup, Introduction to CSS:
styling HTML elements, selectors, properties, and values,
Basics of JavaScript: variables, data types, operators,
and control structures, Handling user interactions with
JavaScript: events, DOM manipulation, and basic
validation.
2 PHP Syntax and Variables: PHP’s Syntax, Comments, 6
Variables, Types in PHP, to understand the major

MCA NEP WEF 2024-25 5 | 57

 features needed to work with php applications Php
Control Structures and Functions: Boolean Expression,
Branching, Looping and Using functions. Passing
Information with PHP: HTTP is Stateless; GET and POST
Arguments, Formatting Form Variables. String Handling:
Strings in Php, String Functions Learning Arrays: Php
Arrays, Creating arrays, Retrieving values,
multidimensional arrays, inspecting arrays, deleting
arrays Number Handing: Numerical types, Mathematical
operators, mathematical functions.
3 MySQL Database Integration and Query Processing and 6
Web Forms: Application: To understand and implement
MySql database with Php Introducing Database and
MySQL: Integrating PHP and MySQL: Connecting to
MySQL, Making MySQL Queries, Fetching Data, Multiple
connections, Building in error-checking, Creating MySQL
database with PHP, MySQL functions. Performing
Database Queries: HTML Tables and Database Tables,
Complex Mapping. Integrating Web Forms and
Databases: HTML Forms, Basic Form Submission to a
Database, Self-Submission, Editing Data with an HTML
Form
4 Advanced PHP and PHP CMS: Application: To understand 6
and implement the concept of cookies and sessions. To
create blogs and websites using WordPress Working with
Cookies and Sessions: What is a Session? How Session
works in PHP, Session Functions, Cookies. Exception with
PHP: Error Handling in PHP.
WordPress: Why WordPress? Sites Built with WordPress,
Installing and Upgrading WordPress, Dashboard and
Settings Working with Content: Post, Pages, Posts vs.
Pages, Media Files, Links, Feeds Importing Content:
Importing Blogs, Importing HTML Files, Creating a Basic
Theme.
5 PHP Framework: Application: To learn and implement 6
php framework using Laravel Laravel – What is Laravel?
Installation Quick start: Creating your first web
application: Database configuration, reating the users
table using migrations, Creating an Eloquent user model,
Routing to a closure, Creating users with Eloquent, The
users controller, Creating the users index view, Passing
data from a controller to a view, Adding our dynamic
content to the view, RESTful controllers, Creating a form
for adding users, Routing POST requests to a controller
action, Receiving form input and saving to the database,
Creating links with the HTML helper, Deleting user
records with Eloquent, Updating a user with Eloquent,
Creating the update form with the form helper.

Suggested Readings
 HTML and CSS: Design and Build Websites by Jon Duckett.

MCA NEP WEF 2024-25 6 | 57

  JavaScript and JQuery: Interactive Front-End Web Development by Jon
Duckett.
 PHP for the Web: Visual QuickStart Guide by Larry Ullman.
 Learning PHP, MySQL & JavaScript: With jQuery, CSS & HTML5 by Robin
Nixon.

Semester I
Course Code CCMCA112 Credits 4
Course Name Java & Data Structures Pds Per
Week
Course Type Theory
MID TERM 30 ESE MARKS 70 TOTAL 100
MARKS

S. Course Outcomes Lev

No. el
CO1 understand and apply basic programming using Java. L3
CO2 apply concepts of OOPs using Java. L3
CO3 understand and apply the concepts packages, exception and L3
multithreading in Java.
CO4 understand and apply the concept of a data structures- stack, L3
queue, linked list, trees, graphs etc.
CO5 design and implement data structures using Java. L6

UNI CCMCA112: Java & Data Structures HR C B

T S O T
1 History and Evolution of Java, Features of Java, Object 6
Oriented Concepts – Bytecode, Data Types – Variables,
Operators, Arithmetic Operators, Bitwise, Relational
Operators, Assignment Operator, The conditional
Operator, Operator Precedence, Control Statements –
Arrays.
2 Classes, Objects, Constructors, Overloading method, 6
Static keyword, Inner Classes, String Class, overriding
methods, super keyword, Abstract class, this keyword –
finalize () method – Garbage Collection.
3 Packages, Access Protection, Importing Packages, 6
Interfaces, Exception Handling, Throw and Throws, Java
Thread Model, creating a Thread and Multiple Threads,
Thread Priorities Synchronization, Deadlock, Suspending,
Resuming and stopping threads – Multithreading, I/O
Streams.
4 Abstract Data Types (ADTs), List ADT, Array based 6
implementation, linked list implementation, singly linked
list, doubly linked list, circular linked list, Stack ADT
operations, Applications, Evaluating arithmetic
expressions, Conversion of infix to postfix expression,
Queue ADT, operations, Applications of Queues.
5 Trees, Binary Trees, representation, Operations on 6
Binary Trees, Traversal of a Binary Tree, Binary Search
Trees, Graphs, Representation of Graphs, Traversal in

MCA NEP WEF 2024-25 7 | 57

 Graph, Depth-First vs Breadth-First Search.

Suggested Readings
 "Java: The Complete Reference" by Herbert Schildt.
 "Head First Java" by Kathy Sierra and Bert Bates.
 "Java Concurrency in Practice" by Brian Goetz et al...
 "Data Structures and Algorithms Made Easy in Java" by Narasimha
Karumanchi.
 "Java: How to Program" by Paul Deitel and Harvey.

Semester I
Course Code CCMCA113 Credits 2
Course Name Database Management System Pds Per
Week
Course Type Th/Pr/Project/Training/Seminar/ Theory
Dissertation
MID TERM 30 ESE MARKS 70 TOTAL 100
MARKS

S. Course Outcomes Lev

No. el
CO1 understand basic database concepts, including the structure L2
and operation of the relational data model.
CO2 apply logical database design principles, including ER diagrams, L3
conversion of ER diagrams to relations.
CO3 understand the concepts of integrity constraints, data L2
normalization.
CO4 construct simple and moderately advanced database queries L6
using Structured Query Language (SQL).
CO5 understand the concept of a database transaction including L2
concurrency control, backup and recovery, and data object
locking.
CO6 design and implement database projects. L6
CO7 construct program in PL/SQL for real-world scenarios like data L6
migration, batch processing, or reporting.

UNIT CCMCA113: Database Management HRS CO BT

System
1 Entity Relationship Model: Entities, attributes, 6
relationship, constraints, keys, E-R diagram,
concept of strong and weak entity sets,
generalization, specialization and aggregation.
RDBMS – Basic concept, Codd’s rule for
RDBMS. Functional dependencies and
Normalization for relational databases - design
guidelines for relational schema, functional
dependencies, normal forms (1NF, 2NF and
3NF).
2 SQL data definition and data types – create 6

MCA NEP WEF 2024-25 8 | 57

 schema, create table, attribute data types and
domains. Basic constraints in SQL – attribute
and attribute defaults, key and referential
integrity, naming, tuple constraints. Schema
change statements in SQL – DROP, ALTER.
Basic queries in SQL – select-from-where
structure, ordering of query results.
3 Complex SQL queries – comparison involving 6
NULL and three valued logic, nested queries,
tuples and set comparison, joined tables.
Aggregate functions, grouping – GROUP BY and
HAVING clause. Insert, delete and update
statements. Assertions and views.
4 PL/SQL: Basics concepts, advantages, 6
variables, constants, data types, comments,
output function, control structures –
conditional, iterative and sequential control,
database access with PL/SQL, transaction
management.
5 Cursor – basic concept, types, Procedures & 6
Functions - advantages, creation, execution,
deletion, overloading, stored procedures and
functions. Packages – creation and execution.
Triggers - use, types, creating, deleting.

Suggested Readings
 "Database Management Systems" by Raghu Ramakrishnan and Johannes
Gehrke.
 "Database Systems: Concepts, Design and Applications" by S. K. Singh.
 "Fundamentals of Database Systems" by Ramez Elmasri and Shamkant B.
Navathe.
 "SQL and Relational Theory: How to Write Accurate SQL Code" by C. J.
Date.
 "Oracle PL/SQL Programming" by Steven Feuerstein and Bill Pribyl.
 "Oracle Database 12c PL/SQL Programming" by Michael McLaughlin.

Semester I
Course Code CCMCA114 Credits 4
Course Name Artificial Intelligence Pds Per 3+1
Week
Course Type THEORY
MID TERM MARKS 30 ESE MARKS 70 TOTAL 100

S. No. Course Outcomes Lev

el
CO1 understand the importance of AI and its related fields. L2
CO2 describe the Turing Test, production systems, search problems. L4

MCA NEP WEF 2024-25 9 | 57

CO3 define problems as state space searches and apply search L1
algorithms to state space searches.
CO4 analyze logic and reasoning using predicate logic, resolution, L4
and probabilistic reasoning.
CO5 apply knowledge representation techniques like associative L3
networks, semantic nets, and frames structures.
CO6 analyze principles of natural language processing and its L4
components.
CO7 apply expert systems architecture and justify their need in real- L3
time search and perception-action tasks.
CO8 evaluate the effectiveness of neural networks in various L5
applications such as Hopfield networks and backpropagation.

UNI CCMCA114: Artificial Intelligence HR CO BT

T S
1 Introduction to AI, Importance of AI, AI and its related 6 CO L1
fields, Turing Test, Production Systems and its 1 L2
characteristics. CO L3,
Problems, problem space and search: Defining the 2 L4
problem as a state space search CO
Uninformed Search Methods: Breadth First Search 3
(BFS), Depth First Search (DFS)
2 Informed Search Methods: Greedy best first Search, A* 6 CO L3,
Search, Memory bounded heuristic Search. Local 3 L4
Search Algorithms and Optimization Problems: Hill
climbing search, Constraint Satisfaction problems
3 Predicate & Logic: Representing simple facts in Logic - 6 CO L4
Computable functions in predicates, resolution – 4
unification – forward vs. backward reasoning.,
Probabilistic reasoning – Bayes’s Theorem – Certainty
Factors– Dempster–Shafer Theory .
4 Structured Knowledge Representation: Associative 6 CO L3
Networks, Semantic Nets, Frames Structures, 5 L5
Conceptual Dependencies & Scripts, Learning – CO
Concept of Learning – Learning Automata, Learning by 6
induction. Genetic Algorithms.
Natural Language Processing: Overview of Linguistics,
Grammars and Languages.
5 Expert Systems: Architecture – Need and Justification 6 CO L3,
of Expert Systems, XCON, PROSPECTOR, Knowledge 7 L4
acquisition and validation. Perception and Action, Real CO L5
time search, perception, action, vision, robot 8
architecture, Learning in Neural Networks –
Applications – Hopfield Networks, Back propagation

MCA NEP WEF 2024-25 10 | 57

Suggested Readings
 Introduction to AI and Expert Systems - Patterson.
 Artificial Intelligence a Modern Approach- Stuart Rushell.
 Artificial Intelligence - Rich E and Knight K.
 Principles of Artificial Intelligence - Nilsson.
 Artificial Intelligence – An Engineering Approach – Schalkoff R J.
 Introduction to Expert System - Peter Jackson.
 Artificial Intelligence – Janakiraman.

Semester I
Course Code CCMCA115 Credits 4
Course Name Operating Systems Pds Per 3+1
Week
Course Type THEORY
MID TERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 understand concepts of operating system. L3
CO2 understand concepts of memory management in operating L3
system.
CO3 understand and apply the concepts of Process synchronization L3
in operating system.
CO4 understand Linux OS analyze and Linux Commands. L6
CO5 design and implement shell programming. L6

UNI CCMCA115: Operating Systems HR C B

T S O T
1 Architecture of Operating System, Objectives and 6
functions of OS, Processor, Memory and IO. OS Shell and
kernel architecture. Process, Process state, Process state
transitions, PCB, Process hierarchy, operations on a
process, multitasking. Scheduling policies.
2 Memory management, contiguous real, non- contiguous 6
real, non-contiguous virtual. Virtual memory
management system, page replacement policies: LRU,
NRU, FIFO, second chance, optimal page replacement,
Working set. Belady’s anamoly. Memory allocation
techniques: first fit, best fit, worst fit, next fit. Demand
paging. Buddy system.
3 Process synchronization, race condition, critical region. 6
Semaphores, P&V mutex routines. Inter-process
communication: the producer-consumer problem.
Classical problems: readers-writes, dining philosophers,
sleeping barber. Message passing: Inter-process
messages, mailboxes. Threads. Deadlocks: introduction,
deadlock detection and recovery, deadlock avoidance,

MCA NEP WEF 2024-25 11 | 57

 banker’s algorithm, deadlock prevention.
4 Linux Architecture, Linux file system, Kernel, Process 6
Management in Linux, Signal Handling, System call, and
System call for Files, Processes and Signals. Command
Structure, cal, date, echo, printf, bc, script, passwd,
path, who, tty, stty, pwd, cd, mkdir, rmdir. file System,
cat, cp, rm, mv, more, file, ls, wc, pg, cmp, comm, diff,
gzip, tar, zip, df, du, mount, unmount. Filtering
commands: head, tail, cut, paste, sort, grep, sed.
5 Shell Programming– Introduction to Shell, Various Shell 6
of Linux, Shell Commands, I/O Redirection and Piping, Vi
and Emacs editor. The Logical operators && and ||
conditional Execution, Shell control statements,
Variables, if-then-else, case-switch, While, Until, Find,
Shell Meta-characters, Shell Scripts, Shell keywords,
Built in Commands, Shell Procedures and Reporting,
Handling documents.

Suggested Readings
 Operating Systems: Donovan & Madnick, Mc Graw Hill.
 Modern Operating Systems, Tanenbaum, Pearson Publications.
 Linux: The Complete Reference, Sixth Edition by Richard
Petersen (Author).
 Design of the UNIX Operating System Maurice J. Bach, AT&T Bell Labs.
 Yashwant Kanetkar, Unix shell programming, (BPB).

Semester I
Course Code CCMCA116 Credits 2
Course Name Computer Networks Pds Per
Week
Course Type Theory
MID TERM 30 ESE MARKS 70 TOTAL 100
MARKS

S. Course Outcomes Lev

No. el
CO1 gain the knowledge of the basic computer network technology. L2
CO2 gain the knowledge of the functions of each layer in the OSI and L2
TCP/IP reference model.
CO3 obtain the skills of subnetting and routing mechanisms. L2
CO4 understand the essential protocols of computer networks, and L2
how they can be applied in network design and implementation.

UNI CCMCA116: Computer Networks HR C B

T S O T
1 Introduction to networks, internet, protocols and 6
standards, the OSI model, layers in OSI model, TCP/IP
suite, Addressing, Analog and digital signals.

MCA NEP WEF 2024-25 12 | 57

 2 Physical Layer: digital transmission, multiplexing, 6
transmission media, circuit switched networks,
Datagram networks, virtual circuit networks, switch and
Telephone network.
Data link layer: Introduction, Block coding, cyclic codes,
checksum, framing, flow and error control, Noiseless
channels, noisy channels, HDLC, point to point protocols
3 Medium Access sub layer: Random access, controlled 6
access, channelization, IEEE standards, Ethernet, Fast
Ethernet, Giga-Bit Ethernet, wireless LANs.
Connecting LANs, backbone networks and virtual LANs,
Wireless WANs, SONET, frame relay and ATM.
4 Network Layer: Logical addressing, internetworking, 6
tunneling, address mapping, ICMP, IGMP, forwarding,
uni-cast routing protocols, multicast routing protocols.
Transport Layer: Process to process delivery, UDP and
TCP protocols, SCTP, data traffic, congestion, congestion
control, QoS, integrated services, differentiated services,
QoS in switched networks.
5 Application Layer – Domain name space, DNS in internet, 6
electronic mail, FTP, WWW, HTTP, SNMP, multi-media,
network security

Suggested Readings
 An Engineering Approach to Computer Networks-S.Keshav,2nd
Edition,Pearson Education.
 Understanding communications and Networks,3rd Edition,
W.A.Shay,Cengage Learning.
 Computer and Communication Networks ,Nader F. Mir, Pearson Education.
 Computer Networking:A Top-Down Approach Featuring the Internet,James
F.Kurose,K.W.Ross,3rd Edition,Pearson Education.

Semester I
Course Code CCMCA121 Credits 2
Course Name Web Development Lab Pds Per
Week
Course Type Th/Pr/Project/Training/Seminar/ Practical
Dissertation
MID TERM 30 ESE MARKS 70 TOTAL 100
MARKS

Assignment Based on
 Create a basic HTML webpage with a header, navigation menu, main
content area, and footer.
 Style the webpage using CSS to achieve a visually appealing layout.

MCA NEP WEF 2024-25 13 | 57

  Ensure semantic markup and proper use of HTML tags.
 Implement a JavaScript function that validates a form before
submission.
 Use DOM manipulation to dynamically update elements on the
webpage based on user interactions.
 Handle events such as click, mouseover, and input changes.
 Implement a JavaScript function that validates a form before
submission.
 Use DOM manipulation to dynamically update elements on the
webpage based on user interactions.
 Handle events such as click, mouseover, and input changes.
 reate a PHP script that accepts user input from a form and displays it on
the webpage.
 Implement control structures such as if-else statements and loops to
perform data processing.
 Set up a MySQL database and create a table to store user information.
 Connect PHP to the MySQL database and execute queries to retrieve
and display data on the webpage.
 Implement basic error-checking mechanisms for database interactions.
 Use PHP functions to manipulate strings and arrays.
 Install Laravel framework and set up a new project.
 Create a database migration to define a table structure for user
management.
 Implement CRUD operations for managing users (Create, Read, Update,
Delete) using Laravel's Eloquent ORM.
 Set up routes, controllers, and views to handle user interactions and
data manipulation.

Semester I
Course Code CCMCA122 Credits 2
Course Name Java & Data Structures Lab Pds Per
Week
Course Type Th/Pr/Project/Training/Seminar/ Practical
Dissertation
MID TERM 30 ESE MARKS 70 TOTAL 100
MARKS

Assignment Based on
 Write a Java program to print "Hello, World!" to the console.
 Implement a program to calculate the sum of two numbers entered by
the user.
 Create a Java program to check if a given number is prime or not.
 Implement a program to find the maximum and minimum element in an
array.

MCA NEP WEF 2024-25 14 | 57

  Write a Java program to reverse a given string.
 Create a program to find the frequency of each character in a given
string.
 Implement a class representing a Bank Account with methods to
deposit, withdraw, and check balance.
 Create a class hierarchy for geometric shapes (e.g., Circle, Rectangle)
with inheritance and polymorphism.
 Write a program to demonstrate encapsulation, inheritance, and
polymorphism.
 Implement a singly linked list in Java.
 Write a program to reverse a linked list.
 Create a method to detect a loop in a linked list.
 Implement a stack using arrays and linked lists.
 Write a program to evaluate a postfix expression using a stack.
 Create a queue using two stacks.
 Implement a binary search tree and its basic operations (insertion,
deletion, search).
 Write a program to perform tree traversal (in-order, pre-order, post-
order).
 Create a method to check if a binary tree is balanced.
 Implement an adjacency matrix and adjacency list representation of a
graph.
 Write a program to perform depth-first search (DFS) and breadth-first
search (BFS) on a graph.
 Implement sorting algorithms: Bubble Sort, Selection Sort, Insertion
Sort.
 Write a program to perform binary search on a sorted array.
 Create a method to construct and traverse a tree data structure.
 Design and implement a Java application that utilizes multiple data
structures and algorithms.
 Document the project including design decisions, challenges faced, and
solutions implemented.

Present the project to the class with a demonstration.

Semester I
Course Code CCMCA123 Credits 2
Course Name Database Management System Lab Pds Per
Week
Course Type Th/Pr/Project/Training/Seminar/ Practical
Dissertation
MID TERM 30 ESE MARKS 70 TOTAL 100
MARKS

MCA NEP WEF 2024-25 15 | 57

Assignment Based on
SQL—

 Select all columns from a specific table.

 Select specific columns from a table.
 Use the WHERE clause to filter rows.
 Use ORDER BY to sort query results.
 Use LIMIT to limit the number of rows returned.
 Join two or more tables using INNER JOIN, LEFT JOIN, RIGHT JOIN, or
FULL OUTER JOIN.
 Use aliases for table names and column names.
 Aggregate functions: SUM, AVG, COUNT, MAX, MIN.
 Group rows using GROUP BY.
 Filter groups using the HAVING clause.
 Write subqueries in SELECT, WHERE, and FROM clauses.
 Subqueries with EXISTS, NOT EXISTS, IN, NOT IN.
 Insert new rows into a table.
 Update existing rows in a table.
 Delete rows from a table.
 Create tables with PRIMARY KEY, FOREIGN KEY, UNIQUE, NOT NULL
constraints.
 Add constraints to existing tables.
 Drop constraints from tables.
 Create indexes on columns.
 Use indexes to improve query performance.
 Identify slow queries and optimize them.
 Create views to simplify complex queries.
 Update, delete, and select from views.
 Start and commit transactions.
 Rollback transactions.
 Set transaction isolation levels.
 Normalize a set of tables to third normal form.
 Identify and resolve many-to-many relationships.
 Design database schemas for specific use cases.

PL/SQL --

 Write a PL/SQL block to display "Hello, PL/SQL!" using

DBMS_OUTPUT.PUT_LINE.
 Declare variables of different data types (VARCHAR2, NUMBER, DATE)
and perform basic operations on them (assignment, arithmetic
operations, concatenation).
 Write PL/SQL blocks demonstrating the use of IF-THEN-ELSE, CASE, and
LOOP statements.
 Create PL/SQL blocks with exception handling mechanisms such as
EXCEPTION, RAISE, RAISE_APPLICATION_ERROR.
 Write PL/SQL blocks using implicit and explicit cursors to fetch data
from a table and process it.
 Create a simple stored procedure to perform a specific task, such as
inserting a record into a table.
 Write PL/SQL functions to perform calculations or return specific values
based on input parameters.
 Create a package containing procedures, functions, and variables, and
demonstrate how to use them.

MCA NEP WEF 2024-25 16 | 57

  Write triggers for various database operations (INSERT, UPDATE,
DELETE) on a table.
 Explore dynamic SQL in PL/SQL, writing scripts that generate and
execute SQL statements at runtime.
 Explore more advanced topics like bulk processing (BULK COLLECT,
FORALL), object types, and fine-grained access control.
 Write PL/SQL blocks that interact with SQL statements, such as using
SELECT INTO to fetch data into variables.
 Optimize PL/SQL code for performance by analyzing execution plans,
using proper indexing, and minimizing context switches.
 Implement error logging mechanisms within PL/SQL code and use
debugging tools like DBMS_DEBUG.
 Develop PL/SQL solutions for real-world scenarios like data migration,
batch processing, or reporting.
Each assignment can be tailored to the skill level and objectives of the
learners, providing a comprehensive understanding of PL/SQL programming.

II SEM

Semester II
Course Code CCMCA211 Credits 4
Course Name Machine Learning Pds Per 3+1
Week
Course Type THEORY
MID TERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 demonstrate a comprehensive understanding of fundamental L6
machine learning concepts.
CO2 application of Performance Measures to assess the L3
effectiveness of machine learning models.
CO3 implement a variety of supervised learning algorithms or L6
solving classification and regression tasks.
CO4 utilize unsupervised learning algorithms such as K-means L3
Clustering, Hierarchical Clustering, and Self-Organizing Maps to
identify patterns and structures within unlabelled data.
CO5 development and Training of Neural Networks. L6
CO6 exploration of Advanced Machine Learning Techniques L4
understanding their significance and applications.

UNI CCMCA211: Machine Learning HR CO BT

T S
1 Introduction to Machine Learning, Types of Machine 6 CO L1,
Learning Problems, Applications of Machine Learning. 1 L2
Issues in Machine Learning and Data Science Vs CO L3,
Machine Learning. 2 L4
Performance Measures- Confusion Matrix, Accuracy,
Precision & recall, ROC Curve
Advanced Python- NumPy, Pandas Matplotlib. Python
Machine Learning Library Scikit-Learn

MCA NEP WEF 2024-25 17 | 57

 2 Supervised learning Algorithms: Linear Regression, 6 CO L3,
Logistic Regression. Decision Trees, Tree pruning, 3 L4
Rule-base Classification, Naïve Bayes, Bayesian
Network. Support Vector Machines, k-Nearest
Neighbour
3 Unsupervised learning algorithms: Introduction to 6 CO L3,
Clustering, K-means Clustering, Hierarchical 4 L5
Clustering Implementation of Unsupervised
algorithms. Feature selection and Dimensionality
reduction, Principal Component Analysis.
4 Introduction to Artificial Neural Networks (ANNs) 6 CO L4,
Basic structure and functioning of neurons, Perceptron 5 L5
model, Introduction to multilayer perceptrons (MLPs),
Architecture of MLPs
Training Neural Networks: Gradient Descent
optimization, Backpropagation algorithm
Applications of Neural Networks.
5 Ensemble Learning: Introduction to ensemble 6 CO L4,
methods: Bagging, Boosting,Random Forest algorithm 6 L5,
Reinforcement Learning: Basics of reinforcement L6
learning (RL), Exploration vs. exploitation trade-off
Recent advancements in machine learning, Emerging
techniques and applications.

Suggested Readings
 Geron Aurelien, “Hands-On Machine Learning with Scikit-Learn &
TensorFlow”, O’REILLY, First Edition, 2017.
 U Dinesh Kumar and Manaranjan Pradhan, “Machine Learning using
Python", Wiley, 2019.
 Fausett Laurence, “Fundamentals of Neural Networks”, Pearson, Ninth
Edition, 2012.

Semester II
Course Code CCMCA212 Credits 4
Course Name Full Stack Development Pds Per 3+1
Week
Course Type THEORY
MID TERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 recall the fundamental concepts of Frontend Development, L1
including HTML, CSS, JavaScript, Ajax, jQuery, JSON, and
Bootstrap.
CO2 understanding of ReactJS principles, including React L2
Components, Component Composition, Inter-component
Communication, and Data Passing between Components.
CO3 apply their knowledge of ReactJS to build single-page L3
applications with routing, manage component states using

MCA NEP WEF 2024-25 18 | 57

 React Hooks, integrate Redux for state management, and
deploy ReactJS applications.
CO4 analyze and compare different frontend technologies, such as L4
traditional component states versus React Hooks, and assess
the advantages of using Redux for state management in React
applications.
CO5 evaluate the effectiveness of using React Bootstrap for L5
enhancing UI design in ReactJS applications and assess the
benefits of using Node.js for building web applications with
Express.js.
CO6 create and implement solutions using MongoDB databases, L6
including data migration, working with MongoDB in PHP, and
integrating MongoDB with Node.js applications.

UNI CCMCA212: Full Stack Development HR CO BT

T S
1 Frontend Fundamentals: HTML and HTML5, CSS and 6 CO L1,
CSS3, Java Script Fundamentals and ES6, 1 L2
Asynchronous JavaScript (Ajax) and jQuery, JSON CO L3,
(JavaScript Object Notation), Responsive Web Design 2 L4
with Bootstrap.
2 ReactJS: Understanding ReactJS library and directory 6 CO L3,
structure, React Components, Types of Components, 3 L4
building a simple React component, Component
composition, Component styling with CSS, Inter-
component communication, Passing data between
components.
3 Advanced ReactJS: Routing in ReactJS applications. 6 CO L3,
Creating single-page applications with routing, 4 L5
Introduction to React Hooks, managing component
states with Hooks, Comparing Hooks with traditional
component states, Redux for state management in
React apps, Integrating Redux as a state container,
Enhancing UI with React Bootstrap, Deployment of
ReactJS applications.
4 Node.js: Overview of Node.js, Basics of Node.js and 6 CO L4,
setup, working with the Node.js console, using 5 L5
command-line utilities with Node.js, Understanding
Node.js modules, Event-driven architecture in Node.js,
Building web applications with Express.js, Accessing
databases with Node.js.
5 Database Management and Version Control: Concepts 6 CO L4,
of SQL and NoSQL databases, Creating and managing 6 L5,
MongoDB databases, Data migration into MongoDB, L6
working with MongoDB in PHP, Integrating MongoDB
with Node.js applications, Services offered by
MongoDB, Introduction to version control with Git,
Overview of Agile and Scrum methodologies.

Suggested Readings

MCA NEP WEF 2024-25 19 | 57

  "JavaScript and JQuery: Interactive Front-End Web Development" by Jon
Duckett.
 "Responsive Web Design with HTML5 and CSS3" by Ben Frain.
 "Learning Web Design: A Beginner's Guide to HTML, CSS, JavaScript, and
Web Graphics" by Jennifer Robbins.
 "React Up and Running: Building Web Applications" by Stoyan Stefanov
and Artemij Fedosejev.
 "React Router Quick Start Guide: Routing in React Applications" by Sven A.
Robbestad
 "React Hooks in Action" by John Larsen.
 "Node.js Web Development" by David Herron.
 "MongoDB: The Definitive Guide" by Shannon Bradshaw, Kristina
Chodorow, and Michael Dirolf

Semester II
Course Code CCMCA213 Credits 4
Course Name MongoDB Pds Per 3+1
Week
Course Type THEORY
MID TERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 understand basic concepts of NoSQL AND MongoDB, including L2
the architecture.
CO2 apply Database Commands in MongoDB. L3
CO3 understand the concepts of aggregation and pipeline L2
operations.
CO4 design and implement database operations. L6
CO5 design and implement replication. L6

UNI CCMCA213: MongoDB HR CO BT

T S
1 Introduction to database, Need of a database, 6 CO L1,
Different types of databases, Relational vs. Non- 1 L2
relational database, Introduction to NoSQL databases, CO L3,
Introduction to NoSQL Databases, NoSQL features, 2 L4
Different types of NoSQL, National Institute of
Electronics and Information Technology MongoDB,
databases, Introduction to MongoDB, MongoDB
architecture.
2 MongoDB- Data modelling in MongoDB, Advantages of 6 CO L3,
MongoDB over RDBMS, Mongo Shell, Configuration file 3 L4
in MongoDB, Documents and collections, JSON File
format for storing documents, Introduction to
Documents, Collections, Database Commands in
MongoDB, Inserting and Saving Documents, Inserting
multiple documents.
3 CRUD operation, Updating Documents, Removing 6 CO L3,

MCA NEP WEF 2024-25 20 | 57

 Documents, Document Replacement, Operator and 4 L5
Modifiers, Indexing, indexing in MongoDB, Single
index, Finding index, Multikey index, Aggregation,
Aggregation Framework.
4 Pipeline Operations- $match, $sort, $group, $project, 6 CO L4,
$unwind, $limit, $skip, MapReduce, Aggregation 5 L5
commands, Database operations, Backup and restore,
Export and import of data, Importing from JSON file.
5 Replication- Advantages of replication, Implementation 6 CO L4,
of replication, Managing Configuration File in 6 L5,
MongoDB, setting up replica set in MongoDB, L6
Database features, Choosing the right database,
Database era, Taking decisions on database, Strengths
and weakness of database, Free and open-source
database.

Suggested Readings
 "Database Management Systems" by Raghu Ramakrishnan and Johannes
Gehrke.
 "MongoDB: The Definitive Guide" by Shannon Bradshaw, Kristina
Chodorow, and Michael Dirolf.
 "NoSQL Distilled: A Brief Guide to the Emerging World of Polyglot
Persistence" by Martin Fowler and Pramod J. Sadalage.
 "Learning MongoDB: Schema Design and Query Optimization" by Alok
Ranjan.
 "MongoDB in Action" by Kyle Banker.
 "NoSQL for Dummies" by Adam Fowler.
 "Database System Concepts" by Abraham Silberschatz, Henry F. Korth,
and S. Sudarshan.
 "MongoDB Applied Design Patterns: Practical Use Cases with the Leading
NoSQL Database" by Rick Copeland.
 "Practical MongoDB: Architecting, Developing, and Administering
MongoDB" by Shakuntala Gupta Edward and Navin Sabharwal.

Semester II
Course Code CCMCA214 Credits 4
Course Name Cloud Computing Pds Per 3+1
Week
Course Type THEORY
MID TERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 understand basic concepts, principles and paradigm of Cloud L2
Computing.
CO2 interpret various Cloud computing models and services. L4
CO3 identify the significance of implementing cloud file system and L4
cloud data stores.
CO4 understand the need of MapReduce model. L2
CO5 understand the concept SOA and ERP, SCM, CRM. L2

MCA NEP WEF 2024-25 21 | 57

 UNI CCMCA214: Cloud Computing HR C B
T S O T
1 Enterprise computing: a retrospective – Introduction, 6
Mainframe architecture, Client-server architecture, 3-tier
architectures with TPmonitors, The internet as a
platform - Internet technology and web-enabled
applications, Web application servers, Internet of
services. Software as a service - Emergence of software
as a service architectures and cloud computing,
Successful SaaS architecture.
2 Enterprise architecture: role and evolution - Enterprise 6
data and processes, Enterprise components, Application
integration and SOA, Enterprise technical architecture,
Data center infrastructure: coping with complexity.
Cloud computing platforms - Infrastructure as a service:
Amazon EC2, Platform as a service: Google App Engine,
Microsoft Azure.
3 Cloud file systems: GFS and HDFS, BigTable, HBase and 6
Dynamo, Cloud data stores: Datastore and SimpleDB.
MapReduce and extensions - Parallel computing, The
MapReduce model, Parallel efficiency of MapReduce,
Relational operations using MapReduce, Enterprise batch
processing using MapReduce.
4 Enterprise software: ERP, SCM, CRM - Anatomy of a large 6
enterprise, Partners: people and organizations, Products,
Orders: sales and purchases, Execution: tracking work,
Billing, Accounting, Enterprise processes, build vs. buy
and SaaS.
5 Enterprise cloud computing ecosystem - Public cloud 6
providers, Cloud management platforms and tools, Tools
for building private clouds. Roadmap for enterprise cloud
computing - Quick wins using public clouds, Future of
enterprise cloud computing.

Suggested Readings
Enterprise Cloud Computing Technology, Architecture, Applications by
Gautam Shroff, Cambridge University Press.
 "Enterprise Integration Patterns: Designing, Building, and Deploying Messaging
Solutions" by Gregor Hohpe and Bobby Woolf.
 "Modern Operating Systems" by Andrew S. Tanenbaum and Herbert Bos.
 "Cloud Computing: Concepts, Technology & Architecture" by Thomas Erl, Ricardo
Puttini, and Zaigham Mahmood.
 "Big Data: Principles and Best Practices of Scalable Realtime Data Systems" by Nathan
Marz and James Warren.
 "Enterprise Resource Planning" by Alexis Leon.

Semester II
Course Code CCMCA215 Credits 4
Course Name Software Engineering Pds Per Week 3+1

MCA NEP WEF 2024-25 22 | 57

Course Type THEORY
MID TERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 understand the various aspects of software problems including L2
cost, schedule, quality, scale, and change, and their
implications on software development.
CO2 Applying software processes, project management, component L3
software processes, software development process models, and
project management processes.
CO3 understand the value of a good Software Requirements L2
Specification (SRS), requirement processes, requirements
specification techniques, functional specification with use cases,
and other approaches for analysis and validation.
CO4 understand the role of software architecture, architecture L2
views, component and connector views, architecture styles for
component and connector views, documenting architecture
design, and evaluating architectures.
CO5 learn to plan a software project including effort estimation, L6
project schedule and staffing, quality planning, risk
management, project monitoring planning, and detailed
scheduling.
CO6 Analyzing coding and unit testing principles, programming L4
guidelines, incrementally developing code, managing and
evolving code, unit testing, code inspection, and metrics. They
will also be introduced to UML (Unified Modeling Language).

UNI CCMCA215: Software Engineering HR C B

T S O T
1 Software Problem - Cost, Schedule and Quality, Scale 6
and Change. Software Processes -Process and
Project, Component Software Processes, Software
Development Process Models, Project Management
Process.
2 Software Requirements Analysis and Specification - 6
Value of a Good SRS, Requirement Process,
Requirements Specification, functional Specification with
Use Cases, And Other Approaches for Analysis,
Validation. Software Architecture - Role of Software
Architecture, Architecture Views, Component and
Connector View, Architecture Styles for C&C View,
Documenting Architecture Design, Evaluating
Architectures.
3 Planning a Software Project - Effort Estimation, Project 6
Schedule and Staffing, Quality Planning, Risk
Management, Planning, Project Monitoring Plan, Detailed
Scheduling., Design - Design Concepts, Function-
Oriented Design, Object-Oriented Design, Detailed
Design, Verification, Metrics.
4 Coding and Unit Testing - Programming Principles and 6
Guidelines, Incrementally Developing Code, Managing,

MCA NEP WEF 2024-25 23 | 57

 Evolving Code, Unit Testing, Code Inspection, Metrics.
Testing - Testing Concepts, Testing Process, Black-Box
Testing, White-Box Testing, Metrics.
5 Introduction to UML, Development Process, Class 6
Diagrams, Sequence Diagrams, Object Diagrams,
Package Diagrams, Deployment Diagrams, Use Cases,
State Machine Diagrams, Activity Diagrams,
Communication Diagrams, Composite Structures,
Component Diagrams, Collaborations, Interaction
Overview Diagrams, Timing Diagrams.

Suggested Readings
 Pankaj Jalote's Software Engineering: A Precise Approach, By Pankaj
Jalote
 Software Engineering: A Practitioner's Approach by Roger S. Pressman.
 Software Engineering: Theory and Practice by Shari Lawrence Pfleeger and Joanne M.
Atlee.
 Software Engineering: A Concise Study by Pankaj Jalote
 Software Engineering: Principles and Practice by Hans van Vliet.
 Software Engineering: Concepts and Practices by U.A. Bakshi, A.V. Bakshi.
 Software Engineering by Ian Sommerville.
 UML Distilled Third Edition, A Brief Guide to the Standard Object
Modeling Language, by Martin Fowler, Addison Wesley.

MCA NEP WEF 2024-25 24 | 57

Semester II
Course Code CCMCA216 Credits 4
Course Name Intellectual Property Rights Pds Per 3
Week
Course Type THEORY
MID TERM 30 ESE 70 TOTAL 10
MARKS MARKS 0

S. Course Outcomes Lev

No. el
CO1 students once completed their academic projects; they get L3
awareness of acquiring the patent.
CO2 learn to have copyright for their innovative works. L6
CO3 get the knowledge of plagiarism in their innovations which can L2
be questioned legally.

UNI CCMCA216: Intellectual Property Rights HR C B

T S O T
1 Introduction To IPR: Meaning of property, Origin, Nature, 6
Meaning of Intellectual Property Rights,
Introduction to TRIPS and WTO. Kinds of Intellectual
property rights, Copy Right, Patent, Trade Mark, Trade
Secret and trade dress, Design, Layout Design,
Geographical Indication, Plant Varieties and Traditional
Knowledge.
2 Patent Rights and Copy Rights— Origin, Meaning of 6
Patent, Types, Inventions which are not patentable,
Registration Procedure, Rights and Duties of Patentee,
Assignment and licence, Restoration of lapsed Patents,
Surrender and Revocation of Patents, Infringement,
Remedies & Penalties. –COPY RIGHT—Origin, Definition
&Types of Copy Right, Registration procedure,
Assignment & licence, Terms of Copy Right, Piracy,
Infringement, Remedies, Copy rights with special
reference to software.
3 Trade Marks - Origin, Meaning & Nature of Trade Marks, 6
Types, Registration of Trade Marks, Infringement &
Remedies, Offences relating to Trade Marks, Passing Off,
Penalties. Domain Names on cyber space.
4 Design- Meaning, Definition, Object, Registration of 6
Design, Cancellation of Registration, International
convention on design, functions of Design.
Semiconductor Integrated circuits and layout design Act-
2000.
5 Basic Tenants of Information Technology Act-2000 – IT 6
Act - Introduction E-Commerce and legal provisions E-
Governance and legal provisions Digital signature and
Electronic Signature. Cybercrimes.

Suggested Readings

MCA NEP WEF 2024-25 25 | 57

  "Intellectual Property Rights: Text and Cases" by V.K. Ahuja.
 "Intellectual Property Law" by P. Narayanan.
 "Intellectual Property Rights: A Practical Guide for Engineers and Scientists" by Dale L.
Carlson and Charles C. Kacmar.
 "Intellectual Property Rights: Text and Essential Cases" by Sudhir Ravindran
 "International Intellectual Property: A Handbook of Contemporary Research" edited by
Daniel J. Gervais.
 "Information Technology Law" by Ian J. Lloyd.

Semester II
Course Code CCMCA221 Credits 2
Course Name MACHINE LEARNING IN PYTHON LAB Pds Per 3
Week
Course Type PRACTICAL
MID TERM 30 ESE 70 TOTAL 100
MARKS MARKS

Assignments based on
 Data Preparation:
o Choose a dataset from a public repository (e.g., UCI Machine Learning Repository,
Kaggle).
o Load the dataset using Pandas.
o Preprocess the data (handle missing values, encode categorical variables if any).
 Exploratory Data Analysis (EDA):
o Perform basic exploratory data analysis using Matplotlib and Seaborn to gain
insights into the dataset.
o Visualize the distribution of features, correlation between features, etc.
 Supervised Learning:
o Implement linear regression and logistic regression algorithms using NumPy.
o Train the models on a subset of the dataset.
o Evaluate the models using performance measures such as confusion matrix,
accuracy, precision, recall, and ROC curve.
 Decision Trees and Ensemble Learning:
o Implement a decision tree classifier using the scikit-learn library.
o Perform tree pruning and visualize the decision tree.
o Implement a random forest classifier and compare its performance with the
decision tree.
 Support Vector Machines (SVM) and k-Nearest Neighbors (k-NN):
o Implement SVM and k-NN algorithms using scikit-learn.
o Train the models on the dataset and evaluate their performance.
 Unsupervised Learning:
o Implement K-means clustering and hierarchical clustering algorithms using scikit-
learn.
o Visualize the clusters and analyze their characteristics.
o Implement feature selection and dimensionality reduction techniques such as
Principal Component Analysis (PCA).
 Neural Networks:
o Implement a basic perceptron model using NumPy.
o Implement a multilayer perceptron (MLP) using TensorFlow or Keras.
o Train the neural network models on the dataset and evaluate their performance.

MCA NEP WEF 2024-25 26 | 57

  Reinforcement Learning:
o Implement a basic reinforcement learning algorithm (e.g., Q-learning) for a simple
environment (e.g., grid world).
o Experiment with exploration-exploitation strategies and analyze their impact on
learning.
 Project:
o Choose a real-world application of machine learning (e.g., image classification,
sentiment analysis).
o Apply appropriate machine learning algorithms to solve the problem.
o Perform model evaluation and fine-tuning to improve performance.

Semester II
Course Code CCMCA222 Credits 2
Course Name Full Stack Development Lab Pds Per 3
Week
Course Type PRACTICAL
MID TERM 30 ESE MARKS 70 TOTAL 100
MARKS

Assignments based on
 Create a basic HTML webpage with appropriate structure and semantic
elements.
 Style the webpage using CSS3 to achieve a visually appealing layout and
design.
 JavaScript Fundamentals and ES6
 Develop JavaScript functions to perform basic arithmetic operations and
manipulate DOM elements.
 Implement ES6 features like arrow functions, template literals, and
destructuring in JavaScript code.
 Asynchronous JavaScript (Ajax) and jQuery
 Use Ajax to fetch data from an external API and dynamically update
webpage content.
 Enhance interactivity and responsiveness using jQuery for DOM
manipulation and event handling.
 Responsive Web Design with Bootstrap
 Create a responsive website layout using Bootstrap grid system and
components.
 Implement Bootstrap utilities and responsive classes to ensure compatibility
across various devices and screen sizes.
 ReactJS: Understanding ReactJS library
 Set up a React project and understand the directory structure of a React
application.
 Create functional and class components in React, exploring different types
of components.
 Advanced ReactJS: React Hooks and Redux
 Implement React Router for client-side routing in a React application.
 Use React Hooks to manage component states and compare them with
traditional state management approaches.
 Integrate Redux as a state container for scalable state management in
React applications.

MCA NEP WEF 2024-25 27 | 57

 Node.js Basics and Express.js
 Install Node.js and set up a basic Node.js project.
 Build a web server using Express.js and handle HTTP requests and
responses.
 Working with Databases: MongoDB and Node.js Integration
 Create and manage MongoDB databases, perform data migration, and
interact with MongoDB using the Node.js driver.
 Integrate MongoDB with a Node.js application to store and retrieve data.
 Version Control with Git and Agile Methodologies.
 Initialize a Git repository, commit changes, and push to a remote repository.
 Explore Agile and Scrum methodologies, create user stories, and plan
sprints for project development.

Semester II
Course Code CCMCA223 Credits 2
Course Name MongoDB LAB Pds Per Week 4
Course Type PRACTICAL
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

Assignments based on
 Assignment 1
 Downloading and Installation of MongoDB
 Setting path in environment variable
 Assignment 2
 Identify MongoDB environment
 Using Mongo Shell
 Configuration file in MongoDB
 Assignment 3
 Creating database employee
 Create collections emp_personal_details with
emp_id,emp_name,emp_address,emp_DOB,emp_age,emp_mobile
nu mber
 Create another collection emp_professional_details with
emp_id,emp_name, designation ,salary ,incentive, working hours
 Assignment 4
 Insert 10 records in collection emp_personal_details and
emp_professional_details
 Show all the employees having designation manager
 Show all the employees having salary 6000
 Assignment 5
 Update the collection emp_personal_details , add field status and
set it to retired where age is greater than 60 .
 Update collection emp_professional_details, give incentive 5000
to employees whose working hours is greater than 45 per week.
 Add 1000 to salary employee whose designation is accountant.
 Assignment 6

MCA NEP WEF 2024-25 28 | 57

  Create index on emp_id in collection emp_professional_details.
 Create multiple index on emp_id,emp_name in collection
emp_professonal details.
 Assignment 7
 Find sum of salaries of employee having designation clerk.
 Filter the employees having designation software engineer and
find the minimum salary.
 Assignment 8
 Use unwind command and show the employees whose mobile
number is stored in array.
 Use skip command to skip first 3 records and display rest of
records.
 Use limit command to show only first four records of collection.
 Assignment 9
 create backup of collections emp_personal_details and
emp_professional_Details.
 Delete some record and then restore it from backup.
 Export the collection in csv and json format.
 Delete some records and import the collections.
 Assignment 10
 Create replica set of employee database and insert records in
primary node and display the same records in secondary node.

Semester III
Course CCMCA311 Credits 2
Code
Course Data Science Pds Per
Name Week
Course Type Th/Pr/Project/Training/Seminar/Dissertation Theory
MID TERM 30 ESE 70 TOTAL 10
MARKS MARKS 0

S. Course Outcomes Level

No.
CO1 use of EDA, inference and regression techniques. L3
CO2 use of Matrix decomposition techniques to perform data L3
analysis.
CO3 apply data pre-processing techniques. L3
CO4 apply Basic Machine Learning Algorithms. L3
CO5 acquire data through web-scraping and data APIs. L6

UNI CCMCA311: Data Science HR C B

T S O T
1 Introduction and importance of data science. Big Data 6
Analytics, Business intelligence vs Big data, big data
frameworks, Current landscape of analytics, Exploratory
Data Analysis (EDA), statistical measures, Basic tools

MCA NEP WEF 2024-25 29 | 57

 (plots, graphs and summary statistics) of EDA, Data
Analytics Lifecycle, Discovery, Data Visualization
Principles of Data Visualization.
2 Introduction to Hypothesis Testing, Central Limit 6
Theorem, A/B testing. Identifying Potential Data Sources,
EDA case study, testing hypotheses on means,
proportions and variances Introduction to simple linear
regression, multiple linear regression, least squares
principle, exploratory vs. inferential viewpoints, Model
generalizability, cross validation, and using categorical
variables in regression, logistic regression, Multiple
correlation, Partial correlation.
3 Matrices to represent relations between data, Linear 6
algebraic operations on matrices – Matrix
decomposition: Singular Value Decomposition (SVD) and
Principal Component Analysis (PCA).
4 Data cleaning - Data integration - Data Reduction - Data 6
Transformation and Data Discretization, Feature
Generation and Feature Selection, Feature Selection
algorithms: Filters- Wrappers - Decision Trees - Random
Forests.
5 Classifiers - Decision tree - Naive Bayes - k-Nearest 6
Neighbours (k-NN), k-means – SVM Association Rule
mining – Ensemble methods Web scraping and data
acquisition via APIs - Scrape HTML websites with
Beautiful Soup. Data Cleanup with Pandas. Connect to
APIs such as Twitter, Reddit. JSON, REST.

Suggested Readings:

 "Data Science for Business" by Foster Provost and Tom Fawcett.

 "Python for Data Analysis" by Wes McKinney.
 "An Introduction to Statistical Learning" by Gareth James, Daniela Witten, Trevor Hastie, and
Robert Tibshirani.
 "Pattern Recognition and Machine Learning" by Christopher M. Bishop.
 "Introduction to Linear Algebra" by Gilbert Strang.
 "Mining of Massive Datasets" by Jure Leskovec, Anand Rajaraman, and Jeffrey D. Ullman.
 "Python Machine Learning" by Sebastian Raschka and Vahid Mirjalili.
 "Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow" by Aurélien Géron.

Semester III
Course Code CCMCA312 Credits 2
Course Name Advanced Java Pds Per 3
Week
Course Type Th/Pr/Project/Training/Seminar/ Theory
Dissertation
MID TERM 30 ESE MARKS 70 TOTAL 100
MARKS

MCA NEP WEF 2024-25 30 | 57

S. Course Outcomes Lev
No. el
CO1 Grasp the fundamental concepts of Java Enterprise and J2EE L1
Technologies, including client-server and web server technology,
and the movement to server-side Java.
CO2 acquire a comprehensive understanding of Java Servlets, L2
including their definition, practical applications, alternatives,
architecture, and reasons for use.
CO3 Learners will delve into JDBC (Java Database Connectivity) L1
technologies, understanding JDBC drivers, design considerations,
and multi-tier architecture.
CO4 Learners will delve into JDBC (Java Database Connectivity) L1
technologies, understanding JDBC drivers, design considerations,
and multi-tier architecture.
CO5 Gain insight into servlet lifecycle, including static and dynamic L3
content, lifecycle methods, request and response models,
deployment, state transitions, configuration, redirection,
dispatch, synchronization, and threading.
CO6 Learn techniques for reading and writing data from clients using L3
Servlets, as well as maintaining client state through cookies, URL
rewriting, hidden form fields, and session tracking.

UNI CCMCA312: Advanced Java HR C B

T S O T
1 Introduction to Java Enterprise, J2EE Technologies, client 6
server technology, web server technology. Movement to
Server-Side Java. Definition of a Java Servlet. Practical.
Applications for Java Servlets. Java Servlet Alternatives.
Reasons to Use Java Servlets. The Java Servlet
Architecture. JNDI, Web Applications in J2EE.
2 JDBC – JDBC Drivers, Products, JDBC Design 6
considerations, Two Tier and Three Tier client server
model, J2EE multi-tier architecture, Introduction to Data
Source and Connection pooling. JavaMail and Internet E-
mail. Preparing to Use JavaMail. A JavaMail Example.
Using JavaMail in a Servlet.
3 Servlets - Static and Dynamic contents, Servlet life Cycle 6
and Life cycle methods, Servlet Request and Response
Model, Deploying a Servlet, Servlet State Transitions,
ServletConfig and ServletContext, Servlet Redirection
and Request Dispatch, Servlet Synchronization and
Thread Model.
4 Reading and writing data from client using Servlets, 6
Maintaining Client State - Cookies, URL rewriting, hidden
form fields, Session Tracking. Inter servlet
communications –JDBC connection pool, servlet security
and different packages of servlets.
5 JSP fundamentals, JSP architecture, lifecycle of a JSP, 6
Model View Controller (MVC) architecture, JSP tags and
JSP expressions, data sharing among servlets & JSP. JSP
implicit objects, request application, session and page
scope, JSP standard actions, JSP errors.

MCA NEP WEF 2024-25 31 | 57

Suggested Readings
 "Head First Servlets and JSP: Passing the Sun Certified Web Component
Developer Exam" by Bryan Basham, Kathy Sierra, and Bert Bates.
 "Java Enterprise Edition (Java EE) for Beginners" by Kishori Sharan.
 "Professional Java Server Programming: J2EE 1.3 Edition" by Andrew
Harbourne-Thomas, Sing Li, and Wrox Developer.
 "Java Servlet Programming" by Jason Hunter and William Crawford.
 "Core Servlets and JavaServer Pages" by Marty Hall and Larry Brown.
 "Java Database Best Practices" by George Reese.

Semester III
Course Code CCMCA313 Credits 2
Course Name Information Security Pds Per 3
Week
Course Type Th/Pr/Project/Training/Seminar/ Theory
Dissertation
MID TERM 30 ESE MARKS 70 TOTAL 100
MARKS

S. Course Outcomes Level

No.
CO1 understand basic concepts, principles and paradigm of L2
Information security.
CO2 understand and implement of Information security L2
management system in organizations.
CO3 analysis and implementation of physical security for L4, L6
information systems.
CO4 design and implementation of cryptographic systems, VPN L6
and network security.
CO5 understand the concept cyber-crime, IT law, IPR, Piracy and L2
Plagiarism.

UNI CCMCA313: Information Security HR C B

T S O T
1 History of Information Systems and its Importance, 6
Nature of Information Systems, Need of Distributed
Information Systems, Role of Internet and Web Services,
Information System Threats and attacks, Classification of
Threats and Assessing Damages.
2 Information security management (ISM) in organizations, 6
Security policy, standards, guidelines and procedures,
Information security management system (ISMS). Basic
Principles of Information Security, Confidentiality,
Integrity Availability and other terms in Information
Security, Information Classification and their Roles.
3 Overview of physical security for Information Systems- 6
Needs, Disaster and Controls, Basic Tenets of Physical
Security and Physical Entry Controls, Perimeter security
for physical protection, Biometrics controls for security-

MCA NEP WEF 2024-25 32 | 57

 Factors in Biometrics Systems, Benefits, Criteria for
selection of biometrics, Design Issues in Biometric
Systems, Interoperability Issues.
4 Model of Cryptographic Systems, System of Keys, Public 6
Key Cryptography, Digital Signature, Requirement of
Digital Signature System, Finger Prints, Firewalls,
Network Security- Basic Concepts, Dimensions,
Perimeter for Network Protection, Network Attacks, Need
of Intrusion Monitoring and Detection, Intrusion
Detection Virtual Private Networks- Need, Use of
Tunnelling with VPN, Authentication Mechanisms, Types
of VPNs and their Usage, Security Concerns in VPN.
5 Cyber Crime, Information Security and Law, Types & 6
overview of Cyber Crimes, Overview of Indian IT Act,
Understanding Ethical hacking. Understanding
Intellectual property rights, Copy Right, Patents,
Trademark, Trade Secret, Trade Name and Trademark,
Domain Name. Software Piracy, Plagiarism.

Suggested Readings
 Information Systems: A Manager's Guide to Harnessing Technology by
John Gallaugher.
 Information Systems: A Foundation for Business and Beyond by David T.
Bourgeois.
 Information Systems Security: by Nina S. Godbole.
 Cryptography and Network Security: Principles and Practice by William
Stallings.

Semester III
Course Code CCMCA314 Credits 3
Course Name Analysis and Design of Pds Per Week 3
Algorithms
Course Type THEORY
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 Analyze asymptotic and absolute runtime and memory demands L4
of algorithms.
CO3 apply advanced data structures like Red-Black Trees, B-Trees, L3
and Binomial Heaps to solve problems efficiently.
CO4 understand the mathematical criterion for deciding whether an L2
algorithm is efficient, and know many practically important
problems that do not admit any efficient algorithms.
CO5 apply classical sorting, searching, optimization and graph L3
algorithms.
CO6 evaluate basic techniques for designing algorithms, including the L5
techniques of recursion, divide-and-conquer, dynamic, greedy,

MCA NEP WEF 2024-25 33 | 57

 backtracking, branch and bound.

UNI CCMCA314: Analysis and Design of Algorithms HR CO BT

T S
1 Introduction: Algorithms, Analyzing Algorithms, 6 CO L1,
Complexity of Algorithms, Growth of Functions, 1 L4
Performance Measurements, Recurrences. CO L2,
Sorting: Quick Sort, Merge Sort, Heap Sort, Comparison 4 L5
of Sorting Algorithms.
2 Advanced Data Structures: Red-Black Trees, B – Trees, 6 CO L3
Binomial Heaps, Fibonacci Heaps, Tries, Skip List 3
3 Divide and Conquer with Examples Such as Sorting, 6 CO L1,
Matrix Multiplication and Searching. Greedy Methods 2 L3
with Examples Such as Knapsack, Minimum Spanning CO L2,
Trees – Prim’s and Kruskal’s Algorithms, Single Source 4 L5
Shortest Paths - Dijkstra’s Algorithm. CO L3,
6 L4
4 Dynamic Programming with Examples Such as 6 CO L3,
Knapsack. All Pair Shortest Paths – Warshal’s and 2 L6
Floyd’s Algorithms. Backtracking, Branch and Bound CO L3
with Examples Such as Travelling Salesman Problem, 5 L3,
Graph Coloring, n-Queen Problem, Hamiltonian Cycles CO L4
and Sum of Subsets. 6
5 String Matching algorithms: Naive, Rabin Karp, Knuth 6 CO L2,
Morris Pratt, String matching with finite automata, 4 L5
Theory of NP Completeness.

MCA NEP WEF 2024-25 34 | 57

Suggested Readings
 Anany Levitin “Introduction to the Design and Analysis of Algorithms”
Pearson Education.
 E. Horowitz, S. Sahni and Dinesh Mehta, “Fundamentals of Data
structures”, University Press.
 E. Horowitz, S. Sahni and S. Rajasekaran, “Computer Algorithms”, Second
Edition, University Press.
 Gilles Brassard, “Fundamentals of Algorithms”, Pearson Education.
 Harsh Bhasin, “Algorithms Design and Analysis”, Oxford University Press.

Semester III
Course Code CEMCA315 Credits 3
Course Name Advanced Computer Networks Pds Per Week 3
Course Type THEORY - ELECTIVE
1
MIDTERM 30 ESE 70 TOTAL 10
MARKS MARKS 0

S. Course Outcomes Lev

No. el
CO1 classify traditional networks and discuss various wireless L4
networking standards, compare and contrast various IEEE
wireless LAN and Ethernet standards
CO2 describe cellular architecture and IPv4 and IPv6 header formats L2
has to be discussed along with mobile IP.
CO3 deploy high performance computing standards, VPN and routing L6
protocols.
CO4 get familiar with various security and privacy standards/tools. L2

UNI CEMCA315: Advanced Computer Networks HR C B

T S O T
1 MAC Protocols for high speed and wireless networks - 6
IEEE 802.3 standards for fast Ethernet, gigabit Ethernet,
10G, and 100VG-AnyLAN, IEEE 802.11, 802.15, and
802.16 standards for Wireless PAN, LAN, and MAN
2 IPv6: IPv4 versus IPv6, basic protocol, Header-extensions 6
and options, support for QoS, security, etc., neighbour
discovery, auto-configuration, DHCPv6, IPv6 Routers and
Routing. Mobility in networks – Mobility Management:
Cellular architecture, Mobility: handoff, types of
handoffs; location management, HLR-VLR scheme,
Mobile IP and IPv6.
3 IP Multicasting. Multicast routing protocols, address 6
assignments, session discovery, etc. IPsec protected
channel service, virtual private network service,
multiprotocol label switching, MPLS VPN
4 Traffic Types, TCP extensions for high-speed networks, 6
transaction-oriented applications. Other improvements
in TCP, Performance issues, TCP Congestion Control –

MCA NEP WEF 2024-25 35 | 57

 fairness, scheduling and Delay modeling, QoS issues,
differentiated services.
5 Network security at various layers. Security related 6
issues in mobility. Secure-HTTP, SSL, Message digests,
Key distribution protocols. Digital signatures and digital
certificates.

Suggested Readings
 W. Stallings. Cryptography and Network Security: Principles and Practice,
2nd Edition, Prentice Hall.
 C. E. Perkins, B. Woolf, and S. R. Alpert Mobile IP: Design Principles and
Practices, Addison Wesley.
 J.F. Kurose and K.W. Ross, Computer Networking – A Top-down Approach
Featuring the Internet, Pearson Education, New Delhi.

Semester III
Course Code CEMCA315 Credits 3
Course Name Big Data Analytics Pds Per Week 3
Course Type THEORY ELECTIVE 1
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 understand the nature of data and the processes and tools L2
involved in intelligent data analysis.
CO2 analysing statistical concepts relevant to big data analysis, L3
including sampling distributions, re-sampling, statistical
inference, and prediction error estimation.
CO3 applying concepts related to mining data streams, including L2
stream data models and architectures, stream computing,
sampling and filtering streams, and real-time analytics platform
applications through case studies.
CO4 understand the history of Hadoop, the Hadoop Distributed File L2
System (HDFS), components of Hadoop, analysing data with
Hadoop, scaling out, and the design of HDFS and Java interfaces
to HDFS basics.
CO5 learn to set up a Hadoop cluster, including cluster specification, L2
setup, installation, configuration, security considerations,
administration, monitoring, maintenance, and benchmarking, as
well as deploying Hadoop in the cloud.

UNI CEMCA315: Big Data Analytics HR C B

T S O T
1 Introduction to BigData Platform – Challenges of 6
Conventional Systems - Intelligent data analysis –Nature
of Data - Analytic Processes and Tools - Analysis vs
Reporting - Modern Data Analytic Tools -Statistical

MCA NEP WEF 2024-25 36 | 57

 Concepts: Sampling Distributions - Re-Sampling -
Statistical Inference - Prediction Error.
2 Mining Data Streams - Introduction To Streams Concepts 6
– Stream Data Model and Architecture - Stream
Computing -Sampling Data in a Stream – Filtering
Streams – Counting Distinct Elements in a Stream –
Estimating Moments – Counting Oneness in a Window –
Decaying Window - Real time Analytics Platform(RTAP)
Applications - Case Studies - Real Time Sentiment
Analysis, Stock Market Predictions.
3 HADOOP - History of Hadoop- The Hadoop Distributed 6
File System – Components of Hadoop- Analyzing the
Data with Hadoop- Scaling Out- Hadoop Streaming-
Design of HDFS-Java interfaces to HDFSBasics-
Developing a Map Reduce Application-How Map Reduce
Works-Anatomy of a Map Reduce Job run-Failures-Job
Scheduling-Shuffle and Sort – Task execution - Map
Reduce Types and Formats- Map Reduce Features
4 HADOOP Environment - Setting up a Hadoop Cluster - 6
Cluster specification - Cluster Setup and Installation –
Hadoop Configuration-Security in Hadoop -
Administering Hadoop – HDFS - Monitoring-Maintenance-
Hadoop benchmarks- Hadoop in the cloud
5 Frameworks - Applications on Big Data Using Pig and 6
Hive – Data processing operators in Pig – Hive services –
HiveQL – Querying Data in Hive - fundamentals of HBase
and ZooKeeper - IBM InfoSphere BigInsights and
Streams. Visualizations - Visual data analysis techniques,
interaction techniques; Systems and applications

Suggested Readings

 Tom White “Hadoop: The Definitive Guide” Third Edition, O’reilly Media.
 Chris Eaton, Dirk DeRoos, Tom Deutsch, George Lapis, Paul Zikopoulos,
“Understanding Big Data: Analytics for Enterprise Class Hadoop and
Streaming Data”, McGrawHill Publishing.
 Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”,
Cambridge University Press.
 Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in
Huge Data Streams with Advanced Analytics”, JohnWiley & sons.
 PeteWarden, “Big Data Glossary”, O’Reilly.
 Da Ruan,Guoquing Chen, Etienne E.Kerre, GeertWets, Intelligent Data
Mining, Springer.
 Paul Zikopoulos ,Dirk deRoos , Krishnan Parasuraman , Thomas Deutsch ,
James Giles, David Corrigan , Harness the Power of Big Data The IBM Big
Data Platform, Tata McGraw Hill Publications.
 Michael Minelli, Michele Chambers, Ambiga Dhiraj, Big Data, Big Analytics:
Emerging Business Intelligence and Analytic Trends for Today's
Businesses,Wiley Publications.

Semester III
Course Code CEMCA315 Credits 3

MCA NEP WEF 2024-25 37 | 57

Course Name Soft Computing Pds Per Week 3
Course Type THEORY ELECTIVE 1
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 recognize the feasibility of applying a soft computing L3
methodology for a particular problem
CO2 understand the concepts and techniques of soft computing and L2
foster their abilities in designing and implementing soft
computing-based solutions for real-world and engineering
problems.
CO3 apply neural networks to pattern classification and regression L3
problems and compare solutions by various soft computing
approaches for a given problem.
CO4 apply fuzzy logic and reasoning to handle uncertainty and solve L3
engineering problems
CO5 apply genetic algorithms to combinatorial optimization L3
problems.

UNI CEMCA315: Soft Computing HR CO BT

T S
1 Neural Networks-I (Introduction & Architecture): 6 CO L1,
Neuron, Nerve structure and synapse, Artificial Neuron 1 L4
and its model, activation functions, Neural network CO L2,
architecture: single layer and multilayer feed forward 2 L4,
networks, recurrent networks. Various learning L6
techniques; perception and convergence rule, Auto-
associative and hetro-associative memory.
2 Neural Networks-II (Back propagation networks): 6 CO L2,
Architecture: perceptron model, solution, single layer 3 L3,
artificial neural network, multilayer perception model; CO L5
back propagation learning methods, effect of learning 2 L2,
rule co-efficient; back propagation algorithm, factors L4,
affecting backpropagation training, applications. L6
3 Fuzzy Logic-I (Introduction): Basic concepts of fuzzy 6 CO L3,
logic, Fuzzy sets and Crisp sets, Fuzzy set theory and 3 L5
operations, Properties of fuzzy sets, Fuzzy and Crisp CO L2,
relations, Fuzzy to Crisp conversion. 2 L4,
L6
4 Fuzzy Logic –II (Fuzzy Membership, Rules): 6 CO L3,
Membership functions, interference in fuzzy logic, 4 L4
fuzzy if-then rules, Fuzzy implications and Fuzzy CO L2,
algorithms, Fuzzyfications & Defuzzificataions, Fuzzy 2 L4,
Controller, Industrial applications L6

5 Genetic Algorithm (GA): Basic concepts, working 6 CO L3,

principle, procedures of GA, flow chart of GA, Genetic 5 L5
representations, (encoding) Initialization and selection, CO L2,
Genetic operators, Mutation, Generational Cycle, 2 L4,

MCA NEP WEF 2024-25 38 | 57

 applications. L6

Suggested Readings
 S. Rajsekaran & G.A. Vijayalakshmi Pai, “Neural Networks, Fuzzy Logic and
Genetic Algorithm: Synthesis and Applications” Prentice Hall of India.
 N.P.Padhy,”Artificial Intelligence and Intelligent Systems” Oxford
University Press.
 Siman Haykin,”Neural Networks ”Prentice Hall of India.
 Saroj Kaushik, Sunita Tiwari, “Soft Computing: Fundamentals, Techniques
and Applications”, McGraw Hill Education
 Timothy J. Ross, “Fuzzy Logic with Engineering Applications” Wiley India.
 Kumar Satish, “Neural Networks” Tata Mc Graw Hill.

Semester III
Course Code CEMCA316 Credits 3
Course Name Internet of Things Pds Per 3
Week
Course Type THEORY – ELECTIVE 2
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 understand the architecture and the functional blocks of L2
Internet of Things.
CO2 explain the concepts of Internet of Things and gain knowledge L2
to design IoT applications
CO3 demonstrate the process of capturing and analysing data in L2
Internet of Things.
CO4 examine the various components involved in IoT design L4
methodology.
CO5 evaluate an IoT device to work with a Cloud Computing L5
infrastructure.
CO6 implement IoT protocols for communication. L6

UNI CEMCA316: Internet of Things HR CO B

T S T
1 Internet of Things (IoT): Vision, Definition, Conceptual 6 CO L2
framework, Architectural view, Technology behind IoT, 1 L2
Sources of the IoT, M2M Communication, IoT examples. CO
2
2 Design Principles for Connected Devices: IoT/M2M 6 CO L4
systems layers and design standardization, 4
Communication technologies, Data enrichment and
consolidation, Ease of designing and affordability
Hardware for IoT: Sensors, Digital sensors, Actuators,
Radio frequency identification (RFID) technology,
Wireless sensor networks, Participatory sensing
technology

MCA NEP WEF 2024-25 39 | 57

 3 Embedded Platforms for IoT: Embedded computing 6 CO L3
basics, Overview of IOT supported hardware platforms 3
such as Arduino, Net Arduino, Raspberry Pi, Beagle
Bone, Intel Galileo boards and ARM cortex.
4 Network & Communication Aspects in IoT: Wireless 6 CO L3
medium access issues, MAC protocol survey, Survey 3
routing protocols, Sensor deployment & Node
discovery, Data aggregation & dissemination
Programming the Arduino: Arduino platform boards
anatomy, Arduino IDE, Coding using emulator
5 Challenges in IoT Design Challenges: Development 6 CO L5
challenges, Security challenges, Other challenges. 5 L6
IoT Applications: Smart metering, E-health, City CO
automation, Automotive applications, Home 6
automation, Smart cards, Communicating data with
H/W units, Mobiles, Tablets, Designing of smart street
lights in smart city.

Suggested Readings
 Rajan Gupta, Supriya Madan, “Fundamentals of IoT”, BPB Publications, Ist
Edition, 2023.
 Olivier Hersent, David Boswarthick, Omar Elloumi, “The Internet of Things
Key Applications and Protocols”, Wiley.
 Jeeva Jose, “Internet of Things”, Khanna Publishing House.
 Michael Miller, “The Internet of Things”, Pearson Education.
 Raj Kamal, “Internet of Things”, McGraw-Hill, 1st Edition, 2016.

Semester III
Course Code CEMCA316 Credits 3
Course Name Advanced Computer Graphics Pds Per 3
Week
Course Type THEORY ELECTIVE 2
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 understand the components and working of interactive L2
graphics, including raster scan and random scan systems,
display processors, lookup tables, frame buffer loading, and
coordinate systems.
CO2 applying master scan conversion techniques for drawing L3
geometry, output primitives, lines, pixel graphics, anti-aliasing,
and algorithms for generating circles, ellipses, and filled-area
primitives. They will also understand curve representation using
parametric curves and Bezier curves.

CO3 understand two-dimensional transformations, including L2

translation, rotation, scaling, matrix representations,
homogeneous coordinates, composite transformations,

MCA NEP WEF 2024-25 40 | 57

 reflection, and transformations about arbitrary lines.
CO4 analysing visualization techniques for realism, 3D object L4
representation, solid model representation schemes, Euclidean
geometry methods, procedural methods, 3D transformations,
and three-dimensional viewing techniques.
CO5 applying master visible-surface determination techniques such L3
as Z-buffer, depth-sorting, area subdivision, and BSP-tree
method, as well as illumination and shading concepts including
basic illumination models, Gouraud shading, and Phong
shading.
CO6 understand animation design principles, key-frame systems, L2
and animation techniques such as tweening and morphing.

UNI CEMCA316: Advanced Computer Graphics HR CO B

T S T
1 Introduction to Computer Graphics and its Components: 6 CO L2
Overview of Computer Graphics, its functions & 1 L2
elements; Introduction to GUI, Computer Vision, CO
Augmented Reality and other Applications of Graphics; 2
Popular Graphics Software; Components and Working of
Interactive Graphics; Raster Scan and Random Scan
systems and Display Processors; Look-up table; Loading
the Frame Buffer; Coordinate Systems. Graphics
Devices: Display Technologies: Resolution, Aspect
Ratio, Refresh CRT, Color CRT, Flat Panel Displays;
Interactive Input Devices for Graphics, Image and Video
Input Devices.
2 Scan Conversion: Drawing Geometry; Output Primitives; 6 CO L4
Lines and Pixel Graphics; Anti Aliasing; Scan Converting 4
Lines: DDA line drawing algorithms, Bresenham’s line
Algorithm; Scan Converting Circles: Polynomial method
for circle drawing, circle drawing using polar
coordinates, Bresenham’s circle drawing; Algorithms for
Generation of ellipse; Line Styles; Generation of Bar
Charts, Pie-Charts.
Curve Representation: Parametric Curves, Parametric
Representation of a Circle, Parametric representation of
cubic curves, drawing Bezier curves.
Filled-Area Primitives: Basic Stack based fill algorithms:
Flood fill algorithm, Boundary fill algorithm; Scan-line
polygon fill algorithm and its computational structures.
3 Two-Dimensional Transformations:Coordinate and 6 CO L3
Geometric Transformations; Translation, Rotation, 3
Scaling; Matrix representations and Homogeneous
coordinates, Composite transformations, General Pivot
Point rotation, General Fixed Point Scaling, Shearing;
Reflection ; Reflection about an arbitrary line.
4 3-D Graphics & Modeling: Visualization techniques for 6 CO L3
Realism; 3D Object Representation; Solid Model 3
Representation Schemes; Euclidean Geometry
methods: Regularized Boolean Set Operations, Primitive
Instancing, Boundary Representations, Curved lines and
surfaces, Sweep Representations, Spatial-Partitioning

MCA NEP WEF 2024-25 41 | 57

 Representations - Octree representation, Constructive
Solid Geometry; Procedural Methods: Fractals, Shape
Grammars, Particle systems, Physically Based
modeling, Visualization techniques; 3D transformations.
5 Three-Dimensional Viewing: Viewing Pipeline; Parallel 6 CO L5
Projection: Orthographic and Oblique Projection; 5 L6
Perspective Projection. CO
Visible-Surface Determination: Z-buffer, Depth-Sorting, 6
Area Subdivision, BSP-Tree method; Ray casting.
Illumination and Shading: Modeling Light Intensities;
Basic Illumination Models; Gouraud Shading; Phong
Shading.
Introduction to Animation: Designing of Animation
Sequences; Key-Frame Systems; Animation
Techniques: Tweening, Morphing.

Suggested Readings

 "Computer Graphics: Principles and Practice" by John F. Hughes, Andries van Dam, Morgan
McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, Kurt Akeley.
 "Interactive Computer Graphics: A Top-Down Approach with WebGL" by Edward Angel, Dave
Shreiner.
 "Computer Graphics Through OpenGL: From Theory to Experiments" by Sumanta Guha.
 "Foundations of 3D Computer Graphics" by Steven J. Gortler.
 "Real-Time Rendering" by Tomas Akenine-Möller, Eric Haines, Naty Hoffman.
 "Introduction to Computer Graphics: Using Java 2D and 3D" by Frank Klawonn, Mohamed
Fayad.
 "Computer Graphics: From Pixels to Programmable Graphics Hardware" by David S. Ebert, R.
Kent Dybvig, Marc Olano, Max McGuire.
 "OpenGL Programming Guide: The Official Guide to Learning OpenGL, Version 4.5 with SPIR-
V" by John Kessenich, Graham Sellers, Dave Shreiner.

MCA NEP WEF 2024-25 42 | 57

Semester III
Course Code CEMCA316 Credits 3
Course Name Deep Learning Pds Per Week 3
Course Type THEORY ELECTIVE 2
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

S. No. Course Outcomes Lev

el
CO1 understand the fundamentals of machine learning and its types L2
CO2 explain the architecture of artificial neural networks (ANN) and L2
the training process.
CO3 implement basic neural networks L6
CO4 describe the components of Convolutional Neural Networks L4
(CNN) and their functions.
CO5 apply LSTM for sequence prediction and time series L3
forecasting.

UNI CEMCA316: Deep Learning HR CO B

T S T
1 Introduction – Overview of Machine Learning, 6 CO L2
Introduction to Artificial Neural Network (ANN), 1
Perceptron, Training a Neural Network, Activation
Functions, Loss Function, Hyperparameters, Gradient
Descent, Stochastic Gradient Descent, Backpropagation
and regularization, Batch normalization, Building an
ANN in Python, Frameworks-TensorFlow, Keras.
2 What is Deep Learning? Deep vs Shallow Networks, 6 CO L2
Convolution Neural Networks (CNN) –Convolution 2
Layers, Pooling Layer, Flattening, Fully Connected
Layers, Softmax and Cross-Entropy, Building a CNN in
Python
3 Deep Belief Networks, Auto Encoders, Concept of 6 CO L3
Dimensionality Reduction, Autoencoder, Denoising 3
Autoencoders, Deep Autoencoders,
4 Recurrent Neural Networks (RNN), LSTM, Sequence 6 CO L3
Prediction and Time Series Forecasting with LSTM. 4
5 Overview of Object Detection Techniques using Deep 6 CO L2
Learning, Concept of Reinforcement Learning, Transfer 5
Learning.

Suggested Readings
 Adam Gibson and Josh Patterson, Deep Learning: A Practitioner's
Approach, (O'Reilly).
 Mohamed Elgendy, Deep Learning for Vision Systems, Manning
Publications.
 Navin Kumar Manaswi, Deep Learning with Applications Using Python,
Apress.

MCA NEP WEF 2024-25 43 | 57

Semester III
Course Code CCMCA321 Credits 2
Course Name Data Science Lab Pds Per 4
Week
Course Type PRACTICAL
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

Assignments based on
 Working with NumPy arrays
 Working with Pandas data frames
 Basic plots using Matplotlib
 Frequency distributions
 Averages
 Variability
 Normal curves
 Correlation and scatter plots
 Correlation coefficient
 Regression

Semester III
Course Code CCMCA322 Credits 2
Course Name Advanced Java Lab Pds Per 4
Week
Course Type PRACTICAL
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

Assignments based on
 basic Java Servlets.
 JDBC and Servlets, Data Source and Connection pooling, JavaMail in a
Servlet.
 Servlet Request and Response Model, Deploying a Servlet, Servlet State
Transitions, ServletConfig and ServletContext, Servlet Redirection and
Request Dispatch, Servlet Synchronization and Thread.
 Reading and writing data from client using Servlets, Maintaining Client
State - Cookies, URL rewriting, hidden form fields, Session Tracking. Inter
servlet communications –JDBC connection pool.
 JSP fundamentals, JSP tags and JSP expressions, data sharing among
servlets & JSP. JSP implicit objects, request application, session and page
scope, JSP standard actions, JSP errors.

Semester III

MCA NEP WEF 2024-25 44 | 57

Course Code CCMCA323 Credits 2
Course Name ANDROID LAB Pds Per Week 4
Course Type PRACTICAL
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

Assignments based on
 Setup and understand Android Studio IDE.
 Create an android app to display various android lifecycle phases.
 Exercises based on using various Views and run on emulator as well as
physical device.
 Create an application to perform the operations of create, insert, delete,
view and update, using SQLite database.
 Learn to Deploy app on marketplace.

Semester IV
Course Code CCMCA411 Credits 4
Course Name Blockchain Technology Pds Per 3+1
Week
Course Type THEORY
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 explain the principles of cryptography including hash functions, L2
digital signatures, and zero-knowledge proofs.
CO2 analyze the mechanisms of blockchain networks including L4
mining, consensus, and anonymity.
CO3 implement distributed consensus mechanisms such as Nakamoto L6
consensus, Proof of Work, and Proof of Stake in blockchain
systems.
CO4 assess the protocols and vulnerabilities of cryptocurrencies like L5
Bitcoin and Ethereum, including mining strategies, smart
contracts, and potential attack
CO5 evaluate the stakeholders and legal aspects of cryptocurrency L5
regulation, and analyze its impact on global economies and
various applications such as IoT and medical record management
systems.

UNI CCMCA411: Blockchain Technology HR CO BT

T S

1 History: Digital Money to Distributed Ledgers -Design 6 CO L1,

Primitives: Protocols, Security, Consensus, Permissions, 1 L2
Privacy, Block chain Architecture and Design-Basic
crypto primitives: Hash, Signature Hash chain to Block
chain-Basic consensus mechanisms.
2 Requirements for the consensus protocols-Proof of 6 CO L4
Work (PoW)-Scalability aspects of Block chain 2
consensus protocols: Permissioned Block Chains-

MCA NEP WEF 2024-25 45 | 57

 Design Goals-Consensus protocols for Permissioned
Block chains.
3 Decomposing the consensus process-Hyper ledger 6 CO L3
fabric components-Chain code Design and 3
Implementation: Hyper ledger Fabric II, Beyond Chain
code: fabric SDK and Front End-Hyper ledger composer
tool.
4 lock chain in Financial Software and Systems (FSS): - 6 CO L5
Settlements, -KYC, -Capital Markets-Insurance, Block 4
chain in trade/supply chain: Provenance of goods,
visibility, trade/supply chain finance, invoice
management/discounting.
5 Block chain for Government: Digital identity, land 6 CO L4,
records and other kinds of record keeping between 5 L5
government entities, public distribution system / social
welfare systems: Block chain Cryptography: Privacy
and Security on Block chain.

Suggested Readings
 Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and
Steven Goldfeder, Bitcoin and Cryptocurrency Technologies: A
Comprehensive Introduction, Princeton University Press.
 Antonopoulos, Mastering Bitcoin: Unlocking Digital Cryptocurrencies.
 Satoshi Nakamoto, Bitcoin: A Peer-to-Peer Electronic Cash System.
 DR. Gavin Wood, “ETHEREUM: A Secure Decentralized Transaction
Ledger,”Yellow paper.
 Nicola Atzei, Massimo Bartoletti, and Tiziana Cimoli, A survey of attacks on
Ethereum smart contracts.
 8“Mastering Blockchain”: Imran Bashir.

MCA NEP WEF 2024-25 46 | 57

Semester IV
Course Code CCMCA412 Credits 3
Course Name Cyber Forensics Pds Per 3
Week
Course Type THEORY
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 understand relevant legislation and codes of ethics. L2
CO2 apply Computer forensics and digital detective and various L3
processes, policies and procedures.
CO3 understand E-discovery, guidelines and standards, E-evidence, L2
tools and environment.
CO4 understand the techniques of email and web forensics and L2
network forensics tools.
CO5 integrate techniques to recover data from computer and hand- L6
held devices.

UNI CCMCA412: Cyber Forensics HR CO BT

T S
1 IPsec protocols - IP Authentication header - IP ESP, Key 6 CO L2
management protocol for IPsec, Transport layer 1
Security: SSL protocol, Cryptography computations -
TLS protocol.
2 PGP - S/ MIME: Internet Firewalls for Trusted System: 6 CO L3
Roles of Firewalls - firewall related terminology, Types 2
of Firewalls, Firewall design, Honeycomb design: Set
for E-Commerce transactions.
3 Introduction to traditional cybercrime, Traditional 6 CO L2
problems associated with cybercrime, Introduction to 3
Identity Theft & Identity Fraud, Types of Cyber
Forensics techniques: incident & incident response
methodology, Forensics duplication & investigations,
Preparation of IR: Creating response tool kit & IR team,
Forensics Technology & Systems.
4 Processing Crime & Incident Scenes, Working with 6 CO L2
windows & DOS systems, Current computer Forensics 4
tools: Software/ hardware tools.
5 Validating Forensics data, Data hiding techniques, 6 CO L4,
Performing Remote Acquisition, Network Forensics, 5 L5
Email investigations, Cell phone & Mobile devices
Forensics.

MCA NEP WEF 2024-25 47 | 57

Suggested Readings
 Albert J. Marcella Jr., & Frederic Guillossou, “Cyber Forensics: From Data to
Digital Evidence”, John
 Wiley and Sons, ISBN-13: 978-1118273661, 2012

Semester IV
Course Code CEMCA413 Credits 3
Course Name ETHICS IN AI & CS Pds Per Week 3
Course Type THEORY ELECTIVE 3
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 comprehend foundational ethical principles and theories in the L2
context of artificial intelligence and computer science.
CO2 critically analyze and evaluate ethical challenges inherent in AI L4
and computer science.
CO3 apply knowledge of international, national, and organizational L3
regulatory frameworks to navigate ethical guidelines and best
practices.
CO4 apply ethical design principles and decision-making frameworks L3
to design and implement responsible AI and computer science
systems.
CO5 assess and evaluate the ethical impact of AI technologies on L5
achieving the SDGs, identifying opportunities for ethical
innovation and advocacy for social good.

UNI CEMCA413: Ethics in AI & CS HR CO B

T S T
1 Introduction to AI and Computer Ethics: 6 CO L2
Ethical Foundations: Exploration of foundational ethical 1
principles such as beneficence, non-maleficence,
autonomy, and justice
Key Ethical Theories: Examination of prominent ethical
theories including utilitarianism, deontology, virtue
ethics, and consequentialism, and their application to
ethical decision-making in AI and computer science.
Ethical Responsibilities: Analysis of the ethical
responsibilities of AI and computer science
professionals towards society, individuals, and the
environment, with emphasis on ethical codes of
conduct and professional standards.
2 Ethical Challenges in AI and Computer Science 6 CO L4
Privacy and Security: Discussion on ethical challenges 2
related to data privacy, surveillance, cybersecurity, and
the ethical use of personal data in AI and computer
science applications.
Bias and Transparency: Examination of ethical issues

MCA NEP WEF 2024-25 48 | 57

 surrounding bias in AI algorithms, transparency in
decision-making processes, and the implications for
fairness and accountability.
Accountability and Governance: Analysis of ethical
challenges in ensuring accountability and governance
in AI systems, including mechanisms for oversight,
transparency, and responsible AI development and
deployment.
3 Regulatory Landscape and Policy Considerations: 6 CO L3
International Guidelines: Overview of international 3
regulatory frameworks and guidelines governing AI and
computer science ethics, including initiatives by
organizations such as the United Nations, OECD, and
IEEE.
National Regulations: Examination of national
regulatory approaches to AI ethics, including data
protection laws, algorithmic accountability regulations,
and ethical guidelines for AI research and development.
Organizational Policies: Analysis of organizational
policies and best practices for ethical AI and computer
science practices, including corporate social
responsibility initiatives, ethical design principles, and
industry standards.
4 Responsible Technology Development 6 CO L3
Ethical Design Principles: Exploration of ethical design 4
principles for AI and computer science systems,
including principles of fairness, transparency,
accountability, and inclusivity in system design and
development.
Ethical Decision-Making Frameworks: Introduction to
ethical decision-making frameworks and methodologies
for addressing ethical dilemmas in AI and computer
science, including ethical risk assessment, stakeholder
engagement, and participatory design approaches.
Ethical Leadership and Culture: Discussion on the role
of ethical leadership and organizational culture in
promoting responsible technology development,
including strategies for fostering ethical awareness,
competence, and accountability among AI and
computer science professionals.
5 AI Ethics and the Sustainable Development Goals 6 CO L5
(SDGs) 5
Ethical Considerations: Examination of ethical
considerations in AI technologies and their impact on
achieving the United Nations Sustainable Development
Goals (SDGs), including issues of social equity,
environmental sustainability, and economic
development.
Ethical Innovation: Analysis of ethical innovation and
entrepreneurship in AI and computer science, including
initiatives aimed at leveraging AI technologies for social
good, addressing global challenges, and promoting
sustainable development.
Ethical Leadership and Advocacy: Exploration of the

MCA NEP WEF 2024-25 49 | 57

 role of ethical leadership, advocacy, and social
responsibility in advancing ethical AI and computer
science practices, including strategies for promoting
ethical awareness, accountability, and transparency in
AI innovation and governance.

Suggested Readings
 Ethics of Artificial Intelligence" by B.C. Stahl, Springer, 1st edition.
 "Computer Ethics: A Global Perspective" by Walter Maner, Jones & Bartlett
Learning, 2nd edition.
 "Ethical and Social Issues in the Information Age" by Joseph Migga Kizza,
Springer, 6th edition.
 "Responsible AI: A Global Policy Framework" by The Future of Life
Institute, Cambridge University Press, 1st edition.

Semester IV
Course Code CEMCA413 Credits 3
Course Name Social Media Analytics Pds Per Week 3
Course Type THEORY ELECTIVE 3
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 understand the basics of Social Media Analytics. L2
CO2 explain the significance of Data mining in social media. L2
CO3 demonstrate the algorithms used for text mining. L2
CO4 apply network measures for social media data. L3
CO5 explain Behaviour Analytics techniques used for social media L2
data.
CO6 apply social media analytics for Face book and Twitter kind of L3
applications.

UNI CEMCA413: Social Media Analytics HR C B

T S O T
1 The foundation for analytics, social media data sources,
defining social media data, data sources in social media
channels, Estimated Data sources and Factual Data
Sources, Public and Private data, data gathering in social
media analytics.
2 Introduction, A Taxonomy of Visualization, The
convergence of Visualization, Interaction and Analytics.
Data mining in social media: Introduction, Motivations
for Data mining in social media, Data mining methods
for social media, Related Efforts.
3 Introduction, Keyword search, Classification Algorithms,
Clustering Algorithms-Greedy Clustering, Hierarchical
clustering, k-means clustering, Transfer Learning in

MCA NEP WEF 2024-25 50 | 57

 heterogeneous Networks, Sampling of online social
networks, Comparison of different algorithms used for
mining, tools for text mining.
4 Centrality: Degree Centrality, Eigenvector Centrality,
Katz Centrality, PageRank, Betweenness Centrality,
Closeness Centrality, Group Centrality, Transitivity and
Reciprocity, Balance and Status, Similarity: Structural
Equivalence, Regular Equivalence.
Individual Behaviour: Individual Behaviour Analysis,
Individual Behaviour Modelling, Individual Behaviour
Prediction Collective Behaviour: Collective Behaviour
Analysis, Collective Behaviour Modelling, Collective
Behaviour Prediction.
5 Individual Behaviour: Individual Behaviour Analysis,
Individual Behaviour Modelling, Individual Behaviour
Prediction Collective Behaviour: Collective Behaviour
Analysis, Collective Behaviour Modelling, Collective
Behaviour Prediction.

Suggested Readings
 "Social Media Mining: An Introduction" by Reza Zafarani, Mohammad Ali
Abbasi, and Huan Liu.
 "Mining the Social Web: Data Mining Facebook, Twitter, LinkedIn,
Instagram, GitHub, and More" by Matthew A. Russell.
 "Data Mining Techniques: For Marketing, Sales, and Customer Relationship
Management" by Gordon S. Linoff and Michael J. A. Berry.
 "Social Media Analytics: Techniques and Insights for Extracting Business
Value Out of Social Media" by Matthew Ganis.

Semester IV
Course Code CEMCA413 Credits 3
Course Name Generative AI Pds Per Week 3
Course Type THEORY ELECTIVE 3
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 understand the Theoretical Foundations of Generative AI. L2
CO2 apply Advanced Training Methods and Evaluation Metrics for L3
Generative Models
CO3 implement Image Generation Techniques using VAEs and GANs L6
CO4 analyze Text Generation Models and Sequence Generation L4
Tasks.
CO5 Assess Ethical Implications and Propose Responsible Practices L5
for Generative AI Development.

UNI CEMCA413: Generative AI HR CO B

T S T
1 Introduction to Generative Artificial Intelligence 6 CO L2

MCA NEP WEF 2024-25 51 | 57

 Theoretical foundations: probability theory, information 1
theory, and neural networks.
Overview of generative models and their applications:
autoencoders, variational autoencoders (VAEs), and
generative adversarial networks (GANs)
2 Training methods for generative models: maximum 6 CO L3
likelihood estimation, variational inference, and 2
adversarial training.
Evaluation metrics for assessing generative model
performance: likelihood-based metrics, inception score,
and Fréchet Inception Distance (FID)
Exploration of recent advancements in generative AI
research
3 Image generation with VAEs and GANs 6 CO L3
Conditional image generation and image-to-image 3
translation, Application of generative models in image
synthesis, style transfer, and super-resolution
4 Text and Sequence Generation 6 CO L4
Language modelling with recurrent neural networks 4
(RNNs) and transformers, Text generation with
language models and conditional text generation
Sequence generation tasks: machine translation,
summarization, and dialogue generation
5 Ethical implications of generative AI technologies: 6 CO L5
deepfakes, misinformation, and bias. 5
Societal impacts of generative AI on privacy, security,
and creative industries.
Responsible AI practices: transparency, fairness, and
accountability in generative AI development

Suggested Readings
 "Generative Deep Learning: Teaching Machines to Paint, Write, Compose,
and Play" by David Foster, O’Reilly Media.
 "Deep Learning" by Ian Goodfellow, Yoshua Bengio, and Aaron Courville,
MIT Press.
 "Generative Adversarial Networks: An Overview" by Antonios Liapis,
Springer.
 "Hands-On Generative AI with Python: Generate Your Own Artwork, Text,
Music, and More Using Deep Learning" by Kajal Sinha, Packt Publishing.
 "Ethics of Artificial Intelligence" by B.C. Stahl, Springer.

Semester IV
Course Code CEMCA414 Credits 3
Course Name Entrepreneurial Development Pds Per Week 3
Course Type THEORY ELECTIVE 4
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

MCA NEP WEF 2024-25 52 | 57

S. Course Outcomes Lev
No. el
CO1 define the basic theories and concepts that underlies a survey L3
study of Innovation, Entrepreneurship and Social Business /Social
Entrepreneurship (IE).
CO2 understand how to generate good large company or start-up L2
business ideas / societal ideas, and refine these ideas, to
substantially increase chances for success in the marketplace
CO3 explore a sample process for developing a range of innovations L4
from evolutionary, to disruptive, as a set of tools with a good
chance for a corporate innovation, and for new start-ups/ social
businesses
CO4 analyze financing sources for various stages in the life of a start- L4
up and social business and draft appropriate documents to
present the start-up
CO5 determine underlying issues contributing to industrial sickness, L5
prescribing preventive measures to preserve enterprise health.
CO6 apply conceptual frameworks to diagnose challenges faced by L2
MSMEs, prescribe applicable government aid programs, recognize
signs of impending corporate sickness, and determine
appropriate treatment modalities.

UNI CEMCA414: Entrepreneurial Development HR C B

T S O T
1 Entrepreneurship: Meaning and Significance; 6
Relationship between Entrepreneurship Development
and Economic Development; Types of Entrepreneurs;
Entrepreneurial Competencies; Influences on
Entrepreneurial Development: Socio-Cultural, Political,
Economic, and Psychological; Problems Associated with
Entrepreneurship in India
2 New Venture Development: Methods, Procedures & 6
Problems; Feasibility study: Preparation of Feasibility
Reports, Selection of Factory Location, Market Potential,
Demand Analysis; Working Capital Requirement &
Financing
3 Role of Innovation and Creativity in Entrepreneurship; 6
Grass Root Innovation; Frugal Innovation;
Entrepreneurship Ecosystem
4 Role of Government, Promotional Agencies and 6
Institutions in Entrepreneurship Development; Incentives
and Various Financial Schemes Available for
Entrepreneurs
5 MSME: Definition, Role, and Problems; Govt. schemes for 6
MSME; Industrial Sickness: Causes, Consequences and
Remedial Measures; Role of Women SHG's in Micro
Enterprises, SIDBI and its functions

Suggested Readings
 "Entrepreneurship: Theory, Process, and Practice" by Donald F. Kuratko.

MCA NEP WEF 2024-25 53 | 57

  "New Venture Creation: Entrepreneurship for the 21st Century" by Jeffry A.
Timmons and Stephen Spinelli Jr...
 "The Lean Startup: How Today's Entrepreneurs Use Continuous Innovation
to Create Radically Successful Businesses" by Eric Ries.
 "Startup Nation: The Story of Israel's Economic Miracle" by Dan Senor and
Saul Singer.
 "Indian Economy" by Ramesh Singh.
 "Micro, Small and Medium Enterprises in India: The Challenges of the 21st
Century" edited by M.P. Bezbaruah.

Semester IV
Course Code CEMCA414 Credits 3
Course Name Natural Language Processing Pds Per 3
Week
Course Type THEORY ELECTIVE 4
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 explain the origins and challenges of Natural Language L2
Processing (NLP), including language modelling techniques and
basic linguistic concepts.
CO2 evaluate word-level analysis techniques such as N-grams, L5
tokenization, and semantic analysis, including their applications
and limitations.
CO3 implement syntactic analysis methods like context-free L6
grammars, parsing algorithms, and ambiguity resolution
techniques in NLP systems.
CO4 assess semantic and pragmatic representation methods, L5
including logic-based approaches, semantic attachments, and
word sense disambiguation techniques
CO5 design and develop NLP solutions using a combination of L6
syntactic, semantic, and pragmatic analysis techniques

UNI CEMCA414: Natural Language Processing HR CO BT

T S
1 Introduction: Origins and challenges of NLP – Language 6 CO L2
Modelling: Grammar-based LM, Statistical LM – Regular 1
Expressions, Finite-State Automata – English
Morphology, Transducers for lexicon and rules,
Tokenization, Detecting and Correcting Spelling Errors,
Minimum Edit Distance
2 Word Level Analysis: Unsmoothed N-grams, Evaluating 6 CO L3,
N-grams, Smoothing, Interpolation and Backoff – Word 2 L4
Classes, Word Tokenization, Math with words TF-IDF
Vectors, Finding meaning in word count (Semantic
Analysis), Linguistic Background: Outline of English
Syntax, Introduction to Semantics and Knowledge

MCA NEP WEF 2024-25 54 | 57

 Representation, Zipf’s Law
3 Syntactic Analysis: Context Free Grammars, Grammar 6 CO L3
rules for English, Grammars and Parsing: Grammars 3
and sentence Structure, Top-Down and Bottom-Up
Parsers, Transition Network Grammars, Top- Down
Chart Parsing. Feature Systems and Augmented
Grammars: Basic Feature system for English,
Morphological Analysis and the Lexicon, Parsing with
Features, Augmented Transition Networks
4 Ambiguity Resolution: Statistical Methods, Probabilistic 6 CO L4
Language Processing, Estimating Probabilities, Part-of- 4
Speech tagging, Obtaining Lexical Probabilities,
Probabilistic Context-Free Grammars, Best First Parsing
Feature structures, Unification of feature structures.
5 Semantics And Pragmatics: Requirements for 6 CO L5,
representation, First-Order Logic, Description Logics – 5 L6
Syntax-Driven Semantic analysis, Semantic
attachments – Word Senses, Relations between
Senses, Thematic Roles, selectional restrictions – Word
Sense Disambiguation, WSD using Supervised,
Dictionary & Thesaurus, Bootstrapping methods – Word
Similarity using Thesaurus and Distributional methods.

Suggested Readings
 Daniel Jurafsky, James H. Martin―Speech and Language Processing: An
Introduction to Natural Language Processing, Computational Linguistics
and Speech, Pearson Publication, 2014.
 Steven Bird, Ewan Klein and Edward Loper, ―Natural Language Processing
with Python, First Edition, OReilly Media, 2009.
 Lawrence Rabiner And Biing-Hwang Juang, “Fundamentals of Speech
Recognition”, Pearson Education, 2003.
 Daniel Jurafsky And James H Martin, “Speech and Language Processing –
An Introduction To Natural Language Processing, Computational
Linguistics, And Speech Recognition”, Pearson Education, 2002.

Semester IV
Course Code CEMCA414 Credits 3
Course Name Computer Vision and Pds Per Week 3
Augmented Reality
Course Type THEORY ELECTIVE 4
MIDTERM MARKS 30 ESE MARKS 70 TOTAL 100

S. Course Outcomes Lev

No. el
CO1 understand the fundamental concepts of computer vision, L2
including its introduction, research, applications, and
representation of a three-dimensional moving scene.

MCA NEP WEF 2024-25 55 | 57

CO2 applying master image formation principles, geometric L3
primitives, transformations, lighting, reflectance, shading, and
image processing techniques such as filtering, Fourier
transforms, image pyramids, and wavelets.
CO3 analysing feature detection and matching methods, including L4
point features, patches, edge detection, linking, Hough
transforms, and their applications.
CO4 analysing feature detection and matching methods, including L4
point features, patches, edge detection, linking, Hough
transforms, and their applications.
CO5 applying master structure from motion techniques, motion L3
understanding, optical flow, triangulation, factorization, bundle
adjustment, dense motion estimation.

UNI CEMCA414: Computer Vision and Augmented HR C B

T Reality S O T
1 Computer Vision: Introduction; Research and 6
Applications; Representation of a Three-Dimensional
Moving Scene.
Image Formation: Geometric Primitives and
Transformations, Image Model; Lighting, Reflectance &
Shading; Imaging Devices for Computer Vision.
Image Processing: Recovering Intrinsic Structure, Range
Information from Geometry, Surface Orientation from
Reflectance Models, Filtering the Image; Fourier
Transforms; Image Pyramids & Wavelets.
2 Feature Detection and Matching: Point features & 6
patches; Edge Detection & Linking; Hough Transforms;
Applications.
Segmentation: Active Contours & Application; Split &
Merge; Mean Shift & Mode Finding; Normalized Cuts;
Graph Cuts & Energy Based methods with application.
Feature Based Alignment: 2-D & 3-D Feature Based
Alignment; Pose estimation and Application to
Augmented Reality; Calibration and its Application.
3 Structure from Motion: Motion Understanding, 6
Understanding Optical Flow and Image Sequences;
Triangulation; Two-Frame structure from motion and
application; Factorization; Bundle adjustment and its
applications; Dense Motion Estimation; Image Stitching.
Recognition: Object Detection; face Recognition;
Instance Recognition; Category Recognition.
4 Augmented Reality: Overview, AR Components and 6
Working; Augmented Reality Related Concepts:
Computer Graphics, Dimensionality, Depth Cues,
Registration & Latency; Ingredients of an Augmented
Reality Experience; Tracking for Augmented Reality;
Coordinate Systems; AR Hardware & Software; Displays;
Display Techniques.
Augmented Reality Content: Creating Visual & Audio
Content.
5 Interaction in Augmented Reality: introduction & 6
Categories; Interaction in Projected Augmented Reality

MCA NEP WEF 2024-25 56 | 57

 Environments.
Mobile Augmented Reality: Architectures; Advantages &
Disadvantages. Visualization Issues; Augmented Reality
Technologies, Computer Vision in Augmented Reality; AR
Interfaces.
Augmented Reality Applications: Issues for a good
Augmented Reality Application; Application Areas;
Collaborative Augmented Reality; Steps for applying
Augmented Reality; Evaluating Augmented Reality
Applications; Example Augmented Reality Applications.

Suggested Readings

 "Computer Vision: Algorithms and Applications" by Richard Szeliski.

 "Multiple View Geometry in Computer Vision" by Richard Hartley and Andrew Zisserman.
 "Digital Image Processing" by Rafael C. Gonzalez and Richard E. Woods.
 "Feature Extraction and Image Processing for Computer Vision" by Mark Nixon and Alberto
Aguado.
 "Augmented Reality: Principles and Practice" by Dieter Schmalstieg and Tobias Hollerer.
 "Understanding Augmented Reality: Concepts and Applications" by Alan B. Craig.
 "Mobile Augmented Reality" by Dieter Schmalstieg and Tobias Hollerer.

MCA NEP WEF 2024-25 57 | 57