0% found this document useful (0 votes)
21 views4 pages

DM MCQS Unit-1

The document contains multiple choice questions related to data mining, aimed at students of the Computer Science and Engineering department at Keshav Memorial Institute of Technology for the academic year 2020-21. Topics covered include data extraction, data pre-processing techniques, feature selection, and data mining architectures. The questions assess knowledge on various concepts and methodologies in data mining.

Uploaded by

sandeep bhukya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
21 views4 pages

DM MCQS Unit-1

The document contains multiple choice questions related to data mining, aimed at students of the Computer Science and Engineering department at Keshav Memorial Institute of Technology for the academic year 2020-21. Topics covered include data extraction, data pre-processing techniques, feature selection, and data mining architectures. The questions assess knowledge on various concepts and methodologies in data mining.

Uploaded by

sandeep bhukya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

KESHAV MEMORIAL INSTITUTE OF TECHNOLOGY

(Approved by AICTE & Govt of T.S and Affiliated to JNTUH)


3-5-1026, Narayanaguda, Hyderabad-29. Ph: 040-23261407
Department of Computer Science and Engineering

SUBJECT: DM BRANCH: CSE


CLASS: IV-I YEAR: 2020-21
UNIT-I : Introduction to data mining
MULTIPLE CHOICE QUESTIONS

1. Data mining refers to ___________ of knowledge from large amounts of data


a. Extraction
b. Collection
c. Refreshing
d. None

2. Many people treat data mining as a synonym for another popularly used term
a. Knowledge inventory in databases
b. Knowledge acceptance in databases
c. Knowledge discovery in databases
d. Knowledge disposal in databases

3. Which one of the following is a goal of data mining ?


a. To confirm that data exists
b. To explain some observed event or condition
c. To analyze data for expected relationships
d. To create a new data warehouse

4. Which of the following is a noise removal technique ?


a. clustering
b. smoothing
c. outlier detection
d. All

5. Data pre-processing is done through ?


a. Data cleaning.
b. Data reduction.
c. Transformation
d. All

6. Data reduction is classified into____ ways?


a. two
b. three
c. four
d. zero

7. The main aim of doing feature selection is to reduce _____


a. search space
b. storage space.
c. Both
d. None

1
KESHAV MEMORIAL INSTITUTE OF TECHNOLOGY
(Approved by AICTE & Govt of T.S and Affiliated to JNTUH)
3-5-1026, Narayanaguda, Hyderabad-29. Ph: 040-23261407
Department of Computer Science and Engineering

8. Dimension Reduction can be achieved through ____


a. feature selection.
b. feature transformation
c. Both
d. None

9. Feature transformation takes place through_______


a. Data pre-processing.
b. Data cleaning.
c. Principle Component Analysis.
d. None

10. ____ is applied to each individual features.


a. Binning
b. Clustering
c. Regression
d. All

11. Randomly selecting "m" instances from the "n" initial instances is called
a. Random sampling
b. Stratified sampling.
c. Clustering.
d. All.

12. Consolidating data into forms suitable for data mining is called ____
a. Data transformation
b. data pre-processing.
c. Data cleaning.
d. All.
13. ________ is moving up in the concept hierarchy on numeric attributes
a. Sampling.
b. Normalization.
c. Aggregation.
d. All
14. _______is moving up in the concept hierarchy on nominal attributes.
a. Generalization.
b. Aggregation
c. Sampling
d. all

15. In which of the following architecture Data Mining system will not utilize any functionality of a
Data Base?
a. No coupling
b. Loose Coupling
c. Semi-tight Coupling
d. Tight Coupling

16. A database may contain data objects that do not comply with the general behavior or model of
the data is called.
2
KESHAV MEMORIAL INSTITUTE OF TECHNOLOGY
(Approved by AICTE & Govt of T.S and Affiliated to JNTUH)
3-5-1026, Narayanaguda, Hyderabad-29. Ph: 040-23261407
Department of Computer Science and Engineering

a. Cleaning
b. Clustering
c. Prediction
d. Outlier
17. Data mining query is defined in-terms of ___________
a. Data mining task primitives
b. Data mining task rules
c. Data mining irrelevant data
d. Data mining relevant data
18. ______________ Means that a data mining system will use some facilities of a data base or a data
ware house system
a. Tight coupling
b. No coupling
c . Semi Tight coupling
d. Loose Coupling
19. ____________ Means that besides Linking a data mining system to database or a data ware house
system
a. Tight coupling
b. No coupling
c. Semi Tight coupling
d. Loose Coupling
20. Which of the following is not major issue in data mining
a. Mining methodology and user interaction issues
b. Performance issues
c. Issues relating to the diversity of database types
d. Issues relating to the measurement

21. ___queries in operational databases would substantially degrade the performance of operational
tasks
a. On-line transaction processing
b. On-line electronic processing
c. On-line data processing
d. On line analytical processing

22. ____________hierarchies for categorical attributes or dimensions typically involve a group of


attributes
a. Discretization
b. Semantic
c. Index
d. Concept

23. Which one of the following is a data reduction strategy in which irrelevant, weakly relevant or
redundant attributes may be detected and removed
a. Data cube aggregation
b. Dimension reduction
c. Data compression
d. Numerosity reduction
3
KESHAV MEMORIAL INSTITUTE OF TECHNOLOGY
(Approved by AICTE & Govt of T.S and Affiliated to JNTUH)
3-5-1026, Narayanaguda, Hyderabad-29. Ph: 040-23261407
Department of Computer Science and Engineering

24. _____method smooth a stored data value by consulting its neighbourhood i.e. the values
around it
a. Normalization
b. Binning
c. Clustering
d. Integration

25. Which of the following method uses class information


a. Histogram analysis
b. Binning
c. Cluster analysis
d. Entropy-based Discretization

26. Binning is a ____________splitting technique based on specified number of bins


a. Top-down
b. Bottom-up
c. Inverse
d. None

27. Histogram analysis is __________technique


a. Supervised Discretization
b. unSupervised Discretization
c. entropy Supervised Discretization
d. none

28. Interactive drill up/down,provide different perspective to data


a. pivoting
b. slicing
c. dicing
d. all

29. There are______types of concept Hierarchies


a. One.
b. Two.
c. Three.
d. Four.

30. Which of the following doesn't represent a Hierarchy?


a. Schema
b. Operational
c. Rank
d. None.
4

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy