MCA - Part I - 2020-21
MCA - Part I - 2020-21
MCA - Part I - 2020-21
1. Introduction
Master of Computer Applications (MCA) is a two-year (four semesters) professional
Master Degree program in computer applications. The program is designed to meet the
growing demand for qualified professionals in the field of Information Technology. It is a
postgraduate program that can be taken up after obtaining a Bachelor’s Degree. The MCA
program is inclined more towards Application Development and thus has more emphasis
on the latest programming language and tools to develop better and faster applications. It
covers various aspects of computational theory, programming, algorithm design and
optimization, network and database management, mobile technologies, cyber security,
information system audit, etc.
2. Job Opportunities:
After completing MCA, students can start their career as a Software Developer and Web
Designer & Developer, after some experience, are promoted as system analysts. Other seek
entrepreneurial role in the Information Technology world as independent business owners,
software consultants, IT Architecture, Network Engineer. Career opportunities also exist in
emerging area as Cyber security. Other areas include Data scientist and Cloud Architect.
3. Medium of Instruction
The medium of Instruction will be English only.
4. Teachers Qualification: MCA with First class and Two years’ experience prescribed by
AICTE and University.
5. Admission Procedure
(A) Eligibility:
Passed BCA/ Bachelor Degree in Computer Science or Engineering or equivalent degree
OR
Passed B.Sc./ B.Com./ B.A. with Mathematics at 10+2 Level or at Graduation Level (with
additional bridge Courses as per the norms of the concerned University).
Obtained at least 50% marks (45% marks in case of candidates belonging to reserved
category) in the qualifying Examination.
Program Outcomes: Program outcomes are attributes of the graduates from the program that are
indicative of the graduates’ ability and competence to work as an IT professional upon graduation.
Program Outcomes are statements that describe what students are expected to do now or do by the
time of post-graduation. They must relate to knowledge and skills that the students acquire from
the program. The achievement of all outcomes indicates that the student is well prepared to
achieve the program educational objectives down the road. Master of Computer Applications
program has following PO’s.
7. Course Outcome(s): Every individual course under this program has course outcomes
(CO). The course outcomes rationally match with program educational objectives. The
mapping of PEO, PO and CO is as illustratedbelow:
Program
Program
Educational Thrust Area Course Outcome
Outcome
Objectives
PO1,PO2,PO3,PO4 and All Core and Lab
PEO I Technical Expertise
PO5 courses
PO6 ,PO7, PO8 PO9 and
PEO II Successful Career All AEC courses
PO12
Interdisciplinary and Life
PEO III PO10,PO11 All Electives
Long Learning
PSO 1. Ability to pursue careers in IT industry/ consultancy/ research and development, teaching
and allied areas related to computer applications.
PSO 2. Comprehend, explore and build up computer programs in the areas allied to Algorithms,
System Software, Multimedia, Web Design and Big Data Analytics for efficient design of
computer-based systems of varying complexity.
9. Syllabus Structure:
Theory
Practical Internal
Sr. Course Course contact University
Course Title hours per Credits continuous Total
No. Type Code hours per exam
week assessment
week
Introduction to
1 Core CC101 4 4 70 30 100
Programming
Computer
2 Core CC102 Architecture & 4 4 70 30 100
Operating System
3 Core CC103 RDBMS 4 4 70 30 100
Statistical and
AEC
4 AEC Mathematical 4 4 70 30 100
104
Foundations
Principles of
AEC Management and
5 AEC 4 4 70 30 100
105 Organizational
Behavior
AEC Business
6 AEC 2 2 - 50 50
106 Communication
1. Strategic IT
Management
2. Knowledge
7 GE GE107 4 4 70 30 100
Management
3. Financial
Technologies
Lab Based on
8 Core CC108 2 2 50 - 50
CC101
Lab Based on
9 Core CC109 2 2 50 50
CC102
Lab Based on
10 Core CC110 2 2 50 - 50
CC103
26 9 32 520 280 800
MCA Part I Semester II
Theor
y
Practical Internal
Sr. Course Course contac University
Course Title hours per Credits continuous Total
No. Type Code t hours exam
week assessment
per
week
1 Core CC201 Web Technology 4 4 70 30 100
2 Core CC202 Data Structure 4 4 70 30 100
Big Data
3 Core CC203 4 4 70 30 100
Management
Data Communication
4 Core CC204 4 4 70 30 100
& Network
Software
5 Core CC205 Engineering and 4 4 70 30 100
Project Management
1. Digital
Marketing
2. Design Thinking
6 GE GE206 4 4 70 30 100
and Innovation
3. Information
System Audit
7 Core CC207 Lab based on CC201 2 2 50 - 50
8 Core CC208 Lab based on CC202 2 2 50 - 50
9 Core CC209 Mini Project 4 4 70 30 100
24 8 32 590 210 800
MCA Part II Semester III
Theory
Sr. contact Practical Internal
Course Course University
No Course Title hours hours per Credits continuous Total
Type Code exam
. per week assessment
week
1 Core CC301 Java Programming 4 4 70 30 100
2 Core CC302 Data Analytics 4 4 70 30 100
3 Core CC303 Cyber Security 4 4 70 30 100
1. Cloud Computing
2. Digital Forensics
DSE DSE
4 3. Data Centre 4 4 70 30 100
304
Management
4. Web 2.0
Entrepreneurship
5 AEC AEC305 4 4 70 30 100
Development
MOOC
6 AEC AEC306 2 2 - 50 50
7 Core CC307 Lab based on CC301 2 2 50 - 50
a) Nature of Theory Question paper: Nature of question paper is as follows for University end
semester examination
i) There will be seven (7) questions and out of which three (3) to be attempted from question no 2
to question no 6.
ii) Question No.1 and question No.7 are compulsory in which question No.1 is of multiple choice
questions. There will be8 multiple choice questions and each carries 1 mark. Question No 6
should be a short note for 20 marks, where 5 sub questions will be given, out of which four
questions should be attempted
iii) Question No.2 to Question No. 6 may consist 2 sub questions and each carries 7Marks or long
answer question for 14 marks
For major project student should go for in plant training of 50 days after completion of semester II
university examination and project report will be submitted to institute/department before 3rd
semester university examination. Project work willbe done individually and students should take
guidance from assigned guide and prepare a Project Report on “Project Work" in two copies to be
submitted to the Director of the Institute/Head of the Department. In plant training certificate
from respective organisation is mandatory for project certification by Institute.The project viva
voce will be conducted after theory examination of 3 rd semester by the University appointed
examiner panel of two members having doctorate and more than ten years’ experience as full time
teacher.
16. Fee Structure: As per directives of Shikshan Shulka Samiti, Govt. of Maharashtra and
competent authority.
17. Requirements:
1. Core Faculty: As per guidelines of AICTE New Delhi.
2. Computer Infrastructure: Number of Computers, Number of application software, Number
of system software’s are as per AICTE New Delhi and competent authority guidelines.
3. Internet Bandwidth: 32 MBPS Lease Line and at least 4Mbps Wi-Fi connectivity at 4 or 5
hotspots shall be made available.
4. Arrangement to view MOOC’s of NPTEL/ SWAYAM/IIT online Tutorials etc. shall be
made available.
5. Class Room, Seminar halls, Tutorial Rooms and Auditorium: As per AICTE Guidelines
6. Each Class Room shall be equipped with LCD projector, Smart Board, Internet etc.
Seminar Hall shall have proper furnishing and equipment such LCD projector, Smart
Board, PA system and Executive Chairs.Institutions shall have MOOC’s Facility Centre
and Innovation Laboratory.
7. Language Laboratory shall have a minimum of 20 Computers with appropriate application
software.
Unit II
Fundamentals of Accounting- Introduction to Accounting, Objectives, Need and
Scope of Accounting, Types of Accounts, Branches of accounts, Accounting concepts
and conventions. Journal entries, ledger posting, trial balance, financial statements.
Accounting with Tally: Introduction to gateway, company creation, ledger creation,
voucher entries.
Unit III
Fundamentals of Mathematics and Statistics
Measures of Central Tendency- Mean, Mode, Median, Elementary set theory:
Representation of sets, Operations on sets, Distributive and De Morgan’s laws,
Probability, Permutations and Combinations.
Unit IV-
Fundamentals of Programming-
Introduction to C programing, Data types in C, Operators in C, Branching and looping
statements in C. Array in C, Introduction to Object oriented Programming,
Introduction to C++, Class, Object, Constructor, Destructor, Inheritance,
Polymorphism.
Unit-V
Database Management System
Definition of Database, Needs, features Database Management Systems (DBMS):
Definition, components, file system, comparison of file processing system with
DBMS, functions of DBMS, advantages, disadvantages of DBMS, Structure of
DBMS, Database constraints, .Introduction to SQL.
Reference Books -
1. Computer Fundamentals, Sixth Edition, Pradeep K. Sinha, Priti Sinha.
2. Programming in ANSI C, E Balagurusamy, Tata McGraw-Hill Publishing
3. Programming in C++ by YashwantKanetkar (PBP Publications)
4. Koontz and Weirich : Essentials of Management
5. Database System Concept – Silberschatz, Korth
6. Fundamentals of Database System- RamezElmasri,Shamkant B. Navathe(Pearson)
7. SQL, PL/SQL the programminglanguage of OracleIvanBayross BPB 4th
rd
8. Computer System Architecture Morris Mano Pearson 3 Edition
9. Gupta C. B.: Introduction to Statistics
10.Discrete mathematics - SemyourLipschutz, Marc Lipson (MGH), Schaum’s
outlines.
11.Advance Accountancy:- M.C. Shukla & T.S. Grewal
12.Advance Accountancy:- S.C. Jain & K.L. Narang
20. Syllabus:
M.C.A. Part-I Semester I
Paper CC101: Introduction to Programming
(Choice Based Credit System)
Course Students of this course will be able to :
Outcomes 1. Understand Basic Syntax of Python Programming.
2. Demonstrate and implement concepts of object oriented methodology using
Python.
3. Develop problem solving skills and their implementation through Python
4. Design Graphical user Interfaces in Python.
Marks:100 Total Hours of Teaching: 60 University Exam :70 Internal : 30
Syllabus Contents:
Introduction to Programming :
Role of programming languages, Need to study programming
languages, Characteristics of Programming Languages, Programming
language paradigms: Imperative, Object Oriented, Functional, Logic,
Event Driven and Concurrent Programming.
OVERVIEW – History, Features and Applications, Installing and
Running Python Program, Modes: interpreter, editor and IDE,–
Python Identifiers, Keywords , Indentation, Multi-Line Statements,
Quotation, Comments , Waiting for the User Input, Multiple Statements
Unit 1: 15Periods
on a Single Line
VARIABLE TYPES - Assigning Values to Variables, Multiple
Assignment, Standard Data Types (Numbers, Strings, Lists, Tuples,
Dictionary), Data Type Conversion and Casting
OPERATORS - Types of Operators, Operators Precedence
STRINGS - Accessing Values in Strings, Updating Strings, Escape
Characters, String Special Operators, String Formatting Operator,
Triple Quotes, Unicode String, Built-in String Methods, Regular
Expression and Pattern Matching.
DECISION MAKING - If, if-else, elif Statement, Nesting of If
statement, Using if-else as switch-case
LOOPS - While Loop, The Infinite Loop, For Loop, Iterating by
Sequence Index, Using else Statement with Loops, Nested Loops,
Break, Continue & Pass Statement.
LISTS - Python Lists, Accessing Values in Lists, Updating Lists,
DeletingList Elements, Basic List Operations, Indexing, Slicing, and
Matrixes, Built-in List Functions and Methods.
Unit 2: 15 Periods
TUPLES - Accessing Values in Tuples, Updating Tuples, Deleting
Tuple Elements, Basic Tuples Operations, Indexing, Slicing, and
Matrixes , No Enclosing Delimiters :, Built-in Tuple Functions,
Combining Lists and Tuples.
Sets -Concept of Sets , creating, initializing and accessing the elements
of ,Sets operation.
DICTIONARY- Accessing Values in Dictionary, Updating Dictionary,
Delete Dictionary Elements, Properties of Dictionary Keys, Built-in
Dictionary Functions and Methods.
FUNCTIONS - Defining and Calling a Function, Function
Arguments, Keyword Arguments, Default Arguments, Variable Length
Arguments, Passing by Reference Versus Passing by Value, The
Anonymous Functions, The return Statement, Returning multiple
values, Scope of Variables, Global vs Local variables
MODULES - The import Statement, The from import and import *
Unit 3: Statement, Locating Module, Creating and importing user defined 15 Periods
modules, dir( ) Function, The globals( ) and locals( ) Functions, The
reload( ) Function, Packages in Python, Creating and using packages.
EXCEPTIONS– Introduction &, need of Exception, Handling an
Exception with try-except, The except Clause with No Exceptions &
with Multiple Exceptions, try-finally, try-except-else clause, User-
Defined Exceptions
FILES I/O – Opening and Closing Files, The open Function, The file
Object Attributes, The close( ) Method, Reading and Writing Files,
The write( ) and writelines( ) Methods, The read( ), readline( ) and
readlines( ) Methods, Opening file in appending mode, File Positions,
seek( ) function, Renaming and Deleting Files, rename( )& remove( )
Method, Directories in Python, mkdir( ), chdir( ), getcwd( )&rmdir( )
Methods, File and Directory Related Methods
CLASSES AND OBJECTS - Overview of OOP Terminology,
Unit 4: Creating Classes, Creating Instance Objects, Accessing Attributes, 15 Periods
static member attributes & Built-In Class Attributes, Destroying
Objects (Garbage Collection, Class Inheritance, Multiple, Hierarchical
and Multi-level inheritance, Overriding Methods, Overloading
Operators, Data Hiding,
Multithreading, Database Access using python
GUI Programming using Tkinter – using Label, Message Widget,
Buttons, Radiobuttons, Checkboxes, Entry Widgets, Canvas Widgets,
Sliders, Text Widget, Dialogs, Layout Management.
Reference Books:
1. R. NageswaraRao, “Core Python Programming”, Dreamtech
2. Programming with python, A users Book, Michael Dawson, Cengage
Learning
3. Python Essential Reference, David Beazley, Third Edition 5. Python
Bible
4. Practical Programming: An introduction to Computer Science Using
Python, second edition, Paul Gries, Jennifer Campbell, Jason
Montojo, The Pragmatic Bookshelf.
5. Python for Informatics: Exploring Information, Charles Severance
6. John V Guttag. “Introduction to Computation and Programming
Using Python”, Prentice Hall of India
7. Learning Python By Mark Lutz,O’Reilly Publication
8. Python Learning Guide (BPB publications)
M.C.A. Part-I Semester-I
Paper CC102 : Computer Architecture and Operating System
(Choice Based Credit System)
Course Students of this course will be able to :
Outcomes 1. Understand the architecture and working of hardware components in digital
computer
2. Compare different memory devices used in digital computer.
3. Describe the basic concepts and functions of Operating System.
4. Illustrate features and significance of Linux operating system.
Marks:100 Total Hours of Teaching:60 University Exam :70 Internal : 30
Syllabus Contents:
Introduction to Computer Architecture
Introduction to Digital Computer, Data Processing Components: Logic
Gates, Boolean Circuits, Half Adder, Full Adder, Decoder, Multiplexer.
Data Storage Components: SR, D, JK, T Flip Flops, Registers, Memory
Hierarchy, Architecture of RAM, ROM, Data Representation: Number
Unit 1: 15Periods
Systems- Binary, Octal and Hexadecimal Numbers, Inter-conversion
between number systems.
CPU Organization: CPU Building Blocks, Instruction codes,
Registers, Addressing Modes, Instruction sets, Instruction execution
and Interrupts.
Introduction to Operating System
Definition of Operating System, Operating system structures, Types of
Operating systems,
Memory Management: Concept, Memory Management Techniques,
Swapping, Contiguous Memory Allocation, Memory Protection,
Unit 2: 15 Periods
Memory Allocation, Fragmentation, Segmentation with Paging, Virtual
Memory Concept, Demand Paging and Page Replacement.
Process Management: Process Concept, Process scheduling, CPU
Scheduling: Basic Concepts, Scheduling Criteria, Scheduling
Algorithms.
Inter Process Communication: Critical region, synchronization and
semaphore, classic problems of synchronization, Deadlock: Methods
for Handling Deadlock, Deadlock Prevention, Deadlock Detection and
Unit 3: 15 Periods
Deadlock recovery.
Input-Output Processing: Input/ Output Devices, Input-Output
Interface, Modes of Transfer, Direct Memory Access, I/O Processor.
Introduction to Linux
Features of Linux, History and development of Linux, Architecture of
Linux, Concept of Kernel and shell, Linux File Structure, Directory and
Unit 4: File handling commands in Linux. 15 Periods
Shell scripting: Working with VI editor and its mode, Shell variables,
operators, conditional and looping statements, Shell functions, Shell
scripting with C and Python.
Reference Books:
1. Computer System Architecture Morris Mano Pearson 3rd Edition
2. Computer Organization by Carl Hamacher, ZvonkoVranesic, SafwatZaky, 5th Edition, MGH
3. Digital Logic and Computer Design Morris Mano Prentice Hall
4. Computer Architecture & Organization J. P. Hayes MGH 3rd Edition
5. Computer Organization & Design Pal Chaudhary PHI 3dr Edition
6. Digital Computer Electronics Malvino TMH 3rd Edition
7. Computer Architecture & Organization Murdocca Wiley India
8. Computer Architecture and Organization, John P. Hayes, 3rd Edition, McGraw-Hill Series
9. Operating Systems: Concepts: By Abraham Siberschatz, Peter Galvin- Willey- Sixth edition.
10. Operating Systems: Andrew S. Tanenbaum-Pearson Education- Second Edition.
11. System Programming and Operating Systems by D.M. Dhamdhere-TMH –Second Edition.
12. Operating Systems: Internals and Design Principles, Seventh Edition by William Stallings,
Pearson Publications
Suggested Additional Reading:
1. Computer Organization & Architecture, William Stallings, 7th Edition, PHI
2. Computer Systems Design and Architecture, Vincent P. Heuring& Harry F. Jordan, 2nd
Edition, Pearson Education
3. Advanced Computer Architecture, Hwang, TMH
4. William Stallings, ―Operating Systems, Macmillan Publishing Company.
5. Deitel H.M., ―An Introduction to Operating System, Addison Wesley Publishing Company,
1984.
6. Kenneth Rosen,Douglas Host, The Complelete Reference, Unix, Tata McGraw Hill
Suggested Research Journals:
1. https://swayam.gov.in/nd1_noc20_cs25/preview
2. https://swayam.gov.in/nd1_noc20_cs04/preview
Reference Books:
1. Fundamentals of Statistics by S. C. Gupta.
2. Business Analytics - the science of Data - Driven
Decision Making, U Dinesh Kumar.
3. Multivariate Data Analysis, Joseph F. Hair Jr. Barry J.
Babin, Wiliam C. Black, Rolph E. Anderson.
4.Discrete Mathematics, Seymour Lipschutz, Marc Lars
Lipson.
5. Discrete Mathematical Structures with Applications to
Computer Science, J. P.Tremblay and P. Manohar, Tata
McGraw Hill.
6. Elements of Discrete Mathematics - A Computer
Oriented Approach, C. L. Liu and D. P. Mohapatra,
3rd edition, Tata McGraw Hill.
7. Discrete Mathematics and its Applications with
Combinatorics and Graph Theory, K. H. Rosen, 7th
edition, Tata McGraw Hill.
8. Discrete Mathematics for Computer Scientists and
Mathematicians, J. L. Mott, A. Kandel, T.P. Baker,
2nd edition, Prentice Hall of India.
9. Discrete Mathematical Structures, Bernand Kolman,
Robert C. Busby, Sharon Cutler Ross, PHI.
10. Discrete Mathematics, S. K. Chakraborthy and B. K.
Sarkar, Oxford, 2011.
Reference Books:
1. ITGovernance,PeterWeillandJeanneWRoss,HarwardBusinessSchoolPress
2.
StrategiesforInformationTechnologyGovernance,WimVanGrembrgen,IdeaGr
oupPublishing
3. IT Governance, Martin Frohlich and Kart Glasher, Gabler Publication
4. IT Governance, A Practical Guide by Christopher BGillies
5. IT Governance: How Top managers manages IT decisions right for
superior results--- by Peter Weill, Harward Business School Press
6. Corporate Information strategy and Management by L M Applegate
7. Information Technology Management by Raner, Potter and Turban.
8. Strategic Technology Management by Betz
9. IT strategy and Management by SanjivaDubay
Suggested Additional Reading:
Information Technology Management by Yadhav
Suggested Research Journals:
1. The Journal of Strategic Information Systems
2.International Journal of Strategic Information Technology and
Applications(IJSITA)
M.C.A. Part-I Semester I
Paper GE107: Elective 2.Knowledge Management
(Choice Based Credit System)
Course Students of this course will be able to :
Outcomes 1) Understand concept of knowledge management and technology application for
knowledge management.
2) Use the knowledge management tools.
3) Understand knowledge management Applications.
4) Design knowledge management strategy for organization.
Marks:100 Total Hours of Teaching:60 University Exam :70 Internal : 30
Syllabus Contents:
INTRODUCTION
An Introduction to Knowledge Management - The foundations of
knowledge management- including cultural issues- technology
applications organizational concepts and processes- management
Unit 1: 15 Periods
aspects- and decision support systems. The Evolution of Knowledge
management: From Information Management to Knowledge
Management - Key Challenges Facing the Evolution of Knowledge
Management - Ethics for Knowledge Management.
CREATING THE CULTURE OF LEARNING AND
KNOWLEDGE SHARING
Unit 2: Organization and Knowledge Management - Building the Learning 15 Periods
Organization. Knowledge Markets: Cooperation among Distributed
Technical Specialists – Tacit Knowledge and Quality Assurance.
KNOWLEDGE MANAGEMENT-THE TOOLS
Telecommunications and Networks in Knowledge Management -
Internet Search Engines and Knowledge Management - Information
Unit 3: Technology in Support of Knowledge Management - Knowledge 15 Periods
Management and Vocabulary Control - Information Mapping in
Information Retrieval - Information Coding in the Internet
Environment - Repackaging Information.
KNOWLEDGEMANAGEMENT-APPLICATION
Components of a Knowledge Strategy - Case Studies (From Library to
Knowledge Center, Knowledge Management in the Health Sciences,
Knowledge Management in Developing Countries).
FUTURE TRENDS AND CASE STUDIES
Unit 4: 15 Periods
Advanced topics and case studies in knowledge management -
Development of a knowledge management map/plan that is integrated
with an organization's strategic and business plan - A case study on
Corporate Memories for supporting various aspects in the process life -
cycles of an organization.
Reference Books:
1. Knowledge Management – Sudhir Warier, Vikas Publications.
2. Knowledge Management Systems – Stuart Barnes, Thomson
Learning.
3. Key issues in the New Knowledge Management – J.M. Firestone,
M.W. Mcelroy.
4. Developing Expert System for Business – Chandler/Liang.
5. Knowledge Management – Pankaj Sharma, APH Pub .
Suggested Additional Reading:
Nonaka, I., Takeuchi, H., “The Knowledge-Creating Company: How
Japanese Companies Create the Dynamics of Innovation”, Oxford
University Press, 1995.
Semester I
************