Mca Cbcs Syllabus

ACADEMIC CURRICULUM AND SYLLABI
POSTGRADUATE DEGREE PROGRAMME
MASTER OF COMPUTER APPLICATION
Three Years (Full-Time)
CHOICE BASED CREDIT SYSTEM
(For the Students Admitted from the Academic Year 2017 – 2018)
SCHOOL OF INFORMATION T ECHNOLOGY
(Estd. Under SRMUS Act, 2013)
Shri Ramasamy Memorial University Sikkim

5th Mile, Tadong, Gangtok, East Sikkim- 737102, India
Page 1
1. Department Vision
Stmt - 1 To Create the most conducive environment for imparting quality education in IT domain
Stmt - 2 To produce globally competent quality professionals in the field of IT
Stmt - 3 To prepare young minds to serve community
2. Department Mission
Stmt - 1 Impart student’s essential knowledge and skills required for a successful career in
Information Technology
Stmt - 2 Instil confidence in the students to take up new challenges by grooming them
appropriately
Stmt - 3 Inculcate in the students a sense of commitment to professional ethics, moral values with
emphasis on team work and leadership qualities
Stmt - 4 Instil the students with a clear awareness of environmental issues and their relevance to
their profession
Stmt - 5 Impress upon the students the impact of their work on the nation’s economic and social
progress
3. Program Educational Objectives (PEO’s OR PO’s)

To develop student’s competencies in various applications areas of IT like education,
PEO-1
finance, entertainment, agriculture, medical and others technology rich environment.
Apply knowledge & skills in design and development of software to cater to the needs of
PEO-2
current industry requirements.
To develop strong student skills in research, analysis and interpretation of complex
PEO-3
information.
PEO-4 To demonstrate highest standard of professional, behavior and ethical skills.
PEO-5 To develop critical, interpersonal and communication skills of highest possible standard.
PEO-6 To develop life-long learning commitment to improve oneself and society as a whole.
4. Consistency of PEO’s with Mission of the Department

Mission Stmt. - 1 Mission Stmt. - 2 Mission Stmt. - 3 Mission Stmt. - 4 Mission Stmt. - 5
PEO - 1 H H M H M
PEO - 2 H M H H H
PEO - 3 M H M H H
PEO - 4 H H H M M
PEO - 5 H H M H H
PEO - 6 H H H H H
H – High Correlation, M – Medium Correlation, L – Low Correlation

5. Consistency of PEO’s with Program Learning Outcomes (PLO)
Program Learning Outcomes (PLO)
1. 2. 3. 4. 5. 6. 7. 8.
Professional Critical Problem Research Community Ethical Life
Team Work
Knowledge Thinking Solving skills Engagement Reasoning Learning
PEO - 1 H H H H H H H H
PEO - 2 H H H H H M M M
PEO - 3 H H H H M H H H
PEO - 4 H H H H H M H H
PEO - 5 H H H H H M M M
PEO - 6 H H H H H M M H
Page 2
6. MCA Program Structure (Total Credit: 132)
Core
Course Course
S.No Course Name L T P L+T+P C
Category Code
Mathematical Foundation of Computer
1 MCA1711 3 1 0 4 4
Science
2 MCA1712 Principles of Management 2 1 0 3 3
3 MCA1713 Programming in C 2 1 0 3 3
4 MCA1714 Operating Systems 3 1 0 4 4
5 MCA1715 Digital Logic Fundamentals 3 1 0 4 4
6 MCA1721 Discrete Mathematics 3 1 0 4 4
7 MCA1722 Object Oriented Programming 2 1 0 3 3
8 MCA1723 Data Structures and Algorithms 2 1 0 3 3
9 MCA1724 Web Technology 3 1 0 4 4
10 MCA1725 Formal language and Automata Theory 3 1 0 4 4
Computer Organization and
11 MCA1731 3 1 0 4 4
Architecture
12 MCA1732 Data Communication and Networks 3 1 0 4 4
13 CORE MCA1733 Database Management System 3 0 0 3 3
14 MCA1734 Advanced Java Programming 3 0 0 3 3
15 MCA1741 Design and Analysis of Algorithm 3 1 0 4 4
16 MCA1742 Distributed Systems 3 1 0 4 4
17 MCA1743 Graphics and Multimedia 3 0 0 3 3
18 MCA1744 Software Engineering Concept 3 1 0 4 4
19 MCA1745 Python Programming 3 0 0 3 3
20 MCA1751 Big Data Analytics 3 0 0 3 3
21 MCA1752 Android Application Development 3 0 0 3 3
22 MCA1753 Advanced Software Engineering 3 1 0 4 4
23 MCA1754 C# .NET 0 2 0 2 2
Total Credits 80
Page 3
Skill Enhancement Course (SEC)
Course Course
Category Code
1 MCA1716 C Programming Practical 0 0 4 4 2
2 MCA1717 Operating Systems Practical 0 0 4 4 2
3 MCA1718 Digital Logic Practical 0 0 4 4 2
4 MCA1726 Object Oriented Programming Practical 0 0 4 4 2
5 MCA1727 Data Structures Practical 0 0 4 4 2
6 MCA1728 Web Technology Practical 0 0 4 4 2
7 MCA1735 Oracle Practical 0 0 4 4 2
8 MCA1736 Advanced Java Programming Practical 0 0 4 4 2
SEC
9 MCA1737 Open Source Technologies 0 1 4 5 3
10 MCA1746 Software Development Practical 0 0 4 4 2
11 MCA1747 Python Programming Practical 0 0 4 4 2
12 MCA1748 Mini Project 0 0 4 4 2
13 MCA1757 Big Data Analytics Practical 0 0 4 4 2
Android Application Development
14 MCA1758 0 0 4 4 2
Practical
15 MCA1759 C#.NET Practical 0 0 4 4 2
Total Credits 31
Discipline Specific Electives (DSE)

Course Course
Category Code
1 MCA1755 Trends in Computing 3 0 0 3 3
DSE
2 MCA1756 Machine Learning 0 1 4 5 3
Total Credits 6
Project
Course Course
Category Code
1 PROJECT MCA1761 Project Work 0 0 35 35 18
Total Credits 20
Course Structure
Discipline Ability
Generic Skill
Specific Enhancement Total Total
Semester Core Elective Enhancement General Project
Electives Compulsory Credits Hours
(GE) Courses (SEC)
(DSE) Courses (AECC)
SEM I 5 - - 3 - - - 24 360
SEM II 5 - - 3 - - - 24 360
SEM III 4 - - 3 - - - 21 315
SEM IV 5 - - 3 - - - 24 360
SEM V 4 2 - 3 - - - 24 360
SEM VI - - - - - - 1 18 270
Total -
80 6 - 31 - 18 135 2025
Credit
Page 4
7. Implementation Plan
MCA Curriculum
Semester I
Course Course
Category Code
Theory
Mathematical Foundation of Computer
1 MCA1711 3 1 0 4 4
Science
2 MCA1712 Principles of Management 2 1 0 3 3
3 Core MCA1713 Programming in C 2 1 0 3 3
4 MCA1714 Operating Systems 3 1 0 4 4
5 MCA1715 Digital Logic Fundamentals 3 1 0 4 4
Practical
6 MCA1716 C Programming Practical 0 0 4 4 2
7 SEC MCA1717 Operating Systems Practical 0 0 4 4 2
8 MCA1718 Digital Logic Practical 0 0 4 4 2
Total Credit 24
Semester II
Theory
1 MCA1721 Discrete Mathematics 3 1 0 4 4
2 MCA1722 Object Oriented Programming 2 1 0 3 3
3 Core MCA1723 Data Structures and Algorithms 2 1 0 3 3
4 MCA1724 Web Technology 3 1 0 4 4
5 MCA1725 Formal language and Automata Theory 3 1 0 4 4
Practical
6 MCA1726 Object Oriented Programming Practical 0 0 4 4 2
7 SEC MCA1727 Data Structures Practical 0 0 4 4 2
8 MCA1728 Web Technology Practical 0 0 4 4 2
Total Credit 24
Semester III
Theory
1 MCA1731 Computer Organization and Architecture 3 1 0 4 4
2 MCA1732 Data Communication and Networks 3 1 0 4 4
Core
MCA1733 Database Management System 3 0 0 3 3
3 MCA1734 Advanced Java Programming 3 0 0 3 3
Practical
4 MCA1735 Oracle Practical 0 0 4 4 2
5 SEC MCA1736 Advanced Java Programming Practical 0 0 4 4 2
6 MCA1737 Open Source Technologies 0 1 4 4 3
Total Credit 21
Page 5
Semester IV
Course Course
Category Code
Theory
1 MCA1741 Design and Analysis of Algorithm 3 1 0 4 4
2 MCA1742 Distributed Systems 3 1 0 4 4
3 Core MCA1743 Graphics and Multimedia 3 0 0 3 3
4 MCA1744 Software Engineering Concept 3 1 0 4 4
5 MCA1745 Python Programming 3 0 0 3 3
Practical
6 MCA1746 Software Development Practical 0 0 4 4 2
SEC
7 MCA1747 Python Programming Practical 0 0 4 4 2
8 MCA1748 Mini Project 0 0 4 4 2
Total Credit 24
Semester V
Theory
1 MCA1751 Big Data Analytics 3 0 0 3 3
2 MCA1752 Android Application Development 3 0 0 3 3
Core
3 MCA1753 Advanced Software Engineering 3 1 0 4 4
4 MCA1754 C# .NET 0 2 0 2 2
5 MCA1755 Trends in Computing 3 0 0 3 3
DSE
6 MCA1756 Machine Learning 0 1 4 5 3
Practical
7 MCA1757 Big Data Analytics Practical 0 0 4 4 2
Android Application Development
8 SEC MCA1758 0 0 4 4 2
Practical
9 MCA1759 C#.NET Practical 0 0 4 4 2
Total Credit 21
Semester VI
1 Project MCA1761 Project Work 0 0 35 35 18
Total Credit 18
Total Credits: 135
Page 6
Program Articulation Matrix
Course Code Course Name Program Learning Outcomes
Engagement
Professional
Community
Team Work
Knowledge
Reasoning
Thinking
Research
Learning
Problem
Solving
Critical
Ethical
Skills
Life
MCA1711 Mathematical-Foundation-of-Computer-Science H H H H - - - H
MCA1712 Principles-of-Management - - - - - - - -
MCA1713 Programming-in-C H H H M - - M H
MCA1714 Operating-Systems H H H M M - M H
MCA1715 Digital-Logic-Fundamentals H H H M - - - H
MCA1716 C-Programming-Practical H H H H M - H H
MCA1717 Operating-Systems-Practical H H H H H - H H
MCA1721 Discrete-Mathematics H H H M - - - M
MCA1722 Object-Oriented-Programming H H H H - - H H
MCA1723 Data-Structures-and-Algorithms H H H H M - M H
MCA1724 Web-Technology H H H H - - - H
MCA1725 Formal-language-and-Automata-Theory H H H H H - - H
MCA1726 Object-Oriented-Programming-Practical H H H H H - M H
MCA1727 Data-Structures-Practical H H H H - - - H
MCA1728 Web-Technology-Practical H H H H - - - H
MCA1731 Computer-Organization-and-Architecture H H H M - - - M
MCA1732 Data-Communication-and-Networks H H H M - - H H
MCA1733 Database-Management-System H H H M - - M H
MCA1734 Advanced-Java-Programming H H H H - - - H
MCA1735 Oracle-Practical H H H H - - - H
MCA1736 Advanced-Java-Programming-Practical H H H H - - - H
MCA1737 Open-Source-Technologies H H H H H H H H
MCA1741 Design-and-Analysis-of-Algorithm H H H H M - - H
MCA1742 Distributed-Systems H H H H - - H H
MCA1743 Graphics-and-Multimedia H H H H H - H H
MCA1744 Software-Engineering-Concept H H H H H - - H
MCA1745 Python-Programming H H H H H - H H
MCA1746 Software-Development-Practical H H H H H - H H
MCA1747 Python-Programming-Practical H H H H H - H H
MCA1748 Mini-Project H H H H M M H H
MCA1751 Big-Data-Analytics H H H H - - - H
MCA1752 Android-Application-Development H H H H - - H H
MCA1753 Advanced-Software-Engineering H H H H H - - H
MCA1754 C#-.NET H H H H M - H H
MCA1755 Trends-in-Computing H H H H H - H H
MCA1756 Machine-Learning H H H H H - - H
MCA1757 Big-Data-Analytics-Practical H H H H H - H H
MCA1758 Android-Application-Development-Practical H H H H H H M H
MCA1759 C#.NET-Practical H H H H H M H H
MCA1761 Project-Work H H H H H H H H
Page 7
LTP C
Course Course Mathematical Foundation of Course
MCA1711 CORE Core
Code Name Computer Science Category 310 4
Pre-requisite Co-requisite
PLO-1
PLO-2
PLO-3
PLO-4
PLO-5
PLO-6
PLO-7
PLO-8
Course Bloom’s
Learning Learning
At the end of this course, learners will be able to:
Outcomes (BL)
Life Learning
Engagement
Professional
Team Work
Community
Knowledge
Reasoning
(CLO) Level
Thinking
Research
Problem
Solving
Critical
Ethical
Skills
Express strong foundations in Logic and
CLO-1 2 H H H M - - - -
Propositional Calculus
CLO-2 Construct concepts of Arguments Principal 3 H H H - - - - M
CLO-3 Develop strong foundations in Set Theory 3 H H H - - - - H
Apply concepts of vectors to solve
CLO-4 4 H H H - - - - M
problems.
Evaluate concepts of matrix to solve
CLO-5 5 H H H H - - - H
problems.
(Level of correlation: 3-High, 2-Medium, 1-Low can be used)
Summary of Course Content

Alignment to
S. No Course Content Hour
CLO
Logic: Statements, connectives, conjunction, disjunction, negation,
1 12 CLO1
tautology, contradiction, logical equivalence, tautological implications.
Arguments, validity of arguments - Principle disjunctive normal form,
2 12 CLO2
Principle conjunctive normal form.
Matrices, types of matrices, addition, subtraction, multiplication of
3 matrices, inverse of matrix, solution of linear equation: matrix method, 12 CLO4, CLO5
Cramer’s rule
Matrices: Symmetric, skew symmetric, Hermitian, skew Hermitian,
4 Orthogonal, Unitary matrices – Cayley Hamilton Theorem –Eigen 12 CLO4, CLO5
values– Eigen vectors.
Sets, Relations and Functions-Sets: sets, representation of sets, types of
sets, operation on sets, Venn diagram.
5 12 CLO3
Relation: types of relation, equivalence relation. Function: types of
functions, composite of two functions, composite of three functions.
Learning Resources
1. Vittal.P.R, (2011)” Mathematical Foundation”, Reprint, Margham Publications,
Text Books
Chennai.
1. R.Veerarajan, “Discrete mathematics”, Tata, Mcgraw Hill.
Ref. Books 2. A.Singaravelu, Meenakshi, “Discrete mathematics”, Publications.
3. P.R.Vittal., Allied mathematics, Margham Publications
Page 8
Bloom’s Continuous Learning Assessment (50% weightage)
Final Examination
Level of Cycle Test 1 Model Examination
Assignment (10) Surprise Test (5) (50 % weightage)
Thinking (10) (20)
1Remember 40% 15% 15% 20% 15%
2Understand 40% 15% 15% 20% 15%
3Apply 20% 25% 25% 25% 25%
4Analyze 0 25% 25% 35% 25%
5Evaluate 0 20% 20% 0 20%
6Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
*CLA: 5% is based on Attendance
Course Designers
Experts from Industry: Experts from Higher Education Internal Experts:
Name, Designation with official mail Institutions: Name, Designation
id Name, Designation with official mail id with official id
Dr. RatikaPradhan, HOD, Dept- Ms. Sabna
Computer Application, SMIT Sharma,Assistant
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
Page 9
LTP C
Course Course Course
MCA1712 Principles of Management CORE Core
Code Name Category 2103
PLO-1
PLO-2
PLO-3
PLO-4
PLO-5
PLO-6
PLO-7
PLO-8
Course Bloom’s
Learning Learning
Outcomes (BL)
Life Learning
Engagement
Professional
Team Work
Community
Knowledge
Reasoning
(CLO) Level
Research
Thinking
Problem
Solving
Critical
Ethical
Skills
Evaluate the global context for taking
CLO-1 managerial actions of planning, organizing 5 H M - L - - - -
and controlling.
Assess global situation, including
CLO-2 opportunities and threats that will impact 4 H M M - - - - -
management of an organization.
To integrate management principles into
CLO-3 3 H M - L - - - -
management practices.
To access and implement managerial
CLO-4 5 M - M - L - - -
skills in industry or as an entrepreneur.
Organize, manage and create budgets for
CLO-5 6 M - M - - - - L
industry.

Alignment to
CLO
Organization - Management - Role of managers - Evolution of
Management thought -
1 Organization and the environmental factors - Managing globally - 12 CLO1
Strategies for International
Business.
Nature and purpose of planning - Planning process - Types of plans –
Objectives - Managing by objective (MBO) Strategies - Types of
2 strategies - Policies - Decision Making - Types of decision - Decision 12 CLO1
Making Process - Rational Decision Making Process - Decision
Making under different conditions.
Nature and purpose of organizing - Organization structure - Formal
and informal groups I organization - Line and Staff authority -
Departmentation - Span of control - Centralization and Decentralization
3 12 CLO2, CLO3
- Delegation of authority - Staffing - Selection and Recruitment -
Orientation -Career Development - Career stages – Training -
Performance Appraisal.
Creativity and Innovation - Motivation and Satisfaction - Motivation
4 12 CLO4
Theories Leadership -
P a g e 10
Leadership theories - Communication - Hurdles to effective
communication -Organization Culture - Elements and types of culture -
Managing cultural diversity.
Process of controlling - Types of control - Budgetary and non-
budgetary control techniques-Managing Productivity - Cost Control -
5 12 CLO5
Purchase Control - Maintenance Control - Quality Control - Planning
operations.
Learning Resources
1. Stephen P. Robbins and Mary Coulter, 'Management', Prentice Hall of India, 8th
edition.
Text Books 2. Charles W L Hill, Steven L McShane, 'Principles of Management', Mcgraw Hill
Education, Special Indian
Edition, 2007.
1. Hellriegel, Slocum & Jackson, “Management - A Competency Based Approach”,
Thomson South
Western, 10th edition, 2007.
2. Harold Koontz, Heinz Weihrich and Mark V Cannice, “Management - A global &
Ref. Books
Entrepreneurial
Perspective”, Tata Mcgraw Hill, 12th edition, 2007.
3. Andrew J. Dubrin, 'Essentials of Management', Thomson Southwestern, 7th edition,
2007.

Final Examination
Level of Thinking Cycle Test 1 Model Examination Assignment (10) Surprise Test
(50 % weightage)
(10) (20) (5)
1 Remember 40% 15% 20% 20% 20%
2 Understand 40% 15% 20% 20% 20%
3 Apply 0 20% 20% 20% 20%
4 Analyze 20% 20% 20% 20% 20%
5 Evaluate 0 15% 20% 20% 20%
6 Create 0 15% 0 0 0
Total 100% 100% 100% 100% 100
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 11
LTP C
MCA1713 Programming in C CORE Core
PLO-1
Critical Thinking PLO-2
Problem Solving PLO-3
Research Skills PLO-4

PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
At the end of this course, learners will be able to: Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
Knowledge
(CLO)
Reasoning
Ethical
CLO-1 Define the programming concepts of C. 1 H M M - - - M H
CLO-2 Express various control statements. 2 H H H - - - M H
Apply structures of C programming using
CLO-3 3 H H H - - - M H
functions and arrays.
CLO-4 Incorporate pointer concepts. 3 H H H M - - M H
CLO-5 Implement fi1e operations. 3 H H H M - - M H
(Level of corre1ation: 3-High, 2-Medium, 1-Low can be used)

A1ignment to
CLO
C Fundamentals: Introduction to C - The C Character Set - Identifiers
and Keywords - Data Types Constants- Variables and Arrays-
Declarations- Expressions-Statements- Symbolic Constants - Operators
and Expressions: Arithmetic Operators - Unary Operators- Relational
1. 9 CLO-1
and Logical Operators- Assignment Operators - The Conditional
Operator- Library Functions- Data Input and Output: The get char()
Function The put char() Function- The scanf() Function- The printf()
Function- The gets() and puts() Functions.
Branching Statements: if...else - switch – Looping Statements: while -
2. do...while - for - Nested Control Structures - break - continue - Comma 9 CLO-2
Operator- go to
Overview of functions - Defining a Function - Accessing a Function -
Function Prototypes- Passing arguments to a function – Recursion -
Program Structure: Storage Classes - Automatic Variables - Global
3. 9 CLO-3
Variables - Static Variables - Multifile Programs- Arrays: Defining an
Array- Processing an Array Passing Arrays to Functions-
Multidimensional Arrays- Arrays and Strings.
Structures and Unions: Defining a Structure- Processing a Structure-
User Defined Data Types- Structures and Pointers- Passing Structures
4. to Functions- Self Referential Structures – Unions - Data Files: 9 CLO-4
Opening and Closing a Data File-Creating a Data File- Processing a
Data File- Unformatted Data Files
Structures and Unions: Defining a Structure- Processing a Structure-
5. User Defined Data Types- Structures and Pointers- Passing Structures 9 CLO-5
to Functions- Self Referential Structures – Unions - Data Files:
P a g e 12
Opening and Closing a Data File-Creating a Data File- Processing a
Data File- Unformatted Data Files
Learning Resources
1. Gottfried B.S. (1997), Theory and prob1ems of Programming with C, Schaum’s
Text Books
Out1ine Series, Tata McGraw Hill, New Delhi
1. Deitel H.M. & Deitel P.J. (2001), How to Program C, Prentice Hall India, New
Ref. Books Delhi.
2. Kanetkar Y (1995), Let us C, BPB Pub1ications, New Delhi
Bloom’s Continuous Learning Assessment (50% weightage) Final Examination

Level of Thinking Cycle Test 1 Model Examination (50 % weightage)
Assignment (10) Surprise Test (5)
(10) (20)
1 Remember 50% 25% 25% 25% 25%
2 Understand 50% 35% 35% 35% 35%
3 Apply 0 40% 40% 40% 40%
4 Analyze 0 0 0 0 0
5 Evaluate 0 0 0 0 0
6 Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 13
LTP C
MCA1714 Operating System CORE Core
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
Knowledge
(CLO)
Reasoning
Ethical
Define the importance of Operating
CLO-1 1 H - - - - - M H
Systems.
Express Process Management and
CLO-2 2 H M H L M - M H
Scheduling in an Operating Systems.
Apply various Memory and Storage
CLO-3 3 H H H M - - M H
Management techniques.
Analyze various issues regarding Process
CLO-4 4 H H H H - - M H
Synchronization and Deadlocks.

Alignment
to CLO
Fundamental of Operating System: Basic OS Concepts- Organization-
1 Architecture-Structure of OS- OS Operations- OS Services -System 12 CLO1
Calls-Types- System Programs- System Design and Implementation.
Process Management & Scheduling: Overview of Process
Scheduling- Operations on Processes – Cooperating Processes – Inter
2 process Communication-Shared Memory - Message Passing Systems- 12 CLO2
CPU Scheduling - Scheduling Concepts- Scheduling Criteria-
Scheduling Algorithms- Multiprocessor Scheduling.
Process Synchronization & Deadlocks: Critical Section Problem-
Peterson’s solution -Semaphores- Classic Problems of
3 12 CLO3
Synchronization- Monitors – Deadlocks characterization –Methods -
Prevention-Avoidance – Detection- Deadlock Recovery.
Memory Management: Swapping- Contiguous Memory Allocation-
Paging-Hardware support - Protection-Shared Pages- Structure of
4 12 CLO4
page table- Segmentation- Virtual Memory- Demand Paging- Page
Replacement Methods- Thrashing.
Storage Management: File Concepts- Access Methods- Directory
Structures- Protection -File System Structure-Implementation-
5 12 CLO5
Directory Implementation- Allocation Methods- Disk Structure- Disk
Scheduling algorithms
P a g e 14
Learning Resources
1. Silberschatz, Galvin & Gagne (2009), Operating system principles, John Wiley &
Text Books
Sons, 7th Edition, New York.
1. Milan Milenkovic (2003), Operating System Concepts and Design, McGraw Hill,
New Delhi.
Ref. Books 2. Andrew S. Tennenbaum (1997), Modern Operating System, Prentice Hall India,
New Delhi.
3. Deital (1990), an Introduction to Operating System, Pearson Education, New Delhi.

Final Examination
Level of Thinking Cycle Test 1 Model Examination Assignment (10)
Surprise Test (5) (50 % weightage)
(10) (20)
1 Remember 50% 20% 20% 40% 20%
2 Understand 50% 20% 20% 40% 20%
3 Apply 0 30% 30% 20% 30%
4 Analyze 0 30% 30% 0 30%
6 Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 15
LTP C
Course MCA1715 Course Course
Digital Logic Fundamentals CORE Core
PLO-1

PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
Knowledge
(CLO)
Reasoning
Ethical
Define various number systems in use by
CLO-1 1 H H H - - - - H
computer systems.
Express the principles of Boolean algebra
CLO-2 to manipulate and minimize logic 2 H H H - - - - H
expressions.
Implement the concepts of combinational
CLO-3 3 H H H M - - - H
circuits.
Apply the basic operations in designing
CLO-4 3 H H H H - - - H
Arithmetic and Logic unit.
Analyze the operation of sequential
CLO-5 4 H H H M - - - H
circuits built with various flip-flops.

Alignment
to CLO
Binary Number System: Binary to Decimal and Decimal to Binary
Conversion - Hexadecimal number System : Hexadecimal to
Decimal and Decimal to Hexadecimal conversion - Hexadecimal to
1 Binary and Binary to Hexadecimal Conversion – Octal Number 12 CLO1
system : Octal to Decimal and Decimal to Octal Conversion –
Complementation - Logical Gates : AND,OR, NOT, NAND, NOR,
EX-OR and EX-NOR.
Laws of Boolean algebra - DE Morgan’s Theorems - Logical
Expressions: Sum of Product – Product of Sum - Simplification of
2 12 CLO2
Boolean expression: Using Boolean algebra - Using Karnaugh Map -
Using Mc Clausky Method.
Binary addition: Half adder - Full adder - Four bit binary adder -
BCD adder - Binary Subtraction Half subtract or- Full subtract or – CLO3,
3 12
Multiplexer - DE multiplexer- Decoder - Encoder- Flip flops: SR CLO5
Flip flop - D Flip flop - JK Flip flop - T Flip flop.
Registers - Shift Registers- Asynchronous counters - Synchronous
4 12 CLO4
counters - Ring counter - Design of synchronous counters.
Introduction to Arithmetic Unit - Design of Arithmetic Unit - Design
of Logic Unit - Design of ALU - Control Unit- Design of Control
5 12 CLO4
Unit.
P a g e 16
Learning Resources
Text Books 1. Bartee T.C. (2008), Digital Computer Fundamentals, McGraw Hill, New Delhi
1. Donald P Leach, Albert Paul Malvino, Goutham Saha (2008), Digital Principles and
Applications, Tata McGraw Hill, 6th Edition (Special Indian Edition), New Delhi.
Ref. Books
2. Morris Mano, M (2008), Digital Logic and Computer Design, Pearson Education,
New Delhi.

Final Examination
(10) (20)
1 Remember 50% 30% 30% 20% 25%
2 Understand 50% 30% 30% 30% 25%
3 Apply 0 20% 20% 30% 25%
4 Analyze 0 20% 20% 20% 25%
6 Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 17
LTP C
MCA1716 C Programming Practical SEC Skill Enhancement Course
PLO-1

PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
Knowledge
(CLO)
Reasoning
Ethical
CLO-1 Demonstrate basic programming concepts. 3 H H H H M - - H
CLO-2 Construct various control statements. 3 H H H H M - - H
Imp1ement structures of C programming
CLO-3 3 H H H H M - - H
using functions and arrays.
CLO-4 Apply pointer concepts. 3 H H H H M - H H
CLO-5 Create a program using fi1e operations. 6 H H H H M - H H
(Level of corre1ation: 3-High, 2-Medium, 1-Low can be used)

A1ignment to
CLO
1. Basic program understanding the variables and Data types 12 CLO 1
2. Program on Contro1 statements 12 CLO 2
3. Programs on Functions and arrays 12 CLO 3
4. Programs using Pointers 12 CLO 4
5. Programs on Structures, Unions and Data fi1es 12 CLO 5
Learning Resources
1. Gottfried B.S. (1997), Theory and prob1ems of Programming with C,
Text Books
Schaum’s Out1ine Series, Tata McGraw Hill, New Delhi
1. Deitel H.M. & Deitel P.J. (2001), How to Program C, Prentice Hall India, New
Ref. Books Delhi.
2. Kanetkar Y (1995), Let us C, BPB Pub1ications, New Delhi

Level of Model Exam Practical File Copy Output Result on Time (10) (50 % weightage)
Thinking (20) (10)
1 Remember 10% 10% 0% 10%
2 Understand 20% 20% 0% 10%
3 Apply 20% 20% 50% 30%
4 Analyze 10% 10% 0% 10%
5 Evaluate 20% 25% 50% 30%
6 Create 20% 15% 0% 10%
Total 100% 100% 100% 100%
*CLA: 10% is based on Regularity/Attendance
P a g e 18
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 19
LTP C
MCA1717 Operating System Practical SEC Skill Enhancement Course
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
CLO-1 Familiarize with Linux Commands 2 H M L - - - - H
Implement Process Management &
CLO-2 3 H H H M H - M H
Scheduling Techniques
Incorporate Memory Management
CLO-3 3 H H H H M - H H
techniques
Analyze Process Synchronization &
CLO-4 4 H H H H H - - H
Deadlocks
CLO-5 Evaluate Storage Management 5 H H H H H - H H

Alignment to
CLO
Basic Linux Command to have an idea about the operation of
1 12 CLO1
System
2 Experiment to implement Process Management & Scheduling 12 CLO2
Experiment to gain knowledge on Process Synchronization & CLO4
3 12
Deadlocks
4 Demonstration of Memory Management techniques 12 CLO3
5 Experiment to evaluate Storage Management 12 CLO5
Learning Resources
1. Silberschatz, Galvin & Gagne (2015), Operating system principles, John Wiley &
Text Books
Sons, 7th Edition, New York.
1. Milan Milenkovic (2015), Operating System Concepts and Design, McGraw Hill,
New Delhi.
Ref. Books
2. Andrew S. Tennenbaum (1997), Modern Operating System, Prentice Hall India,
New Delhi.
P a g e 20
Final Examination
Level of Output Result on Time
Model Exam (20) Practical File Copy (10) (50 % weightage)
Thinking (10)
1 Remember 10% 10% 0% 10%
2 Understand 20% 20% 0% 10%
3 Apply 20% 20% 50% 30%
4 Analyze 10% 10% 0% 10%
5 Evaluate 20% 25% 50% 30%
6 Create 20% 15% 0% 10%
Total 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 21
LTP C
MCA1721 Discrete Mathematics CORE Core
PLO-1

PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
Develop Mathematical logic and to be
CLO-1 able to solve various mathematical logical 3 H H H - - - - M
problems.
Apply Inference theory of statement
CLO-2 3 H H H - - - - M
calculus
CLO-3 Apply Counting principles. 3 H H H - - - - M
CLO-4 Develop concept of Abstract algebra. 3 H H H - - - - H
Apply Boolean logic and Recurrence
CLO-5 3 H H H M - - - H
relations

Alignment to
CLO
Mathematical Logic :Statements, Connectives, Truth tables, Normal
forms DNF and CNF, PCNF and PDNF, Validity using truth tables,
Inference theory of statement calculus- direct and indirect method,
1 12 CLO1, CLO2
Inference theory of statement calculus using rule CP, Consistency and
inconsistency, Predicates, Quantifiers, Inference Theory of predicate
calculus
Counting Principles: Mathematical logic – problems - Pigeonhole
2 Principle - Generalized Pigeonhole principle - Principle of inclusion and 12 CLO1, CLO2
exclusion - Principle of inclusion and exclusion
Recurrence Relations : Recurrence relation-Recurrence relation from
solution-Solution of Homogeneous Recurrence relation-Solution of
Non- Homogeneous recurrence relation-Solution of Non-
3 Homogeneous recurrence relation-Generating functions-Solution of 12 CLO3
Recurrence relations using generating functions-recursive functions-
Primitive recursive functions-Computable recursive functions, Non –
Computable recursive functions
Algebraic Systems: Groups, Cyclic groups-Permutation groups-
Properties of Groups-Subgroups, homomorphism, Isomorphism-
4 12 CLO4
Properties of homomorphism-Cosets, Lagrange’s Theorem-Normal
subgroups, factor groups-Fundamental Theorem- Cayley’s theorem
Boolean algebra: Relation. Properties-Equivalence relations, Partial
5 orderings-Poset- Lattice-Hasse diagram-Boolean algebra-Properties of 12 CLO5
Boolean algebra-Problems in Boolean algebra
P a g e 22
Learning Resources
1. Tremblay, J.P. and Manohar, R. , “Discrete Mathematical Structures with
Text Books applications to Computer Science”, Tata McGraw Hill Edition, New Delhi,
2001.
1. Sundaresan, V., Ganapathy Subramanian, K.S., and Ganesan, K. , “Discrete
Mathematics”, New Revised Edition, A.R.Publication, Arpakkam, Chennai ,
2002.
2. Alan Doerr and Kenneth Levasseur , “Applied Discrete Structures for
Ref. Books Computer Science”, Galgotia publications, New Delhi, 1992.
3. Kenneth H Rosen , “Discrete Mathematics and its applications”, Tata
McGraw Hill, 7th Edition, New Delhi, 2011.
4. Liu, C.L. , “Elements of Discrete Mathematics”, 2nd Edition, McGraw Hill
Publications, New Delhi, 2002

Final Examination
Level of Cycle Test 1 Model Examination Assignment (10)
Thinking (10) (20)
1 Remember 30% 30% 30% 30% 30%
2 Understand 40% 40% 40% 40% 40%
3 Apply 30% 30% 30% 30% 30%
4 Analyze 0 0 0 0 0
6 Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 23
LTP C
Course Course Object Oriented Course
MCA1722 CORE Core
Code Name Programming Category 3003
PLO-1

PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
Knowledge
(CLO)
Reasoning
Ethical
Define the concepts of Object Oriented
CLO-1 1 H H M - - - - H
Programming.
Demonstrate constructors and destructors
CLO-2 2 H H M - - - - H
in Object Oriented Programming.
Implement operator overloading and type
CLO-3 3 H H H - - - - H
conversion.
Apply the concepts of Inheritance, Virtual
CLO-4 3 H H H M - - H H
Functions and Polymorphism
CLO-5 Apply I/O operations using OOP concept. 3 H H H H - - H H

Alignment to
CLO
Object Oriented Programming Paradigm - Basic concepts of Object
Oriented Programming - Benefits of OOP - Object Oriented
1 9 CLO1
Languages - Applications of OOP. Beginning with C++ - Tokens,
Expressions and Control Structures - Functions in C++.
Classes and Objects – Constructors and Destructors: Default
Constructors parameterized Constructors, Multiple Constructors in a
2 9 CLO2
class, Constructors with default Arguments, Dynamic initialization of
objects, Copy Constructors, Dynamic constructors, Destructors.
Operator Overloading – overloading unary , binary operators using
member function & friend functions - Overloading I/O operators –
3 manipulation of strings using operators - Type Conversions – Built in 9 CLO3
to class type – Class to built in type – one class to another class –
arrays
Extending Classes: Defining derived classes, single, Multilevel,
Multiple, Hierarchical and Hybrid Inheritance. Virtual Base Classes,
Abstract Classes – Constructors in derived classes – Polymorphism –
4 9 CLO4
Compile time & run time polymorphism - Pointers – pointers to
objects - Virtual Functions – Pure virtual functions.
Managing Console I/O Operations: C++ Streams, C++ Stream

Classes, And unformatted I/O Operations, Formatted Console I/O
5 9 CLO5
operations, Managing output with Manipulators – Working with Files:
Classes for File Stream Operations, Opening and closing a file,
P a g e 24
Detecting end-of-file, File Modes and Error handling during file
operations.
Learning Resources
1. Herbert Scheldt (2001), C++ The Complete Reference, TATA McGraw Hill, Third
Text Books
Edition, New Delhi
1. Balagurusamy E(2007), Object Oriented Programming with C++, TATA McGraw
Ref. Books Hill, Third Edition, New Delhi
2. Rob McGregor (2001), Using C++ - Prentice, Hall India, New Delhi.

Final Examination
(10) (20)
1 Remember 50% 30% 30% 30% 30%
2 Understand 50% 30% 30% 30% 30%
3 Apply 0 40% 40% 40% 40%
4 Analyze 0 0 0 0 0
6 Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 25
LTP C
Course Course Data Structures & Course
MCA1723 CORE Core
Code Name Algorithms Category 2103
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
CLO-1 Express different data structures. 1 H H M - - - - M
CLO-2 Classify various non-linear structures. 2 H H H - - - - M
Implement trees and graphs in various
CLO-3 3 H H H H - - - H
applications.
Analyze the optimal performance of
CLO-4 4 H H H H M - M H
various algorithms.

Alignment to
CLO
Introduction - Abstract Data Types (ADT) – Arrays and its
representation –Structures – Stack – Queue – Circular Queue -
1 Applications of stack – Infix to postfix conversion – evaluation of 12 CLO1
expression – Applications of Queue - Linked Lists – Doubly Linked
lists – Applications of linked list – Polynomial Addition
Need for non-linear structures – Trees and its representation – Binary
Tree – expression trees – Binary tree traversals – left child right
2 12 CLO2
sibling data structures for general trees – applications of trees –
Huffman Algorithm - Binary search tree.
AVL trees –B-Trees - Sorting – Bubble sort - Quick Sort - Insertion
3 Sort – Heap sort – Hashing - Hashing functions - Collision Resolution 12 CLO3
Techniques - Separate chaining - Open addressing - Multiple hashing.
Definitions – Representation of graph - Graph Traversals - Depth-first
traversal – breadth-first traversal - applications of graphs - Topological
4 12 CLO3
sort – shortest-path algorithms – minimum spanning tree – Prim's and
Kruskal's algorithms – bi-connectivity – Euler circuits.
Algorithm Analysis – Asymptotic Notations - Divide and
Conquer – Merge Sort – Binary Search - Greedy Algorithms –
Knapsack Problem– Dynamic Programming – Wars
5 12 CLO4
hall’s Algorithm for Finding Transitive Closure – Backtracking –
Sum of Subset Problem – Branch and Bound – Travelling
Salesman Problem.
P a g e 26
Learning Resources
1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition,
Pearson Education, Inc., 2006
Text Books
2. Rajesh K Shukla, “Analysis and Design of Algorithms-A Beginner’s Approach”,
Wiley publisher,2015
1. Ellis Horowitz, Sartajsahni, Sanguthevar, Rajesekaran, “Fundamentals of Computer
Algorithms”, Galgotia Publication Pvt. Ltd., Reprint, 2010.
2. Thomas H Cormen, Charles E Leiserson, Ronald L Revest, Clifford Stein,
Ref. Books “Introduction to Algorithms” 3rd Edition, The MIT Press Cambridge,
Massachusetts London, England, 2014.
3. S.Sridhar, “Design and Analysis of Algorithms”, Oxford University Press, 2015.
4. Richard Johnson Baugh, Marcus Schaefer, “Algorithms”, Pearson education, 2004.
Bloom’s
Level of Thinking Continuous Learning Assessment (50% weightage) Final Examination
Cycle Test 1 Model Examination Assignment (10) (50 % weightage)
Surprise Test (5)
(10) (20)
1 Remember 50% 15% 20% 30% 20%
2 Understand 50% 35% 20% 30% 20%
3 Apply 0% 25% 30% 20% 30%
4 Analyze 0% 25% 30% 20% 30%
5 Evaluate 0% 0% 0% 0% 0%
6 Create 0% 0% 0% 0% 0%
Total 100% 100% 100% 100% 100%
Course Designers
Experts from Higher Education
Experts from Industry: Internal Experts:
Institutions:
Name, Designation with official mail Name, Designation
Name, Designation with official mail
id with official id
id
Professor, Dept-IT
Ms. Ojaswani Dubey,
Assistant Professor,
Dept-IT
P a g e 27
LTP C
MCA1724 Web Technology CORE Core
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
Introduce the basic concepts of Internet
CLO-1 1 H H H - - - - H
and web design.
Implement HTML, CSS and JavaScript
CLO-2 3 H H H H - - - H
for creating visually appealing web pages.
Implement server side programming and
CLO-3 3 H H H H - - - H
Web Hosting.
(Level of correlation: 3-High, 2-Medium, 1-1 can be used)

Alignment to
CLO
Introduction to networks, LAN,MAN and WAN, History of the
Internet, Email concepts, Sending and Receiving files by E-mail,
1 12 CLO1
Intranet, Web system Architecture, Exploring HTTP, URL, Domain
Name System, Web Browsers, Web Pages
Basics of HTML, HTML Document display, Formatting Text, Link,
2 Lists, Images, Tables, Forms, Frames, Website Design consideration, 12 CLO2
Case study: Designing Layout of a web page for any Domain
Syntax of CSS, Style sheets types, Properties and Text attributes
3 Padding, List properties, List Properties, Positioning, Margins, 12 CLO2
Colors, Properties and Table attributes
HTML, HTML and JavaScript, JavaScript Elements, Variables,
Operators, Flow Control Statements, Arrays, Functions, Event
4 12 CLO2
Handling, Browsers and JavaScript, Web Pages and JavaScript,
Frames and JavaScript, Validation of User Form
Client-Side Scripting and Server-Side Scripting, Servlets – Definition,
Advantages, Life Cycle of a Servlets, Creating a Servlet and
5 Configuring, Java Sever Page – Life Cycle and Structure of JSP, 12 CLO3
Active Server Pages – Creating an ASP, IIS installation for ASP,
Built-in Objects, Exploring Forms, Comparison of ASP over JSP.
P a g e 28
Learning Resources
1. Deven N. Shah (2012), A Complete Guide to Internet and Web Programming,
Text Books
DreamTech Press, New Delhi
1. Raj Kamal (2002), Internet and Web Technologies, Tata McGraw Hill, New
Delhi. 2.
Ref. Books
2. Margaret Levine Young (2002), Internet: The Complete Reference, Tata
McGraw Hill, Second Edition, New Delhi.

Final Examination
(10) (20)
1 Remember 40% 40% 40% 40% 40%
2 Understand 40% 40% 40% 40% 40%
3 Apply 20% 20% 20% 20% 20%
4 Analyze 0 0 0 0% 0%
6 Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 29
LTP C
Course Course Formal language and Course
MCA1725 CORE Core
Code Name Automata Theory Category 3104
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
(CLO)
Professional
Team Work
Community
Knowledge
Reasoning
Ethical
CLO-1 Define theoretical concepts of Automata. 1 H H - - - - - H
Express various regular expressions and
CLO-2 2 H M M - - - - H
regular grammars
Illustrate context free grammars and
CLO-3 3 H H H - - - - H
normal forms
Develop models by using the concept of
CLO-4 3 H H H H M - - H
Turing machine
Analyze various P, NP, NP Complete and
CLO-5 4 H H H H H - - H
NP Hard Problems.

Alignment to
CLO
Strings, Alphabet, Language, Operations, Finite State Machine,
definitions, finite automation model, acceptance of strings and
languages, on deterministic finite automation, deterministic finite
1 12 CLO1
automation, equivalence between NFA and DFA, Conversion of NFA
into DFA, minimization of FSM ,equivalence between two FSM's,
Moore and Malay machines.
Regular sets, regular expressions, identity rules, manipulation of regular
expressions, equivalence between RE and FA, inter conversion,
Pumping lemma, Closure properties of regular sets(proofs not
2 12 CLO2
required),regular grammars, right linear and left linear grammars
equivalence between regular linear grammar and FA, inter conversion
between RE and RG.
Context free Grammars, Derivation trees, Left Most Derivations, Right
Most Derivations, Ambiguity in Context-Free Grammars,
3 12 CLO3
Specifications of Context Free Grammars, Normal Forms, Chomsky
Normal Form (CNF), Greibach Normal Form (GNF)
Turing machine, definition, model, design of TM, Computable
4 Functions, recursive enumerable language, Church’s Hypothesis, 12 CLO4
Counter machine, types of TM's(Proofs not required).
Chomsky hierarchy of languages, linear bounded automats and context
5 12 CLO5
sensitive language, Introduction to DCFL and DPDA, LR(O) Grammar,
P a g e 30
decidability of problems, Universal Turing Machine, undecidability of
post’s correspondence problem. Turing reducibility, definition of P and
NP problems, NP complete and NP hard problems
Learning Resources
1. Hopcroft, John E.; Motwani, Rajeev; Ullman, Jeffrey D. (2013). Introduction to
Automata Theory, Languages, and Computation (3rd ed.). Pearson. ISBN
Text Books 1292039051 2. Peter Linz,
2. “An Introduction to Formal Language and Automata”, Third Edition, Narosa
Publishers, New Delhi, 2002
1. John C Martin, “Introduction to Languages and the Theory of Computation”, Third
Edition, Tata McGraw Hill Publishing Company, New Delhi, 2007 2. Kamala
Ref. Books
2. Krithivasan and Rama. R, “Introduction to Formal Languages, Automata Theory
and Computation”, Pearson Education 2009

Final Examination
(10) (20)
1 Remember 50% 25% 25% 25% 25%
2 Understand 50% 25% 25% 25% 25%
3 Apply 0 25% 25% 25% 25%
4 Analyze 0 25% 25% 25% 25%
6 Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 31
LTP C
Course Course Object Oriented Course
MCA1726 SEC Skill Enhancement Course
Code Name Programming Practical Category 0042
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
Write basic programs using C++
CLO-1 3 H H H H - - - H
Implement Object Oriented Programming
CLO-2 6 H H H H H - M H
concepts

Alignment to
CLO
1 Write a program to design a simple calculator. 3 CLO-1
Write a program to print the employee details for n number of 3 CLO-1
2
employees using for loop.
Write a program to print the student marks with grades using switch 3 CLO-1
3
case.
4 Write a program to implement the concept of default constructor. 3 CLO-1,CLO-2
Write a program to implement the concept of Parameterized 3
5 CLO-1,CLO-2
constructor.
6 Write a program to implement the concept of copy constructor. 3 CLO-1,CLO-2
Write a program to implement the concept of constructor 3
7 CLO-1,CLO-2
overloading.
8 Write a program to implement the concept of destructor. 3 CLO-1,CLO-2
9 Write a program to overload unary ++ operator. 3 CLO-2
10 Write a program to implement the concept of operator overloading. 3 CLO-2
11 Write a program to implement the concept of binary operator. 3 CLO-2
12 Write a program to implement the concept of multilevel inheritance. 3 CLO-2
Write a program to implement the concept of Hierarchical 3 CLO-2
13
inheritance.
14 Write a program to implement the concept of hybrid inheritance. 3 CLO-2
15 Write a program to implement the concept of multiple inheritance. 3 CLO-2
16 Write a program to implement the concept of Polymorphism 3 CLO-2
17 Write a program to create a file and read from the file. 3 CLO-2
18 Write a program to detect end of file. 3 CLO-2
19 Write a program to open a file and close file. 3 CLO-2
20 Write a program to handle error during file operations. 3 CLO-2
P a g e 32
Learning Resources
1. Herbert Scheldt (2001), C++ The Complete Reference, TATA McGraw Hill,
Text Books
Third Edition, New Delhi
1. Balagurusamy E(2007), Object Oriented Programming with C++, TATA
Ref. Books McGraw Hill, Third Edition, New Delhi

Final Examination
Thinking (10)
1Remember 10% 10% 0% 10%
2Understand 20% 20% 0% 10%
3Apply 20% 20% 50% 30%
4Analyze 10% 10% 0% 10%
5Evaluate 20% 25% 50% 30%
6Create 20% 15% 0% 10%
Total 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 33
LTP C
Course MCA1727 Course Data Structures Practical Course
SEC Skill Enhancement Course
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
Knowledge
(CLO)
Reasoning
Ethical
CLO-1 Implement stack an queue using array 3 H H H H - - - H
Implement linked list and its operations
CLO-2 3 H H H H - - - H
like inverting list and concatenation.
Create Binary tree and perform various
CLO-3 6 H H H H - - - H
operations
CLO-4 Implement different kinds of sorting 6 H H H H - - - H
Alignment to
CLO
1 Array based implementation of stack and queue. 15 CLO1
Linked list implementations and problems related to linked list such 15
2 CLO2
as inverting list, concatenation.
Demonstration of Binary tree traversals, graph and searching 15
3 CLO2, CLO3
techniques.
4 Sorting algorithms like merge sort, quick sort etc. 15 CLO4
Learning Resources
1. Ellis Horowitz, Sahni, Dinesh Mehta, “Fundamentals of Data Structures in C++”,
Text Books Golgotha publication, New Delhi 1999.
2. Debasis, Samanta “Classic data structure” PHI, - 2 nd Edition.
1. Instructional Software Research and Development (ISRD) Group, “Data Structures
Using C”, First edition, TMH Education Private Limited 2006.
Ref. Books
2. Weiss Mark Allen, “Data Structure and algorithm analysis”, Pearson Education
2006.

Final Examination
Thinking (10)
1 Remember 10% 10% 0% 10%
2 Understand 20% 20% 0% 10%
3 Apply 20% 20% 50% 30%
4 Analyze 10% 10% 0% 10%
5 Evaluate 20% 25% 50% 30%
6 Create 20% 15% 0% 10%
Total 100% 100% 100% 100%
P a g e 34
Course Designers
Institutions:
Name, Designation with official mail Name, Designation with
Name, Designation with official
id official id
mail id
Professor, Dept-IT
Ms. Ojaswani Dubey,
Assistant Professor, Dept-
IT
P a g e 35
LTP C
MCA1728 Web Technology Practical SEC Skill Enhancement Course
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
Knowledge
(CLO)
Reasoning
Ethical
Design web pages using HTML, CSS and
CLO-1 6 H H H H M - - H
JavaScript.
Create server side Programming and web
CLO-2 6 H H H H H - - H
hosting
CLO-3 Apply web security features in web pages. 3 H H H H H - - H

Alignment to
CLO
1 Web designing and Introduction to HTML and CSS 3 CLO1
2 Understanding Javascript and its working 6 CLO2
3 Getting started with node JS and react JS 6 CLO2, CLO3
4 Creating a Dynamic website 3 CLO4, CLO5
6 CLO5,CLO3,CLO
5 Web security features in web pages.
4
Learning Resources
1. Deven N. Shah (2012), A Complete Guide to Internet and Web Programming,
Text Books
DreamTech Press, New Delhi
1. Raj Kamal (2002), Internet and Web Technologies, Tata McGraw Hill, New
Delhi. 2.
Ref. Books
2. Margaret Levine Young (2002), Internet: The Complete Reference, Tata
McGraw Hill, Second Edition, New Delhi.

Final Examination
Thinking (10)
1 Remember 10% 10% 0% 10%
2 Understand 20% 20% 0% 10%
3 Apply 20% 20% 50% 30%
4 Analyze 10% 10% 0% 10%
5 Evaluate 20% 25% 50% 30%
6 Create 20% 15% 0% 10%
Total 100% 100% 100% 100%
P a g e 36
Course Designers
Institutions:
id official id
mail id
Professor, Dept-IT
Ms. Ojaswani Dubey,
IT
P a g e 37
LTP C
Course Course Computer Organization and Course
MCA1731 CORE Core
Code Name Architecture Category 3104
PLO-1

PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
Define the working principle of computer
CLO-1 1 H M M - - - - M
components
Illustrate data representation and digital
CLO-2 2 H H H - - - - M
logic fundamentals
Express chronology of various advanced
CLO-3 2 H - - - - - - M
microprocessors
Classify various memory organization and
CLO-4 3 H M M - - - - M
management
Demonstrate the working principles of
CLO-5 3 H H H M - - - H
Microprocessors and Microcontrollers.

Alignment
to CLO
Computer Operation-Introduction , Computer Organization, Von
Neumann architecture, Device controller-Device Interface signals, I/O
Drivers, CPU operation-CPU states, CPU Registers, Clock, CPU memory
1 12 CLO1
communication, Instruction format and Instruction cycle, Macro
operation; micro operation, RTL (Register Transfer Language),
Instruction set design, Bus Concept, Instruction execution
Fixed point Numbers -Representation types, Sign Extension,1’s
complement, 2’s complement, Floating point Numbers-IEEE
Representation (Only Single precision), Normalization, Excess code,
2 12 CLO2
Gates-AND, OR, NOT, X-OR, X-NOR, NAND, NOR, Flip-flops-R-S,
JK, D,T, Half adder and Full adder, Encoder and Decoder, Multiplexer
and Demultiplexer.
Classification of memory -By functionality(main, auxiliary, cache,
associative, virtual), By access(random access, sequential access, semi
random), By capability(RAM, ROM), Memory hierarchy, Memory
3 parameters, Main memory Limitation, Instruction prefetch, Write Buffer, 12 CLO4
Cache memory-Cache principle, Cache hit and cache miss, Mapping(
direct, associative, se associative), Cache replacement, Cache write,
Cache coherence
Introduction to microprocessors-Microcontroller, RISC & CISC
4 12 CLO5
Microprocessors, Scalar & super scalar processors, Vector & array
P a g e 38
processors, Intel 8086-Pin description, Operating modes-Maximum mode
pin description, Minimum mode pin description, 8086 Register
organization, BIU & EU, Addressing modes of 8086, Interrupts
Chronology of Intel processors-Pentium, Pentium Pro, Pentium II,
Pentium III, Pentium IV, Itanium, Latest Intel processors-Atom, I3,I5, I7,
5 12 CLO3
AMD processors, MIPS processors, SUN’s Sparc processor,
Mobile/Tablet processors
Learning Resources
1. Tripti Dodiya & Zakiya Malek "Computer Organization and Advanced
Text Books
Microprocessors", Cengage .
1. B Govindrajalu, "Computer Architecture and Organization", Tata McGraw-
Ref. Books Hill. 2. Badri Ram,
2. “Advanced Microprocessors and Interfacing”, Tata McGraw-Hill.

Final Examination
(10) (20)
1
Remember 50% 30% 30% 30% 30%
2
Understand 50% 30% 30% 30% 30%
3
Apply 0 40% 40% 40% 40%
4
Analyze 0 0 0 0 0
5
Evaluate 0 0 0 0 0
6
Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 39
LTP C
Course Course Data Communication and Course
MCA1732 CORE Core
Code Name Networks Category 3104
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
Define various network models and its
CLO-1 2 H H M - - - - -
protocols.
Identify various design issues and
CLO-2 3 H H H M - - M H
challenges in different network layers.
Incorporate security protocols within
CLO-3 3 H H H M - - H H
network system.

Alignment to
CLO
Introduction To Computer Network: Network-Protocol & standard –
Standard Organizations-Topology - Base Band & Broad Band
1 Topology –Transmission mode- Addressing-Categories of Network- 12 CLO1
OSI Model- Layers of OSI model –TCP/IP protocol Suite-Difference
between TCP/IP and OSI model.
Physical Layers And Media: Analog and Digital Signals-Periodic
Analog Signal-Digital signals-Transmission impairment-Data rate
2 12 CLO2
limits-Digital Transmission- Analog Transmission-Multiplexing-
Guided & unguided Transmission Media-switching
Data Link Layer: Types of Errors-Block coding-Cyclic Codes-
Checksum-Flow and Error Control-Multiple access using ALOHA-
3 12 CLO2
CSMA-CSMA/CD-CSMA/CA-Channelization-IEEE standard-Wireless
LAN-Cellular Telephony.
Network, Transport And Application Layer: Virtual Circuit and
Datagram Subnet-Routing algorithm-Unicast routing Protocol-
4 Multicast Routing Protocol-Congestion-Congestion Control algorithm- 12 CLO2
DNS in the internet-Remote logging-EMAIL architecture-www and
HTTP Architecture.
Network Security: Introduction to Cryptography-Symmetric key
5 Cryptography-Asymmetric key Cryptography-Security services- 12 CLO3
Message Confidentiality-Digital Signature –firewalls-SSL/TLS.
Learning Resources
1. Behrouz A. Forouzan, Introduction of Data Communication and Networking, -
Text Books
Tata McGraw Hill, 2015
P a g e 40
2. Andrew S Tanenbaum ,Computer Networks, Fourth edition, Tata McGraw
Hill,2016
1. Fred Halsall, Data Communications, Computer Networks and Open Systems,
4th Edition, Addison Wesley, 2015.
Ref. Books
2. Jean Walrand, Communication Network (A first course), Second Edition, Tata
McGraw Hill, 2016.
Bloom’s
Level of Thinking Continuous Learning Assessment (50% weightage) Final Examination
Cycle Test 1 Model Examination Assignment (10) (50 % weightage)
Surprise Test (5)
(10) (20)
1 Remember 40% 40% 40% 40% 40%
2 Understand 40% 40% 40% 40% 40%
3 Apply 20% 20% 20% 20% 20%
4 Analyze 0% 0% 0% 0% 0%
5 Evaluate 0% 0% 0% 0% 0%
6 Create 0% 0% 0% 0% 0%
Total 100% 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 41
Database Management LTP C
MCA1733 System CORE Core
PLO-1

PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
Define various database models and
CLO-1 1 H H H H - - - H
normal forms.
Express the ideas behind data storage and
CLO-2 2 H H H M - - - H
querying
CLO-3 Apply relational model and SQL queries. 3 H H H H - - - H
Incorporate the concepts of transaction
CLO-4 3 H H H M - - H H
management and recovery system
Construct different database system
CLO-5 3 H H H M - - M H
architecture

Alignment to
CLO
Introduction to File and Database systems- Database system structure –
Data Models – Introduction to Network and Hierarchical Models –
Relational Model. E-R model – diagram, generalization, specialization-
1 Data base design - Informal design guidelines for relational schemas; 9 CLO1
functional dependencies; normal forms based on primary keys, general
definitions of 2nd and 3rd normal forms; Boyce-codd normal forms,
4NF, 5NF.
Relational Query Languages – Relational Algebra – Tuple and domain
Relational Calculus – SQL – Data definition- Queries in SQL- Updates-
2 9 CLO3
Views – Integrity and Security – Relational Database design
Record storage and Primary file organization- Secondary Storage

Devices- Operations on Files- Heap File- Sorted Files- Hashing
3 Techniques – Index Structure for files –Different types of Indexes- B- 9 CLO2
Tree - B+Tree - Query processing- query optimization.
Transaction – Properties – Concurrent execution – Serializability –

4 Concurrency control – Protocols – Recovery System – Database 9 CLO4
Security
Concepts of Database System Architectures: Centralized and Client-
5 Server Architectures – Server System Architectures – Parallel Systems- 9 CLO5
Distributed Systems – Parallel Databases- case studies and their
P a g e 42
analysis and design.
Learning Resources
1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan- “Database System
Concepts”, 6th Edition, McGraw-Hill, 2011.
Text Books
2. Ramez Elmasri and Shamkant B. Navathe, “Fundamental Database Systems”,
7th Edition, Pearson Education, 2017.
1. Raghu Ramakrishnan and Johannes Gehrke, “Database Management System”,
3rd Edition, Tata McGrawHill Publishing Company, 2014.
2. Hector Garcia–Molina, Jeffrey D.Ullman and Jennifer Widom, “Database
System Implementation”- Pearson Education- 2000.
3. Peter Rob and Corlos Coronel- “Database System, Design, Implementation
Ref. Books
and Management”, Thompson Learning Course Technology- Fifth edition,
2003.
4. C. J. Date, “An Introduction to Database Systems”, 8th Edition, Addison-
Wesley, 2006.
5. Guy Harrison, “Next Generation Databases”, Apress, 2015.

Final Examination
Level of Thinking Cycle Test 1 Model Examination Assignment (10) Surprise Test (5)
(50 % weightage)
(10) (20)
1 Remember 30% 30% 30% 30% 30%
2 Understand 30% 30% 30% 30% 30%
3 Apply 40% 40% 40% 40% 40%
4 Analyze 0 0 0 0 0
6 Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 43
LTP C
Course Course Advanced Java Course
MCA1734 CORE Core
Code Name Programming Category 3024
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
Explain principles of the Java
CLO-1 1 H H H - - - - H
programming Language
Incorporate networking concepts with
CLO-2 2 H H H H - - - H
Java
Apply GUI tools and multi-threading to
CLO-3 produce well designed, effective 3 H H H H - - - H
applications.
Develop applications using Java Beans
CLO-4 3 H H H H - - - H
and Servlets

Alignment to
CLO
Class and Object, Object Oriented concepts with respect to Java,
1 9 CLO1
Interfaces, Packages, Exception Handling.
Applets specific methods, creating an Applet, Displaying it using
Web Browser with appletviewer.exe, Advantages and Disadvantages
2 9 CLO3
of Applet, Multithreading concepts, Thread Lifecycle, creating
multithread application, thread priorities, thread synchronization.
AWT: Components and Graphics, Containers, Frames and Panels,
3 Layout Managers, AWT all Components. SWING: Features, 9 CLO3
components, containers, Exploring Swing
Networking fundamentals, java.net – networking classes and
4 Interfaces, The Socket class, The URL class, The URL Connection 9 CLO2
class, The Http URL Connection Class, Datagrams.
Java Beans introduction, Beans persistence and introspection, The
Java Beans API, Introduction to Servlets, Life cycle of Servlets, The
5 9 CLO4
servlet API, The javax.servlet Package, The javax.servlet.http
Package, handling Http request and Response.
Learning Resources
Text Books 1. Herbert Schildt, Java the Complete Reference, ninth edition, oracle press.
P a g e 44
1. CAY S. Horstman, Core Java 2 Volume-I, Gary Cornell, ninth edition, Pearson.
Ref. Books 2. Herbert Schildt Dale Skrien, Java Fundamentals-A Comprehensive Introduction,
special Indian edition, Tata McGraw Hill Education Private Limited.

Final Examination
(10) (20)
1 Remember 30% 30% 30% 30% 30%
2 Understand 30% 30% 30% 30% 30%
3 Apply 40% 40% 40% 40% 40%
4 Analyze 0 0 0 0 0
6 Create 0 0 0 0 0
Total 100% 100% 100% 100 100
Course Designers
Institutions:
Name, Designation with official Name, Designation with
mail id official id
mail id
Professor, Dept-IT
Ms. Ojaswani Dubey,
Dept-IT
P a g e 45
LTP C
MCA1735 Oracle Practical SEC Skill Enhancement Course
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
Implement various DDL, DML and DCL
CLO-1 3 H H H - - - - H
Commands.
Create PL/SQL programs using
CLO-2 procedures, functions, triggers and 6 H H H H M - M H
cursors.
CLO-3 Develop various database applications. 6 H H H H H - M H

Alignment
to CLO
1. Creating queries using DDL, DML and DCL Commands
20 CLO-1
2. Create PL/SQL programs using procedures, functions, triggers and
20 CLO-2
cursors.
3. Develop various database applications. 20 CLO-3
TOTAL 60
Learning Resources
1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan- “Database System
Concepts”, 6th Edition, McGraw-Hill, 2011.
Text Books
2. Ramez Elmasri and Shamkant B. Navathe, “Fundamental Database Systems”, 7th
Edition, Pearson Education, 2017.
1. Raghu Ramakrishnan and Johannes Gehrke, “Database Management System”,
3rd Edition, Tata McGrawHill Publishing Company, 2014.
2. Hector Garcia–Molina, Jeffrey D.Ullman and Jennifer Widom, “Database
System Implementation”- Pearson Education- 2000.
Ref. Books 3. Peter Rob and Corlos Coronel- “Database System, Design, Implementation and
Management”, Thompson Learning Course Technology- Fifth edition, 2003.
4. C. J. Date, “An Introduction to Database Systems”, 8th Edition, Addison-Wesley,
2006.
P a g e 46
Bloom’s Final Examination
Continuous Learning Assessment (50% weightage)
Level of Thinking (50 % weightage)
Output Result On Time
Model Practical (20) Practical Copy (10)
(10)
1 Remember 10% 10% 0 10%
2 Understand 20% 20% 0 10%
3 Apply 20% 20% 0 20%
4 Analyze 10% 10% 0 10%
5 Evaluate 20% 25% 100% 20%
6 Create 20% 15% 0 30%
Total 100% 100% 100% 100%
Course Designers
Internal Experts:
Experts from Industry: Experts from Higher Education
Name,
Name, Designation with official mail Institutions:
Designation with
id Name, Designation with official mail id
official id
Professor, Dept-
IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-
IT
P a g e 47
LTP C
Course MCA173 Course Advanced Java Course Skill Enhancement
6 Programming Practical SEC
Code Name Category Course 0 0 3 1.5
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
Implement fundamentals of Java
CLO-1 3 H H H L - - - H
programming language.
Develop multi-threaded programs,
Exception handling and Networking.
Create simple applications using advanced
CLO-3 6 H H H H H H H H
features of Java.
Alignment to
CLO
1 Implementing fundamentals of Java programming. 20 CLO1
Write Java program to implement Multi-threading, Exception 20
2 CLO2
Handling and Networking.
3 Write a Java program to implement the features of advanced Java. 20 CLO3
Learning Resources
1. E. Balagurusamy, “Programming with Java”, Tata McGraw Hill.
Text Books
2. Herbert Schildt, “Java: The Complete Reference”, Tata McGraw Hill.
1. K. Arnold and J. Gosling, “The Java Programming Language”, Addison Wesley.
2. Allamaraju, “Professional Java Server Programming”, Shroff Publication.
3. Patrick Naughton and Herbert Schildt, “JAVA2: The Complete Reference”, Tata
Ref. Books
McGraw Hill.
4. R. Krishnamoorthy & S. Prabhu, “Internet & Java Program”, New Age Internet
Publisher.

Final Examination
Level of Thinking Output Result on Time
Practical File Copy (10) Model Exam (20) (50 % weightage)
(10)
1 Remember 10% 10% 0 10%
2 Understand 20% 20% 0 10%
3 Apply 20% 20% 0 20%
4 Analyze 10% 10% 0 10%
5 Evaluate 20% 25% 100% 20%
6 Create 20% 15% 0 30%
Total 100% 100% 100% 100%
P a g e 48
Course Designers
Institutions:
id official id
mail id
Professor, Dept-IT
Ms. Ojaswani Dubey,
IT
P a g e 49
LTP C
Course MCA173 Course Open Source Technologies Course
7 SEC Skill Enhancement Course
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
Knowledge
(CLO)
Reasoning
Ethical
Implement User and File management in
CLO-1 3 H H H - - - - H
Linux operating system (OS) using CLI.
Incorporate Apache Web Server in Linux
OS for web hosting.
Implement MySQL for database
CLO-3 4 H H H H H M H H
connectivity in Linux OS.
Apply Perl and PHP for creating web
application.

Alignment to
CLO
Apply CLI commands in Linux operating system for User and File
1 10 CLO1
management
Install Apache web server and configure it to host single and multiple 20
2 CLO2
websites.
3 Install MySQL and create databases for various applications 20 CLO3
4 Install and apply Perl and PHP to create web applications. 25 CLO4
Learning Resources
1. E. Balagurusamy, “Programming with Java”, Tata McGraw Hill.
Text Books
2. Herbert Schildt, “Java: The Complete Reference”, Tata McGraw Hill.
1. K. Arnold and J. Gosling, “The Java Programming Language”, Addison
Wesley.
2. Allamaraju, “Professional Java Server Programming”, Shroff Publication.
Ref. Books 3. Patrick Naughton and Herbert Schildt, “JAVA2: The Complete Reference”,
Tata McGraw Hill.
4. R. Krishnamoorthy & S. Prabhu, “Internet & Java Program”, New Age Internet
Publisher.
P a g e 50
Final Examination
Thinking (10)
1 Remember 10% 10% 0 10%
2 Understand 20% 20% 0 10%
3 Apply 20% 20% 0 20%
4 Analyze 10% 10% 0 10%
5 Evaluate 20% 25% 100% 20%
6 Create 20% 15% 0 30%
Total 100% 100% 100% 100%
Course Designers
Institutions:
id official id
mail id
Professor, Dept-IT
Ms. Ojaswani Dubey,
IT
P a g e 51
LTP C
Course Course Design & Analysis of Course
MCA1741 CORE Core
Code Name Algorithms Category 3024
Pre-requisite Data Structures Co-requisite
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
Define Time and Space complexity of
CLO-1 1 H H H - - - - H
Algorithms.
Demonstrate Brute force methods, Divide
CLO-2 & Conquer methods, Greedy algorithm 2 H H H M - - - H
and Dynamic Programming.
Apply various Graph techniques to derive
CLO-3 3 H H H H - - - H
optimal solution.
Analyze P, NP, NP Complete and NP
CLO-4 4 H H H H M - - H
Hard problems.

Alignment to
CLO
Notion of an Algorithm – Fundamentals of Algorithmic Problem
Solving – Important Problem Types – Fundamentals of the
1 Analysis of Algorithm Efficiency – Analysis Framework – 12 CLO1
Asymptotic Notations and its properties – Mathematical analysis
for Recursive and Non-recursive algorithms.
Brute Force - Closest-Pair and Convex-Hull Problems-Exhaustive
Search - Traveling Salesman Problem - Knapsack Problem -
Assignment problem. Divide and conquer methodology – Merge
2 12 CLO2
sort – Quick sort – Binary search – Multiplication of Large
Integers – Strassen’s Matrix Multiplication-Closest-Pair and
Convex-Hull Problems.
Computing a Binomial Coefficient – Warshall’s and Floyd’
algorithm – Optimal Binary Search Trees – Knapsack Problem
3 12 CLO2
and Memory functions. Greedy Technique– Prim’s algorithm-
Kruskal's Algorithm- Dijkstra's Algorithm-Huffman Trees.
The Simplex Method-The Maximum-Flow Problem – Maximum
4 12 CLO3
Matching in Bipartite Graphs- The Stable marriage Problem.
Limitations of Algorithm Power-Lower-Bound Arguments-
Decision Trees-P, NP and NP-Complete Problems--Coping with
5 the Limitations - Backtracking – n-Queens problem – Hamiltonian 12 CLO5
Circuit Problem – Subset Sum Problem-Branch and Bound –
Assignment problem – Knapsack Problem – Traveling Salesman
P a g e 52
Problem- Approximation Algorithms for NP – Hard Problems –
Traveling Salesman problem – Knapsack problem.
Learning Resources
1. Ellis Horowitz, Sartajsahni, Sanguthevar, Rajesekaran, “Fundamentals of
Computer Algorithms”, Galgotia Publication Pvt. Ltd., Reprint, 2010.
2. Thomas H Cormen, Charles E Leiserson, Ronald L Revest, Clifford Stein,
“Introduction to Algorithms” 3rd Edition, The MIT Press Cambridge,
Text Books Massachusetts London, England, 2014
3. S.Sridhar, “Design and Analysis of Algorithms”, Oxford University Press,
2015
4. Richard Johnson Baugh, Marcus Schaefer, “Algorithms”, Pearson
education, 200
1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd
Edition, Pearson Education, Inc., 2006
Ref. Books
2. Rajesh K Shukla, “Analysis and Design of Algorithms-A Beginner’s
Approach”, Wiley publisher,2015

Final Examination
(10) (20)
1 Remember 50% 15% 20% 30% 20%
2 Understand 50% 35% 20% 30% 20%
3 Apply 0 25% 30% 20% 30%
4 Analyze 0 25% 30% 20% 30%
5 Evaluate 0 0% 0% 0% 0%
6 Create 0 0% 0% 0% 0%
Total 100% 100% 100% 100% 100%
Course Designers
Institutions:
mail id official id
mail id
Professor, Dept-IT
Ms. Ojaswani Dubey,
Dept-IT
P a g e 53
LTP C
MCA1742 Distributed Systems CORE Core
PLO-1

PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
Define the design principles in distributed
CLO-1 1 H M - - - - - H
systems, their trend and challenges.
Express System models and Inter-process
CLO-2 2 H H M - - - M H
Communications in distributed systems.
Express Peer-to-peer services and
CLO-3 2 H H M - - - H H
distributed file systems.
Apply clock synchronization and
CLO-4 3 H H H M - - H H
replication in distributed systems.
Analyze various Process and Resource
CLO-5 4 H H H H - - H H
management techniques.

Alignment to
CLO
Examples of Distributed Systems–Trends in Distributed Systems –
1 Focus on resource sharing – Challenges. Case study: World Wide 10 CLO1
Web.
System Model – Inter process Communication - the API for internet
protocols – External data representation and Multicast
communication. Network virtualization: Overlay networks. Case
study: MPI Remote Method Invocation And Objects: Remote
2 Invocation – Introduction - Request-reply protocols - Remote 12 CLO2
procedure call - Remote method invocation. Case study: Java RMI -
Group communication - Publish-subscribe systems - Message queues
- Shared memory approaches - Distributed objects - Case study:
Enterprise Java Beans -from objects to components.
Peer-to-peer Systems – Introduction - Napster and its legacy - Peer-
to-peer – Middleware - Routing overlays. Overlay case studies:
Pastry, Tapestry- Distributed File Systems –Introduction - File service
3 architecture – Andrew File system. File System: Features-File model - 12 CLO3
File accessing models - File sharing semantics Naming: Identifiers,
Addresses, Name Resolution – Name Space Implementation – Name
Caches – LDAP.
Introduction - Clocks, events and process states - Synchronizing
4 13 CLO4
physical clocks- Logical time and logical clocks - Global states –
P a g e 54
Coordination and Agreement – Introduction - Distributed mutual
exclusion – Elections – Transactions and Concurrency Control–
Transactions -Nested transactions – Locks – Optimistic concurrency
control - Timestamp ordering – Atomic Commit protocols -
Distributed deadlocks – Replication – Case study – Coda.
Process Management: Process Migration: Features, Mechanism -
Threads: Models, Issues, Implementation. Resource Management:
5 13 CLO5
Introduction- Features of Scheduling Algorithms –Task Assignment
Approach – Load Balancing Approach – Load Sharing Approach.
Learning Resources
1. George Coulouris, Jean Dollimore and Tim Kindberg, “Distributed
Systems: Concepts and Design”, Fourth
Edition, 2006, Pearson Education, Inc. New Delhi.
Text Books
2. Andrew S. Tanenbaum, Maarten van Steen, “Distributed Systems:
Principles and Paradigms”, 2nd Edition,
2007, PHI Learning Pvt. Ltd., New Delhi.
1. Hagit Attiya, Jennifer Welch, “Distributed Computing: Fundamentals,
Simulations, and Advanced Topics”, 2nd Edition, 2005, Wiley India Pvt. Ltd.,
Ref. Books New Delhi. 2. Mordechai Ben-Ari,
2. “Principles of Concurrent and Distributed Programming”, 2nd Edition, 2006,
Pearson Education, Inc. New Delhi.

Final Examination
Level of Thinking Model Examination Assignment (10)
Cycle Test 1 (10) Surprise Test (5) (50 % weightage)
(20)
1
Remember 50% 20% 20% 20% 20%
2
Understand 50% 20% 20% 20% 20%
3
Apply 0 30% 30% 30% 30%
4
Analyze 0 30% 30% 30% 30%
5
Evaluate 0 0 0 0 0
6
Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 55
LTP C
MCA1743 Graphics and Multimedia CORE Core
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
Define various 2D & 3D Transformation
CLO-1 2 H H M - - - - H
techniques.
Demonstrate various Multimedia tools
CLO-2 2 H H M - - - - H
and techniques.
Apply multimedia communication
CLO-3 3 H H H M M - M H
standards.
CLO-4 Develop simple multimedia application. 3 H H H H H - H H
Alignment to
CLO
2D Transformations – Clipping – Window – View Prot Mapping –
1. Graphical User Interfaces and Interactive Input Methods – Picture 9 CLO1
Construction Techniques – Virtual Reality Environment.
3D Transformation – 3D Viewing – Visible Surface Detection –
2. 9 CLO1
Back Face Detection – Depth Buffer Method – Scan Line Method.
Introduction to Multimedia – Components – Hypermedia –
Authoring – Authoring tools – File formats – Color models – Digital
Audio representation – Transmission – Audio signal processing –
Digital music making – MIDI – Digital video – Video compression
3. 9 CLO2
techniques – Video performance measurements – Multimedia
Databases – Animation – Key frames and tweening techniques –
Principles of animation – Virtual reality – Multimedia for portable
devices
Stream characteristics for Continuous media – Temporal
Relationship – Object Stream Interactions - Media Synchronization
– Models for Temporal Specifications – Streaming of Audio and
4. 9 CLO3
Video – Recovering from packet loss – RTSP –– Multimedia
Communication Standards –RTP/RTCP – SIP and H.263- Real time
streaming and On-demand streaming
Design- Development and evaluation of multimedia a system - The
development of user interface design - Design Process - Multimedia
& the Internet - Multimedia conferencing - Multimedia file sharing
5. 9 CLO4
– Multimedia broadcasting - Multimedia Development Issues -
Multimedia project - Structured Multimedia development -
Multimedia project timing - Sample project.
P a g e 56
Learning Resources
1. Donald Hearn and M. Pauline Baker- “Computer Graphics in C Version”-
Second Edition- Pearson Education
Text Books
2. Tom McReynolds – David Blythe “Advanced Graphics Programming Using
OpenGL” - Elsevier-2010
1. Parag Havaldar and Gerard Medioni- “Multimedia Systems-Algorithms-
Standards and Industry Practices”- Course Technology- Cengage Learning- 2010.
Ref. Books
2. John F. Koegel Bufend - “Multimedia systems”- Pearson Education- Delhi-
2002

Final Examination
(10) (20)
1 Remember 50% 30% 30% 30% 30%
2 Understand 50% 30% 30% 30% 30%
3 Apply 0 40% 40% 40% 40%
4 Analyze 0 0 0 0 0
6 Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Experts from Industry: Experts from higher Education Internal Experts:
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 57
LTP C
Course Course Software Engineering Course
MCA1744 CORE Core
Code Name Concept Category 3104
PLO-1

PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
Knowledge
(CLO)
Reasoning
Ethical
Define various software development
CLO-1 1 H M M - H M - H
models.
Express requirement analysis and design
CLO-2 2 H H H - - - M H
process for software development.
Implement UML diagram for software
CLO-3 3 H H H M - - - H
development models.
Analyze various Object Oriented
applications.
Design business logic for various
CLO-5 4 H H H H H - H H
applications.

Alignment to
CLO
Introduction to software engineering
Characteristics of software -The Changing Nature of software –
Legacy Software and Software myths – A Generic view of process –
Software Engineering: A layered Technology and A process
framework- A process framework - Capability Maturity Model
1 Integration, Personal and Team Process Models- Process Models – 12 CLO1
Prescriptive models- Different approaches and models for System
Development- Waterfall- Prototyping - Spiral (including WIN-WIN
Spiral) – RAD- The Incremental Process Models and Evolutionary
Process Models - Specialized Process Models and The Unified
Process- An agile view of Process
Requirements analysis and design
System Engineering - Requirements Engineering – Requirements
Engineering Tasks- Activities in Requirements Determination-
Requirements Anticipation- Requirements Investigation Fact finding
2 methods Requirements Specifications Software requirement 12 CLO2
Specification (SRS) Structure and contents of the requirements
Specification analysis modeling, types of requirements - functional
and non- functional, Quality criteria, requirements definition, SRS
format, Fundamental problems in defining requirements
UML diagrams
3 12 CLO3
UML Architecture – UML Diagrams: UseCase Diagram, Class
P a g e 58
Diagram, Sequence Diagram, Collaboration Diagram, Activity
Diagram, State chart diagram, Object Diagram and relationships,
Component Diagram and Deployment Diagram, Packages and UML
extensibility mechanisms with suitable examples and Case studies
OO analysis
Business Process Analysis- OOA steps- Identify Actors, Business
Process Model - Identify UseCase, Usecase Documentation- Identify
4 classes using Classification theorems: Noun phrase approach, Class 12 CLO4
pattern approach, Usecase driven sequence diagram approach, and
CRC approach – Case study on Identifying object Relationships
Attributes, Methods: Case study approach.
OO design
OOD steps – Axioms and Corollaries - Design Business layer classes
5 –– Design Access layer classes – Compare Relational, Distributed 12 CLO5
and Object Oriented Database – Various Table Class Mapping –
Design View layer classes
Learning Resources
1. Roger, S. Pressman (2004), Software Engineering: A Practitioner Approach,
Text Books McGraw Hill International Edition, Sixth Edition, New Delhi
1. Waman, S Jawadekar (2004), Software Engineering: Principles and Practice,

McGraw Hill Education Pvt. Limited, New Delhi.
Ref. Books
2. Srimathi.H, Srirarm. H &Krishanmoorthy .A (2006), “Object Oriented
Analysis and Design using UML”, Scitech Publications , 2nd edition, India

Final Examination
(20)
1 Remember 50% 20% 20% 20% 20%
2 Understand 50% 20% 20% 20% 20%
3 Apply 0 30% 30% 30% 30%
4 Analyze 0 30% 30% 30% 30%
6 Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Institutions:
id official id
mail id
Professor, Dept-IT
Ms. Ojaswani Dubey,
Dept-IT
P a g e 59
LTP C
MCA1745 Python Programming CORE Core
Pre-requisite C Programming Co-requisite
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
Demonstrate basics of Python
CLO-1 2 H H H - - - - H
programming
Express conditional logic, file handling
CLO-2 2 H H H -- - - - H
and string manipulation functions.
Incorporate List operation in Python
CLO-3 3 H H H -- - - - H
programming.
Apply OOPs principle and Data
Modelling in Python
Develop Graphical user interface using
Python.

Alignment to
CLO
Introduction To Python And Programming: Conceptual introduction:
topics in computer science, algorithms; modern computer systems:
hardware architecture, data representation in computers, software and
operating system; installing Python; basic syntax, interactive shell,
1 9 CLO1
editing, saving, and running a script. The concept of data types;
variables, assignments; immutable variables; numerical types; arithmetic
operators and expressions; comments in the program; understanding
error messages.
Conditional Logic, File Handling And String: Conditions, boolean logic,
logical operators; ranges; Control statements: if-else, loops (for, while);
short-circuit (lazy) evaluation Strings and text files; manipulating files
and directories, os and sys modules; text files: reading/writing text and
2 numbers from/to a file; creating and reading a formatted file (csv or tab- 9 CLO2
separated).
String manipulations: subscript operator, indexing, slicing a string;
strings and number system: converting strings to numbers and vice
versa. Binary, octal, hexadecimal numbers
List operation And Dictionary: Lists, tuples, and dictionaries; basic list
3 operators, replacing, inserting, removing an element; searching and 9 CLO3
sorting lists; dictionary literals, adding and removing keys, accessing
P a g e 60
and replacing values; traversing dictionaries. Design with functions:
hiding redundancy, complexity; arguments and return values; formal vs
actual arguments, named arguments. Program structure and design.
Recursive functions.
Oops Principle And Data Modelling: Classes and OOP: classes, objects,
attributes and methods; defining classes; design with classes, data
4 modeling; persistent storage of objects, inheritance, polymorphism, 9 CLO4
operator overloading (_eq_,_str_, etc); abstract classes; exception
handling, try block
Graphical User Interface And Application Development: Graphical user
interfaces; event-driven programming paradigm, creating simple GUI;
5 9 CLO5
buttons, labels, entry fields, dialogs; widget attributes - sizes, fonts,
colors layouts, nested frames
Learning Resources
3. Kenneth Lambert , Fundamentals of Python: First Programs, Course
Text Books
Technology, Cengage Learning, 2015 ISBN-13: 978-1-111-82270-5
1. Allen downy, Thinking python : How to think like a computer scientist, Green
Tea Press
Ref. Books
2. Mark Lutz, “Programming Python”, O Relly Publisher.

Final Examination
(20)
1 Remember 50% 30% 30% 30% 30%
2 Understand 50% 30% 30% 30% 30%
3 Apply 0 40% 40% 40% 40%
4 Analyze 0 0 0 0 0
6 Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 61
LTP C
Course Course Software Development Course
Code Name Practical Category 0042
PLO-1

PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
Demonstrate various software
CLO-1 2 H H M - - - - H
development models.
Apply requirement analysis and design
CLO-2 3 H H H M M - - H
process for software development.
Implement UML diagram for software
development models.
Create simple software using Software
Development Model.

Alignment to
CLO
1 Develop basic programs to demonstrate software development models. 9 CLO1
2 Implement requirement analysis and design for building software. 9 CLO2
3 Create UML Diagrams for Object Oriented Software process. 9 CLO3
4 Create well-defined software using software development model. 9 CLO4
Learning Resources
2. Roger, S. Pressman (2004), Software Engineering: A Practitioner Approach,
Text Books McGraw Hill International Edition, Sixth Edition, New Delhi
3. Waman, S Jawadekar (2004), Software Engineering: Principles and Practice,

McGraw Hill Education Pvt. Limited, New Delhi.
Ref. Books
4. Srimathi.H, Srirarm. H &Krishanmoorthy .A (2006), “Object Oriented Analysis
and Design using UML”, Scitech Publications , 2nd edition, India
P a g e 62
Final Examination
Thinking (10)
1 Remember 10% 10% 0% 10%
2 Understand 20% 20% 0% 10%
3 Apply 20% 20% 50% 30%
4 Analyze 10% 10% 0% 10%
5 Evaluate 20% 25% 50% 30%
6 Create 20% 15% 0% 10%
Total 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 63
Course Course Python Programming Course LTP C
Code Name Practical Category 0042
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
(CLO)
Community
Knowledge
Reasoning
Ethical
CLO-1 Express the python programming basics 2 H H H -- - - - H
Demonstrate the use of built-in data
CLO-2 2 H H H -- - - - H
structures “lists” and “dictionary”.
Implement GUI application with
CLO-3 3 H H H H - - H H
exceptions handling.
CLO-4 Apply OOPs principle for Data Modelling 3 H H H H H - H H
Develop solution for intelligent system
and create contemporary applications.

Alignment to
CLO
Basic Programs to have an idea on Python programming Syntax and
1 12 CLO1
Semantics
Demonstration on installation of various IDEs and work place, built in 12
2 CLO2
data structures
3 Experiment on List Operation, Dictionary and Functions 12 CLO3
Experiment to gain Oops Principle And Data Modelling including 12
4 CLO4
exception handling.
Design and develop Graphical User Interface And Intelligent 12
5 CLO5
applications including event-driven programming paradigm
Learning Resources
1. Kenneth Lambert , Fundamentals of Python: First Programs, Course Technology,
Text Books
Cengage Learning, 2015 ISBN-13: 978-1-111-82270-5
1. Allen downy, Thinking python : How to think like a computer scientist, Green Tea
Press
Ref. Books
2. Mark Lutz, “Programming Python”, O Relly Publisher.
P a g e 64
Final Examination
(10)
1 Remember 10% 10% 0% 10%
2 Understand 20% 20% 0% 10%
3 Apply 20% 20% 50% 30%
4 Analyze 10% 10% 0% 10%
5 Evaluate 20% 25% 50% 30%
6 Create 20% 15% 0% 10%
Total 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 65
LTP C
MCA1748 Mini Project SEC Skill Enhancement Course
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
Apply concepts of Software development
CLO-1 model for better documentation and 3 H H M - - - - H
implementation of project.
Analyze problems and come up with
CLO-2 4 H H H H - - H H
solutions for the problems.
Create solutions pertaining to analyzed
problem.

Alignment to
CLO
Learning Resources
Text Books
Ref. Books

Level of Thinking Review 0 (10) Review 1 (20) Review 3 (20) (50 % weightage)
1 Remember 10% 10% 10% 10%
2 Understand 20% 20% 20% 20%
3 Apply 20% 20% 20% 20%
4 Analyze 10% 10% 10% 10%
5 Evaluate 20% 25% 20% 20%
6 Create 20% 15% 20% 20%
Total 100% 100% 100% 100%
Course Designers
P a g e 66
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 67
LTP C
MCA1751 Big Data Analytics CORE Core
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
CLO-1 Define Big data and its importance 1 H H H - - - - H
CLO-2 Express various data analysis method 2 H H H H - - - H
Incorporate Hadoop and NoSQL for Big
CLO-3 2 H H H H - - - H
data analytics
Demonstrate various framework and
CLO-4 3 H H H H - - - H
visualization tools

Alignment to
S. No Course content Hour
CLO
Introduction to Big Data Platform – Challenges of Conventional
Systems - Intelligent data analysis – Nature of Data - Analytic
1 Processes and Tools - Analysis vs Reporting - Modern Data 9 CLO1
Analytic Tools - Statistical Concepts: Sampling Distributions -
Statistical Inference - Prediction Error.
Classification, Clustering, and Mining, Information Extraction,
Regression and Feature Selection, Reasoning: Logic and its Limits,
2 9 CLO2
Dealing with Uncertainty, Bayesian Inference, Forecasting, Neural
Models, Introduction to Deep Learning.
History of Hadoop- The Hadoop Distributed File System –
Components of Hadoop-Analyzing the Data with Hadoop- Scaling
Out- Hadoop Streaming- Design of HDFS-Java interfaces to HDFS
3 Basics- Developing a Map Reduce Application-How Map Reduce 9 CLO3
Works-Anatomy of a Map Reduce Job Run-Failures-Job
Scheduling Shuffle and Sort – Task execution - Map Reduce
Types and Formats- Map Reduce Features
Evolution of Document Databases – Design and use of NoSQL
Databases – Storage and Retrieval of Unstructured Data – NoSQL
4 Applications and query options. Types of NoSQL Databases, Graph 9 CLO3
Databases – Neo4j; Case Studies - Real Time Sentiment Analysis,
Stock Market Predictions.
Applications on Big Data Using Pig and Hive – Data processing
operators in Pig – Hive services – HiveQL – Querying Data in Hive
5 9 CLO4
- fundamentals of HBase and ZooKeeper - Visualizations - Visual
data analysis techniques, interaction techniques; Systems and
P a g e 68
applications
Learning Resources
1. Michael Berthold, David J. Hand, “Intelligent Data Analysis”, Springer, 2007.
2. Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”,
Text Books Cambridge University Press, 2012.
3. Tom White, “Hadoop: The Definitive Guide”, Third Edition, O‘reilly Media,
2012
1. Chris Eaton, Dirk DeRoos, Tom Deutsch, George Lapis, Paul Zikopoulos,
“Understanding Big Data: Analytics for Enterprise Class Hadoop and
Streaming Data”, McGrawHill Publishing, 2012.
Ref. Books
2. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge
Data Streams with Advanced Analytics”, John Wiley & sons, 2012.
3. Glenn J. Myatt, “Making Sense of Data”, John Wiley & Sons, 2007.

Final Examination
(10) (20)
1 Remember 40% 30% 30% 30% 30%
2 Understand 60% 30% 30% 30% 30%
3 Apply 0 40% 40% 40% 40%
4 Analyze 0 0 0 0 0
6 Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Institutions:
mail id official id
mail id
Professor, Dept-IT
Ms. Ojaswani Dubey,
Dept-IT
P a g e 69
LTP C
Course Course Android Application Course
MCA1752 CORE Core
Code Name Development Category 3003
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
CLO-1 Express the android overview 1 H H H - - - - H
Apply the various layout for application
CLO-2 3 H H H - - - - H
development
Demonstrate the file handling and
CLO-3 3 H H H H - - H H
messaging mechanism
CLO-4 Implement a location based services 3 H H H H - - H H

Alignment to
CLO
Android overview and Versions – Android open stack, features – Setting
up Android environment (Eclipse, SDK, AVD)- Simple Android
1. 9 CLO-1
application development – Anatomy of Android applications – Activity
and Life cycle – Intents, services and Content Providers
Linear, Absolute, Table, Relative, Frame, Scroll view, Resize and
reposition - Screen orientation – Views: Text view, Edit Text, Button,
Image Button, Checkbox, Toggle Button, Radio Button, Radio Group,
2. Progress Bar, Autocomplete Text, Picker, List views and Web view– 9 CLO-2
Displaying pictures with views: Gallery and Image View, Image
Switcher, Grid view – Displaying Menus: Helper methods, Option and
Context Shared User preferences
File system, System partition, SD card partition, user partition, security,
Internal and External Storage – Managing data using SQLite – Content
3. 9 CLO-3
providers: Data sharing with query string, projections, filters and sort
and User defined content providers
Sending and Receiving – Sending eMail and networking – Downloading
4. binary and text data files – Access Web services – Local and remote 9 CLO-3
services, Asynchronous threading, communication and binding services
Display map, zoom control, view and change, Marking, Geocoding, Get
5. 9 CLO-4
location - Publish Android applications and Deployment
P a g e 70
Learning Resources
1. WeiMengLee, “Beginning Android Application Development”, Wrox Publications
(John Wiley, New York, 2012.
Text Books
2. Ed Burnette,“Hello Android: Introducing Google's Mobile Development Platform”,
The Pragmatic Publishers, 3rd edition, North Carolina USA, 2010.
1. RetoMeier , “Professional Android 4 Application Development”, Wrox Publications
(John Wiley, New York), 2012.
Ref. Books 2. ZigurdMednieks, Laird Dornin, G,.BlakeMeike, Masumi Nakamura ,
“Programming Android: Java Programming for the New Generation of Mobile
Devices”, OReilly Media, USA, 2011.

Final Examination
(10) (20)
1 Remember 40% 40% 40% 40% 40%
2 Understand 30% 30% 30% 30% 30%
3 Apply 30% 30% 30% 30% 30%
4 Analyze 0 0 0 0 0
6 Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 71
LTP C
Course Course Advanced Software Course
MCA1753 CORE Core
Code Name Engineering Category 3104
PLO-1

PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
(CLO)
Knowledge
Reasoning
Ethical
Define the various object oriented
CLO-1 1 H H H - - - - H
methodologies
CLO-2 Develop GUI using various components. 2 H H H - - - - H
CLO-3 Implement various testing strategies 3 H H H H H - - H
Apply various Project management,
CLO-4 3 H H H H H - - H
estimation and scheduling techniques
Analyze Quality assurance and Risk
CLO-5 Management while designing and 4 H H H H H - - H
developing software projects.

S. Alignment to
Course Content Hour
No CLO
Object Oriented Approach and its Benefits – Object Oriented Concepts
– Object Oriented Life Cycle and Quality Attributes – Object Oriented
1 Methodologies such as Rumbaugh OMT, Booch OOD and Jacobson 12 CLO1
OOSE with a Case study - The Unified Approach: Layered Architecture
– Component Based Development – Patterns and Frameworks
Design of input & Control, Objectives of Input Design, Data Capture
Guidelines Design of Source Document, Input Validations- Design of
output, Objectives of Output Design Types Of Output- User Interface
2 design: Elements of good design, design issues, features of modern 12 CLO2
GUI, Menus, Scroll bars, windows, buttons, icons, panels, error
messages etc.- Design of program Specification- Code Design Case
studies should be covered on the Topic
Introduction to Testing - Definition of Testing Terminologies-Testing
Strategies for Conventional Software Validation Testing - System
3 Testing - Debugging Process-Testing Tactics – White Box Testing - 12 CLO3
Black Box Testing - Object Oriented Testing Methods-Testing for
Specialized Environments.
Project Management Spectrum - The People and the Product- The
Process and the Project -Metrics for Process and Projects-Estimation -
4 The Project Planning Process – Resources - Decomposition Techniques 12 CLO4
- Empirical Estimation Models - Project Scheduling Concepts –
Timeline charts and Tracking the Scheduling - Earned Value Analysis.
P a g e 72
Reactive and Proactive Risk Strategies – Software Risks –Risk
Identification and Risk Projection – Risk refinement and Risk
Mitigation, Monitoring and Management -Quality Concepts -Software
Quality Assurance - Software Reviews and Formal Technical Reviews -
5 Statistical Quality Assurance and Software Reliability -The Software 12 CLO5
Configuration Management and the SCM Repository -The Software
Configuration Management Process -Business Process Reengineering
and Reverse Engineering -Restructuring and Forward Engineering -
The Road Ahead -New Modes of Representing Information.
Learning Resources
1. Ali Bahrami (2008), “Object Oriented Systems Development”, Tata McGraw-
Text Books
Hill Edition, New Delhi
1. Rohit Khurana (2011), Software Engineering-Principles and Practices, Vikas
Publishing House Pvt. Ltd., Second Edition, New Delhi.
2. Chairperson, Counting Practices Committee, Valerie Marthaler, EDS, Troy,
Ref. Books Michigan, Function Point Counting Practices Manual Release 4.1.1, The
International Function Point User Group, April 2000.
3. Carlo Ghezzi, Mehdi Jazayari, Dino Mandrioli (1991), Fundamentals of
Software Engineering, Prentice Hall of India, New Delhi.

Final Examination
(20)
1 Remember 50% 20% 25% 25% 20%
2 Understand 50% 20% 25% 25% 20%
3 Apply 0 30% 25% 25% 30%
4 Analyze 0 30% 25% 25% 30%
6 Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Institutions:
id official id
mail id
Professor, Dept-IT
Ms. Ojaswani Dubey,
Dept-IT
P a g e 73
LTP C
MCA1754 C# .NET CORE Core
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
Knowledge
(CLO)
Reasoning
Ethical
CLO-1 Define fundamentals of C# 1 H H M -- - - - H
Express the knowledge acquired about C#
CLO-2 2 H H H -- - - - H
language constructs syntax and semantics.
CLO-3 Apply classes and objects concepts in C#. 3 H H H H - - - H
Incorporate concepts of Object Oriented
CLO-4 3 H H H H M - - H
Programming using C#.
CLO-5 Apply concepts of I/O interfaces using C#. 3 H H H H M - H H

Alignment to
CLO
An Overview of C# - Data Types – Literals – Variables - The Scope
and Lifetime of variables - Type Conversion and Casting - Type
1 Conversion in expressions – Operators. Program Control Statements - 9 CLO1
if and switch Statements - for, while, do-while and for each loop -
Using break - continue and go to Statements.
Class Fundamentals - Creating objects - Reference variables and
assignment and methods Constructors - the new operator –
Destructors - the this keyword – Arrays - One dimensional array -
2 Multidimensional arrays - Jagged arrays - Assigning array references 9 CLO2
- Using the length property - Implicitly typed arrays – for each loop –
Strings.
Controlling access to class members - Passing references to methods -

Use ref and out parameters - Use a variable number of arguments -
3 Return objects - Method Overloading - Overload Constructors - 9 CLO3
Object initializes The Main() method – Recursion - understanding
static - Static classes -Operator Overloading - Indexers and Properties.
Inheritance Basis - Member access and inheritance - Constructors and
inheritance - inheritance and name hiding - Creating a multilevel
hierarchy - Base class references and derived objects - Virtual
4 methods and Overriding - Using Abstract classes - Using sealed to 9 CLO4
prevent Inheritance. The Object class – Interfaces - Using Interface
references - Interface properties - Interface indexers - Interface can be
inherited - Name hiding with interface inheritance.
P a g e 74
The .NET Standard Interfaces - Structures and Enumerations -
Exception Handling - Using I/O - The Stream Classes - Console I/O -
5 FileStream and Byte-Oriented File I/O - Character-Based File I/O - 9 CLO5
Redirecting the Standard Streams - Reading and Writing Binary data -
Random Access Files - Delegates.
Learning Resources
Text Books 1. Herbert Schildt ,(2015)– C# 3.0 : The Complete Reference - McGraw-Hill
1. Svetlin Navako.et al,(2013)-Fundamentals of Computer Programming.
Ref. Books 2. Net 3.5 Programming (2015): Covering .Net Framework, Vb 2015, C#, And
Asp.Net 3.5, Black Book (With CD) 3rd Edition

Final Examination
(20)
1
Remember 50% 30% 30% 30% 30%
2
Understand 50% 30% 30% 30% 30%
3
Apply 0 40% 40% 40% 40%
4
Analyze 0 0 0 0 0
5
Evaluate 0 0 0 0 0
6
Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 75
LTP C
Course Course Course DESCIPLINE SPECIFIC
MCA1755 Trends in Computing DSE
Code Name Category ELECTIVE 3003
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
Knowledge
(CLO)
Reasoning
Ethical
Introduce the concept of Mobile
CLO-1 2 H H H - - - - H
computing
Develop the importance of cloud
CLO-2 computing showing how business agility 2 H H H H M - - H
in an organization can be created.
Apply the Green Computing and its
CLO-3 application considering the environmental 3 H H H H - - H H
benefits.
Express the importance Soft Computing
CLO-4 Frame Works and its application in 3 H H H H - - M H
building real time intelligent systems.
Analyze how Grid computing helps in
CLO-5 4 H H H H H - - H
solving large scale scientific problems.

Alignment to
CLO
Introduction to Mobile Computing – Applications of Mobile
Computing- Generations of Mobile Communication Technologies-
Multiplexing – Spread spectrum -MAC Protocols – SDMA- TDMA-
1 FDMA- CDMA. Introduction to Cellular Systems – GSM – Services & 9 CLO1
Architecture – Protocols – Connection Establishment – Frequency
Allocation – Routing – Mobility Management – Security – GPRS-
UMTS – Architecture – Handover – Security.
Cloud Computing definition, private, public and hybrid cloud. Cloud
types; IaaS, PaaS, SaaS. Benefits and challenges of cloud computing,
public vs private clouds, role of virtualization in enabling the cloud;
2 9 CLO2
Business Agility: Benefits and challenges to Cloud architecture.
Application availability, performance, security and disaster recovery;
next generation Cloud Applications.
Evolution of Distributed computing: Scalable computing over the
Internet – Technologies for network based systems – clusters of
cooperative computers - Grid computing Infrastructures – cloud
3 9 CLO5
computing - service oriented architecture – Introduction to Grid
Architecture and standards Elements of Grid – Overview of Grid
Architecture. Introduction to Open Grid Services Architecture (OGSA)
P a g e 76
– Motivation – Functionality Requirements – Practical & Detailed view
of OGSA/OGSI – Data intensive grid service models – OGSA services.
Green IT Fundamentals: Business, IT and the Environment, Green
computing: carbon foot print, scoop on power, Green IT Strategies:
Drivers, Dimensions and Goals, Environmentally Responsible
Business: Policies, Practices, and Metrics. Green Assets: Buildings,
4 9 CLO3
Data Centers, Networks, and Devices, Green Business Process
Management: Modeling, Optimization, and Collaboration, Green
Enterprise Architecture, Environmental Intelligence, Green Supply
Chains, Green Information Systems: Design and Development Models.
Artificial Neural Network: Introduction, Characteristics- Learning
Methods – Taxonomy – Evolution Of Neural Networks- Basic Models
– Important Technologies – Applications. Fuzzy Logic: Introduction –
Crisp Sets- Fuzzy Sets – Crisp Relations and Fuzzy Relations:
5 9 CLO4
Cartesian Product Of Relation – Classical Relation, Fuzzy Relations,
Tolerance And Equivalence Relations, Non-Iterative Fuzzy Sets.
Genetic Algorithm- Introduction – Biological Background – Traditional
Optimization and Search Techniques – Genetic Basic Concepts.
Learning Resources
1. Jochen Schiller, ―Mobile Communications, PHI, Second Edition, 2015.
2. Rittinghouse, John W., and James F. Ransome, ―Cloud Computing:
Implementation, Management and Security, CRC Press, 2017.
3. Kai Hwang, Geoffery C. Fox and Jack J. Dongarra, “Distributed and Cloud
Ref. Books Computing: Clusters, Grids, Clouds and the Future of Internet”, First Edition,
Morgan Kaufman Publisher, an Imprint of Elsevier, 2012.
4. John Lamb, ―The Greening of IT‖, Pearson Education, 2009.
5. S.N.Sivanandam and S.N.Deepa, “Principles of Soft Computing”, Wiley India
Pvt Ltd, 2011.

Final Examination
(20)
1 Remember 40% 15% 25% 15% 20%
2 Understand 60% 15% 25% 25% 20%
3 Apply 0% 20% 30% 30% 25%
4 Analyze 0% 20% 20% 30% 35%
5 Evaluate 0% 0% 0% 0% 0%
6 Create 0% 0% 0% 0% 0%
Total 100% 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 77
LTP C
Course Course Course DESCIPLINE SPECIFIC
MCA1756 Machine Learning DSE
Code Name Category ELECTIVES 2103
PLO-1

PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
Knowledge
(CLO)
Reasoning
Ethical
Develop basic idea of machine learning
CLO-1 and differentiate between supervised and 2 H H M - - - - H
unsupervised learning.
Demonstrate linear regression and logistic
CLO-2 regression problems, its hypothesis and its 3 H H H H - - - H
solution.
Demonstrate non-linear logistic regression
CLO-3 problems using neural networks, its 3 H H H H - - - H
hypothesis and its optimization.
Develop idea about various Unsupervised
Learning algorithms, large scale machine
CLO-4 3 H H H H M - - H
learning and apply it to solve complex
problems.
CLO-5 Analyze Photo OCR and its concepts. 4 H H H H H - - H

S. Alignment to
Course Content Hour
No CLO
Introduction to Machine Learning; What is Machine Learning;
Supervised Learning; Unsupervised Learning. Matrices and Vectors;
1 8 CLO1
Addition and Scalar Multiplication; Matrix Multiplication Properties;
Inverse and Transpose
Linear: Model Representation; Cost Function; Gradient Descent;
Gradient Descent for Linear Regression; Gradient Descent for Multiple
Variables; Gradient Descent-Feature Scaling, Learning Rate, Features
and Polynomial Regression, Normal Equation, Normal Equation Non-
2 invertibility. Logistic: Classification, Hypothesis Representation, 9 CLO2
Decision Boundary, Cost Function, Simplified Cost Function and
Gradient Descent, Advanced Optimization, Multiclass Classification-
One-vs-all Regularization: The problem of Overfitting, Cost Function,
Regularized Linear Regression, Regularized Logistic Regression
Representation-Neurons and the Brain, Model Representation,
Multiclass Classification; Learning- Cost Function, Backpropagation
3 Algorithm, Backpropagation Intuition, Gradient Checking, Random 9 CLO3
Initialization
Applying Machine Learning: Evaluating a Hypothesis, Model Selection
P a g e 78
and Training/Validation/Test Sets, Diagnosis Bias vs Variance,
Regularization and Bias/Variance, Learning Curves. System Design:
Error Analysis, Trading off Precision and Recall, Data for Machine
Learning. Support Vector Machines: Optimization Objectives, Kernels I,
Kernels II, Using an SVM
K-Means Algorithm; Dimensionally Reduction; Anomaly Detection;
Recommender Systems: Problem Formulation, Content Based
Recommendations, Collaborative Filtering Collaborative Filtering
Algorithm, Vectorization: Low Rank Matrix Factorization,
4 Implementation Detail: Mean Normalization 9 CLO4
Large Scale Machine Learning: Learning With Large Datasets,
Stochastic Gradient Descent, Mini-Batch Gradient Descent, Stochastic
Gradient Descent Convergence, Online Learning, Map Reduce and Data
Parallelism
Example Photo OCR: Problem Description and Pipeline, Sliding
5 10 CLO5
Windows, Getting Lots of Data Amd Artificial Data, Ceiling Analysis.
Learning Resources
Text Books 1. Tom Mitchel, Machine Learning, Mc. Graw Hill, 1997
1. Hastie TR Tibshirani & JH Friedman, “ The elements of Statistical Learning: Data
mining Inference and Prediction. Springer 2001
2. Willi Richard, Luis Pedro Coelho, “ Building Machine Learning System with
Ref. Books
python”, Packet Publishing.
3. Duad, Richard, Peter gart & David Stork, “ Pattern Classification”, 2nd Ed

Final Examination
Level of Thinking Cycle Test 1 Model Examination
Assignment (10) Surprise Test (5) (50 % weightage)
(10) (20)
1
Remember 40% 20% 15% 20% 25%
2
Understand 60% 20% 20% 25% 25%
3
Apply 0 20% 20% 15% 20%
4
Analyze 0 40% 20% 40% 30%
5
Evaluate 0 0 0 0 0
6
Create 0 0 0 0 0
Total 100% 100% 100% 100% 100%
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 79
LTP C
MCA1757 Big Data Analytics Practical SEC Skill Enhancement Course
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
Knowledge
(CLO)
Reasoning
Ethical
Demonstrate basic string handling
CLO-1 1 H H H - - - H
program in java
Apply various data analysis tool and
techniques on sample data
CLO-3 Evaluate various Hadoop functionality 5 H H H H H - H H
Create various framework and visualize
data

S. Alignment to
Course content Hour
No CLO
1 Working with basic string handling program in java 12 CLO1
Apply various data analysis tool and techniques on sample
2 12 CLO2
data
Installation and configuration of HDFS and working with
3 12 CLO3
Hadoop functionality
4 Create a framework and visualize data for a sample data 12 CLO4
Learning Resources
5. Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”,
Text Books Cambridge University Press, 2012.
6. Tom White, “Hadoop: The Definitive Guide”, Third Edition, O‘reilly Media,
2012
4. Chris Eaton, Dirk DeRoos, Tom Deutsch, George Lapis, Paul Zikopoulos,
“Understanding Big Data: Analytics for Enterprise Class Hadoop and
Streaming Data”, McGrawHill Publishing, 2012.
Ref. Books
5. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge
Data Streams with Advanced Analytics”, John Wiley & sons, 2012.
P a g e 80
Final Examination
(10)
1 Remember 10% 0 10% 10%
2 Understand 10% 0 20% 20%
3 Apply 20% 50% 20% 20%
4 Analyze 20% 0 10% 10%
5 Evaluate 20% 50% 20% 20%
6 Create 20% 0 20% 20%
Total 100% 100% 100% 100%
Course Designers
Institutions:
mail id official id
mail id
Professor, Dept-IT
Ms. Ojaswani Dubey,
Dept-IT
P a g e 81
LTP C
Course Course Android Application Course
BCA1758 SEC Skill Enhancement Course
Code Name Development Practical Category 0042
Pre-requisite Java Programming Co-requisite Programming Basics
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
Knowledge
(CLO)
Reasoning
Ethical
CLO-1 Develop simple Android application. 3 H H M - - - - H
Develop Android application using
CLO-2 3 H H H - - - - H
various layouts, views, and view elements.
Implement file handling techniques and
CLO-3 database connectivity with real-world 4 H H H H H - M H
experience.
Evaluate Android-based message
handling.
Deploy applications to the Android
CLO-5 6 H H H M H M M H
marketplace for distribution.

Alignment to
CLO
1. Develop an application that uses GUI components, Font and Colors 6 CLO-1
2. Develop an application that uses Layout Managers and event 6 CLO-2
listeners.
3. Develop a native calculator application. 6 CLO-2
4. Write an application that draws basic graphical primitives on the 6 CLO-2
screen.
5. Develop an application that makes use of database. 6 CLO-3
6. Develop an application that makes use of RSS Feed. 6 CLO-3
7. Implement an application that implements Multi-threading 6 CLO-4
8. Develop a native application that uses GPS location information. 6 CLO-5
9. Implement an application that writes data to the SD card. 6 CLO-4
10. Implement an application that creates an alert upon receiving a 6 CLO-4
message.
Write a mobile application that creates alarm clock and deploy it in CLO-4, CLO-
11. 6
Play store 5
TOTAL 60
P a g e 82
Learning Resources
1. WeiMengLee, “Beginning Android Application Development”, Wrox
Text Books
Publications (John Wiley, New York, 2012.
1. Ed Burnette, “Hello Android: Introducing Google's Mobile Development
Platform”, The
Pragmatic Publishers, 3rd edition, North Carolina USA, 2010.
2. Reto Meier, “Professional Android 4 Application Development”, Wrox
Ref. Books Publications (John
Wiley, New York), 2012.
3. Zigurd Mednieks, Laird Dornin, G,.Blake Meike, Masumi Nakamura ,
“Programming Android: Java Programming for the New Generation of Mobile
Devices”, OReilly Media, USA, 2011.
Bloom’s Final Examination (50 %

Continuous Learning Assessment (50% weightage)
Level of Thinking weightage)
Practical Copy Output Result On Time
Model Practical (20)
(10) (10)
1 Remember 10% 10% 0% 10%
2 Understand 20% 20% 0% 10%
3 Apply 20% 20% 50% 30%
4 Analyze 10% 10% 0% 10%
5 Evaluate 20% 25% 50% 30%
6 Create 20% 15% 0% 10%
Total 100 100 100 100
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 83
LTP C
MCA1759 C# .NET Practical SEC Skill Enhancement Course
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
Knowledge
(CLO)
Reasoning
Ethical
Demonstrate simple application using C#
CLO-1 3 H H M - - - - H
language constructs syntax and semantics.
Develop program using object-oriented
CLO-2 3 H H H - - - - H
approach
Develop reusable .NET components via
CLO-3 interface realization and standard design 4 H H H H M - H H
patterns.
Create web and windows applications
using C# and dot NET framework.
Alignment to
CLO
1 Write a program to demonstrate simple program using C#. 12 CLO1
2 Write a program to demonstrate constructs and semantics of C#. 12 CLO1
3 Write a program to demonstrate Object oriented approach in C#. 12 CLO2
4 Write a program to demonstrate various properties of Object in C#. 12 CLO3
Write a program to design and develop windows and web
5 12 CLO4
applications.
Learning Resources
Text Books 1. Herbert Schildt ,(2015)– C# 3.0 : The Complete Reference - McGraw-Hill
Ref. Books 2. Net 3.5 Programming (2015): Covering .Net Framework, Vb 2015, C#, And
Asp.Net 3.5, Black Book (With CD) 3rd Edition

Final Examination
Thinking (10)
1 Remember 10% 10% 0% 10%
2 Understand 20% 20% 0% 10%
3 Apply 20% 20% 50% 30%
4 Analyze 10% 10% 0% 10%
5 Evaluate 20% 25% 50% 30%
6 Create 20% 15% 0% 10%
Total 100% 100% 100% 100%
P a g e 84
Course Designers
Professor, Dept-IT
Ms. Ojaswani
Dubey, Assistant
Professor, Dept-IT
P a g e 85
LT P C
MCA1761 Project PROJECT Project
Code Name Category 0 0 35 18
PLO-1
PLO-5
PLO-6
PLO-7
PLO-8
Course
Bloom’s
Learning
Outcomes
Life Learning
(BL) Level
Engagement
Professional
Team Work
Community
Knowledge
(CLO)
Reasoning
Ethical
Apply concepts of Software development
CLO-1 model for better documentation and 3 H H M - - - - H
implementation of project.
Analyze problems and come up with
CLO-2 4 H H H H - - H H
solutions for the problems.
Evaluate various methodologies for
software development or research based
project and select best one for
implementation.
Create solutions pertaining to analyzed
problem.
Alignment to
CLO
Learning Resources
Text Books
Ref. Books

Final Examination
Level of Review 3 (20)
Review 0 (10) Review 1 (20) (50 % weightage)
Thinking
1 Remember 10% 10% 10% 10%
2 Understand 20% 20% 20% 20%
3 Apply 20% 20% 20% 20%
4 Analyze 10% 10% 10% 10%
5 Evaluate 20% 25% 20% 20%
6 Create 20% 15% 20% 20%
Total 100% 100% 100% 100%
Course Designers
P a g e 86
SEMESTER-I
Course Code Course Name L T P C
MCA1711 Mathematical Foundation of Computer Science 3 1 0 4
LEARNING OUTCOMES:
CLO 1: Express strong foundations in Logic and Propositional Calculus
CLO 2: Construct concepts of Arguments Principal
CLO 3: Develop strong foundations in Set Theory
CLO 4: Apply concepts of vectors to solve problems.
CLO 5: Evaluate concepts of matrix to solve problems.
UNIT I - MATHEMATICAL LOGIC I

Logic: Statements, connectives, conjunction, disjunction, negation, tautology, contradiction, logical
equivalence, tautological implications.
UNIT II - MATHEMATICAL LOGIC II

Arguments, validity of arguments - Principle disjunctive normal form, Principle conjunctive normal
form.
UNIT III - MATRIX THEORY I

Matrices, types of matrices, addition, subtraction, multiplication of matrices, inverse of matrix,
solution of linear equation: matrix method, Cramer’s rule
UNIT IV - MATRIX THEORY II

Matrices: Symmetric, skew symmetric, Hermitian, skew Hermitian, Orthogonal, Unitary matrices –
Cayley Hamilton Theorem –Eigen values– Eigen vectors.
UNIT V - BASIC SET THEORY

Sets, Relations and Functions-Sets: sets, representation of sets, types of sets, operation on sets, Venn
diagram.
Relation: types of relation, equivalence relation. Function: types of functions, composite of two
functions, composite of three functions.
REFERENCE BOOKS:
1. Vittal.P.R, (2011)” Mathematical Foundation”, Reprint, Margham Publications, Chennai.
2. R.Veerarajan, “Discrete mathematics”, Tata, Mcgraw Hill.
3. A.Singaravelu, Meenakshi, “Discrete mathematics”, Publications.
4. P.R.Vittal., Allied mathematics, Margham Publications
P a g e 87
MCA1712 Principles of Management 2 1 0 3
LEARNING OUTCOMES:
CLO1: Evaluate the global context for taking managerial actions of planning, organizing and
controlling.
CLO2: Assess global situation, including opportunities and threats that will impact management of an
organization.
CLO3: To integrate management principles into management practices.
CLO4: Assess managerial practices and choices relative to ethical principles and standards.
CLO5: To access and implement managerial skills in industry or as an entrepreneur.
CLO6: To understand, manage and create budgets for industry.
UNIT I - OVERVIEW OF MANAGEMENT

Organization - Management - Role of managers - Evolution of Management thought -
Organization and the environmental factors - Managing globally - Strategies for International
Business.
UNIT II – PLANNING
Nature and purpose of planning - Planning process - Types of plans – Objectives - Managing by
objective (MBO) Strategies - Types of strategies - Policies - Decision Making - Types of decision -
Decision Making Process - Rational Decision Making Process - Decision Making under different
conditions.
UNIT III – ORGANIZING

Nature and purpose of organizing - Organization structure - Formal and informal groups
I organization - Line and Staff authority - Departmentation - Span of control - Centralization
and Decentralization - Delegation of authority - Staffing - Selection and Recruitment - Orientation -
Career Development - Career stages – Training - Performance Appraisal.
UNIT IV - DIRECTING
Creativity and Innovation - Motivation and Satisfaction - Motivation Theories Leadership -
Leadership theories - Communication - Hurdles to effective communication -Organization Culture -
Elements and types of culture - Managing cultural diversity.
UNIT V - CONTROLLING
Process of controlling - Types of control - Budgetary and non-budgetary control techniques-Managing
Productivity - Cost Control - Purchase Control - Maintenance Control - Quality Control - Planning
operations.
TEXTBOOKS:
1. Stephen P. Robbins and Mary Coulter, 'Management', Prentice Hall of India, 8th edition.
2. Charles W L Hill, Steven L McShane, 'Principles of Management', Mcgraw Hill Education, Special
Indian Edition, 2007.
REFERENCE BOOKS:
P a g e 88
1. Hellriegel, Slocum & Jackson, “Management - A Competency Based Approach”, Thomson South
Western, 10th edition, 2007.
2. Harold Koontz, Heinz Weihrich and Mark V Cannice, “Management - A global & Entrepreneurial
Perspective”, Tata Mcgraw Hill, 12th edition, 2007.
3. Andrew J. Dubrin, 'Essentials of Management', Thomson Southwestern, 7th edition, 2007.
P a g e 89
MCA1713 Programming in C 2 1 0 3
LEARNING OUTCOMES:
CLO 1: Define the programming concepts of C.
CLO 2: Express various control statements.
CLO 3: Apply structures of C programming using functions and arrays.
CLO 4: Incorporate pointer concepts.
CLO 5: Implement fi1e operations.
UNIT I- INTRODUCTION
C Fundamentals: Introduction to C - The C Character Set - Identifiers and Keywords - Data Types-
Constants- Variables and Arrays- Declarations- Expressions-Statements- Symbolic Constants -
Operators and Expressions: Arithmetic Operators - Unary Operators- Relational and Logical
Operators- Assignment Operators - The Conditional Operator- Library Functions- Data Input and
Output: The get char() Function- The put char() Function- The scanf() Function- The printf() Function-
The gets() and puts() Functions.
UNIT II- CONTROL STATEMENTS
Branching Statements: if...else - switch – Looping Statements: while - do...while - for - Nested Control
Structures - break - continue - Comma Operator- go to.
UNIT III- FUNCTIONS AND ARRAYS
Overview of functions - Defining a Function - Accessing a Function - Function Prototypes- Passing
arguments to a function – Recursion - Program Structure: Storage Classes - Automatic Variables -
Global Variables - Static Variables - Multifile Programs- Arrays: Defining an Array- Processing an
Array- Passing Arrays to Functions- Multidimensional Arrays- Arrays and Strings.
UNIT IV- POINTERS
Structures and Unions: Defining a Structure- Processing a Structure- User Defined Data Types-
Structures and Pointers- Passing Structures to Functions- Self Referential Structures – Unions - Data
Files: Opening and Closing a Data File-Creating a Data File- Processing a Data File- Unformatted
Data Files
UNIT V- STRUCTURES, UNIONS AND DATA FILES
Structures and Unions: Defining a Structure- Processing a Structure- User Defined Data Types-
Structures and Pointers- Passing Structures to Functions- Self Referential Structures – Unions - Data
Files: Opening and Closing a Data File-Creating a Data File- Processing a Data File- Unformatted
Data Files
TEXT BOOK:
1. Gottfried B.S. (1997), Theory and problems of Programming with C, Schaum’s Outline Series,
Tata McGraw Hill, New Delhi
REFERENCE BOOKS:
1. Deitel H.M. & Deitel P.J. (2001), How to Program C, Prentice Hall India, New Delhi. Kanetkar
Y (1995), Let us C, BPB Publications, New Delhi
P a g e 90
MCA1714 Operating System 3 1 0 4
LEARNING OUTCOMES:
CLO 1: Define the importance of Operating Systems.
CLO 2: Express Process Management and Scheduling in an Operating Systems.
CLO 3: Apply various Memory and Storage Management techniques.
CLO 4: Analyze various issues regarding Process Synchronization and Deadlocks.
UNIT I- INTRODUCTION TO OPERATING SYSTEM

Basic OS Concepts- Organization- Architecture-Structure of OS- OS Operations- OS Services -System
Calls-Types- System Programs- System Design and Implementation
UNIT II- PROCESS MANAGEMENT AND SCHEDULING

Overview of Process Scheduling- Operations on Processes – Cooperating Processes – Inter process
Communication-Shared Memory - Message Passing Systems- CPU Scheduling - Scheduling
Concepts- Scheduling Criteria- Scheduling Algorithms- Multiprocessor Scheduling.
UNIT III- PROCESS SYNCHRONIZATION AND DEADLOCKS

Critical Section Problem- Peterson’s solution -Semaphores- Classic Problems of Synchronization-
Monitors – Deadlocks characterization –Methods - Prevention-Avoidance – Detection- Deadlock
Recovery.
UNIT IV- MEMORY MANAGEMENT

Swapping- Contiguous Memory Allocation- Paging-Hardware support - Protection-Shared Pages-
Structure of page table- Segmentation- Virtual Memory- Demand Paging- Page Replacement
Methods- Thrashing.
UNIT V- STORAGE MANAGEMENT

File Concepts- Access Methods- Directory Structures- Protection -File System Structure-
Implementation- Directory Implementation- Allocation Methods- Disk Structure- Disk Scheduling
algorithms
TEXT BOOK:
2. Silberschatz, Galvin & Gagne (2009), Operating system principles, John Wiley & Sons, 7th
Edition, New York
REFERENCE BOOKS:
6. Milan Milenkovic (2003), Operating System Concepts and Design, McGraw Hill, New Delhi.
7. Andrew S. Tennenbaum (1997), Modern Operating System, Prentice Hall India, New Delhi.
8. Deital (1990), an Introduction to Operating System, Pearson Education, New Delhi.
P a g e 91
MCA1715 Digital Logic Fundamentals 3 1 0 4
LEARNING OUTCOMES:
CLO 1: Define various number systems in use by computer systems.
CLO 2: Express the principles of Boolean algebra to manipulate and minimize logic expressions.
CLO 3: Implement the concepts of combinational circuits.
CLO 4: Apply the basic operations in designing Arithmetic and Logic unit.
CLO 5: Analyze the operation of sequential circuits built with various flip-flops.
UNIT I - OVERVIEW OF NUMBER SYSTEMS

Binary Number System: Binary to Decimal and Decimal to Binary Conversion - Hexadecimal number
System : Hexadecimal to Decimal and Decimal to Hexadecimal conversion - Hexadecimal to Binary
and Binary to Hexadecimal Conversion – Octal Number system : Octal to Decimal and Decimal to
Octal Conversion –Complementation - Logical Gates : AND,OR, NOT, NAND, NOR, EX-OR and
EX-NOR.
UNIT II - BOOLEAN ALGEBRA AND K-MAP

Laws of Boolean algebra - DE Morgan’s Theorems - Logical Expressions: Sum of Product – Product
of Sum - Simplification of Boolean expression: Using Boolean algebra - Using Karnaugh Map - Using
Mc Clausky Method.
UNIT III- COMBINATIONAL CIRCUITS

Binary addition: Half adder - Full adder - Four bit binary adder - BCD adder - Binary Subtraction Half
subtract or- Full subtract or – Multiplexer - DE multiplexer- Decoder - Encoder- Flip flops: SR Flip
flop - D Flip flop - JK Flip flop - T Flip flop.
UNIT IV - SEQUENTIAL CIRCUITS

Registers - Shift Registers- Asynchronous counters - Synchronous counters - Ring counter - Design of
synchronous counters.
UNIT V – ALU (Arithmetic Logic Unit)

Introduction to Arithmetic Unit - Design of Arithmetic Unit - Design of Logic Unit - Design of ALU -
Control Unit- Design of Control Unit.
TEXT BOOK
1. Bartee T.C. (2008), Digital Computer Fundamentals, McGraw Hill, New Delhi.(For 1 to 5 units)
REFERENCE BOOKS:
1. Donald P Leach, Albert Paul Malvino, Goutham Saha (2008), Digital Principles and Applications,
Tata McGraw Hill, 6th Edition (Special Indian Edition), New Delhi.
2. Morris Mano, M (2008), Digital Logic and Computer Design, Pearson Education, New Delhi.
P a g e 92
SEMESTER II

MCA1721 Discrete Mathematics 3 1 0 4
LEARNING OUTCOMES:
CLO 1: Develop Mathematical logic and to be able to solve various mathematical logical problems.
CLO 2: Apply Inference theory of statement calculus
CLO 3: Apply Counting principles.
CLO 4: Develop concept of Abstract algebra.
CLO 5: Apply Boolean logic and Recurrence relations
UNIT I- LOGIC I
Mathematical Logic :Statements, Connectives, Truth tables, Normal forms DNF and CNF, PCNF and
PDNF, Validity using truth tables, Inference theory of statement calculus- direct and indirect method,
Inference theory of statement calculus using rule CP, Consistency and inconsistency, Predicates,
Quantifiers, Inference Theory of predicate calculus.
UNIT II- LOGIC II

Counting Principles: Mathematical logic – problems - Pigeonhole Principle - Generalized Pigeonhole
principle - Principle of inclusion and exclusion - Principle of inclusion and exclusion.
UNIT III- RECURRENCE RELATION

Recurrence Relations : Recurrence relation-Recurrence relation from solution-Solution of
Homogeneous Recurrence relation-Solution of Non- Homogeneous recurrence relation-Solution of
Non- Homogeneous recurrence relation-Generating functions-Solution of Recurrence relations using
generating functions-recursive functions-Primitive recursive functions-Computable recursive
functions, Non –Computable recursive functions
UNIT IV- ALGEBRA I

Algebraic Systems: Groups, Cyclic groups-Permutation groups-Properties of Groups-Subgroups,
homomorphism, Isomorphism-Properties of homomorphism-Cosets, Lagrange’s Theorem-Normal
subgroups, factor groups-Fundamental Theorem- Cayley’s theorem
UNIT V- ALGEBRA II
Boolean algebra: Relation. Properties-Equivalence relations, Partial orderings-Poset- Lattice-Hasse
diagram-Boolean algebra-Properties of Boolean algebra-Problems in Boolean algebra
REFERENCE BOOKS:
1. Tremblay, J.P. and Manohar, R. , “Discrete Mathematical Structures with applications to
Computer Science”, Tata McGraw Hill Edition, New Delhi, 2001.
2. Sundaresan, V., Ganapathy Subramanian, K.S., and Ganesan, K. , “Discrete Mathematics”,
New Revised Edition, A.R.Publication, Arpakkam, Chennai , 2002.
3. Alan Doerr and Kenneth Levasseur , “Applied Discrete Structures for Computer Science”,
Galgotia publications, New Delhi, 1992.
4. Kenneth H Rosen , “Discrete Mathematics and its applications”, Tata McGraw Hill, 7th
Edition, New Delhi, 2011.
5. Liu, C.L. , “Elements of Discrete Mathematics”, 2nd Edition, McGraw Hill Publications, New
Delhi, 2002.
P a g e 93
MCA1722 Object Oriented Programming 2 1 0 3
LEARNING OUTCOMES:
CLO 1: Define the concepts of Object Oriented Programming.
CLO 2: Demonstrate constructors and destructors in Object Oriented Programming.
CLO 3: Implement operator overloading and type conversion.
CLO 4: Apply the concepts of Inheritance, Virtual Functions and Polymorphism
CLO 5: Apply I/O operations using OOP concept.
UNIT I- INTRODUCTION TO OBJECT ORIENTED PROGRAMMING AND C++
Object Oriented Programming Paradigm - Basic concepts of Object Oriented Programming - Benefits
of OOP - Object Oriented Languages - Applications of OOP. Beginning with C++ - Tokens,
Expressions and Control Structures - Functions in C++.
UNIT II- CLASS, OBJECTS AND CONSTRUCTORS

Classes and Objects – Constructors and Destructors: Default Constructors parameterized Constructors,
Multiple Constructors in a class, Constructors with default Arguments, Dynamic initialization of
objects, Copy Constructors, Dynamic constructors, Destructors.
UNIT III- OPERATOR OVERLOADING & TYPE CONVERSION

Operator Overloading – overloading unary , binary operators using member function & friend
functions - Overloading I/O operators – manipulation of strings using operators - Type Conversions –
Built in to class type – Class to built in type – one class to another class –arrays
UNIT IV- INHERITANCE, VIRTUAL FUNCTIONS & POLYMORPHISM

Extending Classes: Defining derived classes, single, Multilevel, Multiple, Hierarchical and Hybrid
Inheritance. Virtual Base Classes, Abstract Classes – Constructors in derived classes – Polymorphism
– Compile time & run time polymorphism - Pointers – pointers to objects - Virtual Functions – Pure
virtual functions.
UNIT V- I/O OPERATIONS AND FILES

Managing Console I/O Operations: C++ Streams, C++ Stream Classes, And unformatted I/O
Operations, Formatted Console I/O operations, Managing output with Manipulators – Working with
Files: Classes for File Stream Operations, Opening and closing a file, Detecting end-of-file, File
Modes and Error handling during file operations.
TEXT BOOK:
1. Herbert Scheldt (2001), C++ The Complete Reference, TATA McGraw Hill, Third Edition, New
Delhi
REFERENCE BOOKS:
1. Balagurusamy E(2007), Object Oriented Programming with C++, TATA McGraw Hill, Third
Edition, New Delhi
P a g e 94
MCA1723 Data Structure and Algorithms 2 1 0 3
LEARNING OUTCOMES:
CLO 1: Express different data structures.
CLO 2: Classify various non-linear structures.
CLO 3: Implement trees and graphs in various applications.
CLO 4: Analyze the optimal performance of various algorithms.
UNIT I-LINEAR DATA STRUCTURES

Introduction - Abstract Data Types (ADT) – Arrays and its representation –Structures – Stack – Queue
– Circular Queue - Applications of stack – Infix to postfix conversion – evaluation of expression –
Applications of Queue - Linked Lists – Doubly Linked lists – Applications of linked list – Polynomial
Addition
UNIT II-TREE STRUCTURES

Need for non-linear structures – Trees and its representation – Binary Tree – expression trees – Binary
tree traversals – left child right sibling data structures for general trees – applications of trees –
Huffman Algorithm - Binary search tree.
UNIT III-BALANCED SEARCH TREES, SORTING AND INDEXING

AVL trees –B-Trees - Sorting – Bubble sort - Quick Sort - Insertion Sort – Heap sort – Hashing -
Hashing functions - Collision Resolution Techniques - Separate chaining - Open addressing - Multiple
hashing.
UNIT IV-GRAPHS
Definitions – Representation of graph - Graph Traversals - Depth-first traversal – breadth-first
traversal - applications of graphs - Topological sort – shortest-path algorithms – minimum spanning
tree – Prim's and Kruskal's algorithms – bi-connectivity – Euler circuits.
UNIT V-ALGORITHM DESIGN AND ANALYSIS

Algorithm Analysis – Asymptotic Notations - Divide and Conquer – Merge Sort – Binary Search -
Greedy Algorithms – Knapsack Problem – Dynamic Programming – Wars hall’s Algorithm for
Finding Transitive Closure – Backtracking – Sum of Subset Problem – Branch and Bound –
Travelling Salesman Problem.
TEXT BOOKS
1. R. G. Dromey, “How to Solve it by Computer” (Chaps 1-2), Prentice-Hall of India, 2002.

2. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, 2nd ed, Pearson Education Asia,
2002.
REFERENCE BOOKS:
1. ISRD Group, “Data Structures using C”, Tata McGraw Hill, 2007
P a g e 95
MCA1724 Web Technology 3 1 0 4
LEARNING OUTCOMES:
CLO 1: Introduce the basic concepts of Internet and web design.
CLO 2: Implement HTML, CSS and JavaScript for creating visually appealing web pages.
CLO 3: Implement server side programming and Web Hosting.
UNIT I- INTRODUCTION TO INTERNET AND WORLD WIDE WEB
Introduction to networks, LAN,MAN and WAN, History of the Internet, Email concepts, Sending and
Receiving files by E-mail, Intranet, Web system Architecture, Exploring HTTP, URL, Domain Name
System, Web Browsers, Web Pages
UNIT II- HYPERTEXT MARKUP LANGUAGE AND WEB DESIGN

Basics of HTML, HTML Document display, Formatting Text, Link, Lists, Images, Tables, Forms,
Frames, Website Design consideration, Case study: Designing Layout of a web page for any Domain
UNIT III- USAGE OF CASCADING STYLE SHEET

Syntax of CSS, Style sheets types, Properties and Text attributes Padding, List properties, List Properties,
Positioning, Margins, Colors, Properties and Table attributes
UNIT IV- FUNDAMENTALS OF JAVA SCRIPT

DHTML, HTML and JavaScript, JavaScript Elements, Variables, Operators, Flow Control Statements,
Arrays, Functions, Event Handling, Browsers and JavaScript, Web Pages and JavaScript, Frames and
JavaScript, Validation of User Form
UNIT V- SERVER-SIDE PROGRAMMING

Client-Side Scripting and Server-Side Scripting, Servlets – Definition, Advantages, Life Cycle of a
Servlets, Creating a Servlet and Configuring, Java Sever Page – Life Cycle and Structure of JSP, Active
Server Pages – Creating an ASP, IIS installation for ASP, Built-in Objects, Exploring Forms, Comparison
of ASP over JSP.
TEXT BOOKS:
1. Deven N. Shah (2012), A Complete Guide to Internet and Web Programming, DreamTech Press,
New Delhi (For 1 to 5 units).
REFERENCE BOOKS:
1. Raj Kamal (2002), Internet and Web Technologies, Tata McGraw Hill, New Delhi.
2. Margaret Levine Young (2002), Internet: The Complete Reference, Tata McGraw Hill, Second
Edition, New Delhi.
P a g e 96
MCA1725 Formal language and Automata Theory 3 1 0 4
LEARNING OUTCOMES:
CLO 1: Define theoretical concepts of Automata.
CLO 2: Express various regular expressions and regular grammars
CLO 3: Illustrate context free grammars and normal forms
CLO 4: Develop models by using the concept of Turing machine
CLO 5: Analyze various P, NP, NP Complete and NP Hard Problems.
UNIT I - AUTOMATA
Strings, Alphabet, Language, Operations, Finite State Machine, definitions, finite automation model,
acceptance of strings and languages, on deterministic finite automation, deterministic finite automation,
equivalence between NFA and DFA, Conversion of NFA into DFA, minimization of FSM ,equivalence
between two FSM's, Moore and Malay machines.
UNIT II - REGULAR EXPRESSIONS

Regular sets, regular expressions, identity rules, manipulation of regular expressions, equivalence
between RE and FA, inter conversion, Pumping lemma, Closure properties of regular sets(proofs not
required),regular grammars, right linear and left linear grammars equivalence between regular linear
grammar and FA, inter conversion between RE and RG.
UNIT III - CONTEXT FREE GRAMMARS

Context free Grammars, Derivation trees, Left Most Derivations, Right Most Derivations, Ambiguity in
Context-Free Grammars, Specifications of Context Free Grammars, Normal Forms, Chomsky Normal
Form (CNF), Greibach Normal Form (GNF)
UNIT IV - TURING MACHINE
Turing machine, definition, model, design of TM, Computable Functions, recursive enumerable language,
Church’s Hypothesis, Counter machine, types of TM's(Proofs not required).
UNIT V - CLASSES OF PROBLEMS

Chomsky hierarchy of languages, linear bounded automats and context sensitive language, Introduction to
DCFL and DPDA,LR(O) Grammar, decidability of problems, Universal Turing Machine, undecidability
of post’s correspondence problem. Turing reducibility, definition of P and NP problems, NP complete and
NP hard problems
TEXT BOOKS:
1. Hopcroft, John E.; Motwani, Rajeev; Ullman, Jeffrey D. (2013). Introduction to Automata Theory,
Languages, and Computation (3rd ed.). Pearson. ISBN 1292039051
2. Peter Linz, “An Introduction to Formal Language and Automata”, Third Edition, Narosa Publishers,
New Delhi, 2002
REFERENCE BOOKS:
1. John C Martin, “Introduction to Languages and the Theory of Computation”, Third Edition, Tata
McGraw Hill Publishing Company, New Delhi, 2007
2. Kamala Krithivasan and Rama. R, “Introduction to Formal Languages, Automata Theory and
Computation”, Pearson Education 2009
P a g e 97
SEMESTER III
MCA1731 Computer Organization and Architecture 3 1 0 4
LEARNING OUTCOMES:
CLO 1: Define the working principle of computer components
CLO 2: Illustrate data representation and digital logic fundamentals
CLO 3: Express chronology of various advanced microprocessors
CLO 4: Classify various memory organization and management
CLO 5: Demonstrate the working principles of Microprocessors and Microcontrollers.
UNIT I – INTRODUCTION
Computer Operation-Introduction , Computer Organization, Von Neumann architecture, Device
controller-Device Interface signals, I/O Drivers, CPU operation-CPU states, CPU Registers, Clock, CPU
memory communication, Instruction format and Instruction cycle, Macro operation & micro
operation, RTL (Register Transfer Language), Instruction set design, Bus Concept, Instruction execution
UNIT II-DATA REPRESENTATION AND DIGITAL LOGIC

Fixed point Numbers -Representation types, Sign Extension,1’s complement, 2’s complement, Floating
point Numbers-IEEE Representation (Only Single precision), Normalization, Excess code, Gates-AND,
OR, NOT, X-OR, X-NOR, NAND, NOR, Flip-flops-R-S, JK, D,T, Half adder and Full adder, Encoder
and Decoder, Multiplexer and Demultiplexer.
UNIT III-MEMORY ORGANIZATION AND MANAGEMENT

Classification of memory -By functionality(main, auxiliary, cache, associative, virtual), By
access(random access, sequential access, semi random), By capability(RAM, ROM), Memory hierarchy,
Memory parameters, Main memory Limitation, Instruction prefetch, Write Buffer, Cache memory-Cache
principle, Cache hit and cache miss, Mapping( direct, associative, se associative), Cache replacement,
Cache write, Cache coherence
UNIT IV-MICROPROCESSORS
Introduction to microprocessors-Microcontroller, RISC & CISC Microprocessors, Scalar & super scalar
processors, Vector & array processors, Intel 8086-Pin description,Operating modes-Maximum mode pin
description, Minimum mode pin description, 8086 Register organization, BIU & EU,Addressing modes
of 8086, Interrupts
UNIT V-INTRODUCTION TO ADVANCED MICROPROCESSORS

Chronology of Intel processors-Pentium, Pentium Pro, Pentium II, Pentium III, Pentium IV, Itanium,
Latest Intel processors-Atom, I3,I5, I7, AMD processors, MIPS processors, SUN’s Sparc processor,
Mobile/Tablet processors
TEXT BOOKS:
1. Tripti Dodiya & Zakiya Malek "Computer Organization and Advanced Microprocessors", Cengage
REFERENCE BOOKS:
1. B Govindrajalu, "Computer Architecture and Organization", Tata McGraw-Hill.
2. Badri Ram, “Advanced Microprocessors and Interfacing”, Tata McGraw-Hill.
P a g e 98
MCA1732 Data Communication and Networks 3 1 0 4
LEARNING OUTCOMES:
CLO 1: Define various network models and its protocols.
CLO 2: Identify various design issues and challenges in different network layers.
CLO 3: Incorporate security protocols within network system.
UNIT I - INTRODUCTION TO COMPUTER NETWORK

Network-Protocol & standard –Standard Organizations-Topology - Base Band & Broad Band Topology –
Transmission mode- Addressing-Categories of Network-OSI Model- Layers of OSI model –TCP/IP
protocol Suite-Difference between TCP/IP and OSI model.
UNIT II - PHYSCIAL LAYERS AND MEDIA

Analog and Digital Signals-Periodic Analog Signal-Digital signals-Transmission impairment-Data rate
limits-Digital Transmission- Analog Transmission-Multiplexing-Guided & unguided Transmission
Media-switching
UNIT III - DATA LINK LAYER

Types of Errors-Block coding-Cyclic Codes-Checksum-Flow and Error Control-Multiple access using
ALOHA-CSMA-CSMA/CD-CSMA/CA-Channelization-IEEE standard-Wireless LAN-Cellular
Telephony.
UNIT IV - NETWORK, TRANSPORT AND APPLICATION LAYER

Virtual Circuit and Datagram Subnet-Routing algorithm-Unicast routing Protocol-Multicast Routing
Protocol-Congestion-Congestion Control algorithm-DNS in the internet-Remote logging-EMAIL
architecture-www and HTTP Architecture.
UNIT V - NETWORK SECURITY

Introduction to Cryptography-Symmetric key Cryptography-Asymmetric key Cryptography-Security
services-Message Confidentiality-Digital Signature –firewalls-SSL/TLS.
TEXT BOOKS:
1. Behrouz A. Forouzan, Introduction of Data Communication and Networking, - Tata McGrawHill,
1999.
2. Andrew S Tanenbaum ,Computer Networks,Third edition, Tata McGraw Hill,2006
REFERENCE BOOKS:
1. Fred Halsall ,Data Communications, Computer Networks and Open Systems, 4th Edition , Addison
Wesley,, 2000.
2. Jean Walrand ,Communication Network (A first course), Second Edition, Tata McGraw Hill ,1998.
P a g e 99
MCA1733 Database Management System 3 0 0 3
LEARNING OUTCOMES:
CLO 1: Define various database models and normal forms.
CLO 2: Express the ideas behind data storage and querying
CLO 3: Apply relational model and SQL queries.
CLO 4: Incorporate the concepts of transaction management and recovery system
CLO 5: Construct different database system architecture
Introduction to File and Database systems- Database system structure – Data Models – Introduction to
Network and Hierarchical Models – Relational Model. E-R model – diagram, generalization,
specialization- Data base design - Informal design guidelines for relational schemas; functional
dependencies; normal forms based on primary keys, general definitions of 2nd and 3rd normal forms;
Boyce-codd normal forms, 4NF, 5NF.
UNIT II- RELATIONAL MODEL AND QUERY EVALUATION
Relational Query Languages – Relational Algebra – Tuple and domain Relational Calculus – SQL – Data
definition- Queries in SQL- Updates- Views – Integrity and Security – Relational Database design
UNIT III- DATA STORAGE AND QUERYING
Record storage and Primary file organization- Secondary Storage Devices- Operations on Files- Heap
File- Sorted Files- Hashing Techniques – Index Structure for files –Different types of Indexes- B-Tree -
B+Tree - Query processing- query optimization.
UNIT IV- TRANSACTION MANAGEMENT
Transaction – Properties – Concurrent execution – Serializability – Concurrency control – Protocols –
Recovery System – Database Security
UNIT V- DATABASE SYSTEM ARCHITECTURES

Concepts of Database System Architectures: Centralized and Client-Server Architectures – Server System
Architectures – Parallel Systems- Distributed Systems – Parallel Databases- case studies and their
analysis and design.
TEXT BOOKS
1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan- “Database System Concepts”, 6th Edition,
McGraw-Hill, 2011.
2. Ramez Elmasri and Shamkant B. Navathe, “Fundamental Database Systems”, 7 th Edition, Pearson
Education, 2017.
REFERENCE BOOKS:
1. Raghu Ramakrishnan and Johannes Gehrke, “Database Management System”, 3rd Edition, Tata
McGraw-Hill Publishing Company, 2014.
2. Hector Garcia–Molina, Jeffrey D.Ullman and Jennifer Widom, “Database System Implementation”-
Pearson Education- 2000.
3. Peter Rob and Corlos Coronel- “Database System, Design, Implementation and Management”,
Thompson Learning Course Technology- Fifth edition, 2003.
4. C. J. Date, “An Introduction to Database Systems”, 8th Edition, Addison-Wesley, 2006.
P a g e 100
MCA1734 Advanced Java Programming 3 0 0 3
LEARNING OUTCOMES:
CLO 1: Explain principles of the Java programming Language
CLO 2: Incorporate networking concepts with Java
CLO 3: Apply GUI tools and multi-threading to produce well designed, effective applications.
CLO 4: Develop applications using Java Beans and Servlets
UNIT I - INTRODUCTION TO CORE JAVA

Class and Object, Object Oriented concepts with respect to Java, Interfaces, Packages, Exception
Handling.
UNIT II- APPLET AND MULTITHREADING

Applets specific methods, creating an Applet, Displaying it using Web Browser with appletviewer.exe,
Advantages and Disadvantages of Applet, Multithreading concepts, Thread Lifecycle, creating
multithread application, thread priorities, thread synchronization.
UNIT III- AWT AND SWING

AWT: Components and Graphics, Containers, Frames and Panels, Layout Managers, AWT all
Components. SWING: Features, components, containers, Exploring Swing
UNIT IV- NETWORKING WITH JAVA

Networking fundamentals, java.net – networking classes and Interfaces, The Socket class, The URL class,
The URL Connection class, The Http URL Connection Class, Datagrams.
UNIT V- JAVA BEANS AND SERVLETS

Java Beans introduction, Beans persistence and introspection, The Java Beans API, Introduction to
Servlets, Life cycle of Servlets, The servlet API, The javax.servlet Package, The javax.servlet.http
Package, handling Http request and Response.
TEXT BOOK:
1. Herbert Schildt,Java the Complete Reference, ninth edition,oracle press.
REFERENCES BOOKS:
1. CAY S. Horstman, Core Java 2 Volume-I, Gary Cornell, ninth edition,Pearson.
2. Herbert Schildt Dale Skrien, Java Fundamentals-A Comprehensive Introduction, special Indian
edition, Tata McGraw Hill Education Private Limited.
P a g e 101
MCA1737 Open Source Technologies 0 1 4 3
LEARNING OUTCOMES:
CLO1: To understand and analyze the concepts of Open Source Technologies and its licenses.
CLO2: To install Linux operating system.
CLO3: To manage users and files in Linux operating system.
CLO4: To install and manage Apache web server.
CLO5: To develop simple PHP web pages and host it in Apache web server.
CLO6: To develop programs and dynamic web pages using MySQL and PHP /Perl.
UNIT I - LINUX OPERATING SYSTEM

Linux Operating System: Open source software and GNU – GNU public license – Difference between
Windows and Linux, Installing Linux: Hardware and environmental considerations – Server design Dual
booting issues – Methods of Installation, Managing Users : User management tools – User and access
permissions,
UNIT II - LINUX COMMAND LINE

Linux Command Line: The command line: Introduction to BASH – Command line shortcuts –
Documentation tools – Files Types – File permissions – File management and manipulation – Editors.
UNIT III - APACHE WEB SERVER

Basic Concepts – Installing Apache – Configuring Apache – Starting and Stopping Apache – Hosting
Multiple sites – Proxy servers and caching – Logs and monitoring – Security – Dynamic Content – URL
rewriting – Module construction.
UNIT IV - MySQL
Introducing MySQL – Prerequisites for MySQL – MySQL versions – MySQL Linux Installation –
MySQL Server administration and security – MySQL database functions – Command line interface
basics – MySQL CLI environment variables – Using CLI in interactive and non-interactive mode –
Creating CLI environment – Utility and administrative statements – commands – Data Definition
Language – Data Markup Language.
UNIT V - PERL AND PHP

Perl: Installing the Perl DBI and MySQL DBD – Introducing the DBI – Functions with DBI – Building
basic applications – Building web applications with DBI. PHP: PHP Installation – PHP essentials – PHP
MySQL Configuration – PHP MySQL functions – Building MySQL enabled applications with PHP.
REFERENCE BOOKS:
1. Paul Kavanagh, “Open Source Software”, Elsevier Digital Press,New Delhi , 2004.
2. Steve Shah, Wale Soyinka, “Linux Administration – A beginners Guide”, TataMcGraw-Hill, Fourth
Edition, New Delhi , 2005.
3. Scott Hawkins, “Apache Webserver Administartion and e-commerce Handbook”, Pearson Education
Asia, New Delhi , 2001
4. Linda McKinnon, Al McKinnon, “Installing and Administrating Linux”, Wiley Dream Tech India Pvt.
Ltd., 2nd Edition, New Delhi, 2002.
5. Timothy Boronczyk et al., “Beginning PHP6”, Apache, Mysql Web Development, Wiley Dream Tech
India Pvt. Ltd, New Delhi, 2009.
P a g e 102
6. Jason Gerner et al., “Professional LAMP: Linux, Apache, MySQL and PHP5 Web Development”,
Wiley Dream Tech India Pvt. Ltd,New Delhi, 2005.
7. James Lee, Brent Ware , “Open Source Web Development with LAMP”, Addison-Wesley Professional,
New York, 2013.
P a g e 103
SEMESTER IV
MCA1741 Design and Analysis of Algorithm 3 1 0 4
LEARNING OUTCOMES:
CLO 1: Define Time and Space complexity of Algorithms.
CLO 2: Demonstrate Brute force methods, Divide & Conquer methods, Greedy algorithm and Dynamic
Programming.
CLO 3: Apply various Graph techniques to derive optimal solution.
CLO 4: Analyze P, NP, NP Complete and NP Hard problems.
UNIT I - INTRODUCTION
Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important Problem Types –
Fundamentals of the Analysis of Algorithm Efficiency – Analysis Framework – Asymptotic Notations
and its properties – Mathematical analysis for Recursive and Non-recursive algorithms.
UNIT II- BRUTE FORCE AND DIVIDE-AND-CONQUER

Brute Force - Closest-Pair and Convex-Hull Problems-Exhaustive Search - Traveling Salesman Problem -
Knapsack Problem - Assignment problem. Divide and conquer methodology – Merge sort – Quick sort –
Binary search – Multiplication of Large Integers – Strassen’s Matrix Multiplication-Closest-Pair and
Convex-Hull Problems.
UNIT III - DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE

Computing a Binomial Coefficient – Warshall’s and Floyd’ algorithm – Optimal Binary Search Trees –
Knapsack Problem and Memory functions. Greedy Technique– Prim’s algorithm- Kruskal's Algorithm-
Dijkstra's Algorithm-Huffman Trees.
UNIT IV- ITERATIVE IMPROVEMENT

The Simplex Method-The Maximum-Flow Problem – Maximum Matching in Bipartite Graphs- The
Stable marriage Problem.
UNIT V- COPING WITH THE LIMITATIONS OF ALGORITHM POWER

Limitations of Algorithm Power-Lower-Bound Arguments-Decision Trees-P, NP and NP-Complete
Problems--Coping with the Limitations - Backtracking – n-Queens problem – Hamiltonian Circuit
Problem – Subset Sum Problem-Branch and Bound – Assignment problem – Knapsack Problem –
Traveling Salesman Problem- Approximation Algorithms for NP – Hard Problems – Traveling Salesman
problem – Knapsack problem.
TEXT BOOKS
1. Ellis Horowitz, Sartajsahni, Sanguthevar, Rajesekaran, “Fundamentals of Computer Algorithms”,
Galgotia Publication Pvt. Ltd., Reprint, 2010.
2. Thomas H Cormen, Charles E Leiserson, Ronald L Revest, Clifford Stein, “Introduction to
Algorithms” 3rd Edition, The MIT Press Cambridge, Massachusetts London, England, 2014
3. S.Sridhar, “Design and Analysis of Algorithms”, Oxford University Press, 2015
4. Richard Johnson Baugh, Marcus Schaefer, “Algorithms”, Pearson education, 200
P a g e 104
REFERENCE BOOKS
1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, Pearson Education,
Inc., 2006
2. Rajesh K Shukla, “Analysis and Design of Algorithms-A Beginner’s Approach”, Wiley
publisher,2015
P a g e 105
MCA1742 Distributed Systems 3 1 0 4
LEARNING OUTCOMES:
CLO 1: Define the design principles in distributed systems, their trend and challenges.
CLO 2: Express System models and Inter-process Communications in distributed systems.
CLO 3: Express Peer-to-peer services and distributed file systems.
CLO 4: Apply clock synchronization and replication in distributed systems.
CLO 5: Analyze various Process and Resource management techniques.
Examples of Distributed Systems–Trends in Distributed Systems – Focus on resource sharing –
Challenges. Case study: World Wide Web.
UNIT II- COMMUNICATION IN DISTRIBUTED SYSTEM

System Model – Inter process Communication - the API for internet protocols – External data
representation and Multicast communication. Network virtualization: Overlay networks. Case study: MPI
Remote Method Invocation And Objects: Remote Invocation – Introduction - Request-reply protocols -
Remote procedure call - Remote method invocation. Case study: Java RMI - Group communication -
Publish-subscribe systems - Message queues - Shared memory approaches - Distributed objects - Case
study: Enterprise Java Beans -from objects to components.
UNIT III- PEER TO PEER SERVICES AND FILE SYSTEM

Peer-to-peer Systems – Introduction - Napster and its legacy - Peer-to-peer – Middleware - Routing
overlays. Overlay case studies: Pastry, Tapestry- Distributed File Systems –Introduction - File service
architecture – Andrew File system. File System: Features-File model -File accessing models - File sharing
semantics Naming: Identifiers, Addresses, Name Resolution – Name Space Implementation – Name
Caches – LDAP.
UNIT IV- SYNCHRONIZATION AND REPLICATION

Introduction - Clocks, events and process states - Synchronizing physical clocks- Logical time and logical
clocks - Global states – Coordination and Agreement – Introduction - Distributed mutual exclusion –
Elections – Transactions and Concurrency Control– Transactions -Nested transactions – Locks –
Optimistic concurrency control - Timestamp ordering – Atomic Commit protocols -Distributed deadlocks
– Replication – Case study – Coda.
UNIT V- PROCESS & RESOURCE MANAGEMENT

Process Management: Process Migration: Features, Mechanism - Threads: Models, Issues,
Implementation. Resource Management: Introduction- Features of Scheduling Algorithms –Task
Assignment Approach – Load Balancing Approach – Load Sharing Approach.
TEXT BOOKS:
1. George Coulouris, Jean Dollimore and Tim Kindberg, “Distributed Systems: Concepts and Design”,
Fourth Edition, 2006, Pearson Education, Inc. New Delhi.
2. Andrew S. Tanenbaum, Maarten van Steen, “Distributed Systems: Principles and Paradigms”, 2nd
Edition, 2007, PHI Learning Pvt. Ltd., New Delhi.
P a g e 106
REFERENCE BOOKS:
1. Hagit Attiya, Jennifer Welch, “Distributed Computing: Fundamentals, Simulations, and Advanced
Topics”, 2nd Edition, 2005, Wiley India Pvt. Ltd., New Delhi.
2. Mordechai Ben-Ari, “Principles of Concurrent and Distributed Programming”, 2nd Edition, 2006,
Pearson Education, Inc. New Delhi.
P a g e 107
MCA1743 Graphics and Multimedia 3 0 0 3
LEARNING OUTCOMES:
CLO 1: Define various 2D & 3D Transformation techniques.
CLO 2: Demonstrate various Multimedia tools and techniques.
CLO 3: Apply multimedia communication standards.
CLO 4: Develop simple multimedia application.
UNIT I- BASIC CONCEPTS

2D Transformations – Clipping – Window – View Prot Mapping – Graphical User Interfaces and
Interactive Input Methods – Picture Construction Techniques – Virtual Reality Environment.
UNIT II- 3D GRAPHICS

3D Transformation – 3D Viewing – Visible Surface Detection – Back Face Detection – Depth Buffer
Method – Scan Line Method.
UNIT III- MULTIMEDIA BASICS

Introduction to Multimedia – Components – Hypermedia – Authoring – Authoring tools – File formats –
Color models – Digital Audio representation – Transmission – Audio signal processing – Digital music
making – MIDI – Digital video – Video compression techniques – Video performance measurements –
Multimedia Databases – Animation – Key frames and tweening techniques – Principles of animation –
Virtual reality – Multimedia for portable devices
UNIT IV- MULTIMEDIA COMMUNICATION

Stream characteristics for Continuous media – Temporal Relationship – Object Stream Interactions -
Media Synchronization – Models for Temporal Specifications – Streaming of Audio and Video –
Recovering from packet loss – RTSP –– Multimedia Communication Standards –RTP/RTCP – SIP and
H.263- Real time streaming and On-demand streaming
UNIT V- MULTIMEDIA APPLICATION DEVELOPMENT

Design- Development and evaluation of multimedia a system - The development of user interface design -
Design Process - Multimedia & the Internet - Multimedia conferencing - Multimedia file sharing –
Multimedia broadcasting - Multimedia Development Issues - Multimedia project - Structured Multimedia
development - Multimedia project timing - Sample project.
TEXT BOOKS:
1. Donald Hearn and M. Pauline Baker- “Computer Graphics in C Version”- Second Edition- Pearson
Education
2. Tom McReynolds – David Blythe “Advanced Graphics Programming Using OpenGL” - Elsevier-
2010
REFERENCE BOOKS:
1. Parag Havaldar and Gerard Medioni- “Multimedia Systems-Algorithms- Standards and Industry
Practices”-Course Technology- Cengage Learning- 2010.
2. John F. Koegel Bufend - “Multimedia systems”- Pearson Education- Delhi- 2002
P a g e 108
MCA1744 Software Engineering 3 1 0 4
LEARNING OUTCOMES:
CLO 1: Define various software development models.
CLO 2: Express requirement analysis and design process for software development.
CLO 3: Implement UML diagram for software development models.
CLO 4: Analyze various Object Oriented applications.
CLO 5: Design business logic for various applications.
UNIT I - INTRODUCTION TO SOFTWARE ENGINEERING

Characteristics of software -The Changing Nature of software – Legacy Software and Software myths – A
Generic view of process – Software Engineering: A layered Technology and A process framework- A
process framework - Capability Maturity Model Integration, Personal and Team Process Models- Process
Models – Prescriptive models- Different approaches and models for System Development- Waterfall-
Prototyping - Spiral (including WIN-WIN Spiral) – RAD- The Incremental Process Models and
Evolutionary Process Models -Specialized Process Models and The Unified Process- An agile view of
Process.
UNIT II - REQUIREMENTS ANALYSIS AND DESIGN

System Engineering - Requirements Engineering – Requirements Engineering Tasks- Activities in
Requirements Determination- Requirements Anticipation- Requirements Investigation Fact finding
methods-Requirements Specifications Software requirement Specification (SRS) Structure and contents
of the requirements Specification analysis modeling, types of requirements - functional and non-
functional, Quality criteria, requirements definition, SRS format, Fundamental problems in defining
requirements
UNIT III - UML DIAGRAMS

UML Architecture – UML Diagrams: UseCase Diagram, Class Diagram, Sequence Diagram,
Collaboration Diagram, Activity Diagram, State chart diagram, Object Diagram and relationships,
Component Diagram and Deployment Diagram, Packages and UML extensibility mechanisms with
suitable examples and Case studies
UNIT IV - OO ANALYSIS
Business Process Analysis- OOA steps- Identify Actors, Business Process Model - Identify UseCase,
Usecase Documentation- Identify classes using Classification theorems: Noun phrase approach, Class
pattern approach, Usecase driven sequence diagram approach, and CRC approach – Case study on
Identifying object Relationships Attributes, Methods: Case study approach.
UNIT V - OO DESIGN
OOD steps – Axioms and Corollaries - Design Business layer classes –– Design Access layer classes –
Compare Relational, Distributed and Object Oriented Database – Various Table Class Mapping – Design
View layer classes
REFERENCE BOOKS:
1. Roger, S. Pressman (2004), Software Engineering: A Practitioner Approach, McGraw Hill
International Edition, Sixth Edition, New Delhi
2. Waman, S Jawadekar (2004), Software Engineering: Principles and Practice, McGraw Hill Education
Pvt. Limited, New Delhi.
P a g e 109
3. Srimathi.H, Srirarm. H &Krishanmoorthy .A (2006), “Object Oriented Analysis and Design using
UML”, Scitech Publications , 2nd edition, India
P a g e 110
MCA1745 Python Programming 3 0 0 3
LEARNING OUTCOMES:

CLO 1: Demonstrate basics of Python programming
CLO 2: Express conditional logic, file handling and string manipulation functions.
CLO 3: Incorporate List operation in Python programming.
CLO 4: Apply OOPs principle and Data Modelling in Python
CLO 5: Develop Graphical user interface using Python.
UNIT I- INTRODUCTION TO PYTHON AND PROGRAMMING

Conceptual introduction: topics in computer science, algorithms; modern computer systems: hardware
architecture, data representation in computers, software and operating system; installing Python; basic
syntax, interactive shell, editing, saving, and running a script. The concept of data types; variables,
assignments; immutable variables; numerical types; arithmetic operators and expressions; comments in
the program; understanding error messages;
UNIT II- CONDITIONAL LOGIC, FILE HANDLING AND STRING

Conditions, boolean logic, logical operators; ranges; Control statements: if-else, loops (for, while); short-
circuit (lazy) evaluation Strings and text files; manipulating files and directories, os and sys modules; text
files: reading/writing text and numbers from/to a file; creating and reading a formatted file (csv or tab-
separated).
String manipulations: subscript operator, indexing, slicing a string; strings and number system: converting
strings to numbers and vice versa. Binary, octal, hexadecimal numbers
UNIT III- LIST OPERATION

Lists, tuples, and dictionaries; basic list operators, replacing, inserting, removing an element; searching
and sorting lists; dictionary literals, adding and removing keys, accessing and replacing values; traversing
dictionaries. Design with functions: hiding redundancy, complexity; arguments and return values; formal
vs actual arguments, named arguments. Program structure and design. Recursive functions.
UNIT IV- CLASSES AND OBJECT

Classes and OOP: classes, objects, attributes and methods; defining classes; design with classes, data
modeling; persistent storage of objects, inheritance, polymorphism, operator overloading (_eq_,_str_,
etc); abstract classes; exception handling, try block
UNIT V- GRAPHICAL USER INTERFACE

Graphical user interfaces; event-driven programming paradigm; tkinter module, creating simple GUI;
buttons, labels, entry fields, dialogs; widget attributes - sizes, fonts, colors layouts, nested frames
TEXT BOOK:
1. Kenneth Lambert , Fundamentals of Python: First Programs, Course Technology, Cengage
Learning, 2012 ISBN-13: 978-1-111-82270-5
P a g e 111
REFERENCE BOOKS:
1. Allen downy, Thinking python : How to think like a computer scientist, Green Tea Press
2. Mark Lutz, “Programming Python “, O Relly Publisher.
P a g e 112
SEMESTER V

MCA1751 Big Data Analytics 3 0 0 3
LEARNING OUTCOMES:
CLO 1: Define Big data and its importance
CLO 2: Express various data analysis method
CLO 3: Incorporate Hadoop and NoSQL for Big data analytics
CLO 4: Demonstrate various framework and visualization tools
UNIT I- INTRODUCTION TO BIG DATA

Introduction to Big Data Platform – Challenges of Conventional Systems - Intelligent data analysis –
Nature of Data - Analytic Processes and Tools - Analysis vs Reporting - Modern Data Analytic Tools -
Statistical Concepts: Sampling Distributions - Statistical Inference - Prediction Error.
UNIT II- DATA ANALYSIS

Classification, Clustering, and Mining, Information Extraction, Regression and Feature Selection,
Reasoning: Logic and its Limits, Dealing with Uncertainty, Bayesian Inference, Forecasting, Neural
Models, Introduction to Deep Learning.
UNIT III- HADOOP

History of Hadoop- The Hadoop Distributed File System – Components of Hadoop-Analyzing the Data
with Hadoop- Scaling Out- Hadoop Streaming- Design of HDFS-Java interfaces to HDFS Basics-
Developing a Map Reduce Application-How Map Reduce Works-Anatomy of a Map Reduce Job Run-
Failures-Job Scheduling-Shuffle and Sort – Task execution - Map Reduce Types and Formats- Map
Reduce Features
UNIT IV- NoSQL DATABASES

Evolution of Document Databases – Design and use of NoSQL Databases – Storage and Retrieval of
Unstructured Data – NoSQL Applications and query options. Types of NoSQL Databases, Graph
Databases – Neo4j; Case Studies - Real Time Sentiment Analysis, Stock Market Predictions.
UNIT V- FRAMEWORKS AND VISUALIZATION

Applications on Big Data Using Pig and Hive – Data processing operators in Pig – Hive services –
HiveQL – Querying Data in Hive - fundamentals of HBase and ZooKeeper - Visualizations - Visual data
analysis techniques, interaction techniques; Systems and applications.
TEXT BOOKS:
2. Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, Cambridge University
Press, 2012.
3. Tom White, “Hadoop: The Definitive Guide”, Third Edition, O‘reilly Media, 2012.
REFERENCE BOOKS:
1. Chris Eaton, Dirk DeRoos, Tom Deutsch, George Lapis, Paul Zikopoulos, “Understanding Big
Data: Analytics for Enterprise Class Hadoop and Streaming Data”, McGrawHill Publishing, 2012.
2. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with
Advanced Analytics”, John Wiley & sons, 2012.
P a g e 113
4. PeteWarden, “Big Data Glossary”, O‘Reilly, 2011.
P a g e 114
MCA1752 Android Application Development 3 0 0 3
LEARNING OUTCOMES:
CLO 1: Express the android overview
CLO 2: Apply the various layout for application development
CLO 3: Demonstrate the file handling and messaging mechanism
CLO 4: Implement a location based services
UNIT-I MOBILE APPLICATION DEVELOPMENT AND TRENDS

Android overview and Versions – Android open stack, features – Setting up Android environment
(Eclipse, SDK, AVD)- Simple Android application development – Anatomy of Android applications –
Activity and Life cycle – Intents, services and Content Providers
UNIT-II LAYOUTS
Linear, Absolute, Table, Relative, Frame, Scroll view, Resize and reposition - Screen orientation –
Views: Text view, Edit Text, Button, Image Button, Checkbox, Toggle Button, Radio Button, Radio
Group, Progress Bar, Autocomplete Text, Picker, List views and Web view– Displaying pictures with
views: Gallery and Image View, Image Switcher, Grid view – Displaying Menus: Helper methods,
Option and Context Shared User preferences
UNIT-III FILE HANDLING

File system, System partition, SD card partition, user partition, security, Internal and External Storage –
Managing data using SQLite – Content providers: Data sharing with query string, projections, filters and
sort and User defined content providers
UNIT-IV SMS MESSAGING

Sending and Receiving – Sending eMail and networking – Downloading binary and text data files –
Access Web services – Local and remote services, Asynchronous threading, communication and binding
services
UNIT-V LOCATION BASED SERVICES

Display map, zoom control, view and change, Marking, Geocoding, Get location - Publish Android
applications and Deployment
TEXT BOOKS
1. WeiMengLee, “Beginning Android Application Development”, Wrox Publications (John Wiley,
New York, 2012.
2. Ed Burnette,“Hello Android: Introducing Google's Mobile Development Platform”, The Pragmatic
Publishers, 3rd edition, North Carolina USA, 2010.
REFERENCE BOOKS:
1. RetoMeier , “Professional Android 4 Application Development”, Wrox Publications (John Wiley,
New York), 2012.
2. ZigurdMednieks, Laird Dornin, G,.BlakeMeike, Masumi Nakamura , “Programming Android:
Java Programming for the New Generation of Mobile Devices”, OReilly Media, USA, 2011.
P a g e 115
MCA1753 Advanced Software Engineering 3 1 0 4
LEARNING OUTCOMES:
CLO 1: Define the various object oriented methodologies
CLO 2: Develop GUI using various components.
CLO 3: Implement various testing strategies
CLO 4: Apply various Project management, estimation and scheduling techniques
CLO 5: Analyze Quality assurance and Risk Management while designing and developing software
projects.
UNIT 1 - OO BASICS & METHODOLOGIES

Object Oriented Approach and its Benefits – Object Oriented Concepts – Object Oriented Life Cycle and
Quality Attributes – Object Oriented Methodologies such as Rumbaugh OMT, Booch OOD and Jacobson
OOSE with a Case study - The Unified Approach: Layered Architecture – Component Based
Development – Patterns and Frameworks
UNIT II - SYSTEMS DESIGN

Design of input & Control, Objectives of Input Design, Data Capture Guidelines Design of Source
Document, Input Validations- Design of output, Objectives of Output Design Types Of Output- User
Interface design: Elements of good design, design issues, features of modern GUI, Menus, Scroll bars,
windows, buttons, icons, panels, error messages etc.- Design of program Specification- Code Design Case
studies should be covered on the Topic
UNIT III - TESTING STRATEGIES AND TACTICS

Introduction to Testing - Definition of Testing Terminologies-Testing Strategies for Conventional
Software-Validation Testing - System Testing - Debugging Process-Testing Tactics – White Box Testing
- Black Box Testing - Object Oriented Testing Methods-Testing for Specialized Environments.
UNIT IV - PROJECT MANAGEMENT, ESTIMATION AND SCHEDULING

Project Management Spectrum - The People and the Product- The Process and the Project -Metrics for
Process and Projects-Estimation - The Project Planning Process – Resources - Decomposition Techniques
- Empirical Estimation Models - Project Scheduling Concepts – Timeline charts and Tracking the
Scheduling - Earned Value Analysis.
UNIT V - QUALITY, CHANGE AND RISK MANAGEMENT

Reactive and Proactive Risk Strategies – Software Risks –Risk Identification and Risk Projection – Risk
refinement and Risk Mitigation, Monitoring and Management -Quality Concepts -Software Quality
Assurance -Software Reviews and Formal Technical Reviews -Statistical Quality Assurance and Software
Reliability -The Software Configuration Management and the SCM Repository -The Software
Configuration Management Process -Business Process Reengineering and Reverse Engineering -
Restructuring and Forward Engineering -The Road Ahead -New Modes of Representing Information.
REFERENCE BOOKS:
1. Ali Bahrami (2008), “Object Oriented Systems Development”, Tata McGraw-Hill Edition, New Delhi
2. RohitKhurana (2011), Software Engineering-Principles and Practices, Vikas Publishing House Pvt.
Ltd., Second Edition, New Delhi.
P a g e 116
3. Chairperson, Counting Practices Committee, Valerie Marthaler, EDS, Troy, Michigan, Function Point
Counting Practices Manual Release 4.1.1, The International Function Point User Group, April 2000.
4. Carlo Ghezzi, Mehdi Jazayari, Dino Mandrioli (1991), Fundamentals of Software Engineering,
Prentice Hall of India, New Delhi.
P a g e 117
MCA1754 C# .NET 0 2 0 2
LEARNING OUTCOMES
CLO 1: Define fundamentals of C#
CLO 2: Express the knowledge acquired about C# language constructs syntax and semantics.
CLO 3: Apply classes and objects concepts in C#.
CLO 4: Incorporate concepts of Object Oriented Programming using C#.
CLO 5: Apply concepts of I/O interfaces using C#.
UNIT I -C# LANGUAGE FUNDAMENTALS

An Overview of C# - Data Types – Literals – Variables - The Scope and Lifetime of variables - Type
Conversion and Casting - Type Conversion in expressions – Operators. Program Control Statements - if
and switch Statements - for, while, do-while and for each loop - Using break - continue and go to
Statements.
UNIT II - OBJECT-ORIENTED CONCEPTS IN C# 1

Class Fundamentals - Creating objects - Reference variables and assignment and methods Constructors -
the new operator – Destructors - the this keyword – Arrays - One dimensional array - Multidimensional
arrays - Jagged arrays - Assigning array references - Using the length property - Implicitly typed arrays –
for each loop – Strings.
UNIT III - OBJECT-ORIENTED CONCEPTS IN C# 2

Controlling access to class members - Passing references to methods - Use ref and out parameters - Use a
variable number of arguments - Return objects - Method Overloading - Overload Constructors - Object
initializes The Main() method – Recursion - understanding static - Static classes -Operator Overloading -
Indexers and Properties.
UNIT IV - OBJECT-ORIENTED CONCEPTS IN C# 3

Inheritance Basis - Member access and inheritance - Constructors and inheritance - inheritance and name
hiding - Creating a multilevel hierarchy - Base class references and derived objects - Virtual methods and
Overriding - Using Abstract classes - Using sealed to prevent Inheritance. The Object class – Interfaces -
Using Interface references - Interface properties - Interface indexers - Interface can be inherited - Name
hiding with interface inheritance
UNIT V- I/O INTERFACES

The .NET Standard Interfaces - Structures and Enumerations - Exception Handling - Using I/O - The
Stream Classes - Console I/O - FileStream and Byte-Oriented File I/O - Character-Based File I/O -
Redirecting the Standard Streams - Reading and Writing Binary data - Random Access Files - Delegates.
REFERENCE BOOKS:
3. Herbert Schildt ,(2009)– C# 3.0 : The Complete Reference - McGraw-Hill
5. Net 3.5 Programming (2008): Covering .Net Framework, Vb 2008, C#, And Asp.Net 3.5, Black Book
(With CD) 1st Edition
P a g e 118
MCA1755 Trends in Computing 3 0 0 3
LEARNING OUTCOMES
CLO 1: Introduce the concept of Mobile computing
CLO 2: Develop the importance of cloud computing showing how business agility in an organization can
be created.
CLO 3: Apply the Green Computing and its application considering the environmental benefits.
CLO 4: Express the importance Soft Computing Frame Works and its application in building real time
intelligent systems.
CLO 5: Analyze how Grid computing helps in solving large scale scientific problems.
UNIT I – MOBILE COMPUTING

Introduction to Mobile Computing – Applications of Mobile Computing- Generations of Mobile
Communication Technologies- Multiplexing – Spread spectrum -MAC Protocols – SDMA- TDMA-
FDMA- CDMA. Introduction to Cellular Systems – GSM – Services & Architecture – Protocols –
Connection Establishment – Frequency Allocation – Routing – Mobility Management – Security –
GPRS- UMTS – Architecture – Handover – Security.
UNIT II - CLOUD COMPUTING

Cloud Computing definition, private, public and hybrid cloud. Cloud types; IaaS, PaaS, SaaS. Benefits
and challenges of cloud computing, public vs private clouds, role of virtualization in enabling the cloud;
Business Agility: Benefits and challenges to Cloud architecture. Application availability, performance,
security and disaster recovery; next generation Cloud Applications.
UNIT III - GRID COMPUTING

Evolution of Distributed computing: Scalable computing over the Internet – Technologies for network
based systems – clusters of cooperative computers - Grid computing Infrastructures – cloud computing -
service oriented architecture – Introduction to Grid Architecture and standards Elements of Grid –
Overview of Grid Architecture. Introduction to Open Grid Services Architecture (OGSA) – Motivation –
Functionality Requirements – Practical & Detailed view of OGSA/OGSI – Data intensive grid service
models – OGSA services.
UNIT IV - GREEN COMPUTING

Green IT Fundamentals: Business, IT and the Environment, Green computing: carbon foot print, scoop on
power, Green IT Strategies: Drivers, Dimensions and Goals, Environmentally Responsible Business:
Policies, Practices, and Metrics. Green Assets: Buildings, Data Centers, Networks, and Devices, Green
Business Process Management: Modeling, Optimization, and Collaboration, Green Enterprise
Architecture, Environmental Intelligence, Green Supply Chains, Green Information Systems: Design and
Development Models.
UNIT V - SOFT COMPUTING

Artificial Neural Network: Introduction, Characteristics- Learning Methods – Taxonomy – Evolution Of
Neural Networks- Basic Models – Important Technologies – Applications. Fuzzy Logic: Introduction –
Crisp Sets- Fuzzy Sets – Crisp Relations and Fuzzy Relations: Cartesian Product Of Relation – Classical
Relation, Fuzzy Relations, Tolerance And Equivalence Relations, Non-Iterative Fuzzy Sets. Genetic
Algorithm- Introduction – Biological Background – Traditional Optimization and Search Techniques –
Genetic Basic Concepts.
P a g e 119
REFERENCE BOOKS:
1. Jochen Schiller, ―Mobile Communications‖, PHI, Second Edition, 2003.
2. Rittinghouse, John W., and James F. Ransome, ―Cloud Computing: Implementation,
Management and Security, CRC Press, 2017.
3. Kai Hwang, Geoffery C. Fox and Jack J. Dongarra, “Distributed and Cloud Computing: Clusters,
Grids, Clouds and the Future of Internet”, First Edition, Morgan Kaufman Publisher, an Imprint of
Elsevier, 2012.
4. John Lamb, ―The Greening of IT‖, Pearson Education, 2009.
5. S.N.Sivanandam and S.N.Deepa, “Principles of Soft Computing”, Wiley India Pvt Ltd, 2011.
P a g e 120
MCA1756 Machine Learning 0 1 4 3
LEARNING OUTCOMES:
CLO 1: Develop basic idea of machine learning and differentiate between supervised and unsupervised
learning.
CLO 2: Demonstrate linear regression and logistic regression problems, its hypothesis and its solution.
CLO 3: Demonstrate non-linear logistic regression problems using neural networks, its hypothesis and its
optimization.
CLO 4: Develop idea about various Unsupervised Learning algorithms, large scale machine learning and
apply it to solve complex problems.
CLO 5: Analyze Photo OCR and its concepts.
Introduction to Machine Learning; What is Machine Learning; Supervised Learning; Unsupervised
Learning. Matrices and Vectors; Addition and Scalar Multiplication; Matrix Multiplication Properties;
Inverse and Transpose
UNIT II- REGRESSION

Linear: Model Representation; Cost Function; Gradient Descent; Gradient Descent for Linear Regression;
Gradient Descent for Multiple Variables; Gradient Descent-Feature Scaling, Learning Rate, Features and
Polynomial Regression, Normal Equation, Normal Equation Non-invertibility. Logistic: Classification,
Hypothesis Representation, Decision Boundary, Cost Function, Simplified Cost Function and Gradient
Descent, Advanced Optimization, Multiclass Classification-One-vs-all Regularization: The problem of
Overfitting, Cost Function, Regularized Linear Regression, Regularized Logistic Regression
UNIT III- NEURAL NETWORKS

Representation-Neurons and the Brain, Model Representation, Multiclass Classification; Learning- Cost
Function, Backpropagation Algorithm, Backpropagation Intuition, Gradient Checking, Random
Initialization
Applying Machine Learning: Evaluating a Hypothesis, Model Selection and Training/Validation/Test
Sets, Diagnosis Bias vs Variance, Regularization and Bias/Variance, Learning Curves. System Design:
Error Analysis, Trading off Precision and Recall, Data for Machine Learning. Support Vector Machines:
Optimization Objectives, Kernels I, Kernels II, Using an SVM
UNIT IV- UNSUPERVISED LEARNING:

K-Means Algorithm; Dimensionally Reduction; Anomaly Detection; Recommender Systems: Problem
Formulation, Content Based Recommendations, Collaborative Filtering Collaborative Filtering
Algorithm, Vectorization: Low Rank Matrix Factorization, Implementation Detail: Mean Normalization
Large Scale Machine Learning: Learning with Large Datasets, Stochastic Gradient Descent, Mini-Batch
Gradient Descent, Stochastic Gradient Descent Convergence, Online Learning, Map Reduce and Data
Parallelism
UNIT IV- APPLICATION EXAMPLE: PHOTO OCR

Problem Description and Pipeline, Sliding Windows, Getting Lots of Data Amd Artificial Data, Ceiling
Analysis.
P a g e 121
TEXT BOOK:
1. Tom Mitchel, Machine learning, Mc. Graw Hill, 1997
REFERENCE BOOKS:
1. Hastie TR Tibshirani & JH Friedman, “ The elements of Statistical Learning: Data mining
Inference and Prediction. Springer 2001
2. Willi Richard, Luis Pedro Coelho, “ Building Machine Learning System with python”, Packet
Publishing.
3. Duad, Richard, Peter gart & David Stork, “ Pattern Classification”, 2nd Edition Wiley
Interscience 2000.
P a g e 122

Mca Cbcs Syllabus

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Mca Cbcs Syllabus

Uploaded by

Copyright:

Available Formats

ACADEMIC CURRICULUM AND SYLLABI

POSTGRADUATE DEGREE PROGRAMME

MASTER OF COMPUTER APPLICATION

Three Years (Full-Time)

CHOICE BASED CREDIT SYSTEM

SCHOOL OF INFORMATION T ECHNOLOGY

(Estd. Under SRMUS Act, 2013)

Shri Ramasamy Memorial University Sikkim

3. Program Educational Objectives (PEO’s OR PO’s)

4. Consistency of PEO’s with Mission of the Department

H – High Correlation, M – Medium Correlation, L – Low Correlation

Discipline Specific Electives (DSE)

Total Credits: 135

Program Learning Outcomes (PLO)

Summary of Course Content

Program Learning Outcomes (PLO)

Summary of Course Content

Bloom’s Continuous Learning Assessment (50% weightage)

Program Learning Outcomes (PLO)

Critical Thinking PLO-2

Problem Solving PLO-3

Research Skills PLO-4

Summary of Course Content

Bloom’s Continuous Learning Assessment (50% weightage) Final Examination

Program Learning Outcomes (PLO)

Critical Thinking PLO-2

Problem Solving PLO-3

Research Skills PLO-4

(Level of correlation: 3-High, 2-Medium, 1-Low can be used)

Summary of Course Content

Bloom’s Continuous Learning Assessment (50% weightage)

Program Learning Outcomes (PLO)

Critical Thinking PLO-2

Problem Solving PLO-3

Research Skills PLO-4

Summary of Course Content

Bloom’s Continuous Learning Assessment (50% weightage)

Program Learning Outcomes (PLO)

Critical Thinking PLO-2

Problem Solving PLO-3

Research Skills PLO-4

Summary of Course Content

Bloom’s Continuous Learning Assessment (50% weightage) Final Examination

Program Learning Outcomes (PLO)

Critical Thinking PLO-2

Problem Solving PLO-3

Research Skills PLO-4

Summary of Course Content

Program Learning Outcomes (PLO)

Critical Thinking PLO-2

Problem Solving PLO-3

Research Skills PLO-4

Summary of Course Content

Bloom’s Continuous Learning Assessment (50% weightage)

Program Learning Outcomes (PLO)

Critical Thinking PLO-2

Problem Solving PLO-3

Research Skills PLO-4

Summary of Course Content

Managing Console I/O Operations: C++ Streams, C++ Stream

Bloom’s Continuous Learning Assessment (50% weightage)

Program Learning Outcomes (PLO)

Critical Thinking PLO-2