Course Structure & Syllabus

102 Pages·2016·0.78 MB·English

Babu Banarasi Das University, Lucknow
School of Computer Applications
Master of Computer Applications
Evaluation Scheme

SEMESTER I
Contact
Evaluation Scheme
Course Course Hours
Course Title Credits
Category Code Course
L T P CIA ESE
Total
Theory
Discrete Structure
C MCA2101 3 1 0 40 60 100 4
& Graph Theory
Digital Computer
F MCA2102 3 1 0 40 60 100 4
Fundamental
Principles of
C MCA2103 Programming with 3 1 0 40 60 100 4
'C'
Principles of
C MCA2104 3 1 0 40 60 100 4
Management
Information
C MCA2105 System Analysis 3 1 0 40 60 100 4
and Design
Professional
C MCA2106 3 1 0 40 60 100 4
Communication
Practical
Digital Computer
F MCA2151 0 0 4 40 60 100 2
Fundamental Lab
Principles of
C MCA2152 Programming with 0 0 4 40 60 100 2
'C' Lab
General
GP2101 - - - - - 100 1
Proficiency
Total 18 6 8 900 29
SEMESTER II
Contact
Evaluation Scheme
Course Course Hours
Course Title Credits
Category Code Course
L T P CIA ESE
Total
Theory
Probability &
C MCA2201 Statistical 3 1 0 40 60 100 4
Inference
C MCA2202 Operating System 3 1 0 40 60 100 4
Computer
C MCA2203 Organization and 3 1 0 40 60 100 4
Architecture
Financial
C MCA2204 Accounting & 3 1 0 40 60 100 4
Management
Data Structure
C MCA2205 3 1 0 40 60 100 4
Using 'C'
C MCA2206 E Governance 3 1 0 40 60 100 4
Practical
Data Structure
C MCA2251 0 0 4 40 60 100 2
Using 'C' Lab
Computer
C MCA2252 Organization and 0 0 4 40 60 100 2
Architecture Lab
General
GP2201 - - - - - 100 1
Proficiency
Total 18 6 8 900 29
SEMESTER III
Contact
Evaluation Scheme
Course Course Hours
Course Title Credits
Category Code Course
L T P CIA ESE
Total
Theory
Analysis & Design
C MCA2301 3 1 0 40 60 100 4
of Algorithm
Data
Communication &
C MCA2302 3 1 0 40 60 100 4
Computer
Networks
Object Oriented
C MCA2303 Programming 3 1 0 40 60 100 4
using Java
Computer Based
Numerical &
C MCA2304 3 1 0 40 60 100 4
Statistical
Techniques
Database
C MCA2305 Management 3 1 0 40 60 100 4
System
Environmental
C MCA2306 Issues of IT and 3 1 0 40 60 100 4
Green Computing
Practical
Object Oriented
C MCA2351 Programming 0 0 4 40 60 100 2
using Java Lab
Database
C MCA2352 Management 0 0 4 40 60 100 2
System Lab
General
GP2301 - - - - - 100 1
Proficiency
Total 18 6 8 900 29
SEMESTER IV
Contact
Evaluation Scheme
Course Course Hours
Course Title Credits
Category Code Course
L T P CIA ESE
Total
Theory
UNIX and Shell
C MCA2401 3 1 0 40 60 100 4
Programming
Management
C MCA2402 Information 3 1 0 40 60 100 4
System
Computer
C MCA2403 3 1 0 40 60 100 4
Graphics
Computer Based
C MCA2404 Optimization 3 1 0 40 60 100 4
Techniques
Dataware Housing
C MCA2405 3 1 0 40 60 100 4
& Data Mining
GE Generic Elective I 3 1 0 40 60 100 4
Practical
UNIX and Shell
C MCA2451 0 0 4 40 60 100 2
Programming Lab
Management
C MCA2452 Information 0 0 4 40 60 100 2
System Lab
General
GP2401 - - - - - 100 1
Proficiency
Total 18 6 8 900 29
SEMESTER V
Contact
Evaluation Scheme
Course Course Hours
Course Title Credits
Category Code Course
L T P CIA ESE
Total
Theory
Software
C MCA2501 3 1 0 40 60 100 4
Engineering
Web Technology
C MCA2502 & Application 3 1 0 40 60 100 4
Development
.Net Framework &
C MCA2503 3 1 0 40 60 100 4
C#
Enterprise
C MCA2504 3 1 0 40 60 100 4
Resource Planning
Decision Support
System and
C MCA2505 3 1 0 40 60 100 4
Business
Intelligence
GE Generic Elective II 3 1 0 40 60 100 4
Practical
Web Technology
C MCA2552 & Application 0 0 4 40 60 100 2
Development
.Net Framework &
C MCA2552 0 0 4 40 60 100 2
C#
General
GP2501 - - - - - 100 1
Proficiency
Total 18 6 8 900 29
SEMESTER VI
Evaluation Scheme
Course Course
Course Title Credits
Category Code Course
CIA ESE
Total
C MCA2651 Industrial Training-cum-
350 450 800 28
Project
GP2601 General Proficiency - - 100 1
Total 900 29

Legends:
L Number of Lecture Hours per week
T Number of Tutorial Hours per week
P Number of Practical Hours per week
CIA Continuous Internal Assessment
ESE End Semester Examination
Credit Summary Chart
Semester Total
Course Category %age
I II III IV V VI Credits
Basic Sciences 4 4 2.2
Humanities 4 4 8 4.4
Social Sciences
Professional Subject - Core 20 24 28 24 24 120 69.5
Professional Subject –
4 4 8 4.4
Generic Elective
Professional Subject –

Open Elective
Project Work, Seminar
and/or Internship in 1 1 1 1 1 29 34 19.5
Industry or elsewhere
Total 29 29 29 29 29 29 174 100

Category of Courses:
F Foundation Course
C Core Course
GE Generic Elective
OE Open Elective

Discipline wise Credit Summary Chart

Course Semester Total
%age
Category I II III IV V VI Credits
F 6 6 3.4
C 22 28 28 28 20 28 154 88.8
GE 4 4 8 4.4
OE
GP 1 1 1 1 1 1 6 3.4
Total 29 29 29 29 29 29 174 100
Generic Elective Subject List
Generic Elective I
MCA2411: Mobile Communication System
MCA2412: Distributed System
MCA2413: Artificial Intelligence
MCA2414: Theory of Computation
MCA2415: Software Quality Assurance
Generic Elective II
MCA2511: Distributed Database Management System
MCA2512: Cryptography and Network Security
MCA2513: Compiler Design and Construction
MCA2514: Electronic and Mobile Commerce
MCA2515: Software Project management
I Semester
MCA2101: Discrete Structures and Graph Theory
Course Objective:
1. Students should be able to distinguish between the notion of discrete and
continuous mathematical structures.
2. Students should be able to understand the basic concepts of set theory.
3. Students should be able to apply fundamental counting algorithms to solve applied
problems in the area of computer science.
4. Students should be able to prove mathematical statements by means of inductive
reasoning.
5. Students should be able to understand the principle of recursion and apply it to the
study of sequences and sets.
Learning Outcomes: On completion of this course students will be able to:
1. Verify the correctness of an argument using propositional and predicate logic and
truth tables.
2. Demonstrate the ability to solve problems using counting techniques and
combinatorics.
3. Solve problems of recurrence relations and generating functions.
4. Use graphs and trees as tools to visualize and simplify network related problems.
5. Perform operations on discrete structures such as sets, functions, relations, and
sequences.
6. Construct proofs using direct proof, proof by contraposition, proof by
contradiction, proof by cases and mathematical induction.
Course Contents:
Total
Module Course Topics Credits
Hours
Set Theory, Relation & Function: Set Theory:
Definition of Sets, Type of Sets, Venn Diagrams,
Operation on Sets, Subsets, Power Set, Cartesian
Product, Principle of Inclusion and Exclusion, Multisets;
Relation: Binary Relations, Inverse Relation,
I 30 Hours 1
Composition of Relations, Properties of Relations,
Equivalence Relations, Partial Order Relations, Ordered
Set, Hasse Diagram of Poset; Function: Definition &
Type of Functions, One-to-One Function, Onto Function,
Inverse Function, Compositions of Functions.
Groups and Rings: Binary Operation, Type of Binary
Operations, Algebraic Systems: Semi group, Monoid;
Groups, Abelian group, Properties of Groups, Subgroups,
II 30 Hours 1
Permutation Group, Cyclic Groups, Cosets,
Homomorphism and Isomorphism of Groups, Ring and
Field
Discrete Numeric Function and Recurrence Relation:
III Numeric Function, Generating Function, Recurrence 30 Hours 1
Relation, Linear Recurrence , Relation with Constant
Coefficients, Homogeneous and Particular Solution,
Solution by Method of Generating Function
Fundamentals of Logics & Graph Theory:
Fundamentals of Logics: Proposition, First order Logic,
Logical Operation, Truth Values, Compound Proposition,
Tautologies & Contradiction, Logical Equivalences, De-
Morgan‟s laws. Predicates, Universal and Existential
IV 30 Hours 1
Quantifiers; Graph: Graph Terminology, Bipartite,
Regular and Planar Graph, Euler Graphs, Directed
Graph, Hamiltonian Path and Circuits, Graph Coloring,
Chromatic Number; Tree: Spanning Tree, Minimal
Spanning Tree, Kruskal‟s Algorithms, Prim‟s Algorithms
Suggested Readings:
1. J. P. Tremblay and R. Manohar, “Discrete Mathematical Structure with Application to
Computer Science”, TMH, New Delhi, 2000.
2. Kolman, Busby and Ross “Discrete Mathematical Structures” PHI/Pearson., 6th Ed.,
2009.
3. Kenneth H. Rosen, “Discrete Mathematics & Applications”, TMH, 6th Ed., 2007.
4. C. L. Liu, “Elements of Discrete Mathematics”, McGraw Hill Book Company, 2nd
Ed., 1985.
5. Narsingh Deo, “Graph Theory”, PHI, 24th Indian Print, 2003.