NITTE MEENAKSHI INSTITUTE OF TECHNOLOGY

(Autonomous Institution, Affiliated to VTU, Belgaum, Approved by AICTE & State Govt. of Karnataka)

Yelahanka, Bangalore – 560064

DEPARTMENT OF MCA

MCA SCHEME & SYLLABUS

2022-2024
VISION

To prepare students for challenging global careers with a focus on

innovation and entrepreneurship to meet the demands of the ever-
changing IT industry and for the development of society.

MISSION

 To provide quality and industry-oriented education in applied

Computer Science through well-defined teaching learning process
and best practices.
 To promote creativity among students through projects and
practical perception
 To inculcate leadership and entrepreneurial skills through holistic
development of students.

PROGRAM EDUCATIONAL OBJECTIVES (PEO’S)

 Design and develop the computer applications to meet the end

customer end and also to adapt for ever changing IT technologies
 Effective and efficient leader of a team in IT/ITES industry and
engage in lifelong learning.
 Develop a positive attitude towards social and cultural issues and
imbibe integrity and ethical values.
PROGRAM OUTCOMES (PO’s)

1. Computational Knowledge: To equip students with core theoretical

knowledge, technical, analytical, practical skills and managerial
abilities to compete in a global environment
2. Problem Analysis: To equip students with the ability to analyze,
design and assess software systems to meet users requirements
3. Design / Development of Solutions: To equip students with an
ability to apply development principles in creating software systems
for diverse customers
4. Modern Tool Usage: To equip students with the ability to use
current techniques and tools for computing practices
5. Conduct investigations of complex problems: To equip students to
with an ability to analyze and interpret data and provide valid
conclusions.
6. Project management and finance: Students will have the ability to
employ effective project management skills to develop a project
plan, monitor and track development efforts
7. Individual and team work: Students will have an ability to work as
members of multidisciplinary teams to achieve a common goal
8. Communication: To equip students with an ability to communicate
effectively with a wide range of audiences
9. Life-long learning: Students will have the ability for self-
improvement through continuous professional development and life-
long learning
10.Innovation and Entrepreneurship: To equip students with
leadership qualities and interpersonal skills through various co-
curricular and extra-curricular activities
11.Environment and sustainability: An ability to analyze the local
and global impact of computing on individuals, organizations, and
society
12.Ethics: To mould students as ethical, socially-committed individuals
who will act with honesty and integrity and contribute to the
betterment of the society and nation
PROGRAM SPECIFIC OUTCOMES (PSO's)

1. The ability to analyse, design and develop computer applications

using programming tools, algorithms and data structures.
2. The ability to apply standard tools, techniques and practices of
software engineering, testing and project management to deliver
efficient and quality applications
 NITTE MEENAKSHI INSTITUTE OF TECHNOLOGY
Department of Master of Computer Applications

COURSE STRUCTURE

Course Category Number of Credits

Core Courses 54 Credits

Elective Courses 18 Credits

Skill Enhancement Courses 05 Credits

[Mini Project + MOOC+ Technical Seminar
+ Aptitude & Soft skills ]

Out Reach Programme: (Conferences / 23 Credits

Symposiums / Technical Meets / Workshops / [ Internship + Project work ]
Etc.,)

Total 100 Credits

 NITTE MEENAKSHI INSTITUTE OF TECHNOLOGY
Department of Master of Computer Applications

M.C.A.CURRICULUM- 202 2

BRIDGE COURSES

S. No. Course Title Total Hours*

1. Fundamentals of Computers 12
2. Introduction to Problem Solving 12
3. Introduction to Computer Programming 12

*6 Days x 6 Hours per day of 03 subjects above = 36 Hours (Each Subject 02 hours per day)
 22MCA 001: FUNDAMENTALS OF COMPUTERS

Objectives:
 To get familiar with the fundamental concepts of Computers.

Outcomes:
 Ability to gain basic knowledge in computer science domain.

MODULE-I
Computer Basics: Simple Model of a Computer, Characteristics of Computers – Computer
classifications and generations - Data Representation.

MODULE-II
Introduction to Microprocessor - Input / Output Units – Computer Memory – Storage –
Database Management Systems - Binary Arithmetic – Logic Circuits.

MODULE-III
Introduction to Operating Systems – Programming languages – Multimedia - Computer Networks.

Text Book:
1. V. Rajaraman, Neeharika Adabala : Fundamentals of Computers, Prentice Hall India
Learning Private Limited; 6th Revised Edition (2014)
 22MCA 002: INTRODUCTION TO PROBLEM SOLVING

Objectives:
 To get familiar with various problem solving techniques.

Outcomes
 Ability to solve problems using various approaches.

MODULE-I
Introduction to problem solving – Top-down design – Implementation of algorithms – program
verification – efficiency & analysis of algorithms.

MODULE-II
Basic problem solving approaches: Factoring methods – Array techniques – Merging,
Sorting & Searching.

MODULE-III
Text processing - Pattern searching – Dynamic Data Structures - Recursive algorithms.

Text Book:
1. R. G. Dromey, How to Solve it by Computer, Pearson Education India; 1st edition (2006).
 22MCA003: INTRODUCTION TO COMPUTER PROGRAMMING

Objectives:
 To develop C Programs using basic programming constructs
 To develop C programs using arrays, strings, functions, structures & Files.
Outcomes:
 Ability to code in C Language.

MODULE - I
Introduction to programming paradigms - Structure of C program - C programming: Data
Types – Storage classes - Constants – Enumeration Constants - Keywords – Operators:
Precedence and Associativity - Expressions - Input/Output statements, Assignment
statements – Decision making statements - Switch statement - Looping statements – Pre-
processor directives - Compilation process.

MODULE - II
Introduction to Arrays: Declaration, Initialization – One dimensional array – Two dimensional
arrays
– String operations: length, compare, concatenate and copy – Introduction to functions:
Function prototype, function definition, function call, Built-in functions (string functions,
math functions) – Recursive function.

MODULE - III
Structure - Nested structures – Pointer and Structures – Array of structures – Files – Create,
Open, Close, Processing of file content.

Text Book:
1. Reema Thareja, Programming in C, Oxford University Press, Second Edition, 2016.
2. Kernighan, B.W and Ritchie, D.M., The C Programming language, Pearson
Education, Second Edition, 2006.
 NITTE MEENAKSHI INSTITUTE OF TECHNOLOGY
Department of Master of Computer Applications
2022 SCHEME OF TEACHING AND EXAMINATION OF MCA FIRST SEMESTER

I SEMESTER CREDIT BASED

Subject Code Name of the Teaching hours/week Duration Marks for Total Credits
Subject of Exam marks
Lecture Tutorials Practical in Hours CIE SEE

Object Oriented
22MCA101 Programming 4 - - 3 50 50 100 4
using C++/JAVA
Data Structures
22MCA102 and Algorithms 4 - - 3 50 50 100 4
Operating System
22MCA103 with 4 - - 3 50 50 100 4
UNIX/LINUX
Database
22MCA104 Management 3 - 3 50 50 100 3
System
Operations
22MCA105 3 1 - 3 50 50 100 3
Research
Research
22MCA106 Methodology & 3 - - 3 50 50 100 3
Professional Ethics
Object Oriented
Programming
22MCA107L - - 2 3 50 50 100 1
Using C++/JAVA
Laboratory
Data Structures
22MCA108L And Algorithms - - 2 3 50 50 100 1
Laboratory
UNIX/LINUX
22MCA109L Laboratory - - 2 3 50 50 100 1

Database
22MCA110L Management - - 2 3 50 50 100 1
System Laboratory
Principles of
22MCA111B Programming 3 - - 3 50 50 100 0

Aptitude & Soft

22MCA112P skills 3 3 50 50 100 0

Total 27 01 08 36 600 600 1200 25

*Subject Code (L=Laboratory, B= Bridge Course,P=Placement)

NITTE MEENAKSHI INSTITUTE OF TECHNOLOGY

10
 Department of Master of Computer Applications
2022 SCHEME OF TEACHING AND EXAMINATION OF MCA SECOND SEMESTER
II SEMESTER CREDIT BASED

Subject Name of the Teaching hours/week Duration Marks for Total Credits
Code Subject of Exam marks
Lecture Tutorials Practical in Hours CIE SEE

Python
22MCA201 4 - - 3 50 50 100 4
Programming
22MCA202 Web Programming 4 - - 3 50 50 100 4

Mobile
22MCA203 4 3 50 50 100 4
Applications
22MCA204E DS Elective – 1 3 - - 3 50 50 100 3
22MCA205E DS Elective – 2 3 - 3 50 50 100 3
22MCA206E DS Elective – 3 3 - - 3 50 50 100 3
Python
-
22MCA207L Programming - 2 3 50 50 100 1
Laboratory
Web Programming
22MCA208L 2 3 50 50 100 1
Laboratory
Mobile
22MCA209L Applications in - 2 3 50 50 100 1
Android Laboratory

22MCA210S Technical Seminar 2 3 50 50 100 1

Total 24 01 08 33 500 500 1000 25

STREAM DS Elective – 1 DS Elective – 2 DS Elective – 3
Computer IOT System
Cloud
CLOUD AND IOT 22MCA2041E Networking & 22MCA2051E 22MCA2061E Design and
Computing
Communication Development
ARTIFICIAL Introduction to Artificial
INTELLIGNENC Data Science Intelligence & Machine
E AND DATA
22MCA2042E 22MCA2052E 22MCA2062E
Expert Learning
SCIENCES Systems
Fundamentals
of Mobile &
CYBER
SECURITY
22MCA2043E Cryptography 22MCA2053E Cyber security 22MCA2063E Digital
& Network Forensics
Security
*Subject Code (L=Laboratory, E= Elective Course, S=Seminar), *DS- Domain Specific
*Note: Students need to select one subject each from the DS elective set of same or different
stream of their choice.

11
 NITTE MEENAKSHI INSTITUTE OF TECHNOLOGY
Department of Master of Computer Applications
2022 SCHEME OF TEACHING AND EXAMINATION OF MCA THIRD SEMESTER
III SEMESTER CREDIT BASED

Subject Name of the Teaching hours/week Duration Marks for Total Credits
Code Subject of Exam marks
Lecture Tutorials Practical in Hours CIE SEE

22MCA301 Programming 4 - - 3 50 50 100 4

Using C# and .NET
22MCA302 Full Stack Web 4 - - 3 50 50 100 4
Development
Software
22MCA303 Engineering & 4 2 - 3 50 50 100 4
Software Testing –
Integrated Lab
22MCA304E DS Elective - 4 3 - - 3 50 50 100 3
22MCA305E DS Elective - 5 3 - 3 50 50 100 3
22MCA306E DS Elective - 6 3 - 3 50 50 100 3
Programming
22MCA307L Using C# and .NET - - 2 3 50 50 100 1
Laboratory
Full Stack Web
22MCA308L Development - - 2 3 50 50 100 1
Laboratory
22MCA309P Mini Project - IOT - 2 2 3 50 50 100 2

TOTAL 24 01 08 33 450 450 900 25

STREAM DS Elective – 4 DS Elective – 5 DS Elective – 6
Web Services AWS Cloud IOT Data
CLOUD AND IOT 22MCA3041E 22MCA3051E 22MCA3061E
Computing Computing Analytics
ARTIFICIAL Data Mining Robotic
INTELLIGNENC & Business Big Data
E AND DATA
22MCA3042E 22MCA3052E Process 22MCA3062E
Intelligence Analytics
SCIENCES Automation
User Interface
APPLICATION Block Chain
DEVELOPMENT
22MCA3043E 22MCA3053E DevOps 22MCA3063E and User
Technology
Experience

*Subject Code (L=Laboratory, E= Elective Course, P=Project), *DS- Domain Specific

*Note: Students need to select one subject each from the DS elective set of same or different
stream of their choice.

12
 NITTE MEENAKSHI INSTITUTE OF TECHNOLOGY
Department of Master of Computer Applications
2022 SCHEME OF TEACHING AND EXAMINATION OF MCA FOURTH SEMESTER

IV SEMESTER CREDIT BASED

Examination
Sl.
Course
No Course Title Duration SEE CIE Total Credits
Code
. in hours Marks Marks Marks
1 22MCA401C MOOC Course - - 50 50 1
2 22MCA402I Industry Internship (6 weeks) - - 50 50 4
Project Work (During IV
3 22MCA403P 3 100 100 200 20
semester 16 weeks)

Total 3 100 200 300 25

Grand Total (I to IV Semesters): 3400 Marks : 100 Credits

*Subject Code (C=Course, I=Internship, P=Project)

*MOOC = Massive Open Online Course

13
 GENERAL GUIDELINES OF THE MCA COURSE
Course Title: Project Work, Course Code: 22MCA403P

Dissertation Work Guidelines

 The student shall carry out the project work in the same Institution or in any Industry /
R&D labs based on software tools and technologies learnt in MCA Course/Internship for a
minimum period of 16 weeks.
 The dissertation work shall be carried out by each candidate independently under the
guidance of one of the faculty members of the Department.
 If dissertation is carried out in any Industry/R&D Labs, outside the campus, the name of
external guide at the organization shall be intimated to the Head of the Department.
 Project work may be application oriented or research oriented as per student and guide‘s
interest. Therefore the project reports will vary depending on whether it is application
oriented project or research based project.
 Project work dairy should be maintained by the students, signed by the external guide and
internal guide.
 At the end of the semester each candidate shall prepare a draft report of the dissertation
work and submit it for plagiarism check (Plagiarism≤20%) using facility in NMIT library.
 The report shall be duly approved by the internal guide after the plagiarism check.
 The candidate shall submit two hard bound copies and the soft copy of the dissertation
work to the Head of the Department.
 A separate calendar of events for submission of dissertation and viva-voce shall be fixed
by the examination section and shall be notified.
 The candidates who fail to submit the dissertation work with in the stipulated time have to
submit the same at the time of next ensuing examination.
 The internal examiners and the external examiners shall be appointed by the COE /
Principal for the Final Evaluation of the project.
 A copy of the dissertation shall be sent to the external examiners by the Chairman of BOE.
 If there port is rejected, internal guide has to communicate to the candidate for
modification as per the suggestions made by the External Examiner and resubmit.
 Internal guide and External Examiners shall carry out the evaluation of Dissertation
reportfor50 marks individually.
 Dissertation assessment by the internal guide will be considered as CIE and dissertation
assessment by the external examiner will be considered as SEE.
 The students shall give poster presentation of their project before the SEE.
 The students shall also prepare a research paper of their project in the prescribed format
and submit it to their guides before SEE.

Internal Evaluation and Viva Voce Guidelines:

 Internal assessment (CIE) shall be evaluated by both the internal and external guide for
50 marks individually. The average of the marks allotted by the internal and external
guides shall be the final marks for the Internal Evaluation.
 The project presentation and Viva-Voce (SEE) shall be evaluated jointly by both the
Internal and External examiners for 50 marks.

Industry Internship Guidelines (Subject Code: 22MCA402I)

14
  All the students have to undergo mandatory internship of 06 weeks duration during the
vacation of III semester.
 Students have to undergo the Internship in any Institute of National repute or any
reputed / well-known Industry.
 The Industry Internship shall be carried out by each candidate independently under the
guidance of one of the faculty members of the Department.
 On completion of Internship they shall submit a brief report to the department.
 Internship shall be considered as a head of passing and shall be considered for the award
of degree.
 Those, who do not take-up/complete the internship shall be declared as fail in internship
course and have to complete the same during the subsequent semester.
 After satisfying the internship requirements the degree will be awarded .However,
student can carry out 4thsemester project without completing the internship.

MOOC COURSE Guidelines (Subject Code: 22MCA401C)

 A self-study certification course i.e. Massive Open Online Course (MOOC) of 02
credits shall be completed by all the students during the course for the award of the
degree.
 The course duration for 02 credits shall be of 08 Weeks only.
 The students will have to register and take up proctored exam only through NPTEL
under SWAYAM portal.
 The certificate taken from any other online certification course other than NPTEL
for MOOC is considered to be invalid.
 The list of courses under computer Science will be recommended by the department
after NPTEL has announced the list of upcoming courses in SWAYAM portal.
 The certificate obtained after taking up the proctored exam will be submitted and the
marks obtained will be considered for CIE.
 However there will be no separate SEE for the MOOC course.
 The student can take up the MOOC course any time during the entire duration of the
MCA course.
 The student will be considered as fail in MOOC Course in case he/she
o Scores less than 50 out of 100 in the proctored examination.
o Fails to submit the certificate in the IV semester.

Mini Project-IoT Guidelines (Subject Code: 22MCA310P)

15
A Mini Project based on IOT will be implemented and presented by a group of students (group
size about Two to Six)
 The mini project will be carried out by the group of students under the guidance of one
of the faculty members of the department.
 The team must submit a brief project report containing at-least (20-30 pages).
 An open house project exhibition will be conducted before SEE and the students shall
give the demonstration of their working projects.
 The mini project examination will be conducted jointly by the internal and external
examiners and marks shall be awarded jointly.

Technical Seminar Guidelines (Subject Code: 22MCA110S)

 Students should present the seminar on Cutting Edge/Emerging/State of the art

technologies in the field of Computer Science and Applications.
 The seminar shall be carried out by each candidate independently under the guidance of
one of the faculty members of the Department.
 The topic of the seminar shall be chosen by the candidate in consultation with the guide.
 Duration of the seminar should be approximately 30 minutes.
 At the end of the semester each candidate shall submit the report on the seminar title
containing at-least 20 pages.
 The seminar examination will be conducted jointly by the internal and external
examiners and marks shall be awarded jointly.

NITTE MEENAKSHI INSTITUTE OF TECHNOLOGY

16
 Department of Master of Computer Applications
2022-SYLLABUS OF TEACHING AND EXAMINATION OF MCA FIRST SEMESTER
Object Oriented Programming using C++/JAVA
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – I
Subject Code 22MCA101 CIE Marks 50
Number of Lecture Hours/Week 04 SEE Marks 50
Total Number of Lecture Hours 50 SEE Hours 03
Credits – 04
COURSE DESCRIPTION
This course introduces computer programming using the JAVA programming language with
object-oriented programming principles. Emphasis is placed on event-driven programming
methods, including creating and manipulating objects, classes, and using object-oriented tools
such as the class debugger.
PREREQUISITES
 Familiar with Object Oriented Principles.
COURSE OBJECTIVES
 To understand the basic concepts and fundamentals of platform independent object
oriented language.
 To demonstrate skills in writing programs using exception handling techniques and
Multithreading.
 To understand streams and efficient user interface design techniques.
COURSE CONTENTS
Modules Teaching
Hours
Module 1 10 Hours
Introduction To Java: How java changed the internet; Byte Code; Object
oriented programming; First Simple Java program, Introducing Classes: Classes
Fundamentals; Declaring Objects, Assigning Object Reference Variable;
Introducing Methods; Inheritance Basics- using Super; Creating Multilevel
Hierarchy, Constructors: When constructors are called?, method overloading,
Dynamic Method Dispatch, Abstract classes, final with inheritance, method
Overriding.
Module 2 10 Hours
Packages and Interfaces, Exception handling in java: Packages, Access
Protection, importing packages, interfaces. Exception Handling Fundamentals,
Exception types, uncaught Exception, using try and catch, multi catch clause,
nested try catch, throw, throws, finally, java’s built in exceptions, creating your
own exception subclasses, chained exceptions, using exceptions.
Module 3 10 Hours
Multi-Threaded Programming ; The java tread model, The main thread,
Creating thread, creating multiple threads, Using isAlive() and join(), Thread
priorities, Synchronization, Inter thread communication; Suspending , resuming
and stopping threads. Introduction to I/O classes and class hierarchy.

Module 4 10 Hours

17
 Event Handling: Two event handling mechanisms; The delegation event
model; Event classes; Sources of events; Event listener interfaces; Using the
delegation event model; Adapter classes; Inner classes.
Working with Windows, Graphics, and Text, Using AWT Controls, Layout
Managers, and Menus.
Swings: The origins of Swing; Two key Swing features; Components and
Containers; The Swing Packages; A simple Swing Application;
Module 5 10 Hours
Collections: The collection interfaces and classes, accessing collection via
iterator, storing user defined classes in collections, the random access interface,
working with maps, comparators, the collection algorithms, arrays, the generic
collections, Introduction to client/server architecture, Java Servlets and JDBC
with sample programs.
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module
Text Books:
1. Java: The Complete Reference, Eleventh Edition, Herbert Schildt, McGrawHill,
December 2018, ISBN: 9781260440249.
Reference Books:
1. Core Java Volume I Fundamentals, Eleventh Edition, Cay S. Horstmann, Pearson,
August 2018, ISBN: 9780135167199.
2. Java: A Beginner's Guide, 8th Edition, Herbert Schildt, McGraw-Hill, November 2018,
ISBN: 9781260440225.
3. Java Performance, 2nd Edition, Scott Oaks, O'Reilly Media, Inc., February 2020, ISBN:
9781492056119
TEACHING METHODS
 PPTs
 Blackboard
 Hands-On Sessions Based Teaching using Netbeans IDE
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and weightage of 40%, 40% and
20% from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation of Learning Activity based on Programming Assignments / Mini Projects
for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks
Course Outcome (CO): At the end of this course, the students will be able to
CO1: Define the concepts of object oriented programming like Encapsulation, Abstraction and
polymorphism to solve the real-life problems.
CO2: Demonstrate the usage of Interfaces, packages and Exception handling.
CO3: Apply the concepts event handling and applets for the internet programming.
CO4: Learn and apply the concepts of Collections and maps
CO5: Analyze the software requirements needed to develop an Enterprise Application.

18
CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 3
CO2 2 2 2 2 1 3
CO3 2 2 2 1 3
CO4 3 2 2 1 1 3
CO5 2 2 1 1 1 3

19
 Data Structures and Algorithms
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – I
Subject Code 22MCA102 CIE Marks 50
Number of Lecture Hours/Week 04 SEE Marks 50
Total Number of Lecture Hours 50 SEE Hours 03
CREDITS – 04
COURSE DESCRIPTION
This course provides an in-depth knowledge of structures, pointers and dynamic memory
allocation in C. The course also provides the knowledge of different data structures and their
applications in solving real-world problems. This course introduces basic methods for the
design and analysis of efficient algorithms emphasizing methods which are useful in practice.
The computational problems for sorting, searching, Divide and Conquer, dynamic
programming and greedy algorithms are discussed.
PREREQUISITES
 Computer Concepts and C Programming.
 Students should know data structures
 Students should know the usage of summation formulae and recurrences in
mathematics
COURSE OBJECTIVES
 To understand the concept of pointers and, allocate and de allocate memory
dynamically to pointers.
 To understand working principle of different types of data structures
 To identify and apply the appropriate data structure to solve a given problem.
 To understand the basic concepts and notations used in the design and analysis of
algorithms.
 To solve problems using appropriate algorithms.
 To analyze and compare the performance of algorithms.
COURSE CONTENTS
Modules Teaching
Hours
Module 1 8 Hours
Classification of Data Structures: Primitive and Non- Primitive, Linear and
Nonlinear; Data structure Operations, Stack: Definition, Representation,
Operations and Applications: Polish and reverse polish expressions, Infix to
postfix conversion, evaluation of postfix expression, infix to prefix, postfix to
infix conversion.
Module 2 6 Hours
Recursion - Factorial, GCD, Fibonacci Sequence, Tower of Hanoi. Queue:
Definition, Representation, Queue Variants: Circular Queue, Priority Queue,
Double Ended Queue; Applications of Queues. Programming Examples.
Module 3 10 Hours
Linked List: Limitations of array implementation, Memory Management: Static
(Stack) and Dynamic (Heap) Memory Allocation, Memory management
functions. Definition, Representation, Operations: getnode() and Freenode()
operations, Types: Singly Linked List. Linked list as a data Structure, Inserting
and removing nodes from a list, Linked implementations of stacks, Header
nodes, Array implementation of lists. Double Linked List: Inserting and
Deleting Nodes, Queue as doubly linked lists, such as insert into position,
20
Delete a specified element.
Module 4 6 Hours
Introduction, Fundamentals of the Analysis of Algorithm Efficiency Notion of
Algorithm, Fundamentals of Algorithmic Problem Solving, Important Problem
Types, Analysis Framework, Asymptotic Notations and Basic efficiency
classes, Mathematical analysis of Recursive and Non-recursive algorithms.
Module 5 12 Hours
Brute Force: Selection Sort and Bubble Sort, Sequential Search, Exhaustive
search and String Matching. Divide-and-Conquer Mergesort, Quicksort,
Binary Search, Binary tree Traversals and related properties. Decrease-and-
Conquer Insertion Sort, Depth First and Breadth First Search, Topological
sorting. Greedy Technique Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s
Algorithm.
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module
Text Books:
1. Data Structures Using C and C++ by Yedidyah Langsam and Moshe J. Augenstein and
Aaron M Tenanbanum, 2nd Edition, Pearson Education Asia,2002
2. Programming in ANSI C, Balaguruswamy, McGraw Hill Education.
3. Introduction to the Design and Analysis of Algorithms. Anany Levitin, Pearson
Education, 2nd Edition.
4. Introduction to Data Structure and Algorithms with C++ by Glenn W.Rowe.
TEACHING METHODS
 PPTs
 Hands-On Sessions
 Blackboard
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and weightage of 40%, 40% and
20% from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation of Learning Activity based on Programming Assignments / Quiz / Mini
Projects for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Demonstrate different data structures, its operations using C programming.
CO2: Analyze the performance of Stack, Queue, Lists, Searching and Sorting techniques.
CO3: Implement some applications of data structures in a high-level language such as C/C++
CO4: Design and apply appropriate data structures for solving computing problems.
CO5: Compute the efficiency of algorithms in terms of asymptotic notations for the given
problem.

CO-PO-PSO Mapping

21
 PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 2 1 3 1
CO2 2 2 2 2 1 3 1
CO3 2 2 2 2 1 3 1
CO4 2 2 2 2 1 3 1
CO5 2 2 2 2 1 3 1

Operating System with UNIX /LINUX

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – I
Subject Code 22MCA103 CIE Marks 50
22
 Number of Lecture Hours/Week 04 SEE Marks 50
Total Number of Lecture Hours 50 SEE Hours 03
CREDITS – 04
COURSE DESCRIPTION
This course provides an in-depth knowledge of Process, Threads and resource management. This
course gives the basic knowledge of Unix Operating System platform and API level introduction
to concepts like files & directories in the Unix. The subject also introduces types of users and
privileges supported to the users. Covers the different filters used in Unix.
PREREQUISITES
 Student should have some basic knowledge on Unix Shell Programming and Windows
operating system.
COURSE OBJECTIVES
 To understand the basic functionalities of Operating System, Process and Threads.
 To understand the implementation of memory management and virtual memory.
 To understand the fundamental design of the UNIX operating system.
 To be able to design and build an application/service over the UNIX operating system
COURSE CONTENTS
Modules Teaching
Hours
Module 1 10 Hours
Introduction to Operating System, Process Management
What is an Operating System, Mainframe Systems, Desktop Systems,
Multiprocessor Systems, Distributed Systems, Clustered Systems, Real- Time
Systems, Handheld Systems, System Components, System Calls, System
Programs, Operating System Structure, Virtual Machines. Process Concept;
Process Scheduling; Operations on Processes; Cooperating Processes; Inter
Process Communication.
Module 2 12 Hours
Threads, Process Scheduling, Deadlocks:
Multi – Threaded Programming: Overview, Multithreading Models, CPU
Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Multiple
Processor Scheduling, Mutual Exclusion, Hardware Support: Semaphores,
Monitors, Readers/Writers Problem. System model; Deadlock Characterization,
Methods for Handling Deadlocks; Deadlock Prevention; Deadlock Avoidance;
Deadlock Detection and Recovery from Deadlock.
Module 3 8 Hours
Memory Management, Virtual Memory
Memory Management Memory Management Strategies: Background, Swapping;
Contiguous Memory Allocation; Paging; Segmentation; Virtual Memory
Management; Background; Demand Paging; Page Replacement; Allocation of
Frames; Thrashing.
Module 4 12 Hours
The File System: The File, What’s in a File name? The Parent-Child
Relationship, The HOME Variable: The Home Directory, pwd, cd, mkdir, rmdir,
Absolute Pathnames, Relative Pathnames, The Unix File System.
Basic File Attributes: ls options, File Ownership, File Permissions, chmod,
Directory Permissions, Changing the File Ownership More File Attributes: File
Systems and Inodes, Hard Links, Symbolic Links, The Directory, umask,
23
Modification and Access Times, find. Filters Pr, head, tail, cut, paste, sort, uniq, tr
commands, Filters using Regular Expression: grep & sedgrep, Regular Expression,
egrep, fgrep, sed instruction, Line Addressing, Inserting and Changing Text,
Context addressing, writing selected lines to a file, the –f option, Substitution,
Prosperities of Regular Expressions Context addressing, writing selected lines to a
file, the –f option, Substitution, Properties of Regular Expressions.
Module 5 8 Hours
Essential Shell Programming: Shell Variables, Environment Variables, Shell
Scripts, read, Using Command Line Arguments, exit and exit status of command,
16 The Logical Operators, The if Conditional, using test and [] to Evaluate
Expression, The case Conditional, expr, while: looping, for: looping with a list, set
and shift, trap, Debugging Shell Scripts with set – x Laboratory Students shall
implement programs which supplement the theory concepts.
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module
Text Books:
1. Silberschatz, Galvin, Gagne, “Operating System Concepts” John Wiley, Sixth Edition, 2004
2. William Stallings, “Operating System Internals and Design Principles” Pearson, 6 th edition,
2012.
3. UNIX-The Ultimate Guide, Sumitabha Das, Tata Mc GrawHill,2001
4. The UNIX Programming Environment by Kernighan and pike, Pearson, 2005
TEACHING METHODS
 PPTs
 Hands-On Sessions Based Teaching
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and weightage of 40%, 40% and
20% from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation for learning activity based on Programming Assignments / Case studies/ Mini
Projects for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Understand the Basics of Computer and Operating System Structure
CO2: Realize the concept of Process Management and Mutual Exclusion
CO3:Understand the concepts of the Deadlock and different approaches to memory management
CO4: Demonstrate the working of basic commands of Unix environment including file
processing, filters.
CO5: Demonstrate the usage of different shell commands, shell programming concepts.

CO-PO-PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 1 2 1 3 1

24
CO2 2 2 2 1 2 1 3 1
CO3 2 2 2 1 2 1 3 1
CO4 2 2 2 1 2 1 3 1
CO5 2 2 2 1 2 1 3 1

Database Management System

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER -I
Subject Code 22MCA104 CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
25
 Credits – 03
COURSE DESCRIPTION
This course provides an understanding of Database management systems. The course also
provides the knowledge of ER-diagram design, Relational Algebra and RDBMS, SQL for
querying the database and Normalization for the good database design.
PREREQUISITES
 Students should know basics of Discrete Mathematics.
 Students should know basic programming concepts.
COURSE OBJECTIVES
 To understand the fundamentals of Relational database management systems.
 To design database using ER-modeling, Normalization and querying the database using
SQL.
 To understand the fundamentals of transactions, locking mechanisms, database recovery.
COURSE CONTENTS
Modules Teaching
Hours
Module 1 8 Hours
Introduction:
Introduction to DBMS, Characteristics of Database approach, Actors on the
Scene, Workers behind the scene, Advantages of using DBMS approach, Data
models, schemas and instances, Three –schema architecture and data
independence, Database languages and interfaces.
Entity-Relationship Model: Conceptual Database using high level conceptual
data models for Database Design, A Sample Database Application, Entity types,
Entity sets, Attributes and Relationship types, Relationship Sets, Role names and
Structural Constraints and Weak Entity Types.

Module 2 8 Hours
Relational Model:
Relational Model Concepts and Constraints , Relational Database Schema
Update Operations, Unary Relational operations, Relational Algebra Operations
from Set Theory, Binary Relational Operations, JOIN and DIVISION,
Additional Relational Operations, Relational Database Design Using ER-to-
Relational Mapping(7step algorithm)

Module 3 8 Hours
Introduction to SQL:
SQL Data Types and Schemas, SQL Data Definition commands, SQL Data
Manipulation commands, Basic structure of SQL Queries, Additional Basic
Operations, Null values, Aggregate Functions, Nested and co-related nested quires ,
Join Expressions, Views in SQL.

Module 4 8 Hours
Database Design:
Informal Design Guidelines for Relation Schemas, Functional Dependencies,
Closure of a functional dependency and canonical cover of functional
dependency calculations and Armstrong (inference) Rules. Introduction to
Normalization, Working of 1st Normal Form 2nd and 3rd Normal Forms, Boyce
Codd Normal Forms, Multivalued Dependencies and IV Normal Forms, Join
26
Dependencies and V Normal Forms
Module 5 8 Hours
Transaction Management:
Introduction to transaction processing, Transaction and system Concept,
Transaction properties Atomicity and Durability, Serializability and isolation
(ACID properties).
Concurrency Control: Lock Based Protocols-Types of Locks, Simplistic Lock
Protocol, Pre-claiming Lock Protocol, Two-Phase Locking (2PL) and Strict
Two-Phase Locking. Deadlock Handling-deadlock prevention schemes,
Deadlock Avoidance.
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module
Text Books:
1. Elmasri and Navathe: Fundamentals of Database Systems, 5th Edition, Addison -
Wesley, 2011.
2. Silberschatz, Korth and Sudharshan Data base System Concepts,6 th Edition, Tata
McGraw Hill, 2011.
Reference Books:
1. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, 3 rd
Edition, McGraw-Hill, 2003
2. Database Principles Fundamentals of Design, Implementation and Management by
Coronel, Morris, Rob- Cengage Learning 2012
TEACHING METHODS
 PPTs
 Hands-On Sessions Based Teaching
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and weightage of 40%, 40% and
20% from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation for learning activity based on Programming Assignments / Case studies/
Mini Projects for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks
COURSE OUTCOMES
At End of the Course Student will Be Able to
CO1: Apply the basic concepts of database management in designing the database for the
given problem.
CO2: Design entity-relationship diagrams to the given problem to develop database
application with appropriate fields and validations by using a Relational model.
CO3: Formulate SQL queries in Oracle to the given problem.
CO4: Illustrate concept of functional dependencies and determine normalization techniques to
improve the database design to the given problem.
CO5: Analyze and implement transaction processing, concurrency control and database
recovery protocols in databases

CO-PO-PSO Mapping:
27
 PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 1 2 1 1 3
CO2 1 2 2 2 1 1 3
CO3 2 3 2 2 1 1 3
CO4 1 2 2 2 1 1 3
CO5 2 2 2 1 1 3

Operations Research
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – I
Subject Code 22MCA105 CIE Marks 50
Number of Lecture Hours/Week 03 + 01 Hr Tutorial SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
CREDITS – 03

28
COURSE DESCRIPTION
Operations research helps in solving problems in different environments that needs decisions. The
module cover topics that include: linear programming, Transportation, Assignment, and sequencing
problems.
PREREQUISITES
 None
COURSE OBJECTIVES
This course aims to introduce students to use quantitative methods and techniques for effective
decisions–making; model formulation and applications that are used in solving business decision
problems.
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
Introduction: Definition of Operations research, Quantitative approach, Features of
OR, problem solving Methodology of OR.
Linear programming Problem: Introduction, Generalized LPP, Formulation of
problems as L.P.P., Solutions to LPP by graphical method (Two Variables).
Module 2 08 Hours
Linear programming Problem: Simplex method, Canonical and Standard form of
LP problem, slack, surplus and artificial variables, Solutions to LPP by Simplex
method, Big-M Method and Two Phase Simplex Method.
Module 3 08 Hours
LPP: Duality in linear programming, Formulation of dual linear programming and
examples.
Assignment problem: Formulation, Solutions to assignment problems by Hungarian
method.
Module 4 08 Hours
Transportation problem: Formulation of transportation problem, types, initial basic
feasible solution using North-West Corner rule, Least cost method, Vogel’s
Approximation method. Optimality in Transportation problem by Modified
Distribution (MODI) method.
Module 5 08 Hours
Theory of games: Introduction, Two-person zero sum games, Pure strategies (Min-
Max and Max-Min principles), Mixed strategies. The rules of principles of
dominance, algebraic method to solve games without saddle point, graphical
methods to solve games.
Sequencing problems: Processing n-jobs through two machines (Johnson’s
procedure).
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module
Text Books:
1. J.K. Sharma, “Operations Research Theory and Applications”, 5 th edition, MacMillan
29
 publisher India.
Reference Books:
1. S.D Sharma, Himanshu Sharma, “Operations Research: Theory, Methods and
Applications”, Kedarnath Ramnath (Publisher).
2. H A Taha , “Operations Research An Introduction”, Low price edition 7th edition, 2006.
3. Hiller and Liberman, “Introduction to operation Research”, McGraw Hill, 5th edition,
2001.
4. Prem Kumar Gupta, D S Heera , “Operations Research”, S Chand Pub., New Delhi, 2007.
TEACHING METHODS
 PPTs
 Black Board
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and Weightage of 40%, 40% and 20%
from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation for Learning Activity based Assignments for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
COURSE OUTCOMES: At End of the Course Student will Be Able to
CO1: Understand the meaning, definitions, scope, phases and techniques of operations research.
CO2: Formulate as L.P.P and derive optimal solutions to linear programming problems by
graphical method, Simplex method and Big-M method.
CO3: Formulate as Transportation and Assignment problems and derive optimum solutions for
transportation, Assignment problems.
CO4: Solve problems on game theory for pure and mixed strategy under competitive environment.
CO5: Determine minimum processing times for sequencing of n jobs -2 machines using Johnson’s
algorithm.

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2 2 1 2
CO2 3 2 2 1 2
CO3 3 2 2 1 2
CO4 3 2 2 1 2
CO5 3 2 2 1 2

Research Methodology & Professional Ethics

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – I
Subject Code 22MCA106 CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
Credits – 03
COURSE DESCRIPTION
30
This course provides an importance of Research, Intellectual Property Rights and Professional
ethics. This course gives detailed knowledge of Defining the Research Problems, conducting
detailed literature survey, Data Collection, Research Design, Drafting of Research Paper,
Publication of papers in Journals, Impact factors. This Course also provides brief contents on
Intellectual Property Rights and Professional ethics.
PREREQUISITES
 Students should have basic skill of English grammar and also should have interest in
exploring & discovering the novel ideas.
 Students should know theoretical concepts of application development.
COURSE OBJECTIVES
 To understand the fundamentals of Research & Development activities.
 To write the research papers on specific areas.
 To understand the concepts of IPR and ethical issues.
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
Introduction - Meaning of research, Objectives of Research, Types of
research, Research Process, Criteria of Good Research.
Defining the research problem- Selecting the problem, necessity of defining
the problem, techniques involved in defining the problem.
Module 2 08 Hours
Reviewing the literature: Collection of Primary data, Collection of Secondary
Data, Review of the literature, searching the existing literature, writing about the
literature reviewed.
Meaning of Research Design: Need for Research Design, features of a Good
Design, Important Concepts Relating to Research Design, Different Research
Designs.
Module 3 08 Hours
Research Paper Writing - Interpretation of Data and Paper Writing – Layout of a
Research Paper, Journals in Computer Science, Impact factor of Journals, When and
where to publish? Ethical issues related to publishing, Plagiarism and Self-Plagiarism
Module 4 08 Hours
Intellectual Property Rights: Patents, Designs, Trade and Copyright. Process
of Patenting and Development: technological research, innovation, patenting,
Procedure for grants of patents.
Module 5 08 Hours
Ethics – An overview: Meaning of ethics, Ethics and morality, Principles of
Professional ethics, what is corporate ethics
Workplace Ethics: Introduction, Needs, Principles, Development of Personal
Ethics, Workplace Ethics for Employees-Ethical behavior in workplace-
Professionalism, Ethical violations by employees, Employee Attitude and
Ethics, Employee Etiquettes.
Ethics in Information Technology: Ethics for IT Professionals and IT users- The
Ethical behavior of IT professionals.
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
31
  Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module
Text Books:
1. Kothari CR, “Research Methodology Methods and Techniques “, New Age
International, 2014, 3rd.Edition, ISBN: 978-81-224-3623-5.
2. Business Ethics an Indian Perspective, A.C.Fernando, Pearson
3. Ethics in the work place, Craig E Johnson, Sage Publication, 2007
4. George Reynolds: Ethics in Information Technology, 2nd Edition, Thomson Course
Technology, 2007
Reference Books:
1. Krishnaswami KN, Sivakuma AI and Mathiarajan, “Management Research
Methodology”, Pearson Education, 2009, ISBN.
2. DebiragE. Bouchoux: “Intellectual Property”. Cengage learning, New Delhi, 2010
3. M.Ashok Kumar and Mohd.Iqbal Ali: “Intellectual Property Right” Serials Pub,2009.
4. Ethics in the workplace, Dean A Bredeson and Keith Gorce, Cengage learning, 3 rd
edition, 2012.
5. Ethics in the workplace: A systems perspective, William F Roth, Pearson Publication
TEACHING METHODS
 ICT based Teaching Learning Methods.
 Presentation Methods.
 Self-Learning by assigned activities.
ASSESSMENT METHODS
 Three Internals, 30 Marks each will be conducted. 40% each of first two internals and
20% of third internals will be consolidated out of 30 marks.
 Case study / Research Paper is considered as a part of Learning Activity for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
COURSE OUTCOMES : At End of the Course Student will Be Able to
CO1: Understand and explain the underlying principles of quantitative and qualitative
research and defining the research problem.
CO2: Choose the most appropriate references in the form of survey to address and design a
particular research problem.
CO3: Applying the Principles of Research & drafting the research paper, identification of
Journals for publication, ethical issues related to publication.
CO4: Understanding the concepts of Filing Patents, Designs, Trade and Copyright. Process
of Patenting and Development.
CO5: To understand the basics of ethics and ethics for IT Professionals and its need for and
importance at workplace.

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1
CO2 1 2 2 2 1 1 1 1 2 2
CO3 2 2 2 2 2 1 1 1 2
CO4 1 2 2 1 1 1 1 2 2
32
CO5 2 2 1 1 1 2 2

Object Oriented Programming using C++/JAVA Laboratory

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – I
Subject Code 22MCA107L CIE Marks 50
Number of Hours/Week 02 Hrs Laboratory SEE Marks 50
SEE Hours 03
CREDITS – 01
COURSE DESCRIPTION

33
To develop software development skills in java programming and Students will have the
proficiency to develop projects in java programming. The course helps the students to solve the
inter-disciplinary applications through java programming.
To write programs for solving real world problems using java collection frame work.
PREREQUISITES
 Basic understanding of Principles of Programming.
COURSE OBJECTIVES
 Practice object-oriented programs and build java applications.
 Implement java programs for establishing interfaces.
 Implement sample programs for developing reusable software components.
 Create database connectivity in java and implement GUI applications.
Laboratory Experiments:
1. a. Write a JAVA Program to demonstrate Constructor Overloading and Method Overloading.
b. Write a JAVA Program to implement Inner class and demonstrate its Access protection.
2 Write a program in Java for String handling which performs the following:
i) Checks the capacity of String Buffer objects.
ii) Reverses the contents of string given on console and converts the resultant string in
upper case.
iii) Reads a string from console and appends it to the resultant string
3 a. Write a JAVA Program to demonstrate Inheritance.
b. Simple Program on Java for the implementation of Multiple inheritance using interfaces to
calculate the area of a rectangle and triangle.
4 Write a JAVA program which has
i) A Class called Account that creates account with 500Rs minimum balance, a deposit()
method to deposit amount, a withdraw() method to withdraw amount and also throws
LessBalanceException if an account holder tries to withdraw money which makes the
balance become less than 500Rs.
ii) A Class called LessBalanceException which returns the statement that says withdraw
amount ( Rs) is not valid.
iii) A Class which creates 2 accounts, both account deposit money and one account tries
to withdraw more money which generates a LessBalanceException take appropriate
action for the same.
5 Write a JAVA program using Synchronized Threads, which demonstrates Producer Consumer
concept.
6 Write a JAVA program to implement a Queue using user defined Exception Handling (also
make use of throw, throws.).
7 Complete the following:
i) Create a package named shape.
ii) Create some classes in the package representing some common shapes like Square,
Triangle, and Circle.
iii) Import and compile these classes in other program.
8 Write a JAVA Program Create an enumeration Day of Week with seven values SUNDAY
through SATURDAY. Add a method is Workday( ) to the DayofWeek class that returns true
if the value on which it is called is MONDAY through FRIDAY. For example, the call
DayOfWeek.SUNDAY.isWorkDay ( ) returns false.

34
9 Write a JAVA program which has
i) A Interface class for Stack Operations
ii) A Class that implements the Stack Interface and creates a fixed length Stack.
iii) A Class that implements the Stack Interface and creates a Dynamic length Stack.
iv) A Class that uses both the above Stacks through Interface reference and does the Stack
operations that demonstrates the runtime binding.
10 Write a JAVA program to print a chessboard pattern.
11 Write a JAVA Program which uses FileInputStream / FileOutPutStream Classes.
12 Write JAVA programs which demonstrates utilities of LinkedList Class.
13 Write a JAVA program to implement JDBC operations.
TEACHING METHODS
 PPTs
 Hands-On Sessions Based Teaching
ASSESSMENT METHODS
Experiment Write up + Execution + Viva 20
Lab Record Writing 15
Lab Internals Test 15
Total 50
 Final Exam will be conducted for 50 marks (SEE)
Course Outcomes(CO):
CO1: Understand Java programming language fundamentals and run time environment.
CO2: Gain knowledge and skill necessary to write java programs.
CO3: Learn the object oriented concepts and its implementation in Java.
CO4: Implement the multithreading and client side programming.
CO5: To understand the working procedure of JDBC

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 1 2 1
CO2 2 2 2 1 2 1 1 3
CO3 2 2 2 1 2 1 3
CO4 2 2 2 1 2 1 1 3
CO5 2 2 2 1 2 1 3

Data Structures and Algorithms Laboratory

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – I
Subject Code 22MCA108L CIE Marks 50
Number of Hours/Week 02 Hrs Laboratory SEE Marks 50
SEE Hours 03
CREDITS – 1
COURSEDESCRIPTION
This course introduces students with various data structures and their implementation.
35
PREREQUISITES
Students should have basic knowledge of C programming constructs and should be able to write
basic C programs
Course Objective:
 To understand working principle of different types of data structures
 To identify and apply the appropriate algorithms to solve a given problem.

Laboratory Experiments:
1 Write a C program to Implement the following searching techniques a. Linear Search b.
Binary Search.
2 Write a C program to implement the following sorting algorithms using user defined
functions: a. Bubble sort (Ascending order) b. Selection sort (Descending order).
3 Write a C Program implement STACK with the following operations
a. Push an Element onto Stack
b. Pop an Element from Stack
4 Implement a Program in C for converting an Infix Expression to Postfix Expression.
5 Implement a Program in C for evaluating an Postfix Expression.
6 Write a C program to simulate the working of a singly linked list providing the
following operations:
a. Display & Insert
b. Delete from the beginning/end
c. Delete a given element
7 Obtain the Topological ordering of vertices in a given graph with the help of a c
Programming.
8 Check whether a given graph is connected or not using DFS method using C
Programming.
9 From a given vertex in a weighted connected graph, find shortest paths to other vertices
Using Dijkstra's algorithm (C programming)
10 Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's
algorithm ( C programming)
ASSESSMENT METHODS

Experiment Write up + Execution + Viva 20

Lab Record Writing 15
Lab Internals Test 15
Total 50
Final Exam will be conducted for 50 marks (SEE)
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Perform various sorting and searching techniques.
CO2: Implement various types of data structures, operations and algorithms.
CO3: Work with Stacks, Queues, Circular Queues, Linked Lists, and Trees.
CO4: Design and apply appropriate algorithms for solving computing problems
CO5: Analyze the efficiency of algorithms.

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
36
 1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 1 2 1 3 1
CO2 2 2 2 1 2 1 3 1
CO3 2 2 2 1 2 1 3 1
CO4 2 2 2 1 2 1 3 1
CO5 2 2 2 1 2 1 3 1

UNIX/LINUX Programming Laboratory

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – I
Subject Code 22MCA109L CIE Marks 50
Number of Hours/Week 02Hrs Laboratory SEE Marks 50
SEE Hours 03
CREDITS – 1
COURSE DESCRIPTION:
This course introduces students with basic shell programming concepts.
37
PREREQUISITES
 Students should have knowledge of basic Unix commands.
Course Objective:
 To understand the fundamental design of the UNIX shell programming.
 To be able to design the shell scripts.
Laboratory Experiments:
Explore the Unix environment and Explore vi editor with vim tutor. Perform the
following operations using vi editor, but not limited to:
1. Insert character, delete character, replace character
2. save the file and continue working
3. save the file and exit the editor
4. quit the editor
5. quit without saving the file
6. rename a file
7. insert lines, delete lines,
8. setline numbers
9. search for a pattern
10. move forward and backward
1 Develop a shell script that takes a valid directory name as an argument and recursively
descend all the subdirectories, finds the maximum length of any file in that hierarchy
and writes this maximum value to the standard output.
2 Develop shell script to implement terminal locking (similar to the lock command). It
should prompt the user for a password. After accepting the password entered by the
user, it must prompt again for the matching password as confirmation and if match
occurs, it must lock the keyword until a matching password is entered again by the user,
Note that the script must be written to disregard BREAK, control-D. No time limit
needed to be implemented for the lock duration.
3 Develop a shell script that displays all the links to a file specified as the first argument
to the script. The second argument, which is optional, it can be used to specify in which
the search is to begin. If this second argument is not present, the search is to begin in
current working directory. In either case, the starting directory as well as all of its sub
directories at all levels must be searched. The script need not include any error
checking.
4 Write a shell script that accept one or more file names as argument and convert all of
them to uppercase, provided they exists in current directory.
5 Implement a shell script to list all the files in a directory whose filename is at least 10
characters. (us expr command to check the length)
6 Develop a shell script that accept a list of filenames as its argument, count and report
occurrence of each word that is present in the first argument file on other Argument
files.
7 Develop a shell script that reports the logging in of a specified user within one minute
after he/she login. The script automatically terminate if specified user does not login
during a specified period of time.
8 Develop a shell script that folds long lines into 40 columns. Thus any line that exceeds
40 characters must be broken after 40th, a “\” is to be appended as the indication of
folding and the processing is to be continued with the residue. The input is to be
supplied through a text file created by the user.
9 Write a shell script that accepts the filename, starting and ending line number as an
argument and display all the lines between the given line number.
38
10 Write a shell script that accepts two file names as arguments, checks if the permissions
or these files are identical and if the permissions are identical, output common
permissions and otherwise output each file name followed by its permissions
ASSESSMENT METHODS
Experiment Write up + Execution + Viva 20
Lab Record Writing 15
Lab Internals Test 15
Total 50
 Final Exam will be conducted for 50 marks (SEE)
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Understand the Unix programming environment.
CO2: Be fluent in the use of Vi editor.
CO3: Be able to design and implement shell scripts to manage users with different types of
permission and file based applications.
CO4: Be fluent to write shell scripts.
CO5: Evaluate different commands with sample shell scripts

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 1 2 1 3 1
CO2 2 2 2 1 2 1 3 1
CO3 2 2 2 1 2 1 3 1
CO4 2 2 2 1 2 1 3 1
CO5 2 2 2 1 2 1 3 1

Database Management Systems Laboratory

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – I
Subject Code 22MCA110L CIE Marks 50
Number of Hours/Week 02 Hrs Laboratory SEE Marks 50
SEE Hours 03
CREDITS – 1
COURSE DESCRIPTION
This lab course is to understand the practical applicability of database management system
39
concepts. Working on existing database systems, designing of database, creating relational
database, analysis of table design. To explain basic database concepts, applications, data models,
schemas and instances.
PREREQUISITES
1. Students should know basics of Discrete Mathematics.
2. Students should know basic programming concepts.
COURSE OBJECTIVES
 Students get practical knowledge on designing and creating relational database systems.
Understand various advanced queries execution such as relational constraints, joins, set
operations, aggregate functions, trigger views and embedded SQL.
 To demonstrate the importance of normalization in databases.
DBMS Lab Experiments: Instructions for the Exercises:
1. Draw ER diagram based on given scenario with various Constraints.
2. Create Relational Database Schema based on the above scenario using Mapping Rules.
3. Perform the given queries using any RDBMS Environment.
4. Suitable tuples have to be entered so that queries are executed correctly
5. The results of the queries may be displayed directly
Laboratory Experiments:
1. Create the following tables with properly specifying Primary keys, Foreign keys and solve
the following queries.
BRANCH(Branchid,Branchname,HOD)
STUDENT(USN,Name,Address,Branchid,sem)
BOOK(Bookid,Bookname,Authorid,Publisher,Branchid)
AUTHOR(Authorid,Authorname,Country,age)
BORROW(USN,Bookid,Borrowed_Date)
Queries:
1. List the details of Students who are all studying in 2nd sem MCA.
2. List the students who are not borrowed any books.
3. Display the USN, Student name, Branch_name, Book_name, Author_name,
Books_Borrowed_Date of 2nd sem MCA Students who borrowed books.
4. Display the number of books written by each Author.
5. Display the student details who borrowed more than two books.
6. Display the student details who borrowed books of more than one Author.
7. Display the Book names in descending order of their names.
8. List the details of students who borrowed the books which are all published by the same
Publisher.
2. Design an ER-diagram for the following scenario, Convert the same into a relational
model and then solve the following queries.
Consider a Cricket Tournament “ABC CUP” organized by an organization. In the tournament
there are many teams are contesting each having a Teamid, Team_Name, City, a coach. Each team
is uniquely identified by using Teamid. A team can have many Players and a captain. Each player
is uniquely identified by Playerid, having a Name, and multiple phone numbers, age. A player
represents only one team. There are many Stadiums to conduct matches. Each stadium is identified
using Stadiumid, having a stadium_name, Address (involves city, area_name, pincode).A team can
play many matches. Each match played between the two teams in the scheduled date and time in

40
the predefined Stadium. Each match is identified uniquely by using Matchid. Each match won by
any of the one team that also wants to record in the database. For each match man_of_the match
award given to a player.
Queries:
1. Display the youngest player (in terms of age) Name, Team name, age in which he belongs
of the tournament.
2. List the details of the stadium where the maximum number of matches were played.
3. List the details of the player who is not a captain but got the man_of _match award at least
in two matches.
4. Display the Team details who won the maximum matches.
5. Display the team name where all its won matches played in the same stadium.
3. Consider the following Scenario and design an ER-Diagram, map the designed ER-
diagram into a Relational model.
Consider an organization “ABC” having many employees. An employee works for one
department. Each employee identified by using Empid, having Name, address ( described as
House_no, city, district, state, pin code) and more than one phone numbers. Department identified
by using Dno, having Dname, Dlocation. Each Department having a manager . Each department
having many employees. There are many Projects, each project is controlled by the department.
Each Project uniquely identified by Pno, having Project_name,Project_location. An employee
works on many Projects. Number of hours per week worked on each project by an Employee also
needs to be recorded in the database. A project is worked by many employees. Each employee
supervised by the supervisor. Employee having many dependents. Dependents having the
dependent_name, gender, age, address. Dependents are identified by Empid.
T1(Empid, Emp_Name,city, district, state, pin_code, phoneno, Dno,Dname,Dlocation,
Dept_mgr_id, Pno, Project_name, Project_location, Number_of_Hours,Supervisor_Empid,
Dependent_name, gender, address)
Deduce the above Relation T1 into the 3NF and then solve the following queries.
Queries:
1. Display the details of the employees who are working on both the projects having project_no 5
and 10.
2. Display the details of employees having atleast two dependents.
3. Display the project name on which more number of employees are working.
4. Retrieve the employees who do not have any dependents.
5. Display the Employee details whose total number of hours per week working on various
projects is maximum than all other employees.
6. create a view to display the number of employees working in each department
4. Design an ER-diagram for the following scenario, Convert the same into a relational
model, normalize Relations into a suitable Normal form and then solve the following queries.
A country can have many Tourist places. Each Tourist place is identified by using
tourist_place_id, having a name, belongs to a state, Number of kilometers away from the capital
city of that state, history. There are many Tourists visits tourist places every year. Each tourist is
identified uniquely by using Tourist_id, having a Name, age, Country and multiple emailids. A
tourist visits many Tourist places, it is also required to record the visted_date in the database. A
41
 tourist can visit a Tourist place many times at different dates. A Tourist place can be visited by
many tourists either in the same date or at different dates.
Queries:
1. List the state name which is having maximum number of tourist places.
2. List details of Tourist place where maximum number of tourists visited.
3. List the details of tourists visited all tourist places of the state “KARNATAKA”.
4. Display the details of the tourists visited at least one tourist place of the state, but visited all
states tourist places.
5. Display the details of the tourist place visited by the tourists of all country.
ASSESSMENT METHODS
Experiment Write up + Execution + Viva 20
Lab Record Writing 15
Lab Internals Test 15
Total 50
 Final Exam will be conducted for 50 marks (SEE)
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Apply the basic concepts of Database Systems and Applications.
CO2: Use the basics of SQL and construct queries using SQL in database creation and interaction.
CO3: Design a commercial relational database system (Oracle) by writing SQL using the system.
CO4: Perform embedded and nested queries and implement normal forms.
CO5: Take up real world problems independently

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 1 2 1 3 1
CO2 2 2 2 1 2 1 3 1
CO3 2 2 2 1 2 1 3 1
CO4 2 2 2 1 2 1 3 1
CO5 2 2 2 1 2 1 3 1

Principles of Programming (Bridge Course – Non-credit)

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – I
Subject Code 22MCA111B CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
Credits – 00
COURSE DESCRIPTION
This course provides an understanding C and C++. The course also provides about the structure

42
of c programming with problems as case studies. The course also covers details on structures,
unions and pointers in details with descriptive examples. A part of the course consists of C++
where concepts of object oriented programming like inheritance, classes, objects, exception
handling, and operator overloading.
PREREQUISITES
 Student should know the concepts of algorithms, computer basics, and computer
architectures.
 Student should know about fundamentals of Data flow diagrams and pseudo codes.
COURSE OBJECTIVES
 To understand the fundamentals of C programming language.
 To understand the fundamentals of C++ programming language.
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
C Programming: decision making, control structures and arrays
Decision making with if statement, simple if statement, the if..else statement,
nesting of if..else statements, the else..if ladder, the switch statement, the ?:
operator, the goto statement, the break statement, programming examples. The
while statement, the do...while statement, the for statement, nested loops, jumps in
loops, the continue statement, programming examples.1D and 2D arrays,
declaration and initialization of arrays, reading , writing and manipulation of above
types of arrays.
Module 2 08 Hours
Structures
Defining a structure, declaring structure variables, accessing structure members,
structure initialization, copying and comparing structure variables, and operations
on individual members, array of structures, structures within structures, structures
and functions, Unions, size of structures.
Module 3 06 Hours
Pointers
Pointers in C, Declaring and accessing pointers in C, pointers in C++, Pointer as
function arguments, Dynamic Allocation Operators new and delete, Initializing
Allocated Memory, Allocating Arrays, Allocating Objects.
Module 4 09 Hours
Classes & Objects: Introduction, Class Specification, Class Objects, access
members, defining member functions, data hiding, constructors, destructors,
parameterized constructors, static data members, static member functions, scope
resolution operator, Passing Objects to Functions, Returning Objects, Object
Assignment.
Operator overloading: Overloading, Function overloading, Operator
overloading, overloading of binary operators like +, -, *.
Inheritance: Base Class, Inheritance & protected members, protected base class
inheritance, inheriting multiple base classes, Constructors, Destructors &
Inheritance. Passing parameters to base Class Constructors, Granting access,
Virtual base classes.
Module 5 09 Hours
Exception Handling: Exception Handling, Fundamentals, Catching Class Types,
Using Multiple catch Statements, Handling Derived- Class Exceptions, Exception
43
Handling Options, Catching All Exceptions, Restricting Exceptions, Rethrowing
an Exception, Understanding terminate( ) and unexpected( ),
uncaught_exception( ) Function, The exception and bad_exception Classes,
Applying Exception Handling.
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module
Text Books:
1. Object oriented programming with C++, E. Balaguruswamy, Tata McGrawHill.
2. Herbert Schildt: C++ The Complete Reference, 4th Edition, Tata McGraw Hill,2014.
3. K R Venugopal, Rajkumar Buyya,T Ravishanker: Mastering C++
Reference Books:
1. Programming in ANSI C, E Balaguruswamy, 7th Edition, McGraw Hill.
2. The Complete Reference, Herbert Schild,4th Edition, MacGrawhill.
TEACHING METHODS
 PPTs
 Hands-On Sessions Based Teaching
ASSESSMENT METHODS
 Three Internals are conducted for 30 Marks each and weightage of 40%, 40% and 20%
from 1st, 2nd and 3rd internals respectively are taken.
 Evaluation of learning activity based on Programming Assignments for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks
Course Outcome(CO):At end of this Course, student will be able to
CO1: Understand Basics of C Programming such as decision making , control statements and
arrays
CO2: Understand Structures, Arrays and Unions in C programming.
CO3: Implement the concept of pointers in C++ programming
CO4: Analyse the working of Classes & Object, Operator overloading and Inheritance.
CO5: Demonstrate Exception handling in C++

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 1 1
CO2 1 2 2 1 1 1
CO3 2 2 1 1 1
CO4 1 2 2 1 1 1
CO5 2 2 2 1 1 1

44
 Python Programming
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – II
Subject Code 22MCA201 CIE Marks 50
Number of Lecture Hours/Week 04 SEE Marks 50
Total Number of Lecture Hours 50 SEE Hours 03
CREDITS – 04
COURSE DESCRIPTION:
This course provides an in-depth knowledge of basic Python Programming Language and also provides
45
an insight on Python data structures, working of and arrays, numerical analysis and data manipulation
in python.
PREREQUISITES
 Students should have a basic knowledge of any programming language
 Students should know basic data visualization techniques.
Course Objective:
 To acquire programming skills in core Python.
 To acquire Object Oriented Skills in Python
 To develop the skill of designing Graphical user Interfaces in Python
 To develop the ability to write database applications in Python
COURSE CONTENTS
Modules Teaching
Hours
Module 1 10 Hours
Python Basic Concepts and Programming: Program Structure, Identifiers, Keywords,
Variables, Operators, Precedence and Associativity, Mutable and Immutable Data Types,
Indentation, Comments, Reading Input, User Input, Print Output, the type () Function and
Is Operator.
Statements: Control flow statements, Iterative statements, Conditional statements, the
continue and break Statements, Built-In Functions, Commonly Used Modules.
Function Definition and Calling the Function, The return Statement and void Function,
Scope and Lifetime of Variables, Positional Arguments, Keyword arguments, Variable
length arguments Default Parameters, Command Line Arguments. Anonymous
Functions, Generators and Decorators.
Module 2 10 Hours
Data Structures: List, dictionary, set and generator-comprehensions. Basic List
Operations, Indexing and Slicing in Lists, Built-In Functions Used on Lists, List
Methods. Strings- Creating and Storing Strings, Basic String Operations, Accessing
Characters in String by Index Number, String Slicing and Joining, String Methods,
Formatting Strings, Creating Sets, Tuples and Dictionaries and basic methods.
File handling: Basic file handling methods, reading and writing files, File Input/output,
deleting and copy functions.
Exception Handling: Errors, Python Try Except, finally. Rising of an exception, Many
Exceptions, working of else with exception.
Module 3 10 Hours
OOP’s Programming with python: Classes, objects, Constructors and Destructors, self
and del keywords, access to Attributes and Methods, geattr and hasattr attributes, Data
abstraction, Encapsulation, Inheritance and types, Overloading, Polymorphism, Python
Iterators.
Working with modules: Creating and importing modules, Built-in modules, dir ()
function, RegEx module and function with metacharacters, Python JSON module, JSON
string conversions. Introduction to Package and working of pip.
Module 4 10 Hours
Numerical Analysis with Numpy Arrays: Introduction to Numpy, Array Creation with
Numpy, Array Indexing, Array Slicing, A Multidimensional array objects, Computation
on Numpy object. Numpy Data types, Numpy copy vs view, Array Iteration.
Numpy Array Join, Split, Search and filter.
Universal functions in Numpy: Introduction to ufunc, Creation, Arithmetic functions,
46
Log, Trigonometric functions, Aggregate functions, Set operations with Numpy.
Web Scraping: Data Acquisition by Scraping web applications –Submitting a form -
Fetching web pages – Downloading web pages through form submission, Difference
between Web scraping and Web crawling.
Module 5 10 Hours
Data Manipulation with Pandas: Introduction to pandas, Panda’s Series, creating a
Series object with list, dictionary and ndarrays, indexing and Labeling. Introduction to
pandas Dataframe, Load files in to Dataframe, Index objects.
Pandas Analyzing Data: Reading of CSV files, Reading of JSON files. Viewing the
data and info, head (), tail (), iloc () methods.
Data Cleaning with Pandas: Handling Empty sets, Data in wrong format, Wrong data,
Handling Duplicates. Data Correlations with Pandas and its types
Data Visualization with Pandas: Matplotlib package – Plotting Graphs – Controlling
Graph.
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each module
Text Books:
1. Introducing Python- Modern Computing in Simple Packages – Bill Lubanovic, O ‘Reilly
Publication
2. Wes Mc Kinney, “Python for Data Analysis”, O'Reilly Media, 2012.
3. Jake Vander plas, “Python Data Science Handbook: Essential tools for working with data”, O
‘Reilly Publishers, I Edition.
Reference Books:
1. Learning Python, Mark Lutz, Fifth Edition, O’Reilly Publication,2017
2. Exploring Python, Timothy A. Budd, Mc Graw Hill Education, 2011
3. How to Think Like a Scientist –Learning with Python “, Allen Downey, Jeffrey Elkner, Chris
Meyers, Green Tea Press, 2002, First Edition.
4. llen B. Downey, “Think Python: How to Think Like a Computer Scientist ‘‘, 2nd edition,
Updated for Python 3, Shroff/O‘Reilly Publishers, 2016
(http://greenteapress.com/wp/thinkpython/)
TEACHING METHODS
 PPTs
 Hands-On Sessions Based Teaching

ASSESSMENT METHODS
 Three Internals, 30 Marks each will be conducted and the weightage of 40%, 40% and 20%
from 1st, 2nd, and 3rd internals will be taken.
 Evaluation for Learning Activity based on Programming Assignments for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Understand and Comprehend the Basics Concepts of Python Programming.
CO2: Understand the working of Python Data structures, File handling and Exception Handling.
CO3: Apply Python Collection Objects, Object-Oriented Features, Python modules to develop Python
Applications.
47
 CO4: Implement Numpy Arrays for Numerical Analysis and perform Data Scraping with Python.
CO5: Implement Data Manipulation and Data Visualization with Pandas.

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 3 1
CO2 3 1 1 3 1
CO3 1 3 1 3 1 1 1 3 1
CO4 1 3 1 1 1 1 1 3 1
CO5 1 3 1 1 1 1 1 3 1

Web Programming
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – II
Subject Code 22MCA202 CIE Marks 50
Number of Lecture Hours/Week 04 SEE Marks 50
Total Number of Lecture Hours 50 SEE Hours 03
CREDITS – 04
COURSE DESCRIPTION
The course enables students to develop various Web applications and gain knowledge of
48
current and emerging technologies and practices.
PREREQUISITES
 Students should know the basics of Object oriented programing concepts and html.
COURSE OBJECTIVES
To familiarize the students with client and server-based Web scripting and dynamic Web
application development.
Modules Teaching
Hours
Module 1 10 Hours
Introduction to XHTML and CSS: Basic syntax, Standard structure, Basic
text mark-up, Images, Hypertext Links. Lists, Tables, Forms, Frames,
Syntactic differences between HTML and XHTML.
Cascading Style Sheets: Introduction, Levels of style sheets, Style
specification formats, Selector forms, Property value forms, Font properties,
List properties, Colour, Alignment of text, The box model, Background
images, The <span> and <div> tags, Conflict resolution.
Module 2 12 Hours
The basics of JavaScript: Overview of JavaScript, Object orientation and
JavaScript, general Syntactic Characteristics, Primitives, Operations and
Expressions, Screen Output and Keyboard Input, Control Statements, Object
Creation and Modification, Arrays, Functions, Constructors, Pattern
matching using Regular Expressions, Errors in Scripts.
Java Script and XHTML Documents: The JavaScript Execution
Environment, The Document Object Model, Elements Access in Java Script,
Events and Event Handling, Handling Events from Body Elements, Handling
Events from Text Box and password Elements, The DOM2 Event Model,
The navigator Object, Dom Tree Traversal and Modification.
08 Hours

Module 3

Introduction to XML: Introduction, Syntax, Document Structure,

Document type definitions, Namespaces, XML schemas, displaying raw
XML documents, Displaying XML documents with CSS, XSLT style sheets,
XML processors, Web services.

Module 4 10 Hours
Introduction to PHP and Building Web applications with PHP: Origins
and uses of PHP, Overview of PHP, General syntactic characteristics,
Primitives, operations and expressions, Output, Control statements, Arrays,
Functions, Pattern matching, Form handling, Files, Tracking users, cookies,
sessions, Using Databases, Handling XML.
Module 5 10 Hours
Introduction to Angular JS: Directives, Expressions, Directives,
49
Controllers, Filters, Services, Events, Forms, Validations, Examples.
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from
each module.
Text Books:

1. Robert W. Sebesta: Programming the World Wide Web, 4 th Edition, Pearson

education, 2012.
2. Complete Angular Js Guide with Examples by Krishna Rungta
Reference Books:

1. Chris Bates: Web Programming Building Internet Applications, 3rd Edition, Wiley
India, 2006.
2. M. Deitel, P. J. Deitel, A. B. Goldberg: “Internet & World Wide Web How to
Program”, 3rd Edition, Pearson Education/PHI, 2004.
3. Jeffrey C. Jackson: Web Technologies-A Computer Science Perspective, Pearson
Education, 7thImpression, 2012.

TEACHING METHODS
 PPTs
 Hands-On Sessions
 Black Board
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and Weightage of 40%, 40%
and 20% from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation for Learning Activity based on Programming Assignments/ Mini Project
for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Learn to write well-structured, easily maintained, standards-compliant, web pages
using XHTML and CSS code.
CO2: Use JavaScript to add dynamic content to pages that meet specific needs and
interests.
CO3: Use XML for enhanced web interaction and applications
CO4: Create dynamic web applications using PHP and MYSQL
CO5: Use AngularJS to create dynamic pages.

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
50
CO1 3 2 2 1 1 1 3
CO2 2 2 2 2 1 1 3
CO3 2 2 2 2 1 1 3
CO4 2 2 2 2 1 1 3
CO5 2 2 2 2 1 1 3

Mobile Applications
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – II
Subject Code 22MCA203 CIE Marks 50
Number of Lecture Hours/Week 04 SEE Marks 50
Total Number of Lecture Hours 50 SEE Hours 03
CREDITS – 04
COURSE DESCRIPTION
This course is intended to provide students with the skills required to design software artifacts
by using latest technologies, Android Frameworks for designing Mobile Apps, Flutter
framework for Android and iOS Applications.
PREREQUISITES
 Students should know basics of XML.
 Students should know C, C++, and Java Programming Concepts.
COURSE OBJECTIVES
Android Application Development course is designed to quickly get you up to speed with
writing apps for Android devices. The student will learn the basics of Android and Flutter
Frameworks and get to understand the application lifecycle.
Modules Teaching
Hours
Module 1 10 Hours
Introduction
Preliminary Considerations – Cost of Development, Importance of Mobile
Strategies in the Business World, Effective use of Screen Real Estate,
Understanding Mobile Applications Users, Understanding Mobile Information
Design, Understanding Mobile Platforms, Using the Tools of Mobile Interface
Design.
Module 2 10 Hours
Getting Started with Android Programming
What is Android? Obtaining the required tools, Anatomy of an Android
Application, Components of Android Applications, Activities, Fragments,
Utilizing the Action Bar.
Module 3 10 Hours
Android UI Design and Location Based Services
Views and View Groups, Basic Views, Displaying Maps, Getting Location
Data, Preparing for Publishing, Deploying APK Files.
Module 4 10 Hours
Android Messaging and Networking:
SMS Messaging, Sending Email, Networking , Downloading Binary Data, Text
files, Accessing Web Services, Performing Asynchronous
Call, Creating your own services, Communicating between a service and an
activity, Binding activities to services.
51
Module 5 10 Hours
Flutter and IOS :
Flutter: Introduction, Installation, Creating Simple Application in Android
Studio, Architecture Application, Introduction to Dart Programming, Widgets,
Layouts, Gestures.
IOS: Obtaining the tools and SDK, Components of XCODE, Architecture of
iOS, Objective C and Swift Programming Languages.
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from
each module.
Text Book:
1. Jeff McWherter and Scott Gowell, “Professional Mobile Application Development”,
1st Edition, 2012.
2. Wei-Meng Lee, “Beginning Android Application Development”, Wiley 2011.
Reference Books:
1. Reto Meier, “Professional Android 4 Application Development”, Wrox Publications
2012.
2. Rap Payne, “Beginning App Development with Flutter: Create Cross-Platform Mobile
Apps”, 1st Edition, Publications 2019.
TEACHING METHODS
 PPTs
 Hands-On Sessions
 Black Board
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and Weightage of 40%, 40% and
20% from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation for Learning Activity based on Programming Assignments/ Mini Projects/
Case Studies for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
COURSE OUTCOMES
At End of the Course Student will Be Able to
CO1: Illustrate effective user interfaces that leverage evolving mobile device capabilities.
CO2: Develop applications using different SDK frameworks and toolkits.
CO3: Establish various methods to integrate database and server-side technologies.
CO4: Design and develop open source software based mobile applications.
CO5: Build and deploy competent mobile development solutions.

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 1 2 1 1 3
CO2 1 3 1 2 1 1 1 3
CO3 2 2 1 1 1 1 3
CO4 1 2 2 2 1 1 1 3
52
CO5 1 3 1 3 1 1 1 3

Computer Networking & Communications

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER - II
Subject Code 22MCA2041E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
CREDITS – 03
COURSE DESCRIPTION
This course is aimed to introduce the modern network architectures, Layered models, IP addresses.
It also covers all protocols, transmission media and Routing concepts.
PREREQUISITES
 Students should know Topologies of Network.
 Students should know basic knowledge of Computer Hardware and Networking
Components.
COURSE OBJECTIVES
 To Develop An Understanding Of Modern Network Architectures From A Design And
Performance Perspective.
 To Introduce The Student To The Major Concepts Involved In Wide-Area Networks
(WANs), Local Area Networks (WLANs) And Wireless LANs (WLANs).
 To Provide An Opportunity To Do Network Programming
 To Provide A WLAN Measurement Ideas.
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
Introduction: Network Applications, Network Hardware.
Reference Models: OSI reference model, TCP/IP reference model.
The Physical Layer: Guided Transmission Media, Wireless Transmission Media,
Digital modulation and Multiplexing, Mobile telephone systems (1G, 2G, 3G and
4G).
Module 2 08 Hours
Data Link layer: Data link layer design issues, Error Detection Schemes: Parity,
Checksum, CRC. Data Link Protocols: Simplex, Simplex Stop and Wait for an error-
free channel and Noisy channel, Sliding window protocols: one bit sliding window,
Go Back N and Selective repeat.
Module 3 08 Hours
Medium Access Control Sub Layer: The Channel Allocation Problem, Multiple
access protocols: ALOHA, Collision free protocols: Bit Map and Token Passing;
RFID: EPC Gen 2 Architecture, EPC Gen 2 Physical Layer, EPC Gen 2 Tag
Identification Layer, Tag Identification Message Formats.
Module 4 08 Hours
Network Layer: Network Layer Design issues, Routing algorithms: Optimality
53
 Principle, Shortest Path, Flooding, Distance Vector Link State; Internetworking, The
Network Layer in the Internet: IPV4, IP addresses, IPV6.
Module 5 08 Hours
The Transport Layer: Elements of Transport Protocols: Error Control and Flow
Control, Multiplexing, Crash Recovery; Congestion Control; UDP: Remote
Procedure Call Real-Time Transport Protocols; TCP: TCP Service Model, TCP
Protocols.
The application Layer: Introduction, DNS: Domain Name Space, Domain Name
Records, Name Servers; The World Wide Web: web applications, HTTP, mobile
web; Content Delivery: Server Farms and Web Proxies.
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module
Text Books:
1. “Computer Networks” by Andrew S Tanenbaum, David J Wetheral, 5th Edition, Pearson
2011
2. “Data and Computer Communications” by William Stallings , Above 7th Edition , 2004
Reference Books:
1. Behrouz A. Forouzan, Data Communications and Networking, Tata McGraw-Hill 5th
Edition, 2017.
2. James F. Kurose and Keith W. Ross, Computer Networking- A Top-Down Approach
featuring the Internet, 7th Edition, Pearson, 2016.
TEACHING METHODS
 Black Board –Microteaching Method
 Hands-On Sessions Based Teaching
 PowerPoint Presentation
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and Weightage of 40%, 40% and 20%
from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation for Learning Activity is based on Seminars/ Case Studies for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
COURSE OUTCOMES: At End of the Course Student will Be Able to
CO1: Understand the various applications & Communication medias.
CO2: Compare various Error detection and Correction techniques, Understand Internet Control
protocols and Internet transport protocols in computer network.
CO3: Comprehend different network layer functionalities. Compare various Routing and Congestion
control algorithms.
CO4: Analyze the working of transport layer and application layer.
CO5: Understand the concept of packet tracer

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 3

54
CO2 3 2 1 1 3
CO3 3 2 2 1 1 3
CO4 2 2 2 2 1 1 3
CO5 2 2 1 1 3

Introduction to Data Science

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – II
Subject Code 22MCA2042E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
CREDITS – 03
COURSE DESCRIPTION
 This course provides an insight of Data Science and the data analysis
process
PREREQUISITES
 Students should know basics terminology of Data Science
 Students should know basics of DBMS and ML concepts.
COURSE OBJECTIVES:
 Understand Data Science process
 Be aware of the Exploratory data analysis techniques
 Understand ML algorithms and its applications.
COURSE CONTENTS
Teaching
Modules
Hours
Module 1 08 Hours
Introduction: What is Data Science? Big Data and Data Science hype – and
getting past the hype, why now? – Datafication, Current landscape of
perspectives, Skill sets. Needed Statistical Inference: Populations and
samples, Statistical modelling, probability distributions, fitting a model, -
Introduction to R
Module 2 08 Hours
Exploratory Data Analysis and the Data Science Process: Basic tools (plots,
graphs and summary statistics) of EDA, Philosophy of EDA,The Data
Science Process, Case Study: Real Direct (online real estate firm). Three
Basic Machine Learning Algorithms: Linear Regression, k-Nearest
Neighbours (kNN), k-means
Module 3 08 Hours
One More Machine Learning Algorithm and Usage in Applications:
Motivating application: Filtering Spam, Why Linear Regression and k-NN
are poor choices for Filtering Spam, Naive Bayes and why it works for
Filtering Spam, Data Wrangling: APIs and other tools for scrapping the Web
Module 4 08 Hours
Feature Generation and Feature Selection (Extracting Meaning from Data):
Motivating application: user (customer) retention. Feature Generation
(brainstorming, role of domain expertise, and place for imagination), Feature
Selection algorithms. Filters; Wrappers; Decision Trees; Random Forests.
55
Recommendation Systems: Building a User-Facing Data Product,
Algorithmic ingredients of a Recommendation Engine, Dimensionality
Reduction, Singular Value Decomposition, Principal Component Analysis,
Exercise: build your own recommendation system
Module 5 08 Hours
Mining Social-Network Graphs: Social networks as graphs, Clustering of
graphs, Direct discovery of communities in graphs, Partitioning of graphs,
Neighborhood properties in graphs, Data Visualization: Basic principles,
ideas and tools for data visualization. Data Science and Ethical Issues,
Discussions on privacy, security, ethics, Next-generation data scientists
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from
each module.
Text Books:
1. Doing Data Science Cathy O’Neil and Rachel Schutt, Straight Talk from The
Frontline O’Reilly 2014
2. Mining of Massive DatasetsV2.1 Jure Leskovek, Anand Rajaraman and Jeffrey
Ullman Cambridge University Press, 2nd Edition 2014
3. Data Mining: Concepts and Techniques Jiawei Han, Micheline Kamber and Jian
Pei Morgan Kauffman, Third Edition, 2012
TEACHING METHODS
 PPTs
 Hands-On Sessions Based Teaching
ASSESSMENT METHODS
 Three Internals, 30 Marks each will be conducted and the weightage of 40%, 40%
and 20% from 1st, 2nd, and 3rd internals will be taken.
 Evaluation of Programming Assignments for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Understand and explain the underlying principles of Data Science
CO2: Understand the Exploratory Data Analysis and Data Science Process
CO3: Impart knowledge about Machine Learning Algorithms and its tools
CO4: Understand the adequate knowledge of feature generation and feature extraction
methods
CO5: Understand the basics of Social Mining

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 3
CO2 3 1 1 3
CO3 3 2 1 1 3
CO4 3 2 1 1 3
56
CO5 3 1 1 3

Fundamentals of Cryptography and Network Security

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – II
Subject Code 22MCA2043E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
Credits – 03
COURSE DESCRIPTION
This course provides an in-depth knowledge of definitions of cryptography and network
security, conventional cryptographic algorithms, block cipher cryptosystems, public
cryptosystems, key management systems, authentication techniques to provide secure
communication.
PREREQUISITES
 Students should have the knowledge of Computer Networks
 Students should have knowledge of Mathematics and Algorithm Concepts.
COURSE OBJECTIVES
 To Understand the basic concepts of cryptography and network security and classify
attacks on a network.
 To Understand and analyze the different process for hiding the information with
conventional cryptographic algorithms.
 To Understand various block cipher cryptosystems
 To Analyze public cryptosystems and key management Systems
 To Understand and apply authentication techniques to provide secure communication
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
Introduction:
Service mechanisms and attacks, The OSI security architecture, A Model for
Network Security. Symmetric Ciphers: Symmetric cipher model, substitution
techniques.
Module 2 08 Hours
Symmetric Ciphers:
Transposition techniques, Steganography. Block Ciphers and DES: Simplified
DES. Block cipher principles, DES, Strength of DES, Block cipher design
principles.
Module 3 08 Hours
Block cipher modes of operation.
AES Cipher-Substitute Bytes Transformation, Shift Row Transformation, Mix
Column Transformation, Add Round Key Transformation, AES key expansion.
Module 4 08 Hours
Public key cryptography and RSA:
Principles of public key cryptosystems, RSA algorithm. Other public key
cryptosystems and key management: key management, Diffie-Hellman key
exchange. Elliptic Curve Cryptography.

57
Module 5 08 Hours
Network Security Applications: Authentication Applications: Kerberos, X.509
Authentication Service. Electronic Mail Security: PGP.
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. Cryptography and Network Security: William Stallings, Pearson Education, 2003
2. Behrouz A Forouzan, Debdeep Mukhopadhyay: Cryptography and Network Security,
2nd Edition, Special Indian edition, Tata McGraw-Hill, 2011.
Reference Books:
1. Network Security and Cryptography, Bernard Meneges, Cengage Learning
2. Cryptography and Network Security, Atul Kahate, TMH, 2003
TEACHING METHODS
 Black Board –Microteaching Method
 Hands-On Sessions Based Teaching
 PowerPoint Presentation
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and Weightage of 40%, 40% and
20% from 1st, 2nd and 3rd internals respectively will be taken.
 Learning Activity will be based on Assignments/ Case Studies for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Understand the basic concepts of cryptography and network security and classify attacks
on a network, symmetric ciphers and substitution techniques.
CO2: Understand and Analyze the different process for hiding the information with
Conventional cryptographic algorithms, transposition techniques and block ciphers.
CO3: Illustrate the various block cipher cryptosystems like DES and AES
CO4: Analyze public cryptosystems and key management Systems.

CO-PO-PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 3
CO2 3 3 2 2 1 1 1 3
CO3 3 2 1 1 1 1 3
CO4 3 2 1 1 1 3

58
 Cloud Computing
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – II
Subject Code 22MCA2051E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
Credits – 03
COURSE DESCRIPTION
This course provides a method to delivery different types of computing services—including
servers, storage, databases, networking, software, analytics, and intelligence—over the
Internet (“the cloud”) to offer faster innovation, flexible resources, and economies of scale
PREREQUISITES
 Students should know basics of architecture and programming in cloud services.
 Students should know the Knowledge of Agile Development
COURSE OBJECTIVES
 To explain cloud computing, virtualization and classify services of cloud computing
 To analyze the components of cloud computing and its business perspective.
 To Demonstrate different features of cloud platforms used in Industry
 To describe the platforms for development of cloud applications and List the
application of cloud.
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
Introduction.
Overview of Computing Paradigm - Recent trends in Computing - Grid
Computing, Cluster Computing, Distributed Computing, Utility Computing,
Cloud Computing - Evolution of cloud computing - Cloud Computing (NIST
Model). High-performance computing, Introduction to GreenCloud.
Module 2 08 Hours
Introduction to virtualization
Definition, virtualization, Different approaches to virtualization. Hypervisors,
Basics of VMWare, advantages of VMware virtualization, using VMware
workstation, creating virtual machines-understanding virtual machines, create a
new virtual machine on local host, cloning virtual machines, virtualize a
physical machine, starting and stopping a virtual machine.
Module 3 08 Hours
Infrastructure as a Service (IaaS).
Introduction- IaaS, Machine Image, Virtual Machine(VM) - Resource
Virtualization – Server, Storage, Network, Virtual Machine(resource)
provisioning and manageability, storage as a service, Data storage in cloud
computing (storage as a service) - Examples - Amazon EC2 - Renting, EC2
Compute Unit, Platform and Storage, pricing, customers – Eucalyptus
Module 4 08 Hours
Platform as a Service (PaaS) & Software as a Service (SaaS)
Introduction, Service Oriented Architecture (SOA) - Cloud Platform and

59
Management – Computation, Storage – Examples - Google App Engine,
Microsoft Azure, SalesForce.com, Force.complatform-Software as a Service
(PaaS)-Introduction to SaaS-Webservices-Web2.0- WebOS-Case Study on
SaaS.
Module 5 08 Hours
Cloud Simulators- CloudSim and GreenCloud.
Introduction to Simulator, understanding CloudSim simulator, CloudSim
Architecture(User code, CloudSim, GridSim, SimJava) Understanding Working
platform for CloudSim, Introduction to IoT cloud platforms like Open Shift,
KaaS.
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module
Text Books:
1. Rajkumar Buyya, James Broberg, Andrzej M. Goscinski, Cloud Computing: Principles
and Paradigms, Wiley, 2011.
2. Ronald L.Krutz, Russell Dean Vines, Cloud Security: A Comprehensive Guide to
Secure Cloud Computing, Wiley- India, 2010.
Reference Books:
1. Rajkumar Buyya, Christian Vecchiola, S. Thamarai Selvi, Mastering Cloud
Computing, Mc Graw Hill Education, 2013.
2. Nikos Antonopoulos, Lee Gillam, Cloud Computing: Principles, Systems and
Applications, Springer, 2012.
3. Barrie Sosinsky, Cloud Computing Bible, Wiley-India, 2010.
TEACHING METHODS
 Black Board –Microteaching Method
 Hands-On Sessions Based Teaching
 PowerPoint Presentation
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and Weightage of 40%, 40% and
20% from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation for Learning Activity based on Case Studies for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Understand the cloud computing delivery model and the enabling technologies.
CO2: Explain and cloud computing platforms, key technology drivers and cloud
programming/software environments
CO3: Identify the need for cloud computing model and compare various key enabling
Technologies.
CO4: Analyze and choose an appropriate programming environment for building cloud
Applications

60
CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 3
CO2 3 1 1 3
CO3 3 1 1 3
CO4 2 2 2 2 1 1 3

61
 Artificial Intelligence & Expert Systems
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – II
Subject Code 22MCA2052E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
Credits – 03
COURSE DESCRIPTION
This course provides an understanding of Artificial Intelligence Systems, and its Applications.
The course also provides the knowledge of Knowledge representation, Problems, Logic,
Statistical Reasoning, Symbolic Reasoning and Expert Systems for the development of AI
Systems.
PREREQUISITES
 Students should know basics of Mathematical Structures, basics of Statistics and basic
models.
 Students should know theoretical concepts of application development.
COURSE OBJECTIVES
 To understand the fundamentals of Artificial Intelligence systems.
 To design AI applications using Algorithms and Intelligent Systems.
 To understand the logic, reasoning and theories of AI & Expert Systems.
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
What is Artificial Intelligence: The AI Problems, The Underlying
assumption, AI Technique, The Level of the model, Criteria for Success
Problems, problem spaces, and search: Defining, the problem as a state space
search, Production systems, Problem characteristics, Production system
characteristics, Issues in the design of search programs, Additional Problems.
Module 2 12 Hours
Knowledge representation issues: Representations and mappings, Approaches
to knowledge representation, Issues in knowledge representation, The frame
problem.
Inference – Backward chaining, forward chaining, Rule value approach, Fuzzy
reasoning.
Using predicate logic: Representing simple facts in logic, representing instance
and ISA relationships, Computable functions and predicates, Resolution,
Natural Deduction.
Module 3 08 Hours
Expert Systems: Expert Systems – Architecture of Expert Systems, Roles
of Expert Systems – Knowledge Acquisition – Meta Knowledge, Heuristics.
Typical Expert Systems – MYCIN, DART, XCON, Expert Systems Shells.
Module 4 12 Hours
Learning in Neural Networks: Fundamentals of neural networks – model of an
artificial neuron – neural network architectures – Learning methods – Taxonomy
of Neural network architectures – Standard back propagation algorithms –
selection of various parameters – variations Applications of back propagation
algorithms.

62
Module 5 8 Hours
Natural Language Processing: Overview of Linguistics, Grammars and
Languages, Basic Parsing Techniques, Semantic Analysis and Representation
Structures, Natural Language Generalization, Natural Language Systems,
Recognition and Classification Process.
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module
Text Books:
1. Elaine Rich, Kevin Knight, Shivashankar B Nair: Artificial Intelligence, Tata
McGraw Hill 3rd edition. 2013.
2. Dan W. Patterson, “Introduction to AI and ES”, Pearson Education, 2007.
Reference Books:
1. Nils J. Nilsson: “Principles of Artificial Intelligence”, Elsevier, ISBN-
13: 9780934613101.
2. Stuart Russel, Peter Norvig: Artificial Intelligence A Modern Approach, Pearson 3rd
edition 2013.
3. Peter Jackson, “Introduction to Expert Systems”, 3rd Edition, Pearson Education,
2007.
4. http://nptel.ac.in (Web Reference)
TEACHING METHODS
 ICT based Teaching Learning Methods.
 Presentation Methods.
 Self-Learning by assigned activities.
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and Weightage of 40%, 40% and
20% from 1st, 2nd and 3rd internals respectively will be taken.
 Learning Activity will be based on Case study for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Identify problems that are amenable to solution by AI methods.
CO2: Identify Issues and Approaches for Knowledge representation.
CO3: Applying the Principles of Probabilistic methods for solving AI Problems.
CO4: Using Expert Systems for Knowledge Representation and Heuristics.
CO5: Apply Learning Methods to Solve AI Problems.

63
CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 3
CO2 3 1 1 3
CO3 2 2 1 1 1 1 1 3
CO4 2 2 1 1 1 1 1 1 3
CO5 2 2 1 1 1 1 1 1 3

Cyber Security
64
 [As per Choice Based Credit System (CBCS) scheme]
SEMESTER – II
Subject Code 22MCA2053E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
CREDITS – 03
COURSE DESCRIPTION
Cyber security is the practice of protecting networks, computer systems, and data from
malicious attacks. This course helps students develop a deeper understanding of modern
information and cyber security challenges, mitigation techniques and tools.
PREREQUISITES
 Basics of computer networks
 Basic unix/linux commands
COURSE OBJECTIVES
 The courses presents the basic cyber security concepts and security tools used.
 Students will learn how to defend against cyber threats and attacks and study
existing techniques for managing security issues and maintaining the working
environment.
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
Introduction to Cybercrime and Laws
Introduction, Cybercrime: Definition and Origins of the word, Cybercrime
and information Security, Who are Cybercriminals? Classifications of
Cybercrimes. How Criminals Plan Them – Introduction, How Criminals Plan
the Attacks, Cybercafé and Cybercrimes, Botnets, Attack Vector, The Indian
IT ACT 2000 and amendments.
Module 2 08 Hours
Tools and Methods used in Cybercrime
Introduction, Proxy Server and Anonymizers, Password Cracking, Key
loggers and Spyware, Virus and Warms, Trojan and backdoors,
Steganography, DOS and DDOS attack, SQL injection, Buffer Overflow.
Module 3 08 Hours
Systems Vulnerability
Scanning Overview, Open Port/Service Identification, Banner/Version
Check, Traffic Probe, Vulnerability Probe, Vulnerability Examples,
OpenVAS, Metasploit. File System Monitoring: File System Metadata
Module 4 08 Hours
Command-Line Environments:
Unix Command Lines, Windows Power Shell Netcat: Net Cat Commands,
Net Cat Uses, Port Forwarding and Redirection: SSH, Data Pipe, Fpipe,
Network Reconnaissance – Nmap, Network Snifers and Injectors: Tcpdump
and winDump
Module 5 08 Hours
Network Defense tools
Firewalls and Packet Filters: Firewall Basics, Packet Filter Vs Firewall, How
a Firewall Protects a Network, Packet Characteristic to Filter, Stateless Vs
Stateful Firewalls, Network Address Translation (NAT) and Port
65
Forwarding, the basic of Virtual Private Networks, Linux Firewall, Windows
Firewall, Snort: Intrusion Detection System,
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from
each module.
Text Book:
1. Mike Shema, “Anti-Hacker Tool Kit (Indian Edition)”, McGraw Hill Education.
2. Nina Godbole, Sunit Belpure, “Cyber Security: Understanding Cyber Crimes,
Computer Forensics and Legal Perspectives”, Publication Wiley.
Reference Books:
1. Marjie T. Britz, “Computer Forensics and Cyber Crime: An
Introduction”, Pearson.
2. Chwan-Hwa Wu and J. David Irwin, “Introduction to Computer Networks and
Cyber security”, CRC Press.
3. Amelia Phillips, Bill Nelson, Christopher Steuart, “Guide to Computer Forensics
and Investigations”, Cengage Learning.
TEACHING METHODS
 PPTs
 Black Board
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and Weightage of 40%, 40%
and 20% from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation for Learning Activity is based on Quiz/ Case studies/ Seminars for 20
Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Know the source of information on cyber-crimes.
CO2: Describe Information Technology act and Related Legislation.
CO3: Describe typical threats to modern digital systems, and to outline techniques of
defense against each threat
CO4: Learn the vulnerability exploits.
CO5: Learn the usage of tools for everything from improving command-line skills to
testing the security of operating systems, networks, and applications.

CO-PO-PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 3
CO2 3 1 1 1 3
CO3 3 1 1 1 3
CO4 3 2 1 1 1 3
CO5 3 3 1 1 3 3
IOT System Design and Development
[As per Choice Based Credit System (CBCS) scheme]

66
 SEMESTER –II
Subject Code 22MCA2061E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
Credits – 03
COURSE DESCRIPTION
This Course focuses on IoT concepts such as sensing, actuation and communication. It covers
the development of Internet of Things (IoT) prototypes—including devices for sensing,
actuation, processing, and communication—to help you develop skills and experiences. .
PREREQUISITES
 Basic knowledge of C or C++ or any programming language or programming
fundamentals. Familiarity with command-line interface.
 Basic knowledge of Operating system concepts.
COURSE OBJECTIVES
 After the completion of the course, the students will be able design some IOT based
prototypes
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
Introduction to IOT
IOT Architecture and protocols, Real time Examples of IoT,
Microprocessor, Types of Processors, Architecture Types. CISC & RISC.
Sensors & Actuators.
Module 2 08 Hours
Hardware componenets of IoT
Microcontroller, Simulators, Emulators, Choosing Microcontroller, Analog and
Digital Sensors, Interfacing of Temperature, Humidity and Motion Sensor with
Arduino. Interfacing of Relay Switch and Servo Motor with Arduino
Module 3 08 Hours
INTRODUCTION TO RTOS:
Introduction to Operating System: Computer Hardware Organization,
BIOS and Boot Process, Multi-threading concepts, Processes, Threads and
Scheduling.
Module 4 08 Hours
Working with Arduino
Arduino Uno Architecture, Setup the IDE, Writing Arduino Software
Arduino Libraries, Basics of Embedded C programming for Arduino
Interfacing LED, push button and buzzer with Arduino, Interfacing Arduino
with LCD
Module 5 08 Hours
Cloud Platforms for IOT
Virtualization concepts and Cloud Architecture, Cloud computing, benefits
Cloud services -- SaaS, PaaS, IaaS, Cloud providers & offerings, Study of IOT
Cloud platforms, ThingSpeak API and MQTT, Interfacing ESP8266 with Web
services
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
67
  There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module
Text Books
1. Internet of Things - A Hands-on Approach, Arshdeep Bahga and Vijay Madisetti,
Universities Press, 2015, ISBN: 9788173719547
2. Getting Started with Raspberry Pi, Matt Richardson & Shawn Wallace, O'Reilly
(SPD), 2014, ISBN: 9789350239759
3. Raspberry Pi Cookbook, Software and Hardware Problems and solutions, Simon
Monk, O'Reilly (SPD), 2016, ISBN 7989352133895
Reference Books:
1. Peter Waher, 'Learning Internet of Things', Packt Publishing, 2015 3. Editors Ovidiu
Vermesan
2. Peter Friess,'Internet of Things – From Research and Innovation to Market
Deployment',
3. River Publishers, 2014
4. N. Ida, Sensors, Actuators and Their Interfaces, SciTech Publishers, 2014.
TEACHING METHODS
 PPTs
 Hands-On Sessions Based Teaching
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and Weightage of 40%, 40% and
20% from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation for Learning Activity based on Case Studies/ Seminars for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Understanding of IoT value chain structure (device, data cloud), application areas and
technologies involved.
CO2: Understand IoT sensors and technological challenges faced by IoT devices, with a focus
on wireless, energy, power, and sensing modules
CO3: Market forecast for IoT devices with a focus on sensors
CO4: Understanding the implementation of web-based services on IoT devices

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 3
CO2 3 1 1 3
CO3 2 2 1 3 1 1 3
CO4 3 2 2 3 1 1 3

Machine Learning
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – II
68
 Subject Code 22MCA2062E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
Credits – 03
COURSE DESCRIPTION
This course provides an understanding of various algorithms of Machine Learning models.
The course also provides how models are evaluated and selected.
PREREQUISITES
 Students should know basics of Statistics and Mathematical Models.
 Students should know programming in Python or R
COURSE OBJECTIVES
 To understand the fundamentals of learning for data
 To understand predictive and classification model.
 To learn how to assess quality of model, model bias and variance and select
appropriate right model for the use case.
 To learn how to combine two or more models to improve prediction
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
Introduction: Well posed learning problems, Designing a Learning system,
Perspective and Issues in Machine Learning. Supervised and Unsupervised
Learning
Concept Learning: Concept learning task, Concept learning as search, Find-S
algorithm, Version space and Candidate Elimination algorithm, Inductive
Bias.
Data Types: Nominal, Ordinal, Interval, Ratio
Module 2 08 Hours
Regressions: Linear regression models and least squares, Multiple regression,
Multiple outputs, Subset selection, Ridge regression, Linear Discriminant
Analysis, Logistic regression
Module 3 08 Hours
Classification Models: Decision tree representation, Appropriate problems
for decision tree learning, Basic decision tree learning algorithm, hypothesis
space search in decision tree learning, Inductive bias in decision tree learning,
Issues in decision tree learning, Random forests, Association rules
Bayesian Learning: Introduction, Bayes theorem, Bayes theorem and
concept learning, ML and LS error hypothesis, Naive Bayes classifier, \
Module 4 08 Hours
Model Assessment and Selection: Bias, Variance, and model complexity,
Bias-variance trade off, Optimism of the training error rate, Estimate of In-
sample prediction error, Effective number of parameters, Bayesian approach
and BIC, Cross- validation, Boot strap methods.
Module 5 08 Hours
Additive Models, Trees, and Boosting: Generalized additive models,
Regression and classification trees, Boosting methods-exponential loss and
Ada-Boost, Numerical Optimization via gradient boosting, Examples
(California housing, New Zealand fish, Demographic data)

69
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from
each module
Text Books:
1. Tom M. Mitchell, “Machine Learning”, McGraw-Hill Education (INDIAN
EDITION), 2013.
2. Trevor Hastie, Robert Tibshirani, Jerome Friedman, “The Elements of Statistical
Learning- Data Mining, Inference, and Prediction”, Second Edition , Springer
Verlag, 2009.
Reference Books:
1. EthemAlpaydin, “Introduction to Machine Learning”, 2nd Ed., PHI Learning Pvt.
Ltd., 2013.
2. T. Hastie, R. Tibshirani, J. H. Friedman, “The Elements of Statistical Learning”,
Springer; 1st edition, 2001.
3. C.M. Bishop, “Pattern Recognition and Machine Learning”, Springer, 2011
4. L.Wasserman, “All of Statistics: A Concise Course in Statistical Inference”, Springer
TEACHING METHODS
 ICT based Teaching Learning Methods.
 Presentation Methods.
 Self-Learning by assigned activities.
ASSESSMENT METHODS
 Three Internals, 30 Marks each will be conducted. 40% each of first two internals
and 20% of third internals will be consolidated out of 30 marks.
 Case study is considered as a part of Learning Activity for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Choose the learning techniques and investigate concept learning
CO2: Learn how to predict using regression techniques
CO3: Identify the concepts of decision trees and solve problems associated with it
CO4: Select and Evaluate the predictive performance of all kinds of models
CO5: Learn how to generalize and combine models.

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 3
CO2 2 2 1 1 1 1 3
CO3 2 1 2 1 1 1 1 3
CO4 2 1 2 1 1 1 1 3
CO5 2 1 2 2 1 1 1 1 3

Mobile and Digital Forensics

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER –II
70
Subject Code 22MCA2063E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 42 SEE Hours 03
Credits – 03
COURSE DESCRIPTION
This course helps to understand the processes involved in mobile and digital forensics.
And to Understand the Basics of wireless technologies and security
PREREQUISITES
• Knowledge of Computer Networks and information security
COURSE OBJECTIVES
• Understand the Basics of wireless technologies and security
• Become Knowledgeable in mobile phone forensics and Android Forensics
• Learn the methods of investigation using Digital Forensic techniques
COURSE CONTENTS
Modules Teaching
Hours
Module 1 8 Hours
Introduction to Wireless Technologies
Overview of wireless technologies and security: Personal Area Networks, Wireless
Local Area Networks, Metropolitan Area Networks, Wide Area Networks. Wireless
threats, vulnerabilities and security: Wireless LANs, War Driving, War Chalking, War
Flying, Common Wi-Fi security recommendations, PDA Security, Cell Phones and
Security, Wireless DoS attacks, GPS Jamming, Identity theft.
Module 2 10 Hours
Security Framework for Mobile Systems
CIA triad in mobile Phones-Voice, SMS and Identification data interception in GSM:
Introduction, practical setup and tools, implementation- Software and Hardware Mobile
phone tricks: Netmonitor, GSM network service codes, mobile phone codes, catalog
tricks and AT command set- SMS security issues.
Module 3 8 Hours
Mobile Phone Forensics
Crime and mobile phones, evidences, forensic procedures, files present in SIM card,
device data, external memory dump, evidences in memory card, operators systems-
Android forensics: Procedures for handling an android device, imaging android USB
mass storage devices, logical and physical techniques.
Module 4 8 Hours
Introduction to Digital Forensics
Digital forensics: Introduction – Evidential potential of digital devices: closed vs. open
systems, evaluating digital evidence potential- Device handling: seizure issues, device
identification, networked devices and contamination.
Module 5 10 Hours
Analysis of Digital Forensic Techniques
Digital forensics examination principles: Previewing, imaging, continuity, hashing and
evidence locations- Seven element security model- developmental model of digital
systems- audit and logs- Evidence interpretation: Data content and context.
Question paper pattern:
· The question paper will have ten questions.
71
 · Each full question consists of 20 marks.
· There will be 2 full questions from each module.
· Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each
module
Text Books
1. Iosif I. Androulidakis, “Mobile phone security and forensics: A practical approach”, Springer
publications, 2012.
2. Andrew Hoog, “Android Forensics: Investigation, Analysis and Mobile Security for Google
Android”, Elsevier publications, 2011.
Reference Books:
1. Angus M. Marshall, “Digital forensics: Digital evidence in criminal investigation”, John – Wiley and
Sons, 2008
2. Gregory Kipper, “Wireless Crime and Forensic Investigation”, Auerbach Publications.
TEACHING METHODS
 PPTs
 Hands-On Sessions Based Teaching
 Arduino IDE
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and Weightage of 40%, 40% and
20% from 1st, 2nd and 3rd internals respectively will be taken.
 Rubrics for the Evaluation of Case studies for 20 Marks.
Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks..
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Ability to understand the processes involved in mobile and digital forensics.
CO2: Acquiring skills to analyse mobile and digital forensics techniques.
CO3: Understanding the implementation of web-based services on Forensic devices

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 1 2 3 2
CO2 2 2 1 3 2
CO3 2 2 1 3 2

Python Programming Laboratory

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER –II
Subject Code 22MCA207L CIE Marks 50
Number of Hours/ Week 02 Hrs Laboratory SEE Marks 50
SEE Hours 03
CREDITS – 01
72
COURSE DESCRIPTION
This course is intended to provide students with the skills required to understand the basic
working of Python Programming. It demonstrates the Real-time Object-oriented programming
concepts with respect to handling database and Data Frames with panda’s library.
PREREQUISITES
 Students should know basics of Programming.
 Students should know C, C++, and Java Programming Concepts.
Course Objectives:
 To be able to introduce core programming basics and program design with functions
using Python programming language.
 To understand a range of Object-Oriented Programming, as well as in-depth data and
information processing techniques.
PART A - Laboratory Experiments
1 a. Implement a python program to search an element using linear search.
b. Implement a python program to search an element using binary search.
2 a. Implement a python program to insert an element into a sorted list.
b. Implement a python program to simulate stack.
3 Write a python program using object-oriented programming to demonstrate
a. encapsulation
b. overloading
c. inheritance.
4 a. Implement a Python Program for file operations.
b. Implement a python program to demonstrate data wrangling functions.
5 a. Implement a python program to Importing Datasets and demonstrate the basic operations
on them w.r.t Pandas.
b. Implement a Python program to demonstrate the working of DataFrames using
Pandas.
6 a. Implement a python program to demonstrate the following using NumPy: a) Array
manipulation, Searching, Sorting and splitting.
b. Broadcasting and Plotting NumPy arrays using matplotlib library.
PART B - MINI PROJECT
Develop a mini project using the python programming using the concepts learning during the
theory class.

Note:
1. In the examination each student should pick one program from Part-A,
2. A team of two or three students must develop the mini project. However during the
examination, each student must demonstrate the project individually.
3. The team must submit a brief project report (15-20 pages)

ASSESSMENT METHODS
Experiment Write up + Execution + Viva 20
Lab Record Writing 10
Lab Internals Test 10
Mini Project 10
Total 50
Final Exam will be conducted for 50 marks (SEE)
73
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Develop python program to perform search/sort on a given data set.
CO2: Demonstrate object-oriented Programming, File handling and exception handling in
Python.
CO3: Demonstrate Data Cleaning and Data Manipulation using Numpy and Pandas.
CO4: Demonstrate data visualization using Numpy
CO5: Perform array broadcasting using Numpy.

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 1 2 1 3
CO2 2 2 1 1 3
CO3 2 2 1 1 3
CO4 2 2 2 1 1 3
CO5 2 2 2 1 1 3

Web Programming Laboratory

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – II
Subject Code 22MCA208L CIE Marks 50
Number of Hours/Week 02 Hrs. Laboratory SEE Marks 50
SEE Hours 03
CREDITS – 01
74
1 Write a HTML Page to create a Student registration form that collects various student
information such as first name, last name, Roll No., email id, mobile number, etc and a two
buttons: submit and reset. Apply different CSS properties
2 a. Develop and demonstrate a XHTML file that includes JavaScript script for the following
problems:
i) Accept a number n obtained using prompt and display the first n Fibonacci
numbers using alert
ii) Accept a number n obtained using prompt, and display a table of numbers from 1
to n and their squares using alert()
b. Develop and demonstrate using JavaScript, a XHTML document that displays random
numbers (integers).
3 Write a JavaScript program to generate n number of random numbers and store them in an
array. Sort the generated numbers in ascending order using array sort method. Develop
separate functions to find mean and median of numbers that are in the array. Display the
results with appropriate messages.
4 a. Develop and demonstrate, using JavaScript script, a XHTML document that collects the
USN (the valid format is: A digit from 1 to 4 followed by two uppercase characters
followed by two digits followed by two uppercase characters followed by three digits;
No embedded spaces allowed) of the user. Event handler must be included for the Form
element that collects this information to validate the input. Messages in the alert
windows must be produced when errors are detected.
b. Modify the above program to get the current semester also (restricted to be a number
from 1 to 6).
5 Develop using JavaScript script, an XHTML document that use of onload and onfocus
events.
6 a. Design an XML document to store information about a student in an engineering college
affiliated to VTU. The information must include USN, Name, Name of the College,
Brach, Year of Joining, and e-mail id. Make up sample data for 3 students. Create a CSS
style sheet and use it to display the document.
b. Create an XSLT style sheet for one student element of the above document and use it to
create a display of that element.
7 a. Create XHTML forms with Name, address line1, address line2 and email text fields. On
submitting, store the values in MySQL table. Retrieve and display the data based on
name.
b. Implement a PHP program to read student data from an XML file and store into the
MySQL database. Retrieve and display using SEARCH function.
8 Implement the following web applications using AngularJS: A simple calculator web
application that takes two numbers and an operator (+, -, /, * and %) from an HTML page
and returns the result page with the operation performed on the operands
9 Implement the following web applications using AngularJS: A user validation web
application, where the user submits the login name and password to the server. The name
and password are checked if the data matches, a successful login page is returned.
Otherwise a failure message is shown to the user.
10 Implement the following web applications using PHP: A user validation web application,
where the user submits the login name and password to the server. The name and password
are checked against the data already available in Database and if the data matches, a
successful login page is returned. Otherwise a failure message is shown to the user.
ASSESSMENT METHODS
Experiment Write up + Execution + Viva 20
75
 Lab Record Writing 10
Lab Internals Test 10
Mini Project 10
Total 50
 Final Exam will be conducted for 50 marks (SEE)
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Use HTML and CSS to design web pages.
CO2: Infer the role of XML in web applications and use them.
CO3: Apply the concepts of JavaScript to perform client side validation and create dynamic
web pages.
CO4: Create server side applications using PHP.
CO5: Create web application using AngularJS.

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 1 2 1 1 3
CO2 2 2 1 1 1 3
CO3 2 2 1 1 1 3
CO4 2 2 2 2 1 1 3
CO5 2 2 2 2 1 1 3

Mobile Application in Android Laboratory

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – II
Subject Code 22MCA209L CIE Marks 50
Number of Hours/Week 02 Hrs Laboratory SEE Marks 50
SEE Hours 03
CREDITS – 01
76
COURSE DESCRIPTION
Covers introductory mobile application development for the Android and iOS Operating
System using XML, C, C++, and Java. Includes developing simple applications that could
run on Android and Apple phones and tablets. Covers Android and iOS application
development phases, terminologies, application design, and coding.
PREREQUISITES
 Students should know basics of XML.
 Students should know C, C++, and Java Programming Concepts.
COURSE OBJECTIVES
Mobile Application Development course is designed to quickly get you up to speed with
writing apps for Android and iOS devices. The student will learn the basics of Android and
Flutter Frameworks and get to understand the application lifecycle.
Part-A
Sl. No. Laboratory Experiments
1 Develop a mobile application to display user profile with 3 UI activities using
intents.
2 Design an application that contains Phone Contacts in vertical linear
manner. Selected contact appears at the top of the list with a large
italicized font and a blue background
3 Create an application that uses Layout Managers and Event Listeners
4 Develop a mobile application to list the tourist places of Karnataka using List View.
5 Develop a mobile application to register a form in first activity and display the
registered information in second activity using intents.
6 Develop a standard calculator application to perform basic calculations like
addition, subtraction, multiplication and division
7 Devise an application that draws basic graphical primitives (rectangle, circle) on the
screen
8 Build an mobile application that create, save, update and delete data in a database
9 Devise an application that implements Multi-threading
10 Develop a mobile application that uses GPS location information
11 Create an application that writes data to the SD card.
12 Implement an application that creates an alert upon receiving a message.
13 Devise a mobile application that creates alarm clock
Part-B
Develop a Mini Project on Flutter Framework
Note:
1. In the examination each student should pick one program from Part-A,
2. A team of two or three students must develop the mini project. However during the
examination, each student must demonstrate the project individually.
3. The team must submit a brief project report (15-20 pages)

ASSESSMENT METHODS
Experiment Write up + Execution + Viva 20
Lab Record Writing 10
Lab Internals Test 10
Mini Project 10
Total 50
Final Exam will be conducted for 50 marks (SEE)
77
 Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Illustrate effective user interfaces that leverage evolving mobile device capabilities.
CO2: Develop applications using software development kits (SDKs), frameworks and
toolkits.
CO3: Establish various methods to integrate database and server-side technologies.
CO4: Design and develop open source software based mobile applications.
CO5: Build and deploy competent mobile development solutions.

CO-PO-PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 1 2 1 1 1 1 3
CO2 2 2 1 1 1 1 3
CO3 2 2 1 1 1 1 3
CO4 2 2 2 2 1 1 1 3
CO5 2 2 2 2 1 1 1 3

Technical Seminar
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – II
Subject Code 22MCA210S CIE Marks 50
Number of Hours/Week 02 Hrs SEE Marks 50
SEE Hours 03
CREDITS – 01

78
Course outcomes:
CO 1: The students will be able to recall existing technologies in the area of computer science.
CO 2: The students will be able to describe, compare and evaluate different technologies.
CO 3: The students will be able to decide the area of interest
CO 4: The students will be able to develop their communication skills.
CO 5: The students will be able to write technical reports.

General Guidelines
 Students should present the seminar on cutting edge/emerging/state of the art
technologies in the field of Computer Science and Applications.
 Duration of the seminar should be approximately 45 minutes.
 Student should submit the write up on seminar topic containing at least 10 pages

Report format:
1. Cover Page
2. Acknowledgement
3. Abstract

Table of Contents:
Sl. No Description Page No.
1. Introduction
2. Literature Survey
3 Topic Specific Description
4 Conclusions
5 Bibliography

Guidelines for Report Writing:

1) Put page borders
2) Main Heading font size 17pt (Times New Roman)
3) Subheading : font size 14pt (Times New Roman)
4) Text: font size 12pt (Times New Roman)
5) Figures should have Fig numbers at the bottom of the figure e.g. Fig 3.2 is second figure
in 3rd chapter
6) Tables should have table numbers at the top example Table 5.1 i.e, 1st table in 5th chapter
7) Paragraph spacing 1.5

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 2 1 1 2 3
CO2 3 1 2 1 1 1 3
CO3 3 1 2 1 2 3
CO4 1 2 1 2 3
79
CO5 1 2 1 1 3

Programming Using C# and .NET

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER –III
Subject Code 22MCA301 CIE Marks 50
Number of Lecture Hours/Week 04 SEE Marks 50
Total Number of Lecture Hours 50 SEE Hours 03
Credits – 04
80
COURSE DESCRIPTION
This course is an introduction to computer programming for Windows. Emphasis will be on
the fundamentals of structured design, development and implementation, including C#
programming language syntax, data and file structures, input/output devices, files, and
databases
PREREQUISITES
 Basic knowledge of C or C++ or any programming language or programming
fundamentals. Familiarity with command-line interface.
 The OOP concept makes for a short learning curve of C#
COURSE OBJECTIVES
 Recognize, diagram, and implement introductory programming concepts using C#
 Determine logical alternatives with C# decision structures utilizing iteration, class
methods, fields, and properties.
 Assemble forms, classes, and controls into C# solutions utilizing arrays and
file/database access methods
COURSE CONTENTS
Modules Teaching
Hours
Module 1 10 Hours
Introducing C#: Creating a Simple C# Console Application, Identifiers and
Keywords. System Data Types, Variables and Constants: Value Types,
Reference Types, Understanding Type Conversions, Boxing and UnBoxing.
Namespaces, The System namespace, .NET Array Types
Module 2 10 Hours
Classes, Objects and Object Oriented Programming: Classes and Objects:
Creating a Class, Creating an Object, Using this Keyword, Creating an Array of
Objects, Using the Nested Classes, Defining Partial Classes and Method,
Returning a Value from a Method and Describing Access Modifiers. Static
Classes and Static Members, Properties: Read-only Property, Static Property,
Indexers, Structs: Syntax of a struct and Access Modifiers for structs,
System.Object Class.
Encapsulation: Encapsulation using accessors and mutators, Encapsulation
using Properties. Inheritance: Inheritance and Constructors, Sealed Classes and
Sealed Methods, Extension methods.
Polymorphism: Compile time Polymorphism/ Overloading, Runtime
Polymorphism/ Overriding. Abstraction: Abstract classes, Abstract methods.
Interfaces: Syntax of Interfaces, Implementation of Interfaces and Inheritance.
Module 3 10 Hours
Delegates, Events, Exception Handling and ADO.NET
Delegates: Creating and using Delegates, Muticasting with Delegates. Events:
Event Sources, Event Handlers, Events and Delegates, Multiple Event
Handlers.
Exception Handling: The try/catch/throw/finally statement, Custom
Exception. System.Exception, Handling Multiple Exception
Data Access with ADO.NET: Understanding ADO.NET: Describing the
Architecture of ADO.NET, ADO.NET,ADO.NET Entity Framework. Creating
Connection Strings: Syntax for Connection Strings. Creating a Connection to a
Database: SQL Server Database. Working with Data Adapters: Creating

81
DataSet from DataAdapter.
Module 4 10 Hours
Graphical User Interface with Windows Forms and WPF
Windows Forms: Introduction, Windows Forms, Event Handling: A Simple
Event- Driven GUI, Control Properties and Layout, Labels, Text Boxes and
Buttons, Group Boxes and Panels, Check Boxes and Radio Buttons, ToolTips,
Mouse-Event Handling, Keyboard-Event Handling. Menus, Month Calendar
Control, Link Label Control, List Box Control, Combo Box Control, Tree View
Control, List View Control, Tab Control and Multiple Document Interface
(MDI) Windows.
Module 5 10 Hours
Web App Development and Data Access using ADO.NET: Introduction,
Web Basics, Multitier Application Architecture, Your First Web Application:
Building Web-Time Application, Examining Web-Time.aspx’s Code- Behind
File, Understanding Master pages, Standard Web Controls: Designing a Form,
Validation Controls, Grid View Control, Drop Down List, Session Tracking,
ASP.NET
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from
each module.
Text Books
1. .NET 4.0 Programming (6-in-1), Black Book, Kogent Learning Solutions Inc., Wiley-
Dream Tech Press. (Chapters: 1,10,11,12,13,14 and 19).
2. Paul Deitel and Harvey Deitel: C# 2010 for Programmers, 4th Edition, Pearson
Education. (Chapters: 14,15,19 and 27.3)
Reference Books:
1. Andrew Trolsen: Pro C# 5.0 and the .NET 4.5 Framework, 6th Edition, Wiley-
Appress.
2. Bart De Smet: C# 4.0 Unleashed, Pearson Education- SAMS Series.
3. Herbert Schildt: Complete Reference C# 4.0, Tata McGraw Hill, 2010.
TEACHING METHODS
 PPTs
 Hands-On Sessions Based Teaching
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and Weightage of 40%, 40% and
20% from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation for Learning Activity is based on Assignments, Case studies, Mini Projects
for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Develop a foundational understanding of C# by creating a simple console
application and master the usage of identifiers, keywords, and gain proficiency
in system data types, variables, and constants.
CO2: Acquire proficiency in C# through adept creation and utilization of
classes and objects. Attain a thorough grasp of key object-oriented design
82
principles—encapsulation, inheritance, and polymorphism. Apply these
principles with precision in coding, enabling effective analysis and establishing
a robust foundation in object-oriented programming.
CO3: Acquire expertise in C# by mastering event-driven programming with
delegates and events, proficiently handling exceptions, and gaining a
fundamental understanding of efficient data access through ADO.NET.
CO4: Develop expertise in designing and implementing Windows Forms
applications, while also gaining proficiency in creating modern UIs using
Windows Presentation Foundation (WPF), and understanding the principles of
GUI design and usability.
CO5: Gain a comprehensive understanding of web development essentials in
C#, including exploring ADO.NET integration for data access in web
applications, and mastering concepts of state management and security in the
web development process.
CO6: Execute a comprehensive project integrating concepts from all modules,
showcasing proficiency in problem-solving, coding, and application design,
while engaging in a thorough review to solidify understanding and prepare for
real-world scenarios.

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 3
CO2 2 2 1 1 1 1 3
CO3 2 2 1 1 1 3
CO4 2 2 1 1 1 3
CO5 2 3 1 1 1 1 3

83
 FULL STACK WEB Development
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – III
Subject Code 22MCA302 CIE Marks 50
Number of Lecture Hours/Week 04 SEE Marks 50
Total Number of Lecture Hours 50 SEE Hours 03
Credits – 04
COURSE DESCRIPTION:
This course prepares the learner for creating single-page or mobile applications and creates
reusable components for web pages and mobile applications. It also covers building RESTful
APIs, MongoDB, and React Router. Basic elements include introduction, JSX overview,
environmental setup, real-time applications, forms and UI, Component Lifecycle, Event
Handling, and Styles.
PREREQUISITES:
 The student should be acquainted about programming terms such functions, objects,
arrays, and to a lesser extent classes.
 Students should be familiar with HTML, CSS, and JavaScript on a basic level.
COURSE OBJECTIVES
 Recognize the new classes, modules, and arrow functions in the JavaScript language.
 Articulate what React is and why it is useful.
 Making use of controlled components, create and verify forms.
 Use a JavaScript package manager (either npm or Yarn).s
 Making HTTP requests to read or modify data.
 Students can understand how callbacks and MongoDB function.
 Students able to create CRUD operations, routing mechanisms, and UI components.
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
Introduction to the MERN stack:
Introduction, The MVC architectural Pattern, MERN Components React,
Node.js, Express, MongoDB, Advantages of MERN, Isomorphic.
Welcome to React- Obstacles and Roadblocks, Reacts Future
Module 2 10 Hours
Understanding React and Web Server:
Server setup, NVM, Node Js, Project, NPM, Express, Build time JSX
compilation- Separate Script File, Transform, Automate, React Library, React
84
Components-React classes, Composing components, passing data- using
properties ,property validation, using children’s Dynamic composition.
Module 3 10 Hours
Understanding React State:
React State – Setting state, Event handling, communicating from child to
parent, Stateless components, Designing Components-state vs props,
component hierarchy communication, Stateless components.
Module 4 12 Hours
Building RESTful APIs and Mongo DB:
REST , HTTP method as Actions, JSON, Express, Routing Hander function ,
Request Object, Response objects, Middleware, The list API , The create API,
Using the LIST API, Using the Create API, Error Handling.
Mongo DB: Basics, Schema initialization , MongoDB Node.JS Driver,
callbacks, promises, Reading from MongoDB, Writing to MongoDB
Module 5 10 Hours
Working with React Router and forms:
Routing Techniques, Simple Routing, Route parameters, Route Query String,
Programmatic Routing, Nested Routes, Browser history, Forms, Filter form,
Get API, Edit page, UI Components, update API, Delete API.
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 Here will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from
each module
Text Books:
2. Pro MERN Stack, Vasan Subramanian, 2019, ISBN-13(pbk):978-1-4842-2653-7
3. MERN Quick Start Guide, Eddy Wilson Iriarte Koroloiva, 2018, PACKT Publication,
ISBN 978-1-78728-108-0
Reference Books:
1. Full stack React, Anthony Accomazzo, Ari Lerner, Nate Murray, Clay Allsopp, David
Gutman, and Tyler McGinnis, 2017.
TEACHING METHODS
 PPTs
 Hands-On Sessions Based on Concepts.
ASSESSMENT METHODS
 Three Internals are conducted for 30 Marks each and Weightage of 40%, 40% and 20%
from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation for Learning Activity is be based on Assignments, Case studies, Mini
Projects for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks
Course Outcome (CO): At the end of this course, the students will be able to:

CO1: Understand the concepts of MVC components and architecture and Implement node js,
Express and MongoDB.

85
CO2: Understand difference between SPA and server side rendering using React.
CO3: Understand the need of JSX transformations and importance of recompiling code
automatically.
CO4: Understand the concept of using React classes instead of simple elements or
placeholders.
CO5: Understand how to use state and make changes to it on user interactions and how child
can communicate with its parent via callbacks.
CO6: Understand routing mechanisms and Implementations of CRUD operations and UI
Components.

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 3
CO2 3 2 1 1 3
CO3 3 2 2 1 1 1 3
CO4 3 2 2 1 1 1 3
CO5 2 2 2 1 1 1 3
CO6 2 2 2 1 1 1 3

86
 Software Engineering & Software Testing
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – III
Subject Code 22MCA303 CIE Marks 50
Number of Lecture Hours/Week 04 + 02 Hrs Lab SEE Marks 50
Total Number of Lecture Hours 50 SEE Hours 03
CREDITS – 04
COURSE DESCRIPTION
To acquaint the students with the basic and advanced concepts of Software Engineering,
Software development models, Software testing and Software Project management. The
course also gives a fair idea about the Automation tool Selenium and running test scripts.
PREREQUISITES
 Students should have a basic understanding of the software development life cycle
(SDLC).
 Students should know basic programming in Java for executing the automation lab
programs
COURSE OBJECTIVES
CO1: Understand the various software development process models and their suitability
along with professional ethics and responsibilities.
CO2: Understand and evaluate the requirements for a software system and apply the
principles and techniques in the architectural design, detail design, and implementation of
software applications and understand concepts on Software quality
CO3: Understand the practices and methods for successful software project management
by identifying techniques for effective resource engagement and applying evaluation
techniques for estimating cost, benefits, and schedule
CO4: Understand fundamental concepts in software testing & various types and
techniques of software testing
CO5: Exposure to the automation tool Selenium & execution of test scripts
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
Software Engineering: Introduction: Professional Software Development
Attributes of good software, IEEE/ ACM code of software engineering
ethics.
Software Process models: Software Development Life Cycle, waterfall
model, Incremental development
Agile Software Development: Agile methods, Plan-driven and Agile
Development, Extreme Programming, Rapid Application Development.
Module 2 08 Hours
Requirements Engineering: Functional and non-functional requirements,
The software requirements document, Requirements specification,
Requirements engineering processes, Requirement elicitation and analysis,
Requirements validation.
87
System Modeling: Context models, Interaction models, Structural models,
Behavioural models, Model-driven engineering
Design and implementation: Design: Design concepts, Function oriented
design, detailed design
Module 3: 10 Hours
Introduction to Software Project Management –SPM:Introduction, SPM
Overview, Stakeholders, Project Success and Failures, Management Control
Project Evaluation:
Evaluation of Individual Projects, Cost Benefit Evaluation Techniques,
Programme Management, Managing allocation of Resources within
Programmes
Activity Planning
Task splitting, estimation techniques, Sequencing and Scheduling Activities,
Network Planning Models
Module 4 08 Hours
Software Quality Concepts: Software quality assurance, Software reviews,
SEI Capability Maturity Model

Introduction to Testing:
Software Quality; Fundamentals of Testing, Software Test Life Cycle, Test
Planning, Test cases, Levels of Testing. Defect Management: Defect
Management Process, Defect Life Cycle. White box testing, Black box
testing, Functional, Integration Testing, System testing, Regression Testing,
Validation Testing, Alpha Testing, Beta Testing, Acceptance Testing, Static
testing; Role of testing in Agile, Introduction to Smoke testing; API testing.
Module 5 08 Hours
INTRODUCTION TO AUTOMATION TESTING – SELENIUM:
Software Test Automation: Fundamentals of Test Automation, Manual
Testing Vs Test Automation. Introduction to Selenium & its components,
Installation, configuration and creating test cases with Selenium,
Understanding CSS locators, Selenium Webdriver,
AUTOMATION TESTING USING Scripts
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from
each module
Text Books:
1. Ian Sommerville : Software Engineering, 9th edition, Person Education Ltd, 2011.
2. Pankaj Jalote: Software Engineering, Wiley India Pvt Ltd, 2010
3. Bob Hughes, Mike Cotterell, Rajib Mall, “Software Project Management”, Fifth
Edition, Tata McGraw Hill, 2011
4. Rex Black, Erik Van Veenendaal, Dorothy Graham“Foundations of Software
Testing – ISQTB Certification”, Third Edition
5. Paul C Jorgensen, “Software Testing A Craftsman's Approach”, Aueredach
publications, 3rd edition, 2011
88
Reference Books:
1. Roger S Pressman: Software Engineering-A Practitioners approach, 6th Edition,
McGraw-Hill, 2010.
2. Hans Van Vliet: Software Engineering Principles and Practices, 3rd Edition,
Wiley–India, 2010
3. Rex Black: Advanced Software Testing—Vol. 2, Shroff Publishers, Gundecha
Unmesh: Selenium Testing Tools Cook Book, PACKT PUBLISHING, 2012.
TEACHING METHODS:
 Black-board teaching
 PPT
 Demonstration based teaching
ASSESSMENT METHODS:
 Three Mid-Semester examinations (MSE) will be conducted for 30 Marks each.
The weightage of MSE-1, 2 & 3 will be 40%, 40% and 20% respectively.
 Evaluation for Learning Activity will be based on Programming Assignments,
Case studies and Viva.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Understand the various software development process models and their suitability
along with professional ethics and responsibilities.
CO2: Understand and evaluate the requirements for a software system and apply the
principles and techniques in the architectural design, detail design, and implementation of
software applications and understand concepts on Software quality
CO3: Understand the practices and methods for successful software project management
by identifying techniques for effective resource engagement and applying evaluation
techniques for estimating cost, benefits, and schedule
CO4: Understand fundamental concepts in software testing & various types and
techniques of software testing
CO5: Exposure to the automation tool Selenium & execution of test scripts
Laboratory Experiments:
1 Design and develop a script in any language of your choice and run it using Selenium:
Open google.com in Chrome Browser and verify that title is Google and verify that it
is redirected to google.co.in
2 Design and develop a script in any language of your choice and run it using Selenium:
Open Google in multiple browser(Chrome/Firefox/IE) and click on Gmail
3 Design and develop a script in any language of your choice and run it using Selenium:
Search of ‘Software Testing’ key word in Google and click on the first link visible
4 Design and develop a script in any language of your choice and run it using Selenium:
Login to Gmail application with valid Username and Password and Logout
5 Design and develop a script in any language of your choice and run it using Selenium:
Identify ‘Price’ of any mobile present in Flipkart.com using Xpath
6 Design and develop a script in any language of your choice and run it using Selenium:
 Login to Amazon.in
 Add multiple products to Shopping Cart
 Cancel and Logout of the web page

89
CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 1 1 2 3 2
CO2 2 2 2 1 1 1 3 2
CO3 2 2 1 1 1 1 1 1 3 2
CO4 2 2 2 1 1 1 1 1 3 2
CO5 2 2 2 1 1 1 1 3 2

90
 Web Services Computing
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER –III
Subject Code 22MCA3041E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
Credits – 03
COURSE DESCRIPTION
This course introduces students to software architectures designed to enable computer programs
to communicate over a network using open standard Internet protocols (Web Services). The
course covers the standards that enable SOAP based Web Services: XML Schema, SOAP
(Simple Object Access Protocol), WSDL (Web Service Definition Language), and UDDI
(Universal Description Discovery and Integration). Students will also learn how to implement
Web Services using a REST (Representational State Transfer) based architecture (RESTful).
The course describes proper design of Web Services and applications to implement a service-
oriented architecture (SOA).
PREREQUISITES
 Good knowledge on XML, HTTP, TCP/IP concepts.
COURSE OBJECTIVES
 To Understand Web Services and implementation model for SOA
 To Understand the SOA, its Principles and Benefits
 To Understand XML concepts
 To Understand paradigms needed for testing Web Services
 To explore different Test Strategies for SOA-based applications
COURSE CONTENTS
Modules Teachi
ng
Hours
Module 1 08
Hours
Evolution and Emergence of Web Services – Evolution of distributed computing.
Core distributed computing technologies – client/server, CORBA, JAVA RMI,
Micro Soft DCOM, MOM, Challenges in Distributed Computing, Introduction to
Web Services – The definition of web services, basic operational model of web
services, tools and technologies enabling web services, benefits and challenges of
using web services.
Module 2 08
Hours
Web Service Architecture – Web services Architecture and its characteristics, core
building blocks of web services, standards and technologies available for
implementing web services, web services communication, basic steps of
implementing web services.
Module 3 08
Hours
Brief Over View of XML – XML Document structure, XML namespaces, Defining
structure in XML documents, Reuse of XML schemes, Document navigation and
transformation. SOAP : Simple Object Access Protocol, Inter-application
communication and wire protocols, SOAP as a messaging protocol, Structure of a
SOAP message, SOAP envelope, Encoding, Service Oriented Architectures, SOA
91
revisited, Service roles in a SOA, Reliable messaging,
Module 4 08
Hours
Describing Web Services – WSDL introduction, non functional service description,
WSDL1.1 Vs WSDL 2.0, WSDL document, WSDL elements, WSDL binding,
WSDL tools, WSDL port type, limitations of WSDL.
Module 5 08
Hours
Cloud Platforms for IOT
Registering and Discovering Services : The role of service registries, Service
discovery, Universal Description, Discovery, and Integration, UDDI Architecture,
UDDI Data Model, Interfaces, UDDI Implementation
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module
Text Books
1. Web Services & SOA Principles and Technology, Second Edition, Michael P
Papazoglou.
2. Developing Java Web Services, R. Nagappan, R. Skoczylas, R.P. Sriganesh, Wiley
India.
3. Developing Enterprise Web Services, S. Chatterjee, J. Webber, Pearson Education.
Reference Books:
1. XML, Web Services, and the Data Revolution, F.P.Coyle, Pearson Education.
2. Building web Services with Java, 2nd Edition, S. Graham and others, Pearson
Education.
3. Java Web Services, D.A. Chappell & T. Jewell, O‟Reilly, SPD.
4. McGovern, et al., “Java web Services Architecture”, Morgan Kaufmann Publishers,
2005.
TEACHING METHODS
 PPTs
 Hands-On Sessions Based Teaching
ASSESSMENT METHODS
 Three Mid-Semester examinations (MSE) will be conducted for 30 Marks each. The
weightage of MSE-1, 2 & 3 will be 40%, 40% and 20% respectively.
 Evaluation of Learning Activity based on Case study, Mini Project for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Understand the principles of SOA
CO2: Efficiently use market leading environment tools to create and consume web services
CO3: Identify and select the appropriate framework components in creation of webservice
solution
CO4: Apply OOP principles to creation of webservice solutions.

CO-PO-PSO Mapping

92
 PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 3
CO2 1 2 2 1 1 1 3
CO3 2 2 2 1 1 1 3
CO4 2 1 2 1 1 1 3

Data Mining & Business Intelligence

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – III
Subject Code 22MCA3042E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
CREDITS – 03
Course Description:
This course is designed to introduce students to business intelligence concepts and provide students
93
with an understanding of data mining along with associated techniques and their benefits to
organizations of all sizes.
PREREQUISITES
 Knowledge of statistics
 Basic programming language
Course Objectives:
 To introduce the concept of data Mining as an important tool for enterprise data
management and as a cutting edge technology for building competitive advantage.
 To enable students to effectively identify sources of data and process it for data mining.
 To make students well versed in all data mining algorithms, methods, and tools.
 Learning how to gather and analyze large sets of data to gain useful business understanding.
 To impart skills that can enable students to approach business problems analytically by
identifying opportunities to derive business value from data.
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
Introduction to Data Mining
What Is Data Mining, Kinds of Data Can Be Mined, Kinds of Patterns Can Be Mined,
Technologies Used, Kinds of Applications Are Targeted, Major Issues in Data
Mining, KDD Process, Types of Attribute Types, Measuring Data Similarity and
Dissimilarity.
Data Pre-processing: Why preprocessing, Data cleaning: Missing Values, Noisy
Data; Data Integration, Data Reduction: Attribute Subset Selection; Data
Transformation and Data Discretization: Normalization, Binning, Histogram
Analysis, Concept Hierarchy Generation.
Module 2 08 Hours
Classification
Basic Concepts; Decision Tree Induction: Decision Tree Induction, Attribute
Selection Measures, Tree Pruning; Bayes Classification Methods: Bayes’ Theorem,
Naive Bayesian Classification; Model Evaluation and Selection: Metrics for
Evaluating Classifier Performance
Module 3 08 Hours
Clustering Techniques
Cluster analysis: Basic Concepts; Partitional Methods: K-Means; Hierarchical
Methods: Agglomerative, Divisive, BIRCH; Density-Based Methods: DBSCAN.
Module 4 08 Hours
Association Analysis: Basic Concepts and Algorithms
Basic Concepts: Frequent Itemsets, Closed Itemsets, and Association Rules;
Frequent Itemset Mining Methods: Apriori Algorithm - Finding Frequent Itemsets by
Confined Candidate Generation, Generating Association Rules from Frequent
Itemsets
Module 5 08 Hours
Data Mining for Business Intelligence Applications:
What is BI? Business intelligence architectures; Definition of decision support
system; Development of a business intelligence system using Data Mining for
business Applications like Fraud Detection, Clickstream Mining, Market
Segmentation, retail industry, telecommunications industry, banking & finance CRM
etc.
94
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. Jiawei Han, Micheline Kamber, Jian Pei “Data Mining Concepts and Techniques”, 3 rd
Edition, Morgan Kaufmann Publisher.
2. Pang-Ning Tan, Michael Steinbach, Vipin Kumar “ Introduction to Data Mining”, Pearson,
First impression.
3. G. Shmueli, N.R. Patel, P.C. Bruce, “Data Mining for Business Intelligence: Concepts,
Techniques, and Applications in Microsoft Office Excel with XLMiner”, 1 st Edition, Wiley
India.
4. Carlo Vercellis, “Business Intelligence: Data Mining and Optimization for Decision
Making”, Wiley India Publications
Reference Books:
1. Paulraj Ponnian, “Data Warehousing Fundamentals”, John Willey.
2. M. Dunham, “Data Mining: Introductory and Advanced Topics”, Pearson Education.
TEACHING METHODS
 PPT
 Black Board
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and Weightage of 40%, 40% and 20%
from 1st, 2nd and 3rd internals respectively will be taken.
 Learning Activity will be based on Assignments / Case Studies/ Seminars for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: To understand of the concepts of importance of data mining, and the principles of business
intelligence
CO2: To Organize and Prepare the data needed for data mining using pre preprocessing techniques
CO3: To Implement the appropriate data mining methods like classification, clustering, or Frequent
Pattern mining on data sets.
CO4: To Define and apply metrics to measure the performance of various data mining algorithms.
CO5: Analyze data mining for various business intelligence applications for the given problem

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 3
CO2 2 2 2 2 1 1 1 1 3
CO3 2 2 1 1 1 1 3
CO4 3 2 2 1 1 1 3
95
CO5 2 2 2 1 3 3

Block Chain Technology

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – III
Subject Code 22MCA3043E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
CREDITS – 03
COURSE DESCRIPTION
Blockchain is an emerging technology platform for developing decentralized applications
96
and data storage. This course introduces the fundamentals of blockchain technology,
distributed systems, cryptography and how it keeps data secure.
PREREQUISITES
 Data Structures and Algorithms
 Object-Oriented Programming
COURSE OBJECTIVES
 This course enables the students to familiarize the various aspects of blockchain,
bitcoins, smart contracts and ethereum.
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
Blockchain 101:
The growth of blockchain technology, Distributed systems History of
blockchain and Bitcoin, types of blockchain, Benefits and limitations of
blockchain.
Module 2 08 Hours
Decentralization and Cryptography:
Decentralization using blockchain, Methods of decentralization, Routes to
decentralization: Cryptographic primitives, Asymmetric cryptography,
Public and private keys
Module 3 08 Hours
Bitcoin and Alternative Coins :
Bitcoin, Transactions, Blockchain, Bitcoin payments, Alternative Coins,
Theoretical foundations, Bitcoin limitations, Namecoin, Litecoin, Primecoin,
Zcash
Module 4 08 Hours
Smart Contracts and Ethereum 101:
Smart Contracts: Definition, Ricardian contracts. Ethereum 101:
Introduction, Ethereum blockchain, Elements of the Ethereum blockchain
Module 5 08 Hours
Alternative Blockchains:
Blockchains, Blockchain-Outside of Currencies: Internet of Things,
Government, Health, Finance, Media
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from
each module.
Text Book:
1. “Mastering Blockchain - Distributed ledgers, decentralization and smart contracts”,
Imran Bashir, Packt Publishing Ltd, Second Edition, ISBN 978-1- 78712-544-5,
2017
Reference Books:
 Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and Steven
Goldfeder, “Bitcoin and Cryptocurrency Technologies: A Comprehensive
Introduction”, Princeton University Press (2016)
97
  “Blockchain Basics: A Non-Technical Introduction in 25 Steps”, Author- Daniel
Drescher, Apress, First Edition, 2017
TEACHING METHODS
 PPTs
 Black Board
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and Weightage of 40%, 40%
and 20% from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation based on case study/ seminar for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
COURSE OUTCOMES: At End of the Course Student will Be Able to
CO1: Understand the types, benefits and limitation of blockchain.
CO2: Explore the blockchain decentralization and cryptography concepts.
CO3: Enumerate the Bitcoin features and its alternative options.
CO4: Describe and deploy the smart contracts
CO5: Summarize the blockchain features outside of currencies.

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 2
CO2 3 1 1 2
CO3 3 1 1 2
CO4 3 1 1 1 2
CO5 3 1 1 1 2

AWS Cloud Computing

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER –III
Subject Code 22MCA3051E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
Credits – 03
COURSE DESCRIPTION
AWS Academy Cloud Developing is designed to help students gain technical expertise in
development using cloud technologies and prepare them to take the AWS Certified Developer
98
– Associate level AWS Certification exam.
PREREQUISITES
 Cloud Basics.
 System and Network Architecture.
COURSE OBJECTIVES
 Understanding fundamentals of Cloud and its basic infrastructure
 Learn about account management, billing and pricing
 Acquire knowledge on security model and compliance concepts
 Learn how to use different core services of Cloud
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
Introduction to Cloud Computing & AWS
What is Cloud Computing, Cloud Service & Deployment Models, How AWS is
the leader in the cloud domain, Various cloud computing products offered by
AWS, Introduction to AWS S, EC, VPC, EBS, ELB, AMI., AWS architecture
and the AWS Management Console, virtualization in AWS (Xen hypervisor)
What is auto-scaling, AWS EC best practices and cost involved.
Module 2 08 Hours
Elastic Compute and Storage Volumes
Introduction to EC, Regions & Availability Zones(AZs), Pre-EC, EC instance
types, Comparing Public IP and Elastic IP, Demonstrating how to launch an
AWS EC instance, Introduction to AMIs, Creating and Copying an AMI
Introduction to EBS, EBS volume types, EBS Snapshots.
Module 3 08 Hours
Load Balancing, Auto scaling and DNS
Introduction to Elastic Load Balancer, Types of ELB – Classic, Network and
Application, Load balancer architecture, Cross-zone load balancing, Introduction
to Auto Scaling, vertical and horizontal scaling, the lifecycle of Auto Scaling
Components of Auto Scaling, scaling options and policy, instance termination
Using load balancer with Auto Scaling,
Module 4 08 Hours
Virtual Private Cloud
What is Amazon VPC, VPC as a networking layer for EC, IP address and CIDR
notations, Components of VPC – network interfaces, route tables, internet
gateway, NAT, Security in VPC – security groups and NACL, types of VPC,
Module 5 08 Hours
Storage – Simple Storage Service (S)
Introduction to AWS storage, Pre-S – online cloud storage, API, S consistency
models, Storage hierarchy, buckets in S, Objects in S, metadata and storage
classes, object versioning, object lifecycle management, S pricing.
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from
each module
99
Text Books:
1. Amazon Web Services in Action. Michael Wittig and Andreas Wittig Foreword by
Ben Whaley September 2015 ISBN 9781617292880
2. Learning Amazon Web Services (AWS): A Hands-On Guide to the Fundamentals of
AWS Cloud | First Edition | By Pearson Paperback – 1 November 2019
Reference Books:
1. AWS Cookbook. Book by John Culkin and Mike Zazon. Released December 2021
Publisher(s): O'Reilly Media, Inc. ISBN: 9781492092605
2. by John Culkin, Mike Zazon. Serverless Architectures on AWS. Peter Sbarski, Yan
Cui, Ajay Nair. February 2022 ISBN 9781617295423
TEACHING METHODS
 PPTs
 Hands-On Sessions Based Teaching
 AWS Web
ASSESSMENT METHODS
 Three Mid-Semester examinations (MSE) will be conducted for 30 Marks each. The
weightage of MSE-1, 2 & 3 will be 40%, 40% and 20% respectively.
 Evaluation of learning activity based on Programming Assignments, Case studies,
Mini Projects for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: AWS cloud values and Implement different policies using its services
CO2: Analyze and manage billing and pricing used for the resources
CO3: Design and deployment of different applications using its services
CO4: Leads to the next level of preparation i.e. Associate and Professional level

CO-PO-PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 1 2 1 1 1 2
CO2 2 2 1 1 1 1 2
CO3 2 2 1 2 1 1 1 2
CO4 2 2 2 1 1 1 1 2

Robotic Process Automation

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – III
Subject Code 22MCA3052E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
CREDITS – 03
COURSE DESCRIPTION
Robotic Process Automation (RPA) is software technology that’s easy for anyone to use to
automate digital tasks. RPA Course Syllabus is enhancing the students to perform the
robotic process automation jobs using various tools like Blue Prism, UiPath, or Automation
Anywhere. The course covers key important concepts such as Introduction to RPA, RPA
100
platforms, Advanced RPA concepts, Deploying and maintain the bot.
PREREQUISITES
 Basic Programming Concepts
COURSE OBJECTIVES
This course enables the students to:
 Outline the benefits of RPA and various platforms available on the market.
 Understand to store and manipulate data in a more persistent way
 Understand Image, Text and Data Tables Automation
 Make use of exception handling techniques to handle the log errors
 Experiment with workflow in a manner to get the optimized output from a Bot
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
INTRODUCTION TO ROBOTIC PROCESS AUTOMATION:
Scope and techniques of automation, Robotic process automation - What
can RPA do? Benefits of RPA, Components of RPA, RPA platforms, The
future of automation.
RPA BASICS:
History of Automation - What is RPA - RPA vs Automation - Processes &
Flowcharts - Programming Constructs in RPA - What Processes can be
Automated - Types of Bots - Workloads which can be automated - RPA
Advanced Concepts - Standardization of processes - RPA Development
methodologies - Difference from SDLC - Robotic control flow architecture -
RPA business case - RPA Team - Process Design Document/Solution
Design Document - Industries best suited for RPA - Risks & Challenges
with RPA - RPA and emerging ecosystem.
Module 2 08 Hours
RPA Platforms-
Components of RPA- RPA Platforms-About Ui Path- About UiPath - The
future of automation - Record and Play - Downloading and installing UiPath
Studio -Learning Ui Path Studio- - Task recorder - Step-by step examples
using the recorder.
Module 3 08 Hours
ADVANCED AUTOMATION CONCEPTS & TECHNIQUES:
RPA Challenge - Image, Text & Advanced Citrix Automation – Introduction
to Image & Text Automation - Image based automation - Keyboard based
automation - Information Retrieval - Advanced Citrix Automation
challenges - Best Practices - Using tab for Images - Starting Apps - Excel
Data Tables & PDF - Data Tables in RPA - Excel and Data Table basics -
Data Manipulation in excel – Extracting, Data from PDF - Extracting a
single piece of data - Anchors - Using anchors in PDF
Module 4 08 Hours
HANDLING USER EVENTS & ASSISTANT BOTS, EXCEPTION
HANDLING:
What are assistant bots? - Monitoring system event triggers - Hotkey
trigger - Mouse trigger - System trigger - Monitoring image and element
triggers - An example of monitoring email - Example of monitoring a
copying event and blocking it - Launching an assistant bot on a keyboard
101
event.
EXCEPTION HANDLING:
Debugging and Exception Handling - Debugging Tools - Strategies for
solving issues - Catching errors.
Module 5 08 Hours
DEPLOYING AND MAINTAINING THE BOT:
Publishing using publish utility - Creation of Server - Using Server to
control the bots - Creating a provision Robot from the Server - Connecting a
Robot to Server - Deploy the Robot to Server - Publishing and managing
updates - Managing packages - Uploading packages - Deleting packages.
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from
each module.
Text Book:
1. Alok Mani Tripathi, “Learning Robotic Process Automation”, Packt Publishing,
2018
Reference Books:
1. Frank Casale , Rebecca Dilla, Heidi Jaynes , Lauren Livingston, “Introduction to
Robotic Process Automation: a Primer”, Institute of Robotic Process
Automation,1st Edition 2015.
2. Richard Murdoch, Robotic Process Automation: Guide To Building Software
Robots, Automate Repetitive Tasks & Become An RPA Consultant”, Independently
Published, 1st Edition 2018.
3. Srikanth Merianda, “Robotic Process Automation Tools, Process Automation
and their benefits: Understanding RPA and Intelligent Automation”, Consulting
Opportunity Holdings LLC, 1st Edition 2018.
4. Lim Mei Ying, “Robotic Process Automation with Blue Prism Quick Start
Guide: Create software robots and automate business processes”, Packt
Publishing, 1st Edition 2018.
Web References:
1. https://www.uipath.com/rpa/robotic-process-automation
2. https://www.academy.uipath.com
TEACHING METHODS
 PPTs
 Black Board
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and Weightage of 40%, 40%
and 20% from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation for Learning Activity will be based on Case studies for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Describe RPA, where it can be applied and how it’s implemented.
CO2: Describe the different types of variables, Control Flow and data manipulation
techniques.
CO3: Identify and understand Image, Text and Data Tables Automation.
102
CO4: Describe how to handle the User Events and various types of Exceptions and
strategies.
CO5: Understand the Deployment of the Robot and to maintain the connection.

CO-PO-PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 2
CO2 3 2 1 1 1 2
CO3 2 2 2 1 1 1 2
CO4 2 2 2 1 1 1 1 2
CO5 2 2 1 2 1 1 1 2

DevOps
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – III
Subject Name 22MCA3053E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
Credits – 03
COURSE DESCRIPTION
This course is designed to offer deep insights and knowledge into various tools such as
Ansible, Puppet, Nagios, Jenkins and Docker. With the a depth learning of DevOps course a
student will be able to become a trained practitioner in the integration and monitoring of
software throughout their development cycle.
103
PREREQUISITES
 Basic understanding of Linux/Unix system concepts and administration.
 Familiarity with command-line interface.
 Knowing how build and deployment process works.
COURSE OBJECTIVES
 The objectives of the DevOps methodology are to speed up the time to market, apply
incremental improvements in response to the changing environment, and create a more
streamlined development process.
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
Introduction to Devops- What Is Devops, History of Devops, Devops
definition, DevOps Main Objectives, DevOps and Software Development Life
Cycle- Waterfall Model and Agile Model
Continuous Integration & Deployment- Jenkins, Containers and Virtual
Development- Docker and Vagrant
Configuration Management Tools-Ansible, Puppet and Chef.
Module 2 08 Hours
Cloud Computing- What is Cloud?, Evolution of Cloud Computing, IAAS
(Infrastructure as a Service), SAAS (Software as a Service), PAAS (Platform as
a Service), Private, Public and Hybrid Cloud, Public Clouds- Amazon Web
Services, Microsoft Azure and Google Cloud Services.
LINUX Basic and Admin- Linux OS Introduction, Importance of Linux in
DevOps, Linux Basic Command Utilities, Linux Administration and
Environment Variables
Module 3 08 Hours
Shell Scripting - Introduction, Variables, Flow Controls, Loops, Functions,
Lists, Manipulating Strings, Reading and Writing Files and Positional
Parameters.
Version Control- Overview of SVN, GIT Features, 3-Tree Architecture, GIT –
Clone /Commit / Push, GIT Hub Projects, GIT Hub Management, GIT Rebase
& Merge, Reset, Checkout ,GIT Clone, Fetch and Pull .
Module 4 08 Hours
Continuous Integration – Jenkins- Introduction to Jenkins , Continuous
Integration with Jenkins , Configure Jenkins, Jenkins Management , Scheduling
build Jobs - POLL SCM and Build Periodically
ANSIBLE - Introduction to Ansible, Infrastructure Management , SSH
Connection in Ansible Master
Module 5 08 Hours
Playbooks- Variables, Conditionals, Loops, Blocks, Handlers and Templates
Docker- How to get Docker Image? , What is Docker Image, Working with
Docker Containers- What is Container, Docker Engine, Creating Containers
with an Image, Working with Images and Docker Command Line Interphase

104
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. Let's Get Started to DevOps- Hary Cahyono
2. Practical DevOps – Joakim Verona, PACKT Publisher
3. DevOps for Developers – Michael Huttermann, APress
TEACHING METHODS
 PPTs
 Hands-On Sessions Based Teaching
ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and Weightage of 40%, 40% and
20% from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation for Learning Activity is based on Assignments/ Case studies for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Understand overall structure of Devops with its Lifecycle
CO2: Understand the different application managed service options in the cloud using LINUX
CO3: Demonstrate DevOps workflow with GitLab learning Shell Script
CO4: Discover practical skills of Continuous Integration to improve the speed, stability,
availability and security for software delivery capability
CO5: Apply practical skills needed for integrating container

CO-PO-PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 2
CO2 3 1 1 2
CO3 2 3 1 1 1 1 2
CO4 2 2 2 2 1 1 2
CO5 2 2 2 1 1 1 1 2

IOT Data Analytics

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER –III
Subject Code 22MCA3061E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
Credits – 03
COURSE DESCRIPTION
This Course focuses on IoT concepts such as sensing, actuation and communication. It covers
105
the development of Internet of Things (IoT) prototypes—including devices for sensing,
actuation, processing, and communication—to help you develop skills and experiences.
PREREQUISITES
 Basic knowledge of C or C++ or any programming language or programming
fundamentals. Familiarity with command-line interface.
 Basic knowledge of Operating system concepts.
COURSE OBJECTIVES
 After the completion of the course, the students will be able design some IOT based
prototypes
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
Introduction to IoT Analytics
IoT Data and Big data, Types of Data – Structured and Unstructured,
Challenges of IoT Analytics Applications, IoT Analytics Lifecycle and
Techniques, Cloud based IoT Platform, Data Analytics for IoT, Data
Collection using Low-power, Low-range Radios, A search Architecture for
social and physical sensors.
Module 2 08 Hours
IoT Design Methodology
IoT design system management-On-chip communications Protocols -
USART, I2C, SPI. Industrial Networking - RS482 and MODBUS, Vehicle
Networking Standards, NodeMCU (ESP8266 based IoT Board), Arduino
Programming. WAZIUP software platform, iKaaS software platform.
Module 3 08 Hours
IoT System Management
Need for IoT Systems Management, Simple Network Management Protocol
(SNMP), Network Operator Requirements, NETCONF, YANG, IoT Systems
Management with NETCONF-YANG, NETOPEER, NETCONF-YANG case
studies.
Module 4 08 Hours
IoT Analytics Models -Collect, Process, Store, Analyse, Build, Private and
Public Data Channels, Data- Sensor Data, Machine Data, Master Data, Data
Analysis and Data Visualization, Event scheduling, Alerts, Actions, App
integrations, Introduction MATLAB, Real time analytics Use cases
Smart agriculture, Process efficiency scoring
Module 5 08 Hours
Case Studies and Advanced Topics
Case Study on: Home, Cities, Environment, Energy Systems, Retail, Logistics,
Industry, Agriculture, Health and Lifestyle. Project: Smart-home Industrial IoT
Implementation.
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from
each module
106
Text Books
1. Building Blocks for IoT Analytics, John Soldatos – Athens Information Technoogy,
Grees, River Publishers, 2017, ISBN:978-87-93519-03-9(Hardback) 978-87-93519-04-
6(Ebook).
2. IoT Fundamentals - Networking Technologies, Protocols and Use Cases for the
Internet of Things (English, Paperback, Rowan Trollope, David Hanes, Patrick
Grossetete, Jerome Henry, Rob Barton, Gonzalo Salgueiro)
3. Arshdeep Bahgaand Vijay Madisetti, “Internet of Things - A Hands on Approach”,
Universities Press, 2015.
4. Foundational Elements of an IoT Solutions : The Edge, The Cloud Application
Development, Joe Bironand Jonathan Follett..
Reference Books:
1. Rethinking the Internet of Things: A Scalable Approach to Connecting Everything, by
Francis daCosta, ISBN: 978-1-4302-5740-0, 2013
2. Architecting the Internet of Things, by Dieter Uckelmann, Mark Harrison and Florian
Michahelles, ISBN: 978-3-642-19157-2, 2011.
TEACHING METHODS
 PPTs
 Hands-On Sessions Based Teaching
ASSESSMENT METHODS
 Three Mid-Semester examinations (MSE) will be conducted for 30 Marks each. The
weightage of MSE-1, 2 & 3 will be 40%, 40% and 20% respectively.
 Evaluation of learning activity based on Case studies/ Mini Projects for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Understanding of IoT value chain structure (device, data cloud), application areas and
technologies involved.
CO2: Understand IoT sensors and technological challenges faced by IoT devices, with a focus
on wireless, energy, power, and sensing modules
CO3: Market forecast for IoT devices with a focus on sensors
CO4: Understanding the implementation of web-based services on IoT devices
CO-PO-PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 1 2 3 2
CO2 2 2 1 3 2
CO3 2 2 1 3 2
CO4 2 2 2 1 3 2

Big Data Analytics

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – III
Subject Code 22MCA3062E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
Credits – 03
COURSE DESCRIPTION
This course provides an understanding of Big Data Analytics. The course also provides details
about the structure and magnitude of the big data, sources of bigdata. The course comprises of
107
operating big data with algorithms and various methods, and descriptions of tool Hadoop and
its uses. The course highlights the techniques involved in Hadoop like HDFS and Map
Reduce techniques.
PREREQUISITES
 Student should know the concepts DBMS, Algorithms and applied mathematical
concepts.
 Students should know basic programming concepts.
 Student should know about distributed systems and basic programming concepts.
COURSE OBJECTIVES
 To understand the fundamentals Big data concepts.
 To understand various operations involved in big data analysis.
 To understand the fundamentals of Hadoop concepts.
 To understand the basic working of HDFS and Map Reduce techniques.
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
Big Data and Analytics: Example Applications, Basic Nomenclature, Analysis
Process Model, Analytical Model Requirements , Types of Data Sources,
Sampling, Types of Data Elements, Data Exploration, Exploratory Statistical
Analysis, Missing Values, Outlier Detection and Treatment, Standardizing Data
Labels, Categorization

Module 2 08 Hours
Big Data Technology: Hadoop’s Parallel World, Data discovery, Open source
technology for Big Data Analytics, Cloud and Big Data, Predictive Analytics,
Mobile Business Intelligence and Big Data, Crowd Sourcing Analytics, Inter-
and Trans-Firewall Analytics.

Module 3 08 Hours
Meet Hadoop: Data, Data Storage and Analysis, Comparison with Other
Systems, RDBMS, Grid Computing, Volunteer Computing, A Brief History of
Hadoop, Apache Hadoop and the Hadoop Ecosystem Hadoop Releases
Response.

Module 4 08 Hours
The Hadoop Distributed File system: Design of HDFS; HDFS Concepts; The
Command-Line Interface; Basic Filesystem Operations; Hadoop File systems
Interfaces; The Java Interface: Reading Data, Writing Data, Querying the File
system, Deleting Data; Anatomy of a File Read, Anatomy of a File Write;
Parallel Copying with distcp; Keeping HDFS Cluster Balanced; Hadoop
Archives.

Module 5 08 Hours
MAPREDUCE APPLICATIONS :Writing a Unit Test; Running locally on
Test data; MapReduce workflows; Anatomy of MapReduce job run: Classic
Map-reduce, YARN; Failures in classic Map-reduce and YARN; Job
scheduling; Shuffle and sort; Task execution; MapReduce types and formats:
MapReduce types, Input formats, Output formats.
108
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. Bart Baesens, “Analytics in a Big Data World: The Essential Guide to Data Science
and its Applications”, Wiley.
2. Michele Chambers, AmbigaDhiraj, and Michael Minelli, “Big Data, Big Analytics:
Emerging Business Intelligence and Analytic Trends for Today’s Businesses”, 1 st
Edition, Wiley CIO Series, 2013.
3. Tom White, “Hadoop: The Definitive Guide”, 3rd Edition, O’Reilly, 2012
Reference Books:
1. 1. Boris Lublinsky, Kevin T. Smith, Alexey Yakubovich, “Professional Hadoop
Solutions”, Wiley, ISBN: 9788126551071, 2015.
2. Chris Eaton, Dirk deroos et al., “Understanding Big data: Analytics for Enterprise
Class Hadoop and Streaming Data”, McGraw Hill, 2012.
3. VigneshPrajapati, “Big Data Analytics with R and Hadoop”, Packet Publishing.
TEACHING METHODS
 PPTs
 Hands-On Sessions Based Teaching
ASSESSMENT METHODS:
 Three Internals will be conducted for 30 Marks each and Weightage of 40%, 40% and
20% from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation for Learning Activity is based on Seminar/ Quiz / Case Studies for 20
Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: To Identify the business problem for a given context and frame the objectives to solve it
through data analytics tools.
CO2: To Apply various algorithms for handling large volumes of data..
CO3: To Understand the usage of Hadoop for big data management.
CO4: To Illustrate the architecture of HDFS and explain functioning of HDFS clusters
CO5: To Analyze the usage of Map-Reduce techniques for solving big data problems

CO-PO-PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 1 1 2
CO2 2 1 2 1 1 1 1 2
CO3 3 2 1 1 1 2
CO4 3 1 1 1 2
CO5 1 2 2 2 1 1 1 2
109
 User Interface and User Experience
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – III
Subject Code 22MCA3063E CIE Marks 50
Number of Lecture Hours/Week 03 SEE Marks 50
Total Number of Lecture Hours 40 SEE Hours 03
CREDITS – 03
COURSE DESCRIPTION
This course introduces the principles of user interface development, focusing on the areas
of Design, Implementation, and Evaluation.
PREREQUISITES
110
  Students should know the elements of Software Development
COURSE OBJECTIVES
 To understand the principles of designing user interfaces and the importance of
User Experience (UX).
 To understand the role of user interface in Human-Computer Interaction (HCI)
COURSE CONTENTS
Modules Teaching
Hours
Module 1 08 Hours
Introduction: Usability of Interactive Systems: Introduction, Usability
Goals and Measures, Usability Motivation, Universal Usability, Goals for
our profession.
Guideline, principles, and theories: Introduction, Guidelines, principles,
Theories.
User Experience (UX): Introduction, User Interface v/s User Experience,
Why is User Experience Important, What is good usability, User interaction
with products.
Development Processes: Managing Design Processes: Introduction, The
Four Pillars of Design, Development methodologies: Ethnographic
Observation, Participatory Design, Scenario Development
Module 2 08 Hours
Information Architecture and Application Structure: Purpose,
Definition, Approach, Ways to Organize and Categorize Content,
Designing for Task and Workflow-Dominant Apps, Designing a System of
Screen Types, The Patterns – Feature, Search and browse, News Stream,
Picture Manager, Dashboard, Canvas Plus Palette, Wizard, Setting Editor,
Alternative Views, Many Workspaces. Help Systems
Visual Style and Aesthetics: Same content, Different styles, The Basics of
Visual Design, What This Means for Desktop Applications
The Patterns: Deep Background, Few Hues, Many Values, Corner
Treatments, Borders That Echo Fonts, Hairlines, Contrasting Font Weights,
Skins and Themes.
Module 3 08 Hours
Mobile Interfaces: The Challenges and Opportunities of Mobile Design,
How to Approach a Mobile Design, The Patterns
Design and UX: Users Vs Life Cycles, Visual Design, Web standards,
Potential Barriers to sustainable UX
Designing for Emerging Technologies: Design for Disruption, Eight
Design Tenets for Emerging Technology, Changing Design and Designing
Change
Fashion with Function: Designing for wearable devices, the next big wave
in technology, the wearable market segments, Wearable are notable, UX
(and Human) Factors to consider.
Module 4 08 Hours
An Ecosystem of connected device: The concept of an Ecosystem, The 3Cs
Frame work: Consistent, Continuous and Complementary, Single Device
Design is History
The Consistent Design Approach: What is consistent Design, Consistency
in Minimal Interface, Beyond Device Accessibility, Devices are means not
111
an end
Module 5 08 Hours
The Continuous and Complementary Design Approach: The continuous
Design Approach: What is Continuous Design? Single Activity flow and the
Sequenced Activity Flow. What is Complementary Design? Collaboration:
Must-Have, Collaboration: Nice to have, Control: Nice to Have, Fascinating
Use Cases: What do they mean for my work? Integrated Design Approaches:
3 Cs as building blocks: Beyond the Core Devices: The Internet of Things,
The Internet of Things already there?
Question paper pattern:
 The question paper will have ten questions.
 Each full question consists of 20 marks.
 There will be 2 full questions from each module.
 Each question will have questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from
each module.
Text Book:
1. Ben Shneiderman, Plaisant, Cohen, Jacobs: Designing the User Interface, 5th
Edition, Pearson, Education, 2010.
2. Jenifer Tidwell, “Designing Interfaces”, 2 nd Edition, Oreilly, 2015.
3. Jonathan Follet, “Designing for Emerging Technologies- UX for Genomics,
Robotics and The Internet of Things”, 1st Edition, Oreilly, 2014.
4. Tim Frick, “Designing for Sustainability”, 1st Edition, Oreilly 2016.
Reference Books:
1. Eberts: User Interface Design, Prentice Hall, 1994
2. Wilber O Galitz: The Essential Guide to User Interface Design- An Introduction
to GUI Design, Principles and Techniques, Wiley-Dreamtech India Pvt Ltd, 2011
3. Ian Pouncey, Richard York: Beginning CSS: Cascading Style Sheets for Web
Design, Wiley India
4. The Elements of User Experience: User-Centred Design for the Web by Jesse
James
5. Unger and Chandler, “A Project Guide to UX Design”, 2 nd Edition, New
Riders, 2012
TEACHING METHODS
 Black-board teaching
 PPTs
 Video-based teaching

ASSESSMENT METHODS
 Three Internals will be conducted for 30 Marks each and Weightage of 40%, 40%
and 20% from 1st, 2nd and 3rd internals respectively will be taken.
 Evaluation for Learning Activity is based on Assignments, Case studies, Mini
Projects for 20 Marks.
 Final Examination will be conducted for 100 Marks and Evaluated for 50 Marks.
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Explain the concepts related to User interface or User Experience
CO2: Apply the knowledge of features, approach, patterns for designing User Interface or
User Experience for a given scenario.
CO3: Understand mobile interfaces & current trends in UX design
112
CO4: Understand the ecosystem of connected devices
CO5: Analyse the best design approach with the help of use cases

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 3 2
CO2 2 2 3 3 2 1 1 3 2
CO3 3 1 1 3 2
CO4 3 1 1 3 2
CO5 2 2 2 2 1 1 3 2

Programming Using C# and .NET Laboratory

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – III
Subject Code 22MCA307L CIE Marks 50
Number of Hours/Week 02 Hrs Laboratory SEE Marks 50
SEE Hours 03
CREDITS – 01
COURSE DESCRIPTION
To develop software development skills in C# programming and Students will have the
proficiency to develop projects in C# programming. The course helps the students to solve the
interdisciplinary applications through C# programming.
113
To write programs for solving real world problems using .NETcollection framework.
PREREQUISITES
 Basic understanding of Principles of Programming.
 Basic understanding of Operating System, Networking, RDBMS and Files
COURSE OBJECTIVES
 Practice object-oriented programs and build .NET applications.
 Implement C# programs for establishing interfaces.
 Implement sample programs for developing reusable software components.
 Create database connectivity in C# and implement GUI applications.
Laboratory Experiments:
SECTION A
1.Write a Program in C# to demonstrate Command line arguments processing for
the following.
a) To find the square root of a given number.
b) To find the sum & average of three numbers.
2.Write a Program in C# to demonstrate the following
a) Boxing and Unboxing b) Invalid Unboxing.
3. Write a program in C# to add Two complex numbers using Operator overloading .
4. Write a Program in C# to find the sum of each row of given jagged array of 3 inner arrays.
5. Write a Program in C# to demonstrate Array Out of Bound Exception using Try, Catch and
Finally blocks.
6.Write a Program to Demonstrate Use of Virtual and override key words in C# with a simple
program.
7. Write a Program in C# to create and implement a Delegate for any two arithmetic operations
8. Write a Program in C# to demonstrate abstract class and abstract methods in C#.
9. Write a program to Set & Get the Name & Age of a person using Properties of C# to illustrate
the use of different properties in C#.
10. Write a Program in C# Demonstrate arrays of interface types (for runtime polymorphism).
11. Consider the Database db_EMS (Employee Management System) consisting of the following
tables :
tbl_Designations (IdDesignation: int, Designation: string)
tbl_EmployeeDetails (IdEmployee: int, Employee Name: string, Contact Number: string, Id
Designation: int, IdReportingTo: int)
Develop a suitable window application using C#.NET having following options.
1. Enter new Employee details with designation & Reporting Manager.
2. Display all the Project Leaders (In a Grid) reporting to selected Project Managers (In a Combo
box).
3. Display all the Engineers (In a Grid) reporting to selected Project Leader (In a Combo box).
4. Display all the Employees (In a Grid) with their reporting Manager (No Value for PM).
12.Consider the Database db_LSA (Lecturer Subject Allocation) consisting of the following tables:

tbl_Subjects(IdSubject: int, SubjectCode: string, SubjectName: string)

tbl_Lecturers(IdLecturer: int, LecturerName: string, ContactNumber: string)
tbl_LecturerSubjects(IdSubject: int, SubjectCode: string, IdLecturer: int)
Develop a suitable window application using C#.NET having following options.
1. Enter new Subject Details.
2. Enter New Lecturer Details.
114
3. Subject Allocation with Lecturer Name in a Combo box and subjects to be allocated in Grid
with checkbox Column.
4. Display all the subjects allocated (In a Grid) to the selected Lecturer (In a Combo Box).
13. Consider the database db_VSS (Vehicle Service Station) consisting of the following tables:

tbl_VehicleTypes(IdVehicleType: int, VehicleType: string, ServiceCharge: int)

tbl_ServiceDetails(IdService: int, VehicleNumber: string, ServiceDetails: string, IdVehicleType:
int)
Develop a suitable window application using C#.NET having following options.
1. Enter new Service Details for the Selected Vehicle Type (In a Combo Box).
2. Update the Existing Service Charges to Database.
3. Total Service Charges Collected for the Selected Vehicle (In a Combo box) with total amount
displayed in a text box.
TEACHING METHODS

 PPTs
 Hands-On Sessions Based Teaching
 Visual Studio 2008 and above
ASSESSMENT METHODS

Experiment Write up + Execution + Viva 20

Lab Record Writing 15
Lab Internals Test 15
Total 50
Final Exam will be conducted for 50 marks (SEE).
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Understand C# and client-server concepts using .Net Frame Work Components
CO2: Apply delegates, event and exception handling to incorporate with ASP, Win Form,
ADO.NET
CO3: Analyze the use of .Net Components depending on the problem statement
CO4: Implement & develop a web based and Console based application with Database
connectivity

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 3
CO2 2 2 3 1 1 1 1 3
CO3 2 2 2 1 1 1 1 3
CO4 2 3 1 1 1 1 3

115
 FULL STACK WEB DEVELOPMENT LABORATORY
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER III
Subject Code 22MCA308L CIE Marks 50
Number of Lecture Hours/Week 02 Hrs Laboratory SEE Marks 50
SEE Hours 03
CREDITS – 01
COURSE DESCRIPTION: This course prepares the students to create single-page or mobile
applications and also creates reusable components for web pages and mobile applications.
They also get knowledge on Basic elements include JSX overview, environmental setup, real-
time applications, forms and UI, Component Lifecycle, Event Handling, and Styles.
PREREQUISITES:
 The student should be acquainted about programming terms such functions, objects,
arrays, and to a lesser extent classes.
116
  Students should be familiar with HTML, CSS, and JavaScript on a basic level.
COURSE OBJECTIVES
 Understand the need for server side rendered apps.
 Use a JavaScript package manager (either npm or Yarn).
 Making HTTP requests to read or modify data.
 Students can understand how callbacks and MongoDB function.
 Students able to create CRUD operations, routing mechanisms, and UI components.
Laboratory Experiments:
1 Design a resume of a job aspirant using React components like Classes and
Functions. Style the resume by applying CSS
2 Build Student Registration Portal using entities like component, State and Props
3 Demonstrate Node Js Application to perform CRUD operation for online Book
Cart.
4 Design an employee Management system using RESTFULL APIs in React.
5 Deploy connectivity between React and Node Application for Inventory
Management system
6 Development of an application using RESTFULL API’s
ASSESSMENT METHODS
Experiment Write up + Execution + Viva 20
Lab Record Writing 15
Lab Internals Test 15
Total 50
Final Exam will be conducted for 50 marks (SEE)
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: Understand the concepts of Model, view and controller for developing applications using
ReactJS.
CO2: Able to develop various types of React Js Components.
CO3: Design web application using MERN Framework.
CO4: Understand and design MongoDB model and view.
CO5: Demonstrate MVC Framework for real application.

CO-PO-PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2 1 1 3 2
CO2 1 2 2 1 1 1 1 3 2
CO3 2 3 1 1 1 1 3 2
CO4 2 3 1 1 1 1 3 2
CO5 2 3 1 1 1 1 3 2

117
 000000000000000000000000000000000000000000000
…………………………………………………….MINI PROJECT - IOT
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER III
Subject Code 22MCA309P CIE Marks 50
Number of Lecture Hours/Week 02 Hrs Laboratory SEE Marks 50
Tutorials 02 Hrs SEE Hours 03
CREDITS – 02
COURSE OBJECTIVES
 To select a problem which addresses some basic home, office or other real life
applications.
 To Apply new technologies & design techniques concerned for devising a solution
for a given problem statement

118
 
To Gain project management skill

Work with teammates, sharing due and fair credits and collectively apply effort for
making project successful.
 To Develop skill at conveying activities and achievements
Guidelines:
A team of five to six students must develop the mini project. Each team shall carry out
the project under the guidance of one of the faculty members of the Department.
 At the end of the Semester, the team must submit a brief report (15-20 pages spiral
bound) on the work they have pursued through the Semester.
 During the examination, each group must demonstrate the project.
ASSESSMENT METHODS
 Evaluation will be done based on Synopsis Submission, Reviews and final
Demonstration of the working project for 50 marks.
 Final Exam will be conducted for 50 marks (SEE)
Course Outcome (CO): At the end of this course, the students will be able to:
CO1: To identify a problem in the real world that needs to be addressed.
CO2: To review the literature and carry out the design.
CO3: To apply current technologies, create systems and solve problems.
CO4: To Show an attitude of team work and independent working on problems.
CO5: To demonstrate the project with effective writing and communication skills.

CO-PO-PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 1 1 3 2 2 3
CO2 3 1 1 1 1 3 2 2 3
CO3 1 3 2 3 3 2 1 1 1 3 2 3
CO4 1 3 1 1 3
CO5 3 1 1 2 3

FOURTH SEMESTER

Sl. No. Course Code Course Title Examination Credits

119
 Duration SEE CIE Total
in hours Marks Marks Marks

1 22MCA401C MOOC course - - 50 50 1

Industry Internship (6
2 22MCA402I Weeks) - - 50 50 3

Project Work (During

3 22MCA403P 3 100 100 200 20
IV semester 16 weeks)

Total 3 100 200 300 25

Grand Total (I to IV Semesters): 3300 Marks : 100 Credits

Massive Open Online Course (MOOC)

[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – IV
Subject Code 22MCA401C CIE Marks 50
CREDITS – 02

Guidelines for MOOC:

 A self-study certification course (MOOC) of 02 credits shall be completed by all the
students during the course for the award of the degree.
 The course duration for 02 credits shall be of 08 Weeks only.
 The students will have to register and take up proctored exam only through NPTEL
120
 under SWAYAM portal.
 The certificate taken from any other online certification course other than NPTEL for
MOOC is considered to be invalid.
 The list of courses under computer Science will be recommended by the department
after NPTEL has announced the list of upcoming courses in SWAYAM portal.
 The certificate obtained after taking up the proctored exam will be submitted and the
marks obtained will be considered for CIE.
 However there will be no separate SEE for the MOOC course.
 The student can take up the MOOC course any time during the entire duration of the
MCA course.
 The student will be considered as fail in MOOC Course in case he/she
o Scores less than 50 out of 100 in the proctored examination.
o Fails to submit the certificate in the semester.

Course Outcomes (COs):

CO1: Identify the course/technology to learn.
CO2: Demonstrate the concepts/technology learnt.
CO3: Apply the concepts in solving real world problems.

CO-PO-PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2 2 1 1 1
CO2 1 2 3 2 1 1 1
CO3 1 2 2 2 2 1 1 1 1

Industry Internship
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – IV
Subject Code 22MCA402I CIE Marks 50
CREDITS – 03

Guidelines for Industry Internship:

 All the students have to undergo mandatory internship of 06 weeks duration during the
vacation of III semester.
 Students have to undergo the Internship in any Institute of National repute or any
reputed / well-known industry.
121
  The Industry Internship shall be carried out by each candidate independently under the
guidance of one of the faculty members of the Department.
 On completion of Internship they shall submit a brief report to the department.
 Internship shall be considered as a head of passing and shall be considered for the award
of degree.
 Those, who do not take-up/complete the internship shall be declared as fail in internship
course and have to complete the same during the subsequent semester.
 After satisfying the internship requirements the degree will be awarded. However,
student can carry out 4thsemester project without completing the internship.

Course Outcomes: After completing this course, students will able to:
CO 1: Understand the process of applying the knowledge related to IT in order to solve
industrial problems.
CO 2: Develop skills through relevant training to industrial requirement
CO 3: Communicate effectively and work in teams.
CO 4: Ability to write technical documents
CO 5: Imbibe ethical practices and develop it as a life skill

CO-PO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 2 1 1 2 2 3 3 2
CO2 3 2 3 3 2 1 1 1 2 1 2 2 3 2
CO3 3 3 3 3 1 3 2
CO4 3 3 1 3 2
CO5 3 3 2

Project Work
[As per Choice Based Credit System (CBCS) scheme]
SEMESTER – IV
Subject Code 22MCA403P CIE Marks 100
No of Hours/Week 03 SEE Hours 03
SEE Marks 100
CREDITS – 20

Dissertation Work Guidelines:

 The student shall carry out the project work in the same institution or in industry / R&D
labs based on software tools and technologies learnt in MCA course / Internship for a
minimum period of 16 weeks.

122
  The dissertation work shall be carried out by each candidate independently under the
guidance of one of the faculty members of the Department.
 If dissertation is carried out in any industry/ R&D Labs, outside the campus, the name of
external guide at the organization shall be intimated to the head of the department.
 Project work may be application oriented or research oriented as per student and guide‘s
interest. Therefore, the project reports will vary depending on whether it is application-
oriented project or research based project.
 The students, signed by the external guide and internal guide, should maintain project
work dairy.
 At the end of the semester, each candidate shall prepare a draft report of the dissertation
work and submit it for plagiarism check (Plagiarism ≤ 20%) using facility in NMIT library.
 The internal guide shall duly approve the report after the plagiarism check.
 The candidate shall submit two hard-bound copies and the soft copy of the dissertation
work to the head of the Department.
 A separate calendar of events for submission of dissertation and viva-voce shall be fixed
by the examination section and shall be notified.
 The candidates who fail to submit the dissertation work with in the stipulated time have to
submit the same at the time of next ensuing examination.
 The COE / Principal shall appoint both the internal examiners and External examiners for
the Final Evaluation of the project.
 A copy of the dissertation will be sent to the external examiners by the chairperson of BOE.
 If the report is rejected, internal guide has to communicate to the candidate for
modification as per the suggestions made by the External Examiner and resubmit.
 Internal guide and External Examiners shall carry out the evaluation of Dissertation report
for 50 marks individually.
 Dissertation assessment by the internal guide will be considered as CIE and dissertation
assessment by the external examiner will be considered as SEE.
 The students shall give poster presentation of their project before the SEE.
 The students shall also prepare a research paper of their project in the prescribed format
and submit it to their guides before SEE. However, it is not mandatory requirement for the
student to publish the research paper in the indexed journal / conference by the student for
taking up the SEE.

Internal Evaluation and Viva Voce Guidelines:

 Internal assessment (CIE) shall be evaluated by both the internal and external guide for
50 marks individually. The average of the marks allotted by the internal and external
guides shall be the final marks for the Internal Evaluation.
 The project presentation and Viva-voce (SEE) shall be evaluated jointly by both the
Internal and external examiners for 50 marks.

Course Outcomes: After completing this course, students will able to

CO 1: Identify and finalize the problem relevant to Computer Applications with an attention to
real life problems faced by the society
CO 2: Review the literature, Model and design the solution for framed problem statement.
CO 3: Implement the design, verify, validate and analyze the results.
123
CO 4: Document and communicate the project work efficiently
CO 5: Manage as an individual or in a team in development of technical projects.

CO-PO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 2 1 1 2 2 3 3 2
CO2 3 2 3 3 1 1 1 2 1 2 2 3 2
CO3 3 3 3 3 2 2 1 3 2
CO4 3 3 1 3 2
CO5 3 3 1 3 2

124