Page 1 of 12

BANGALORE CITY UNIVERSITY

REGULATIONS, SCHEME AND SYLLABUS

For the course

MASTER OF COMPUTER APPLICATIONS

(MCA)

I to IV Semesters

(Choice Based Credit System –Y2K20 Scheme)

Revised w.e.f.

Academic Year 2020-21 and onwards

BoS in Computer Science

BANGALORE CITY UNIVESITY, BANGALORE
 Page 2 of 12
BANGALORE CITY UNIVERSITY
Regulations of Master of Computer applications (MCA) Course

1 TITLE OF THE COURSE: The course shall be called MCA – Master of Computer
Applications.

2 DURATION OF THE COURSE: The course of study shall be two years.

3 ELIGIBILITY FOR ADMISSION: A candidate with any degree of a minimum of 3 years

duration (10+2+3) of Bangalore university or of any other University equivalent there in to with
a minimum of 50% of marks in the aggregate of all subjects including languages, if any,
provided further, that the candidate has studied Mathematics / Computer science /Business
Mathematics / Statistics / Computer Applications / Electronics as a subject at PUC level or
equivalent HSC (XII Standard) or at Degree level is eligible for admission to MCA Course.
Relaxation to SC/ST, Group I be extended as per University norms.

4 ATTENDANCE: In each Semester a candidate should be considered to have successfully

undergone the prescribed Course of study if the candidate has attended at least 75% of the
classes in each subject (Theory, Lab & Practical).

5 SCHEME OF EXAMINATION:
A. The Internal Assessment marks should be decided for each of the theory subjects by
conducting 2 tests, each of 60 minutes duration, spread over the span of a Semester. A seminar
should also be given by the student in the second year and the same to be assessed and evaluated
for internal assessment along with two tests.
B. The Internal Assessment marks in Practical course is based on the performance in the
Laboratory. The Internal Assessment marks for Project work of a candidate is based on the
dissertation and seminar.

6 ELIGIBILITY TO GO TO THE HIGHER SEMESTER:

A. A Candidate is allowed to carry over all the previous uncleared (failed) theory papers and
Practicals to subsequent semesters from the first to fourth semester.
B. The maximum period for the completion of the course shall be four years from the date of
admission.

7 MINIMUM FOR PASS AND DECLARATION OF RESULTS

A. For a pass in a semester, a candidate shall secure a minimum of 40% of the marks
prescribed for a subject in the University Examination (Theory, Practical, Project work) and
50% of the marks in the aggregate inclusive of the Internal Assessment marks obtained in all
subjects put together.
B. The candidates who do not satisfy 7(A) shall be deemed to have failed and have to take
exams in the subjects in which he has secured less than 40% at the University examination.
C. Provision is made for rejection of results of all the subjects of a Semester only once, if the
candidate decides to reappear for all the subjects of that semester. Such rejection should be made
within 30 days of announcement of result, by making a written application, through the Head of
the Institution. If such rejection is in respect of the results of all the subjects of one semester and
earn fresh Internal marks as well.
D. The results of any semester will be declared as pass or fail as the case may be in
accordance with regulation 7(A).
E. To be eligible for the award of the MCA degree, a candidate shall have completed the
scheme of training and passed in all subjects prescribed for the Course.

F. Further to regulation 7(A), the classification followed by the University for all PG courses
shall be made applicable for the declaration of results of each Semester.

8 CLASSIFICATION OF RESULT FOR THE MCA COURSE AND DECLARATION OF

RANKS:
Further to regulations 7(A) and 7(F), the names of all successful candidates securing First Class
with Distinction and First Class in the First attempt shall be arranged in the order of Merit and
only first FIVE Ranks shall be declared.
 Page 3 of 12

9 A candidate shall complete examinations of all Semesters of MCA Course within - FOUR years
from the date of admission
 Page 4 of 12
SCHEME OF STUDY AND EXAMINATION FOR MASTER OF COMPUTER
APPLICATIONS (MCA)

Sem Paper Code Title of the paper Hours Marks Credits

/ Week
IA Exam Total Subject Sem
1MCA1 The Art of
4 30 70 100 4
Programming
1MCA2 Discrete Mathematics 4 30 70 100 4
1MCA3 Computer Organization 4
4 30 70 100
and Architecture

I 1MCA4 Theory of Computation 4 30 70 100 4 28

1MCA5 Object Oriented 4
4 30 70 100
Programming
1MCA6 Data Structures 4 30 70 100 4
1MCA7 Data Structures Lab 8 30 70 100 2
1MCA8 Object Oriented Lab 8 30 70 100 2
2MCA1 Operating Systems 4 30 70 100 4
2MCA2 Database Management 4
4 30 70 100
Systems
2MCA3 Computer Networks 4 30 70 100 4
2MCA4 Software Engineering 4 30 70 100 4
II 2MCA5 The Design and 4 28
4 30 70 100
Analysis of Algorithm
2MCA6 Artificial Intelligence 4 30 70 100 4
2MCA7 Database Management
8 30 70 100 2
System Lab
2MCA8 Unix Programming Lab 8 30 70 100 2
3MCA1 Open Elective 3 30 70 100 3
3MCA2 Soft Core 3 30 70 100 3
3MCA3 Research Methodology 4 30 70 100 4
III 3MCA4 Elective I 4 30 70 100 4 26
3MCA5 Elective II 4 30 70 100 4
3MCA6 Elective III 4 30 70 100 4
3MCA7 MINI PROJECT 8 30 70 100 4
IV MAIN PROJECT 16 16
 Page 5 of 12
3MCA2: QUANTITATIVE, TEACHING AND RESEARCH APTITUDE

Total Teaching Hours: 36 No. of Hours / Week: 03

UNIT – I [8 Hours]
Numbers Property – Simplification – Divisibility – HCF and LCM – Decimal Fractions –Square
roots and Cube Roots – Logarithms – Antilogarithms - Surds and indices - Permutation and
Combination – Probability – Odd man out series - Number series - letter series – codes –
Relationships – classification.

UNIT – II [7 Hours]
Time and work – Problems on Ages – Calendar – Clock – Pipes and Cistern – Time and Distance –
Problems of Train – Boats and Streams. Area – Volume and surface Areas – Heights and Distances
– Data Interpretation: Tabulation – Bar Graphs – Pie Charts – Line Graphs. Data Interpretation -
Sources, acquisition and interpretation of data; Quantitative and qualitative data; Graphical
representation and mapping of data.

UNIT – III [7 Hours]

Simple Interest – Compound Interest – Stocks and Shares – True Discount – Banker’s discount.
Averages – Percentage – Profit and Loss - Ratio and Proposition – Partnership – Allegation and
mixture – Chain rule. Understanding the structure of arguments; Evaluating and distinguishing
deductive and inductive reasoning; Verbal analogies: Word analogy Applied analogy; Verbal
classification; Reasoning Logical Diagrams: Simple diagrammatic relationship, multi
diagrammatic relationship; Venn diagram; Analytical Reasoning.

UNIT – IV [7 Hours]
Teaching: Nature, objectives, characteristics and basic requirements; Learner's characteristics;
Factors affecting teaching; Methods of teaching; Teaching aids; Evaluation systems. Research
Aptitude: Meaning, characteristics and types; Steps of research; Methods of research; Research
Ethics; Paper, article, workshop, seminar, conference and symposium; Thesis writing: its
characteristics and format. Reading Comprehension: A passage to be set with questions to be
answered. Communication: Nature, characteristics, types, barriers and effective classroom
communication.

UNIT – V [7 Hours]
Higher Education System: Governance, Polity and Administration; Structure of the institutions for
higher learning and research in India; formal and distance education; professional/technical and
general education; value education: governance, polity and administration; concept, institutions

Reference
1. R.S. Aggarwal, Quantitative Aptitude, S. Chand & Company, New Delhi, 2012
2. Govind Prasad Singh and Rakesh Kumar, Text Book of Quickest Mathematics (for all
Competitive Examinations),
3. Kiran Prakashan, 2012.R.S. Aggarwal, Objective Arithmetic, S. Chand & Company, New
Delhi, 2005.
 Page 6 of 12
4. Dr. Lal,Jain,Dr. K. C. Vashistha, “U.G.C.- NET/JRF/SET Teaching & Research Aptitude”,
Upkar Prakashan, 2010.
5. “UGC NET/SLET: Teaching & Research Aptitude”, Bright Publications, 2010.

3MCA3: RESEARCH METHODOLOGY

Total Teaching Hours: 52 No. of Hours / Week: 04

UNIT – I [12 Hours]

Introduction: Definition and objectives of Research – Types of research, Various Steps in Research
process, Mathematical tools for analysis, Developing a research questionChoice of a problem
Literature review, Surveying, synthesizing, critical analysis, reading materials, reviewing,
rethinking, critical evaluation, interpretation, Research Purposes, Ethics in research – APA Ethics
code.

UNIT – II [10 Hours]

Quantitative Methods for problem solving: Statistical Modeling and Analysis, Time Series
Analysis Probability Distributions, Fundamentals of Statistical Analysis and Inference,
Multivariate methods, Concepts of Correlation andRegression, Fundamentals of Time Series
Analysis and Spectral Analysis, Error Analysis, Applications of Spectral Analysis.

UNIT – III [10 Hours]

Tabular and graphical description of data: Tables and graphs of frequency data of one variable,
Tables and graphs that show the relationship between two variables , Relation between frequency
distributions and other graphs, preparing data for analysis

UNIT - IV [10 Hours]

Soft Computing: Computer and its role in research, Use of statistical software SPSS, GRETL etc
in research. Introduction to evolutionary algorithms - Fundamentals of Genetic algorithms,
Simulated Annealing, Neural Network based optimization, Optimization of fuzzy systems.

UNIT - V [10 Hours]

Structure and Components of Research Report, Types of Report, Layout of Research Report,
Mechanism of writing a research report, referencing in academic writing.

Reference
1. C.R. Kothari, Research Methodology Methods and Techniques, 2/e, Vishwa Prakashan, 2006.
2. Donald H.McBurney, Research Methods, 5th Edition, Thomson Learning, ISBN:81-315-0047-
0,2006.
3. Donald R. Cooper, Pamela S. Schindler, Business Research Methods, 8/e, Tata McGraw-Hill Co.
Ltd., 2006.
4. Fuzzy Logic with Engg Applications, Timothy J.Ross, Wiley Publications, 2nd Edition, 2004.
5. Simulated Annealing: Theory and Applications (Mathematics and Its Applications, by P.J. van
Laarhoven & E.H. Aarts[e], 19.
6. Genetic Algorithms in Search, Optimization, and Machine Learning by David E. publisher
 Page 7 of 12
MACHINE LEARNING (ELECTIVE)

Total Teaching Hours: 52 No. of Hours / Week: 04

Module 1 : Introduction to Machine Learning [12 Hours]

Introduction, Perspectives & Issues in ML, designing learning systems, Concepts of hypotheses,
Version space, inductive bias, Performance metrics-accuracy, precision, recall, sensitivity,
specificity, AUC, RoC, Bias Variance decomposition. Decision Trees Learning: Basic algorithm
(ID3), Hypothesis search and Inductive bias, Issues in Decision Tree Learning – Overfitting,
Solutions to overfitting, dealing with continuous values.

Module 2: Supervised Learning with KNN, ANN, SVM [10 Hours]

Instance-based learning: k-nearest neighbour learning, Artificial Neural networks: Introduction,
Perceptrons, Multi-layer networks and back-propagation, Activation Units, Support Vector
Machines – margin and maximization, SVM - The primal problem, the Lagrangian dual, SVM –
Solution to the Lagrangian dual.

Module 3: Probabilistic and Stochastic Models: [10 Hours]

Bayesian Learning – Bayes theorem, Concept learning, Maximum likelihood, Bayes optimal
classifier, Gibbs algorithm, Naive Bayes classifier, Expectation maximization and Gaussian
Mixture Models, Hidden Markov models

Module 4: Unsupervised Learning and Association Mining [10 Hours]

Hierarchical vs non-hierarchical clustering, Agglomerative and divisive clustering, K-
meansclustering, Bisecting k-means, K-Means as special case of Expectation, Maximization, K-
medoid clustering, Association Mining: Apriori algorithm. Finding frequent itemsets, mining
association rules, FP-growth – FP trees, Mining frequent items from an FP-Tree, Dimensionality
reduction techniques – PCA, SVD.

Module 5: Genetic Algorithms [10 Hours]

Genetic Algorithms – Representing hypothesis, Genetic operators and Fitness function and
selection, Simple applications of the Genetic Algorithm, application of GA in Decision tree,
Genetic Algorithm based clustering, Single Objective and Bi-objective optimization problems
using GA, using GA to emulate Gradient descent/ascent.

Reference Books:

1. Ethem Alpaydin,"Introduction to Machine Learning”, MIT Press, Prentice Hall of India, Third
Edition 2014

2. Jiawei Han and Micheline Kambers and Jian Pei, “Data Mining –Concepts and Techniques”,
3rd edition, Morgan Kaufman Pub

3. Charu C. Aggarwal, “Data Classification Algorithms and Applications”, CRC Press, 2014.
 Page 8 of 12
4. Charu C. Aggarwal, “DATA CLUSTERING Algorithms and Applications”, CRC Press, 2014.

5. “Machine Learning”, Tom Mitchell, McGraw Hill Education (India), 2013.

BIG DATA & ANALYTICS (ELECTIVE)

Total Teaching Hours: 52 No. of Hours / Week: 04

Unit I [10 Hours]

Introduction to Big Data, Big data definition, enterprise / structured data, social / unstructured data,
unstructured data needs for analytics, what is Big Data, Big Deal about Big Data, Big Data Sources,
Industries using Big Data, Big Data challenges.

Unit II [10 Hours]

Data Pre-processing, why to pre-process data? Data cleaning: Missing Values, Noisy Data, Data
Integration and transformation, Data Reduction: Data cube aggregation, Dimensionality Reduction,
Data Compression, Numerosity Reduction, Data Mining Primitives, Languages and System
Architectures: Task relevant data, Kind of Knowledge to be mined, Discretization and Concept
Hierarchy

Unit III [10 Hours]

Introduction to Classification and Prediction, Issues regarding Classification, Classification using
Decision trees, Bayesian Classification, Classification by Backpropagation, Prediction
Classification Accuracy, Introduction of Clustering, Spatial mining, Web mining, Text mining

Unit III [10 Hours]

Introduction of Big data programming-Hadoop, History of Hadoop, The ecosystem and stack,
Components of Hadoop, Hadoop Distributed File System (HDFS), Design of HDFS, Java interfaces
to HDFS, Architecture overview, Development Environment, Hadoop distribution and-basic
commands, Eclipse development.

Unit V [12 Hours]

Pig: Introduction to PIG, Execution Modes of Pig, Comparison of Pig with Databases, Grunt, Pig
Latin, User Defined Functions, Data Processing operators.
Hive: Hive Shell, Hive Services, Hive Metastore, Comparison with Traditional Databases, HiveQL,
Tables, Querying Data and User Defined Functions.
Hbase: HBasics, Concepts, Clients, Example, Hbase Versus RDBMS. Big SQL
Data Analytics with R Machine Learning: Introduction, Supervised Learning, Unsupervised
Learning, Collaborative Filtering.

Case Study: Implement your leanings to find sectors in which different companies ought to inves

Reference
1. Seema Acharya, Subhasini Chellappan, "Big Data Analytics" Wiley 2015.
 Page 9 of 12
2. Tom White “ Hadoop: The Definitive Guide” Third Edit on, O’reily Media, 2012.
3. Big Data Analytics: From Strategic Planning to Enterprise Integration with Tools,
Techniques, NoSQL, and Graph. By David Loshin, Elsevier, August 23, 2013.
4. White, T. (2012). Hadoop: The definitive guide. " O'Reilly Media, Inc."Smolan, R. (2013).
The human face of big data.
5. Tom Plunkett, Mark Hornick, “Using R to Unlock the Value of Big Data: Big Data Analytics
with Oracle R Enterprise and Oracle R Connector for Hadoop”, McGraw-Hill/Osborne
Media (2013), Oracle press.
6. Mayer-Schönberger, V., & Cukier, K. (2013). Big data: A revolution that will transform how
we live, work, and think. Houghton Mifflin Harcourt. Holmes, A. (2012). Hadoop in
practice. Manning Publications Co..
7. Simon, P. (2013). Too big to ignore: the business case for big data (Vol. 72). John Wiley &
Sons.
8. Robert D. Schneider , Hadoop for Dummies, Wiley India.

CRYPTOGRAPHY AND NETWORK SECURITY (ELECTIVE)

Total Teaching Hours: 52 No. of Hours / Week: 04

Unit I [12 Hours]

Security Trends, The OSI Security Architecture, Security Attacks, Security Services, Security
Mechanisms, A Model for Network Security, Symmetric Ciphers, Classical Encryption Techniques,
Symmetric Cipher Model, Substitution Techniques, Transposition Techniques, Steganography

Unit II [10 Hours]

Block Cipher Principles, The Data Encryption Standard, The Strength of DES, Differential and
Linear Cryptanalysis, Block Cipher Design The AES Polynomials with Coefficients in GF(28),
Simplified AES, Multiple Encryption and Triple DES, Block Cipher Modes of Operation, Stream
Ciphers and RC4

Unit III [10 Hours]

Fermat's and Euler's Theorem, The Chinese Remainder Theorem, The RSA Algorithm, Key
Management, Diffie-Hellman Key Exchange, Elliptic Curve Arithmetic, Elliptic Curve
Cryptography, Authentication Requirements, Authentication Functions, Message Authentication
Codes, Hash Functions, Security of Hash Functions and Macs

Unit IV [10 Hours]

Digital Signatures, Authentication Protocols, Digital Signature Standard, Kerberos, X.509
Authentication Service, Public-Key Infrastructure, IP Security Overview, IP Security Architecture,
Authentication Header, Encapsulating Security Payload, Combining Security Associations, Key
Management
 Page 10 of 12
Unit V [10 Hours]
Web Security, Secure Socket Layer and Transport Layer Security, Intruders, Intrusion Detection,
Password Management, Malicious Software, Firewalls

References

1. William Stallings, Cryptography and Network Security: Principles and Practice, 7th Edition,
Pearson

CLOUD COMPUTING (ELECTIVE)

Total Teaching Hours: 52 No. of Hours / Week: 04

Unit I [10 Hours]

Introduction of Cloud Computing: What is Cloud Computing, How it works, Types of Cloud, Goals
& Challenges, Leveraging Cloud Computing, Cloud Economics and Total Cost of Ownership Cloud
Service Models.

Unit II [12 Hours]

Software as a Service (SaaS): Overview of the Cloud application development lifecycle,
Challenges in SaaS Model, SaaS Integration Services, Advantages and Disadvantages.
Infrastructure as a Services (IaaS): Evolution of infrastructure migration approaches, Virtual
Machines, VM Migration Services, Cloud Infrastructure services, Advantages and Disadvantages.

Unit III [10 Hours]

Platform as a service (PaaS): Evolution of computing paradigms and related components
(distributed computing, utility computing, Cloud computing, grid computing, etc.), Cloud platform
services, Integration of Private and Public Cloud, Advantages and Disadvantages.

Unit IV [10 Hours]

Programming Model: Parallel and Distributed Programming Paradigms, MapReduce, Twister and
Iterative MapReduce, Hadoop Library from Apache, Mapping Applications, Programming Support
Google App Engine, Amazon AWS, Cloud Software Environments, Eucalyptus, Open Nebula,
OpenStack, Aneka, CloudSim.
 Page 11 of 12
Unit V [10 Hours]
Cloud Security Tools and technologies: Infrastructure Security, Network level security, Host level
security, Application level security, Data privacy and security Issues, Access Control and
Authentication in cloud computing, the data security in Private and Public Cloud Architecture, Legal
issues and Aspects, Multi-tenancy issues

References:
1. George Reese, “Cloud Application Architectures: Building Applications and Infrastructure
in the Cloud” O'Reilly Gautam Shroff, Enterprise Cloud Computing, Cambridge University
Press,2011
2. Judith Hurwitz, R Bloor, M.Kanfman, F.Halper “Cloud Computing for Dummies”,
Wiley India Edition, First Edition
3. Rajkumar Buyya, James Broberg, Andrzej M. Goscinski, “Cloud Computing : Principles
and Paradigms”, Wiley Publication,2011
4. Kai Hwang, Geoffrey C Fox, Jack G Dongarra, “Distributed and Cloud Computing, From
ParallelProcessing to the Internet of Things”, Morgan Kaufmann Publishers, 2012
5. RajkumarBuyya, Christian Vecchiola, S.ThamaraiSelvi, ‘Mastering Cloud Computing”,
TMGH,2013

WEB PROGRAMMING (ELECTIVE)

Total Teaching Hours: 52 No. of Hours / Week: 04

Unit I [12 Hours]

HTML5 and JavaScript: Local Storage, Web Workers, Drag and Drop, Introduction to Client-Side
Scripting, JavaScript Basics, Functions, Objects, Hoisting, Arrays, JavaScript Objects

Unit II [10 Hours]

DOM and DOM Events: Accessing and modifying DOM, Events and Event Handlers - Load,
Mouse, Synthetic Events, Key and Form Related Events, Event Bubbling, Cookies

Unit III [10 Hours]

Apache: MIME, http, httpd Server, Request Response Formats Basics, Configuration,
Debugging, .htaccess
 Page 12 of 12
Unit IV [10 Hours]
AJAX: File Handling and System Calls, Strings and Regular Expressions, Arrays, Cookies,
Sessions, Functions, Classes, Database Access AJAX: Asynchronous GET/POST using
XMLHttpRequest

Unit V [10 Hours]

AJAX Advanced: JS objects, prototype inheritance, Dynamic Script Loading, XMLHttpRequest,
Image- Based AJAX, Cross-Domain Access (CORS), Introduction to XML, Parsers, Styling RSS /
Atom Feeds, JSON and XML, JSON vs XML.

Reference Book(s):
1. “JavaScript Absolute Beginner's Guide”, Kirupa Chinnathambi, Que Publishing, 1st Edition,
2017.
2. “Programming the World Wide Web”, Robert W Sebesta, Pearson, 7th Edition, 2013. 3.
“HTML5 Up and Running”, Mark Pilgrim, O’Reilly, 1st Edition, 2015
3. “AJAX: The Complete Reference”, Thomas A Powell, McGraw Hill, 2008.