320+ Data Mining Solved MCQs

These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Bachelor of Science in Computer Science TY (BSc CS) , Master of Science in Computer Science (MSc CS) , Bachelor of Science in Computer Science (BSc CS) .

Take a Test

1.	Adaptive system management is
A.	it uses machine-learning techniques. here program can learn from past experience and adapt themselves to new situations.
B.	computational procedure that takes some value as input and produces some value as output.
C.	science of making machines performs tasks that would require intelligence when performed by humans.
D.	none of these
Answer» A. it uses machine-learning techniques. here program can learn from past experience and adapt themselves to new situations.

2.	Bayesian classifiers is
A.	a class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory.
B.	any mechanism employed by a learning system to constrain the search space of a hypothesis.
C.	an approach to the design of learning algorithms that is inspired by the fact that when people encounter new situations, they often explain them by reference to familiar experiences, adapting the explanations to fit the new situation.
D.	none of these
Answer» A. a class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory.

3.	Algorithm is
A.	it uses machine-learning techniques. here program can learn from past experience and adapt themselves to new situations.
B.	computational procedure that takes some value as input and produces some value as output.
C.	science of making machines performs tasks that would require intelligence when performed by humans.
D.	none of these
Answer» B. computational procedure that takes some value as input and produces some value as output.

4.	Bias is
A.	a class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory.
B.	any mechanism employed by a learning system to constrain the search space of a hypothesis.
C.	an approach to the design of learning algorithms that is inspired by the fact that when people encounter new situations, they often explain them by reference to familiar experiences, adapting the explanations to fit the new situation.
D.	none of these
Answer» B. any mechanism employed by a learning system to constrain the search space of a hypothesis.

5.	Background knowledge referred to
A.	additional acquaintance used by a learning algorithm to facilitate the learning process.
B.	a neural network that makes use of a hidden layer.
C.	it is a form of automatic learning.
D.	none of these
Answer» A. additional acquaintance used by a learning algorithm to facilitate the learning process.

6.	Case-based learning is
A.	a class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory.
B.	any mechanism employed by a learning system to constrain the search space of a hypothesis.
C.	an approach to the design of learning algorithms that is inspired by the fact that when people encounter new situations, they often explain them by reference to familiar experiences, adapting the explanations to fit the new situation.
D.	none of these
Answer» C. an approach to the design of learning algorithms that is inspired by the fact that when people encounter new situations, they often explain them by reference to familiar experiences, adapting the explanations to fit the new situation.

7.	Classification is
A.	a subdivision of a set of examples into a number of classes.
B.	a measure of the accuracy, of the classification of a concept that is given by a certain theory.
C.	the task of assigning a classification to a set of examples
D.	none of these
Answer» A. a subdivision of a set of examples into a number of classes.

8.	Binary attribute are
A.	this takes only two values. in general, these values will be 0 and 1 and .they can be coded as one bit
B.	the natural environment of a certain species.
C.	systems that can be used without knowledge of internal operations.
D.	none of these
Answer» A. this takes only two values. in general, these values will be 0 and 1 and .they can be coded as one bit

9.	Classification accuracy is
A.	a subdivision of a set of examples into a number of classes
B.	measure of the accuracy, of the classification of a concept that is given by a certain theory.
C.	the task of assigning a classification to a set of examples
D.	none of these
Answer» B. measure of the accuracy, of the classification of a concept that is given by a certain theory.

10.	Biotope are
A.	this takes only two values. in general, these values will be 0 and 1 and they can be coded as one bit.
B.	the natural environment of a certain species
C.	systems that can be used without knowledge of internal operations
D.	none of these
Answer» B. the natural environment of a certain species

11.	Cluster is
A.	group of similar objects that differ significantly from other objects
B.	operations on a database to transform or simplify data in order to prepare it for a machine-learning algorithm
C.	symbolic representation of facts or ideas from which information can potentially be extracted
D.	none of these
Answer» A. group of similar objects that differ significantly from other objects

13.	A definition of a concept is-----if it recognizes all the instances of that concept
A.	complete
B.	consistent
C.	constant
D.	none of these
Answer» A. complete

14.	A definition or a concept is------------- if it classifies any examples as coming within the concept
A.	complete
B.	consistent
C.	constant
D.	none of these
Answer» B. consistent

15.	Data selection is
A.	the actual discovery phase of a knowledge discovery process
B.	the stage of selecting the right data for a kdd process
C.	a subject-oriented integrated time variant non-volatile collection of data in support of management
D.	none of these
Answer» B. the stage of selecting the right data for a kdd process

16.	DNA (Deoxyribonucleic acid)
A.	it is hidden within a database and can only be recovered if one ,is given certain clues (an example is encrypted information).
B.	the process of executing implicit previously unknown and potentially useful information from data
C.	an extremely complex molecule that occurs in human chromosomes and that carries genetic information in the form of genes.
D.	none of these
Answer» C. an extremely complex molecule that occurs in human chromosomes and that carries genetic information in the form of genes.

12.	Black boxes are
A.	this takes only two values. in general, these values will be 0 and 1 and they can be coded as one bit.
B.	the natural environment of a certain species
C.	systems that can be used without knowledge of internal operations
D.	none of these
Answer» C. systems that can be used without knowledge of internal operations

17.	Hybrid is
A.	combining different types of method or information
B.	approach to the design of learning algorithms that is structured along the lines of the theory of evolution.
C.	decision support systems that contain an information base filled with the knowledge of an expert formulated in terms of if-then rules.
D.	none of these
Answer» A. combining different types of method or information

18.	Discovery is
A.	it is hidden within a database and can only be recovered if one is given certain clues (an example is encrypted information).
B.	the process of executing implicit previously unknown and potentially useful information from data.
C.	an extremely complex molecule that occurs in human chromosomes and that carries genetic information in the form of genes.
D.	none of these
Answer» B. the process of executing implicit previously unknown and potentially useful information from data.

19.	Euclidean distance measure is
A.	a stage of the kdd process in which new data is added to the existing selection.
B.	the process of finding a solution for a problem simply by enumerating all possible solutions according to some pre-defined order and then testing them
C.	the distance between two points as calculated using the pythagoras theorem.
D.	none of these
Answer» C. the distance between two points as calculated using the pythagoras theorem.

20.	Hidden knowledge referred to
A.	a set of databases from different vendors, possibly using different database paradigms
B.	an approach to a problem that is not guaranteed to work but performs well in most cases
C.	information that is hidden in a database and that cannot be recovered by a simple sql query.
D.	none of these
Answer» C. information that is hidden in a database and that cannot be recovered by a simple sql query.

21.	Enrichment is
A.	a stage of the kdd process in which new data is added to the existing selection
B.	the process of finding a solution for a problem simply by enumerating all possible solutions according to some pre-defined order and then testing them
C.	the distance between two points as calculated using the pythagoras theorem.
D.	none of these
Answer» A. a stage of the kdd process in which new data is added to the existing selection

22.	Heterogeneous databases referred to
A.	a set of databases from different b vendors, possibly using different database paradigms
B.	an approach to a problem that is not guaranteed to work but performs well in most cases.
C.	information that is hidden in a database and that cannot be recovered by a simple sql query.
D.	none of these
Answer» A. a set of databases from different b vendors, possibly using different database paradigms

23.	Enumeration is referred to
A.	a stage of the kdd process in which new data is added to the existing selection.
B.	the process of finding a solution for a problem simply by enumerating all possible solutions according to some pre-defined order and then testing them
C.	the distance between two points as calculated using the pythagoras theorem.
D.	none of these
Answer» B. the process of finding a solution for a problem simply by enumerating all possible solutions according to some pre-defined order and then testing them

24.	Heuristic is
A.	a set of databases from different vendors, possibly using different database paradigms
B.	an approach to a problem that is not guaranteed to work but performs well in most cases
C.	information that is hidden in a database and that cannot be recovered by a simple sql query.
D.	none of these
Answer» B. an approach to a problem that is not guaranteed to work but performs well in most cases

25.	Hybrid learning is
A.	machine-learning involving different techniques
B.	the learning algorithmic analyzes the examples on a systematic basis 2nd makes incremental adjustments to the theory that is learned
C.	learning by generalizing from examples
D.	none of these
Answer» A. machine-learning involving different techniques

320+ Data Mining Solved MCQs

Adaptive system management is

Bayesian classifiers is

Algorithm is

Bias is

Background knowledge referred to

Case-based learning is

Classification is

Binary attribute are

Classification accuracy is

Biotope are

Cluster is

Black boxes are

A definition of a concept is-----if it recognizes all the instances of that concept

A definition or a concept is------------- if it classifies any examples as coming within the concept

Data selection is

DNA (Deoxyribonucleic acid)

Hybrid is

Discovery is

Euclidean distance measure is

Hidden knowledge referred to

Enrichment is

Heterogeneous databases referred to

Enumeration is referred to

Heuristic is

Hybrid learning is

Kohonen self-organizing map referred to

Incremental learning referred to

Knowledge engineering is

Information content is

Inductive learning is

Inclusion dependencies

KDD (Knowledge Discovery in Databases) is referred to

Learning is

Naive prediction is

Learning algorithm referrers to

Knowledge is referred to

Node is

Machine learning is

Projection pursuit is

Inductive logic programming is

Statistical significance is

Multi-dimensional knowledge is

Prediction is

Query tools are

Operational database is

...................... is an essential process where intelligent methods are applied to extract data patterns.

Which of the following is not a data mining functionality?

............................. is a summarization of the general characteristics or features of a target class of data.

............................. is a comparison of the general features of the target class data objects against the general features of objects from one or multiple contrasting classes.

Strategic value of data mining is ......................

26.	Kohonen self-organizing map referred to
A.	the process of finding the right formal representation of a certain body of knowledge in order to represent it in a knowledge-based system
B.	it automatically maps an external signal space into a system\s internal representational space. they are useful in the performance of classification tasks
C.	a process where an individual learns how to carry out a certain task when making a transition from a situation in which the task cannot be carried out to a situation in which the same\ task under the same circumstances can be carried out.
D.	none of these
Answer» B. it automatically maps an external signal space into a system\s internal representational space. they are useful in the performance of classification tasks

29.	Information content is
A.	the amount of information with in data as opposed to the amount of redundancy or noise.
B.	one of the defining aspects of a data warehouse
C.	restriction that requires data in one column of a database table to the a subset of another-column.
D.	none of these
Answer» A. the amount of information with in data as opposed to the amount of redundancy or noise.

32.	KDD (Knowledge Discovery in Databases) is referred to
A.	non-trivial extraction of implicit previously unknown and potentially useful information from data
B.	set of columns in a database table that can be used to identify each record within this table uniquely.
C.	collection of interesting and useful patterns in a database
D.	none of these
Answer» A. non-trivial extraction of implicit previously unknown and potentially useful information from data

34.	Naive prediction is
A.	a class of learning algorithms that try to derive a prolog program from examples.
B.	a table with n independent attributes can be seen as an n- dimensional space.
C.	a prediction made using an extremely simple method, such as always predicting the same output.
D.	none of these
Answer» C. a prediction made using an extremely simple method, such as always predicting the same output.

35.	Learning algorithm referrers to
A.	an algorithm that can learn
B.	a sub-discipline of computer science that deals with the design and implementation of learning algorithms.
C.	a machine-learning approach that abstracts from the actual strategy of an individual algorithm and can therefore be applied to any other form of machine learning.
D.	none of these
Answer» A. an algorithm that can learn

37.	Node is
A.	a component of a network
B.	in the context of kdd and data mining, this refers to random errors in a database table.
C.	one of the defining aspects of a data warehouse
D.	none of these
Answer» A. a component of a network

39.	Projection pursuit is
A.	the result of the application of a theory or a rule in a specific case
B.	one of several possible enters within a database table that is chosen by the designer as the primary means of accessing the data in the table.
C.	discipline in statistics that studies ways to find the most interesting projections of multi-dimensional spaces
D.	none of these
Answer» C. discipline in statistics that studies ways to find the most interesting projections of multi-dimensional spaces

41.	Statistical significance is
A.	the science of collecting, organizing, and applying numerical facts
B.	measure of the probability that a certain hypothesis is incorrect given certain observations.
C.	one of the defining aspects of a data warehouse, which is specially built around all the existing applications of the operational data
D.	none of these
Answer» B. measure of the probability that a certain hypothesis is incorrect given certain observations.

44.	Query tools are
A.	a reference to the speed of an algorithm, which is quadratically dependent on the size of the data
B.	attributes of a database table that can take only numerical values.
C.	tools designed to query a database.
D.	none of these
Answer» C. tools designed to query a database.

45.	Operational database is
A.	a measure of the desired maximal complexity of data mining algorithms
B.	a database containing volatile data used for the daily operation of an organization
C.	relational database management system
D.	none of these
Answer» B. a database containing volatile data used for the daily operation of an organization