DWDM

A. Y.
:2022-23
Name of the
Course(Data
Ware housing and
Data Mining) Year: III Sem:II
Course File
Name of the Faculty: Mr. K. Kiran Kumar

Department: Computer Science Regulation: R20
Course: B. Tech Course Code: R2031052
Year: III SEM: I Academic year: 2022-23
S. No Description Remarks
1. Vision & Mission of College
2. Vision & Mission of Department
3. Course Objectives & out comes
4. Syllabus
5. Roll List
6. Class Time Tables
7. University & College Academic Calendar
8. Lesson Plan
Actual Lesson Plan(With tentative dates &
9.
Actual Coverage dates)
10. Lecture Notes(hand written)
11. Question Bank
Mid Question Papers with Schema of Evaluation
12.
and Key
13. Previous university Question Papers
14. Topic Beyond Syllabus
15. Internal Marks
16. List of e-resources
17. Pass percentage
18. Simple Assignment sheet
19. Attainment Sheet
Vision & Mission of College
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Vision: To contribute for sustainable development of nation through achieving

excellence in technical education and research while facilitating transformation of
students into responsible citizens and competent professionals.
Mission:
 To impart affordable and quality education in order to meet the needs of

industries and achieve excellence in teaching-learning process.
 To collaborate with other academic & research institutes as well as industries in
order to strengthen education and multidisciplinary research.
 To promote equitable and harmonious growth of students, academicians, staff,
society and industries, thereby becoming a centre of excellence in technical
education.
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Vision & Mission of Department
Vision:
To be a recognized leader by imparting quality technical education and

thereby facilitating the extensive research environment, equipping students with
latest skills in the field of technology supplemented with practical orientation to
face challenges in the fast-morphing modern computing industry and academia for
the betterment of the society.
Mission
M1: To produce best quality computer science and IT professionals and

researchers by providing state-of-the-art training, hands on experience and healthy
research environment.
M2: To collaborate with industry and academia around the globe for achieving
quality technical education and excellence in research through active participation
of all the stakeholders.
M3: To promote academic growth by establishing center of Excellences and
offering inter-disciplinary postgraduate and doctoral programs.
Course Objectives & out comes

A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Course Objectives:
The main objective of the course is to
 Introduce basic concepts and techniques of data warehousing and data
mining.
 Examine the types of the data to be mined and apply pre-processing methods
on raw data.
 Discover interesting patterns, analyze supervised and unsupervised models
and estimate the accuracy of the algorithms.
Course Outcomes:
By the end of the course student will be able to
 Illustrate the importance of Data Warehousing, Data Mining and its
functionalities and Design schema for real time data warehousing
applications.
 Demonstrate on various Data Preprocessing Techniques viz. data cleaning,
data integration, data transformation and data reduction and Process raw data
to make it suitable for various data mining algorithms.
 Choose appropriate classification technique to perform classification, model
building and evaluation.
 Make use of association rule mining techniques viz. Apriori and FP Growth
algorithms and analyze on frequent item sets generation.
 Identify and apply various clustering algorithm (with open source tools),
interpret, evaluate and report the resul
Syllabus
UNIT I:
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Data Warehousing and Online Analytical Processing: Data Warehouse: Basic

concepts, Data Warehouse Modeling: Data Cube and OLAP, Data Warehouse
Design and Usage, Data Warehouse Implementation, Introduction: Why and What
is data mining, What kinds of data need to be mined and patterns can be mined,
Which technologies are used, Which kinds of applications are targeted.
UNIT II:
Data Pre-processing: An Overview, Data Cleaning, Data Integration, Data
Reduction, Data Transformation and Data Discretization.
UNIT III:
Classification: Basic Concepts, General Approach to solving a classification
problem, Decision Tree Induction: Attribute Selection Measures, Tree Pruning,
Scalability and Decision Tree Induction, Visual Mining for Decision Tree
Induction.
UNIT IV:
Association Analysis: Problem Definition, Frequent Item set Generation, Rule
Generation: Confident Based Pruning, Rule Generation in Apriori Algorithm,
Compact Representation of frequent item sets, FP Growth Algorithm.
UNIT V:
Cluster Analysis: Overview, Basics and Importance of Cluster Analysis,
Clustering techniques, Different Types of Clusters; K-means: The Basic K-means
Algorithm, K-means Additional Issues, Bi-secting K Means.
Text Books:
1. Data Mining concepts and Techniques, 3/e, Jiawei Han, Michel Kamber,
Elsevier,2011.
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
2. Introduction to Data Mining: Pang-Ning Tan & Michael Steinbach, Vipin

Kumar, Pearson,2012.
Reference Books:
1. Data Mining Techniques and Applications: An Introduction, Hongbo Du,
Cengage Learning.
2. Data Mining: VikramPudi and P. Radha Krishna, Oxford Publisher.
3. Data Mining and Analysis - Fundamental Concepts and Algorithms; Mohammed
J. Zaki, Wagner Meira, Jr, Oxford
4. Data Warehousing Data Mining & OLAP, Alex Berson, Stephen Smith, TMH.
http://onlinecourses.nptel.ac.in/noc18_cs14/preview
5. (NPTEL course by Prof.Pabitra Mitra)
http://onlinecourses.nptel.ac.in/noc17_mg24/preview
6. (NPTEL course by Dr. Nandan Sudarshanam& Dr. Balaraman Ravindran)
http://www.saedsayad.com/data_mining_map.htm
ROLL LIST
S. NO. REGD. NO. NAME OF THE STUDENT

1 20GK1A0501 AMARTALURI RAKESH
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
2 20GK1A0502 A.VENKATA PRATAP REDDY
3 20GK1A0503 BATHULA SHOBHANBABU
4 20GK1A0504 BESTA SNEHALATHA
5 20GK1A0505 BHEEMALA MAHESHBABU
6 20GK1A0506 BURLA MANIKANTA
7 20GK1A0507 CHINTA VAMSI
8 20GK1A0508 DASARI SIRISHA
9 20GK1A0509 DASARI SRAVANTHI
10 20GK1A0510 ERAGANABOINA NAVEEN
11 20GK1A0511 JAKKIREDDY KOTIREDDY
KANKANAMPATI V V S GANESH
12 20GK1A0512 GOUTHAM
13 20GK1A0513 KOLLURI RAHUL KALYAN
14 20GK1A0514 MACHARLA PRASANTH
15 20GK1A0515 MADDIRALA MOSHE
16 20GK1A0516 MANGALAPALLI JOHN DANIEL
17 20GK1A0517 MANNEM JOSEPH
18 20GK1A0518 MELANGI MANISHA
19 20GK1A0519 NANDAVARAPU BABI
20 20GK1A0520 NANDIPATI AJAY KUMAR

A. Y. :2022-23
Name of the
Course(Data
Ware housing and
21 20GK1A0521 NIZAMPATNAM NAGA SATISH
22 20GK1A0522 PAINAM SAI DHEERAJ
23 20GK1A0523 PALLI SHINOO RAJ
24 20GK1A0524 PANDI PRASANTH KUMAR
25 20GK1A0525 PERNI ABHIGNA NAIDU
PETLURI MADHAVA VENKATA

26 20GK1A0526 SAINADH
27 20GK1A0527 POGARTI PARDHA SARADHI
28 20GK1A0528 PONNAM GOPI HANUMA
29 20GK1A0529 SHAIK ABDULLAH BASHA
30 20GK1A0530 SHAIK SAMAD
31 20GK1A0531 THALLURI SNEHA LATHA
32 20GK1A0532 TIMMISETTI BHARGAV
33 20GK1A0533 TIRUMALASETTY SAI KRISHNA
34 20GK1A0534 ULLANGULA TIRUMALA TEJA
35 20GK1A0535 VAKA NEHANTH
36 20GK1A0536 YAMARTHI VIJETHA
37 20GK1A0537 YAMMALA ASHAKUMAR
38 20GK1A0538 BIKKI MANIDEEPAK
39 20GK1A0539 PAGADALA PADMA

A. Y. :2022-23
Name of the
Course(Data
Ware housing and
40 20GK1A0540 GOLLA VEERENDRA
41 20GK1A0541 S.SIMHA YADAV KEERTHI
42 20GK1A0542 BODDU NAGESH
43 20GK1A0543 KOTA GOPAL REDDY
44 21GK5A0501 BATTULA VENKATA RAO
45 21GK5A0502 K.MAHENDRA VINITH KUMAR
46 21GK5A0503 KURUBA SAITEJA
47 21GK5A0504 MANI CHANDHAR REDDY.M
48 21GK5A0505 MINCHALA RAMA KRISHNA
49 21GK5A0506 PUSULURI ELISHA BABU
50 21GK5A0507 VEMULA RAJYA LAKSHMI
51 21GK5A0508 M.MANOJ KUMAR
CLASS TIME TABLES
III CSE 1 2 3 4 5 6 7
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
I SEM
9:30- 10:20- 11:20- 12:10- 1:50- 2:40- 3:40-
10:20 11:10 12:10 1:00 2:40 3:30 4:50
MON RES DWDM DS DAA DAA CN LIB
TUE CN ES DWDM DS RES PROJECT
WED RES DS CN DWDM DWDM LAB
THU RES ES DWDM DAA CN LAB
FRI DWDM DS DAA CN PROJECT SPORTS
SAT CN DAA RES DS Skill Oriented Course
University & College Academic Calendar
University Academic Calendar for III Year B.Tech I Semester for the
A.Y:2022-2023
Description From To weeks
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Community Service Project 15.07.2022 30.07.2022 2W

I Unit of Instructions 01.08.2022 24.09.2022 8W
I Mid Examinations 26.09.2022 01.10.2022 1W
II Unit of Instructions 03.10.2022 26.11.2023 8W
II Mid Examinations 28.11.2022 03.12.2022 1W
Preparation & practical’s 05.12.2022 10.12.2022 1W
End Examinations 12.12.2022 25.12.2022 2W
College Academic Calendar for III Year B.Tech I Semester for the
A.Y:2022-2023
Description From To weeks
Community Service Project 15.07.2022 30.07.2022 2W
I Unit of Instructions 01.08.2022 24.09.2022 8W
I Mid Examinations 26.09.2022 01.10.2022 1W
II Unit of Instructions 03.10.2022 26.11.2023 8W
II Mid Examinations 28.11.2022 03.12.2022 1W
Preparation & practical’s 05.12.2022 10.12.2022 1W
LESSON PLAN
Name of the Course : DATA WAREHOUSING AND DATA MINING

Course Code : R2031052
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Branch : CSE
Duration (Dates) Total
Uni No.
Description
t From To of
Hours
UNIT I:
Data Warehousing and Online Analytical
Processing: Data Warehouse: Basic concepts,
Data Warehouse Modeling: Data Cube and
1 OLAP, Data Warehouse Design and Usage, Data
01.08.2022 20.09.2022 17
Warehouse Implementation, Introduction: Why
and What is data mining, What kinds of data need
to be mined and patterns can be mined, Which
technologies are used, Which kinds of
applications are targeted.
UNIT II:
2 Data Pre-processing: An Overview, Data
22.08.2022 07.09.2022 15
Cleaning, Data Integration, Data Reduction, Data
Transformation and Data Discretization.
UNIT III:
Classification: Basic Concepts, General Approach
3 to solving a classification problem, Decision Tree
08.09.2022 24.09.2022 15
Induction: Attribute Selection Measures, Tree
Pruning, Scalability and Decision Tree Induction,
Visual Mining for Decision Tree Induction.
UNIT IV:
Association Analysis: Problem Definition,
4 Frequent Item set Generation, Rule Generation:
10.10.2022 31.10.2022 18
Confident Based Pruning, Rule Generation in
Apriori Algorithm, Compact Representation of
frequent item sets, FP Growth Algorithm.
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
UNIT V:
Cluster Analysis: Overview, Basics and
5 Importance of Cluster Analysis, Clustering 16
02.11.2022 24.11.2022
techniques, Different Types of Clusters; K-means:
The Basic K-means Algorithm, K-means
Additional Issues, and Bi-secting K Means.
Text Books:
Elsevier, 2011.
Kumar, Pearson, 2012.
Reference Books:
Cengage Learning.
2. Data Mining: Vikram Pudi and P. Radha Krishna, Oxford Publisher.
J. Zaki, Wagner Meira, Jr, Oxford.
http://onlinecourses.nptel.ac.in/noc18_cs14/preview.
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
LESSON PLAN
DEPT: COMPUTER SCIENCE ENGINEERING

COURSE: DATA WAREHOUSING AND DATA MINING
Unit Schedule of Topics/Activities Sched Actual Remarks
uled
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
No of
No of
No. hour Date
hours
s
UNIT – I
1 Introduction to Data Ware Housing 1 1 01.08.2022
02.08.2022
2 Basic concepts 1 1
03.08.2022
3 Data Warehouse Modeling 1 1
04.08.2022
4 Data Cube and Online Analytical Processing 1 1
05.08.2022
5 Data Warehouse Design 1 1
06.08.2022
6 Data Warehouse Design and usage 1 1
08.08.2022
7 Data Warehouse Implementation 1 1
09.08.2022
8 Introduction to Data Mining 1 1
10.08.2022
9 Why is data mining 1 1
11.08.2022
10 What is data mining 1 1
12.08.2022
11 What kinds of data need to be mined 1 1
13.08.2022
12 What kinds of data need to be mined examples 1 1
16.08.2022
13 What kinds of patterns can be mined 1 1
17.08.2022
14 What kinds of patterns can be mined examples 1 1
18.08.2022
15 Which technologies are used 1 1
19.08.2022
16 Which kinds of applications are targeted 1 1
20.08.2022
17 Which kinds of applications are targeted examples 1 1
UNIT II
16 Introduction to Data Pre-processing 1 1 22.08.2022
17 An Overview Data Pre-processing 1 1 23.08.2022
18 Data Cleaning 1 1 24.08.2022
19 Data Cleaning examples 1 1 25.08.2022
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
20 Data Integration 1 1 26.08.2022

21 Data Integration calculations 1 1 27.08.2022
22 Data Reduction 1 1 29.08.2022
23 Data Reduction problems 1 1 30.08.2022
24 Data Transformation 1 1 31.08.2022
25 Data Transformation examples 1 1 01.09.2022
26 Data Discretization 1 1 02.09.2022
27 Data Discretization problems 1 1 03.09.2022
28 Revision 1 1 05.09.2022
29 Revision 1 1 06.09.2022
30 Assignment 1 1 07.09.2022
UNIT III
08.09.2022
31 Classification 1 1
32 09.09.2022
Basic Concepts 1 1
33 General Approach to solving a classification 10.09.2022
1 1
problem
1 1
problem examples
35 Decision Tree 1 1 13.09.2022
36 14.09.2022
Decision Tree classification 1 1
37 15.09.2022
What are the uses of Decision Tree 1 1
38 16.09.2022
Induction 1 1
39 17.09.2022
Attribute Selection Measures 1 1
40 Attribute Selection Measures example problems 1 1 19.09.2022
41 Tree Pruning 1 1 20.09.2022
42 Scalability 1 1 21.09.2022
43 Decision Tree Induction 1 1 22.09.2022
44 Visual Mining for Decision Tree Induction 1 1 23.09.2022

A. Y. :2022-23
Name of the
Course(Data
Ware housing and
45 Visual Mining for Decision Tree Induction 24.09.2022

1 1
examples
UNIT-IV
46 Introduction to Association Analysis 1 1 10.10.2022
47 11.10.2022
Problem Definition 1 1
48 12.10.2022
Frequent Item set Generation 1 1
49 13.10.2022
Frequent Item set Generation examples 1 1
50 14.10.2022
Rule Generation 1 1
51 15.10.2022
Confident Based Pruning 1 1
52 17.10.2022
Confident Based Pruning examples 1 1
53 Rule Generation in Apriori Algorithm 1 1 18.10.2022
54 Rule Generation in Apriori Algorithm 19.10.2022

1 1
implementation
55 Compact Representation of frequent item sets 1 1 20.10.2022
56 Compact Representation of frequent item sets 21.10.2022

1 1
examples
57 24.10.2022
FP-Growth Algorithm 1 1
58 25.10.2022
FP-Growth Algorithm implementation 1 1
59 26.10.2022
FP-Growth Algorithm applications 1 1
60 FP-Growth Algorithm advantages and 28.10.2022
1 1
disadvantages.
61 1 31.10.2022
Overview. 1
UNIT-V
62 Introduction to Cluster Analysis 1 1 02.11.2022
63 03.11.2022
What is Cluster Analysis 1 1
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
64 04.11.2022
Why we are using Cluster Analysis in data mining 1 1
65 05.11.2022
Advantages and disadvantages of Cluster Analysis 1 1
66 07.11.2022
Significance in Cluster Analysis 1 1
67 Overview Cluster Analysis 1 1 08.11.2022
68 Basics and Importance of Cluster Analysis 1 1 09.11.2022
69 Clustering techniques 1 1 10.11.2022
70 Different Types of Clusters 1 1 11.11.2022
71 K-means 1 1 14.11.2022
72 The Basic K-means Algorithm 1 1 15.11.2022
73 The Basic K-means Algorithm implementation 1 1 16.11.2022
74 K-means Additional Issues examples 1 1 17.11.2022
75 Bi-secting K Means 1 1 18.11.2022
76 Bi-secting K Means applications 1 1 19.11.2022
77 Characteristics of Bi-secting K Means 1 1 21.11.2022
78 Advantages and disadvantages of Bi-secting K 22.11.2022

1 1
Means
79 Revision 1 1 23.11.2022
80 Assignment 1 1 24.11.2022
Text Books:
Elsevier, 2011.
A. Y. :2022-23
Name of the
Course(Data
Ware housing and

Reference Books:
Cengage Learning.
Actual Lesson Plan (With tentative dates & Actual Coverage dates)
LESSON PLAN
DEPT: COMPUTER SCIENCE ENGINEERING

COURSE: DATA WAREHOUSING AND DATA MINING
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Sched
uled
Actual
Unit
Schedule of Topics/Activities No of Remarks
No. No of
hour Date
hours
s
UNIT – I
1 Introduction to Data Ware Housing 1 1 01.08.2022
02.08.2022
2 Basic concepts 1 1
03.08.2022
3 Data Warehouse Modeling 1 1
04.08.2022
4 Data Cube and Online Analytical Processing 1 1
05.08.2022
5 Data Warehouse Design 1 1
06.08.2022
6 Data Warehouse Design and usage 1 1
08.08.2022
7 Data Warehouse Implementation 1 1
09.08.2022
8 Introduction to Data Mining 1 1
10.08.2022
9 Why is data mining 1 1
11.08.2022
10 What is data mining 1 1
12.08.2022
11 What kinds of data need to be mined 1 1
13.08.2022
12 What kinds of data need to be mined examples 1 1
16.08.2022
13 What kinds of patterns can be mined 1 1
17.08.2022
14 What kinds of patterns can be mined examples 1 1
18.08.2022
15 Which technologies are used 1 1
19.08.2022
16 Which kinds of applications are targeted 1 1
20.08.2022
17 Which kinds of applications are targeted examples 1 1
UNIT II
16 Introduction to Data Pre-processing 1 1 22.08.2022
17 An Overview Data Pre-processing 1 1 23.08.2022
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
18 Data Cleaning 1 1 24.08.2022

19 Data Cleaning examples 1 1 25.08.2022
20 Data Integration 1 1 26.08.2022
21 Data Integration calculations 1 1 27.08.2022
22 Data Reduction 1 1 29.08.2022
23 Data Reduction problems 1 1 30.08.2022
24 Data Transformation 1 1 31.08.2022
25 Data Transformation examples 1 1 01.09.2022
26 Data Discretization 1 1 02.09.2022
27 Data Discretization problems 1 1 03.09.2022
28 Revision 1 1 05.09.2022
29 Revision 1 1 06.09.2022
30 Assignment 1 1 07.09.2022
UNIT III
08.09.2022
31 Classification 1 1
32 09.09.2022
Basic Concepts 1 1
1 1
problem
1 1
problem examples
35 Decision Tree 1 1 13.09.2022
36 14.09.2022
Decision Tree classification 1 1
37 15.09.2022
What are the uses of Decision Tree 1 1
38 16.09.2022
Induction 1 1
39 17.09.2022
Attribute Selection Measures 1 1
40 Attribute Selection Measures example problems 1 1 19.09.2022
41 Tree Pruning 1 1 20.09.2022
42 Scalability 1 1 21.09.2022
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
43 Decision Tree Induction 1 1 22.09.2022
44 1 1 23.09.2022
Visual Mining for Decision Tree Induction
45 Visual Mining for Decision Tree Induction 24.09.2022
1 1
examples
UNIT-IV
46 Introduction to Association Analysis 1 1 10.10.2022
47 11.10.2022
Problem Definition 1 1
48 12.10.2022
Frequent Item set Generation 1 1
49 13.10.2022
Frequent Item set Generation examples 1 1
50 14.10.2022
Rule Generation 1 1
51 15.10.2022
Confident Based Pruning 1 1
52 17.10.2022
Confident Based Pruning examples 1 1
53 Rule Generation in Apriori Algorithm 1 1 18.10.2022
54 Rule Generation in Apriori Algorithm 19.10.2022

1 1
implementation
55 Compact Representation of frequent item sets 1 1 20.10.2022
56 Compact Representation of frequent item sets 21.10.2022

1 1
examples
57 24.10.2022
FP-Growth Algorithm 1 1
58 25.10.2022
FP-Growth Algorithm implementation 1 1
59 26.10.2022
FP-Growth Algorithm applications 1 1
60 FP-Growth Algorithm advantages and 28.10.2022
1 1
disadvantages.
61 1 31.10.2022
Overview. 1
UNIT-V
62 Introduction to Cluster Analysis 1 1 02.11.2022
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
63 03.11.2022
What is Cluster Analysis 1 1
64 04.11.2022
Why we are using Cluster Analysis in data mining 1 1
65 05.11.2022
Advantages and disadvantages of Cluster Analysis 1 1
66 07.11.2022
Significance in Cluster Analysis 1 1
67 Overview Cluster Analysis 1 1 08.11.2022
68 Basics and Importance of Cluster Analysis 1 1 09.11.2022
69 Clustering techniques 1 1 10.11.2022
70 Different Types of Clusters 1 1 11.11.2022
71 K-means 1 1 14.11.2022
72 The Basic K-means Algorithm 1 1 15.11.2022
73 The Basic K-means Algorithm implementation 1 1 16.11.2022
74 K-means Additional Issues examples 1 1 17.11.2022
75 Bi-secting K Means 1 1 18.11.2022
76 Bi-secting K Means applications 1 1 19.11.2022
77 Characteristics of Bi-secting K Means 1 1 21.11.2022
78 Advantages and disadvantages of Bi-secting K 22.11.2022

1 1
Means
79 Revision 1 1 23.11.2022
80 Assignment 1 1 24.11.2022
Text Books:
Elsevier, 2011.
A. Y. :2022-23
Name of the
Course(Data
Ware housing and

Reference Books:
Cengage Learning.
LECTURE NOTES
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
UNIT-IV
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Question Bank
Unit-I
Q. No Question CO
Differentiate Operational database systems and data warehousing.
1 CO-1
Explain the star schema and fact constellation schemas.
What are the differences between the three main types of data
warehouse usage: information processing, analytical processing, and
2 CO-1
data mining? Discuss the motivation behind OLAP mining
(OLAM).
3 Explain what kinds of pattern scan are mined? Give examples. CO-1
State why, for the integration of multiple heterogeneous information
4 sources, many companies in industry prefer the update-driven CO-1
approach, rather than the query-driven approach.
Briefly compare the following concepts using examples Discovery-
5 CO-1
driven cube, multi feature cube, virtual warehouse.
6 Explain technologies used for data mining? CO-1
Briefly compare the following concepts with example Snowflake
7 CO-1
schema, fact constellation, and starnet query model.
8 Explain which kinds of applications are targeted for data mining? CO-1
Explain the difference and similarity between discrimination and
9 classification, between characterization and clustering, and between CO-1
classification and regression.
List and describe the five primitives for specifying a data mining
10 CO-1
task.
Unit-II
Q. No Question CO
Suppose a group of 12 sales price records has been sorted as
Follows: 5,10,11,13,15,35,50,55,72,92,204,215. Partition them into
1 CO-2
three bins by each of the following methods: (i) equal-frequency
(equal-depth) partitioning (ii) equal-width partitioning (iii) clustering.
2 Write short notes on the following: (i) Data Preprocessing (ii) Data CO-2
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Discretization (iii) Concept Hierarchy.

3 Explain in detail about data pre-processing. CO-2
What is data integration and discuss issues to consider during data
4 CO-2
integration.
Given the following data (in increasing order) for the attribute age:
13, 15, 16, 16, 19, 20, 20, 21, 22, 22, 25, 25, 25, 25, 30, 33, 33, 35,
35, 35, 35, 36, 40, 45, 46, 52, 70. (i) Use min-max normalization to
transform the value 35 for age onto the range [0.0, 1.0]. (ii) Use z-
5 CO-2
score normalization to transform the value 35 for age, where the
standard deviation of age is 12.94 years.
(iii) Use normalization by decimal scaling to transform the value 35
for age.
Suppose a group of 12 sales price records has been sorted as follows:
5,10,11,13,15,35,50,55,72,92,204,215.
6 Partition them into three bins by each of the following methods: CO-2
(i) equal-frequency (equal-depth) partitioning (ii) equal-width
partitioning (iii) clustering
Use these methods to normalize the following group of data: 200,
300, 400, 600, 1000 (i) min-max normalization by setting min = 0 and
7 CO-2
max = 1 (ii) z-score normalization (iii) z-score normalization using
the mean absolute deviation instead of standard deviation.
What is data consolidation? In detail discuss various techniques used
8 CO-2
to consolidate data.
Describe the problem of data quality with some examples. Explain the
9 CO-2
usage of feature subset selection in data preprocessing.
Give the following data (in increasing order) for the attribute age:
13, 15, 16, 16, 19, 20, 20, 21, 22, 22, 25, 25, 25, 25, 30, 33, 33, 35,
10 CO-2
35, 35, 35, 36, 40, 45, 46, 52, 70. How might you determine outliers
in the data? Relate it with data cleaning.
Unit-III
Q. No Question CO
Describe the classification task in induction and deduction phases.
1 CO-3
Explain with example classification tasks.
2 Use the C4.5 algorithm to build a decision tree for classifying the
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Following objects: CO-3

Class Size Color Shape
A Small Yellow Round
A Big Yellow Round
A Big Red Round
A Small Red Round
B Small Black Round
B Big Black Cube
B Big Yellow Cube
B Big Black Round
B Small Yellow Cube
Why information gain is considered as attribute selection measure? CO-3
3
Illustrate with an example.
Explain the decision tree induction algorithm with appropriate CO-3
4 examples. Discuss the disadvantages of this approach? What is over
fitting, and how can it be prevented for decision trees?
What is visual mining? Explain the application of decision tree CO-3
5
induction algorithm in it.
What are the new features of C4.5 algorithm comparing with original
6 Quinlan’s ID3 algorithm for decision-tree generation? CO-3
What is attribute selection measure? Briefly describe the attribute
7 CO-3
selection measures for decision tree induction.
Given a decision tree, you have the option of (i) converting the
decision tree to rules and then pruning the resulting rules, or (ii)
8 CO-3
pruning the decision tree and then converting the pruned tree to rules.
What advantage does (i) have over (ii)?
Why is tree pruning useful in decision tree induction? What is a
9 CO-3
Drawback of using a separate set of tuples to evaluate pruning?
Given data set, D, the number of attributes, n, and the number of
10 training tuples, |D|, show that the computational cost of growing a
tree is at most n × |D| × log (|D|).
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
UNIT-IV
Q. No Question CO
Why is the process of discovering association rules relatively

1 simple compared to generating large itemsets in transactional CO-4
databases?
Can we design a method that mines the complete set of frequent CO-4
item sets without candidate generation? If yes, explain it with the
following table:
TID List of items
001 milk, dal, sugar, bread
2
002 Dal, sugar, wheat,jam
003 Milk, bread, curd, paneer
004 Wheat, paneer, dal, sugar
005 Milk, paneer, bread
006 Wheat, dal, paneer, bread
Consider the transaction data-set: Trans ID Items CO-4
T1 {a,b}
T2 {b,c,d}
T3 {a,c,d,e}
T4 {a,d,e}
T5 {a,b,c}
3 T6 {a,b,c,d}
T7 {a}
T8 {a,b,c}
T9 {a,b,d}
T10 {b,c,e}
Construct the FP tree by showing the trees separately after reading
each transaction.
4 How association rules mined from large databases? Explain. CO-4
What is a frequent item set? How to find frequent item sets for a CO-4
5
transactional database? Explain any one approach with illustrations.
6 Find frequent item sets for the following table using FP-Growth CO-4
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
algorithm. Assume relevant thresholds. Tid List of item ids

T1I1, I3, I5
T2I2, I4, I1
T3I1, I2, I3, I4
T4I5, I3, I2
T5I1, I2, I5
T6 I3, I4, I5
Write the algorithm to discover frequent item sets without CO-4
7
candidate generation and explain it with an example.
Discuss Apriori Algorithm with a suitable example and explain CO-4
8
how its efficiency can be improved?
Assume 5 transactions and explain the two-step approach to CO-4
9 generate frequent item sets and to mine association rules using
Apriori algorithm.
UNIT-V
Q. No Question CO
Use an example to show why the k-means algorithm may not find the
1 CO-5
global optimum that is, optimizing the within-cluster variation.
Given the points x1 = {1, 0}, x2 = {0,1}, x3={2, 1}, and x4 = {3, 3}. CO-5
Suppose that these points are randomly clustered into two clusters: C1
2 = {x1, x3} and C2 = {x2, x4}. Apply one iteration of k Means
partitional-clustering algorithm and find new distribution of elements
in clusters. What is the change in a total square error?
3 What are the requirements for cluster analysis? Explain briefly. CO-5
Suppose that the data mining task is to cluster points into three
clusters, where the points are
A1(2,10),A2(2,5),A3(8,4),B1(5,8),B2(7,5),B3(6,4),C1(1,2),C2(4,9).Th
4 e distance function is Euclidean distance. Suppose initially we assign
A1, B1, and C1 as the center of each cluster, respectively. Use the k-
means algorithm to show only the three cluster centers after the first
round of execution.
5 Describe K means clustering with an example. CO-5
Consider five points {X1 , X2 , X3 , X4 , X5 } with the following
6 coordinates as a two dimensional sample for clustering : X1 = CO-5
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
(0.5,2.5 ); X2 = ( 0,0 ); X3 = ( 1.5,1 ); X4 = ( 5,1 ); X5 = (6,2 )

Illustrate the K-means partitioning algorithms using the above
data set.
7 What is cluster analysis? Describe the dissimilarity measures for CO-5
interval-scaled variables and binary variables.
What are the advantages and disadvantages of k-means CO-5
8
clustering against model-based clustering?
Suppose that the data-mining task is to cluster the following
eight points (representing location) into three clusters: CO-5
A1 (2;10) ; A2 (2;5) ; A3 (8;4) ; B1 (5;8) ; B2 (7;5) ; B3 (6;4) ; C1
9 (1;2) ; C2 (4;9). The distance function is Euclidean distance.
Suppose initially we assign A1, B1, and C1 as the center of each
cluster, respectively. Use the k-means algorithm to determine:
the three cluster centers after the first round of execution.
Describe how categorization of major clustering methods is being CO-5
10
done?
Given the samples X1 = {1, 0}, X2 = {0, 1}, X3 = {2, 1}, and X4 = CO-5
{3, 3}, suppose that the samples are randomly clustered into two
11 clusters C1 = {X1, X3} and C2 = {X2, X4}. Apply one iteration of the
K-means partitional-clustering algorithm, and find a new distribution
of samples in clusters.
Consider five points {X1 , X2 , X3 , X4 , X5 } with the following co CO-5
ordinates as a two dimensional sample for clustering : X1 = ( 0.5,2.5 );
12
X2 = ( 0,0 ); X3 = ( 1.5,1 ); X4 = ( 5,1 ); X5 = (6,2 ) Illustrate the K-
means partitioning algorithms using the above data set.
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Mid Question Papers with Schema of Evaluation and key
Year: III Semester: II Academic Year: 2022-2023

Conduct
Mid Schema of Entry of HoD’s
Questions of
Exam Evaluation Marks Review
Test Date
5
2.5
Mid-I 6-3-2023 2.5
2.5
2.5
2.5
2.5
2.5
Mid-II 8-5-2023
2.5
2.5
2.5
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Previous university Question papers

A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Topic beyond Syllabus
UNIT-I:
 Normalization Techniques: Functional Dependency, 1NF, 2NF, 3NF,

BCNF; Multi valued Dependency.
 Loss-less Join and Dependency Preservation.
UNIT-II:
 Transaction Processing
 SQL Injection Attacks.
 Access Control, MAC, RBAC, Authorization, SQL Injection Attacks.
UNIT-III:
 Data mining approaches (OLAP, DBMS, Statistics and ML).

 Filters and discretization with weka.
UNIT-IV:
 Knowledge representation.
 Representing input data and output knowledge, visualization techniques.
 Correlation analysis.
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
UNIT-V:
 1R algorithm.
 decision trees
 Bayesian network.
 Advanced topics: text mining, text classification, web mining, data mining
software.
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Internal Marks
S. NO. REGD. NO. NAME OF THE STUDENT MID-I Q1 A1 MID-II Q1I A1I
1 20GK1A0501 AMARTALURI RAKESH 0 0 5 0 0 5
2 20GK1A0502 A.VENKATA PRATAP REDDY 8 3 5 8 2 4
3 20GK1A0503 BATHULA SHOBHANBABU 12 0 5 0 0 5
4 20GK1A0504 BESTA SNEHALATHA 15 5 5 15 3 4
5 20GK1A0505 BHEEMALA MAHESHBABU 15 7 5 15 3 5
6 20GK1A0506 BURLA MANIKANTA 15 4 5 15 3 5
7 20GK1A0507 CHINTA VAMSI 0 0 5 0 0 5
8 20GK1A0508 DASARI SIRISHA 15 1 5 15 3 4
9 20GK1A0509 DASARI SRAVANTHI 15 4 5 15 1 5
10 20GK1A0510 ERAGANABOINA NAVEEN 9 2 5 14 3 4
11 20GK1A0511 JAKKIREDDY KOTIREDDY 0 0 5 0 0 5

KANKANAMPATI V V S
12 20GK1A0512 GANESH GOUTHAM 14 3 5 13 0 4
13 20GK1A0513 KOLLURI RAHUL KALYAN 12 0 5 9 4 5
14 20GK1A0514 MACHARLA PRASANTH 12 0 5 10 0 4
15 20GK1A0515 MADDIRALA MOSHE 8 2 5 14 3 4
16 20GK1A0516 MANGALAPALLI JOHN DANIEL 12 0 5 0 0 5
17 20GK1A0517 MANNEM JOSEPH 15 5 5 13 3 4
18 20GK1A0518 MELANGI MANISHA 12 7 5 15 4 5

A. Y. :2022-23
Name of the
Course(Data
Ware housing and
19 20GK1A0519 NANDAVARAPU BABI 13 4 5 14 2 4
20 20GK1A0520 NANDIPATI AJAY KUMAR 9 2 5 14 3 5
21 20GK1A0521 NIZAMPATNAM NAGA SATISH 10 2 5 14 1 4
22 20GK1A0522 PAINAM SAI DHEERAJ 10 2 5 13 0 5
23 20GK1A0523 PALLI SHINOO RAJ 12 0 5 2 0 4
24 20GK1A0524 PANDI PRASANTH KUMAR 15 4 5 15 2 5
25 20GK1A0525 PERNI ABHIGNA NAIDU 0 0 5 0 0 4

PETLURI MADHAVA VENKATA
26 20GK1A0526 SAINADH 15 3 5 12 3 5
27 20GK1A0527 POGARTI PARDHA SARADHI 13 4 5 14 2 5
28 20GK1A0528 PONNAM GOPI HANUMA 15 2 5 13 5 4
29 20GK1A0529 SHAIK ABDULLAH BASHA 8 4 5 10 2 5
30 20GK1A0530 SHAIK SAMAD 0 0 5 0 2 4
31 20GK1A0531 THALLURI SNEHA LATHA 15 4 5 15 0 5
32 20GK1A0532 TIMMISETTI BHARGAV 0 0 5 0 0 4
33 20GK1A0533 TIRUMALASETTY SAI KRISHNA 14 3 5 13 2 5
34 20GK1A0534 ULLANGULA TIRUMALA TEJA 0 0 5 0 0 4
35 20GK1A0535 VAKA NEHANTH 10 2 5 15 0 5
36 20GK1A0536 YAMARTHI VIJETHA 12 0 5 0 0 4
37 20GK1A0537 YAMMALA ASHAKUMAR 13 4 5 15 2 4

A. Y. :2022-23
Name of the
Course(Data
Ware housing and
38 20GK1A0538 BIKKI MANIDEEPAK 12 2 5 15 0 5
39 20GK1A0539 PAGADALA PADMA 14 4 5 14 3 4
40 20GK1A0540 GOLLA VEERENDRA 0 0 5 0 0 5
41 20GK1A0541 S.SIMHA YADAV KEERTHI 12 3 5 14 0 4
42 20GK1A0542 BODDU NAGESH 12 0 5 0 0 4
43 20GK1A0543 KOTA GOPAL REDDY 8 0 5 15 0 5
44 21GK5A0501 BATTULA VENKATA RAO 0 0 5 0 0 4
45 21GK5A0502 K.MAHENDRA VINITH KUMAR 13 4 5 14 3 5
46 21GK5A0503 KURUBA SAITEJA 0 0 5 0 0 4
47 21GK5A0504 MANI CHANDHAR REDDY.M 10 0 5 0 0 4
48 21GK5A0505 MINCHALA RAMA KRISHNA 0 0 5 15 0 5
49 21GK5A0506 PUSULURI ELISHA BABU 12 0 5 15 0 4
50 21GK5A0507 VEMULA RAJYA LAKSHMI 0 0 5 0 0 5
51 21GK5A0508 M.MANOJ KUMAR 0 0 5 0 0 5
List of e-resources
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Web References
1 https://www.tutorialspoint.com/dwh/dwh_olap.htm
2
3
https://www.slideshare.net/slideshow/data-warehousing-and-online-analytical-
4
processing/248736812
https://learn.microsoft.com/en-us/azure/architecture/data-guide/relational-data/
5
online-analytical-processing
Pass percentage
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
BRANCH: CSE TOTAL NO. OF STUDENTS: 36

No. of Students Passed: 25 Class Pass Percentage: 52%
Subject Name of the No. of No. of No. of Total % of

Faculty students students students No. of pass
Passed Failed Absent students
appeare
d
DATAWAREHOUSING
Mr. K. Kiran
& DATAMINING 25 10 1 35 71
Kumar
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Faculty Details
Name of the Faculty : Mr. K. Kiran Kumar
Designation : Associate Professor
Department : Computer science
Course Details:
Name of the Programme : B.Tech
Batch : 2020-2024
Branch : CSE
Semester : III/I
Title of the Course : DATAWAREHOUSING & DATAMINING
Course Code : R2031052
Course Type : Core: √ Open Elective: Elective: Add-on: Lab:
Number of Students : 51
Sample assignment sheet

A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Attainment Sheet
A. Y. :2022-23
Name of the
Course(Data
Ware housing and
Attainment:
1.1.Pass Percentage : 71%
1.2.Pass with I Class Percentage : 69%
1.3.Overall COs Attainment :
1.4.CO Code :
COs CO-1 CO-2 CO-3 CO-4 CO-5

Attainment 3 2 3 2 3

DWDM

Uploaded by

Copyright:

Available Formats

You might also like

DWDM

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DWDM

Uploaded by

Copyright:

Available Formats

A. Y.

Name of the Faculty: Mr. K. Kiran Kumar

Vision: To contribute for sustainable development of nation through achieving

 To impart affordable and quality education in order to meet the needs of

Vision & Mission of Department

To be a recognized leader by imparting quality technical education and

M1: To produce best quality computer science and IT professionals and

Course Objectives & out comes

Data Warehousing and Online Analytical Processing: Data Warehouse: Basic

2. Introduction to Data Mining: Pang-Ning Tan & Michael Steinbach, Vipin

S. NO. REGD. NO. NAME OF THE STUDENT

2 20GK1A0502 A.VENKATA PRATAP REDDY

3 20GK1A0503 BATHULA SHOBHANBABU

4 20GK1A0504 BESTA SNEHALATHA

5 20GK1A0505 BHEEMALA MAHESHBABU

6 20GK1A0506 BURLA MANIKANTA

7 20GK1A0507 CHINTA VAMSI

8 20GK1A0508 DASARI SIRISHA

9 20GK1A0509 DASARI SRAVANTHI

10 20GK1A0510 ERAGANABOINA NAVEEN

11 20GK1A0511 JAKKIREDDY KOTIREDDY

13 20GK1A0513 KOLLURI RAHUL KALYAN

14 20GK1A0514 MACHARLA PRASANTH

15 20GK1A0515 MADDIRALA MOSHE

16 20GK1A0516 MANGALAPALLI JOHN DANIEL

17 20GK1A0517 MANNEM JOSEPH

18 20GK1A0518 MELANGI MANISHA

19 20GK1A0519 NANDAVARAPU BABI

20 20GK1A0520 NANDIPATI AJAY KUMAR

21 20GK1A0521 NIZAMPATNAM NAGA SATISH

22 20GK1A0522 PAINAM SAI DHEERAJ

23 20GK1A0523 PALLI SHINOO RAJ

24 20GK1A0524 PANDI PRASANTH KUMAR

25 20GK1A0525 PERNI ABHIGNA NAIDU

PETLURI MADHAVA VENKATA

27 20GK1A0527 POGARTI PARDHA SARADHI

28 20GK1A0528 PONNAM GOPI HANUMA

29 20GK1A0529 SHAIK ABDULLAH BASHA

30 20GK1A0530 SHAIK SAMAD

31 20GK1A0531 THALLURI SNEHA LATHA

32 20GK1A0532 TIMMISETTI BHARGAV

33 20GK1A0533 TIRUMALASETTY SAI KRISHNA

34 20GK1A0534 ULLANGULA TIRUMALA TEJA

35 20GK1A0535 VAKA NEHANTH

36 20GK1A0536 YAMARTHI VIJETHA

37 20GK1A0537 YAMMALA ASHAKUMAR

38 20GK1A0538 BIKKI MANIDEEPAK

39 20GK1A0539 PAGADALA PADMA

40 20GK1A0540 GOLLA VEERENDRA

41 20GK1A0541 S.SIMHA YADAV KEERTHI

42 20GK1A0542 BODDU NAGESH

43 20GK1A0543 KOTA GOPAL REDDY

44 21GK5A0501 BATTULA VENKATA RAO

45 21GK5A0502 K.MAHENDRA VINITH KUMAR

46 21GK5A0503 KURUBA SAITEJA

47 21GK5A0504 MANI CHANDHAR REDDY.M

48 21GK5A0505 MINCHALA RAMA KRISHNA

49 21GK5A0506 PUSULURI ELISHA BABU

50 21GK5A0507 VEMULA RAJYA LAKSHMI