MCA Regular First Semester Syllabus Final
MCA Regular First Semester Syllabus Final
SYLLABUS
For
MASTER OF COMPUTER APPLICATIONS
(REGULAR)
Semester 1
IA ESE
Total Credits
Master of Computer Applications (Regular) Hours / week Marks Marks Exam
Course Slot
No Course L T P
RLMCA101 Problem Solving and Computer Programming 3 1 40 60 100 4 A
RLMCA103 Discrete Mathematics 3 1 - 40 60 100 4 B
RLMCA105 Applied Probability and Statistics 3 1 - 40 60 100 4 C
RLMCA107 Principles of Management 3 1 - 40 60 100 4 D
RLMCA109 Digital Fundamentals 3 1 - 40 60 100 4 E
RLMCA131 Programming Lab - 4 100 100 1 S
RLMCA133 Applied Statistics Lab - 4 100 100 1 T
15 5 8 400 300 700 22
Year of
Course No. Course Name L-T-P Credits
Introduction
RLMCA101 Problem Solving & Computer Programming 3-1-0-4 2016
Course Objectives
Syllabus
Expected Outcome
References
1. Byron S Gottfried, “Programming with C”, Schaum’s outline, 3rd Edition, McGraw Hill
2. A. N. Kamthane, “Programming in C”, Pearson Education, 3rd Edition (2015)
3. Brian W Kernighan & Dennis Ritchie, “The C programming language”, 2nd Edition, Prentice Hall
(2015)
4. Reema. Thareja, “Programming in C”, Oxford University Press, 2nd Edition (2016)
5. Stephen Prata K, “C Primer Plus”, Pearson Education, 5th Edition (2013)
6. K N King, “C Programming: A Modern Approach”, W. W. Norton & Co, 2 nd Edition (1996)
Suggested MOOC
1. https://www.edx.org/course/programming-basics-iitbombayx-cs101-1x
2. http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-087-practical-
programming-in-c-january-iap-2010/
Course Plan
End-Semester
% of marks in
Examination
Allotted
Module
Contents
Hours
Introductory concepts: Program Development - Algorithm, Flowchart,
Pseudocode, Structured Programming – Program Design, Modular
Programming, Structuring of Control Flow.
I 6 10
Introduction to C Language: The C character set, identifiers and keywords, data
types, constants, variables and arrays, declarations, expressions, statements,
Symbolic Constants, Library Functions.
Operators and expressions: Arithmetic operators, Unary operators, Relational
and Logical operators, Assignment operators, Conditional operator.
II 6 10
Data input and output: Single character input, single character output, scanf,
printf, puts, gets, functions, interactive programming.
FIRST INTERNAL EXAM
Control statements: Branching - if else statement, Looping, nested control
structure, switch statement, break statement, continue statement, comma
operator, goto statement.
Year of
Course No. Course Name L-T-P Credits
Introduction
RLMCA103 Discrete Mathematics 3-1-0-4 2016
Course Objectives
Syllabus
Expected Outcome
Students will be capable of using the mathematical methods and algorithms learned for
analyzing and solving problems related to Computer Science.
References
Course Plan
End-Semester
% of marks in
Examination
Allotted
Module
Contents
Hours
Basic Structures - Sets, Set Operations, Relations, Classification of relations,
Equivalence Relations, Closures of Relations, Matrix Representation of
I 8 15
Relations, Partial Ordering, n-ary Relations, Functions.
Relevant Portions from Text 2 primarily and Text 1 for additional reference
Division Algorithm, GCD, Primes, Euclidean Algorithm, Congruences,
Properties of Congruences, Solutions of Linear Congruences, Chinese
II 8 15
Remainder Theorem.
Text 3: 2.2, 2.3, 2.4, 4.2, 4.4 and Text 1 for additional reference
FIRST INTERNAL EXAM
Permutations, Circular Permutations, Combinations,Combinations with
repetition, Binomial Theorem, Pigeonhole Principle, Principle of Inclusion and
III 8 15
exclusion
Text 4: 1.2, 1.3, 5.5, 8.1 and Text 1 for additional reference
Generalization of Principle of Inclusion and Exclusion, First Order Linear
Recurrence Relation, Second Order Linear homogeneous Recurrence Relations
IV with Constant coefficients, Non Homogeneous Recurrence Relation, Divide- 8 15
and-Conquer Algorithms and Recurrence Relations
Text 4: 8.3, 10.1, 10.2, 10.3 and Text 1 for additional reference
Graphs - and Graph Models, Graph Terminology and Special Types of Graphs,
Representing Graphs and Graph Isomorphism, Connectivity, Euler and
Hamilton Paths, Shortest-Path Problems, Planar Graphs, Graph Coloring
Year of
Course No. Course Name L-T-P Credits
Introduction
RLMCA105 Applied Probability and Statistics 3-1-0-4 2016
Course Objectives
Syllabus
Expected Outcome
At the end of the course students will have an overall view of concepts in probability and
statistics.
References
1. Douglas C. Montgomery and George C. Runger, “Applied Statistics and Probability for
Engineers”, Wiley India, 5th Edition (2012).
2. David S. Moore and George P. McCabe, “Introduction to practice of statistics”, W.H. Freeman
& Company, 5th Edition (2005).
3. G. Jay Kerns, “Introduction to Probability and Statistics Using R”, Chapman & Hall (2010)
https://cran.r-project.org/web/packages/IPSUR/vignettes/IPSUR.pdf
4. Richard A .Johnson, Miller and Freunds, “Probability and Statistics for Engineers”, Prentice
Hall of India, 8th Edition (2015).
5. Gupta S.C and Kapoor V .K, “Fundamentals of Mathematical Statistics”, Sultan Chand and
Sons (2014).
6. Mendenhall, Beaver, Beaver, Introduction to Probability & Statistics, Cengage Learning, 14th
Edition (2014)
Web Resources
1. https://www.edx.org/course/explore-statistics-r-kix-kiexplorx-0
2. https://www.coursera.org/course/probability
3. http://www.math.uah.edu/stat/
Course Plan
End-Semester
% of marks in
Examination
Allotted
Module
Contents
Hours
Introduction to Statistics and Data, Types of Data - Quantitative Data,
Qualitative Data, Logical Data, Multivariate Data etc. Features of Data
distributions - Center, Spread, Shape, Symmetry, Skewness and Kurtosis
I (Definitions only), Frequency Distributions and Histogram, Stem and Leaf 7 15
Diagrams, Measures of Center - Mean, Median, Mode, Measures of Spread -
Range, Variance, Standard Deviation, Measures of Relative Position: Quartiles,
Percentiles, Interquartile range.
Introduction to Probability Theory - Classical empirical and subjective
probabilities, Random Experiments, Sample Spaces & Events, Axioms of
II 7 15
Probability, Addition Rules, Conditional Probability, Multiplication and Total
Probability Rules, Independence, Bayes’s Theorem (without proof).
FIRST INTERNAL EXAM
Random Variables, Discrete Random Variables, Probability Distributions and
Probability Mass Functions, Mean and Variance of a Discrete Random Variable,
III Discrete Uniform Distribution - Mean and Variance, Binomial Distribution - 10 20
Mean and Variance, Geometric Distribution - Mean and Variance, Poisson
Distribution - Mean and Variance.
Continuous Random Variables, Probability Distributions and Probability Density
Functions, Mean and Variance of a Continuous Random Variable, Continuous
Uniform Distribution, Mean and Variance, Normal Distribution, Mean and
IV 10 20
Variance (Proof not required), Standard Normal Distribution, Joint and
Marginal Probability Distributions, Conditional Probability Distributions,
Independent Random Variables.
Statistical Inference, Types of sampling and sampling error, Random Sample &
Statistic, Sampling Distribution, Central Limit Theorem (Statement Only),
Distribution of sample mean and sample variance, t, ∧ distributions
V (derivation not required), Confidence Interval on the Mean, Confidence 10 20
Interval on the Variance, Confidence Interval for a Population Proportion,
Confidence Interval on the Difference in Means, Confidence Interval on the
Ratio of two Variances.
SECOND INTERNAL EXAM
Hypothesis Testing, General Procedure for Hypothesis Tests, Tests on the
VI 6 10
Mean, Tests on a population Proportion, Tests on the Difference in Means.
END SEMESTER EXAM
Year of
Course No. Course Name L-T-P Credits
Introduction
RLMCA107 Principles of Management 3-1-0-4 2016
Course Objectives
Syllabus
Definition, functions of a management, managerial skills and roles, basics of decision making
process. Early contributors and their contributions to the field of management. Planning, Organizing,
Staffing and HRD functions, Directing and Controlling form the core content of this course.
Expected Outcome
References
Suggested MOOCs
1. Management Functions
http://nptel.ac.in/courses/122108038/
2. Leadership
http://nptel.ac.in/courses/110105033/33
Course Plan
End-Semester
% of marks in
Examination
Allotted
Module
Contents
Hours
Introduction to Management: Basic Managerial Concepts, Levels of
management, Managerial Skills, Managerial roles Decision Making- Concept,
I types of decision, decision making process. 6 15
Management functions- Planning, Organising, Staffing, Directing and
Controlling.
Early Contributions in Management: Management thought - Classical
approach, scientific management, contributions of Taylor, Gilbreths, Fayol’s 14
principles of management.
II 8 15
Human relation approach - contribution of Elton Mayo Systems approach -
organization as an open system and Contingency approach.
FIRST INTERNAL EXAM
Planning: Nature and importance of planning, types of plans - Steps in
III planning, Levels of planning - The Planning Process - MBO definition and 7 15
process, SWOT Analysis, importance.
Organising : Nature of organizing, Departmentation - need and importance,
span of control in management, factors affecting span of management.
IV Organisation structure - Formal and informal, Types of organization structure 8 15
line, line and staff, functional, divisional, project, matrix, free form, virtual.
Delegation of authority, Steps in delegation and Principles of delegation
Staffing and related HRD Functions: meaning, nature, staffing process,
Job analysis and manpower planning, job description and job specification,
V Recruitment & selection, selection process, tests and interviews. 8 20
Training and development - concept and methods,
Performance appraisal- concept and methods.
SECOND INTERNAL EXAM
Directing and Controlling: Supervision, Motivation - significance, motivational
theories - Maslow's need hierarchy.
Basic control process - control as a feedback system.
VI 8 20
Quality engineering, quality control, control chart (basic concepts),
Introduction to ISO 9000 and 14000 standards, TQM, Six Sigma concepts,
Bench marking, Introduction to marketing, marketing mix, Product Life cycle.
END SEMESTER EXAM
Year of
Course No. Course Name L-T-P Credits
Introduction
RLMCA109 Digital Fundamentals 3-1-0-4 2016
Course Objectives
Syllabus
Number Systems, Logic Gates and Boolean algebra, Combinational and Sequential circuits,
Registers and Counters, Introduction to Computers.
Expected Outcome
References
Suggested MOOC
1. https://www.coursera.org/learn/build-a-computer
Course Plan
End-Semester
% of marks in
Examination
Allotted
Module
Contents
Hours
Introduction of number systems - Binary, Decimal and Hexadecimal-
Conversions. Arithmetic operations on binary numbers, Representation of
I 9 15
signed numbers - 1's compliment and 2s compliment - Representation of
floating point numbers - BCD representation.
Logic gates and Boolean algebra - Basic gates - AND, OR, NOT, NAND, NOR,
XOR - their symbols and truth tables. Boolean algebra - Basic laws and
II 9 20
theorems - Boolean functions - truth table - minimization of Boolean function
using K map method, Realization using logic gates and universal gates.
FIRST INTERNAL EXAM
Combinational Circuits - Basic ideas about combinational circuits - Half adder -
III Full Adder, Parallel binary adder, Subtracter, Decoders, Encoders, Multiplexers, 10 20
Demultiplexers, Parity bit generator.
Sequential circuit - Basic ideas about sequential logic, Clocking, Flip flops RS, JK
IV 7 15
D and T flip flops, edge triggering , level triggering.
Registers and counters - Serial in serial out, Serial in Parallel out, Parallel in
serial out, Parallel in Parallel out registers, Bidirectional shift registers,
V 7 20
Synchronous and asynchronous counters, UP/DOWN counters, Modulo-N
Counters.
SECOND INTERNAL EXAM
Introduction of Computers - Overview of PC architecture - Basic components of
a computer - PC hardware – Motherboards - Expansion boards -Specifications
of Personal computers.
Note : The last module should be taught in a tutorial session. Students should
be shown actual devices. A practical assignment about configuring a PC /
arduino or raspberry pi should be given.
END SEMESTER EXAM
Year of
Course No. Course Name L-T-P Credits
Introduction
RLMCA131 Programming Lab 0-0-4-1 2016
Course Objectives
Syllabus
Expected Outcome
References
Course plan
Experiment
Allotted
Description
Hours
No.
Year of
Course No. Course Name L-T-P Credits
Introduction
RLMCA133 Applied Statistics Lab 0-0-4-1 2016
Course Objectives
Syllabus
Expected Outcome
References
Web Resources
1. PSPP
www.gnu.org/s/pspp/manual/pspp.pdf
2. Simple R
http://www.math.csi.cuny.edu/Statistics/R/simpleR/
Suggested MOOCs
1. https://www.edx.org/course/analyzing-visualizing-data-excel-microsoft-dat206x-1
2. https://www.coursera.org/learn/analytics-excel
3. Instructors can also use the simulations material at
http://wiki.stat.ucla.edu/socr/index.php/SOCR_EduMaterials
Course plan
Experiment
Allotted
Description
Hours
No.
Visualizing Data 50
Random samples.
How to generate random numbers. Study how to select a random sample with
3
replacement from normal and uniform distribution. Students can use the built in
functions to explore random sample selection.
Study of confidence intervals. How to compute confidence intervals for the mean when
5 the standard deviation is known.
How to perform tests of hypotheses about the mean when the variance is known.
How to compute the p-value. Explore the connection between the critical region, the
6
test statistic, and the p-value.
How to find quantiles of the t-distribution. How to perform a significance test for
7 testing the mean of a population with unknown standard deviation.
Compare populations means from two Normal distributions with unknown variance
8 Tests of Hypotheses for One Proportion
Tests of Hypotheses for Comparing Two Proportions
How to calculate the correlation between two variables. How to make scatter plots.
9 Use the scatterplot to investigate the relationship between two variables
Find the least-squares regression line. How to calculate and plot the residuals.
10
The students are expected to write code for statistical applications using the chosen
environment. The instructor may choose a standard data set and ask the students to
work with it.