DEPARTMENT OF COMPUTER SCIENCE

Minutes of the meeting of Board of Studies in Computer Science for Master of

Computer application and M.Sc. (Computer Science) Programme (Odd Semester,
2024-2025) held on 14th September 2024 (Saturday) at 11 A.M. in the Department of
Computer Science.

Name of the Member Role

Dr.T.S.Ravi Kiran, HOD, Dept of CS, P.B. Siddhartha College of Arts &
Science. Mobile: 9441176980, Email: tsravikiran@pbsiddhartha.ac.in,
kirantsr1@gmail.com Chairman
Dr.R.Vijaya Kumari, Principal Product Director, Blue Yonder India
College of Engineering & Technology, Krishna Email: shankar.lakkaraju@gmail.com
University, Machilipatnam. Email: Mobile: 98851 65651
vijayakumari28@gmail.com, Mobile: 9948593964 Ms.K.Priya, Asst. Prof, P.B.Siddhartha College of Arts &
Dr.M.Babu Reddy, Assistant Professor, Department of Science.
Computer Science, Krishna University, Machilipatnam. University Nominee (Appeared through online)
Mobile: 9963436460, Email: m_babureddy@yahoo.com Subject Expert
Dr.P.Deepalakshmi, ME, Ph.D. (Appeared through online)
Professor and Dean, School of Computing
Kalasalingam Academy of Research and Education
Krishnankoil - 626126. Subject Expert
Virdhunagar (Dist), Tamil Nadu, India. (Appeared through online)
Email: deepa.kumar@klu.ac.in, deansoc@klu.ac.in
Mobile: 9865061291, 8838010443.
Bharat Kumar Reddy Gujavarti (M.C.A, PGDHRM),
Hyderabad Founder & CEO, Pragmatiq Systems Inc Industrialist
Director, Sunblue Technologies; Co-founder, Edify (Appeared through online)
Email: bharat@pragmatiq.in, Mobile: 8978191977
Shankar Lakkaraju, M.C.A: 1999-2002 Alumnus
(Appeared through online)

Mobile:7989782245 Member Mrs. A.Kavitha, Asst. Prof, P.B.Siddhartha College of Arts

& Science. Mobile: 9493486272 Member Mr. G.Samrat Krishna, Asst. Prof,

P.B.Siddhartha College of Arts & Science. Mobile: 9177937461 Member Mrs.B. Roja

Priscilla, Asst. Prof, P.B.Siddhartha College of Arts & Science. Mobile: 9949543216
Member
Ms. D.Sri Naga Prasanna, Asst. Prof, P.B.Siddhartha Mr.V.V.Ramana, Systems Analyst, P.B.Siddhartha
College of Arts & Science. Mobile:8790154520 College of Arts & Science.
Ms.K.Bhuvaneswari, Asst. Prof, P.B.Siddhartha College Member Member
of Arts & Science. Mobile:8247493147

Mobile: 7989415546 Member

AGENDA

1. To discuss and approve the Structure and Syllabi of Third Semester of M.Sc.(Computer
Science) Programme for the batch of students admitted from the Academic Year 2023-2024
(R22) and onwards.
2. To discuss and approve the Structure and Syllabi of First Semester of M.Sc.(Computer
Science) Programme for the batch of students admitted from the Academic Year 2024-2025
(R22) and onwards.
3. To discuss and approve the Structure and Syllabi of Third Semester of M.C.A Programme for
the batch of students admitted from the Academic Year 2023-2024 (R22) and onwards. 4. To
discuss and approve the Structure and Syllabi of First Semester of M.C.A Programme for the
batch of students admitted from the Academic Year 2024-2025 (R22) and onwards.
 Important Points

Mater of Computer Applications (MCA)

2023-25 – 3rd Semester: 3- Core courses and 3 Domain Specific courses syllabus
and Question Paper are revised (R22)
2024-26 – 1st Semester: 4-Core courses syllabus and Model Question Paper
are revised (R22)

COMPUTER SCIENCE - NAME OF THE PROGRAM - MCA

LIST OF THE COURSES REVISED IN I SEMESTER -2024-25
Course Code Course NameTeaching Hours / Week Type of
Year of Introduct ion Lecture Practical Tutorial the Course
Year of Revision CIA SEE No. of Credits

22CAL101A Python Programming 2022-23 2024-25 4 0 0 Core 30 70 4 22CAP101A Python Programming Lab

2022-23 2024-25 0 6 0 Core Lab 30 70 3

22CAL102A Database Technology 2022-23 2024-25 4 0 0 Core 30 70 4 22CAP102A Database Technology Lab

2022-23 2024-25 0 6 0 Core

Lab 30 70 3
Statistical Foundations 2022-23 No
22CAL103 Mathematical and Revision 4 0 0 Core 30 70 4
22CAL104 Software Engineering 2022-23 No
Revision 4 0 0 Core 30 70 4
Personality Development
Revision 3 0 0 Skill
22MBLSL101 Enlightenment Skills
through Life 2022-23 No Course 30 70 3

TOTAL FOR FIRST SEMESTER TOTAL : 31 210 490 25

COMPUTER SCIENCE - NAME OF THE PROGRAMS -MCA
LIST OF THE COURSES REVISED IN III SEMESTER -2024-25 Course Code
Name of the Course Teaching Hours / Type of the
Year of Year of Revision LPT
Introduction CourseCIA SEE CREDI TS
22CSL301A Data Science 2022-23 2024-25 4 0 0 Core 30 70 4 22CSP301A Data Science Lab 2022-23
2024-25 0 6 0 Core Lab 30 70 3 22CSP302A Machine Leaning Lab 2022-23 2024-25 0 6 0 Core Lab 30 70 3
DOMAIN SPECIFIC ELECTIVE COURSES (CHOOSE ANY THREE)

22CSDSL301A Design & Analysis of

Algorithms 2022-23 2024-25 4 0 0 DSE 30 70 4 22CSDSL302A Cryptography &

Network Security 2022-23 2024-25 4 0 0 DSE 30 70 4 22CSDSL303A Machine Learning

2022-23 2024-25 4 0 0 DSE 30 70 4 22CSDSL304 Applied Data Analysis 2022-23 No

Revision 4 0 0 DSE 30 70 4

22CSDSL305 Internet of Things 2022-23 No

Revision 4 0 0 DSE 30 70 4

22CSDSL306 Block Chain

Technologies 2022-23 No
Revision 4 0 0 DSE 30 70 4
OPEN ELECTIVE (INTERDISCIPLINARY/MULTIDISCIPLINARY) COURSES (CHOOSE ANY ONE)
 Data Analysis Through R
22CSOEL301 programming 2022-23 No

Revision 3 0 0 OE 30 70 3
22CSOEL302 Mobile Networks 2022-23 No
Revision 3 0 0 OE 30 70 3
22CSOEL303 UNIX Programming 2022-23 No
Revision 3 0 0 OE 30 70 3
22CSOEL304 Power BI 2022-23 No
Revision 3 0 0 OE 30 70 3
22CSOEL305 Python Programming 2022-23 No
Revision 3 0 0 OE 30 70 3
TOTAL 31 210 490 25
M.Sc. Computer Science
2023-25 – 3rd Semester: No changes in Syllabi and Question Paper Pattern
(R22) 2024-26 – 1st Semester: No changes in Syllabi and Question Paper
Pattern (R22)
NAME OF THE PROGRAM - M.Sc. COMPUTER SCIENCE
LIST OF THE COURSES IN I SEMESTER -2024-25

Course Code Course Name Introduction Course

Teaching Hours / Week Type of the CIA SEE No. of Credits
Year of Year of Revision LPT

Problem Solving Using 2022-23 No

22CSL101 Programming and 22CSP101 Programming and Revision 4 0 0 Core 30 70 4

Problem Solving Using 2022-23 No

Revision 0 6 0 Core

Lab 30 70 3

Systems2022-23 No

22CSL102 Database Management 22CSP102 Database Management Revision 4 0 0 Core 30 70 4

Systems Lab 2022-23 No

Revision 0 6 0 Core

Lab 30 70 3

22CSL103 Formal Languages and

Automata Theory 2022-23 No

Revision 4 0 0 Core 30 70 4

22CSL104 Operating Systems 2022-23 No

Revision 4 0 0 Core 30 70 4

through Life 2022-23 No

22MBLSL101 Personality Development Course30 70 3

Revision 3 0 0 Skill TOTAL 31

210 490 25

NAME OF THE PROGRAM - M.Sc. COMPUTER SCIENCE LIST

OF THE COURSES IN III SEMESTER -2024-25
Teaching Hours /
Course CIA SEE CREDI
Name of the CourseCourse CodeType of the
Year of Year of Revision LPT TS
Introduction Week
 22CSL301 Data Science 2022-23 No
Revision 4 0 0 Core 30 70 4
22CSP301 Data Science Lab 2022-23 No
Revision 0 6 0 Core Lab 30 70 3
22CSP302 Machine Leaning Lab 2022-23 No
Revision 0 6 0 Core Lab 30 70 3
DOMAIN SPECIFIC ELECTIVE COURSES (CHOOSE ANY
THREE)22CSDSL301 Design & Analysis of
Algorithms 2022-23 No
22CSDSL302 Cryptography & Revision 4 0 0 DSE 30 70 4
Network Security 2022-23 No
Revision 4 0 0 DSE 30 70 4
22CSDSL303 Machine Learning 2022-23 No
Revision 4 0 0 DSE 30 70 4
22CSDSL304 Applied Data Analysis 2022-23 No
Revision 4 0 0 DSE 30 70 4
22CSDSL305 Internet of Things 2022-23 No
Revision 4 0 0 DSE 30 70 4
Technologies 2022-23 No
22CSDSL306 Block Chain Revision 4 0 0 DSE 30 70 4

OPEN ELECTIVE (INTERDISCIPLINARY/MULTIDISCIPLINARY) COURSES (CHOOSE ANY ONE) 22CSOEL301

Data Analysis Through R
programming 2022-23 No

Revision 3 0 0 OE 30 70 3
22CSOEL302 Mobile Networks 2022-23 No
Revision 3 0 0 OE 30 70 3
22CSOEL303 UNIX Programming 2022-23 No
Revision 3 0 0 OE 30 70 3
22CSOEL304 Power BI 2022-23 No
Revision 3 0 0 OE 30 70 3
22CSOEL305 Python Programming 2022-23 No
Revision 3 0 0 OE 30 70 3
TOTAL 31 210 490 25
RESOLUTIONS
1. It is resolved and recommended that the Course Codes of the I and III Semesters of
the M.Sc. Computer Science be modified for the batch of students admitted in 2023-
24 and onwards.
2. It is resolved and recommended the revision of the syllabus & model question paper
of the course “Python Programming” with revised course code “22CAL101A” in I
semester of M.C.A programme for the batch of students admitted in 2024-25 and
onwards.
3. It is resolved and recommended the revision of the syllabus & model question paper
of the course “Python Programming Lab” with revised course code “22CAP101A” in I
semester of M.C.A programme for the batch of students admitted in 2024-25 and
onwards.
4. It is resolved and recommended the revision of the syllabus & model question paper
of the course “Database Technology” with revised course code “22CAL102A” in I
semester of M.C.A programme for the batch of students admitted in 2024-25 and
onwards.
5. It is resolved and recommended the revision of the syllabus & model question paper
of the course “Database Technology” with revised course code “22CAP102A” in I
semester of M.C.A programme for the batch of students admitted in 2024-25 and
onwards.
6. It is resolved and recommended the revision of the syllabus & model question paper
of the course “Machine Learning” with revised course code “22CAL301A” in III
semester of M.C.A programme for the batch of students admitted in 2023-24 and
onwards. 7. It is resolved and recommended the revision of the syllabus & model
question paper of the course “Machine Learning Lab” with revised course code
“22CAP301A” in III semester of M.C.A programme for the batch of students admitted
in 2023-24 and onwards.
8. It is resolved and recommended the revision of the syllabus & model question paper
of the course “Big Data Analytics Lab” with revised course code “22CAP302A” in III
semester of M.C.A programme for the batch of students admitted in 2023-24 and
onwards.
9. It is resolved and recommended the revision of the syllabus & model question paper
of the course “Big Data Analytics” with revised course code “22CADSL301A” in III
semester of M.C.A programme for the batch of students admitted in 2023-24 and
onwards.
10. It is resolved and recommended the revision of the syllabus & model question
paper of the course “Cloud Computing” with revised course code “22CADSL302A” in
III semester of M.C.A programme for the batch of students admitted in 2023-24 and
onwards.
11. It is resolved and recommended the revision of the syllabus & model question
paper of the course “Design and Analysis of Algorithms” with revised course code
“22CADSL303A” in III semester of M.C.A programme for the batch of students
admitted in 2023-24 and onwards.
12. It is resolved and recommended to nominate the members as subject experts,
industrialists and alumni from the list appended at the end, on being approved in the
academic council.
Program Outcomes (PO)
PO1. Technical Expertise and Knowledge in Multiple Domains: Ability to develop an
understanding of modern computing concepts and architectures from a design and
performance perspective of various domains.
PO2. Assessment from System Level Perspective: Able to analyze and appreciate the
structure of computer systems and the processes involved in their construction at
various levels of detail and abstraction.
PO3. Critical Thinking, Business Analytics & Problem Solving and Innovation: An ability
to apply knowledge of mathematics and computer science practices to build
Innovative Public & Private Sector Applications involving complex computing problem
 solving and in research.
PO4. Professional Ethics & Social Responsibility: Ability to apply and commit to
professional ethics following cyber regulations in a global economic environment.
Create and design innovative applications to solve complex problems using
established practices for the betterment of the society.
PO5. Apposite to Industry: Gain exposure to multiple programming languages, tools,
paradigms, and technologies as well as the fundamental underlying principles
throughout their education there by making them the right choice for industry
positions. PO6. Effective Communication & Leadership: Ability to communicate
effectively and present technical & project management information using audio visual
tools as well as in oral and written reports. Rise up to the need and be able to lead
teams of individuals. PO7. Life-long Learning and Research: Understand the
importance of, and possess pre- requisite skill set to undertake life-long independent
learning and research in the context of contemporary technological advancements.
PROGRAMME SPECIFIC OUTCOMES(PSO)- M.C.A PROGRAMME PSO1. To make
the students industry ready as far as possible to enhance their employability in the
industries.
PSO2. Create an ambience of education through Faculty Training, Self Learning,
Sound Academic Practices and Research Endeavors.
PROGRAMME SPECIFIC OUTCOMES(PSO)- M.Sc. Computer Science
PSO1:
PSO2:
List of Subject experts, alumni, industrialist
Course Name Python Programming L T P C CIA SEE TM Course Code 22CAL101A 4 0 0 3 30 70
100 Year of Introduction:
25
2022-23 Year of Offering: 2024 Year of Revision: 2024-
Percentage of Revision: Nil
L-Lecture, T-Tutorial, P-Practical, C-Credits, CIA-Internal Marks, SEE-External Marks, TM-Total Marks

Course Description and Purpose: Python Programming is a course that illustrates basic concepts of Python
programming, Decision Control Statements, Functions and Modules, Python Strings Revisited, Data Structures,
Classes and Objects, Inheritance, Operator Overloading, Pandas, Error and Exception Handling, File Handling,
Databases, Numpy, Matplotlib and PyTest Environment.

Course Objectives:
Provide a comprehensive understanding of Python Programming and equip students with the skills to tackle
various programming challenges and projects.

Course Learning Outcomes:

Upon successful completion of the course, the student will be able to
CO1: Remember concepts of Basic Python Programing. (PO1),(PO5),(PO6),(PSO1),(PSO2) CO2:
Understand Decision Control Statements, Functions and Modules and File Handling, Classes, and
Objects. (PO2),(PO5),(PO6), (PSO1),(PSO2)
CO3: Apply Data Structures, Inheritance and Operator Overloading. (PO2),(PO3),(PSO1),(PSO2) CO4:
Analyze Python Strings Revisited and Database Connections. (PO3),(PO4),(PSO1),(PSO2) CO5:
Evaluate Functions and Modules, Error and Exception Handling, Pandas, Numpy, Matplotlib and PyTest
Testing Framework. (PO7),(PO5),(PO6),(PO7),(PSO1),(PSO2)
 CO-PO MATRIX (H:3, M:2, L:1)
CO-PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PSO1 PSO2 CO1 3 2 2 1 1
22CAL101A UNIT-I (12 Hours)
CO2 3 2 2 1 2 CO3 2 3 1 1 CO4 2 3 2 1 CO5 3 3 2 1 1
Basics of Python Programming: Features of Python, History of Python, The Future of Python, Writing and
Executing First Python Program, Literal Constants, Variables and Identifiers, Data Types, Input Operation,
Comments, Reserved Words, Indentation, Operators and Expressions, Expressions in Python, Operations on
Strings, Other Data Types, Type Conversion.
Decision Control Statements: Conditional Branching Statements, Basic Loop Structures, Nested Loops, The
Break Statement, The Continue Statement, The Pass Statement, The Else Statement used with Loops.

1
UNIT-II (12 Hours)
Functions and Modules: Function Definition, Function Call, Variable Scope and Lifetime, The Return Statement,
More on Defining Functions, Recursive Functions, Modules, Packages in Python, Standard Library Modules.
Python Strings Revisited: Concatenating, Appending and Multiplying Strings, String Formatting Operator, Built
in String Methods and Functions, Comparing Strings, Regular Expressions.
Data Structures: Sequence, Lists, Functional Programming, Tuple, Sets, Dictionaries.

UNIT-III (12 Hours)

Classes and Objects: Classes and Objects, Class Method and Self-Argument, Class Variables and Object
Variables, Public and Private Data Members, Private Methods, Calling a Class Method from Another Class
Method, Built in Class Attributes, Class Methods, Static Methods.
Inheritance: Inheriting Classes in Python, Types of Inheritance, Abstract Classes and Interfaces.

UNIT-IV (12 Hours)

Operator Overloading: Concept of Operator Overloading, Advantage of Operator Overloading, Implementing
Operator Overloading.
Pandas: Introduction, Getting Started, Series, Data Frame, Read CSV, Read JSON -Analyzing Data Frames,
Cleaning Data, Cleaning Empty Cell, Cleaning Wrong Format, Cleaning Wrong Data, Removing Duplicates,
Correlations, Plotting.
Error and Exception Handling: Introduction to Errors and Exceptions, Handling Exceptions, Raising Exceptions,
Built in and User defined Exceptions.

UNIT-V (12 Hours)

File Handling: File Path, Types of Files, Opening and Closing Files, Reading and Writing Files. Databases:
Database Table Creation, Select Operation, Insert Operation, Delete Operation, Update Operation, Drop Table.
Numpy: Basic Functions of Numpy.
Matplotlib: Basic Functions of Matplotlib.
PyTest Testing Framework: What is Pytest, Setting Up Pytest, A Simple PyTest Example, Working with PyTest,
Parameterised Tests

Reference Text Books:

1. Reema Thareja, Python Programming Using Problem Solving Approach, Oxford University Press, June
2017. 2. Vamsi Kurama, Python Programming, A Modern Approach, Pearson, 2017.
3. Wesley Chun, Core Python Programming, Prentice Hall, December 2000.
4. John Hunt, Advanced Guide to Python 3 Programming, UTiCS, Springer, 2019

E-resources: https://www.w3schools.com/python/pandas/
https://warin.ca/ressources/books/2019_Book_AdvancedGuideToPython3Programm.pdf
 2

Offered to : M.C.A Semester: I 22CAL101A : Python Programming Time: 3 Hours Max

Marks: 70
SECTION-A
Answer the following questions. (5×4 = 20 Marks)
1. (a) Explain Operators in Python. (CO1,L2)
(or)
(b) Explain different Data Types in Python (CO1,L2)
2. (a) What is Recursive Function? Explain with example.(CO2,L1)
(or)
(b) List out and explain any four Built in String Method. (CO4,L1)
3. (a) Whit is the Differences between Class Variable and Object Variable?
(CO2,L1) (or)
(b) List out Built in Class Attributes? (CO2,L1)

4. (a) Explain Advantages of Operator Overloading? (CO3,L2)

(or)
(b) Explain Exception Hierarchy? (CO5,L2)

5. (a) Explain Types of Plots in Matplotlib? (CO5,L2)

(or)
(b) Explain different ways of creating Arrays using Numpy. (CO5,L2)

SECTION-B
Answer Five Questions Choosing One Question from Each Unit.
All Questions Carry Equal Marks. (5×10 = 50 Marks) 6. (a) Explain the features of
Python Programming Language.(CO1,L2)
(or)
(b) Explain Different Loops in Python with example. (CO2,L2)

7. (a) Apply Modules Concept in Python with examples. (CO2.L3)

(or)
(b) Build the List Data Structure and their built in functions with examples. (CO2, L3)

8. (a) Illustrate Classes and Objects? Write a program in Python to illustrate an instance variable.
(CO3,L2) (or)
(b) Explain different types of Inheritance. (CO3,L2)

9. (a) Demonstrate Operator Overloading in Python. (CO4,L2)

(or)
(b) Explain process of Analyzing Data Frames. (CO4,L2)

10. (a) Explain process of Writing and Reading data from file with example.
(CO5,L5) (or)
(b) Explain process of Update Data into Database with relevant examples. (CO4,L5)

3
Offered to: M.C.A Semester: I
Course Name Python Programming Lab L T P C CIA SEE TM Course Code 22CAP101A 0 0 6 3 30 70 100
Year of Introduction:
Percentage of Revision: Nil
2019 Year of Offering: 2024 Year of Revision: 2024
L-Lecture, T-Tutorial, P-Practical, C-Credits, CIA-Internal Marks, SEE-External Marks, TM-Total Marks

Course Description and Purpose: The Python Programming course covers Fundamental Python concepts,
including Basic Syntax, Decision Control Statements, Functions, and Modules. It also revisits Python Strings,
explores various Data Structures, and delves into Object-Oriented Programming with a focus on Classes,
Inheritance, and Operator Overloading. Additionally, the course includes practical applications using Pandas for
data manipulation, Error and Exception Handling, File Operations, data analysis with Numpy and Matplotlib,
Visualizations and Data Pre Processing.

Course Objectives: Provide a solid foundation in Python Programming, preparing students for both practical
application and further study in more advanced topics.

Course Learning Outcomes:

Upon successful completion of the course, students will be able to:
CO1: Remember the fundamentals of Python Programming and effectively use Decision Control Statements.
(PO1),(PO5),(PO6),(PSO1),(PSO2).
CO2: Understand and apply concepts related to Data Structures, Regular Expressions, Functions, and
Modules. (PO2),(PO5),(PO6),(PSO1),(PSO2)
CO3: Build and utilize principles of Classes, Objects, and Object-Oriented Programming. (PO2),(PO3) (PSO1),
(PSO2)
CO4: Analyze techniques for Error and Exception Handling to create Robust Code. (PO3),(PO4), (PSO1),
(PSO2) CO5: Explain database access and file handling operations, Visualizations and Data Pre-Processing.
(PO5),(PO6),(PO7),(PSO1),(PSO2)

CO-PO MATRIX (H:3, M:2, L:1)

CO-PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PSO1 PSO2 CO1 3 2 2 1 1
22CAP101A CO2 3 2 2 1 3 CO3 2 3 2 2 CO4 2 3 1 1 CO5 2 3 3 2 2

1. Write a program to find total for given number of tens, number of fives, number of twos and number of
ones. (CO1, L1)
2. Write a program to enter a number and display its hex and octal equivalent and its square root.
(CO1, L1) 3. Write a program to read and print values of variables of different data types. (CO1, L1) 4.
Write a program to calculate the distance between two points. (CO1, L1)
5. Write a program to calculate area of triangle using Heron's formula. (CO1, L1)

4
(Hint: Heron's formula is given as: area=sqrt(S*(S-a)*(S-b)*(S-c)))
6. Write a program to calculate the distance between two points. (CO1, L1)
7. Write a program to perform addition, subtraction, multiplication, division, integer division. (CO1,
L1) 8. Write a program to find the greatest number from three numbers. (CO1, L1)
9. Write a program to calculate tax given the following conditions: (CO1, L1)
If income is less than 1, 50, 000 then no tax
If taxable income is Rs.1, 50,001 - Rs.300, 000 then charge 10% tax
If taxable income is Rs.3, 00,001 - Rs.500, 000 then charge 20% tax
If taxable income is above Rs.5, 00,001 then charge 30% tax
10. Write a program to calculate roots of quadratic equation. (CO1, L1)
11. Write a program to enter the marks of a student in four subjects. Then calculate the total and aggregate,
and display the grade obtained by the student. If the student scores an aggregate garter than 75%, then the
grade is Distinction. If aggregate is 60>= and <75, then grade is First Division. If the aggregate is 50>= and
<60, then the grade is Second Division. If aggregate is 40>= and <50, then the grade is Third Division. Else
the grade is Fail. (CO1, L1)
12. Write a program to read the numbers until -1 is encountered. Find the average of positive numbers and
negative numbers entered by the user. (CO1, L1)
13. Write a program to find whether the given number is an Amstrong Number or not. (CO1, L1)
14. Write a program to enter a Decimal Number. Calculate and display its Binary Equivalent.
(CO1, L1) 15. Write a program to demonstrate List Operations. (CO2, L1)
 Access List Items
 Change Item Value
 Appended Items
 Remove Specified Item
 Loop Through a List
 List Comprehension
 Sort List Alphanumerically
 Copy a List
 Join Two Lists
 List Methods
16. Write a program to demonstrate Tuple Operations. (CO2, L1)
 Access Tuple Items
 Negative Indexing
 Range of Indexes
 Range of Negative Indexes
 Check if Item Exists
 Update Tuples
 Add Items
 Remove Items
5
 Unpacking a Tuple
 Using Asterisk(*)
 Loop Through a Tuple
 Loop Through the Index Numbers
 Using a While Loop
 Python - Join Tuples
 Join Two Tuples
 Multiply Tuples
17. Write a program to demonstrate Set Operations. (CO2, L1)
 Access Set Items
 Add Set Items
 Loop Sets
 Join Two Sets
 Keep ONLY the Duplicates
 Keep All, But NOT the Duplicates
18. Write a program to demonstrate Dictionary Operations. (CO2,L1)
 Ordered or Unordered?
 Changeable
 Duplicates Not Allowed
 Accessing Items
 Change Values
 Update Dictionary
 Adding Items
 Remove Dictionary Items
 Loop Through a Dictionary
 Copy a Dictionary
 Nested Dictionaries
19. Write a program to enter a number and then calculate the Sum of Its Digits.
(CO2,L1) 20. Write a program to print the Reverse Number. (CO2,L1)
21. Write a program to calculate GCD of two numbers. (CO2,L1)
22. Write a program that prompts users to enter numbers. The process will repeat until user enters -1. Finally,
the program prints the count of prime and composite numbers entered. (CO2,L1)
23. Write a program (CO2,L1)
(a) To calculate the factorial of number recursively.
(b) To calculate GCD using the recursive functions.
24. Write a program (CO2,L1)
(a)To calculate exp(x, y) using recursive functions
(b) To print the Fibonacci Series using Recursion.
25. Write a program make a Simple Calculator. (CO2,L1)
6
26. Write a program that defines a function large in a module which will be used to find large of two values and
called from a code in another module. (CO2,L1)
27. Write a program that demonstrates the use of method __init__. (CO3,L1)
28. Write a program to illustrate the modification of instance variable. (CO3,L1)
29. Write a program for modifying a mutable type attribute. (CO3,L1)
30. Write a program to demonstrate the use of inheritance. (CO3,L1)
31. Write a Program to demonstrate Polymorphism. (CO3,L1)
32. Write a program to demonstrate Polymorphism using Function Overloading.
(CO3,L2) 33. Write Program to demonstrate Method Overriding with arguments.
(CO3,L2)
34. Write a python program to demonstrate multilevel inheritance. (CO3,L2)
35. Write a program to demonstrate Multipath Inheritance (or) Hybrid Inheritance. (CO3,L2) 36. Write a
program to demonstrate Multi Level Inheritance (A person is teacher & having designation HOD)
(CO3,L2)
37. Write a program to demonstrate s. (CO3,L2)
38. Write a program to illustrate the concept of Abstract Class. (CO3,L2)
39. Write a program to overload the + operator on a complex object. (CO3,L2)
40. Write a program to handle Divide by Zero Exception. (CO4,L2)
41. Write a program to handle Multiple Errors with One Except statement. (CO4,L2)
42. Write a program with Multiple Except Blocks. (CO4,L2)
43. Write a program to demonstrate else statement in exception handling. (CO4,L2)
44. Write a python program to illustrate the try...catch...finally in exception handling.
(CO4,L2) 45. Write a program to demonstrate Regular Expression Functions. (CO2,L2)
 findall()
 Search
 Split
 sub()
46. Write a program Demonstrate Regular Expression Meta Characters. (CO2,L2)
 Python program to match string using metacharacter []
 Program to find digits in character using metacharacter \
 Program for sequence that starts with "he", followed by two (any) characters using
metacharacter.  Program to check if the string starts with 'hello' using metacharacter ^
 Program to check the string ends with 'world' using metacharacter $
 Program to check the string contains "ai" followed by 0 or more "x" characters
 Program to check the string contains "ai" followed by 1 or more "x" characters
 Program to check if the string contains "a" followed by exactly two "l" characters
 Program to check if the string contains either "falls" or "stays" using meta character |
47. Write a program to demonstrate Regular Expression Sequences. (CO2,L2)
 Program to check if the string starts with "The"
 Program to check if "ain" is present at the beginning of a word
7
 Program to check if "ain" is present at the end of a word.
 Program to check if "ain" is present, but NOT at the beginning of a word.
 Program to check if "ain" is present, but NOT at the end of a word.
 Program to check if the string contains any digits (numbers from 0-9).
 Program to return a match at every no-digit character.
 Program to return a match at every white-space character.
 Program to return a match at every NON white-space character.
 Program to return a match at every word character (characters from a to Z, digits from 0-9, and the
underscore _ character)
 Program to return a match at every NON word character (characters NOT between a and Z. Like "!", "?"
white space etc.)
 Program to check if the string ends with "Spain".
48. Write a program to demonstrate Regular Expression Sets. (CO2, L1)
 Program Check if the string has any a, r, or n characters.
 Program to Check if the string has any characters between a and n.
 Program to Check if the string has other characters than a, r, or n.
 Program to check if the string has any 0, 1, 2, or 3 digits.
 Program to check if a string has any digits.
 Program to check if the string has any two-digit numbers, from 00 to 59.
 Program to Check if the string has any characters from a to z lower case, and A to Z upper
case.  Program to check if the string has any + characters.
49. Write a program to (CO5,L2)
 Create EMP table with attributes ENO, ENAME and ESAL into PBS database.
 Insert rows into EMP table of PBS database.
 Update rows of EMP table of PBS database.
 Delete rows from EMP table of PBS database.
 Drop EMP table of PBS database.
50. Write a program to open the file and count the number of times a character appears in the file. (CO5,L1)
Write a program that inputs a text file. The program should print all of the unique words in the file in
alphabetical order.
51. Write a Python class to reverse a string word by word.(CO2, L2)
52. Write a Python program Analyze Weather forecasting data and visualize the results with Python modules.
(CO5, L2)
53. Write a Python Program for Data Preprocessing. (CO5, L2)
54. Write a python program for Web Scraping. (CO5, L2)

8
Offered to: M.C.A Semester: I
Course Name Database Technology L T P C CIA SEE TM Course Code 22CAL102A 4 0 0 4 30 70 100
Year of Introduction:
Percentage of Revision: 10
2022-23 Year of Offering: Year of Revision: 2024-25
L-Lecture, T-Tutorial, P-Practical, C-Credits, CIA-Internal Marks, SEE-External Marks, TM-Total Marks

Course Description and Purpose:

Database Technology (22CAL102) is a course that illustrates basic concepts of Databases and Database
Users, Database System Architecture, ER & EER Relationship Modeling, Structured Query Language,
Relational Algebra and Relational Calculus, Functional Dependencies and Normalization for Relational
Databases, Transaction Processing Concepts, Concurrency Control Techniques and Mongo DB.

Course Objectives:
Provide students with a comprehensive understanding of database technologies and prepare them to apply
these concepts in real-world scenarios.

Course Learning Outcomes:

Upon successful completion of the course, the student will be able to:
CO1: Remember various Database Users, Advantages of DBMS, Data Models, Basic queries in SQL,
Transaction and System Concepts, and Key Features of Mongo DB. (PO1),(PO2),(PO4),(PO6),(PSO1),(PSO2)

CO2: Understand Database System Concepts and Architecture, SQL Operations, ER and EER modeling,
Functional Dependencies, and Concurrency Control Techniques. (PO1),(PO3),(PO5),(PO7),(PSO1),(PSO2)

CO3: Apply Normalization for Relational Databases, Cursors, and Triggers, Relational Relational Algebra and
Relational Calculus Operations. (PO1),(PO3), (PSO1),(PSO2)
CO4: Test for Schedules based on Serializability. (PO1),(PO2), (PSO1),(PSO2)
CO5: Explain Mango DB Key Features and CRUD Operations. (PO1),(PO6), (PSO1),(PSO2)
 CO-PO MATRIX (H:3, M:2, L:1)
CO-PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PSO1 PSO2 CO1 3 2 3 1 3 2
22CAL102A UNIT-I (12 Hours)
CO2 3 1 2 1 1 1 CO3 3 1 1 1 CO4 3 2 1 1 CO5 3 2 1 2
Database and Database Users: Introduction, Characteristics of the Database Approach, Actors on the Scene,
Workers behind the Scene, Advantages of the using the DBMS Approach.
Database System Concepts and Architecture: Data Models, Schemas and Instances, Three Schema
Architecture and Data Independence, Database Languages and Interfaces, Centralized and Client/Server
Architecture for DBMS, Classification of Database Management Systems.
UNIT-II (12 Hours)
SQL-99: Schema Definition, Queries and Views: SQL Data Definitions and Data Types, Specifying Constraints
in SQL, Schema Change Statements on SQL, Basic Queries in SQL, More Complex SQL Queries, INSERT,
9
DELETE and UPDATE statements in SQL, Cursors, Triggers and Views.

Data Modeling Using the ER Model: Conceptual Data Models, Entity Types, Entity Sets, Attributes and Keys,
Relationship Types, Relationship Sets, Roles and Structural Constraints, Weak Entity Types, Relationship
Types of Degree Higher than Two, Refining the ER Design for the COMPANY Database.
The Enhanced Entity-Relationship Model: Sub Classes, Super Classes and Inheritance, Specialization and
Generalization, Constraints and Characteristics of Specialization and Generalization.

UNIT-III (12 Hours)

The Relational Algebra and Relational Calculus: Unary Relational Operations: SELECT and PROJECT,
Relational Algebra Operations from Set Theory, Binary Relational Operations: JOIN and DIVISION, Additional
Relational Operations, Examples, The Tuple Calculus and Domain Calculus.

Functional Dependencies and Normalization for Relational Databases (1NF, 2NF, 3NF): Informal Design
Guidelines for Relation Schemas, Functional Dependencies, Normal Forms Based in Primary Keys, General
Definitions of Second and Third Normal Forms

UNIT-IV (12 Hours)

Normalization for Relational Databases (BCNF, 4NF, 5NF, DKNF): Boyce-Codd Normal Form, Multivalued
Dependencies and Fourth Normal Form, Join Dependencies and Fifth Normal Form, Domain Key Normal Form.
Introduction to Transaction Processing Concepts and Theory: Introduction to Transaction Processing,
Transaction and System Concepts, Desirable Properties of Transactions, Characterizing Schedules Based on
Recoverability, Characterizing Schedules based on Serializability.

UNIT-V (12 Hours)

Concurrency Control Techniques: Two Phase Locking Techniques for Concurrency Control, Concurrency
Control Based on Timestamp Ordering, Multisession Concurrency control techniques, Validation Concurrency
Control Techniques.

Mango DB: What is MangoDB, Key Features of Mongo DB, MongoDB Getting Started, MongoDB Query API,
MongoDB Create Database, MongoDB Create Collection, MongoDB Insert, MongoDB Find, MongoDB Update,
MongoDB Delete, MongoDB Query Operators, MongoDB Update Operators, MongoDB Aggregation Pipelines.

Reference Text Books:

1. Ramez Elmasri, Shamkant B. Navathe, Fundamentals of Database Systems, Pearson Education, Seventh
Edition, 2017.
2. MongoDB Complete Guide, Manu Sharma, BPB Publications, First Edition, 1st July 2021. 3. C.J.Date,
A.Kannan, S.Swamynathan, An Introduction to Database Systems, VII Edition, Pearson Education , 2006.
4. Peter Rob, Carlos Coronel, Database Systems-Design, Implementation and Management, Eight Edition,
Thomson, 2008
5. Raman A Mata, Toledo, Panline K. Cushman, Database Management Systems, Schaum’s Outlines, TMH,
2007.
6. Steven Feuerstein, Oracle PL/SQL, Programming, 10th Anniversary Edition, OREILLY, 2008.
 10
M.C.A Semester: I 22CAL102A: Database Technology Time: 3 Hours Max Marks:
70
SECTION-A
Answer the following questions. (5×4 = 20 Marks)

1. (a) Explain the advantages of the DBMS. (CO1,L2)

(or)
(b) Compare Physical Data Independence and Logical Data Independence. (CO2,L2)

2. (a) Explain Cursor with example. (CO3,L2)

(or)
(b) Outline Generalization with diagram. (CO2,L2)

3. (a) Explain Join Operations. (CO3,L2)

(or)
(b) Illustrate Third Normal. (CO3,L2)

4. (a) Test for BCNF. (CO3,L3)

(or)
(b) Identify Properties of Transaction. (CO1,L3)

5. (a) Explain Shared and Exclusive Locks. (CO2,L5)

(or)
(b) Explain Key Features of Mongo DB. (CO5,L5)

SECTION-B
Answer ALL questions. All Questions Carry Equal Marks. (5×10 = 50 Marks)

6. (a) Explain various Data Models of Database Management Systems.

(CO1,L2) (or)
(b) Explain Three Schema Architecture of DBMS with neat diagram. (CO2,L2)

7. (a) Distinguish various Constraints of SQL (CO2,L4)

(or)
(b) Examine ER Design for the Company Database with all constraints. (CO2,L4)

8. (a) Experiment with Select and Project operations of Relational Algebra.

(CO3,L3). (or)
(b) Apply First & Second Normal Forms in detail.(CO3,L3)

11
9. (a) Experiment Join Dependencies with example.
(CO
3,L
3)
(or)
(b) Identify whether the transactions T1 & T2 ensure serializability. (CO4,L3)

T1 T2
read_item(x);
X:=X – N;
 read_item(x);
X:=X + M;
write_item(X);
read_item(Y);
Write_item(x);
Y:=Y+N;
Write_item(Y);

10. (a) Explain Concurrency Control Based on Timestamp Ordering.

(CO2,L5) (or)
(b) Explain CRUD operations of MongoDB. (CO5,L5)

12
Offered to: M.C.A Semester: I
Course Name Database Technology Lab L T P C CIA SEE TM Course Code 22CAP102A 0 0 6 3 30 70 100

1991 Year of Offering: 2024 Year of Revision:

Year of Introduction: 2024
Percentage of Revision: 10 %
L-Lecture, T-Tutorial, P-Practical, C-Credits, CIA-Internal Marks, SEE-External Marks, TM-Total Marks
Course Description and Purpose: Database Management Systems Laboratory is a course that illustrates DDL
and DML Commands, Basic SQL Queries, Complex SQL Queries, Joins, Integrity Constraints, Views, Cursors,
Triggers, and Functions and Procedures using PL/SQL, Implementing NoSQL using Cassandra.

Course Objectives: This course will help enable the students to understand, learn and practice develop a
various Relational Data Models, Querying, DDL and DML Commands, Basic SQL Queries, Complex SQL
Queries, Joins, Integrity Constraints, Views, Cursors, Triggers, and Functions and Procedures using PL/SQL,
NoSQL using Cassandra.

Course Learning Outcomes:

Upon successful completion of the course, students will be able to:
CO1: Select data from database using DML Commands for a given situation. (PO1), (PO2),
(PO6), (PO7),(PSO1),(PSO2)
CO2: Summarize with a Query Language through basic SQL Queries. (PO1), (PO3), (PO4),(PO6), (PSO1),
(PSO2) CO3: Build database using DDL Commands. (PO1), (PO2), (PO4),(PO5), (PSO1),(PSO2) CO4:
Examine Nested Queries, Joins, Integrity Constraints and Views in database. (PO1), (PO3), (PO5),(PO7),
(PSO1),(PSO2)
CO5: Interpret Triggers, Functions and Procedures using PL/SQL, Cassandra Installation and CRUD
operations with filters. (PO1), (PO2), (PO6), (PO7),(PSO1),(PSO2)

CO-PO MATRIX (H:3, M:2, L:1)

CO-PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PSO1 PSO2 CO1 3 2 1 1 1 L
22CAP102A CYCLE-I
CO2 2 1 2 1 2 L CO3 2 1 1 1 2 L CO4 3 1 1 1 1 H CO5
32112L
Aim: Marketing Company wishes to computerize their operations by using following tables.

Table Name: Client-Master

Column Name Data Type Size Attribute CLIENT_NO Varchar2 6 Primary key and first letter must
start with NAME Varchar2 20 Not null
ADDRESS1 Varchar2 30
ADDRESSS Varchar2 30
CITY Varchar2 15
PINCODE Varchar2 8
STATE Varchar2 15
BAL_DUE Number 10,2
13
Table Name: Product Master
Column Name Data Type Size Attribute PRODUCT_NO Varchar2 6 Primary key and first letter
must start with DESCRIPTION Varchar2 15 Not null
PROFIT_PERCENT Number 4,2 Not null
UNIT_MEASUE Varchar2 10
QTY_ ON_HAND Number 8
REORDER_LVL Number 8
SELL_PRICE Number 8, 2 Not null, cannot be0 COST_PRICE Number 8,2 Not
null, cannot be0

Table Name: Salesman Master

Column Name Data Type Size Attribute SALESMAN_NO Varchar2 6 Primary key and first letter
must start with ‘S’ SALESMAN_NAME Varchar2 20 Not null
ADDRESS1 Varchar2 30
ADDRESS2 Varchar2 30
CITY Varchar2 20
PINCODE Number 8
STATE Vachar2 20

SAL_AMT Number 8,2 Not null, cannot be0

TGT_TO_GET Number 6,2 Not null, cannot be0
 YTD_SALES Number 6,2 Not null
REMARKS Varchar2 20

Table Name: Sales_Order

Column Name Data Type Size Attribute ORDER_NO Varchar2 6 Primary key and first letter
must start with ‘S’ CLIENT_NO Varchar2 6 Foreign Key
ORDER_DATE Date
DELY_ADDRESS Varchar2 25
SALESMAN_NO Varchar2 6 Foreign Key
DELY_TYPE Char 1 Delivery: part(p)/full(f)and default ‘F’ BILL_YN Char 1
DELY_DATE Date Can’t be less than order date ORDER_STATUS Varchar2
10 Values(“InProcess”, “Fulfilled”,

14
Table Name: Sales_Order_Details
Column Name Data Type Size Attribute ORDER_NO Varchar2 6 Primary key references
SALES_ORDER table PRODUCT_NO Varchar2 6 Foreign Key references SALES_ORDER_ table
QTY_ ORDERED Number 8
QTY_DISP Number 8
PRODUCT_RATE Number 10,2 Foreign Key
Solve the following queries by using above tables
1. Retrieve the list of names, city and the state of all the clients. (CO2,L2)
2. List all the clients who are located in ‘Mumbai’ or ‘Bangalore’. (CO2,L2)
3. List the various products available from the product master table. (CO2,L2)
4. Find the names of sales man who have a salary equal to Rs.3000. (CO2,L2)
5. List the names of all clients having ‘a’ as the second letter in their names.(CO2,L2)
6. List all clients whose Bal due is greater than value 1000. (CO2,L2)
7. List the clients who stay in a city whose first letter is ‘M’. (CO2,L2)
8. List all information from sales-order table for orders placed in the month of July. (CO2,L2) 9. List the
products whose selling price is greater than 1000 and less than or equal to 3000. (CO2,L2) 10.Find the
products whose selling price is greater than 1000 and also find the new selling price as original selling
price 0.50.(CO2,L2)
11.Find the products in the sorted order of their description. (CO2,L2)
12.Find the products with description as ‘540HDD’ and ‘Pen drive’.(CO2,L2)
13.Count the total number of orders. (CO2,L2)
14.Print the description and total qty sold for each product.(CO4,L2)
15.Calculate the average qty sold for each client that has a maximum order value of 15,000.
(CO4,L2) 16.Find all the products whose quantity on hand is less than reorder level.(CO4,L2)
17.List the order number and day on which clients placed their order. (CO4,L2)
18.Find out the products and their quantities that will have to deliver in the current month.
(CO4,L2) 19.Find the names of clients who have placed orders worth of 10000 or more.
(CO4,L2) 20.Find the client names who have placed orders before the month of June,2018.
(CO4,L2)
 CYCLE-II
Aim: A manufacturing company deals with various parts and various suppliers supply these parts. It consists
of three tables to record its entire information. Those are as follows.
Supplier (Supplier_No, Sname, City, status) Part(Part_no, pname, color, weight, city, cost) Shipment
(supplier_No, Part_no, city)
JX(project_no, project_name, city)
SPJX (Supplier_no, part_no, project_no, city)

Solve the following queries by using above tables.

1. Get supplier numbers and status for suppliers in Chennai with status > 20.(CO4,L2)
2. Get project names for projects supplied by supplier S.(CO4,L2)
3. Get colors of parts supplied by supplier S1.(CO4,L2)
4. Get part numbers for parts supplied to any project in Mumbai.(CO4,L2)
5. Find the id’s of suppliers who supply a red or pink parts.(CO4,L2)
6. Find the pnames of parts supplied by London supplier and by no one else.(CO4,L2)
7. Get the names of the parts supplied by the supplier ‘Mart’ and ‘Miller’.(CO4,L2)
8. Get supplier names for suppliers who do not supply part P2.(CO4,L2)
9. Get all pairs of supplier numbers such that the suppliers concerned are “colocated”.
(CO4,L2) 10.Get suppliers names for the suppliers who supply at least one red part.
(CO4,L2)

15|CSC PG
CYCLE-III
Aim: An enterprise wishes to maintain a database to automate its operations. Enterprise divided into a certain
departments and each department consists of employees. The following two tables describes the automation
schemas.

Emp(Empno, Ename, Job, Mgr, Hiredate, Sal, Comm, Deptno) Dept(Deptno, Dname, Loc)

Solve the following queries by using above tables.

1. List the details of employees who have joined before the end of September’ 81.(CO2,L2) 2. List the
name of the employee and designation of the employee, who does not report to anybody.(CO2,L2) 3.
List the name, salary and PF amount of all the employees (PF is calculated as 10% of salary)(CO2,L2)
4. List the names of employees who are more than 2 years old in the organization.(CO2,L2) 5.
Determine the number of employees, who are taking commission.(CO2,L2)
6. Update the employee salary by 20% , whose experience is greater than 12 years.
(CO2,L2) 7. Determine the department does not contain any employees.(CO4,L2)
8. Create a view, which contains employee name and their manager names working in
sales department.(CO4,L2)
9. Determine the employees, whose total salary is like the minimum salary of any department.
(CO4,L2) 10. List the department numbers and number of employees in each department.
(CO4,L2) 11. Determine the employees, whose total salary is like the minimum salary of any
department.(CO4,L2) 12. List average salary for all departments employing more than five people.
(CO2,L2)
13. Determine the names of employees, who take highest salary in their departments.
(CO4,L2) 14. Determine the names of employees, who earn more than their managers.
(CO4,L2)
15. Display ename, dname, even if no employee belongs to that department (use outer join).(CO4,L2)

CYCLE-IV
An Airline system would like to keep track their information by using the following relations.

FLIGHTS(fl_no:integer,from:string,to:string,distance:integer,price:integer)AI
RCRAFT(aid: integer, aname: string, cruising_range:
integer)CERTIFIED(eid:integer, aid:integer)
Employees(eid:integer,ename:string,salary:real)
Note that the employees relation describes pilots and other kinds of employees as well; every pilot is
certified for air craft and only pilots are certified to fly. Resolve the following queries.
a. Find the names of pilots whose salary is less than the price of the cheapest route from
Newyork to Chicago.(CO4,L2)
b. For each pilot who is certified for more than 2 aircraft, find the eid’s and the maximum cruising range
of the aircraft that he or she certified for.(CO4,L2)
c. For all aircraft with cruising range over 1,500 miles, find the name of the aircraft and the average salary
of all pilots certified for this aircraft. (CO4,L2)
d. Find the aid’s of all aircraft than can be used from chicaga to LosAngels.(CO4,L2)
e. Find the name of the pilots certified from some Boeing aircraft.(CO4,L2)
f. Print the enames of pilots who can operate planes with cruising range greater than 3,500 miles, but are not
certified by Boeing aircraft.(CO4,L2)
g. Find the eid’s of employees who are certified for exactly 2 aircrafts.(CO4,L2)
h. Find the total amount paid to employees as salaries.(CO4,L2)
i. Find the aid’s of all than can be used on non-stop flights from Chennai to Dubai.
(CO4,L2) j. Find the eid’s of employee who make second highest salary.(CO4,L2)

16|CSC PG
PL/SQLPROGRAMS
1. Write a PL/SQL program to check the given number is strong or not.(CO5,L2)
2. Write a PL/SQL program to check the given string is palindrome or not.(CO5,L2)
3. Write a PL/SQL program to swap two numbers without using third variable.
(CO5,L2) 4. Writ a PL/SQL program to generate multiplication tables for 2, 4, 6.
(CO5,L2)
5. Write a PL/SQL program to check the given number is Amstrong or not.(CO5,L2)
6. Write a PL/SQL code to find the factorial of any number.(CO5,L2)
7. Write a PL/SQL program to display sum of even numbers and sum of odd numbers in the given range.
(CO5,L2) 8. Write a PL/SQL program to check the given number is palindrome or not.(CO5,L2)
9. The HRD manager has decide to raise the employee salary by 15% write a PL/SQL block to accept the
employee number and update the salary of that employee. Display appropriate message based on the
existence of the record in Emp table.(CO5,L2)
10. Write a PL/SQL program to display to 10 rows in Emp table based on their job and salary.(CO5,L2) 11.
Write a PL/SQL program to raise the employee salary by 10% for department number 30 people and also
maintain the raised details in the raise table.(CO5,L2)
12. Write a procedure to update the salary of Employee, who are not getting commission by 10%.
(CO5,L2) 13. Write a PL/SQL procedure to prepare an electricity bill by using following table.
(CO5,L2)

Table used: Elect

Name Null? Type
MNNO NOTNULL NUMBER(3) CNAME VARCHAR2(20) CUR_READ NUMBER(5)
PREV_READ NUMBER(5) NO_UNITS NUMBER(5) AMOUNT NUMBER(8,2) SER_TAX
NUMBER(8,2) NET_AMT NUMBER(9,2)

14. Write a PL/SQL program to prepare an telephone bill by using following table and print the monthly bills for
each customer.(CO5,L2)

Table used: Phone

Name Null? Type
TEL_NO NOTNULL NUMBER(6) CNAME VARCHAR2(20) CITY VARCHAR2(10)
PR_READ NUMBER(5) CUR_READ NUMBER(5) NET_AMT NUMBER(5) TOT-AMT
NUMBER(8,2)

15. Write a PL/SQL program to raise the employee salary by 10 %, who are completed their 25 years of
service and store the details at appropriate tables (Define the Retair_ Emp_Table). (CO5,L2)
16. Write a PL/SQL program to evaluate the grade of a student with following conditions: For pass: all
marks > 40 For I class: Total % > 59
For II Class: Total % between >40 and < 60 For III class: total % = 40
 And also maintain the details in abstract table.(CO5,L2)

17|CSC PG
1.TableStd
Name Null? Type NO NOTNULL NUMBER NAME VARCHAR2(10) INTNO NUMBER
CLASS NOTNULL VARCHAR2(10) M1 NUMBER M2 NUMBER M3 NUMBER M4
NUMBER M5 NUMBER

2.TableAbstract
Name Null? Type STDNO NUMBER STDNAME VARCHAR2(10) CLASS VARCHAR2(10)
MONTH VARCHAR2(10) INTNO(INTEGERNUMBER) NUMBER TOT NUMBER GRADE
VARCHAR2(10) PERCENT NUMBER DAT_ENTER DATE
NO SQL USING CASSANDRA
17. Write the procedure for Installing and configuring NoSQL Cassandra (CO5,
L1). 18. Write a program to Create Key Space in Cassandra (CO5, L1)
19. Write query for CRUD operations in Cassandra (CO5, L1)
20. Write a Cassandra program to Allow filter (CO5, L2)

18|CSC PG
Offered to: M.C.A Semester: III
Course Name Machine Learning L T P C CIA SEE TM Course Code 22CAL301A 4 0 0 4 30 70 100
Year of Introduction: Percentage of Revision: 5%

2022Year of Offering: 2022 Year of Revision: 2024

L-Lecture, T-Tutorial, P-Practical, C-Credits, CIA-Internal Marks, SEE-External Marks, TM-Total Marks

Course Description and Purpose: Machine Learning (22CAL301) is a course that illustrates concepts of
Machine Learning, Basics of Data Preprocessing and Feature Engineering, Supervised Learning Algorithms,
Regression Algorithms, Unsupervised Learning Algorithms, concepts of Neural Networks.
Course Objectives: The course provide a comprehensive understanding of machine learning, from foundational
concepts to advanced techniques, and prepare students to apply their knowledge in practical scenarios.

Course Learning Outcomes:

After completion of the course the students will be able to
CO1: Recall foundational knowledge, fundamentals of neural networks select skills in machine learning for
model development. (PO1),(PO6),(PO7),(PSO1),(PSO2)
CO2: Explain fundamentals of data pre-processing and feature engineering, dimensionality reduction
empowering them to proficiently manipulate data and optimize machine learning models, convolutional neural
networks for tasks like hand digit and image classification, hyper parameter tuning techniques, object
detection.(PO2), (PO4),(PO7), (PSO1),(PSO2)
CO3: Build accurate predictive models for diverse real-world applications by applying supervised learning,
covering a range of classification and regression algorithms. (PO3),(PO5),(PO7),(PSO1),(PSO2)
CO4: Discover the principles of unsupervised learning, clustering methods, association rule mining, and
practical applications, recurrent neural networks and Long Short-Term Memory networks, empowering them to
design and optimize sophisticated deep learning models for diverse applications in computer vision and
sequential data analysis.(PO3),(PO7),(PSO1),(PSO2)
CO5: Evaluate frameworks to create and assess advanced applications. (PO3),(PO7), (PSO1),(PSO2)

CO-PO MATRIX (H:3, M:2, L:1)

CO-PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PSO1 PSO2 CO1 2 1 1 3 2
22CAL301A CO2 3 2 1 3 1 CO3 3 2 2 1 1 CO4 3 2 1 1 CO5 3 3 1 1

19|CSC PG
UNIT-I (12 Hours)
Introduction to Machine Learning: Human Learning and Machine Learning, Types of Machine Learning,
Languages and Tools in Machine Learning, Framework for Developing Machine Learning Models, Preparing to
Model, Modeling and Evaluation Metrics.

UNIT-II (12 Hours)

Basics of Data Preprocessing and Feature Engineering: Feature Transformation, Feature Scaling, Feature
Construction and Feature Subset Selection, Dimensionality Reduction, Explorative Data Analysis, Hyper
Parameter Tuning, Introduction to SK Learn Package.

UNIT-III (12 Hours)

Supervised Learning: Introduction, Classification (Common Classification Algorithms): Naïve Bayes, KNN,
Decision Trees, Random Forest, Support Vector Machines, XGBoost.
Regression (Common Regression Algorithms): Simple Linear Regression and Multiple Linear Regression,
Polynomial Regression, Logistic Regression-Regularization: Lasso and Ridge.

UNIT-IV (12 Hours)

Unsupervised Learning: Introduction, Unsupervised Vs Supervised Learning, Unsupervised Learning Models,
Dimensionality Reduction, Clustering: Association Rule Mining, Applications of Unsupervised Learning.

UNIT-V (12 Hours)

Introduction to Neural Networks: Artificial Neural Networks, Hand Digit Classification, Convolution Neural
Networks, Image Classification, Hyper Parameter Tuning, Recurrent Neural Networks, Building Recurrent NN,
Long Short Term Memory, Object Detection, Fully Convolutional Networks (FCN), You only Look Once(YOLO).

Reference Text Books:

1. Hastie, T., R. Tibshirani, and J. H. Friedman. , The Elements of Statistical Learning: Data Mining, Inference
and Prediction, New York, NY: Springer, 2011, ISBN: 97803879
2. EthemAlphaydin, An introduction to Machine Learning, PHI Learning Private Limited, 2020 3.
AurelienGeron, Hands-On Machine Learning with Scikit Learn, Keras and Tensor Flow, O’REILY -2019
4. Tom Mitchell, Machine Learning, Tata McGraw Hill, 2013
5. Francois Chollet, Deep Learning with Python, Manning , 2019

20|CSC PG
M.C.A Semester: III Course Code: 22CAL301A Course Name: Machine Learning
Time: 3 Hours Max Marks: 70 SECTION-A
Answer the following questions. (5×4 = 20 Marks)

1. (a) Define Machine Learning and list different Machine Learning Techniques.
(CO1,L1) (or)
(b) What are the different tools used in Machine Learning? (CO1,L1)
2. (a) What are the techniques of Feature Scaling? (CO2,L1)
(or)
(b) Define Dimensionality Reduction and explain its Techniques. (CO2,L1)
3. (a) What are the various algorithms used for Classification? (CO3,L1)
(or)
(b) Define Logistic Regression. (CO3,L1)
4. (a) Explain Clustering and list out different Clustering Algorithms? (CO4, L2)
(or)
(b) Explain the Applications of Unsupervised Learning? (CO4,L2)
5. (a) List some commercial practical applications of Artificial Neural Networks.
(CO1,L1) (or)
(b) What is Object Detection? (CO2,L1)

SECTION-B
Answer ALL questions. All Questions Carry Equal Marks. (5×10 = 50 Marks)

6. (a) Explain the work flow in Machine Leaning Problem Solving. (CO1,L2)
(or)
(b) Explain Supervised and Unsupervised Learning with Examples. (CO1,L2)
7. (a) Discuss Feature Transmission in detail. (CO2, L6)
(or)
(b) Discuss Feature Subset Selection and its Application. (CO2,L6)

8. (a) Explain Classification Problem in Supervised Learning and Explain Decision Tree
Algorithm for Classification. (CO3,L5)
(or)
(b) Explain Linear and Multiple Linear Regression in Python Library Stats Models. (CO3,L5)

9. (a) Apply K-Means Clustering Algorithm on following X and Y values (10,34), (45,55),
(23,55), (14,66), (56,25),(12,16),(14,25). (CO4,L3)
(or)
(b) Choose suitable Algorithm in SK-Learn Package to perform Hierarchical Clustering. (CO4,
L3) 10. (a) List basic features in Neuron and different types of Activation Functions. (CO1,L2)
(or)
(b) List various parameters of Convolution Neural Network. (CO6,L2)

21|CSC PG
Offered to: M.C.A
Course Name Machine Learning Lab L T P C CIA SEE TM Course Code 22CAP301A 4 0 0 4 30 70 100
Year of Introduction:
Percentage of Revision: 16%
2021 Year of Offering: 2021 Year of Revision: 2024
L-Lecture, T-Tutorial, P-Practical, C-Credits, CIA-Internal Marks, SEE-External Marks, TM-Total Marks

Course Description and Purpose:

Machine Learning Lab (22CAP301) is a course that illustrates concepts of Load Data Sets from Different
Sources, Basics of Data Pre-processing and Feature Selection, Supervised Learning and Regression
Algorithms, Supervised Learning and Classification Algorithms, Concepts of Clustering Algorithms.
Course Objectives:
This course will help enable the students to understand learn, apply / implement the Load Data Sets from
Different Sources, Basics of Data Pre-processing and Feature Selection, Supervised Learning and Regression
Algorithms, Supervised Learning and Classification Algorithms, Concepts of Clustering Algorithms.
Course Outcomes:
Upon successful completion of the course, the student will be able to:
CO1: Know the concepts of Load Data Sets from Different Sources. (PO1),(PO5),(PSO1),(PSO2)
CO2: Understand basics of Data Pre-processing and Feature Selection. (PO1),(PO3),(PO5), (PSO1),
(PSO2) CO3: Applying Supervised Learning and Regression Algorithms. (PO1),(PO2),(PO5),
(PSO1),(PSO2) CO4: Analyze Supervised Learning and Classification Algorithms. (PO1),(PO3),
(PO5), (PSO1),(PSO2) CO5: Evaluating Clustering Algorithms. (PO1),(PO6),(PO7),(PSO1),(PSO2)

CO-PO MATRIX (H:3, M:2, L:1)

CO-PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PSO1 PSO2 CO1 2 2 3 1 2
22CAP302A 12311
CO2 3 3 3 1 3 1 CO3 2 2 2 1 1 3 CO4 1 3 3 1 2 1 CO5

1. Write a program to open Data Sets in Python. (CO1,L1)

2. Explain various Plotting Techniques of Python. (CO2, L2)
REGRESSION ALGORITHMS
3. Demonstrate Simple Linear Regression in Python with Sample Data Sets.
(CO3,L2) 4. Demonstrate Multiple Linear Regressions in Python with Sample Data
Sets. (CO3,L2) 5. Demonstrate Decision Tree Regression in Python with Sample
Data Sets. (CO3,L2) 6. Demonstrate Support Vector Regression in Python with
Sample Data Sets. (CO3,L2) 7. Demonstrate Random Forest Regression in Python
with Sample Data Sets. (CO3,L2) 8. Demonstrate XGBoost for regression in Python
with Sample Data Sets(CO3,L2) CLASSIFICATION ALGORITHMS

22|CSC PG
9. Demonstrate Logistic Regression in Python with Sample Data Sets. (CO4,L2)
10. Demonstrate Support Vector Classification in Python with Sample Data Sets.
(CO4,L2) 11. Demonstrate Random Forest Classification in Python with Sample Data
Sets. (CO4,L2) 12. Demonstrate Naïve Bayes Classification in Python with Sample
Data Sets. (CO4,L2) CLUSTERING ALGORITHMS
13. Demonstrate K-Means Clustering with Sample Data Sets. (CO5,L2)
14. Demonstrate Hierarchical Clustering with Sample Data Sets. (CO5,L2)

Note: The list of experiments is not limited to the above list. If the existing laboratory experiments completed
in advance, the additional laboratory programs can added , and to be executed in the laboratory.

23|CSC PG
Offered to: M.C.A Semester: III
Course Name Big Data and Analytics Lab L T P C CIA SEE TM Course Code 22CAP302A 4 0 0 4 30 70
100 2020 Year of Offering: 2022 Year of Revision:
Year of Introduction: Nil
Percentage of Revision: Nil
L-Lecture, T-Tutorial, P-Practical, C-Credits, CIA-Internal Marks, SEE-External Marks, TM-Total Marks

Course Description and Purpose: This laboratory course Big Data and Analytics Lab(22CAP302) focuses on
hands on experience with Hadoop installations and commands, implementing word count in Hadoop, Pig
installations and commands, MongoDB tasks and operations, including bulk documents, arrays, and
MapReduce, as well as Spark installation and operations, including RDDs, data frames, and Spark SQL.

Course Objectives: This laboratory course aimed to implement Hadoop Installations, Hadoop Commands,Word
Count in Hadoop, Pig Installation, Pig Commands, MongoDB, MongoDB Commands, Tasks On Mongodb, Bulk
Documents in Mongodb, Arrays in Mongodb, Map Reduce in Mongodb, Aggregate Functions in Mongodb,
Mongo Import & Export and Spark Installation, Operations of Rdd, Working With Data Frames, Spark SQL
Operations.

Course Leaning Outcomes:

Upon successful completion of the course, the student will be able to:
CO1: Demonstrate foundational Hadoop installations, basic Hadoop commands and implement the
Word Count program. (PO1),(PO4),(PO5),(PO6),(PSO1),(PSO2)
CO2: Illustrating a proficiency in setting up Pig for data processing. (PO1),(PO5),(PSO1),
(PSO2) CO3: Understanding of arrays in MongoDB,explaining their basic use and
functionality.
(PO1),(PO2),(PO4),(PO5),(PO6),(PO7),(PSO1),(PSO2)
CO4: Design and implement advanced tasks in MongoDB. (PO1),(PO3),(PSO1),(PSO2)
CO5: Apply Spark SQL operations. (PO1),(PO2),(PO3),(PO7),(PSO1),(PSO2)

CO-PO MATRIX (H:3, M:2, L:1)

COURSE
CODE CO-PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PSO1 PSO2 CO1 2 1 2 3 1 2 CO2 2 2 3 1
22CAP302A CO3 2 2 1 2 1 3 3 CO4 3 3 1 1 2 CO5 3 2 3 1 1 1

1. Hadoop Installation Steps.

(CO1,L3) 2. Hadoop Commands.

(CO1,L3)

3. Word Count Program in Hadoop.

(CO2,L1) 4. Pig Installation Steps.

(CO2,L3) 5. Pig Commands. (CO3,L3)

6. Introduction To Mongodb. (CO3,BTL1)

24|CSC PG
7. Mongodb Commands. (CO3,BTL3)

8. Tasks on Mongodb. (CO4,BTL3)

9. Creating Bulk Documents In Mongodb.

(CO4,L6) 10. Arrays in Mongodb. (CO3,L1)

11. Map Reduce in Mongodb. (CO4,L3) 12.

Aggregate Functions in Mongodb. (CO4,L3)

13. Mongo Import. (CO4,L3)

14. Mongo Export. (CO4,L3)

15. Spark Installation. (CO5,L3)

16. Operations of Rdd. (CO5,L3)

17. Working With Data Frames.

(CO5,L3) 18. Spark Sql Operations.

(CO5,L3)
 25|CSC PG
Offered to: M.C.A Semester: III
Course Name Big Data and Analytics L T P C CIA SEE TM Course Code 22CADSL301A 4 0 0 4 30 70 100
Year of Introduction:
25
2022-23 Year of Offering: 2022 Year of Revision: 2024-
Percentage of Revision: 5%
L-Lecture, T-Tutorial, P-Practical, C-Credits, CIA-Internal Marks, SEE-External Marks, TM-Total Marks

Course Descriptive and Purpose: This course (22CADSL301) is designed to assist students in comprehending
the significance of big data in everyday life. It covers topics such as data ingestion, data storage and
processing using Hadoop, gaining knowledge about contemporary database systems, utilizing NoSQL
database MongoDB and implementing Apache Spark through APIs, including SQL and Data Frames, for
efficient data processing and analysis.

Course Objectives: The course helps the students to understand Big data and its role in Daily Life, Data
Storage and Processing in Hadoop, Knowledge acquisition on Modern Databases. Implementation of Apache
Spark with API SQL and Data Frames.

Course Learning Outcomes:

On Successful completion the student will be able to:
CO1: Understand what is Big Data?, Big Data Analytics, MongoDB, Underneath an RDD, Changing in the realms of Big
Data, Top Challenges facing Big Data, Data Types in MongoDB, Anatomy of Pig, Types of NoSQL Databases, Structuring
Spark.(PO1),(PO2),(PSO1),(PSO2)
CO2: Infer about Apache Spark, Spark SQL and Data Frames, Operations, Typical Data Warehouse and
Hadoop Environment. (PO1),(PO2),(PO4),(PO6),(PSO1),(PSO2)
CO3: Experiment with Mongo DB Documents, Import and Export of Mongo DB Documents. (PO1),(PO3),(PO5),(PO7),
(PSO1),(PSO2)
CO4: Analyze Hive Architecture, Processing Data with Hadoop, MongoDB CRUD operations. (PO1),(PO2),
(PO3), (PSO1),(PSO2)
CO5: Explain Hadoop Overview, Hadoop Distributed File System, Map Reduce Programming. (PO1),(PO2),
(PO4),(PO5),(PO6),(PO7),(PSO1),(PSO2)

CO-PO MATRIX (H:3, M:2, L:1)

COURSE CODE CO-PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PSO1 PSO2 CO1 3 2 2 2 3 3 CO2 3 3 1 1 1 1
22CADSL301A CO3 2 3 3 1 1 3 CO4 3 2 2 2 1 CO5 3 3 2 2 1 1 1 2

26|CSC PG
UNIT-I (12 Hours)
Types of Digital Data: Classification of Digital Data.
Introduction to Big Data: Characteristics of Data, Evolution of Big Data, Definition of Big Data, Challenges with
Big Data, What is Big Data?, Other Characteristics of Data, Why Big Data?, Traditional Business Intelligence
versus Big Data, Typical Data Warehouse Environment, Typical Hadoop Environment, Coexistence of Big Data
and Data Warehouse, What is Changing in the realms of Big Data.
Big Data Analytics: What is Big Data Analytics, What Big Data Analytics is not?, Why this sudden Hype around
Big Data Analytics?, Classification of Analytics, Greatest Challenges that Prevent Business from Capitalizing
Big Data, Top Challenges facing Big Data, Why Big Data Analytics Important?, What Kind of Technologies are
we looking toward to help meet the challenges posed by Big Data?, Data Science, Data Scientist,
Terminologies used in Big Data Environments.
UNIT-II (12 Hours)
Hadoop: Features of Hadoop, Key advantages of Hadoop, Versions of Hadoop, Overview of Hadoop
Ecosystem, Hadoop Distributions, Why Hadoop?, Why not RDBMS, RDBMS versus Hadoop, Distribution
Computing Challenges, History of Hadoop, Hadoop Overview, Hadoop Distributed File System.
Processing Data with Hadoop: Managing Resource and Applications with Hadoop with YARN (Yet Another
Recourse Negotiator), Interacting with Hadoop Ecosystem.

UNIT-III (12 Hours)

Introduction to Map Reduce Programming: Introduction, Mapper, Reducer, Combiner, Partitioner, Searching,
Sorting, Compression.
NoSQL: Where it is used?, What is it?, Types of NoSQL Databases, Why NoSQL?, Advantages of NoSQL,
What we miss with NoSQL?, Use of NoSQL in Industry, SQL versus NoSQL.
MongoDB: What is MongoDB, Why MongoDB, Using JavaScript, Script Object Notation, Generating Unique
Key, Support for Dynamic Queries, Storing Binary Data, Replication, Sharding, Updating Information in Place,
Terms used in RDBMS and MongoDB, Data Types in MongoDB, MongoDB Query Language?
UNIT-IV (12 Hours)
Hadoop Eco System:
Hive: What is Hive?, Hive Architecture, Hive Data Types, Hive File Format, Hive Query Language (HQL), RC
File Implementation, User Defined Function.
PIG: What is PIG?, Anatomy of Pig, Pig on Hadoop, Pig Philosophy, Use Case for Pig, Pig Latin, Data type in
Pig, Running Pig, Execution Mode of Pig, HDFS Commands, Relational Operators, Eval Funtions, Complex
Data Types, User Defined Functions, Parameter Substitution.
Hbase: Hbasics, Concepts, Clients, Hbase versus RDBMS.
Hadoop Data Ingestion Services: Sqoop and flume.
UNIT-V (12 Hours)
Apache Spark:
Introduction to Apache Spark: A Unified Analytics, What Is Apache Spark?, Unified Analytics, The Developer’s
Experience, Using Scala and PySpark Shell, Understanding Spark Application Concepts, Transformations,
Actions and Lazy Evaluation, The Spark UI.
Apache Spark’s API: What’s Underneath an RDD?, Structuring Spark, The Data Frame API, The Dataset API,
Data Frames Versus Datasets, When to Use RDDs, Spark SQL and the Underlying Engine.
Spark SQL and Data Frames: Introduction to built in Data Sources, Using Spark SQL in Spark Applications,
SQL Tables and Views, Data Sources for Data Frames and SQL Tables: Data Frame Reader, Data Frame
Writer, JSON, CSV, Images, Binary Files.
Common Data Frames and Spark SQL Operations: Unions, Joins, Windowing Spark SQL and Datasets:
Working with Datasets: Creating Sample Data, Transforming Sample Data.

27|CSC PG
Prescribed Text Books

S.No Author Title Publisher 1 Seema Acharya- Subhashini Chellappan Big Data and Analytics Wiley
Publications – Second Edition (UNIT I, II, III, IV)
Reference Text Books O'Reilly Second Edition (UNIT V: 1
2 Karau H, Konwinski A, Wendell P, Learning Spark : Lightning Fast to 6 Chapters)
Zaharia M Data Analytics

S.No Author Title Publisher 1 Tom White Hadoop: The Definitive Guide O’Reilly, Yahoo Press, Third
Edition
2 Bill Chambers & Matei Zaharia SPARK: The Definitive Guide O’Reilley, 2018 Edition Big data Analytics
with Spark: A
3 Guller M for Large Scale Data Analysis Apress, 2015
Practitioner’s Guide to using Spark
 28|CSC PG
M.C.A Semester: III 22CADSL301A : Big Data and Analytics Time: 3 Hours Max
Marks: 70
SECTION-A
Answer the following questions. (5×4 = 20 Marks)
1. (a) Function Big Data. (CO1, L4)
(or)
(b) Classify the analytics. (CO1, L4)
2. (a) Compare RDBMS and Hadoop. (CO5, L2)
(or)
(b) Explain Key Components of Yarn? (CO4, L2)
3. (a) What is Hadoop Map Reduce? (CO5, L1)
(or)
(b) List the types of NoSQL Databases. (CO1, L1)
4. (a) Explain various Data Types for Hive. (CO4, L5)
(or)
(b) Compare HBase versus RDBMS (CO1, L5)
5. (a) What is Apache Spark? (CO2, L1)
(or)
(b) Define JSON. (CO2, L1)
SECTION-A
Answer the following questions. (5 × 10 = 50 Marks) 6. (a) Explain the
Digital Data with examples. (CO1, L2)
(b) Summarize the challenges faced by Bigdata. (CO1, L2)
(or)
(c) Explain Brewers Theorem with examples. (CO1, L2)
(d) Explain the In-memory Analytics. (CO1, L2)
7. (a) Explain Hadoop Eco System with neat diagram. (CO5, L2)
(or)
(b) Explain HDFS File Systems with neat diagram. (CO5, L2)
8. (a) Make use of Map Reduce in Hadoop with example. (CO5, L3)
(or)
(b) Make use of File Read and File Write in Hadoop. (CO5, L3)
9. (a) Explain Hive Architecture with neat diagram. (CO4, L5)
(or)
(b) Explain CRUD Operations in MongoDB with examples. (CO4, L5)
(c) Explain MongoDB import and export with examples. (CO4, L5)
10. (a) Explain TDD in Apache Spark with examples. (CO1, L5)
(or)
(b) Explain Common Data Frames and Distinguish between Data Frames Vs Datasets. (CO5,
L5) (c) Explain Spark SQL Operations in spark. (CO2, L5)
29|CSC PG
Offered to: M.C.A Semester: III
Course Name Cloud Computing L T P C CIA SEE TM Course Code 22CADSL302A 4 0 0 4 30 70 100
Year of Introduction: Percentage of Revision: 5%

2018 Year of Offering: 2021 Year of Revision: 2024

L-Lecture, T-Tutorial, P-Practical, C-Credits, CIA-Internal Marks, SEE-External Marks, TM-Total Marks

Course Description and Purpose: Cloud Computing (22CADSL302) is a course that illustrates concepts of
Cloud Computing and Virtualization, Services and Deployment Models of Cloud Computing, Developing Cloud
Applications using Open Source Cloud Software, AAA Model, Challenges and Benefits of Mobile Cloud
Computing. Course Objectives: Students will learn theoretical aspects of cloud computing and also gain
practical skills and a critical understanding of the various elements involved.
Course Leaning Outcomes:
On successful completion the students should be able to
CO1: What is Virtualization and its Benefits, Mechanisms, Server Virtualization versus Cloud Computing.
(PO1),(PO2),(PSO1),(PSO2)
CO2: Infer about Open-Source Cloud Implementations, Application Architecture for Cloud, AAA Administration
for Clouds. (PO1),(PO2),(PO3),(PO6),(PSO1),(POS2)
CO3: Identify Risks, Consequences and Costs for Cloud Computing, Cloud Computing Services. (PO1),(PO4),
(PO5),(PSO1),(PSO2)
CO4: Analyze Stages during the development process of Cloud Application, Cloud Computing Service Delivery
Models. (PO2),(PO4), (PSO1),(PSO2)
CO5: Explain about Mobile Cloud Computing, Programming Support for Google Apps Engine, Amazon EC2,
Elastic Block Store (ESB). (PO2),(PO3),(PO7),(PSO1),(POS2)

CO-PO MATRIX (H:3, M:2, L:1)

COURSE CODE CO-PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PSO1 PSO2 CO1 3 3 3 2 CO2 3 2 3 2 1 3
22CADSL302A UNIT-I (12 Hours)
CO3 3 3 3 2 3 CO4 3 2 3 1 CO5 2 3 1 1 1
Era of Cloud Computing: Getting to Know the Cloud, Peer-to-Peer, Client-Server and Grid Computing, Cloud
Computing versus Client-Server Architecture, Cloud computing versus Peer-To Peer Architecture, Cloud
computing versus Grid Computing, How we got to the Cloud, Server Virtualization versus Cloud Computing,
Components of Cloud Computing, Cloud Types, Cloud Computing Service Delivery Models.
Introducing Virtualization: Introducing Virtualization and its Benefits, Implementation Levels of Virtualization,
Virtualization at the OS Level, Virtualization Structure, Virtualization Mechanisms, Open Source Virtualization
Technology, Binary Translation with Full Virtualization, Virtualization of CPU, Memory and I/O Devices,
Hardware support for Virtualization in Intex x86 Processor
UNIT-II (12 Hours)
Cloud Computing Services: Infrastructure as a Service, Platform as a Service, Language and Pass, Software
as a Service, Database as a Service.
Open Source Cloud Implementations and Administration: Open-Source Eucalyptus Cloud Architecture, Open
Source Open Stack Cloud Architecture.
30|CSC PG
UNIT-III (12 Hours)
Application Architecture for Cloud: Cloud Application Requirements, Recommendations for Cloud Application
Architecture, Fundamental Requirements for Cloud Application Architecture, Relevance and use of Client-
Server architecture for Cloud Application, Service Oriented Architecture for Cloud Applications. Cloud
Programming: Programming Support for Google Apps Engine, Big Table as Google’s NOSQL System, Chubby
as Google Distributed Lock Service, Programming Support for Amazon EC2, Elastic Block Store (ESB), AWS
Implementation, Introduction to AWS, Introduction to Meghdooth

UNIT-IV (12 Hours)

Risks, Consequences and Costs for Cloud Computing: Introducing Risks in Cloud Computing, Risk Assessment
and Management, Risk of Vendor Lock-In, Risk of Loss Control, Risk of Not Meeting Regulatory Compliances,
Risk of Resource Scarcity, Risk in Multi-Tenant Environment, Risk of Failure, Risk of Failure of Supply Chain,
Risk of Malware and Internet Attacks, Risk of Inadequate SLA , Risk of Management of Cloud Resources, Risk
of Network Outages, Risks in the Physical Infrastructure, Legal Risk due to Legislation, Risks with Software
and Application Licensing, Security and Compliance Requirements in a Public Cloud, Direct and Indirect Cloud
Costs, Calculating Total Cost of Ownership for Cloud Computing, Cost Allocations in a Cloud.
AAA Administration for Clouds: The AAA Model, Single Sign-On for Clouds, Industry Implementations for AAA,
Authentication Management in the Cloud, Authorization Management in the Cloud.

UNIT-V (12 Hours)

Application Development for Cloud: Developing On-Premise Versus Cloud Applications, Modifying Traditional
Applications for Deployment in Cloud, Stages during the development process of Cloud Application, Managing
a Cloud Application, Using Agile Software Development for Cloud Application, Cloud Applications: What Not to
do, Static Code Analysis for Cloud Applications, Developing Synchronous and Asynchronous Cloud
Applications.
Mobile Cloud Computing: Definition of Mobile Cloud Computing, Architecture of Mobile Cloud Computing,
Benefits of Mobile Cloud Computing, Mobile Cloud Computing Challenges.

Prescribed Text Books

Author Title Publisher Kailash
Jayaswal,Jagannath
1 Kallakurchi, Donald J. Houde & Dr. Cloud Computing, Black Book
Deven Shah DreamTech Press
Reference Text Books
Author Title Publisher Thomas Erl, Zaigham
1 Pearson
Mahmood, Ricardo Puttini
Raj Kumar Buyya, Christen
Vecctiola, S Tammarai selvi Mastering Cloud Computing,
2
Cloud Computing Concepts Foundations and Application
Technology and Architecture
Programming TMH

31|CSC PG
M.C.A Semester: III Course Code: 22CADSL302A Course Name: Cloud Computing
Time: 3 Hours Max Marks: 70 SECTION-A
Answer the following questions. (5×4 = 20 Marks)

1. (a) Explain SaaS (CO6, L2)

(or)
(b) Explain Virtualization (CO1, L2)

2. (a) What is an Open Source? (CO2, L1)

(or)
(b) What is Eucalyptus? (CO2, L1)

3. (a) What are the advantages of SOA? (CO2, L1)

(or)
(b) What are the drawbacks of GFS? (CO5, L1)

4. (a) Explain the risk of Malware (CO6, L5)

(or)
(b) Explain Authentication (CO2, L5)

5. (a) What not to do in Cloud Application Development? (CO4, L1)

(or)
(b) What are the advantages of MCC? (CO5, L1)

SECTION-B
Answer the following questions. (5×10=50Marks)

6. (a) Explain the various Types of Cloud with neat diagrams. (CO4, L2)
(b) Compare and contrast Cloud Computing Architecture with Peer to Peer Architecture. (CO1,
L2) (or)
(c) Explain Virtualization and its benefits and levels. (CO1, L2)
7. (a) Identify Cloud Computing Services on private cloud. (CO6, L3)
(or)
(b) Build Open-Source Cloud Architecture with example. (CO2, L3)
8. (a) Categorize the requirements of Cloud Application? (CO2, L4)
(or)
(b) Examine AWS and Meghdoot implementations. (CO5, L4)
9. (a) Explain Risks in Cloud Computing. (CO6, L5)
(or)
(b) Explain AAA Model for Clouds. (CO2, L5)
 10. (a) Explain Stages during the Development Process of Cloud Applications.
(CO4, L5) (or)
(b) Explain Mobile Cloud Computing its Advantages and Disadvantages. (CO5, L5)

32|CSC PG
Offered to: M.C.A Semester: III
Course Name Design & Analysis of Algorithms L T P C CIA SEE TM Course Code 22CADSL303A 4 0 0 4 30
70 100 2005 Year of Offering: 2022 Year of Revision:
Year of Introduction: 2024
Percentage of Revision: 15%
L-Lecture, T-Tutorial, P-Practical, C-Credits, CIA-Internal Marks, SEE-External Marks, TM-Total Marks

Course Description and Purpose: The course Design & Analysis of Algorithms ( 22CADSL303) is intended to
develop proficiency in Problem Solving, perform Analysis of various Algorithms in regard to Time and Space
Complexity, gain good understanding of Applications of Data Structures, apply Design Techniques to solve
different types of problems as per their Complexity and develop ability to segregate NP-Hard and NP-Complete
problems.

Course Objectives: To provide a comprehensive understanding and practical skills necessary for effective
Problem Solving and Algorithm Analysis in Computer Science.

Course Leaning Outcomes: On successful completion of this course the student will be able to CO1: Recall
basics of Algorithms, Data Structures, Performance Analysis, and Graph Theory to prepare Efficient Solutions
to a wide array of Computational Problems. (PO1),(PO4),(PO5),(PO7),(PSO1),(PSO2) CO2: Explain advanced
Algorithmic Paradigms and Techniques used to solve problems. (PO2),(PO6),(PO7),(PSO1),(PSO2)
CO3: Apply various techniques to solve a wide range of computational problems efficiently and effectively.
(PO3),(PO6),(PSO1),(PSO2)
CO4: Analyze the theoretical underpinnings and implications of these complexities of the algorithms with a
profound understanding of NP-Hard and NP-Complete problems to address computationally challenging
problems. (PO3),(PO4),(PO5),(PO7),(PSO1),(PSO2)
CO5: Explain algorithms to optimize the Solutions in various Application Domains. (PO3),(PSO1),(PSO2)

CO-PO MATRIX (H:3, M:2, L:1)

CO-PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PSO1 PSO2 CO1 2 2 1 1 3 2
22CADSL303A UNIT-I (12 Hours)
CO2 3 2 2 1 1 CO3 3 1 1 1 CO4 3 2 3 3 1 2 CO5 3 2 1
Introduction: What is Algorithm, Algorithm Specification Pseudo code Conventions, Recursive Algorithms,
Performance Analysis: Space Complexity Time Complexity, Asymptotic Notation.
Elementary Data Structures: Stacks and Queues, Trees: Terminology, Binary Trees, Dictionaries: Binary
Search Trees, Priority Queues, Heaps, Heapsort, Sets and Disjoint Set Union: Introduction-Union and Find
Operations, Graphs: Introduction, Definitions, Graph Representations.

33|CSC PG
UNIT-II (12 Hours)
Divide-and-Conquer: General Method, Binary Search, Finding Maximum and Minimum, Merge Sort, Quick Sort,
Strassen’s Matrix Multiplication.
The Greedy Method: The General Method, Knapsack Problem, Tree Vertex Splitting, Job Sequencing with
Deadlines, Minimum Cost Spanning Trees: Prim's Algorithm, Kruskal's Algorithm, Optimal Storage on Tapes,
Single Source Shortest Paths.
UNIT-III (12 Hours)
Dynamic Programming: The General Method, Multi Stage Graphs, All Pairs Shortest Paths, Single Source
Shortest Paths, Optimal Binary Search Trees, -0/1 Knapsack, Reliability Design, The Traveling Sales Person
Problem, Flow Shop Scheduling.
Basic Traversal and Search Techniques: Techniques for Binary Trees, Techniques for Graphs: Breadth First
Search and Traversal-Depth First Search, Connected Components and Spanning Trees, Bi-Connected
Components and DFS.
 UNIT-IV (12 Hours)
Backtracking: The General Method, The 8-Queens Problem, Sum of Subsets, Graph Coloring, Hamiltonian
Cycles, Knapsack Problem.
Branch and Bound: The Method: Least Cost Search, The 15 Puzzle Control Abstractions for LC Search,
Bounding, FIFO Branch and Bound , LC Branch and Bound, 0/1 Knapsack Problem, LC Branch and Bound
Solution, FIFO Branch and Bound Solution, Traveling Sales person.

UNIT-V (12 Hours)

NP-Hard and NP-Complete Problems: Basic Concepts: Non Deterministic Algorithms, The Classes NP Hard
and NP Complex, Cook's Theorem, NP Hard Graph Problems, Clique Decision Problem, Node Cover Decision
Problem Chromatic Number Decision Problem, Directed Hamiltonian Cycle, Traveling Sales Person Decision
Problem, AND/OR Graph Decision Problem.

Prescribed Text Book:

1. Sartaj Sahni, Fundamentals of Computer Algorithms, Second Edition, Universities Press, 2nd Edition,
2008. Reference Text Books:
1. Anany Levitin, Introduction to the Design & Analysis of Algorithms, 2nd Edition, Pearson Education,
2007. 2. I.Chandra Mohan, Design and Analysis of Algorithms, PHI, 2nd Edition, 2012.
3. Prabhakar Gupta, Vineet Agrawal, Design and Analysis of Algorithms, PHI, 2nd Edition 2012.
4. Parag Himanshu, Dave, Design and Analysis of Algorithms, Pearson Education, 1st Edition
2008.

34|CSC PG
M.C.A Semester: III Course Code: 22CADSL303A Course Name: Design & Analysis of Algorithms Time:
3 Hours Max Marks: 70 SECTION-A
Answer the following questions. (5×4 = 20 Marks)
1. (a) Define Algorithm. Explain the algorithm specification briefly.(CO1,L1)
(or)
(b) What are the operations in a Priority Queue? (CO1, L1)
2. (a) What is the general method for Divide and Conquer Algorithms technique.
(CO2,L1) (or)
(b) What is Tree Vertex Splitting? (CO2,L1)
3. (a) What are connected components? (CO2,L1)
(or)
(b) Differentiate DFS and BFS. (CO3,L2)
4. (a) What is Graph Colouring? (CO2,L2)
(or)
(b) What is Branch and Bound technique?(CO2,L1)
5. (a) Compare NP hard and NP Complete Classes. (CO3,L2)
(or)
(b) What is Chromatic Number Decision Problem? (CO5,L2)

SECTION - B
Answer all questions. All question carry equal marks. 5 × 10 = 50 Marks 6. (a) Define Algorithm.
Discuss Performance Analysis of Algorithms briefly. (CO1, L2) (or)
(b) Explain Disjoint Sets, Disjoint Set Union & Find Operations with Algorithms. (CO1,
L2)
7. (a) Analyze Divide and Conquer approach and write algorithm for Quick Sort with an example.
(CO2,L4) (or)
(b) Examine general method for Greedy Method and also apply it on Single Source Shortest Path
by writing an algorithm with suitable example. (CO2, L4)

8. (a) Examine algorithm and procedure of finding Optimal Binary Search Tree using
Dynamic Programming with example. (CO3,L4)
(or)
(b) Examine Traversal Techniques for Graphs with an example. (CO3,L4)

9. (a) Explain Control Abstraction for LC Search and 0/1-Knapsack Problem using
Branch and Bound Technique. (CO4,L5)
(or)
(b) Explain the Sum of Subsets Problem using Back Tracking Technique. (CO4,L5)

10. (a) Make use of different formulae prove COOKs Theorem. (CO5,L3)
(or)
(b) Choose NP-Hard Graph Problems and explain. (CO5,L3)

35|CSC PG