Data Mining, Data Warehouse MCQ, Chapter-05

Posted by

The "Answers" given with the Question is "not verified". To view Verified answers click on the button below.

Data Mining, Data Warehouse MCQ, with Free Download.

81. Parallelism is
(A) General class of approaches to a problem.
(B) Performing several computations simultaneously
(C) Structures in a database those are statistically relevant.
(D) Simple forerunner of modern neural networks, without hidden layers.

82. Perceptron is
(A) General class of approaches to a problem.
(B) Performing several computations simultaneously.
(C) Structures in a database those are statistically relevant.
(D) Simple forerunner of modern neural networks, without hidden layers.

83. Shallow knowledge
(A) The large set of candidate solutions possible for a problem
(B) The information stored in a database that can be, retrieved with a single query.
(C) Worth of the output of a machinelearning program that makes it understandable for humans
(D) None of these

84. Statistics
(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 dat(A)
(D) None of these

85. Subject orientation
(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 dat(A)
(D) None of these

86. Search space
(A) The large set of candidate solutions possible for a problem
(B) The information stored in a database that can be, retrieved with a single query.
(C) Worth of the output of a machinelearning program that makes it understandable for humans
(D) None of these

87. Transparency
(A) The large set of candidate solutions possible for a problem
(B) The information stored in a database that can be, retrieved with a single query.
(C) Worth of the output of a machinelearning program that makes it understandable for humans
(D) None of these

88. Quantitative attributes are
(A) A reference to the speed of an algorithm, which is quadratically dependent on the size of the dat(A)
(B) Attributes of a database table that can take only numerical values.
(C) Tools designed to query a database.
(D) None of these

89. Unsupervised algorithms
(A) It do not need the control of the human operator during their execution.
(B) An arrow in a multi-dimensional space. It is a quantity usually characterized by an ordered set of scalars.
(C) The validation of a theory on the basis of a finite number of examples.
(D) None of these

90. Vector
(A) It do not need the control of the human operator during their execution.
(B) An arrow in a multi-dimensional space. It is a quantity usually characterized by an ordered set of scalars.
(C) The validation of a theory on the basis of a finite number of examples.
(D) None of these

91. Verification
(A) It does not need the control of the human operator during their execution.
(B) An arrow in a multi-dimensional space. It is a quantity usually characterized by an ordered set of scalars.
(C) The validation of a theory on the basis of a finite number of examples
(D) None of these

92. Visualization techniques are
(A) A class of graphic techniques used to visualize the contents of a database
(B) The division of a certain space into various areas based on guide points.
(C) A branch that connects one node to another
(D) None of these

93. Voronoi diagram
(A) A class of graphic techniques used to visualize the contents of a database
(B) The division of a certain space into various areas based on guide points.
(C) A branch that connects one node to another
(D) None of these

94. Synapse is
(A) A class of graphic techniques used to visualize the contents of a database
(B) The division of a certain space into various areas based on guide points.
(C) A branch that connects one node to another
(D) None of these


81. (B) 82. (D) 83. (B) 84. (A) 85. (C)
86. (A) 87. (C) 88. (B) 89. (A) 90. (B)
91. (C) 92. (A) 93. (B) 94. (C)