Data Mining And Data Ware House(Computer ) Questions and Answers

Question 1. DNA (Deoxyribonucleic acid)
  1.    It is hidden within a database and can only be recovered if one is given certain clues (an example IS encrypted information).
  2.    The process of executing implicit previously unknown and potentially useful information from dat(A)
  3.    An extremely complex molecule that occurs in human chromosomes and that carries genetic information in the form of genes.
  4.    None of these
Explanation:-
Answer: Option C. -> An extremely complex molecule that occurs in human chromosomes and that carries genetic information in the form of genes.
Answer: (c)

Question 2. Data warehouse is
  1.    The actual discovery phase of a knowledge discovery process
  2.    The stage of selecting the right data for a KDD process
  3.    A subject-oriented integrated timevariant non-volatile collection of data in support of management
  4.    None of these
Explanation:-
Answer: Option C. -> A subject-oriented integrated timevariant non-volatile collection of data in support of management
Answer: (c)

Question 3. Projection pursuit is
  1.    The result of the application of a theory or a rule in a specific case
  2.    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.
  3.    Discipline in statistics that studies ways to find the most interesting projections of multi-dimensional spaces
  4.    None of these
Explanation:-
Answer: Option C. -> Discipline in statistics that studies ways to find the most interesting projections of multi-dimensional spaces
Answer: (c)

Question 4. Incremental learning referred to
  1.    Machine-learning involving different techniques
  2.    The learning algorithmic analyzes the examples on a systematic basis and makes incremental adjustments to the theory that is learned
  3.    Learning by generalizing from examples
  4.    None of these
Explanation:-
Answer: Option B. -> The learning algorithmic analyzes the examples on a systematic basis and makes incremental adjustments to the theory that is learned
Answer: (b)

Question 5. Case-based learning is
  1.    A class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory.
  2.    Any mechanism employed by a learning system to constrain the search space of a hypothesis.
  3.    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.
  4.    None of these
Explanation:-
Answer: Option 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.
Answer: (c)

Question 6. Statistics
  1.    The science of collecting, organizing, and applying numerical facts
  2.    Measure of the probability that a certain hypothesis is incorrect given certain observations.
  3.    One of the defining aspects of a data warehouse, which is specially built around all the existing applications of the operational dat(A)
  4.    None of these
Explanation:-
Answer: Option A. -> The science of collecting, organizing, and applying numerical facts
Answer: (a)

Question 7. Enrichment is
  1.    A stage of the KDD process in which new data is added to the existing selection
  2.    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.
  3.    The distance between two points as calculated using the Pythagoras theorem.
  4.    None of these
Explanation:-
Answer: Option A. -> A stage of the KDD process in which new data is added to the existing selection
Answer: (a)

Question 8. Learning algorithm referrers to
  1.    An algorithm that can learn
  2.    A sub-discipline of computer science that deals with the design and implementation of learning algorithms.
  3.    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.
  4.    None of these
Explanation:-
Answer: Option A. -> An algorithm that can learn
Answer: (a)

Question 9. Machine learning is
  1.    An algorithm that can learn
  2.    A sub-discipline of computer science that deals with the design and implementation of learning algorithms.
  3.    An approach that abstracts from the actual strategy of an individual algorithm and can therefore be applied to any other form of machine learning.
  4.    None of these
Explanation:-
Answer: Option B. -> A sub-discipline of computer science that deals with the design and implementation of learning algorithms.
Answer: (b)

Question 10. Query tools are
  1.    A reference to the speed of an algorithm, which is quadratically dependent on the size of the dat(A)
  2.    Attributes of a database table that can take only numerical values.
  3.    Tools designed to query a database.
  4.    None of these
Explanation:-
Answer: Option C. -> Tools designed to query a database.
Answer: (c)