Master of Computer Application (MCA)

Syllabus

(2024-2026 Batch)

NIST UNIVERSITY
Institute Park, Pallur Hills, Berhampur,
Odisha, India – 761008
Page#1
4.2.6 Master in Computer Application (MCA)

MCA Course Structure

First - Year Course Structure (I Semester)

Course
S. No. Course Code Course Title L P T Credits
Category

1 CC MCA-500 Data Structure using C 3 0 4 5

2 CC MCA-501 Computer Organization and Architecture 3 0 0 3

3 CC MCA-502 Database Management Systems 3 0 4 5

Mathematics – I:
4 CC MCA-503 (Mathematical Foundation of Computer 3 0 0 3
Science)
5 AEC MCA-590 Communicative English 2 0 4 4

Total Credits 20

First -Year Course Structure (II Semester)

Course
S. No. Course Code Course Title L P T Credits
Category
Object Oriented Programming using
1 CC MCA-504 3 0 4 5
JAVA
2 CC MCA-505 Computer Networks 3 0 4 5

3 CC MCA-506 Operating Systems 3 0 4 5

4 CC MCA-507 Software Engineering 3 0 0 3

Mathematics - II
5 CC MCA-508 3 0 0 3
(Probability &Combilatorcs)
6 AEC MCA-591 Personality and Soft Skill Development 0 0 4 2

Total Credits 23

Page#2
 Second - Year Course Structure (III Semester)

Course
S. No. Course Code Course Title L P T Credits
Category

1 CC MCA-600 Design and Analysis of Algorithms 3 0 4 5

2 CC MCA-601 Data Warehousing and Data Mining 3 0 0 3

3 CC MCA-602 Python Programming 3 0 4 5

4 CC MCA-603 Artificial Intelligence 3 0 0 3

5 DSE MCA-630 Department Specific Elective - I 3 0 0 3

6 PR MCA-680 Minor Project/Seminar 0 0 8 4

7 PR MCA-681 Summer Internship 0 0 2 1

Total Credits 24

Department Specific Elective - I

MCA-630A: Computer Graphics and Multimedia
MCA-630B: Natural Language Processing
MCA-630C: Wireless &Sensor Network
MCA-630D: Soft Computing Techniques
MCA-630E: CBOT (Computer-based optimization techniques)

Page#3
 Second - Year Course Structure (IV Semester)

Course
S. No. Course Code Course Title L P T Credits
Category

1 CC MCA-604 Machine Learning 3 0 4 5

2 CC MCA-605 Internet &Web Technology 3 0 4 5

3 DSE MCA-631 Department Specific Elective - II 3 0 0 3

4 PR MCA-682 Major Project 0 0 24 12

Total Credits 25

Department Specific Elective – II

MCA-631A: Internet of Things (IoT)
MCA-631B: Computer Network Security
MCA-631C: Web application Development
MCA-631D: Cloud Computing
MCA-631E: Data Science
MCA-631F: Software Testing and Quality Assurance
MCA-631G: Blockchain Technology

Page#4
FIRST SEMESTER DETAIL SYLLABUS
MCA-500 Data Structure using C (3-0-4) 5 Credits

Course Objective
1: student must be able to write programs in C
2: Student must have basic knowledge on Data structures
3: He must implement above in C language
4: Perform a mini project on them

Course Outcome:
1. To understand the basics of C Programming and its constructs
2. To understand concepts about functions, pointers and structures
3. To Understand basic concepts about stacks, queues, lists with implementation in C
4. Understanding Tree data structure with types of trees

Module- I: Introduction to Programming : (12 Hrs.)

Structure of C Program, Keywords, Identifiers, Primitive Data types, variables, constants,
Operators and Expressions: Expression evaluation: Operator Precedence and
Associativity. Conditional Branching: One (simple if), two (if else) and multi way selection
(else if ladder and switch and nested selection), Iteration and loops: Iterative
statements, nested loops, break and continue statements. Arrays & Strings: One -
dimensional, Two dimensional and Multi-dimensional arrays. Sorting and Searching:
Bubble sort, Selection sort, Q uick sort and Merge sort. Linear and binary search,

Module- II: Function, Pointer & Structure: (12 Hrs.)

Function: Declaration, Definition, Call by value, Call by reference, Scope of variables,
Storage classes, Recursive functions. Defining pointers, pointers to 1D arrrays, Pointer
to function, Pointer to structure,.Dynamic memory allocation. Structure - Defining
structures and Array of Structures, Structure vs Union,

Module- III: Introduction to Data Structure:

(10Hrs.)
Abstract Data Types – Definition and Representation, ADT of Stack and Queue , Stack
operations, Applications of stack- reversing string, Decimal to Binary conversion, infix to
postfix. Queue: linear & circular queue. self-referential structures, Singly Linked list
Double linked list operations.

Module- IV: Tree (06 Hrs.)

Tree: Definition and Terminology, Binary tree, Strictly Binary tree, complete Binary tree
and almost complete binary tree, Binary tree traversals. Binary Search Tree (BST) –
Insert into BST, AVL Tree – Balance factor, Insertion into AVL and Rotations.

Page#5
Text Books:
1. Behrouz A. Forouzan& Richard F. Gilberg, “A structured Programming Approach
Using C”, 3rd Edition, Cengage Publication, ISBN: 9788131503638, 2007.
2. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, 2 nd
Edition, Prentice Hall of India, 2015.
3. Byron Gottfried, Schaum's Outline of Programming with C, 3rd Edition,
McGrawHillBook, 1st July 2017.
4. Data Structures: A Pseudocode Approach with C – Gilberg&Forouzan, 2nd Edition,
Cengage, Indian Reprint 2016
5. Data Structures and Program Design in C – Kruse, Leung, 2nd Edition,
Pearson,2008

Course Name Programming and Data Structures

Course Link https://nptel.ac.in/courses/106105085/4
Course Dr. P. P. Chakrabarti
Instructor Department of Computer Science and Engineering
Indian Institute of Technology Kharagpur

Page#6
MCA-501 Computer Organization and Architecture (3-0-0) 3 Credits

Course Objectives:
1. Able to understand the basic organizational structure of computer system along with
the operational concepts, the concepts of ALU, CU and Memory design, the concept of
cache memory, virtual memory and principle of pipelining.
2. Able to solve the problems related to cache memory and performance, page
replacement algorithms, memory construction, arithmetic operations, and pipelining.
3. Able to to explain and apply the basic concepts of memory, its construction and
analysis of performance related memory hierarchy.
4. Able to analyze the performance differences of computing evolution on basic operation
like addition, multiplication and division, page replacement algorithms and cache memory
mappings.
.
Module-I: (10 hrs)
Functional blocks of a computer: CPU, memory, input-output subsystems, Von-
Neumanvs Harvard Architecture, Instruction set architecture of a CPU–registers,
instruction execution cycle, BasicOperational Concepts, addressing modes, instruction
set. Case study – instruction sets of somecommon CPUs.
Module-II (10 hrs)
Computer arithmetic – integer addition and subtraction, ripple carry adder, carry look-
ahead adder,etc. multiplication – shift-and add, Booth multiplier, carry save multiplier,
etc. Division restoring andnon-restoring techniques, signed number representation, fixed
and floating-point representations,floating point arithmetic.
Module-III (10 hrs)
Memory system design: semiconductor memory technologies, memory organization.
Memory organization: Memory interleaving, concept of hierarchical memory organization,
cachememory, cache size vs. block size, mapping functions, replacement algorithms,
write policies.
Module-IV (10 hrs)
Peripheral devices and their characteristics: Input-output subsystems, I/O device
interface, I/O transfers–program controlled, interrupt driven and DMA, privileged and
non-privileged instructions,software interrupts and exceptions. Basic concepts of
pipelining, throughput, speedup and efficiency,pipeline hazards: Structural hazards, data
hazards, control hazards.

Page#7
Course Outcomes:
1. Understand the basic organization of computer and instruction execution cycles along
with
their instruction formats and different addressing modes.
2. Gain knowledge on the architectural and circuit level design of arithmetic logic unit
& control
unit and can solve different arithmetic problems.
3. Explain and apply the basic concepts of memory, its construction and analysis of
performance
related memory hierarchy.
4. Gain knowledge on the different I/O interfaces, modes of data transfer and basic
principles of
pipelining.

TEXT BOOKS:
1. “Computer Organization” 5th edition Carl Hamacher, Zvonkovranesic, SafwatZaky,
McGraw Hill.

2.“Computer Organization and Design: The Hardware/Software Interface”, 5th Edition

by David A. Patterson and John L. Hennessy, Elsevier.

REFERENCE BOOKS:
1. “Computer Architecture and Organization”, 3rd Edition by John P. Hayes,
WCB/McGraw-Hill.

2. “Computer Organization and Architecture: Designing for Performance”, 10th Edition

by William Stallings, Pearson Education.

3. “Computer System Design and Architecture”, 2nd Edition by Vincent P. Heuring and
Harry F. Jordan, Pearson Education.

Course Name Computer Organization and Architecture

Course Link https://nptel.ac.in/courses/106/106/106106166/
Course V. Kamakoti
Instructor Indian Institute of Technology Madras, Chennai, India.

Page#8
 MCA-502 Database Management Systems (3-0-0) 5 Credits

Course Objective:
1. Introducing basic database concepts like E-R Diagram, Relational Algebra,
2. Designing Normalized databases
3. Advantages, disadvantages and implementation of NoSQL database design in contrast to SQL
based database.
4. Introducing database transactions

Module-1: (10 Hours)

Introductory concepts of DBMS: Introduction and applications of DBMS, Purpose of data base,
Data, Independence, Database System architecture- levels, Mappings. Entity-Relationship model:
Basic concepts, Design process, constraints, Keys, Design issues, E-R diagrams, weak entity sets.
Reduction to E-R database schema.

Module-2: (10 Hours)

Database Programming: Relational Algebra and calculus (Domain and Tuple relational calculus)
Basics of SQL, DDL, DML, creation, alteration, defining constraints – Primary key, foreign key,
unique, not null, check, IN operator, Functions - aggregate functions, Built-in functions –
numeric, date, string functions, set operations, sub-queries, correlated sub-queries, Use of group
by, having, order by, join and its types, Exist, Any, All , view and its types. Transaction control
commands –Commit, Rollback, save point. Concepts, Cursors, Stored Procedures, Stored
Function, and Database Triggers.

Module-3: (10 Hours)

Normalization of Databases: Functional Dependency – definition, trivial and non-trivial FD,
closure of FD set, closure of attributes, irreducible set of FD, Normalization – 1NF, 2NF,
3NF,Decomposition using FD- dependency preservation, BCNF, Multi- valued dependency, 4NF,
Join dependency and 5NF.

Module-4: (10 Hours)

Transaction Management: Transaction concepts, properties of transactions, serializability of
transactions, testing for serializability, System recovery, Two- Phase Commit protocol, Recovery
and Atomicity, Log-based recovery, concurrent executions of transactions and related problems,
Locking mechanism, solution to concurrency related problems, deadlock, , two-phase locking
protocol. User security, grants, privileges, roles, access control. Introduction to NoSQL.

Course Outcome:
1. Designing database and manipulating data for different real life problems
2. Apply SQL queries for retrieving columns using functions and related database.
3. Displaying data from multiple table using join and sub-queries
4. Designing and differentiating solutions using schema based database.

Suggested Books:

Page#9
1. Elmasari;Navathe, Fundamentals of Database System, Seventh Edition, Pearson Education
Book .
2. Sudarshan, Korth, Database System Concepts, 6th edition, McGraw-Hill Education Book .
3. Prof. ParthaPratim Das, Department of Computer Science & Engineering, IIT Kharagpur
https://onlinecourses.nptel.ac.in/noc18_cs15/preview
4. Prof. Arnab Bhattacharya, IIT Kanpur https://nptel.ac.in/courses/106104135/
5. Dr. Leo Mark, Georgia Institute of Technology, https://in.udacity.com/course/database -
systems-concepts-design--ud150

Page#10
MCA-503 Mathematics-I(Mathematical foundation of Computer Science)(3- 3 credit
0-0)

COURSE OBJECTIVES:
● Apply the knowledge of matrix to compute Eigen values, Eigen vectors, solve system
of linear equations, inverse of matrices.
● To develop logical thinking and its applications to computer science.
● Mathematical (computing, reasoning, analytic, and geometric) approach to data
analysis.
● To understand the concept of graphs, theory and their application in solving practical
network based problems.

SYLLABUS
Module-I: Systems of Linear Equations, Eigen Values and Eigen Vectors [8
Hrs]
Basic concept of matrix and its operation, System of linear equations (Gauss -Elimination
and Gauss-Jordan method), Rank of a matrix, Existence and uniqueness of solution of
linear systems, Inverse of matrices (Gauss-Jordan Method), Eigen values and Eigen
vectors of a matrix with their properties.

Module-II: Logic and Counting Principle [9

Hrs]
Logic: Propositions, Propositional equivalences, Predicate and quantifiers, Rules of
inference, Introduction to proofs, Mathematical induction.
Counting: The basics of counting, the Pigeonhole principle, Permutations and
combinations, Recurrence relations, Solving linear recurrence relations, Generating
functions, Inclusion-Exclusion and applications of Inclusion-Exclusion.
Module-III: Relations, Elementary Algebraic Structure [08
Hrs]
Relations: Relations and their properties, n-ary relations and their applications,
Representing relations, Closures of relations, Equivalence relations, Partial orderings.
Definition and elementary properties of groups, subgroups, ring, fields, and vector
spaces.
Module-IV: Lattice and Boolean Algebra [07
Hrs]
Boolean Algebras: Lattices and algebraic systems, Principle of duality, Basic properties
and algebraic systems defined by lattices, Distributive and complemented lattices,
Boolean lattices and Boolean algebras.
Module-V: Graph Theory [08
Hrs]
Introduction to graphs, Graph Terminology, Representing Graphs and Graph
Isomorphism, Euler and Hamilton Paths, Shortest Path Problem, Dijkstra’s Algorithm,
Planar Graphs (Euler’s formula and its applications only), Graph colouring.
Page#11
Trees: Introduction to Trees, Spanning Tree, Minimum Spanning Tree, Kruskal’s
Algorithm, Prim’s Algorithm,
OUTCOMES
1. Application of matrix theory and linear algebra to solve system of equations .
2. Applying set theory and logic to solve the real valued problems easily.
3. Solving different problems suing Lattice..
4. Solving different practical network based problems through graphical methods..

TEXT BOOKS
1. K. H. Rosen, Discrete Mathematics and Its Applications, 6th Edition, Tata McGraw Hill
Publication. [Chapters - 1(1.1 – 1.3, 1.5 – 1.6), 4(4.1), 5(5.1 – 5.3), 6(6.1 – 6.2, 6.4 –
6.6), 7(7.1 – 7.6), 8(8.1 – 8.3, 8.5 – 8.8), 9(9.1, 9.4, 9.5)]
2. C. L. Liu and D. P. Mohapatra, Elements of Discrete Mathematics–A Computer
Oriented Approach, 4th Edition, Tata McGraw Hill, 2013. [Chapter – 10(10.1 – 10.3,
10.10), 11(11.1 – 11.5)]
3. E. Kreyszig, Advanced Engineering Mathematics, 10th Edition, Willey. [Chapter –
7(7.1 – 7.5, 7.8)]

REFERENCE BOOKS
1. B. Kolman, R.C. Busby, and S.C.Ross, Discrete Mathematical Structures, Pearson
Education.
2. J. P. Trembly, and R. Manohar, Discrete Mathematical structures with Applications to
Computer Science, Tata McGraw Hill.

Page#12
MCA-590 Communicative English (2-0-0) 4 Credits

CourseObjectives:
1. To communicate effectively by developing competent textual, visual, and non-
verbalcommunicationabilities.
2. Todrafteffectiveformalwrittenbusinessmessagesinvariousformatsandstyles.
3. Tolearntheskillstoeffectivelydeliverformaloralpresentationstoavarietyofaudiences
inmultiplecontexts
4. To be acquainted with the soft skills and various selection procedures adopted
bytherecruiters.

CourseOutcomes:

Attheend ofthecourse,thestudentwillbeableto:
1. Becomeadeptintheiruseofthespokenwordininterpersonalcommunication,smallgroupi
nteractionandpublicspeaking.
2. Use an appropriate style and format to write letters (Formal and
Informal),prepareresult-orientedreports,prepareCVsanddraftbusinessdocuments.
3. Gatherandprepareinformationandapplyittopersuadeorarticulateone’sownpointofclea
rlyandefficiently.
4. Comprehendtheemployabilitymarket,identifytheorganizationstogetgoodplacementsa
ndbroadencareerplansbydevelopingall-roundpersonality.

SYLLABUS

Unit-1: UnderstandingFundamentalsofCommunication

Significance of Communication Skills, 7Cs of communication, Process and Factors

ofCommunication, communication Barriers, Difference between General and
TechnicalCommunication, Verbal and Non-verbal Communication, Formal and
Informalchannels ofCommunication.

Unit-2 LearningVerbalcommunication

Introduction to Phonetics, IPA Chart, British Received Pronunciation,

PresentationSkills,GroupDiscussion,InterviewSkills.DecodingBodylanguageforcommunicatio
nimpact.Persuasive communication

Page#13
Unit-3 Learningwrittencommunication

Fundamentals of Sentence construction. Using Figures of Speech (Simile,

Metaphor,Irony, Personification, Onomatopoeia, Alliteration), Phrasal Verbs, Derivatives
andmeaningofwords,Idioms,Onewordsubstitution,HomonymsandHomophones.
CreativeWriting:CopywritingSkills,Storyboardwriting.Barrierstoeffectivewriting.

Unit-4 ImprovingReadingandListeningskillsforeffectivecommunication

Types of Reading, Sub-skills of reading (Skimming, Scanning, Reading

Comprehension)ListeningSkills.PurposeofListening.ListeningtoConversation(FormalandI
nformal)ActiveListening.Benefits ofEffectiveListening.BarrierstoListening

Unit-5 ProfessionalWriting

Letter, Memo, Circular, Proposal, E-mail, Resume Writing , Cover Letters, Minutes
ofMeeting.

ReferenceBooks:
1. CommunicationSkillsbySanjayKumarandPushpaLata,OxfordUniversityPress.
2. TechnicalCommunication,PrincipleandPracticebyMeenakshiRamanandSangee
taSharma,OxfordUniversityPress.
3. ACourseinEnglishPhoneticsbyT.R.Kansakar,OrientLongmenPress.
4. BasicCommunicationSkillsfortechnology-AndreaJRutherford,Pearson
5. EnglishGrammar,WrenandMartin

Page#14
22MC107 Data Structure Laboratory (0-0-4) 2 Credits

Course Objective:
This course is aimed at concepts of programming and software code
development of moderate complexity using C programming language within
the framework of structural and procedural programming paradigms and data
structure.
List of Suggested Programs
1. Familiarity with basic LINUX command, vi editor.
2. Programs on arithmetic expressions, data type limits, operators and precedence.
3. Programs on Conditional Branching and Loops.
4. Programs on 1D and 2D array handling.
5. Programs on String handling and Functions
6. Programs on Pointers and Structure.
7. Implementation of Stack and Queue
8. Infix to Postfix conversion, Insertion sort
9. Linear and Binary Search
10. Bubble sort, Merge sort and Quick sort.

Course Outcomes:
Upon the successful completion of the sessional course, students will be able
to:
1. Understand problem solving approach of moderate complexity in Linux
environment.
2. Design and develop C program to solve different real life problems efficiently.
3. Analyse and compare different possible solutions.

Page#15
 Database Management Systems Laboratory
22MC108 2 Credits
(0-0-4)

1. Retrieving Data Using the SQL SELECT Statement.

2. Restricting and Sorting Data.
3. Manipulating Data.
4. Using DDL Statements to Create and Manage Tables.
5. Using Single-Row Functions to Customize Output.
6. Reporting Aggregated Data Using the Group Functions.
7. Displaying Data from Multiple Tables.
8. Using Sub queries to Solve Queries.
9. Creating Other Schema Objects (indexes, views).
10. User security (privileges, roles).
11. Cursors and composite data types...
12. Functions and procedures.
13. Packages.
14. Triggers.
15. Mini project (Application Development )
Suggested Books: Murach's My SQL: Joel Murach , 2nd Edition.

Page#16
22MC109 Communicative English Laboratory (0-0-4) 2 Credits

(This unit involves interactive practice sessions in Language Lab)

1. Listening Comprehension
2. Pronunciation, Intonation
3. Stress and Rhythm practice
4. Common Everyday Situations: Conversations and Dialogues
5. Formal Presentations
6. Reading Comprehension
7. Report writing
8. Writing letters, e-mails,
9. Writing essay, CV, etc…
10. Grammar activities

Page#17