SCHEME OF TEACHING

&
SYLLABUS
For

MASTER OF COMPUTER APPLICATIONS

M.C.A
(Two Year, Four Semester Program)
“Based on Outcome Based Education (OBE) Framework”
(Academic Session 2024 – 25)

School of Computational Sciences and Engineering

 Master of Computer Applications (MCA)

Vision

To be a recognized leader in quality technical education, fostering extensive research, and

equipping students with cutting-edge technological skills and practical experience to tackle
challenges in the rapidly evolving computing industry and academia for societal betterment.

Mission

M1. To provide quality education in Computer Science &Engineering.

M2. To capitalize/ utilize students potential in innovation, research & development.
M3. To impart professional ethics, social responsibilities and entrepreneur skills to the students.

Master of Computer Applications(MCA)

Highlights of the Program:

 Industry-oriented curriculum that is aligned with the NEP 2020
 Experienced and qualified faculty members who are experts in their fields
 State-of-the-art infrastructure and facilities, including modern labs and equipment
 Collaboration with leading industry partners to provide students with real-world experience
 Guest lectures, workshops, and seminars conducted by industry professionals
 Opportunities for research and project work in emerging technologies
 Placement assistance and career guidance for students

Program Educational Objectives (PEOs) –

The graduate of the program will be able to
PEO1: Apply domain knowledge, abstraction and conceptualization of computing models from
defined problems and requirements.
PEO2: Equip themselves with techniques of design of experiments, analysis and interpretation of
data and synthesis of information to provide a valid conclusion.
PEO3: Identify a timely opportunity and using innovation to pursue that opportunity to create
value and wealth for the betterment of the individual and society at large.

Program Outcomes/ Program Specific Outcomes:

Program Outcomes
PO1 Apply knowledge of computing fundamentals, computing Computational
specialization, mathematics, and domain knowledge appropriate Knowledge
for the computing specialization to the abstraction and
conceptualization of computing models from defined problems
and requirements.
PO2 Identify, formulate, research literature, and solve complex Problem Analysis
computing problems reaching substantiated conclusions using
fundamental principles of mathematics, computing sciences, and
relevant domain disciplines.
 PO3 Design and evaluate solutions for complex computing problems, Design
and design and evaluate systems, components, or processes that /Development of
meet specified needs with appropriate consideration for public Solutions
health and safety, cultural, societal, and environmental
considerations.
PO4 Conduct
Use research-based knowledge and research methods including Investigations of
design of experiments, analysis and interpretation of data, and Complex
synthesis of the information to provide valid conclusions. Computing
Problems
PO5 Create, select, adapt and apply appropriate techniques, Modern Tool Usage
resources, and modern computing tools to complex computing
activities, with an understanding of the limitations.
PO6 Understand and commit to professional ethics and cyber Professional Ethics
regulations, responsibilities, and norms of professional computing
practices.
PO7 Recognize the need, and have the ability, to engage in Life-long Learning
independent learning for continual development as a computing
professional.
PO8 Demonstrate knowledge and understanding of the computing and Project
management principles and apply these to one’s own work, as a management and
member and leader in a team, to manage projects and in finance
multidisciplinary environments.
PO9 Communicate effectively with the computing community, and Communication
with society at large, about complex computing activities by being Efficacy
able to comprehend and write effective reports, design
documentation, make effective presentations, and give and
understand clear instructions.
PO10 Understand and assess societal, environmental, health, safety, Societal and
legal, and cultural issues within local and global contexts, and the Environmental
consequential responsibilities relevant to professional computing Concern
practices.
PO11 Function effectively as an individual and as a member or leader in Individual and
diverse teams and in multidisciplinary environments. Team Work
PO12 Identify a timely opportunity and using innovation to pursue that Innovation and
opportunity to create value and wealth for the betterment of the Entrepreneurship
individual and society at large.

Program Specific Outcomes

Student will
PSO1: Become technology-oriented with the knowledge and ability to develop creative solutions,
and better understand the effects of future developments of computer systems and technology
on people and society as a whole.
PSO2:Inculcate the knowledge of Information Security /IoT/ Cloud Computing/ Advance
Computing / Data Science & Machine Learning principles to manage projects effectively and create
innovative career path
 Teaching Scheme
Academic session -2024-25
Master of Computer Application
(Total Credits: 96-102)
First Year: Semester 1
S. Course Code Course Title L-T-P Credit
No. Units
1. T01MCCA0101 Discrete Mathematics and Graph Theory 3-1-0 4

2. T01MCCA0102 Data Structures and Algorithms 3-1-0 4

3. T01MCCA0103 Object-Oriented Programming with Java 3-0-0 3

4. T01MCCA0104 Computer Organization and Architecture 3-1-0 4

5 T01MCCA0105 Database Management System 3-1-0 4

6 TO1MCCA106* Principles of Management & 2-0-0 2

Communication
7 T01MCCA0160 Java Programming Lab 0-0-2 1

8 T01MCCA0161 DBMS Lab 0-0-2 1

9 T01MCCA0196 Project-I 0-0-4 2

25

Semester-II
Sl. No. Course Code Course Title L-T-P Credit
Units

1. T01MCCA0201 Operating Systems 3-1-0 4

2. T01MCCA0202 Software Engineering and Project 3-0-0 3
Management
3. T01MCCA0203 Web Technologies 3-0-0 3
4. T01MCCA0204 Advanced Java Programming 3-0-0 3
5. T01MCCX02XX Elective-1 3-1-0 4

6. T01MCCX02XX Elective-2 3-1-0 4

7. T01MCCA0260 Web Technologies Lab. 0-0-2 1

8. T01MCCA0261 Advanced Java Programming Lab 0-0-2 1

9. T01MCCA0296 Project-II 0-0-4 2

25
Second Year: Semester-III
Sl. No. Course Code Course Title L-T-P Credit Units

1 T01MCCA0301 Design and Analysis of Algorithm 3-1-0 4

2 T01MCCA0302 Data Communication and Computer 3-0-0 3
Networks
3 T01MCCA0303 Artificial Intelligence 3-0-0 3
4 T01MCCX03XX Elective 3 4-0-0 4
5 T01MCCX03XX Elective 4 4-0-0 4
6 T01MCCA0304 Data Warehousing & Data Mining 2-1-0 3
7 T01MCCA0360 Data Mining Lab 0-0-2 1
8 T01MCCA0361 Design and Analysis of Algorithm Lab 0-0-2 1
9 T01MCCA363 Technical Seminar 0-0-2 1
10 T01MCCA0396 Project-III 0-0-4 2
26

Semester IV
Sl. Course Code Course Title Credit
No. Units

T01MCCA0490 Internship 20
1.
Total 20
Specialization Courses
Advanced Computing:
1. High-Performance Computing (T01MCCC0201)
2. Parallel and Distributed Computing (T01MCCC0202)
3. Image Processing and Computer Vision (T01MCCC0301)
4. Artificial Intelligence and Machine Learning (T01MCCC0302)

Cloud Computing:
1. Cloud Computing Architecture and Management (T01MCCL0201)
2. Cloud Service Models and Applications (T01MCCL0202)
3. Cloud-Based Big Data Analytics (T01MCCL0301)
4. Cloud Security and Privacy (T01MCCL0302)

Internet of Things:
1. Sensor Networks and Data Acquisition (T01MCCI0201)
2. IoT Platforms and Applications (T01MCCI0202)
3. IoT Infrastructure and Services (T01MCCI0301)
4. IoT Security and Privacy (T01MCCI0302)

Network and Information Security:

1. Cryptography and Network Security (T01MCCN0201)
2. Ethical Hacking and Penetration Testing (T01MCCN0202)
3. Mobile and Wireless Network Security (T01MCCN0301)
4. Network Forensics and Incident Response (T01MCCN0302)

Data Science & Machine Intelligence:

1. Data Analytics with Python (T01MCCD0201)
2. Statistical Techniques for Data Analysis (T01MCCD0202)
3. Machine Learning Techniques (T01MCCD0301)
4. Data Visualization and Analytics (T01MCCD0302)

Full stack development

1. Introduction to HTML, Bootstrap and CSS (T01MCCF0201)
2. Programming with JavaScript (T01MCCF0202)
3. Node JS and Mongo DB Development (T01MCCF0301)
4. Angular JS Development (T01MCCF0302)
 Semester-I

Course: Discrete Mathematics and Graph Theory Course Code: T01MCCA101

Credits Units: 4 L-T-P 3–1– 0

CO1: Apply concept of Predicate Calculus in computer science like design of computing machines,
artificial intelligence, definition of data structures for programming languages etc. (Application)
CO2: Understand the concepts of graph theory, Lattices, and Boolean Algebrain analysis of various
computer science applications. (Knowledge, Comprehension)
CO3: Apply the knowledge of Boolean algebra in computer science for its wide applicability in
switching theory, building basic electronic circuits and design of digital computers. (Knowledge,
Application)
CO4: Understand the application of various type of graphs in real life problem. (Knowledge,
Comprehension)
CO5: Apply abstract concepts of graph theory in modeling and solving non-trivial problems in
different field of study. (Application, Analysis)

Unit I
Logic: Propositional equivalence, predicates and quantifiers, Methods of proofs, proof strategy,
sequences and summation, mathematical induction, recursive definitions and structural
induction, program correctness. Counting: The basics of counting, the pigeonhole principle,
permutations and combinations, recurrence relations, solving recurrence relations, generating
functions, inclusion-exclusion principle, application of inclusion-exclusion.

Unit II
Relations: Relations and their properties, n-array relations and their applications, representing
relations, closure of relations, equivalence of relations, partial orderings. Graph theory:
Introduction to graphs, graph terminology, representing graphs and graph isomorphism,
connectivity, Euler and Hamilton paths, planar graphs, graph coloring, introduction to trees,
application of trees.

Unit III
Group theory: Groups, subgroups, generators and evaluation of powers, cosets and Lagrange's
theorem, permutation groups and Burnside's theorem, isomorphism, automorphisms,
homomorphism and normal subgroups, rings, integral domains and fields.

Unit IV
Lattice theory: Lattices and algebras systems, principles of duality, basic properties of algebraic
systems defined by lattices, distributive and complimented lattices, Boolean lattices and Boolean
algebras, uniqueness of finite Boolean expressions, prepositional calculus.

Unit V
Coding theory: Coding of binary information and error detection, decoding and error correction.

Text Books:
1. K.H. Rosen: Discrete Mathematics and its application, 5th edition, Tata McGraw Hill.
2. C. L. Liu: Elements of Discrete Mathematics, 2nd edition, TMH 2000.
3. B.Kalman: Discrete Mathematical Structure, 3rd edition
References:
1. “Discrete Mathematical Structures”: Tremblay and Manohar, TataMcGraw Hill
2. “Discrete Mathematics”: 1stedition by Maggard Thomson
3. “Discrete M a t h e m a t i c s ”: Semyour Lipschutz, Varsha Patil IIndEdition Schaum’s Series,
TMH

Course: Data Structures and Algorithms Course Code: T01MCCA102

Credits Units: 4 L-T-P 3-1-0

CO1 Explain the time and space complexity of the algorithm.

CO2 Describe elementary data structure like binary search tree, Red Black tree, binomial, B tree
and Fibonacci heap.
CO3 Compare between design techniques of algorithm like Divide and Conquer, Dynamic
algorithm, Greedy algorithm, backtracking and Amortized algorithm.
CO4 Demonstrate different graph traversal algorithm like BFS, DFS, Prim’s, Kruskal’s, single source
shortest path and all pair shortest path .
CO5 Examine different string matching algorithm like naïve string matching, robin-karp algorithm,
kurth-morrispratt algorithm.

Unit I
Introduction to Algorithms Analysis of algorithm, Design of algorithm, complexity of algorithm,
asymptotic notations, Recurrences. Sorting in polynomial time: Insertion sort, Merge sort, Quick
sort, heap sort. Sorting in linear time: counting sort, bucket sort, radix sort. Medians and order
statics.

Unit II
Elementary data structure binary search tree. Advanced data structure Red Black tree,
Augmenting data structure, binomial heaps, B-tree, Fibonacci heap and data structure for disjoint
sets.

Unit III
Advanced design and analysis techniques Dynamic programming, Greedy algorithm, Backtracking,
Amortized analysis.

Unit IV
Graph algorithm Breadth first search, Depth first search, Minimum spanning tree, Kruskal’s
algorithms, Prim’s algorithms, Single source shortest path, All pair shortest path, Maximum flow
and Traveling salesman problem.

Unit V
String matching: The naïve String Matching algorithm, The Rabin-Karp Algorithm, String Matching
with finite automata, The Knuth-Morris Pratt algorithm. Randomized algorithms, string matching,
NP-hard and NP-completeness, Approximation algorithms.

Text Book (s):

1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to
Algorithm, Tata Mc-Graw Hill, 2nd Edition, 20014.
References:
Horowitz Sahani, Fundamentals of Computers Algorithm, Golgotia Publications, 2016.
Parag H. Dave, Himanshu B. Dave, Design and Analysis of Algorithms, Pearson Education,
2008.
Course: Object-Oriented Programming with Java Course Code: T01MCCA103
Credits Units: 3 L-T-P: 3-0- 0

Course Objectives:
1. To introduce students to object-oriented programming concepts and principles.
2. To develop proficiency in designing and implementing object-oriented programs in Java.
3. To provide practical experience in debugging and testing Java programs.
4. To prepare students for further study in computer science and software development.0
Course Outcomes:

By the end of this course, students will be able to:

CO1 Understand the principles of object-oriented programming, including encapsulation,
inheritance, and polymorphism.
CO2 Design and implement classes and objects in Java to model real-world entities.
CO3 Use inheritance and polymorphism to create hierarchies of classes and achieve code reuse.
CO4 Implement interfaces and abstract classes to define common behaviors and achieve
abstraction.
CO5 Handle exceptions and errors effectively using Java's exception handling mechanism.

Unit I
Introduction to Java: Importance and features of Java, Keywords, constants, variables and Data
Types, Operators and Expressions, Decision Making, Branching and Looping. Introducing classes,
objects and methods: defining a class, adding variables and methods, creating objects,
constructors, class inheritance. Arrays and String

Unit II
Exception Handling: Fundamentals exception types, uncaught exceptions, throw, throw, final, built
in exception, creating your own exceptions, Multithreaded Programming: Fundamentals, Java
thread model: priorities, synchronization, messaging, thread classes, Run able interface, inter
thread Communication, suspending, resuming and stopping threads.

Unit III
Input/Output Programming: Basics, Streams, Byte and Character Stream, predefined streams,
Reading and writing from console and files. . Networking: Basics, networking classes and
interfaces, using java.net package, doing TCP/IP and Data-gram Programming
Unit IV
The Collection Framework: collection interfaces, collection classes(Array, List, LinkedList, Hash
set), Accessing a Collection via an Iterator, Vector, More utility class: String Tokenizer, Date.

Unit V
Event Handling: Different Mechanism, the Delegation Event Model, Event Classes, Listener
Interfaces, Adapter and Inner Classes, Working with windows, Graphics and Text, using AWT
controls, Layout managers and menus, Java Applet. Beans: Introduction to Java Beans and Swings,
Servlets

Text Book (s):

1. Patrick Naughton and Herbertz Schildt, (2006) “Java-2 the Complete Reference”, TMH, 7th
Edition.
2. E. Balaguruswamy, (2007) “Programming with Java: A Primer”, TMH, First Reprint.
References:
3. Horstmann, “Computing Concepts with Java 2 Essentials”, (2013), John Wiley and sons inc,
Third Edition.
4. Kathy Sierra, “Head First Java”, O’Rielly, (20017), Second Edition, February.

Course: Computer Organization and Architecture Course Code: T01MCCA104

Credits Units: 4 L-T-P : 3-1-0

CO 1 Describe functional units of digital system and explain how arithmetic and logical operations
are performed by computers
CO 2 Describe the operations of control unit and write sequence of instructions for carrying out
simple operation using various addressing modes.
CO 3 Design various types of memory and its organization.
CO 4 Describe the various modes in which I/O devices communicate with CPU and memory.
CO5 Elaborate classification of parallel computer and describe various architectural schemes.

Unit I
Introduction: Functional units of digital system and their interconnections, buses, bus
architecture, types of buses and bus arbitration. Register, bus and memory transfer. Processor
organization: general registers organization, stack organization and addressing modes.
Unit II
Arithmetic and logic unit: Look ahead carries adders. Multiplication: Signed operand
multiplication, Booths algorithm and array multiplier. Division and logic operations. Floating point
arithmetic operation, Arithmetic & logic unit design. IEEE Standard for Floating Point Numbers
Unit III
Control Unit: Instruction types, formats, instruction cycles and sub cycles (fetch and execute etc),
micro operations, execution of a complete instruction. Program Control, Reduced Instruction Set
Computer, Pipelining. Hardwire and micro programmed control: micro-program sequencing,
concept of horizontal and vertical microprogramming
Unit IV
Memory: Basic concept and hierarchy, semiconductor RAM memories, 2D & 2 1/2D memory
organization. ROM memories. Cache memories: concept and design issues & performance,
address mapping and replacement Auxiliary memories: magnetic disk, magnetic tape and optical
disks Virtual memory: concept implementation.
Unit V
Input / Output: Peripheral devices, I/O interface, I/O ports, Interrupts: interrupt hardware, types
of interrupts and exceptions. Modes of Data Transfer: Programmed I/O, interrupt initiated I/O and
Direct Memory Access., I/O channels and processors. Serial Communication, standard
communication interfaces. Advanced Computer Architecture: Parallel Architecture-Classification
of Parallel Systems, Flynn’s Taxonomy, Array Processors, Clusters, and NUMA Computers

Text Book (s):

1. Computer System Architecture, M. Morris Mano, Pearson Education.
2. Kai Hwang, “Advanced Computer Architecture”, McGraw-Hill, Revised Edition, 01/Feb/2003

Reference Books:
1. Modern Digital Electronics, R.P.Jain, 4e, Tata Mc Graw Hill.
2. Computer Organization & Architecture, William Stallings, 8e, Pearson Education.
3. Computer Architecture & Organization, John P. Hayes, 3e, Tata McGraw Hill.
4. Computer Organization, 5e, Carl Hamacher, Zconko Vranesic & Safwat Zaky, Tata McGraw Hill.
5. Digital Computer Fundamentals, Bartee C. Thomas , McGraw-Hill International Edition
6. Kai Hwang, “Advanced Computer Architecture”, McGraw-Hill, Revised Edition, 01/Feb/2003
7. Computer Architecture & Organization, Nicholas Carter, McGraw Hill.
8. Computer Architecture & Organization, 2e, Miles Murdocca & Vincent Heuring, Wiley India.

Course: Database Management System Course Code: T01MCCA105

Credits Units:4 L-T-P: 3-1-0

Course Outcome

CO 1 Describe the fundamental elements of relational database management systems

CO 2 Prepare the design of database applications using ER model
CO 3 Explain the concepts of relational database design, transaction management & data
storage structures.
CO 4 Improve the database design using normalization technique
CO 5 Utilize database languages for implementing database applications.
CO 6 Apply successful concurrent transaction execution and data recovery.

Unit-I
Basic concepts Database & Database Users. Characteristics of the Database Approach advantages
of DBMS. Data Models, Schemas & Instances. DBMS Architecture & Data Independence. System
Architecture for DBMS and Data Dictionary, Database Users Data Base languages & Interfaces.
Data Modeling using the Entity-Relationship Model -Entity types, Entity Sets, Attributes and Keys,
Relationship, Relationship Types, Week Entity Types, Structural Constraints, Enhanced ER Model-
Specialization Generalization, Constraints on Specialization Generalization.

Unit-II
Relational Model, Languages & Systems Relational Data Model Concepts and Constraints.
Relational Algebra - select, project, set theoretic, join operations. Overview of Relational Calculas.
SQL - A Relational Database Language. Data Definition commands, View and Queries , transaction
commands, Specifying Constraints & Indexes in SQL.

Unit -III
Relational Data Base Design Function Dependencies & Normalization for Relational Databases.
Informal design guidelines for relation schemas, Functional Dependencies. Normal forms based
on primary keys (INF, 2NF, 3NF& BCNF). Lossless join & Dependency preserving decomposition.
Multivalued dependencies, join dependencies (4NF & 5NF), Denormalization.

Unit-IV
Transactions, Concurrency Control, Recovery Techniques Basic concept; ACID properties;
transaction state; implementation of atomicity and durability; concurrent executions; basic idea
of serializability; view and conflict serializabllity Recovery Techniques Failure Classification ,
Storage Structure, Recovery and Atomicity Log Based Recovery, Shadow Paging ,stable storage
implementation, data access; recovery and atomicity - log based recovery, deferred database
modification, immediate database modification, checkpoints.
 Unit-V
Emerging fields in DBMS Distributed databases; Basic idea; distributed data storage; data
replication; data fragmentation horizontal, vertical and mixed fragmentation. Concepts of
Multimedia databases, Object oriented data base management systems. Data Warehousing &
mining.
Text Book (s):

1. Silberschatz, Abraham Korth, Henry F. Sudarshan, S., (2019) Database System Concepts,
(6thedition), Mc. GrawHill.
References:
1. Elmasri, R., & Navathe, S. (2017). Fundamentals of Database Systems (7th edition). Addison-
Wesley Publishing Company.
2. Ramakrishnan, (2014). Database Management System (3rd edition). McGraw-Hill.
3. Date, C. J. (2015). An Introduction to Database System (8th edition). Addison Wesley.
4. Bayross, I. (2010). SQL, PL/SQL: The programming language with Oracle (4th edition). BPB.

Course: Principles of Management and Communication Course Code: XXXXXXXXXXX

Credits Units: 2 L-T-P : 2-0-0

CO1: Describe primary features, processes and principles of management.

CO2: Explain functions of management in terms of planning, decision making and organizing.
CO3: Illustrate key factors of leadership skill in directing and controlling business resources and
processes.
CO4: Exhibit adequate verbal and non-verbal communication skills
CO5: Demonstrate effective discussion, presentation and writing skills.

Unit-I
Management: Need, Scope, Meaning and Definition. The process of Management, Development
of Management thought F.W. Taylor and Henry Fayol, Horothorne Studies, Qualities of an Efficient
Management.

Unit-II
Planning & Organising: Need, Scope and Importance of Planning, Steps in planning, Decision
making model. Organising need and Importance, Organisational Design, Organisational structure,
centralisation and Decentralisation, Deligation.

Unit-III
Directing & Controlling: Motivation—Meaning, Importance, need. Theories of Motivation,
Leadership—meaning, need and importance, leadership style, Qualities of effective leader,
principles of directing, Basic control process, Different control Techniques.

Unit-IV
Introduction to Communication: What is Communication, Levels of communication, Barriers to
communication, Process of Communication, Non-verbal Communication, The flow of
Communication: Downward, Upward, Lateral or Horizontal (Peer group) Communication,
Technology Enabled communication, Impact of Technology, Selection of appropriate
communication Technology, Importance of Technical communication.
Unit-V
Business letters : Sales & Credit letters; Claim and Adjustment Letters; Job application and
Resumes. Reports: Types; Structure, Style & Writing of Reports. Technical Proposal: Parts; Types;
Writing of Proposal; Significance. Nuances of Delivery; Body Language; Dimensions of Speech:
Syllable; Accent; Pitch; Rhythm; Intonation; Paralinguistic features of voice; Communication skills,
Presentation strategies, Group Discussion; Interview skills; Workshop; Conference; Seminars.

1. Koontz ‘O’ Donnel - Essentials of Management

2.Stoner & Wanket - Management
3.Stephen P. Robbins - Management
4.Singh & Chhabra - Business Organisation & Management
5.J. K. Jain - Functions and Process of Management

Course: Database Management System Lab Course Code: T01MCCA0161

Credits Units: 1 L-T-P : 0-0-2

List of Programs:
1. Data definition languages (ddl) commands of base tables and views
2. Data manipulation language (dml) of base tables and views
3. Constraints
4. Joins
5. Set and Aggregation Functions
6. Cursors
7. Triggers- menu design.
8. Procedures
9. Functions
10. NoSQL Tools