Kurukshetra University, Kurukshetra

(Established by the State Legislature Act-XII of 1956)

(“A++” Grade, NAAC Accredited)

Syllabus
for

Post Graduate Programme

Master of Computer Applications

as per NEP-2020
Curriculum and Credit Framework for Postgraduate Programme

With Multiple Entry-Exit, Internship and CBCS-LOCF

With effect from the session 2024-25

DEPARTMENT OF COMPUTER SCIENCE AND APPLICATIONS

FACULTY OF SCIENCES

KURUKSHETRA UNIVERSITY, KURUKSHETRA -136119

Master of Computer Applications Page 1 of 76

 CC-1 Client-side Web Technology
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 1st
Name of the Course Client-side Web Technology
Course Code M24-CAP-101
Course Type CC-1
Level of the course (As per Annexure-I 400-499
Pre-requisite for the course (if any) -
Course Objectives This course aims to provide a comprehensive understanding of front-
end development using the MERN stack, covering HTML, CSS, and
JavaScript basics. Students will learn about React for building dynamic
user interfaces, including components, state management, and event
handling. The course also explores advanced topics such as React
Router, Redux for state management, and advanced hooks for managing
side effects and context.
Course Learning Outcomes (CLO) CLO-1. Gain an understanding of the web development process and the
After completing this course, the learner will components of the MERN stack, with a focus on HTML structure, CSS
be able to: styling, and responsive design.
CLO-2 Develop foundational JavaScript skills, including control
structures, functions, objects, arrays, and DOM manipulation for
dynamic web interactions.
CLO-3 Learn the basics of React, including JSX, components, state
management, lifecycle methods, and handling events and forms within
React applications.
CLO-4 Master advanced React topics like React Router for navigation,
state management with Redux, and using advanced hooks for managing
complex state and side effects.
Credits Theory Practical Total
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one
compulsory question by taking course learning outcomes (CLOs) into consideration. The compulsory question
(Question No. 1) will consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5
questions, selecting one question from each unit and the compulsory question. All questions will carry equal marks.
Unit Topics Contact
Hours
I Basics of Front End Development: Overview of web development (Front End vs. Back End), 15
Understanding the MERN stack and its components, Tools and environments (text editors,
browsers, version control with Git); HTML (HyperText Markup Language): Structure of an
HTML document, HTML elements and attributes, Forms and input types, Semantic HTML
(header, footer, article, section, nav); CSS (Cascading Style Sheets): Basics of CSS (syntax,
selectors, properties), CSS Box Model, Positioning and layout (float, flexbox, grid), Responsive
design (media queries, mobile-first design).
II Basics of JavaScript: Introduction to JavaScript, Variables, data types, and operators, Control 15
structures (if, else, switch, loops); Functions and Scope: Defining and invoking functions,
Function expressions and arrow functions, Scope and closures; Objects and Arrays: Creating and
manipulating objects, Array methods and iteration; Regular Expressions: Introduction to
RegExp, Regular expression usage, Modifiers, RegExp patterns, RegExp methods, String
methods for RegExp; DOM Manipulation and Events: Selecting and manipulating DOM
elements, Event handling and delegation, Creating and appending elements dynamically
III Introduction to React: Overview and advantages of React, Setting up a React development 15

Master of Computer Applications Page 2 of 76

 environment (using Create React App); JSX (JavaScript XML): Understanding JSX syntax,
Embedding expressions in JS, JSX best practices; Components and Props: Functional and class
components, Props and component communication, Prop types and default props.; State and
Lifecycle: Understanding state in React, State management in class components, Lifecycle
methods (componentDidMount, componentDidUpdate, componentWillUnmount); Event
Handling and Forms: Handling events in React, Controlled vs. uncontrolled components, Form
handling and validation
IV React Router: Introduction to React Router, Setting up and configuring routes, Navigating 15
between routes and passing parameters; State Management with Redux: Introduction to Redux,
Setting up Redux with React, Actions, reducers, and store, Connecting Redux to React
components; Advanced Hooks: Using built-in hooks (useEffect, useContext, useReducer),
Creating custom hooks, Managing side effects with useEffect
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5 Written Examination
 Seminar/presentation/assignment/quiz/class test etc.: 10
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books:
1) Flanagan, D. (2020). JavaScript: The Definitive Guide. O'Reilly Media.
2) Kogent Learning. (2009). Web Technologies: HTML, JavaScript, PHP, Java, JSP, XML, AJAX – Black Book.
Wiley India Pvt. Ltd.
3) Duckett, J. (2014). JavaScript and jQuery: Interactive Front-End Web Development. Wiley.
4) Robson, E., & Freeman, E. (2014). Head First JavaScript Programming: A Brain-Friendly Guide. O'Reilly
Media.
5) Banks, A., & Chinnathambi, K. (2017). Learning React: Functional Web Development with React and Redux.
O'Reilly Media.

Master of Computer Applications Page 3 of 76

 CC-2 Operating System & Linux
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 1st
Name of the Course Operating System & Linux
Course Code M24-CAP-102
Course Type CC-2
Level of the course (As per Annexure-I 400-499
Pre-requisite for the course (if any) -
Course Objectives This course provides a foundational understanding of operating
systems, covering their definition, types, and functions. Students will
explore system structures, process management, CPU scheduling,
memory management, paging and segmentation, virtual memory, and
file systems. Additionally, the course offers an introduction to Linux,
including its history, architecture, file system, basic commands, shell
scripting, process and user management, networking, system
administration, and basic security concepts.
Course Learning Outcomes (CLO) CLO-1. Understand the fundamental concepts, functions, and structures
After completing this course, the learner will of operating systems, and apply various CPU scheduling algorithms.
be able to: CLO-2 Grasp memory hierarchy, allocation techniques, paging,
segmentation, virtual memory concepts, and file system management.
CLO-3 Learn the history, features, and architecture of Linux, perform
basic file operations, and write simple shell scripts.
CLO-4 Manage processes, users, and groups in Linux, utilize network
commands, perform system administration tasks, and understand basic
security measures.
Credits Theory Practical Total
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one
compulsory question by taking course learning outcomes (CLOs) into consideration. The compulsory question
(Question No. 1) will consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5
questions, selecting one question from each unit and the compulsory question. All questions will carry equal marks.
Unit Topics Contact
Hours
I Introduction to Operating Systems: Definition, types, and functions of an operating system; 15
System Structures: Operating system services, system calls, system programs, and system
structure; Process Management: Process concept, process scheduling, operations on processes,
inter-process communication; CPU Scheduling: Scheduling criteria, scheduling algorithms
(FCFS, SJF, Priority, Round Robin, Multilevel Queue Scheduling).
II Memory Management: Memory Hierarchy, Types of memory, memory allocation techniques; 15
Paging and Segmentation: Basic concepts, paging, segmentation, segmentation with paging;
Virtual Memory: Demand paging, page replacement algorithms, allocation of frames, thrashing;
File Systems: File concepts, access methods, directory and disk structure, file system mounting,
file sharing, protection.
III Introduction to Linux: History, features, architecture of Linux; Linux File System: File and 15
directory structure, file permissions, standard file types; Basic Commands: File and directory
operations (ls, cp, mv, rm, mkdir), text processing (cat, grep, sort), system status (ps, top, df, du);
Shell Scripting: Introduction to shell, shell variables, control structures (if, case, while, for),
writing simple shell scripts.
IV Process Management in Linux: Managing processes (ps, top, kill, nice), job scheduling (cron, 15
at); User and Group Management: Creating and managing users and groups, file permissions,

Master of Computer Applications Page 4 of 76

 changing ownership (chown, chgrp); Networking in Linux: Basic network commands (ifconfig,
ping, netstat, ssh), configuring network interfaces; System Administration: Package management
(installing and removing software using rpm, dpkg, apt-get), backup and restore, logging;
Security: Basic security concepts, user authentication.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5 Written Examination
 Seminar/presentation/assignment/quiz/class test etc.: 10
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books:
 Silberschatz, A., Galvin, P. B., & Gagne, G. (2018). Operating System Concepts (10th ed.). Wiley.
 Tanenbaum, A. S., & Bos, H. (2014). Modern Operating Systems (4th ed.). Pearson.
 Stallings, W. (2018). Operating Systems: Internals and Design Principles (9th ed.). Pearson.
 Love, R. (2013). Linux System Programming (2nd ed.). O'Reilly Media.
 Nemeth, E., Snyder, G., Hein, T. R., & Whaley, B. (2017). UNIX and Linux System Administration
Handbook (5th ed.). Pearson.
 Sobell, M. G. (2017). A Practical Guide to Linux Commands, Editors, and Shell Programming (4th ed.).
Pearson.
 Das, S. (2012). Your UNIX/Linux: The Ultimate Guide (3rd ed.). McGraw-Hill Education.
 Kerrisk, M. (2010). The Linux Programming Interface: A Linux and UNIX System Programming Handbook.
No Starch Press.

Master of Computer Applications Page 5 of 76

 CC-3 Data Structure
With effect from Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 1st
Name of the Course Data Structure
Course Code M24-CAP-103
Course Type CC-3
Level of the course (As per Annexure-I 400-499
Pre-requisite for the course (if any) -
Course Objectives This course introduces fundamental concepts of algorithms and data
structures, including algorithmic notation, programming principles, and
program analysis. Students will explore arrays, searching and sorting
techniques, stacks, queues, and linked lists, along with their
applications. The course also covers tree structures such as binary trees,
AVL trees, B-trees, and tries, as well as graph terminology,
representation, and traversal methods. Additionally, students will learn
about set operations, file queries, sequential organization, index
techniques, and external sorting.
Course Learning Outcomes (CLO) CLO-1. Master algorithmic notation, programming principles, and
After completing this course, the learner will implement arrays, searching and sorting techniques.
be able to: CLO-2 Apply stack and queue operations, understand linked lists, and
their applications including dynamic storage management.
CLO-3 Comprehend binary trees, binary search trees, AVL trees, B-
trees, B+ tree indexing, Trie tree indexing, and their applications.
CLO-4 Utilize graph representations, traversals, applications, sets
operations, and file organization techniques.
Credits Theory Practical Total
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one
compulsory question by taking course learning outcomes (CLOs) into consideration. The compulsory question
(Question No. 1) will consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5
questions, selecting one question from each unit and the compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Introduction: Algorithmic notation – Programming principles – Creating programs- Analyzing
programs. Arrays: One dimensional array, multidimensional array, pointer arrays. Searching: 15
I
Linear search, Binary Search, Fibonacci search. Sorting techniques: Internal sorting - Insertion
Sort, Selection Sort, Shell Sort, Bubble Sort, Quick Sort, Heap Sort, Merge Sort and Radix Sort.
Stacks: Definition – operations - applications of stack. Queues: Definition - operations - Priority
queues – Dequeues – Applications of queue. Linked List: Singly Linked List, Doubly Linked
II 15
List, Circular Linked List, linked stacks, Linked queues, Applications of Linked List – Dynamic
storage management – Generalized list.
Trees: Binary tree, Terminology, Representation, Traversals, Applications – Binary search tree –
III AVL tree. B Trees: B Tree indexing, operations on a B Tree, Lower and upper bounds of a B 15
Tree - B + Tree Indexing – Trie Tree Indexing.
Graph: Terminology, Representation, Traversals – Applications - spanning trees, shortest path
IV and Transitive closure, Topological sort. Sets: Representation - Operations on sets – 15
Applications. Files: queries - Sequential organization – Index techniques. External sorting.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70

Master of Computer Applications Page 6 of 76

  Class Participation: 5 Written Examination
 Seminar/presentation/assignment/quiz/class test etc.: 10
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books:
1) Horowitz, E., & Sahni, S. (2004). Fundamentals of Data Structures. Galgotia Book Source Pvt. Ltd.
2) Samanta, D. (2012). Classic Data Structures (2nd ed.). Prentice-Hall of India Pvt. Ltd., India.
3) Kruse, R., Tondo, C. L., & Leung, B. (2007). Data Structures and Program Design in C (2nd ed.). Prentice-
Hall of India Pvt. Ltd.
4) Weiss, M. A. (2006). Data Structures and Algorithm Analysis in C (2nd ed.). Pearson Education.

Master of Computer Applications Page 7 of 76

 CC-4 Programming in JAVA
With effect from Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 1st
Name of the Course Programming in JAVA
Course Code M24-CAP-104
Course Type CC-4
Level of the course (As per Annexure-I 400-499
Pre-requisite for the course (if any) -
Course Objectives This course provides a comprehensive introduction to Java, covering its
history, features, and applications. Students will learn Java
programming basics, including syntax, variables, control flow, methods,
and arrays. The course also delves into object-oriented programming
concepts such as classes, objects, encapsulation, inheritance,
polymorphism, and interfaces. Additionally, students will explore
advanced topics like exception handling, file handling, multithreading,
event handling, generics, JDBC for database connectivity, and GUI
programming with Swing.
Course Learning Outcomes (CLO) CLO-1. Understand Java's background, features, and apply fundamental
After completing this course, the learner will programming concepts including variables, operators, control flow,
be able to: methods, and arrays.
CLO-2 Master object-oriented programming principles including
classes, objects, inheritance, polymorphism, interfaces, and packaging in
Java.
CLO-3 Gain proficiency in handling exceptions, working with files,
implementing multithreading, and utilizing Java Collections for efficient
data management.
CLO-4 Explore and utilize advanced Java features such as generics,
lambda expressions, JDBC for database connectivity, and GUI
programming with JavaFX or Swing.
Credits Theory Practical Total
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one
compulsory question by taking course learning outcomes (CLOs) into consideration. The compulsory question
(Question No. 1) will consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5
questions, selecting one question from each unit and the compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Introduction to Java: History, features, and applications; Basics of Java programming: Syntax,
variables, data types, operators, expressions, and statements; Control flow: Decision-making
15
I statements (if, else-if, switch), looping statements (for, while, do-while), and branching;
Methods: Declaring methods, passing parameters, method overloading, and recursion; Arrays:
Declaring, initializing, and manipulating arrays. Array operations and algorithms.
Classes and Objects: Declaring classes, creating objects, constructors, and instance variables;
Encapsulation: Access modifiers (public, private, protected, default), getters, and setters;
Inheritance: Extending classes, method overriding, super keyword, and method overloading;
II 15
Polymorphism: Method overriding, dynamic method dispatch, and abstract classes; Interfaces:
Defining interfaces, implementing interfaces, and using interface references; Packages: Creating
and using packages, importing classes and packages.
III Exception Handling: Understanding exceptions, try-catch block, throw and throws keywords, 15
and finally block; File Handling: Reading from and writing to files using FileInputStream,
FileOutputStream, FileReader, and FileWriter; Multithreading: Creating threads, thread lifecycle,

Master of Computer Applications Page 8 of 76

 synchronization, thread communication. Applet programming, Applet life Cycle, Applet
Graphics programming.
Event Handling: AWT Classes, ActionListener, MouseListener, MouseMotionListener, Layout
managers, Generics: Introduction to generics, generic classes and generic methods, Java
IV Database Connectivity (JDBC): Connecting to databases, executing SQL queries, handling 15
transactions, and managing resources; GUI Programming: Introduction to Swing for creating
graphical user interfaces (GUIs).
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5 Written Examination
 Seminar/presentation/assignment/quiz/class test etc.: 10
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books:
1) Balaguruswamy, E. (2009). Programming with JAVA: A Primer. Tata McGraw Hill.
2) Naughton, P., & Schildt, H. (2002). The Complete Reference Java 2. Tata McGraw Hill.
3) Neimeyer, P., & Peck, J. (1996). Exploring Java. O'Reilly.
4) Hahn, H. (1996). Teach Yourself the Internet. Prentice-Hall of India (P.H.I.).
5) Boone, B., & Stanek, W. (2001). Java 2 Exam Guide. Tata McGraw Hill.

Master of Computer Applications Page 9 of 76

 PC-1 PRACTICAL-1
With effect from Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester Ist
Name of the Course Practical-1
Course Code M24-CAP-105
Course Type PC-1
Level of the course 400-499
Pre-requisite for the course (if any)
Course objectives This is a laboratory course and the objective of this course is to acquaint
the students with the understanding and implementing of client-side web
technologies. Also, the concepts of operating systems and shell
programming will be implemented by the students.
Course Learning Outcomes (CLO) CLO 1: Solve practical problems related to theory courses undertaken in
After completing this course, the learner the CC-1 and CC-2 from application point of view.
will be able to: CLO 2: Know how to use the client-side web technologies.
CLO 3: implement the various functions of operating systems.
CLO 4: Designing and implementing the shell programs in Linux.
Credits Theory Practical Total
0 4 4
Teaching Hours per week 0 8 8
Internal Assessment Marks 0 30 30
End Term Exam Marks 0 70 70
Max. Marks 0 100 100
Examination Time 0 4 hours
Part B- Contents of the Course
Practicals Contact Hours
Practical course will consist of two components Part-A and Part-B. The examiner will set 5 120
questions at the time of practical examination asking 2 questions from the Part-A and 3
questions from the Part-B by taking course learning outcomes (CLO) into consideration. The
examinee will be required to solve one problem from the Part-A and to write and execute 2
questions from the Part-B.
Part-A 60
 HTML/CSS Basics:
 Creating a webpage structure with HTML.
 Styling the webpage using CSS (inline, internal, and external styles).
 Responsive Design:
 Making the webpage responsive using media queries.
 Using frameworks like Bootstrap for responsive design.
 JavaScript Basics:
 Adding interactivity with JavaScript (DOM manipulation, event handling).
 Working with variables, loops, and conditions.
 Frameworks and Libraries:
 Using front-end frameworks React.
 Utilizing libraries such as jQuery for DOM manipulation.
 Introduction to React:
 Create a simple React component that displays "Hello, World!" on the screen.
 Use JSX syntax and explain its advantages over plain JavaScript.
 State and Props:
 Build a component that takes props and renders them.
 Implement state in a component and update it based on user interaction (e.g., button
click).
 Basic Todo App:
Develop a Todo application where users can add, delete, and mark tasks as completed.
Use state to manage the list of tasks.
Using React Router:
 Set up React Router in a project and create multiple pages (e.g., Home, About,
Contact).

Master of Computer Applications Page 10 of 76

  Implement navigation between these pages using Link and NavLink.
 Redux Integration:
 Integrate Redux for state management in a React application.
 Implement actions, reducers, and connect components to Redux store.
 Responsive Design with React Router:
 Build a responsive multi-page application using React Router.
 Ensure layout adjustments for different screen sizes using CSS media queries or
frameworks like Bootstrap.
Part-B 60
1) Implement a simple program demonstrating the creation and synchronization of (Lab hours include
threads or processes. instructions for
2) Design and simulate a memory management system (e.g., paging, segmentation). writing programs
3) Implement algorithms like First Fit, Best Fit, and Worst Fit for memory allocation. and demonstration
by a teacher and for
4) Implement a basic file system with operations like file creation, deletion, reading, and running the
writing.
programs on
5) Compare different file allocation methods (e.g., contiguous allocation, linked computer by
allocation, indexed allocation). students.)
6) Solve synchronization problems such as the producer-consumer problem or dining
philosophers problem using semaphores or mutexes.
7) Implement a solution for deadlock prevention, avoidance, or detection.
8) Profile and analyze the performance of different scheduling algorithms (e.g., FCFS,
SJF, Round Robin) using simulations.
9) Evaluate the impact of caching and paging strategies on system performance.
10) Write a shell script named hello.sh that prints "Hello, World!" to the terminal when
executed.
11) Demonstrate running the script and explain how to make it executable using chmod.
12) Write a script greet_user.sh that prompts the user for their name and then prints a
personalized greeting.
13) Use variables to store user input and demonstrate the use of read command.
14) Create a script check_number.sh that accepts a number as an argument.
15) Check if the number is positive, negative, or zero, and print an appropriate message
using conditional statements (if-else).
16) Develop a script countdown.sh that takes a number as input and prints a countdown
from that number to 1.
17) Use a loop (e.g., while or for) to implement the countdown.
18) Write a script file_info.sh that accepts a filename as an argument.
19) Check if the file exists and whether it is a regular file or directory. Display appropriate
messages based on the checks.
20) Create a script word_count.sh that reads a text file (provided as an argument) and
counts the number of words in the file.
21) Utilize command-line tools like wc and cat for reading and counting words.
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Practicum 30  Practicum 70
 Class Participation: 5 Lab record, Viva-Voce, write-up and execution
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10 of the programs
 Mid-Term Examination: 15
Part C-Learning Resources
Recommended Books/e-resources/LMS:
1) Flanagan, D. (2020). JavaScript: The Definitive Guide. O'Reilly Media.
2) Kogent Learning. (2009). Web Technologies: HTML, JavaScript, PHP, Java, JSP, XML, AJAX – Black Book.
Wiley India Pvt. Ltd.
3) Duckett, J. (2014). JavaScript and jQuery: Interactive Front-End Web Development. Wiley.
4) Robson, E., & Freeman, E. (2014). Head First JavaScript Programming: A Brain-Friendly Guide. O'Reilly
Media.
5) Banks, A., & Chinnathambi, K. (2017). Learning React: Functional Web Development with React and Redux.
O'Reilly Media.
6) Silberschatz, A., Galvin, P. B., & Gagne, G. (2018). Operating System Concepts (10th ed.). Wiley.

Master of Computer Applications Page 11 of 76

 7) Tanenbaum, A. S., & Bos, H. (2014). Modern Operating Systems (4th ed.). Pearson.
8) Stallings, W. (2018). Operating Systems: Internals and Design Principles (9th ed.). Pearson.
9) Love, R. (2013). Linux System Programming (2nd ed.). O'Reilly Media.
10) Nemeth, E., Snyder, G., Hein, T. R., & Whaley, B. (2017). UNIX and Linux System Administration
Handbook (5th ed.). Pearson.
11) Sobell, M. G. (2017). A Practical Guide to Linux Commands, Editors, and Shell Programming (4th ed.).
Pearson.
12) Das, S. (2012). Your UNIX/Linux: The Ultimate Guide (3rd ed.). McGraw-Hill Education.
13) Kerrisk, M. (2010). The Linux Programming Interface: A Linux and UNIX System Programming Handbook.
No Starch Press

Master of Computer Applications Page 12 of 76

 PC-2 PRACTICAL-2
With effect from Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester Ist
Name of the Course Practical-2
Course Code M24-CAP-106
Course Type PC-2
Level of the course 400-499
Pre-requisite for the course (if any)
Course objectives This is a laboratory course and the objective of this course is to acquaint
the students with the understanding and implementation of various data
structures. Also, the students will implement the concepts of
programming with Java.
Course Learning Outcomes (CLO) CLO 1: Solve practical problems related to theory courses undertaken in
After completing this course, the learner the CC-3 and CC-4 from an application point of view.
will be able to: CLO 2: Know how to use and implement the various data structures.
CLO 3: Implement the various features of Java Programming by writing
suitable programs.
CLO 4: Designing and implementing applications in Java.
Credits Theory Practical Total
0 4 4
Teaching Hours per week 0 8 8
Internal Assessment Marks 0 30 30
End Term Exam Marks 0 70 70
Max. Marks 0 100 100
Examination Time 0 4 hours
Part B- Contents of the Course
Practicals Contact
Hours
Practical course will consist of two components Part-A and Part-B. The examiner will set 5 questions at 120
the time of practical examination asking 2 questions from the Part-A and 3 questions from the Part-B
by taking course learning outcomes (CLO) into consideration. The examinee will be required to solve
one problem from the Part-A and to write and execute 2 questions from the Part-B.
Part-A 60
 Task 1: Linked List Implementation
 Implement a singly linked list in a programming language of your choice (e.g., C/C++, Java,
Python).
 Include functions/methods for insertion (at the beginning, end, and specific position), deletion,
and traversal.
 Task 2: Stack Operations
 Implement a stack using an array or linked list.
 Include functions/methods for push, pop, peek, and checking if the stack is empty or full.
 Task 3: Queue Implementation
 Implement a queue using an array or linked list.
 Include functions/methods for enqueue, dequeue, peek, and checking if the queue is empty or
full.
 Task 4: Binary Search Tree (BST) Operations
 Implement a binary search tree (BST) in your chosen programming language.
 Include functions/methods for insertion, deletion, searching for a key, finding minimum and
maximum values, and traversing the tree (inorder, preorder, postorder).
 Task 6: Sorting Algorithms
 Implement at least two sorting and searching algorithms (e.g., selection sort, insertion sort,
merge sort, quick sort).
 Compare their time complexity and performance using different input sizes.
 Task 7: Graph Representation and Algorithms
 Implement an adjacency list representation of a graph.
 Include functions/methods for BFS (Breadth-First Search) and DFS (Depth-First Search)
traversal of the graph.

Master of Computer Applications Page 13 of 76

 Part-B 60
1) Write a Java program that converts temperatures between Celsius and Fahrenheit based on user (Lab hours
input using methods for conversion and input validation. include
2) Implement a Java program to perform matrix addition, multiplication, and transpose operations instructions
using arrays and methods. for writing
3) Develop a Java program that converts a decimal number to its binary, octal, and hexadecimal programs
equivalents using loops and methods. and
demonstrati
4) Create a Java program to simulate a simple bank account management system with features on by a
like deposit, withdrawal, and balance inquiry using classes, objects, and encapsulation.
teacher and
5) Write a Java program that reads a text file, counts the occurrences of each word, and displays for running
the top N most frequent words using HashMap for storage and sorting. the
6) Implement a Java program to generate the first N prime numbers using a combination of loops, programs
methods, and optimizations like the Sieve of Eratosthenes algorithm. on
7) Develop a Java program that takes a month and year as input and prints the calendar for that computer
month using control flow statements and loops for date calculation. by
8) Write a Java program that generates different number patterns like pyramid patterns using students.)
nested loops and methods for pattern printing.
9) Create a Java program to manage an employee payroll system with features for adding
employees, calculating salaries based on hours worked or monthly salary, and generating pay
slips using classes, inheritance, and polymorphism.
10) Implement Java programs to compare the performance of different sorting algorithms (like
quicksort, mergesort, and heapsort) on large arrays of integers, measuring and analyzing time
complexity.
11) Develop a Java program that recursively searches a directory for files matching a given pattern
and displays the file paths using recursion and file handling classes.
12) Write a Java program to perform arithmetic operations (addition, subtraction, multiplication,
division) on large numbers using BigInteger class and exception handling for division by zero.
13) Implement a Java program to solve the Tower of Hanoi problem for N disks using recursion,
demonstrating the steps and movements required.
14) Write a Java program to find the largest and smallest elements in an array.
15) Implement a Java program to sort an array of integers using bubble sort.
16) Create a Java program to find the frequency of each element in an array.
17) Develop a Java program to reverse an array without using an additional array.
18) Write a Java program to merge two sorted arrays into a single sorted array.
19) Define a Java class representing a Student with private instance variables and public getter and
setter methods.
20) Create a Java program to demonstrate constructor overloading in a class.
21) Implement a Java program to calculate the area and perimeter of a rectangle using a class and
object.
22) Develop a Java program to implement inheritance by creating a base class Animal and derived
classes like Dog and Cat.
23) Write a Java program to demonstrate method overriding by implementing a base class Shape
and derived classes like Circle and Rectangle.
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Practicum 30  Practicum 70
 Class Participation: 5 Lab record, Viva-Voce, write-up and execution
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10 of the programs
 Mid-Term Examination: 15
Part C-Learning Resources
Recommended Books/e-resources/LMS:
1) Horowitz, E., & Sahni, S. (2004). Fundamentals of Data Structures. Galgotia Book Source Pvt. Ltd.
2) Samanta, D. (2012). Classic Data Structures (2nd ed.). Prentice-Hall of India Pvt. Ltd., India.
3) Kruse, R., Tondo, C. L., & Leung, B. (2007). Data Structures and Program Design in C (2nd ed.). Prentice-
Hall of India Pvt. Ltd.
4) Weiss, M. A. (2006). Data Structures and Algorithm Analysis in C (2nd ed.). Pearson Education.
5) Balaguruswamy, E. (2009). Programming with JAVA: A Primer. Tata McGraw Hill.

Master of Computer Applications Page 14 of 76

 6) Naughton, P., & Schildt, H. (2002). The Complete Reference Java 2. Tata McGraw Hill.
7) Neimeyer, P., & Peck, J. (1996). Exploring Java. O'Reilly.
8) Hahn, H. (1996). Teach Yourself the Internet. Prentice-Hall of India (P.H.I.).
9) Boone, B., & Stanek, W. (2001). Java 2 Exam Guide. Tata McGraw Hill.

Master of Computer Applications Page 15 of 76

 BC-1 Computer Fundamentals and Problem Solving Through C
With effect from Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 1st
Name of the Course Computer Fundamentals and Problem Solving Through C
Course Code M24-CAP-108
Course Type BC-1
Level of the course (As per Annexure-I 400-499
Pre-requisite for the course (if any) -
The objective of this course is to provide a foundational understanding
of computer systems, including hardware and software components, and
to introduce essential concepts of digital systems, number systems, and
Boolean logic. The course also aims to develop proficiency in
Course Objectives programming using the C language, focusing on control structures,
functions, data structures, and pointers. By the end of the course,
students will be able to apply fundamental programming techniques to
solve computational problems and have a strong grasp of the underlying
principles of digital logic and computing.
CLO-1. Students will be able to explain the basic organization of a
computer and understand the purpose and methods of program planning
using algorithms, flowcharts, and pseudocodes.
CLO-2. Students will develop the ability to represent and manipulate
information using various number systems, binary arithmetic, and
Course Learning Outcomes (CLO) Boolean logic.
After completing this course, the learner will CLO-3. Students will acquire proficiency in programming with the C
be able to: language, including the use of data types, operators, control structures,
and input/output operations.
CLO-4. Students will demonstrate the ability to create modular
programs in C using functions, effectively manage data structures such
as arrays, strings, and files, and work with pointers to manipulate
memory and data efficiently.
Theory Practical Total
Credits
0 0 0
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one
compulsory question by taking course learning outcomes (CLOs) into consideration. The compulsory question
(Question No. 1) will consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5
questions, selecting one question from each unit and the compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Computer Fundamentals: Basics of computers, basic computer organization, storage hierarchy,
storage devices, input-output devices. Computer Software. Introduction to operating systems. 15
I
Planning the computer program: Purpose of program planning, algorithm, flowcharts, decision
tables, pseudocodes.
Digital Fundamentals: Information representation - number systems, number system conversion;
Computer codes - BCD code, EBCDIC code, ASCII, Unicode; Binary arithmetic; Binary logic -
II 15
Boolean algebra, Boolean functions, truth table, simplification of Boolean functions (upto 4
variables only), K-map, digital logic gates.
Elements of C language: C character set, identifiers & keywords, data types: declaration &
definition. Operators: Arithmetic relational, logical, bitwise, unary, assignment and conditional
III operators & their hierarchy & associativity, Data input/output. Control statements: Sequencing, 15
Selection: if and switch statement; iteration: for, while, and do-while loop; break, continue, goto
statement.
IV Functions in C language: Definition, prototype, passing parameters, recursion, Data structure: 15

Master of Computer Applications Page 16 of 76

 arrays, structures, union, string, data files. Pointers: Declaration, operations on pointers, array of
pointers, pointers to arrays.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books:
1) Balagurusamy, E. Programming in ANSI C. 8th ed., McGraw Hill, 2019. ISBN: 9789353165129.
2) Morris Mano, M. Digital Logic and Computer Design. 1st ed., Pearson, 2016. ISBN: 9789332551763.
3) Forouzan, Behrouz A. Fundamentals of Computer Science: Computer Essentials. 3rd ed., Cengage Learning,
2008. ISBN: 9788131512456.
4) Kernighan, Brian W., and Dennis M. Ritchie. The C Programming Language. 2nd ed., Pearson Education,
1988. ISBN: 9780131103627.

Master of Computer Applications Page 17 of 76

 BC-2 PRACTICAL-3
With effect from Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester Ist
Name of the Course Practical-3
Course Code M24-CAP-109
Course Type BC-2
Level of the course 400-499
Pre-requisite for the course (if any)
This course focuses on hands-on experience with computer fundamentals.
They will engage in program planning by creating and testing algorithms,
flowcharts, and pseudocodes. Practical sessions will deepen their
understanding of digital fundamentals through exercises on number
Course objectives
systems, Boolean logic, and binary arithmetic. The course will provide
extensive practice in C programming, allowing students to implement
various data types, control structures, functions, and pointers in real-
world coding tasks.
CLO-1: Design and implement efficient algorithms using flowcharts,
pseudocodes, and decision tables to solve complex problems.
CLO-2: Write C programs that demonstrate a strong understanding of
Course Learning Outcomes (CLO) control structures, data types, and operators to create optimized solutions.
After completing this course, the learner will CLO-3: Develop modular C programs using functions, effectively
be able to: managing code complexity and promoting reusability.
CLO-4: Utilize pointers and data structures in C to enhance program
efficiency and handle dynamic memory management in real-world
applications.
Theory Practical Total
Credits
0 0 0
Teaching Hours per week 0 2 2
Internal Assessment Marks 0 15 15
End Term Exam Marks 0 35 35
Max. Marks 0 50 50
Examination Time 0 4 hours
Part B- Contents of the Course
Practicals Contact Hours
The examiner will set 3 questions at the time of practical examination by taking course
learning outcomes (CLO) into consideration. The examinee will be required to write and 60
execute 2 questions.
1) Implement a program using the conditional (ternary) operator to find the largest of 60
three numbers. (Lab hours include
2) Create a C program that acts as a simple calculator, performing addition, subtraction, instructions for
multiplication, or division based on user input using the switch statement. writing programs
3) Write a program that uses if-else statements to determine whether a given year is a and demonstration
leap year or not. by a teacher and for
running the
4) Develop a C program using a for loop to print the multiplication table of a given programs on
number up to 10.
computer by
5) Write a C program to calculate the factorial of a number using both while and do- students.)
while loops.
6) Implement a program that uses break and continue statements within a loop to skip
printing even numbers and stop the loop if the number exceeds 50.
7) Write a C program with a function that takes an integer as input and returns the square
of the number. Call this function from main().
8) Develop a program that includes a function to calculate the area of a circle given the
radius. Use float as the return type.
9) Create a C program that calculates the nth Fibonacci number using recursion.
10) Write a program that uses a function to find the maximum value in an integer array.
The array should be passed to the function as a parameter.

Master of Computer Applications Page 18 of 76

 11) Implement a program that uses functions to reverse a string and check if the string is a
palindrome.
12) Write a C program that defines a structure to store student details (name, roll number,
marks in three subjects) and calculates the total and average marks. Use a union to
demonstrate memory sharing between different types.
13) Pointers in C Language
14) Pointer Basics: Write a program that demonstrates the use of pointers by printing the
address and value of a variable using both the variable itself and a pointer to the
variable.
15) Create a C program to store an array of strings (names of students) using an array of
pointers. Display the names in reverse order.
16) Implement a program that uses a pointer to a function to pass a function as a
parameter to another function, e.g., passing a function that calculates the square of a
number to another function that prints it.
Suggested Evaluation Methods
Internal Assessment: 15 End Term Examination: 35
 Practicum 15  Practicum 35
 Class Participation: 4
Lab record, Viva-Voce, write-up and execution
 Seminar/Demonstration/Viva-voce/Lab records etc.: 4
of the programs
 Mid-Term Examination: 7
Part C-Learning Resources
Reference Books:
1) Balagurusamy, E. Programming in ANSI C. 8th ed., McGraw Hill, 2019. ISBN: 9789353165129.
2) Morris Mano, M. Digital Logic and Computer Design. 1st ed., Pearson, 2016. ISBN: 9789332551763.
3) Forouzan, Behrouz A. Fundamentals of Computer Science: Computer Essentials. 3rd ed., Cengage Learning,
2008. ISBN: 9788131512456.
4) Kernighan, Brian W., and Dennis M. Ritchie. The C Programming Language. 2nd ed., Pearson Education, 1988.
ISBN: 9780131103627.

Master of Computer Applications Page 19 of 76

 CC-5 Server Side Web Technology
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 2nd
Name of the Course Server Side Web Technology
Course Code M24-CAP-201
Course Type CC-5
Level of the course (As per Annexure-I 400-499
Pre-requisite for the course (if any) -
This course provides an in-depth understanding of web servers,
client-server architecture, and Node.js, focusing on non-blocking I/O,
event-driven programming, and package management. Students will
learn to handle files, build HTTP servers, and manage asynchronous
tasks while mastering error handling and debugging. With Express.js,
Course Objectives
they will design RESTful APIs, implement routing and middleware,
and integrate user authentication. The course also introduces
MongoDB for NoSQL database operations, including CRUD and
indexing, equipping students to build scalable, secure web
applications.
CLO-1: Students will be able to set up a Node.js environment,
understand its non-blocking I/O and event-driven architecture, and
manage packages and modules effectively.
CLO-2: Students will gain the ability to handle files and directories,
create robust HTTP servers, and implement event-driven
Course Learning Outcomes (CLO) programming while managing asynchronous tasks and debugging
After completing this course, the learner errors.
will be able to: CLO-3: Students will be able to develop Express.js applications with
structured routing, middleware, and RESTful APIs, including secure
user authentication using JWT and sessions.
CLO-4: Students will learn to set up and manage MongoDB
databases, perform CRUD operations, and utilize indexes to optimize
query performance for NoSQL applications.
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one
compulsory question by taking course learning outcomes (CLOs) into consideration. The compulsory question
(Question No. 1) will consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5
questions, selecting one question from each unit and the compulsory question. All questions will carry equal
marks.
Contact
Unit Topics
Hours
Introduction to web servers, Client-Server Architecture, Request-Response Cycle, Server-
Side vs. Client-Side. Introduction to Node.js: Overview of Node.js, Non-blocking I/O,
15
I Event-driven architecture, Benefits of using Node.js in the MERN stack. Installing Node.js,
Using Node Package Manager (npm), Creating and managing packages. Modules: Working
with core modules, Creating and importing custom modules, require and exports.
File handling: Reading from and writing to files, Handling directories, Managing
asynchronous tasks efficiently.
Building Web Servers: Creating a basic HTTP server, Handling HTTP requests and
II responses, Understanding request methods (GET, POST, PUT, DELETE). 15
Event-Driven Programming Using EventEmitter, Creating custom events, Handling real-time
data. Error Handling and Debugging: Try-catch blocks, Handling asynchronous errors, Using
debugging tools (e.g., node --inspect, Chrome DevTools).

Master of Computer Applications Page 20 of 76

 Express.js Basics: Introduction to Express.js, Setting up Express projects, Understanding
routing and middleware. Using template engines (e.g., EJS) for server-side rendering,
III Designing RESTful APIs, CRUD operations, Structuring API routes. 15
Built-in middleware (e.g., body-parser), Creating custom middleware, Error handling
middleware. User authentication using JWT (JSON Web Tokens) and sessions.
Introduction to MongoDB: NoSQL vs. SQL databases, Setting up MongoDB locally and on
cloud (e.g., MongoDB Atlas), Document-based NoSQL database, JSON-like documents.
IV Setting Up MongoDB: Installation, creating databases, collections, and documents 15
CRUD Operations in MongoDB: Inserting, querying, updating, deleting documents
Indexes in MongoDB: Creating and using indexes
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books:
1) "Node.js Design Patterns" by Mario Casciaro and Luciano Mammino
2) "Learning Node.js Development" by Andrew Mead
3) "Express in Action" by Evan M. Hahn
4) "REST API Development with Node.js" by Fernando Doglio
5) "MongoDB: The Definitive Guide" by Shannon Bradshaw, Eoin Brazil, and Kristina Chodorow
6) "Learning MongoDB" by Amit Phaltankar, Juned Ahsan, and Michael Harrison

Master of Computer Applications Page 21 of 76

 CC-6 Computer Network
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 2nd
Name of the Course Computer Network
Course Code M24-CAP-202
Course Type CC-6
Level of the course (As per Annexure-I 400-499
Pre-requisite for the course (if any) -
The course aims to provide a comprehensive understanding of
network characterization, design issues, and service models, focusing
on the OSI and TCP/IP reference models and their practical
applications. It covers data communication concepts, including
performance parameters, transmission media, modulation techniques,
and switching methods, emphasizing the role of wired and wireless
Course Objectives networks. The course delves into the data link layer, exploring
protocols, error detection, media access, and IEEE standards,
alongside advancements in wireless technologies like Wi-Fi, Wi-
Max, and Bluetooth. It further examines the transport and network
layers, addressing routing algorithms, congestion control, and QoS
mechanisms, with a detailed focus on IPv4, IPv6, and protocols like
TCP and UDP.
CLO-1: characterize various types of computer networks and
standards along with an insight into the principles of networking by
using protocol layering of the Internet and the TCP/IP protocol suite.
CLO-2: comprehend the notion of data communication and its
Course Learning Outcomes (CLO)
related functional components and aspects.
After completing this course, the learner
CLO-3: understand design issues related to Local area Networks and
will be able to:
get acquainted with the prevailing wired and wireless LAN
technology standards.
CLO-4: get versed with the routing, addressing, congestion control,
and security issues in Networks and the Internet architecture .
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one
compulsory question by taking course learning outcomes (CLOs) into consideration. The compulsory question
(Question No. 1) will consist at least 4 parts covering entire syllabus. The examinee will be required to attempt
5 questions, selecting one question from each unit and the compulsory question. All questions will carry equal
marks.
Contact
Unit Topics
Hours
Network Characterization: Goals and Applications; Categorization according to Size,
Purpose, Design issues & Transmission Technologies; Network Architecture and Service
Models; Design issues for the Layers; Reference Models: OSI and TCP/IP; Functions of
layers and protocols of TCP/IP; Comparison of OSI & TCP/IP ; Data Transmission using
TCP/IP; 15
I
Networking Models & Applications: Centralized, Decentralized, and Distributed; Client-
Server and Peer-to-Peer; File sharing & Web- based; Content Distribution Networks;
Introduction to Example Networks: The Internet and its Conceptual View ; Internet Ser-
vices; Accessing The Internet; Connection-Oriented Networks: X.25, Frame Relay and
ATM;
II Data Communication Concepts & Components: Digital and Analog Data and Signals, 15

Master of Computer Applications Page 22 of 76

 Asynchronous and Synchronous transmission; bit rate & baud, bandwidth & Channel
Capacity; Nyquist Bit Rate, Shannon Capacity; Network Performance Parameters;
Transmission Impairment;
Connecting Devices & Transmission Media: Network Interface Cards, Connectors, Hubs,
Transceivers & Media Connectors; Link-Layer Switches, Bridge, Routers, Gateways,
Virtual LANs; Guided Transmission Media; Wireless transmission; Satellite
communication;
Data Encoding & Modulation Techniques: NRZ, NRZ-I, Manchester and Differential
Manchester encoding; 4B/5B ; Pulse Code Modulation & Delta Modulation; Digital to
Analog encoding;
Switching and Bandwidth Utilization: Methods of Switching; Virtual Circuit & Datagram
Networks; Multiplexing; Spread Spectrum;
Wired Networks and the Local Loop: Telephone Networks; Modems; Broadband and
ADSL; ADSL Versus Cable; Hybrid Fiber-Coaxial Network ; Fiber-to-the-Home
Broadband;
Data Link Layer: Communication at the Data Link Layer; Nodes and Links; Link Layer
Addressing; Examples of Data Link layer protocols;
Design Issues: Framing techniques; Error Detection and Correction; Sliding Window Flow
Control Protocols;
Media Access Control: Random Access: Aloha, CSMA , CSMA/CD; Collision free
protocols with Controlled Access; Wavelength Division Multiple access for Fiber-Optic Data
III 15
Communication;
IEEE LAN standards: Ethernet (Physical specifications, Encoding, Frame Format & MAC
protocol); Binary Exponential Backoff algorithm;
Introduction to Wireless Networks: IEEE 802.11 Wireless LAN; Wi-Max; Wireless LAN
Protocol: MACA; Bluetooth and other wireless PAN technologies; Cellular Networks:
Generations; GSM, CDMA, LTE.
Transport layer : Addressing, Services and Protocols; TCP and UDP services & header
formats;
Network Layer : Services, Routing Algorithms: Shortest Path Routing, Flooding ,
Distance Vector Routing, Link State Routing, Hierarchical Routing, Multi Cast Routing,
Routing for Mobile hosts;
Network Layer in TCP/IP: Basic characteristics of IP protocol; addressing and header
IV 15
format of IPv4 ; IPv6;
Congestion Control & Quality of Service: General Principals; Congestion control in
Virtual – Circuit Subnets; Congestion Control in Datagram Subnets: Choke packets, Load
Shedding; Random Early Detection, Jitter Control; Over provisioning, Buffering, Traffic
Shaping, Leaky Bucket, Token Bucket, Resource Reservation, Admission Control, Packet
Scheduling;
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books:
1) Andrew S. Tanenbaum, Computer Networks, 4th Edition - PHI.
2) Behrouz A Forouzan, Data Communications and Networking, 5th Edition- Mc-Graw Hill Education.
3) Michael A. Gallo, William M. Hancock, Computer Communications and Networking Technologies –
CENGAGE learning.
4) William Stallings, Data and Computer Communications, 5th Edition – PHI.

Master of Computer Applications Page 23 of 76

 CC-7 Database Management Systems
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 2nd
Name of the Course Database Management Systems
Course Code M24-CAP-203
Course Type CC-7
Level of the course (As per Annexure-I 400-499
Pre-requisite for the course (if any) -
This course provides a comprehensive understanding of database
concepts, including the three-schema architecture, relational models,
and the ER model. It covers SQL and PL/SQL for database
management, exploring queries, constraints, and advanced functions.
Course Objectives Students will learn relational algebra, normalization techniques, and
query optimization to enhance database design and performance. The
course also addresses transaction processing, concurrency control,
and database recovery, emphasizing reliability, consistency, and
security in database systems.
CLO-1: Understand and apply the three-schema architecture, data
independence, and entity-relationship modeling to design effective
database schemas.
CLO-2: Develop and execute SQL and PL/SQL queries, including
advanced operations like joins, constraints, triggers, and aggregate
Course Learning Outcomes (CLO)
functions, for robust database management.
After completing this course, the learner
CLO-3: Analyze relational algebra operations and apply
will be able to:
normalization techniques to optimize database structure and ensure
data integrity.
CLO-4: Demonstrate knowledge of transaction processing,
concurrency control methods, and database recovery techniques to
maintain database reliability and security.
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one
compulsory question by taking course learning outcomes (CLOs) into consideration. The compulsory question
(Question No. 1) will consist at least 4 parts covering entire syllabus. The examinee will be required to attempt
5 questions, selecting one question from each unit and the compulsory question. All questions will carry equal
marks.
Contact
Unit Topics
Hours
Database System Concepts and Architecture: Three - Schema Architecture and Data Inde-
pendence, Entity Relationship Model: Entity Types, Entity Sets, Attributes & keys, Relation- 15
I
ships Types & instances ER Diagrams, Naming conventions and Design Issues. Relational
Model Constraints, Concept of Keys.
SQL: Data Definition and Data Types, DDL, DML, and DCL, Join Operations, Views &
Queries in SQL, Specifying Constraints & Indexes in SQL, aggregate functions - min, max,
II 15
count, average, sum. Group by, Order by and Having clauses, PL/SQL: Architecture of PL/
SQL, Basic Elements of PL/SQL, PL/SQL Transactions, Cursors and Triggers.
Relational Algebra: Unary and Binary Relational Operations, Functional Dependencies, Nor-
mal Forms Based on Primary Keys- (1NF, 2NF, 3NF, BCNF), Multi-valued Dependencies, 4
III 15
NF, Join dependencies, 5 NF, Domain Key Normal Form. Query Processing and Optimiza-
tion
IV Transaction Processing Concepts: Introduction to Transaction Processing, Transaction & 15

Master of Computer Applications Page 24 of 76

 System Concepts, Properties of Transaction, Schedules and Recoverability, Serializability of
Schedules. Concurrency Control Techniques: Locking Techniques, Time stamp ordering,
Multi-version Techniques, Database backup, recovery and security.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books:
1) Date C.J., An Introduction to Database Systems, Pearson Education.
2) Hector G.M., Ullman J.D., Widom J., Database Systems: The Complete Book, Pearson Education.
3) Silberschatz A., Korth H., Sudarshan S., Database System Concepts, McGraw Hill.

Master of Computer Applications Page 25 of 76

 CC-8 Artificial Intelligence
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 2nd
Name of the Course Artificial Intelligence
Course Code M24-CAP-204
Course Type CC-8
Level of the course (As per Annexure-I 400-499
Pre-requisite for the course (if any) -
The course aims to provide a comprehensive introduction to the
concepts, theories, and applications of Artificial Intelligence (AI),
enabling students to understand various knowledge representation
techniques using propositional logic, predicate logic, and fuzzy logic.
Course Objectives It also introduces search techniques for problem-solving, covering
uninformed, informed, and game-playing strategies. Additionally, the
course explores the functioning of production systems, expert
systems, genetic algorithms, and machine learning techniques,
offering students practical insights into their applications in AI.
CLO-1 Demonstrate an understanding of the foundational concepts
of AI, its historical development, and the distinction between Strong
AI and Weak AI.
CLO-2 Apply propositional logic, predicate logic, and fuzzy logic
for knowledge representation and reasoning in AI systems.
Course Learning Outcomes (CLO)
CLO-3 Implement various search algorithms such as BFS, DFS, A*,
After completing this course, the learner
and Minimax to solve complex AI problems, including two-player
will be able to:
games.
CLO-4 Explain and apply machine learning algorithms including
supervised (e.g., neural networks, decision trees) and unsupervised
(e.g., k-means, PCA) techniques for data analysis and AI
applications.
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one
compulsory question by taking course learning outcomes (CLOs) into consideration. The compulsory question
(Question No. 1) will consist at least 4 parts covering entire syllabus. The examinee will be required to attempt
5 questions, selecting one question from each unit and the compulsory question. All questions will carry equal
marks.
Contact
Unit Topics
Hours
Definition, history, and evolution of AI, Strong AI vs. Weak AI, Applications of AI;
Knowledge Representation using logic: Propositional logic: syntax, semantics, truth tables,
15
I logical connectives, inference rules, Predicate logic: first-order logic, quantifiers, predicates,
clausal form and unification; Fuzzy logic: fuzzy sets, membership functions, fuzzy
reasoning.
Search Techniques: Problem formulation: state space representation, Uninformed Search
Strategies: Breadth-First Search, Depth-First Search (DFS), Iterative Deepening DFS;
II Informed Search Strategies: Hill climbing, Best-first search, A* algorithm, admissibility, 15
monotonicity, and informedness, Search in Two-Player Games: Minimax algorithm, Alpha-
Beta pruning.
III Production Systems: rules, working memory, and control strategies, forward chaining and 15
backward chaining, commutative and non-commutative production systems, Expert
Systems: Definition and characteristics, Architecture, Applications;

Master of Computer Applications Page 26 of 76

 Genetic Algorithms: Components of GAs: chromosomes, crossover, mutation, selection,
replacement, Fitness functions and evolution processes, GA vs. traditional problem-solving
techniques
Machine Learning (ML): Definition and importance, Types: supervised, unsupervised,
reinforcement learning; Supervised Learning: Linear regression, Decision Trees, k-Nearest
IV Neighbors (k-NN), Neural networks: introduction, perceptron, multilayer networks, back- 15
propagation, Unsupervised Learning: Algorithms: k-Means clustering, Hierarchical
clustering, Principal Component Analysis.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books:
1) Luger, G. F. (2009). Artificial Intelligence: Structures and Strategies for Complex Problem Solving (6th
ed.). Pearson Education.
2) Russell, S., & Norvig, P. (2010). Artificial Intelligence: A Modern Approach (3rd ed.). Prentice Hall.
3) Rich, E., Knight, K., & Nair, S. B. (2017). Artificial Intelligence (3rd ed.). McGraw-Hill Education.
4) Coppin, B. (2004). Artificial Intelligence Illuminated. Narosa Publishing House.

Master of Computer Applications Page 27 of 76

 PC-3 PRACTICAL-4
With effect from Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 2nd
Name of the Course Practical-4
Course Code M24-CAP-205
Course Type PC-3
Level of the course 400-499
Pre-requisite for the course (if any)
Course objectives This course aims to provide hands-on experience in building web
applications and understanding networking concepts. Part A focuses on
mastering server-side development with Node.js and Express.js, enabling
students to design efficient applications integrated with databases like
MongoDB. Part B emphasizes networking principles, offering insights
into data transmission, error detection, routing, and network protocols
through programming and simulation, preparing students for real-world
applications in web development and network administration.
Course Learning Outcomes (CLO) CLO-1: and implement server-side applications using Node.js and
After completing this course, the learner will Express.js, including handling HTTP methods, managing file operations,
be able to: and building RESTful APIs integrated with MongoDB for CRUD
operations and authentication.
CLO-2: Demonstrate the ability to use Node.js core modules, custom
modules, middleware, and debugging tools to build dynamic, efficient,
and error-resilient web applications.
CLO-3: Analyze and implement networking concepts and protocols,
including OSI and TCP/IP models, socket programming, and data
transmission methods, using Python or C++.
CLO-4: Apply algorithms and techniques in networking, such as error
detection (CRC), routing (Dijkstra’s algorithm), and flow control
protocols (Go-Back-N, Selective Repeat), through programming and
simulation tools.
Credits Theory Practical Total
0 4 4
Teaching Hours per week 0 8 8
Internal Assessment Marks 0 30 30
End Term Exam Marks 0 70 70
Max. Marks 0 100 100
Examination Time 0 4 hours
Part B- Contents of the Course
Practicals Contact Hours
Practical course will consist of two components Part-A and Part-B. The examiner will set 5 120
questions at the time of practical examination asking 3 questions from the Part-A and 2
questions from the Part-B by taking course learning outcomes (CLO) into consideration. The
examinee will be required to solve one problem from the Part-A and one from the Part-B.
Part-A 60
1) Set up a simple HTTP server in Node.js that responds with "Hello, World!" when
accessed via a browser.
2) Illustrate the client-server architecture by creating a basic web application that sends a
request to the server and displays the response in the browser.
3) Implement a program to demonstrate the request-response cycle by logging HTTP
request headers and returning a JSON response.
4) Compare server-side and client-side operations by creating a simple application where
the server processes data and the client displays it.
5) Install Node.js and initialize a new project using npm. Create and manage packages
using package.json.
6) Write a program using Node.js core modules like fs and os to read system information
and save it to a file.
7) Create a custom module for string manipulation (e.g., reversing, converting to

Master of Computer Applications Page 28 of 76

 uppercase) and use it in a Node.js script.
8) Write a Node.js program to read and write data to a text file asynchronously, logging
success or error messages to the console.
9) Create a script to list all files and directories in a specified folder and display them
hierarchically.
10) Implement a program that manages a directory: creating it if it doesn’t exist, adding
files, and deleting files.
11) Build a basic HTTP server in Node.js that supports different HTTP methods (GET,
POST, PUT, DELETE) and logs each request.
12) Create a server that serves static files (e.g., HTML, CSS, JS) from a public directory.
13) Use the EventEmitter class to create and emit custom events, such as notifying users
when a file operation is completed.
14) Implement a real-time data handler using events, simulating a live stock ticker system.
15) Create a script that performs file operations and uses try-catch blocks to handle file-
not-found errors gracefully.
16) Debug a Node.js script using node --inspect and Chrome DevTools, identifying and
fixing a logical error.
17) Create a basic Express.js application to handle routing for /home, /about, and /contact
with respective responses.
18) Develop a RESTful API using Express.js to manage a list of books (CRUD
operations).
19) Set up a server-side rendering engine (EJS) to dynamically generate HTML pages
with user data.
20) Implement custom middleware in an Express.js application to log request details and
handle errors.
21) Implement a JWT-based authentication system for a RESTful API, allowing users to
register and log in.
22) Create an Express.js application to demonstrate session management for user login
and logout.
23) Install MongoDB locally and create a database called school. Add a students
collection and insert sample documents.
24) Use MongoDB Atlas to create a cloud-hosted database and connect to it using
Node.js.
25) Write a script to query MongoDB for documents with specific conditions, such as
retrieving students with grades above 80.
26) Develop a Node.js script to perform CRUD operations on a products collection in
MongoDB.
27) Create an Express.js application that connects to MongoDB and exposes APIs for
CRUD operations on a tasks collection.
28) Add indexes to a MongoDB collection and demonstrate their impact on query
performance by measuring execution time before and after indexing.
29) Write a script that creates a compound index on multiple fields in a collection and
tests its effectiveness with specific queries.
Part-B 60
1) Compare the OSI and TCP/IP reference models by creating a document that maps the (Lab hours include
functionality of each layer. instructions for
2) Develop a Python script to simulate data transmission using TCP/IP sockets between a writing programs
client and server. and demonstration
3) Write a program to calculate Nyquist Bit Rate and Shannon Capacity for a given set of by a teacher and for
inputs (bandwidth, signal levels, noise). running the
programs on
4) Implement 4B/5B encoding for a given binary sequence using Python or C++. computer by
5) Implement time-division multiplexing for multiple signals using Python. students.)
6) Compare ADSL and cable broadband connections by analyzing speed, latency, and
reliability.
7) Simulate and test the operation of sliding window flow control protocols (Go-Back-N
and Selective Repeat).
8) Write a program to implement error detection using CRC (Cyclic Redundancy Check).
9) Implement the Binary Exponential Backoff algorithm and simulate its role in collision

Master of Computer Applications Page 29 of 76

 resolution.
10) Implement a shortest path routing algorithm (e.g., Dijkstra’s algorithm) to find the
optimal path in a simulated network.
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Practicum 30  Practicum 70
 Class Participation: 5 Lab record, Viva-Voce, write-up and execution
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10 of the programs
 Mid-Term Examination: 15
Part C-Learning Resources
Recommended Books/e-resources/LMS:
1) "Node.js Design Patterns" by Mario Casciaro and Luciano Mammino
2) "Learning Node.js Development" by Andrew Mead
3) "Express in Action" by Evan M. Hahn
4) "REST API Development with Node.js" by Fernando Doglio
5) "MongoDB: The Definitive Guide" by Shannon Bradshaw, Eoin Brazil, and Kristina Chodorow
6) "Learning MongoDB" by Amit Phaltankar, Juned Ahsan, and Michael Harrison
7) Andrew S. Tanenbaum, Computer Networks, 4th Edition - PHI.
8) Behrouz A Forouzan, Data Communications and Networking, 5th Edition- Mc-Graw Hill Education.

Master of Computer Applications Page 30 of 76

 PC-4 PRACTICAL-5
With effect from Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 2nd
Name of the Course Practical-5
Course Code M24-CAP-206
Course Type PC-4
Level of the course 400-499
Pre-requisite for the course (if any)
Course objectives The primary objective of this course is to equip students with the theoretical
knowledge and practical skills necessary to solve complex computational
problems. Through Part A, students will gain expertise in database design,
implementation, and optimization, leveraging advanced SQL and PL/SQL
techniques. Part B focuses on problem-solving using search algorithms, state-
space representations, and optimization methods such as Genetic Algorithms,
enabling students to tackle challenges in AI and operations research efficiently.
Course Learning Outcomes (CLO) CLO-1: Analyze, design, and implement database schemas for real-world
After completing this course, the learner will applications such as library management, hospital management, and e-commerce
be able to: systems, while applying concepts of ER diagrams, relational schema,
normalization, and functional dependencies.
CLO-2: Demonstrate the ability to write and optimize SQL queries, implement
advanced database features such as views, indexes, triggers, cursors, and perform
database operations using relational algebra and PL/SQL programming.
CLO-3: Formulate and implement state-space representations, search algorithms
(BFS, DFS, Iterative Deepening DFS), and production systems to solve complex
problems like puzzles, mazes, and water-jug problems.
CLO-4: Design and develop solutions using Genetic Algorithms by encoding
chromosomes, defining fitness functions, and applying these techniques to solve
optimization problems like the Travelling Salesman Problem (TSP) and
mathematical function maximization.
Credits Theory Practical Total
0 4 4
Teaching Hours per week 0 8 8
Internal Assessment Marks 0 30 30
End Term Exam Marks 0 70 70
Max. Marks 0 100 100
Examination Time 0 4 hours
Part B- Contents of the Course
Practicals Contact Hours
Practical course will consist of two components Part-A and Part-B. The examiner will set 5 questions at 120
the time of practical examination asking 3 questions from the Part-A and 2 questions from the Part-B by
taking course learning outcomes (CLO) into consideration. The examinee will be required to write and
execute 2 questions from the Part-A and one from the Part-B.
Part-A 60
1) Create an ER diagram for a library management system that includes entity types, attributes, keys,
relationships, and instances.
2) Convert the ER diagram into relational schemas and define the primary and foreign keys.
3) Implement a database schema in a DBMS for an e-commerce application. Define the constraints,
such as NOT NULL, UNIQUE, CHECK, and FOREIGN KEY.
4) Create a database for a hospital management system. Define tables for doctors, patients,
appointments, and prescriptions.
5) Perform basic operations such as inserting, updating, and deleting records.
6) Write queries to retrieve data from multiple tables using INNER JOIN, LEFT JOIN, RIGHT
JOIN, and FULL OUTER JOIN.
7) Create a query to find patients who have visited a specific doctor using JOIN.
8) Create a view to display the total number of patients attended by each doctor.
9) Add an index to optimize the search for patients by their last names.

Master of Computer Applications Page 31 of 76

 10) Write a PL/SQL program to implement a banking transaction system that transfers money
between two accounts. Use COMMIT and ROLLBACK statements.
11) Create a cursor to fetch and display all overdue book records from a library database.
12) Develop a trigger to automatically update the stock count when a new product is added to an
inventory database.
13) Write and execute queries in relational algebra for the following operations: selection, projection,
union, intersection, difference, Cartesian product, and join for a student database.
14) Identify functional dependencies in a given database (e.g., a university database).
15) Normalize the database to 1NF, 2NF, 3NF, and BCNF, showing each step of decomposition.
16) Write an inefficient query for fetching data from a large database. Use EXPLAIN PLAN to
analyze it and optimize the query using indexes and appropriate joins.

Part-B 60
1) Formulate a state-space representation for the "8-puzzle problem." Represent states, actions, and (Lab hours
transitions clearly and define the goal state. include
2) Implement Breadth-First Search (BFS) to solve a maze where the start and goal positions are instructions for
specified. writing programs
3) Use Depth-First Search (DFS) to navigate through a graph of cities and find a path from a given and
source to a destination. demonstration by
a teacher and for
4) Apply Iterative Deepening DFS to solve a water-jug problem (e.g., measure exactly 4 liters using running the
a 3-liter and a 5-liter jug).
programs on
5) Develop a production system to solve the "Tower of Hanoi" problem. computer by
6) Write a program to implement a Genetic Algorithm to maximize a mathematical function (e.g., students.)
f(x)=x2,0≤x≤31). Demonstrate the use of binary encoding for chromosomes.
7) Define a fitness function for solving the "Travelling Salesman Problem (TSP)" using a Genetic
Algorithm.
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Practicum 30  Practicum 70
 Class Participation: 5 Lab record, Viva-Voce, write-up and execution of the
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10 programs
 Mid-Term Examination: 15
Part C-Learning Resources
Recommended Books/e-resources/LMS:
1) Silberschatz A., Korth H., Sudarshan S., Database System Concepts, McGraw Hill.
2) Luger, G. F. (2009). Artificial Intelligence: Structures and Strategies for Complex Problem Solving (6th ed.). Pearson
Education.

Master of Computer Applications Page 32 of 76

 BC-3 Mathematical Foundations for Computer Science
With effect from Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 2nd
Name of the Course Mathematical Foundations for Computer Science
Course Code M24-CAP-207
Course Type BC-3
Level of the course (As per Annexure-I 400-499
Pre-requisite for the course (if any) -
The objective of this paper is to make the students familiar with the commonly
Course Objectives
used mathematics and statistics in the field of computer science.
CLO-1: Students will be able to apply set theory, relations, and functions to
solve problems in discrete mathematics, including the use of pigeonhole
principles and recursive functions.
CLO-2: Students will demonstrate proficiency in performing matrix operations,
solving systems of linear equations, and applying numerical methods for
Course Learning Outcomes (CLO)
interpolation, integration, and differentiation.
After completing this course, the learner will
CLO-3: Students will develop the ability to organize, analyze, and interpret data
be able to:
using measures of central tendency, dispersion, and statistical visualization
techniques.
CLO-4: Students will gain the ability to model relationships between variables
using regression and correlation analysis, and apply probability principles,
including Bayes' theorem, to real-world scenarios.
Theory Practical Total
Credits
0 0 0
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one compulsory
question by taking course learning outcomes (CLOs) into consideration. The compulsory question (Question No. 1) will
consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5 questions, selecting one question
from each unit and the compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Sets: Set theory: Basic concept, set types, set operations, cardinality, and notation. Relations: Relations and
its representations, Properties of binary relation –Reflexive, symmetric, Asymmetric, transitive,
Equivalence, Inverse & Composition of a relation, closure of relations, its types, Partial ordering relation, 15
I
Hasse diagram, minimal elements, upper bound, lower bound, Lattices Functions: definition, floor
functions, ceiling functions, surjective, injunctive and bijective functions, Inverse Function, Composition
of functions, recursive Functions, Pigeon hole principles and its application.
Addition and multiplication of matrices, Laws of matrix algebra, Singular and non-singular matrices,
Inverse of a matrix, Systems of linear equations, Eigen values and Eigen vectors, Diagonalization of a
II 15
square matrix.
Interpolation, Numerical Integration and Differentiation.
Statistical Methods: Definition and scope of Statistics, concepts of statistical population and sample. Data:
Quantitative and qualitative, attributes, variables, scales of measurement nominal, ordinal, interval and
ratio. Presentation: tabular and graphical, including histogram and ogives. Measures of Central Tendency:
Mean, Median, Mode. Measures of Dispersion: range, quartile deviation, mean deviation, standard
deviation, coefficient of variation, Moments, skewness and kurtosis. Statistical Methods: Definition and
III 15
scope of Statistics, concepts of statistical population and sample. Data: Quantitative and qualitative,
attributes, variables, scales of measurement nominal, ordinal, interval and ratio. Presentation: tabular and
graphical, including histogram and ogives. Measures of Central Tendency: Mean, Median, Mode. Measures
of Dispersion: range, quartile deviation, mean deviation, standard deviation, coefficient of variation,
Moments, skewness and kurtosis.
IV Bivariate data: Definition, scatter diagram, simple, partial and multiple correlation (3 variables only), rank 15
correlation. Simple linear regression, principle of least squares and fitting of polynomials and exponential

Master of Computer Applications Page 33 of 76

 curves.
Probability: Introduction, random experiments, sample space, events and algebra of events. Definitions of
Probability – classical, statistical, and axiomatic. Conditional Probability, laws of addition and
multiplication, independent events, theorem of total probability, Bayes’ theorem and its applications.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books:
1) Gupta, S. C. and Kapoor, V.K. : Fundamentals Of Mathematical Statistics, Sultan Chand &Sons
2) Seymour Lipschutz, Marc Lars Lipson, Discrete mathematics, McGraw-Hill international editions, Schaum's series.
3) V. Rajaraman, Computer-Oriented Numerical Methods., PHI Reference Books:
4) Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw – Hill
5) Hogg, R.V., Tanis, E.A. and Rao J.M. : Probability and Statistical Inference, Seventh Ed, Pearson Education, New
Delhi.
6) Goon A.M., Gupta M.K. and Dasgupta B. (2002): Fundamentals of Statistics, Vol. I & II, The World Press, Kolkata.
7) Babu Ram: Discrete Mathematics
8) Shanti Narayana : Differential & Integral calculus

Master of Computer Applications Page 34 of 76

 BC-4 PRACTICAL-6
With effect from Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 2nd
Name of the Course Practical-6
Course Code M24-CAP-208
Course Type BC-4
Level of the course 400-499
Pre-requisite for the course (if any)
The course aims to equip students with the ability to implement fundamental
concepts of sets, relations, and functions using programming techniques. It focuses
on developing skills for performing matrix operations, solving linear equations,
Course objectives
and applying numerical methods through programming. Additionally, it enables
students to analyze statistical data, apply probability concepts, and perform
regression analysis using computational tools.
CLO-1: Students will be able to implement fundamental concepts of set theory,
relations, and functions, including operations, properties, and representations, to
solve real-world problems using programming techniques.
CLO-2: Students will be able to perform matrix operations, solve systems of
linear equations, and apply numerical techniques such as interpolation, integration,
Course Learning Outcomes (CLO)
and differentiation through programming exercises.
After completing this course, the learner will
CLO-3: Students will be able to analyze and represent data using statistical
be able to:
measures, including measures of central tendency, dispersion, and graphical tools,
and interpret the results effectively.
CLO-4: Students will be able to apply probability theories, Bayes’ theorem, and
regression analysis to model and solve problems involving uncertainty and
bivariate data using programming tools.
Theory Practical Total
Credits
0 0 0
Teaching Hours per week 0 2 2
Internal Assessment Marks 0 15 15
End Term Exam Marks 0 35 35
Max. Marks 0 50 50
Examination Time 0 4 hours
Part B- Contents of the Course
Contact
Practicals
Hours
The examiner will set 3 questions at the time of practical examination by taking course learning outcomes
60
(CLO) into consideration. The examinee will be required to write and execute 2 questions.
1) Set Operations: Write a program to perform union, intersection, difference, and symmetric difference 60
on two sets. (Lab hours
2) Cardinality: Implement a program to calculate the cardinality of a given set. include
3) Binary Relation Properties: Write a program to check whether a given binary relation is reflexive, instructions
symmetric, asymmetric, or transitive. for writing
programs
4) Hasse Diagram: Create a program to generate a Hasse diagram for a partial ordering relation. and
5) Lattices: Write a program to verify whether a given set with a partial order forms a lattice. demonstratio
6) Functions: Implement a program to check whether a function is injective, surjective, or bijective. n by a
7) Recursive Functions: Write a program to compute the factorial of a number using recursion and apply teacher and
it to solve problems using pigeonhole principles. for running
8) Pigeonhole Principle: Write a program to prove the pigeonhole principle for a given input set. the programs
9) Matrix Operations: Write a program to add, subtract, and multiply two matrices. on computer
10) Inverse of a Matrix: Implement a program to find the inverse of a square matrix using Gauss-Jordan by students.)
elimination.
11) Eigenvalues and Eigenvectors: Write a program to compute the eigenvalues and eigenvectors of a
square matrix.
12) System of Linear Equations: Create a program to solve a system of linear equations using Gaussian
elimination.

Master of Computer Applications Page 35 of 76

 13) Diagonalization: Write a program to diagonalize a square matrix if possible.
14) Interpolation: Implement a program to perform Lagrange or Newton interpolation for a given set of
points.
15) Numerical Integration: Write a program to compute the definite integral of a function using the
trapezoidal or Simpson's rule.
16) Numerical Differentiation: Create a program to find the derivative of a function using finite difference
methods.
17) Data Presentation: Write a program to create a histogram and ogive for a given data set.
18) Measures of Central Tendency: Implement a program to calculate mean, median, and mode for a given
data set.
19) Measures of Dispersion: Write a program to compute range, quartile deviation, mean deviation,
standard deviation, and coefficient of variation for a data set.
20) Moments, Skewness, and Kurtosis: Create a program to calculate the moments of a distribution and
determine its skewness and kurtosis.
21) Tabular Representation: Write a program to present data in tabular form based on user input
(quantitative or qualitative).
22) Scatter Diagram: Write a program to generate a scatter plot for bivariate data and compute the
correlation coefficient.
23) Regression: Implement a program to compute the equation of a simple linear regression line and
predict values based on the model.
24) Polynomial Fitting: Write a program to fit a polynomial curve using the principle of least squares.
25) Exponential Curve Fitting: Create a program to fit an exponential curve to a given data set.
26) Probability Calculations: Write a program to compute probabilities using classical, statistical, and
axiomatic definitions.
27) Conditional Probability: Implement a program to calculate conditional probability and verify the laws
of addition and multiplication.
28) Bayes’ Theorem: Write a program to solve problems using Bayes' theorem.
29) Random Events Simulation: Create a program to simulate random experiments, generate a sample
space, and calculate probabilities.
Suggested Evaluation Methods
Internal Assessment: 15 End Term Examination: 35
 Practicum 15  Practicum 35
 Class Participation: 4
Lab record, Viva-Voce, write-up and execution of the
 Seminar/Demonstration/Viva-voce/Lab records etc.: 4
programs
 Mid-Term Examination: 7
Part C-Learning Resources
Reference Books:
1) Gupta, S. C. and Kapoor, V.K. : Fundamentals Of Mathematical Statistics, Sultan Chand &Sons
2) Seymour Lipschutz, Marc Lars Lipson, Discrete mathematics, McGraw-Hill international editions, Schaum's series.
3) V. Rajaraman, Computer-Oriented Numerical Methods., PHI Reference Books:
4) Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw – Hill
5) Hogg, R.V., Tanis, E.A. and Rao J.M. : Probability and Statistical Inference, Seventh Ed, Pearson Education, New
Delhi.
6) Goon A.M., Gupta M.K. and Dasgupta B. (2002): Fundamentals of Statistics, Vol. I & II, The World Press, Kolkata.
7) Babu Ram: Discrete Mathematics
8) Shanti Narayana : Differential & Integral calculus

Master of Computer Applications Page 36 of 76

 CHM/M24-CHM-201
Session: 2024-25
Part A - Introduction
Name of Programme MCA
Semester 2nd
Name of the Course Constitutional, Human and Moral Values, and IPR
Course Code M24-CHM-201
Course Type CHM
Level of the course 400-499
Pre-requisite for the course (if an )
CLO 1: Learn the different Constitutional Values, Fundamental rights
and duties enshrined in the Indian Constitution.
CLO 2: Understand humanism, human virtues and values, and ide of
Course Learning Outcomes (CLO) International peace.
After completing this course, the learner will be CLO 3: Grasp the basic concepts of Moral Values and Professional
able to: Conduct which are required to become a part of the civil society and for
developing professionalism.
CLO 4: Understand concepts of Intellectual Property Rights, Copyright,
Patent, Trademark etc., and about threats of Plagiarism.
Theory Tutorial Total
Credits
2 2
Teaching Hours per week 2 2
Internal Assessment Marks 15 15
End Term Exam Marks 35 35
Max. Marks 50 50
Examination Time 3 3
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one
compulsory question by taking course learning outcomes (CLOs) into consideration. The compulsory question (Question
No. 1) will consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5 questions,
selecting one question from each unit and the
compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Constitutional Values: Historical Perspective of Indian Constitution; Basic Values enshrined in the
Preamble of the Indian Constitution; Concept of Constitutional Morality; Patriotic Values and
I 8
Ingredients of Nation Building; Fundamental Rights and Duties ; Directive Principles of the State
Policy.
Humanistic Values: Humanism, Human Virtues and Civic Sense; Social Responsibilities of
II Human Beings; Ethical ways to deal with human aspirations; Harmony with society and nature; 7
Idea of International Peace and Brotherhood (Vasudhaiv Kutumbkam).
Moral Values and Professional Conduct: Understanding Morality and Moral Values; Moral
Education and Character Building; Ethics of Relations: Personal, Social and Professional;
III 8
Introduction to Gender Sensitization; Affirmative approach towards Weaker Sections (SCs, STs,
OBCs, EWS & DAs); Ethical Conduct in Higher Education Institutions; Professional Ethics.
Intellectual Property Rights: Meaning, Origins and Nature of Intellectual Property Rights
(IPRs);Different Kinds of IPRs – Copyright, Patent, Trademark, Trade Secret/Dress, Design,
IV 7
Traditional Knowledge; Infringement and Offences of IPRs – Remedies and Penalties; Basics of
Plagiarism policy of UGC.
Note: Scope of the syllabus shall be restricted to generic and introductory level of
mentioned topics.
Total Contact Hour 30
Suggested Evaluation Methods
Internal Assessment: 15 End Term Examination: 35
 Theory 15  Theory: 35
 Class Participation: 4 Written Examination

Master of Computer Applications Page 37 of 76

  Seminar/presentation/assignment/quiz/class test
4
etc.:
 Mid-Term Exam: 7
Part C-Learning Resources
Recommended Books/e-resources/LMS:
1) Ahuja, V K. (2017). Law relating to Intellectual Property Rights, India, IN: Lexis Nexis. Bajpai, B. L., Indian Ethos
and Modern Management, New Royal Book Co., Lucknow, 2004.
2) Basu, D.D., Introduction to the Constitution of India (Students Edition) Prentice Hall of India Pvt. Ltd., New Delhi,
20th ed., 2008.
3) Dhar, P.L. & R.R. Gaur, Science and Humanism, Commonwealth Publishers, New Delhi, 1990. George, Sussan, How
the Other Half Dies, Penguin Press, 1976.
4) Govindarajan, M., S. Natarajan, V.S. Sendilkumar (eds.), Engineering Ethics (Including Human Values), Prentice Hall
of India Private Ltd, New Delhi, 2004.
5) Harries, Charles E., Michael S. Pritchard & Michael J. Robins, Engineering Ethics, Thompson Asia, New Delhi, 2003.
6) Illich, Ivan, Energy & Equity, Trinity Press, Worcester, 1974.
7) Meadows, Donella H., Dennis L. Meadows, Jorgen Randers & William W. Behrens, Limits to Growth: Club of
Rome’s Report, Universe Books, 1972.
8) Myneni, S.R, Law of Intellectual Property, Asian Law House. Narayanan, P, IPRs.
9) Neeraj, P., &Khusdeep, D. (2014). Intellectual Property Rights, India, IN: PHI learning Private Limited. Nithyananda,
K V. (2019). Intellectual Property Rights: Protectionand Management. India, IN: Cengage Learning India
PrivateLimited.
10) Palekar, Subhas, How to practice Natural Farming, Pracheen (Vaidik) KrishiTantraShodh, Amravati, 2000.
11) Phaneesh, K.R., Constitution of India and Professional Ethics, New Delhi.
12) Pylee, M.V., An Introduction to Constitution of India, Vikas Publishing, New Delhi, 2002. Raman, B.S., Constitution
of India, New Delhi, 2002.
13) Reddy, B., Intellectual Property Rights and the Law, Gogia Law Agency.
14) Reddy, N.H., SantoshAjmera, Ethics, Integrity and Aptitude, McGraw Hill, New Delhi. Sharma, Brij Kishore,
Introduction to the Constitution of India, New Delhi,

Master of Computer Applications Page 38 of 76

 CC-9 Design and Analysis of Algorithms
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 3rd
Name of the Course Design and Analysis of Algorithms
Course Code M24-CAP-301
Course Type CC-9
Level of the course (As per Annexure-I 500-599
Pre-requisite for the course (if any) -
This course aims to provide students with a deep understanding of
algorithm design, analysis, and complexity, equipping them with the
skills to develop efficient solutions to computational problems. It
introduces foundational concepts such as asymptotic notation and
algorithmic paradigms like divide-and-conquer, greedy methods, and
dynamic programming. Students will explore advanced data
Course Objectives
structures, graph and string algorithms, and will also gain exposure to
probabilistic analysis and randomized algorithms. The course further
delves into computational geometry and the theoretical aspects of
computational complexity, including NP-completeness and
intractable problems, preparing students for both practical algorithm
development and theoretical analysis.
CLO-1: Students will be able to analyze and compare algorithm
performance using asymptotic notations and apply divide-and-
conquer strategies with recurrence-solving techniques.
CLO-2: Students will develop efficient algorithmic solutions using
dynamic programming and greedy methods for problems like matrix
chain multiplication, Huffman coding, and optimal binary search
Course Learning Outcomes (CLO)
trees.
After completing this course, the learner
CLO-3: Students will understand and implement key graph and
will be able to:
string algorithms, including shortest path algorithms, maximum flow
techniques, and pattern matching methods.
CLO-4: Students will comprehend geometric algorithmic techniques
and critically evaluate problem complexity using concepts from
computational complexity theory, including NP-completeness and
reducibility.
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one
compulsory question by taking course learning outcomes (CLOs) into consideration. The compulsory question
(Question No. 1) will consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5
questions, selecting one question from each unit and the compulsory question. All questions will carry equal
marks.
Contact
Unit Topics
Hours
Introduction: Algorithms, Role of algorithms in computing, Analyzing algorithms, Designing
algorithms, Asymptotic notations.
Divide and Conquer: Solving recurrence equations: Back substitution method, Recursion tree
15
I method, Masters theorem.
Probabilistic Analysis and Randomized Algorithms: The hiring problem, Indicator random
variables, Randomized algorithms, Probabilistic analysis and further uses of indicator
random variables
II Trees: Red-black trees and Splay trees. 15

Master of Computer Applications Page 39 of 76

 Dynamic Programming (DP): Elements of DP, Matrix chain multiplication, Longest common
subsequence, optimal binary search trees.
Greedy Techniques (GT): Elements of GT, Activity selection problem, Huffman codes,
Knapsack Problem.
Graph Algorithms: Topological sort, Strongly connected components, Single source shortest
path: Analysis of Dijkstra’s Algorithm, Limitations of Dijkstra’s Algorithm, Negative weight
cycle, Bellman-Ford algorithm. All Pairs Shortest Path: Relation of Shortest path and matrix
III multiplication, Analysis of Floyd Warshall algorithm. Maximum Flow: Flow network, Ford- 15
Fulkerson method.
Strings: Storage of strings, Naive string-matching algorithm, Rabin-Karp algorithm, String
matching with finite automata, Knuth-Morris-Pratt algorithm
Computational Geometry: Line-segment properties, Convex hull, Closest pair of points.
Computational complexity: Notion of Polynomial time algorithms, Complexity classes: P,
IV NP, NP-Hard and NP-Complete, Polynomial time verification, Reducibility, NP- 15
Completeness, Examples of NP-Complete and NP-Hard problems: Traveling Salesman
Problem, Knapsack, Bin Packing, Satisfiability, Vertex Cover, Clique, Independent Set.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books:
1) 1. Cormen, Leiserson, Rivest, Introduction to Algorithms, PHI India.
2) Neapolitan R., Foundations of Algorithms, Jones and Bartlett Learning.
3) Cooper A., Computability Theory, Chapman and Hall/ CRC Press.
4) A.V.Aho, J.E.Hopcroft, and J.D.Ullman, The Design and Analysis of Computer Algorithms, Pearson
Education India
5) AnanyLevitin, Introduction to the Design and Analysis of Algorithms, Pearson Education.
6) R.C.T Lee, S.S.Tseng, R.C.Chang, Y.T.Tsai, Introduction to Design and Analysis of Algorithms: A
Strategic Approach, Tata McGraw Hill
7) Steven Skiena, The Algorithm Design Manual, Springer India.

Master of Computer Applications Page 40 of 76

 CC-10 Machine Learning in Python
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 3rd
Name of the Course Machine Learning in Python
Course Code M24-CAP-302
Course Type CC-10
Level of the course (As per Annexure-I 500-599
Pre-requisite for the course (if any) -
The course Machine Learning in Python is designed to provide
students with a comprehensive understanding of machine learning
concepts and their practical implementation using Python. It
introduces learners to the fundamentals of supervised and
unsupervised learning, covering a range of algorithms including
decision trees, naive Bayes, logistic regression, clustering methods,
and regression models. The course also emphasizes hands-on
Course Objectives
experience through Python libraries like scikit-learn, scipy, and
others to implement, train, and evaluate machine learning models.
Furthermore, students will explore advanced topics such as
dimensionality reduction, anomaly detection, recommender systems,
support vector machines, and reinforcement learning, equipping them
with both theoretical insight and practical tools to solve real-world
problems using machine learning techniques.
CLO I: Students will be able to explain fundamental machine
learning concepts and implement classification tasks using decision
tree algorithms in Python.
CLO II: Students will demonstrate the ability to apply Bayesian
methods and regression techniques using Python to model and
Course Learning Outcomes (CLO) predict data-driven outcomes.
After completing this course, the learner CLO III: Students will implement and analyze logistic regression
will be able to: and clustering algorithms to extract patterns and perform
classification in unlabelled datasets using Python libraries.
CLO IV: Students will apply dimensionality reduction and anomaly
detection techniques and gain exposure to advanced machine
learning topics such as SVM, recommender systems, and
reinforcement learning using Python tools.
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one
compulsory question by taking course learning outcomes (CLOs) into consideration. The compulsory question
(Question No. 1) will consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5
questions, selecting one question from each unit and the compulsory question. All questions will carry equal
marks.
Contact
Unit Topics
Hours
Introduction to Machine Learning in Python: Concepts and definitions, Overview of
Machine Learning, Key terminology, types of learning tasks, and real-world applications.
Supervised Learning with Python: Classification tasks, Representation of Decision Trees, 15
I
identifying suitable problems for decision learning, Decision Tree algorithms (e.g., ID3,
CART), and implementation using Python libraries such as scikit-learn. Exploration of
hyperspace search in decision tree models.
II Naive Bayes in Python: Bayes Theorem, applying Bayes Decision Theory, Conditional 15

Master of Computer Applications Page 41 of 76

 Probability, and implementation of Bayesian classifiers. Introduction to Bayesian Belief
Networks and their applications using Python libraries.
Regression Models with Python: Linear Regression for numerical prediction, methods for
finding the best fit line, implementation using scikit-learn. Introduction to Regression Trees
and performing regression using CART in Python.
Logistic Regression with Python: Binary classification using the sigmoid function, model
interpretation, and implementation using Python.
Clustering Techniques in Python: Unsupervised learning concepts, implementation of K-
III 15
Means Clustering, Expectation-Maximization (EM) algorithm, and Hierarchical Clustering
using scipy and scikit-learn. Introduction to semi-supervised learning and supervised
learning post-clustering.
Dimensionality Reduction and Anomaly Detection in Python: Overview of
dimensionality reduction techniques, implementation of Principal Component Analysis
(PCA), detecting outliers using statistical and model-based approaches.
IV 15
Advanced Topics: Introduction to Recommender Systems using collaborative filtering,
Support Vector Machines (SVM) for classification, and basics of Reinforcement Learning
with an overview of relevant Python tools like OpenAI Gym.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books:
1) Tom M. Mitchell, Machine Learning, McGraw-Hill Education (India) Private Limited.
2) Ethem Alpaydin, Introduction to Machine Learning (Adaptive Computation and Machine Learning), The
MIT Press.
3) Stephen Marsland, Machine Learning: An Algorithmic Perspective, CRC Press.
4) Peter Flach, Machine Learning: The Art and Science of Algorithms that Make Sense of Data, Cambridge
University Press.
5) Peter Harrington, Machine Learning in Action, Manning Publications.
6) Shai Shalev-Shwartz and Shai Ben-David, Understanding Machine Learning: From Theory to
Algorithms, Cambridge University Press.
7) Aurélien Géron, Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow (2nd or 3rd
Edition), O'Reilly Media.

Master of Computer Applications Page 42 of 76

 DEC-1 Ethical Hacking
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 3rd
Name of the Course Ethical Hacking
Course Code M24-CAP-303
Course Type DEC-1
Level of the course (As per Annexure-I 500-599
Pre-requisite for the course (if any)
The objective of this course is to provide students with an in-depth
understanding of the ethical aspects of hacking and cybersecurity practices. It
aims to develop skills in identifying security vulnerabilities in computer systems
and networks through ethical means. The course introduces tools and techniques
Course Objectives
used by ethical hackers to conduct penetration testing, vulnerability assessments,
and security audits. It also emphasizes the legal and ethical boundaries of
hacking and trains students to defend against cyber threats while complying with
industry standards and regulations.
CLO 1: Students will be able to explain the basic concepts of ethical hacking
and perform information gathering through footprinting and scanning techniques
within legal boundaries.
CLO 2: Students will analyze system vulnerabilities and demonstrate the ability
Course Learning Outcomes (CLO) to detect and mitigate various forms of malware and unauthorized system access.
After completing this course, the learner will CLO 3: Students will assess and exploit weaknesses in networks and web
be able to: applications while understanding the use of tools and methods used by ethical
hackers.
CLO 4: Students will perform penetration testing using industry-standard tools,
interpret vulnerability reports, and communicate findings through professional
documentation.
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one compulsory
question by taking course learning outcomes (CLOs) into consideration. The compulsory question (Question No. 1) will
consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5 questions, selecting one question
from each unit and the compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Introduction to Ethical Hacking: Definition and types of hackers, phases of hacking, footprinting and
15
I reconnaissance, scanning networks and enumeration, understanding vulnerabilities, legal and ethical
issues in ethical hacking, cyber laws in India and internationally.
System Hacking and Malware Threats: Password cracking techniques, privilege escalation, steganography
II and hiding data, malware types and analysis (viruses, worms, trojans), sniffing and spoofing, keyloggers 15
and spyware, identifying and mitigating malware threats.
Network and Web Application Hacking: Understanding firewalls and intrusion detection systems (IDS),
hacking wired and wireless networks, SQL injection, cross-site scripting (XSS), session hijacking, denial-
III 15
of-service (DoS) attacks, web server vulnerabilities, exploiting web application weaknesses using tools
such as Burp Suite.
Penetration Testing and Security Tools: Phases of penetration testing, vulnerability assessment tools
IV (Nmap, Nessus), exploiting systems using Metasploit Framework, writing and customizing scripts for 15
ethical hacking, report writing and documentation, recent trends in ethical hacking.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70

Master of Computer Applications Page 43 of 76

  Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books
1) William Stallings, Network Security Essentials: Applications and Standards, Pearson Education.
2) William Easttom, Computer Security Fundamentals, Pearson Education.
3) Patrick Engebretson, The Basics of Hacking and Penetration Testing, Syngress.
4) Michael T. Simpson, Kent Backman, and James Corley, Hands-On Ethical Hacking and Network Defense, Cengage
Learning.
5) EC-Council, Certified Ethical Hacker (CEH) Official Study Guide, Wiley.

Master of Computer Applications Page 44 of 76

 DEC-1 Computer Architecture
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 3rd
Name of the Course Computer Architecture
Course Code M24-CAP-304
Course Type DEC-1
Level of the course (As per Annexure-I 500-599
Pre-requisite for the course (if any) Student must have the knowledge of Computer Organization & Design
This course aims to introduce students to the foundational models and
architectures of parallel computation, emphasizing how hardware and software
interact in parallel processing environments. It explores various types and levels
of parallelism, including instruction-level parallelism (ILP) and the architecture
Course Objectives of superscalar processors. Students learn about code scheduling, branch
prediction strategies, and memory models in MIMD systems. The course also
delves into interconnection networks and cache coherence protocols, equipping
learners with the conceptual and practical knowledge needed to understand,
analyze, and optimize modern parallel computing systems.
CLO-1 Learn the concepts of computational models & parallel architectures and
exploitation of parallelism at instruction level.
CLO-2 Understand architectural features of multi-issue ILP processors and
Course Learning Outcomes (CLO)
branch handling.
After completing this course, the learner will
CLO-3 Learn MIMD architectures and interconnection networks used in them
be able to:
and evaluate their comparative performances.
CLO-4 Analyze causes of cache coherence problem and learn protocols for its
solution.
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one compulsory
question by taking course learning outcomes (CLOs) into consideration. The compulsory question (Question No. 1) will
consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5 questions, selecting one question
from each unit and the compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Computational Model: Computational models, computer architecture, Classification of parallel
architectures, Relationships between programming languages and parallel architectures.
Parallel Processing: Types and levels of parallelism, Instruction Level Parallel (ILP) processors, 15
I
dependencies between instructions, principle and general structure of pipelines, performance measures of
pipeline, pipelined processing instructions.
Code Scheduling for ILP- Processors: Basic block scheduling, loop scheduling, global scheduling.
Superscalar Processors: Emergence of superscalar processors, Tasks of superscalar processing –
parallel decoding, superscalar instruction issue, shelving, register renaming, parallel execution, preserving
sequential consistency of instruction execution and exception processing, comparison of VLIW &
II 15
superscalar processors.
Branch Handling: Branch problem, Approaches to branch handling – delayed branching, branch
detection and prediction schemes, branch penalties and schemes to reduce them, multiway branches.
MIMD Architectures: Concepts of distributed and shared memory MIMD architectures, UMA, NUMA,
CC-NUMA & COMA models of multiprocessors.
III 15
Direct Interconnection Networks: Metrics for performance measures; Interconnection topologies:
Linear Array, Ring, Chordal Rings, Star, Tree, 2D Mesh, Barrel Shifter, Hypercube.
IV Dynamic interconnection networks: single shared buses, comparison of bandwidths of locked, pended 15
& split transaction buses, arbiter logics, crossbar, multistage networks – omega.
Cache Coherence Protocols: Cache Coherence Problem, Causes, Hardware Based Protocols – Snoopy

Master of Computer Applications Page 45 of 76

 Cache Protocol, Directory Schemes – Full-Map Directory, Limited Directory, Chained Directory.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Textbook
1) Sima, Fountain, Kacsuk, Advanced Computer Architecture, Pearson Education.
2) D. A. Patterson and J. L. Hennessey, Computer Architecture – A Quantitative Approach, Elsevier India.
Reference Books
1) Kai Hwang, Advanced Computer Architecture, McGraw Hill.
2) Nicholas Carter, Computer Architecture, McGraw Hill.
3) Harry F. Jordan, Gita Alaghband, Fundamentals of Parallel Processing, Pearson Education.

Master of Computer Applications Page 46 of 76

 DEC-2 Computer Graphics
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 3rd
Name of the Course Computer Graphics
Course Code M24-CAP-306
Course Type DEC-2
Level of the course (As per Annexure-I 500-599
Pre-requisite for the course (if any)
The objective of this course is to introduce students to the fundamental concepts
and techniques of computer graphics, including both two-dimensional and three-
dimensional modeling and rendering. The course aims to develop an
understanding of the components, devices, and software involved in computer
graphics systems, and to explore the mathematical foundations of graphical
transformations and geometric representations. Students will learn how to
Course Objectives
implement various algorithms for scan conversion, clipping, filling, and
rendering of objects, along with basic animation techniques. The course also
covers advanced topics such as 3D viewing, visible-surface determination,
shading models, and procedural modeling methods to give students insight into
realistic visualizations and modern applications of computer graphics such as
GUI design, computer vision, and augmented reality.
CLO 1: Students will be able to describe the components and working principles
of interactive computer graphics systems and distinguish between raster and
random scan display mechanisms.
CLO 2: Students will demonstrate the ability to implement and analyze scan
conversion algorithms for drawing basic geometric shapes and understand curve
Course Learning Outcomes (CLO)
representation techniques using parametric equations and Bézier curves.
After completing this course, the learner will
CLO 3: Students will apply two-dimensional geometric transformations and
be able to:
viewing techniques, implement clipping algorithms, and effectively perform
operations such as zooming, panning, and window-to-viewport transformations.
CLO 4: Students will gain proficiency in 3D object modeling, transformations,
projections, surface visibility determination techniques, and will understand the
fundamentals of illumination, shading, and animation sequence design.
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one compulsory
question by taking course learning outcomes (CLOs) into consideration. The compulsory question (Question No. 1) will
consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5 questions, selecting one question
from each unit and the compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Introduction to Computer Graphics and its Components: Overview of Computer Graphics, its functions &
elements; Introduction to GUI, Computer Vision, Augmented Reality and other Applications of Graphics;
Popular Graphics Software; Components and Working of Interactive Graphics; Raster Scan and Random 15
I
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.
II Scan Conversion: Drawing Geometry; Output Primitives; Lines and Pixel Graphics; AntiAliasing; Scan 15
Converting 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.

Master of Computer Applications Page 47 of 76

 Filled-Area Primitives: Basic Stack based fill algorithms: Flood fill algorithm, Boundary fill algorithm;
Scan-line polygon fill algorithm and its computational structures.
Two-Dimensional Transformations: Coordinate and Geometric Transformations; Translation, Rotation,
Scaling; Matrix representations and Homogeneous coordinates, Composite transformations, General Pivot
Point rotation, General Fixed Point Scaling, Shearing; Reflection ; Reflection about an arbitrary line.
2-D Viewing: Viewing pipeline; Window, Viewport, Window-to-Viewport transformation; Zooming,
III 15
Panning; Pointing and Positioning techniques; Rubber band technique; Dragging.
Clipping operations: Point and Line clipping, Cohen-Sutherland line clipping, Mid-Point Subdivision line
clipping, Liang-Barsky line clipping, Sutherland-Hodgman polygon clipping; Weiler-Atherton polygon
clipping.
3-D Graphics & Modeling: Visualization techniques for Realism; 3D Object Representation; Solid Model
Representation Schemes; Euclidean Geometry methods: Regularized Boolean Set Operations, Primitive
Instancing, Boundary Representations, Curved lines and surfaces, Sweep Representations, Spatial-
Partitioning Representations - Octree representation, Constructive Solid Geometry; Procedural Methods:
Fractals, Shape Grammars, Particle systems, Physically Based modeling, Visualization techniques; 3D
IV 15
transformations.
Visible-Surface Determination: Z-buffer, Depth-Sorting, Area Subdivision, BSP-Tree method; Ray
casting.
Illumination and Shading: Modeling Light Intensities; Basic Illumination Models; Gouraud Shading;
Phong Shading.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books
1) Donald Hearn, M. Pauline Baker, Computer Graphics, Pearson Education.
2) J. D. Foley, A. Van Dam, S. K. Feiner and J. F. Hughes, Computer Graphics - Principles and Practice, Pearson
Education.
3) Newmann & Sproull, Principles of Interactive Computer Graphics, McGraw Hill.
4) Rogers, David F., Procedural Elements of Computer Graphics, McGraw Hill.
5) Zhigang Xiang, Roy Plastock, Computer Graphics, Tata McGraw Hill.
6) Malay K. Pakhira, Computer Graphics, Multimedia and Animation, PHI
7) Steven Harrington, Computer Graphics, A Programming Approach, McGraw Hill.

Master of Computer Applications Page 48 of 76

 DEC-2 Big Data & Pattern Recognition
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 3rd
Name of the Course Big Data & Pattern Recognition
Course Code M24-CAP-307
Course Type DEC-2
Level of the course (As per Annexure-I 500-599
Pre-requisite for the course (if any)
The objective of this course is to provide students with a comprehensive
understanding of the core concepts, technologies, and analytical methods used in
the domain of big data and pattern recognition. The course introduces the
foundational principles of big data, including its characteristics, sources,
business motivations, and the lifecycle of big data analytics. Students will learn
about various enterprise technologies and data governance strategies necessary
for managing and analyzing large-scale datasets effectively. The course further
Course Objectives
explores the tools and techniques used for data processing, such as Hadoop
ecosystem components, and offers insight into the theoretical and practical
aspects of pattern recognition, including feature extraction, classification, and
neural networks. It concludes with an overview of NoSQL databases,
highlighting their architectures, types, and applications in big data management,
enabling students to distinguish between traditional and modern data handling
approaches.
CLO 1: Students will be able to explain the fundamental characteristics of big
data and identify its business drivers, architectures, and real-world applications
across various industries.
CLO 2: Students will demonstrate the ability to apply big data governance
principles and utilize core Hadoop ecosystem tools such as HDFS, MapReduce,
Course Learning Outcomes (CLO)
Hive, and Pig for analyzing large-scale datasets.
After completing this course, the learner will
CLO 3: Students will apply pattern recognition techniques, including feature
be able to:
extraction and nearest neighbor classifiers, and model simple logical operations
using neural networks.
CLO 4: Students will analyze the characteristics and types of NoSQL databases
and evaluate their suitability for different big data storage and retrieval scenarios
compared to traditional RDBMS.
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one compulsory
question by taking course learning outcomes (CLOs) into consideration. The compulsory question (Question No. 1) will
consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5 questions, selecting one question
from each unit and the compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Understanding Big Data: Concepts and Terminology, Big Data Characteristics, Different Types of Data,
Identifying Data Characteristics, Business Motivations and Drivers for Big Data Adoption: Business
15
I Architecture, Business Process Management, Information and Communication Technology, Big Data
Analytics Lifecycle, Enterprise Technologies and Big Data Business Intelligence, Industry examples of big
data.
Data Governance for Big Data Analytics: Evolution of Data Governance, Big Data and Data Governance,
Big Datasets, Big Data Oversight, Big Data Tools and Techniques: HDFS, Map Reduce, YARN,
II 15
Zookeeper, HBase, HIVE, Pig, Mahout, Developing Big Data Applications, Stepwise Approach to Big
Data Analysis, Big Data Failure: Failure is common, Failed Standards, Legalities.
III Data Analysis and Pattern Recognition: Quantitative and Qualitative Analysis, Pattern Recognition 15

Master of Computer Applications Page 49 of 76

 Systems, Fundamental Problems in Pattern Recognition, Feature Extraction and Reduction, Paradigms,
Pattern Recognition Approaches, Importance and Applications. Data Domain for Pattern Recognition.
Pattern Recognition using Nearest Neighbour Classifier and Modeling an AND Gate Neural Nets.
An Overview of NoSQL, Characteristics of NoSQL, NoSQL Storage Types, Introduction of NoSQL
Products, NoSQL Data Management for Big Data: Schema Less Models, Key-Value Stores, Document
IV 15
Stores, Tabular Stores, Object Data Stores, Graph databases, NoSQL Misconceptions, NoSQL over
RDBMS.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books
1) Thomas Erl, Wajid Khattak and Paul Buhler, Big Data Fundamentals Concepts, Drivers & Techniques Prentice Hall.
2) David Loshin, Big Data Analytics from Strategic Planning to Enterprise Integration with Tools, Techniques, NoSQL,
and Graph Morgan Kaufmann.
3) Jules J. Berman, Principles of Big Data Preparing, Sharing and Analyzing Complex Information, Morgan Kaufmann.
4) Gaurav Vaish, Getting Started with NoSQL, Packt Publishing.
5) Rajjan Shinghal, Pattern Recognition Techniques and Applications, Oxford Higher Education.
6) Michael Berthold, David J. Hand, Intelligent Data Analysis, Springer.
7) Jay Liebowitz, Big Data and Business Analytics, Auerbach Publications, CRC press.
8) Pete Warden, Big Data Glossary, O’Reily.
9) Michael Mineli, Michele Chambers, AmbigaDhiraj, Big Data, Big Analytics: Emerging Business Intelligence and
Analytic Trends for Today's Businesses, Wiley Publications.

Master of Computer Applications Page 50 of 76

 PC-5 Practical-7
With effect from Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 3rd
Name of the Course Practical-7
Course Code M24-CAP-309
Course Type PC-5
Level of the course 500-599
Pre-requisite for the course (if any)
This course aims to equip students with hands-on experience in
implementing and analyzing fundamental and advanced algorithms.
Students will develop the ability to measure and compare the empirical
time complexity of sorting algorithms, trace recursion trees, and
understand the behavior of divide-and-conquer strategies. They will gain
practical skills in implementing dynamic programming solutions for
problems such as Matrix Chain Multiplication and Longest Common
Course objectives
Subsequence, and in applying advanced data structures like Red-Black
Trees. The course also emphasizes solving real-world problems using
greedy, graph-based, and optimization algorithms such as Huffman
Coding, 0/1 Knapsack, Bellman-Ford, and Floyd-Warshall. By the end of
the course, students will be proficient in algorithmic problem-solving and
performance analysis, preparing them for software development,
competitive programming, and research.
CLO-1: Implement and empirically evaluate the performance of classical
algorithms such as Bubble Sort, Merge Sort, and Quick Sort, and analyze
their execution times across different input cases.
CLO-2: Apply and trace advanced algorithmic techniques, including
recursion trees in divide-and-conquer approaches and dynamic
Course Learning Outcomes (CLO) programming tables in optimization problems like Matrix Chain
After completing this course, the learner will Multiplication and LCS.
be able to: CLO-3: Design and implement efficient data structures and graph
algorithms, such as Red-Black Trees, Huffman Coding, Topological Sort,
and algorithms for shortest paths and strongly connected components.
CLO-4: Compare and contrast greedy and dynamic programming
approaches for problems like the 0/1 Knapsack and understand their
suitability through programmatic implementations and results analysis.
Theory Practical Total
Credits
0 4 4
Teaching Hours per week 0 8 8
Internal Assessment Marks 0 30 30
End Term Exam Marks 0 70 70
Max. Marks 0 100 100
Examination Time 0 4 hours
Part B- Contents of the Course
Practicals Contact Hours
Practical course will consist of two components Part-A and Part-B. The examiner will set 5
questions at the time of practical examination asking 3 questions from the Part-A and 2 questions
120
from the Part-B by taking course learning outcomes (CLO) into consideration. The examinee will
be required to solve one problem from the Part-A and one from the Part-B.
Part-A 60
1) Write a program to compare the execution time of different sorting algorithms (Bubble
Sort, Merge Sort, Quick Sort) and analyze their empirical time complexity.
2) Implement the Merge Sort. Trace the recursion tree and compare the number of recursive
calls for different inputs.
3) Implement the Quick Sort algorithms. Trace the recursion tree and compare the number of
recursive calls for different inputs.
4) Apply Strassen’s Matrix Multiplication and compare with the naive matrix multiplication
algorithm.

Master of Computer Applications Page 51 of 76

 5) Implement Red-Black Tree with insertion and deletion. Validate the tree's properties at
each step.
6) Solve the Matrix Chain Multiplication problem using dynamic programming.
7) Write a program to find the Longest Common Subsequence of two strings and trace the
DP table.
Part-B 60
8) Construct Huffman Codes for a given set of characters and frequencies; also display the (Lab hours
encoded and decoded message. include
9) Solve the 0/1 Knapsack Problem using Greedy approache. instructions for
10) Solve the 0/1 Knapsack Problem using DP approaches. writing
programs and
11) Implement Topological Sort using DFS algorithm. demonstration
12) Implement Kosaraju's algorithm to find strongly connected components in a directed by a teacher and
graph. for running the
13) Implement Bellman-Ford algorithm to find shortest paths and detect negative weight programs on
cycles. computer by
14) Implement the Floyd-Warshall algorithm for all-pairs shortest paths. students.)
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Practicum 30  Practicum 70
 Class Participation: 5
Lab record, Viva-Voce, write-up and execution
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10
of the programs
 Mid-Term Examination: 15
Part C-Learning Resources
Recommended Books/e-resources/LMS:
1) Cormen, Leiserson, Rivest, Introduction to Algorithms, PHI India.
2) Neapolitan R., Foundations of Algorithms, Jones and Bartlett Learning.
3) Cooper A., Computability Theory, Chapman and Hall/ CRC Press.
4) A.V.Aho, J.E.Hopcroft, and J.D.Ullman, The Design and Analysis of Computer Algorithms, Pearson
Education India
5) AnanyLevitin, Introduction to the Design and Analysis of Algorithms, Pearson Education.
6) R.C.T Lee, S.S.Tseng, R.C.Chang, Y.T.Tsai, Introduction to Design and Analysis of Algorithms: A Strategic
Approach, Tata McGraw Hill
7) Steven Skiena, The Algorithm Design Manual, Springer India.

Master of Computer Applications Page 52 of 76

 PC-6 Practical-8
With effect from Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 3rd
Name of the Course Practical-8
Course Code M24-CAP-310
Course Type PC-6
Level of the course 500-599
Pre-requisite for the course (if any)
This course aims to equip students with practical experience in
implementing foundational machine learning algorithms using Python. It
covers key supervised learning techniques such as decision trees, naive
Bayes, linear and logistic regression, and introduces students to
unsupervised learning techniques like clustering and dimensionality
reduction. Through hands-on projects, students will explore model
Course objectives
evaluation metrics, visualize model behaviors, and analyze datasets using
libraries like scikit-learn, matplotlib, and pandas. The course also
integrates basic anomaly detection approaches, enabling students to
identify unusual patterns in data. Overall, the course bridges theoretical
concepts with applied programming, preparing students to solve real-
world problems using machine learning tools.
CLO-1: Apply supervised learning techniques such as decision trees,
naive Bayes, and linear/logistic regression to solve classification and
prediction problems using Python.
CLO-2: Perform model evaluation using metrics like R² score, mean
squared error, and visualize model behavior through regression lines and
Course Learning Outcomes (CLO)
decision boundaries.
After completing this course, the learner will
CLO-3: Implement unsupervised learning techniques, including K-
be able to:
Means clustering and Principal Component Analysis (PCA), and interpret
results through appropriate visualizations.
CLO-4: Detect anomalies in datasets using statistical and model-based
methods like Z-score, Isolation Forest, and One-Class SVM for
applications such as fraud detection and system monitoring.
Theory Practical Total
Credits
0 4 4
Teaching Hours per week 0 8 8
Internal Assessment Marks 0 30 30
End Term Exam Marks 0 70 70
Max. Marks 0 100 100
Examination Time 0 4 hours
Part B- Contents of the Course
Practicals Contact Hours
Practical course will consist of two components Part-A and Part-B. The examiner will set 5
questions at the time of practical examination asking 3 questions from the Part-A and 2
120
questions from the Part-B by taking course learning outcomes (CLO) into consideration. The
examinee will be required to solve one problem from the Part-A and one from the Part-B.
Part-A
1) Implement a Decision Tree Classifier on the Iris dataset using scikit-learn and
visualize the decision tree.
2) Implement a Gaussian Naive Bayes Classifier on the Wine dataset using scikit-learn.
3) Implement Simple Linear Regression using scikit-learn to predict house prices.
60
4) Implement Multiple Linear Regression and evaluate R² score, MSE, and other metrics
on a real-world dataset.
5) Write a program to plot the regression line along with the data points using matplotlib.
6) Perform regression using CART (Decision Tree Regressor) and compare performance
with linear regression.
Part-B 60

Master of Computer Applications Page 53 of 76

 7) Apply Logistic Regression for binary classification on a heart disease dataset using
scikit-learn. (Lab hours include
8) Visualize the sigmoid function and decision boundary of logistic regression on a instructions for
binary classification dataset. writing programs
9) Implement K-Means Clustering on a synthetic dataset and visualize the clusters. and demonstration
10) Apply K-Means on customer segmentation data, and determine the optimal number of by a teacher and for
clusters using the Elbow Method. running the
11) Implement PCA on a high-dimensional dataset and visualize the first two principal programs on
components. computer by
12) Create a program for outlier detection using the Z-score method on a numeric dataset. students.)
13) Use Isolation Forest or One-Class SVM to detect anomalies in network traffic or
financial transactions.
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Practicum 30  Practicum 70
 Class Participation: 5
Lab record, Viva-Voce, write-up and execution
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10
of the programs
 Mid-Term Examination: 15
Part C-Learning Resources
Recommended Books/e-resources/LMS:
1) Tom M. Mitchell, Machine Learning, McGraw-Hill Education (India) Private Limited.
2) Ethem Alpaydin, Introduction to Machine Learning (Adaptive Computation and Machine Learning), The MIT
Press.
3) Stephen Marsland, Machine Learning: An Algorithmic Perspective, CRC Press.
4) Peter Flach, Machine Learning: The Art and Science of Algorithms that Make Sense of Data, Cambridge
University Press.
5) Peter Harrington, Machine Learning in Action, Manning Publications.
6) Shai Shalev-Shwartz and Shai Ben-David, Understanding Machine Learning: From Theory to Algorithms,
Cambridge University Press.
7) Aurélien Géron, Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow (2nd or 3rd Edition),
O'Reilly Media.

Master of Computer Applications Page 54 of 76

 OEC Data Analytics using Excel
With effect from the Session: 2024-25
Part A - Introduction
Name of Programme MCA
Semester 3rd
Name of the Course Data Analytics using Excel
Course Code M24-OEC-308
Course Type OEC
Level of the course 400-499
Pre-requisite for the course (if an )
The objective of this course is to equip students with practical knowledge
and hands-on skills in performing data analysis using Microsoft Excel.
The course introduces the fundamentals of data analytics, focusing on the
importance of structured data processing and interpretation for decision-
making. Students will learn to work with Excel functions, data
Course Objectives formatting, and visualization tools to perform descriptive analytics. The
course also covers advanced Excel features such as PivotTables, What-if
analysis, data models, and statistical functions for predictive analysis. By
the end of the course, students will be capable of cleaning, analyzing,
visualizing, and interpreting datasets using Excel, supporting business
and research-oriented data-driven decisions.
CLO 1: Students will be able to understand core concepts of data
analytics and effectively use Excel to organize, format, and visualize raw
data.
CLO 2: Students will demonstrate the ability to perform descriptive
statistical analysis and apply data-cleaning techniques using Excel's built-
Course Learning Outcomes (CLO)
in features.
After completing this course, the learner will be
CLO 3: Students will be able to apply advanced Excel tools like
able to:
PivotTables and What-if analysis to derive insights and perform basic
forecasting.
CLO 4: Students will conduct statistical and predictive analysis using
Excel’s built-in tools and interpret the results through dynamic
dashboards and visual reports.
Theory Tutorial Total
Credits
2 2
Teaching Hours per week 2 2
Internal Assessment Marks 15 15
End Term Exam Marks 35 35
Max. Marks 50 50
Examination Time 3 3
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one
compulsory question by taking course learning outcomes (CLOs) into consideration. The compulsory question (Question
No. 1) will consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5 questions,
selecting one question from each unit and the
compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Introduction to Data Analytics: Definition, types of analytics (descriptive, predictive, prescriptive),
data types and sources, role of Excel in analytics. Excel basics: interface, cell references, formulas,
I 8
functions, sorting and filtering data, data formatting, basic charts and graphs, importing data from
different sources.
Descriptive Statistics using Excel: Calculating mean, median, mode, standard deviation, variance,
percentiles, quartiles, and correlation. Using Excel functions for data summarization and exploration.
II 7
Creating frequency distributions and histograms. Data cleaning and transformation using Text-to-
Columns, Flash Fill, and Conditional Formatting.
III Data Analysis Tools in Excel: Using PivotTables and PivotCharts for summarization and trend 8
analysis. Introduction to data models and Power Pivot. Performing What-if Analysis using Goal Seek,
Scenario Manager, and Data Tables. Introduction to forecasting using Excel functions like TREND and

Master of Computer Applications Page 55 of 76

 LINEST.
Statistical and Predictive Analysis: Performing regression analysis in Excel. Using correlation,
ANOVA, and t-tests. Introduction to the Data Analysis Toolpak for hypothesis testing. Creating
IV 7
dashboards with interactive elements such as slicers and form controls. Case studies involving
real-world datasets to interpret and communicate analytical results effectively.
Total Contact Hour 30
Suggested Evaluation Methods
Internal Assessment: 15 End Term Examination: 35
 Theory 15  Theory: 35
 Class Participation: 4
 Seminar/presentation/assignment/quiz/class test Written Examination
4
etc.:
 Mid-Term Exam: 7
Part C-Learning Resources
Recommended Books/e-resources/LMS:
1) Wayne Winston, Microsoft Excel Data Analysis and Business Modeling, Microsoft Press.
2) Paul McFedries, Excel Data Analysis for Dummies, Wiley.
3) Danielle Stein Fairhurst, Using Excel for Business Analysis, Wiley.
4) Conrad Carlberg, Statistical Analysis: Microsoft Excel 2016, Que Publishing.
5) M. Balasubramanian, Data Analysis Using Excel, McGraw Hill Education.

Master of Computer Applications Page 56 of 76

 DEC-3 Object Oriented Design and UML
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 4th
Name of the Course Object Oriented Design and UML
Course Code M24-CAP-401
Course Type DEC-3
Level of the course (As per Annexure-I 500-599
Pre-requisite for the course (if any) -
This course provides a comprehensive understanding of Unified Modeling
Language (UML) and object-oriented design principles for effective software
development. It introduces the conceptual model of UML, including its various
elements like use cases, class diagrams, state diagrams, and interaction
Course Objectives diagrams. Students learn to gather and analyze software requirements, model
system structure and behavior, and use UML diagrams to design scalable and
maintainable systems. The course emphasizes both high-level architectural
planning and detailed class and object modeling, equipping students with the
skills needed to transition from requirements to implementation effectively.
CLO-1 Understands basics of modelling and UML and applying usecase
modeling for requirements elicitation
CLO-2 Understand and apply concepts of class modeling and advanced
Course Learning Outcomes (CLO)
structural modeling through UML diagrams.
After completing this course, the learner will
CLO-3 Understand and apply behavioural modeling through state diagram,
be able to:
sequence diagram, activity diagram to represent software systems.
CLO-4 Have a working ability and grasping attitude to analyse and design
software systems based on object-oriented thinking using UML.
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one compulsory
question by taking course learning outcomes (CLOs) into consideration. The compulsory question (Question No. 1) will
consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5 questions, selecting one question
from each unit and the compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Introduction to UML: Principles of Modeling, Conceptual Model of UML - Things, Relationships,
Diagrams; Mechanisms in The UML – Specifications, Adornments, Common Divisions, Extensibility
Mechanisms.
Usecase Modeling: Identifying Use Cases & Actors, Relationships - between Actors, between Use 15
I
Cases and between Actor and Use Case, Elements of Use Case Diagram, Constructing Use Case
Diagram.
Requirement Engineering: Gathering and Documenting Requirements, Functional Vs. Non-Functional
Requirements, Requirement Validation and Verification.
Structural Modeling with UML: Class Modeling - Generalization & Inheritance, Association,
Multiplicity, Sets, Bags & Sequences, Role Names, Qualified Association, Aggregation, Composition,
Association Attributes, Association Classes, Abstract Class, Metadata, Reification, Elements of Class
II 15
Diagrams, Constructing Class Diagrams.
Advanced Structural Modeling with UML: Object Diagrams - Instances and Links; Package
Diagrams - Organizing Classes, Components Diagram, Deployment Diagram.
III Behavioral Modeling with UML: State Modeling - Events, States, Transitions & Conditions, Activity 15
Effects, Do-Activities, Entry & Exit Activities, Completion Transitions, Elements of State Diagrams,
Nested State Diagrams, Concurrency, Constructing State Diagrams.
Sequence Diagram: Lifelines, Messages, and Activations, Constructing Sequence Diagram and
Communication Diagram

Master of Computer Applications Page 57 of 76

 Activity Diagram: Actions, Control Flows, and Object Flows, Swim Lanes, Constructing Activity
Diagram
System Design: Estimating Performance, Make A Reuse Plan, Organize The System into Subsystem,
Identifying Concurrency, Allocating Subsystems to Processors and Tasks, Management of Data Stores,
Handling Global Resources, Choosing Software Control Strategies, Handling Boundary Conditions,
IV 15
Setting Trade-Off Priorities, Selecting an Architect Style.
Class Design: bridging gap, realize use cases with operations, designing algorithms, design
optimization, adjustment of inheritance.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Textbook
1) Grady Booch, James Rumbaugh, Ivar Jacobson, The Unified Modeling Language User Guide, Pearson education.
2) M. Blaha, J. Rumbaugh, Object-Oriented Modeling and Design with UML, Pearson Education.
Reference Books
1) Brend Bruegge, Allen H. Dutoit, Object-Oriented Software Engineering, Using UML, Patterns and Java, Pearson
Education.
2) J. Rumbaugh, M. Blaha, W. Premerlani, F. Eddy, W. Lorensen, Object-Oriented Modeling and Design, Prentice Hall
of India.
3) Satzinger, Jackson, Burd, Object-Oriented Analysis & Design with the Unified Process, Thomson.
4) Grady Booch, Object Oriented Analysis & Design, Pearson Education.
5) Craig Larman , Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and Iterative
Development, Prentice Hall

Master of Computer Applications Page 58 of 76

 DEC-3 Data Science
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 4th
Name of the Course Data Science
Course Code M24-CAP-402
Course Type DEC-3
Level of the course (As per Annexure-I 500-599
Pre-requisite for the course (if any) -
The objective of this course is to introduce students to the foundational concepts
and practical techniques used in data science. It aims to equip learners with the
skills to collect, clean, analyze, and visualize data to generate meaningful
insights. The course covers the end-to-end data science lifecycle, starting from
data acquisition and preprocessing to exploratory data analysis, statistical
Course Objectives
modeling, and machine learning. Students will explore real-world data
applications, understand the use of Python-based tools, and learn how to
effectively communicate findings through visualization and storytelling. The
course also emphasizes ethical considerations and best practices in handling data
responsibly in decision-making contexts.
CLO 1: Students will be able to explain the data science lifecycle and identify
the roles and tools involved in solving real-world data problems.
CLO 2: Students will demonstrate the ability to preprocess, clean, and explore
Course Learning Outcomes (CLO)
datasets using Python-based libraries for meaningful data interpretation.
After completing this course, the learner will
CLO 3: Students will apply basic statistical and machine learning techniques to
be able to:
build and evaluate predictive models on structured data.
CLO 4: Students will create effective data visualizations, interpret model
outputs, and understand ethical responsibilities in data-driven decision-making.
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one compulsory
question by taking course learning outcomes (CLOs) into consideration. The compulsory question (Question No. 1) will
consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5 questions, selecting one question
from each unit and the compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Introduction to Data Science: Definition and components of data science, data science vs. data analytics
vs. machine learning, applications of data science in various domains. Data science lifecycle: data 15
I
collection, data wrangling, analysis, interpretation, and communication. Overview of tools: Python,
Jupyter, NumPy, pandas, and Matplotlib. Introduction to types of data and sources.
Data Preprocessing and Exploration: Handling missing values, data cleaning and transformation, outlier
detection and treatment, encoding categorical variables, data normalization and standardization.
II 15
Exploratory data analysis (EDA): using pandas and visualization libraries for summarizing and exploring
datasets, correlation analysis, feature engineering.
Statistical Foundations and Machine Learning: Descriptive and inferential statistics, probability
distributions, hypothesis testing, regression analysis. Introduction to supervised learning: linear regression,
III logistic regression, decision trees. Basics of unsupervised learning: clustering and dimensionality 15
reduction. Model evaluation metrics: accuracy, precision, recall, F1-score, confusion matrix, cross-
validation.
Data Visualization and Communication: Principles of effective data visualization, tools for visualization in
Python: Matplotlib, Seaborn, and Plotly. Dashboards and storytelling with data. Introduction to real-world
IV 15
case studies and capstone mini-projects. Ethical concerns in data science: data privacy, algorithmic bias,
and responsible AI.
Total Contact Hours 60

Master of Computer Applications Page 59 of 76

 Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books
1) Joel Grus, Data Science from Scratch: First Principles with Python, O'Reilly Media.
2) Cathy O’Neil and Rachel Schutt, Doing Data Science, O'Reilly Media.
3) Aurélien Géron, Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow, O'Reilly Media.
4) Wes McKinney, Python for Data Analysis, O'Reilly Media.
5) Hadley Wickham and Garrett Grolemund, R for Data Science, O'Reilly Media (for supplementary reading and
comparative learning).

Master of Computer Applications Page 60 of 76

 DEC-3 Theory of Computation
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 4th
Name of the Course Theory of Computation
Course Code M24-CAP-403
Course Type DEC-3
Level of the course (As per Annexure-I 500-599
Pre-requisite for the course (if any) -
This course introduces the foundational concepts of computation through the
study of formal languages and automata theory. It covers finite automata (DFA,
NFA, ε-NFA), regular expressions, and regular grammars, along with their
equivalence and minimization techniques. Students learn about context-free
grammars (CFG), derivation trees, grammar simplification, and pushdown
Course Objectives
automata (PDA) for recognizing CFLs. The course also explores finite automata
with output (Moore and Mealy machines), Turing machines as general models of
computation, and undecidable problems. By the end, learners will gain a solid
understanding of the theoretical models that underpin programming languages
and compiler design.
CLO-1 Design deterministic and non-deterministic finite state machines and
understand their capabilities and limits
CLO-2 Define and discuss the concept of formal grammar, formal
Course Learning Outcomes (CLO)
language, regular expression, and automata machine.
After completing this course, the learner will
CLO-3 Design finite automata and push down automata machines for given
be able to:
formal languages or computational real-world problem statements.
CLO-4 Understand basic properties of Turing machines and computing with
Turing machines.
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one compulsory
question by taking course learning outcomes (CLOs) into consideration. The compulsory question (Question No. 1) will
consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5 questions, selecting one question
from each unit and the compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Fundamentals: Alphabets, Strings, Languages, Problems, Graphs, Trees, Finite State Systems,
Definitions, Finite Automaton Model, Acceptance of Strings, And Languages.
Types of FA: Deterministic Finite Automaton and Nondeterministic Finite Automaton, Transition 15
I
Diagrams, Transition Tables, Equivalence of DFA and NFA. Finite Automata with 𝜀-Moves,
Significance, Acceptance of Languages, 𝜀-Closure, Equivalence of NFA With and Without 𝜀-Moves,
Minimization of Finite Automata, Myhill-Nerode Theorem.
Finite Automata with Output: Moore and Mealy Machines, Equivalence of Moore, and Mealy
machines.
Regular Languages: Regular Sets, Regular Expressions, Identity Rules, Constructing Finite Automata
II 15
for A Given Regular Expressions, Conversion of Finite Automata to Regular Expressions. Arden
Theorem, Pumping Lemma for Regular Languages, Closure Properties of Regular Sets, Regular
Grammars–Right Linear and Left Linear Grammars.
Context Free Grammar: Context Free Grammar, Derivation Trees, Sentential Forms, Right Most and
Leftmost derivation of Strings, Ambiguity in Grammar, Inherent ambiguity. Simplification of Context
III Free Grammars, Chomsky Normal Form, Greibach Normal Form, Pumping Lemma for Context Free 15
Languages and Its Applications, Closure properties of CFL, Membership Algorithm (CYK Algorithm) for
Context Free Grammars.
IV Push Down Automata (PDA): Description and definition, Instantaneous Description, Language of PDA, 15

Master of Computer Applications Page 61 of 76

 Acceptance by Final state, Acceptance by empty stack, Deterministic PDA, Equivalence of PDA and
CFG, two stack PDA.
Turing machines (TM): Linear Bounded Automata (LBA), Turing Machines (TM), General Model of
Computation, Combining TM, Multi-Tape TM, Restricted and Universal TM, Recursive and recursively-
enumerable languages and Properties, Reductions and the Halting Problem, Post’s correspondence
problem.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Textbook
1) J. E. Hopcroft, Rajeev Motwani and J. D. Ullman, “Introduction to Automata Theory, Languages, and Computation”,
3rd Edition, Pearson Publisher, 2008, ISBN: 978-8131720479.
Reference Books
1) John C. Martin, “Introduction to Languages and the Theory of Computation”, 4th Edition, McGraw Hill Education,
2010, ISBN: 978-0073191461.
2) K. L. P. Mishra and N. Chandrasekaran, “Theory of Computer Science: Automata, languages and Computation”, 3rd
Edition, 2006, Prentice Hall of India, ISBN: 978-8120329683.
3) Peter Linz, “An Introduction to Formal Languages and Automata”, 6th Edition, Jones & Bartlett Publisher, 2016,
ISBN: 978-9384323219.
4) Zvi Kohav, Niraj K. Jha, “Switching and Finite Automata Theory”, 3rd Edition, Cambridge University Press, 2009,
ISBN: 978-0521857482..

Master of Computer Applications Page 62 of 76

 DEC-4 Blockchain Technology
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 4th
Name of the Course Blockchain Technology
Course Code M24-CAP-405
Course Type DEC-4
Level of the course (As per Annexure-I 500-599
Pre-requisite for the course (if any) -
The objective of this course is to provide students with a comprehensive
understanding of blockchain technology, its architecture, core components, and
potential applications in various domains. The course aims to introduce the
theoretical foundations and the underlying cryptographic principles of
blockchain while equipping students with hands-on knowledge of how
Course Objectives decentralized systems work. Students will explore consensus mechanisms, smart
contracts, and distributed ledger technologies. The course also emphasizes real-
world use cases such as cryptocurrencies, supply chain management, identity
verification, and decentralized finance. Through this course, learners will
develop the necessary skills to analyze, design, and implement blockchain-based
solutions securely and efficiently.
CLO 1: Students will be able to explain the fundamental concepts and
architecture of blockchain technology and compare it with traditional centralized
systems.
CLO 2: Students will understand the cryptographic techniques and consensus
Course Learning Outcomes (CLO) algorithms that ensure the security and integrity of blockchain networks.
After completing this course, the learner will CLO 3: Students will demonstrate the ability to develop basic smart contracts
be able to: using Solidity and understand the differences between blockchain platforms such
as Ethereum and Hyperledger.
CLO 4: Students will analyze the practical applications of blockchain
technology, evaluate associated security challenges, and discuss emerging trends
and future directions.
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one compulsory
question by taking course learning outcomes (CLOs) into consideration. The compulsory question (Question No. 1) will
consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5 questions, selecting one question
from each unit and the compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Introduction to Blockchain: History and evolution of blockchain, features and benefits, architecture of
15
I blockchain, types of blockchain (public, private, consortium), distributed ledger technology, blockchain
versus traditional databases, overview of blockchain applications across industries.
Cryptographic Foundations and Consensus Mechanisms: Hash functions, digital signatures, public-key
II cryptography, Merkle trees, proof-of-work (PoW), proof-of-stake (PoS), delegated proof-of-stake (DPoS), 15
Byzantine fault tolerance, mining and validation processes, block structure, and block propagation.
Smart Contracts and Platforms: Concept of smart contracts, Ethereum blockchain and Ethereum Virtual
III Machine (EVM), Solidity programming basics, gas usage, writing and deploying simple smart contracts, 15
introduction to Hyperledger Fabric and its components, comparison between Ethereum and Hyperledger.
Blockchain Use Cases, Security, and Challenges: Blockchain in cryptocurrency (Bitcoin), finance, supply
chain, healthcare, identity management, voting, and IoT. Security issues in blockchain including 51%
IV 15
attacks, double spending, Sybil attacks, scalability and interoperability challenges. Overview of recent
advancements and future trends in blockchain.
Total Contact Hours 60

Master of Computer Applications Page 63 of 76

 Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books
1) Imran Bashir, Mastering Blockchain: Unlocking the Power of Cryptocurrencies, Smart Contracts, and Decentralized
Applications, Packt Publishing.
2) Andreas M. Antonopoulos, Mastering Bitcoin: Unlocking Digital Cryptocurrencies, O’Reilly Media.
3) Melanie Swan, Blockchain: Blueprint for a New Economy, O'Reilly Media.
4) Arshdeep Bahga and Vijay Madisetti, Blockchain Applications: A Hands-On Approach, VPT.
5) Joseph J. Bambara and Paul R. Allen, Blockchain: A Practical Guide to Developing Business, Law, and Technology
Solutions, McGraw-Hill Education.

Master of Computer Applications Page 64 of 76

 DEC-4 Biometric Security
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 4th
Name of the Course Biometric Security
Course Code M24-CAP-406
Course Type DEC-4
Level of the course (As per Annexure-I 500-599
Pre-requisite for the course (if any)
This course introduces the fundamentals and practical applications of biometric
technologies for secure identification and authentication. It covers key
biometric modalities (physiological and behavioral), system processes
(enrollment, verification, identification), and performance metrics. Students
Course Objectives
will explore multimodal systems, biometric security challenges (e.g., spoofing,
liveness detection), and integration strategies. The course also addresses
ethical, privacy, and interoperability issues, with real-world applications and an
introduction to soft and DNA biometrics.
CLO-1. Understand the basics of biometric and its functionalities
Course Learning Outcomes (CLO) CLO-2 Understand and analyze biometric systems with different traits.
After completing this course, the learner will be CLO-3 Analyze the performance of biometrics by combining multiple traits
able to: and biometric sensors.
CLO-4 Understand various Biometric security issues & Applications
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one compulsory
question by taking course learning outcomes (CLOs) into consideration. The compulsory question (Question No. 1) will
consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5 questions, selecting one question
from each unit and the compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Introduction to Biometric; Biometric technologies, Biometric Enrollment, Identification & Verification
15
I process , Biometric advantages, Different Biometric traits, characteristics of ideal biometric, Comparison
of different biometrics, Accuracy in biometric systems; Error rates, Biometric deformations.
Physiological and Behavioral Biometric; Different Physiological and Behavioral Biometrics, Fingerprint,
Face, Iris Introduction, Recognition, Feature extraction and matching, IRIS segmentation- normalization,
II Gait feature extraction, Hand geometry; Behavioral Biometrics: Introduction, Features, classification and 15
properties of behavioral biometrics; Signature, Keystroke dynamics, Voice etc., merits and their demerits,
soft biometrics.
Multimodal Biometrics and Biometric Sensors; Multimodal and Multi-biometric systems, Biometric
Integration strategies, Architecture, Level of fusion, Training and adaptability, examples of multimodal
III 15
biometric systems, Performance evaluation. Different types of Biometric sensors and their use; Biometric
sensor interoperability.
Biometrics Security and Applications; Biometrics Security; Biometric system challenges, Attack on
biometric system, Liveness detection, Cancelable biometrics. Biometric standards, Applications of
IV 15
biometrics; Government sector, Commercial sector, Privacy in biometrics, Biometric Ethics and
Technology usage, DNA Biometrics.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15

Master of Computer Applications Page 65 of 76

 Part C-Learning Resources
Reference Books:
1. Anil K. Jain, Arun Ross, and Karthik Nandakumar, “Introduction to Biometrics”, Springer.
2. Anil K Jain, Patrick Flynn and Arun A Ross, “Handbook of Biometrics”, Springer.
3. James Wayman, Anil Jain, Davide Maltoni, Dario Maio, “Biometric Systems, Technology Design and Performance
Evaluation”,Springer.
4. S.Y. Kung, S.H. Lin, M.W.Mak, “Biometric Authentication: A Machine Learning Approach” Prentice Hall.

Master of Computer Applications Page 66 of 76

 DEC-4 Soft Computing
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 4th
Name of the Course Soft Computing
Course Code M24-CAP-407
Course Type DEC-4
Level of the course (As per Annexure-I 500-599
Pre-requisite for the course (if any) -
This course provides a comprehensive introduction to soft computing techniques,
including fuzzy logic, neural networks, and evolutionary algorithms. It covers
metaheuristic optimization methods such as PSO, ACO, and other bio-inspired
algorithms. Students will learn fuzzy set theory, inference systems, and design of
Course Objectives
fuzzy controllers. The course also explores various neural network models and
genetic algorithms for solving real-world optimization and classification
problems. Emphasis is placed on applications, limitations, and emerging trends
in soft computing.
CLO-1: Soft Computing and Optimization: Students will understand soft
computing techniques and apply metaheuristic optimization methods to solve
complex problems.
Course Learning Outcomes (CLO) CLO-2: Fuzzy Systems: Students will analyze fuzzy logic principles and
After completing this course, the learner will implement fuzzy inference systems for decision-making.
be able to: CLO-3: Neural Networks: Students will develop and apply neural network
models for pattern recognition and machine learning.
CLO-4: Genetic Algorithms: Students will design genetic algorithms and utilize
evolutionary principles for optimization.
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one compulsory
question by taking course learning outcomes (CLOs) into consideration. The compulsory question (Question No. 1) will
consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5 questions, selecting one question
from each unit and the compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Soft Computing: Conventional AI to Computational Intelligence; Soft Computing Constituents and Ap-
plications.
Introduction to Non-traditional Metaheuristic Optimization Techniques: Random Optimization, 15
I
Simulated Annealing, Tabu Search, Ant Colony Optimization, Particle Swarm Optimization, Harmony
Search, Memetic Algorithms, Other Evolutionary Algorithms such as Firefly Algorithm, Bee Algorithm,
Shuffled Frog Leap algorithm, Bat algorithm etc.
Fuzzy Set theory: Fuzzy Sets & Classical Sets; Operations on Fuzzy Sets, Fuzzy Relations, Linguistic
Variables.
Membership Functions: Introduction, Features & Fuzzification, Methods of Membership Value Assign-
II ment; Defuzzification. 15
Fuzzy Systems: Crisp Logic, Predicate Logic, Fuzzy Logic; Fuzzy Rule Base and Approximate Reason-
ing, Fuzzy Quantifiers; Fuzzy Inference Systems, Fuzzy Decision Making, Fuzzy Logic Control System;
Fuzzy Expert Systems.
III Neural Networks: Fundamental Concepts, Basic Models and Architecture; Machine Learning Using 15
Neural Networks; Associative Memory Networks and their Applications.
Supervised Learning Neural Networks: Perceptron Networks, Radial Basis Function Networks: Back
Propagation Neural Network: Architecture, Learning, Applications, & Research Directions; The
Boltzman Machine.
Unsupervised Learning Networks: Competitive Learning networks; Kohonen Self-Organizing Net-

Master of Computer Applications Page 67 of 76

 works; Hebbian learning; The Hopfield Network; Counter propagation Networks; Adaptive Resonance
Theory: Introduction, Architecture, & Applications; Feed forward Networks; Reinforcement Learning.
Genetic Algorithms: Introduction to Genetic Algorithms and their Terminology; Traditional
Optimization and Search Techniques vs Genetic Algorithm; Operators in Genetic Algorithms: selection,
IV crossover, mutation; Problem Solving using Genetic Algorithm; Classification of Genetic Algorithms; 15
Holland’s Schemata theorem; Advantages and Limitations of Genetic Algorithm; Applications of
Genetic Algorithm.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
1) S. N. Sivanandam& S. N. Deepa, Principles of Soft Computing, Wiley - India.
2) Jyh Shing Roger Jang, Chuen Tsai Sun, EijiMizutani, Neuro Fuzzy and Soft Computing, Prentice Hall
3) S.Rajasekaran and G.A.VijayalakshmiPai, Neural Networks, Fuzzy Logic and Genetic Algorithm: Synthesis and
Applications, Prentice-Hall of India Pvt. Ltd.
4) George J. Klir and Bo Yuan, Fuzzy Sets and Fuzzy Logic: Theory and Applications, Prentice Hall.
5) George J. Klir, Ute St. Clair, Bo Yuan, Fuzzy Set Theory: Foundations and Applications Prentice Hall.
6) Simon O. Haykin, Neural networks: a comprehensive foundation, Pearson Education.
7) Mitchell Melanie, An Introduction to Genetic Algorithm, Prentice Hall
8) Goldberg D. E., Genetic Algorithms in Search, Optimization, and Machine Learning, Pearson Education.
9) Ahmad Lotfi, Jonathan Garibaldi, Applications and Science in Soft Computing, Springer.
10) Rajkumar Roy, Mario Koppen, Soft Computing and Industry: Recent Applications, Springer.
11) James A. Freeman, David M. Skapura, Neural Networks Algorithms, Applications, and Programming Techniques,
Pearson Education India.
12) Du, Ke-Lin, Swamy, M. N. S., Search and Optimization by Metaheuristics: Techniques and Algorithms, Springer
13) OmidBozorg-Haddad, Mohammad Solgi, Hugo A. Loaiciga, Meta-heuristic and Evolutionary Algorithms for
Engineering Optimization, Wiley

Master of Computer Applications Page 68 of 76

 DEC-5 Mobile Computing
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 4th
Name of the Course Mobile Computing
Course Code M24- CAP -409
Course Type DEC-5
Level of the course (As per Annexure-I 500-599
Pre-requisite for the course (if any) -
The objective of this course is to provide students with a solid foundation in the
concepts, architecture, and technologies that drive mobile computing systems.
The course explores the evolution of mobile communication, wireless networks,
and mobile devices, highlighting the design and implementation of mobile
applications in a distributed and heterogeneous environment. Students will gain
Course Objectives
insights into mobile operating systems, wireless transmission principles, cellular
technologies, and security challenges associated with mobile environments. The
course also addresses current trends in mobile platforms and development
frameworks, enabling students to analyze, design, and build efficient and secure
mobile computing solutions suited to modern business and societal needs.
CLO 1: Demonstrate an understanding of the fundamental concepts,
architectures, and communication models of mobile computing, including
various mobile and wireless communication technologies such as GSM, GPRS,
3G/4G, LTE, and mobile IP.
CLO 2: Describe the Android platform architecture, development tools (SDK,
Course Learning Outcomes (CLO) AVD, DDMS), and the Android application lifecycle, and set up a basic Android
After completing this course, the learner will development environment using Android Studio.
be able to: CLO 3: Design and implement user interfaces for Android applications using
various layout managers and UI components, and utilize intents for inter-
component communication and interaction within applications.
CLO 4: Develop Android applications that utilize services, fragments, location-
based features, persistent storage mechanisms (internal, external, SQLite), and
integrate third-party services such as Google Maps.
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one compulsory
question by taking course learning outcomes (CLOs) into consideration. The compulsory question (Question No. 1) will
consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5 questions, selecting one question
from each unit and the compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Introduction to Mobile Computing: Concepts and scope, Features and applications of mobile computing,
Mobile and wireless devices: smartphones, tablets, PDAs, Limitations and challenges of mobile
15
I environments, Wireless communication basics: signal propagation, multiplexing, modulation, Overview
of mobile communication systems: GSM, GPRS, 3G/4G, LTE, Mobile computing architecture: Internet-
based and satellite-based models, Wireless LAN architecture and mobile IP.
Introduction: Mobile Applications, Characteristics and Benefits, Application Models, Basics of Android,
Importance and scope, Android Versions, Features of Android, Android Architecture, Android Stack,
II Android Applications Structure, Android Emulator, Android SDK, Overview of Android Studio, Android 15
and File Structure, Android Virtual Device Manager, DDMS, LogCat, Understanding Activities (Activity
Life Cycle).
III Android User Interface: Measurements –Device and pixel density independent measuring units. Layouts 15
–Linear, Relative, Grid and Table Layouts.
User Interface (UI) Components –Editable and non-editable Text Views, Buttons, Radio and Toggle

Master of Computer Applications Page 69 of 76

 Buttons, Checkboxes, Spinners, Dialog and pickers, List View, Spinner View.
Intents and Broadcasts: Intent –Using intents to launch Activities, Types of Intent, Passing data to Intents,
using Intent to dial a number or to send SMS.
Services- Callbacks and Override in application, Application Signing, API keys for Google Maps,
Publishing application to the Android Market.
Fragments –Creating fragments, Lifecycle of fragments, adding, removing and replacing fragments with
IV fragment transactions 15
Location and Mapping: location based services, Google Maps activity
Persisting Data to files: Saving to Internal Storage, Saving to External Storage
Introduction to SQLite database: creating and opening a database, creating tables, content provider
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Reference Books
1) Raj Kamal, Mobile Computing, Oxford University Press.
2) Asoke K. Talukder, Hasan Ahmed, and Roopa R. Yavagal, Mobile Computing: Technology, Applications and Service
Creation, McGraw-Hill Education.
3) Jochen Schiller, Mobile Communications, Pearson Education.
4) Reto Meier and Ian Lake, Professional Android, Wrox.
5) Wei-Meng Lee, Beginning Android Programming with Android Studio, Wiley.

Master of Computer Applications Page 70 of 76

 DEC-5 Cloud Computing and IoT
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 4th
Name of the Course Cloud Computing and IoT
Course Code M24- CAP -410
Course Type DEC-5
Level of the course (As per Annexure-I 500-599
Pre-requisite for the course (if any) -
This course introduces the fundamentals of cloud computing and IoT, covering
architectures, service models, virtualization, and enabling technologies. Students
will explore cloud services, security, and compliance, as well as IoT components,
Course Objectives
communication protocols, and ecosystem design. Hands-on experience with
platforms like Arduino and Raspberry Pi prepares students to build and manage
cloud-integrated IoT systems for real-world applications.
CLO-1 Understand core issues of cloud computing and enabling technologies.
CLO-2 Learn services provided on cloud computing platforms & security
Course Learning Outcomes (CLO)
challenges.
After completing this course, the learner will
CLO-3 Understand concepts, architecture, applications & networking
be able to:
technologies of IoT.
CLO-4 Learn IoT-oriented communication protocols and security concerns.
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one compulsory
question by taking course learning outcomes (CLOs) into consideration. The compulsory question (Question No. 1) will
consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5 questions, selecting one question
from each unit and the compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Cloud Computing: Definition and Characteristics of Cloud Computing, Evolution and Enabling
Technologies, Benefits & Challenges, NIST Reference Architecture of Cloud Computing; Deployment
Models, Service Models, Service Oriented Architecture (SOA). 15
I
Virtualization: Virtualization and Its Role in Cloud Computing; Benefits & Drawbacks of Virtualization,
Types of Virtualization, Server Virtualization, Hypervisor-Based Approaches, Virtualization Of -
Operating System, Platform, CPU, Network, Application, Memory and I/O Devices.
Cloud Computing Services & Applications: Cloud Computing Platforms; Compute Services, Storage
Services, Database Services, Applications Services, Queuing Services, E-Mail Services, Notification
Services, Media Services, Content Delivery Services, Analytics Services, Deployment& Management
II 15
Services, Identity & Access Management Services and their Case Studies.
Cloud Security and Compliance: Security Challenges in The Cloud, Data Protection and Privacy,
Compliance and Regulatory Issues.
Internet of Thing (IoT): Definition and Characteristics of IoT, Key Components of IoT (Sensors,
Actuators, Devices). IoT Ecosystems and Architecture, Conceptual Framework, Common Applications of
III IoT. Modified OSI Model for IoT/M2M Systems, M2M Vs IoT. 15
Iot Networking Technologies: NFC, RFID, Bluetooth BR/EDR and Bluetooth Low Energy, Zigbee,
WiFi.
Iot Communication Technologies & Security Issues: Constrained Nodes, Constrained Networks, Types
of Constrained Devices, Low Power and Lossy Networks. Security Issues and Challenges in IoT.
IV 15
IoT Protocols – 6LoWPAN, QUIC Protocol; Data Protocols - MQTT, MQTT-SN, CoAP, AMQP.
Introduction to Arduino and Raspberry Pi Boards.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70

Master of Computer Applications Page 71 of 76

  Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
Textbook
1) Rajkumar Buyya, James Broberg, Andrzej Goscinski, Cloud Computing – Principles and Paradigms, Wiley India Pvt.
Ltd.
2) Sudip Misra, Anandarup Mukherjee, Arijit Roy, Introduction to IOT, Cambridge
3) Arshdeep Bahga, Vijay Madisetti, Cloud Computing – A Hands-on Approach, University Press.
4) Raj Kamal, Internet of Things - Architecture and Design Principles, McGraw Hills
Reference Books
1) Mayur Ramgir, Internet of Things – Architecture, Implementation and Security, Pearson
2) Kai Hwang, Geoffrey C.Fox, and Jack J. Dongarra, Distributed and Cloud Computing, Elsevier India Private Limited
3) Anthony T. Velte, Toby J. Velte and Robert Elsenpeter, Cloud computing: A practical Approach, McGraw Hill
4) Vijay Madisetti and Arshdeep Bahga, Internet of Things (A Hands-on Approach), VPT

Master of Computer Applications Page 72 of 76

 DEC-5 Principles of Programming Languages
With effect from the Session: 2024-25
Part A - Introduction
Name of the Programme MCA
Semester 4th
Name of the Course Principles of Programming Languages
Course Code M24-CAP-411
Course Type DEC-5
Level of the course (As per Annexure-I 500-599
Pre-requisite for the course (if any) -
This course offers a foundational understanding of programming languages,
covering their evolution, paradigms, and core components. Topics include formal
language theory, parsing, language semantics, type systems, and program
Course Objectives
verification. Students will explore object-oriented concepts, control structures,
memory management, and advanced features like parallel programming and
scripting languages, gaining both theoretical and practical insights.
CLO I: Students will be able to analyze the structure and translation of
programming languages using formal methods such as BNF grammars and
recursive descent parsing, and understand the role of translators and binding
times in language implementation.
CLO II: Students will understand the theoretical foundations of programming
languages through the Chomsky hierarchy, and be able to design and interpret
finite state automata and context-free grammars while applying semantic models
Course Learning Outcomes (CLO)
like attribute grammars and denotational semantics.
After completing this course, the learner will
CLO III: Students will be able to implement and compare object-oriented
be able to:
concepts such as abstract data types, inheritance, and polymorphism, and
evaluate various sequence control mechanisms used in modern programming
languages.
CLO IV: Students will understand and apply different parameter passing
techniques, memory management strategies, and scoping rules, and explore
advanced programming topics such as parallelism, exception handling, scripting
languages, and distributed processing.
Theory Practical Total
Credits
4 0 4
Teaching Hours per week 4 0 4
Internal Assessment Marks 30 0 30
End Term Exam Marks 70 0 70
Max. Marks 100 0 100
Examination Time 3 hours
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one compulsory
question by taking course learning outcomes (CLOs) into consideration. The compulsory question (Question No. 1) will
consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5 questions, selecting one question
from each unit and the compulsory question. All questions will carry equal marks.
Contact
Unit Topics
Hours
Preliminaries: History, Impact of Programming Paradigms, Role of Programming Languages, Good
Language, Effects of Programming Environment, Translators and virtual architectures, Binding and 15
I
Binding time, Language Syntax, Analysis of Program, Synthesis of Object program, Formal translation
models: BNF Grammars, General parsing, Language translation, Recursive descent parsing.
Formal languages and automata: The Chomsky hierarchy of formal languages, regular grammars, Regular
expressions, Finite State Automata, Context-free grammars, Pushdown automata, Ambiguous grammars.
II Language Semantics: Attribute grammars, Denotational semantics, Program verification and validation, 15
Data objects, variables, constants, data types, declaration, type checking, type casting, type promotion,
Enumerators, Composite data types.
III Object Orientated concepts: Structured data types, Abstract data types, Information hiding, Subprogram 15
concepts, Good program design, Type definitions, Type equivalence, Inheritance, Derived classes,
Abstract classes, Polymorphism, Inheritance and software reuse.
Sequence control: Implicit and explicit sequence control, Sequence control within arithmetic expressions,
sequence control between statements, sequencing with non-arithmetic expressions, Subprogram Sequence

Master of Computer Applications Page 73 of 76

 control.
Miscellaneous topics: Parameter passing techniques, Static & Dynamic Scoping, Storage of variables,
Static storage, Heap Storage management, Distributed Processing, Exceptions and Exception handlers,
IV 15
Co-routines, Scheduled subprograms, Parallel programming, Processor design, Hardware and Software
architectures, Network Programming, Evolution of scripting languages, Applets, XML.
Total Contact Hours 60
Suggested Evaluation Methods
Internal Assessment: 30 End Term Examination: 70
 Theory 30  Theory 70
 Class Participation: 5
 Seminar/presentation/assignment/quiz/class test etc.: 10 Written Examination
 Mid-Term Exam: 15
Part C-Learning Resources
1) Pratt T.W., Zelkowitz M.V., Gopal T.V., Programming Languages Design and Implementation, Pearson Education.
2) Sebesta W. Robert, Concepts of Programming Languages, Pearson Education.
3) Appleby Doris &VandeKopple J. Julius, Programming Languages-Paradigm and practice, Tata McGraw Hill.
4) Sethi Ravi, Programming Languages: Concepts & Constructs, Pearson Education
5) Scott M., Programming Language Pragmatics, Elsevier India.

Master of Computer Applications Page 74 of 76

 EEC Cyber Security Fundamentals
With effect from the Session: 2024-25
Part A - Introduction
Name of Programme MCA
Semester 4th
Name of the Course Cyber Security Fundamentals
Course Code M24-CAP-413
Course Type EEC
Level of the course 400-499
Pre-requisite for the course (if an )
Course Objectives The objective of this course is to introduce students to the fundamental
concepts, principles, and practices of cyber security. It aims to develop a
foundational understanding of cyber threats, vulnerabilities, attack types,
and security mechanisms. The course covers a broad spectrum of topics
including system and network security, cryptographic techniques, risk
management, cyber laws, and ethical practices. Students will learn about
current trends in cyber attacks and the defensive techniques used to
secure data, applications, and infrastructure in both individual and
organizational contexts. The course emphasizes a practical understanding
of security tools and techniques, fostering the skills necessary to protect
information systems and ensure confidentiality, integrity, and availability
of digital assets.
Course Learning Outcomes (CLO) CLO 1: Students will be able to explain the key concepts of cyber
After completing this course, the learner will be security, identify common types of cyber threats, and understand the
able to: foundational principles of securing digital systems.
CLO 2: Students will demonstrate knowledge of cryptographic
techniques and security mechanisms used to ensure data confidentiality,
integrity, and secure communication.
CLO 3: Students will analyze system and network security
vulnerabilities and apply basic security measures to protect digital
infrastructure.
CLO 4: Students will understand the legal and ethical aspects of cyber
security and recognize current trends and professional opportunities in
the field.
Credits Theory Tutorial Total
2 2
Teaching Hours per week 2 2
Internal Assessment Marks 15 15
End Term Exam Marks 35 35
Max. Marks 50 50
Examination Time 3 3
Part B- Contents of the Course
Instructions for Paper- Setter: The examiner will set 9 questions asking two questions from each unit and one
compulsory question by taking course learning outcomes (CLOs) into consideration. The compulsory question (Question
No. 1) will consist at least 4 parts covering entire syllabus. The examinee will be required to attempt 5 questions,
selecting one question from each unit and the
compulsory question. All questions will carry equal marks.
Unit Topics Contact
Hours
Introduction to Cyber Security: Importance of cyber security in the digital era, objectives and
scope, fundamental concepts such as assets, threats, vulnerabilities, risk, attack vectors, and
I security controls. Types of cyber attacks: malware, phishing, social engineering, denial of service, 8
ransomware, man-in-the-middle attacks. Principles of cyber defense and the CIA triad
(confidentiality, integrity, availability).
Security Mechanisms and Cryptography: Authentication methods, password policies, access control
models, firewalls, intrusion detection and prevention systems (IDPS), virtual private networks
II (VPNs), antivirus tools. Basics of cryptography: symmetric and asymmetric encryption, digital 7
signatures, hashing algorithms, key management, public key infrastructure (PKI), and applications of
cryptography in securing data.
III Network and System Security: Security issues in operating systems and applications, endpoint security, 8

Master of Computer Applications Page 75 of 76

 patch management, secure configuration, wireless network security, securing web applications, browser
security, and email security. Network security architecture, IP security, and secure communication
protocols such as SSL/TLS and HTTPS.
Cyber Laws, Ethics, and Emerging Trends: Overview of cyber laws in India and global regulations
(IT Act, GDPR), ethical hacking, digital forensics, data privacy and governance. Introduction to
IV 7
security frameworks and standards (ISO 27001, NIST, OWASP). Emerging cyber threats in IoT,
cloud computing, AI, and social media.
Total Contact Hour 30
Suggested Evaluation Methods
Internal Assessment: 15 End Term Examination: 35
 Theory 15  Theory: 35
 Class Participation: 4
 Seminar/presentation/assignment/quiz/class test Written Examination
4
etc.:
 Mid-Term Exam: 7
Part C-Learning Resources
Recommended Books/e-resources/LMS:
1) William Stallings, Network Security Essentials: Applications and Standards, Pearson Education.
2) Nina Godbole and Sunit Belpure, Cyber Security: Understanding Cyber Crimes, Computer Forensics and Legal
Perspectives, Wiley India.
3) Chuck Easttom, Computer Security Fundamentals, Pearson Education.
4) Behrouz A. Forouzan, Cryptography and Network Security, McGraw-Hill Education.
5) Rao B. Ramesh and Govindarajulu, Cyber Security Fundamentals, Wiley.

Master of Computer Applications Page 76 of 76