MALLA REDDY COLLEGE OF ENGINEERING
B. TECH IV YEAR I SEMESTER II-MIDEXAMINATIONS,DEC–2023
Subject: DATA MINING Time: 20 Min
Course Code:CS702PC OBJECTIVE EXAM Max.Marks:10marks
Branch: CSE SET-2 Date:11-12-2023
NAME: HALL TICKET NO: Q A
Answer All Questions. All Questions Carry Equal Marks.
S. Bloom’s CO
NO Level
1. the individual tuples making up the training set are referred to as____and are selected [ ] L1 CO
from the database under analysis 3
A)learning tuples B)traning tuples C)samples D)database
2. Data Independence is referred to as [ ] L1 CO
4
A) Programs B)Programs C)Both (a) and (b) D)Neither (a)
independent are dependent nor (b)
of the logical on the
attributes physical
attributes of
data
3. Data mining is ___ driven approach not ___ driven approach. [ ] L3 CO
4
A)Event, Data B)Data, User C)User, Event D) User, Data
4. The naïve Bayesian classifier is based on __theorem with the
independence assumptions between predictors
A) Binary B)baye’s d.
C)Relational database.
attribute Multidimensional
attribute
5. Which of the following is NOT a common binning strategy? [ ] L1 CO
5
A)equiwidth B)equidepth bining C)homogenetity based D)equilength
bining bining bining
6. _______ranking methods use the query to rank all documents in the order of relevance [ ] L2 CO
5
A)text B)word C)information D)document
7. The DOM structure of a web page is a tree structure,where every __tag in the page [ ] L3 CO
corresponds to a node in the DOM tree 5
A)XML B)web C)HTML D)None of the
above
8. The graph model in______link analysis is induced from two kinds of relationships,tha [ ] CO
is,block to page (link structure)and page to block 5
A) page level B) text level C)block level D)document L3
level
9. In DIANA all the of the objects are used to form _____initial [ ] L1 CO
cluster. 5
A) one B)two C)four D)eight
10 [ ] L2 CO
Decision tree induction is the learning of decision trees from __training tuples 4
A) class labled B) data C)data handling D)data
integration transformation
Fill in the Blanks: Marks:5
S.N Bloom’ CO
O s Level
1 IDF stands for__________ L2 CO1
2 DIANA stands for_________________ L1 CO1
3 AGNES stands for________________ L3 CO2
_____________classifiers use distance based comparisons that intrinsically assign L2 C01
4 equal weight to each attribute
L3 CO1
5 DBSCAN stands for_____________
L1 CO3
6 K means algorithm has _____paramenter
L2 CO1
In __________methods the query is regraded as specifying constarints for selecting
7 relevant docments
A signature file is a file that stores a ______record for each document in the L1 CO1
8 database
L2 CO1
A ___________process can be used to remove terms in the training documents that
9 are statistically uncorrelated with the class labels
A ________________variable is a generalization of the binary variable in that it can L3 CO2
10 take on more than two states
S.N CO’ CO’S-
O S DESCRIPTION
1 CO1 Ability to understand the types of the data to be mined and present a general
classification of tasks and primitives to integrate a data mining system.
2 CO2 Apply preprocessing methods for any given raw data.
3 CO3 Extract interesting patterns from large amounts of data
4 CO4 Discover the role played by data mining in various fields.
5 CO5 Choose and employ suitable data mining algorithms to build analytical
applications
6 CO6 Evaluate the accuracy of supervised and unsupervised models and algorithms
S.No BLOOM’SLEVEL DESCRIPTION
1 L1 Remembering
2 L2 Understanding
3 L3 Applying
4 L4 Analyzing
5 L5 Evaluating
6 L6 Creating
I MID DM KEY FOR SET –II
MULTIPLE CHOICE
1. B)Traning tuples
2. C) Both A&B
3. B)Data,uses
4. B)Baye’s
5. C)Homogenity based bininng
6. D)Document
7. C) HTML
8. D)Document level
9. A) One
10. A)Classlabled
FILLING IN THE BLANKS
1. Inverse document frequency
2. Dlvisine analysis
3. Agglomerative nesting
Nearset neighbour
4. Density based algorithm
5. Only one
6. Document selection
7. signature
8. feature selection
9. categorical
