Data Mining MCQs Quiz Multiple Choice Questions & Answers

1. How much percentage of the interesting information can be obtained by using SQL.

1. 50
2. 80
3. 70
4. 40

2. The un-normalized relation containing all attributes that exist in database is

1. universal relation.
2. actual relation.
3. transparent relation.
4. verified relation.

3. Enrichment means

1. selecting the data.
2. adding external data.
3. deleting data.
4. cleaning data.

4. The system that can be used without knowledge of internal operation

1. bias.
2. black box.
3. white box.
4. case based learning.

5. The distance between two points that is calculated using Pythagoras theorem is

1. heuristic distance.
2. cartesian distance.
3. eucledian distance.
4. extendable distance.

6. Which of the following is closely related to statistical significance and transparency?

1. Search Complexity.
2. Classification Accuracy.
3. Transparency.
4. Statistical significance.

7. What is a creative activity that has to be performed repeatedly in order to get best results.

1. Selection.
2. Cleaning
3. Reporting
4. Coding.

8. The decision support system is used only for

1. queries.
2. cleaning.
3. coding.
4. selecting.

9. Deep knowledge can be found only by using

1. algorithm
2. clues.
3. OLAP.
4. SQL.

10. Foreign key constraints are also referred as

1. domain constraints.
2. consistency constraints.
3. referential integrity.
4. conditional integrity.

11. What are the two important qualities of good learning algorithm.

1. Transparent, Complex.
2. Consistent, Complete.
3. Information content, Complex.
4. Complete, Complex.

12. Metadata describes

1. database itself.
2. contents of database.
3. structure of contents of database.
4. structure of database.

13. What itself has become a production factor of importance.

1. Algorithm.
2. Data.
3. Information.
4. Program.

14. The partition of overall data warehouse is

1. operational data.
2. database.
3. data cube.
4. data mart.

15. DSS stands for

1. Decision System of System.
2. Deciding Support System.
3. Decision Support System.
4. Decision Software System.

16. Which one is an example for case based-learning.

1. K-nearest neighbor.
2. Decision trees.
3. Neural networks.
4. Genetic algorithm.

17. Redundancy refers to the elements of a message that can be derived from other parts of

1. complete message.
2. different message.
3. irrelevant message.
4. same message.

18. Data mining algorithms require

1. All of the above.
2. efficient sampling method.
3. storage of intermediate results.
4. capacity to handle large amounts of data.

19. The next stage to data selection in KDD process

1. reporting.
2. enrichment.
3. coding.
4. cleaning.

20. What is the first stage in genetic algorithm.

1. Genetic manipulation.
2. Evaluation of each string.
3. Selection of string.
4. Creation of population of string.

21. EIS stands for

1. Extended Information system.
2. Executive Information System.
3. Exchange of Information System.
4. Extra Information System.

22. A coding operation in which an attribute with cardinality n is replaced by n binary attributes is called as

1. fuzzification of table.
2. falsification of table.
3. enrichment of table.
4. flattening of table.

23. What is one of the genetic operators that are used to recombine the population of genetic material.

1. encoding operator.
2. genetic operator.
3. mutation operator.
4. cross over operator.

24. A database containing volatile data used for daily operation of an organization is

1. operational data.
2. historic data.
3. metadata.
4. knowledge.

25. The technique of learning by generalizing from examples is

1. generalized learning.
2. incremental learning.
3. inductive learning.
4. hybrid learning.

26. Genetic algorithm was proposed by

1. Kohenon.
2. John Holland.
3. Johnson.
4. Watson.

27. Which is the technique which is used for discovering patterns in dataset at the beginning of data mining process.

1. SQL.
2. Kohenon map.
3. Visualization.
4. OLAP.

28. A natural way to visualize the process of training a self-organizing map is called

1. scatter diagram.
2. kohonen movie.
3. kohonen map.
4. frame.

29. K-nearest neighbor is one of the

1. data warehousing tool.
2. learning technique.
3. OLAP tool.
4. purest search technique.

30. The complexity of data mining algorithm is represented by

1. 2 log n.
2. log n.
3. 2n log n.
4. n log n.

31. Which multiprocessing machines share same hard disk and internal memory.

1. Asymmetric.
2. Massively parallel.
3. Symmetric.
4. Parallel.

32. Which is the relationship between compressibility and learnability.

1. Voronoi principle.
2. Maximum description length principle.
3. Minimum description length principle.
4. Kolmogorov complexity.

33. A trivial result that is obtained by an extremely simple method is called

1. wrong prediction.
2. naive prediction.
3. accurate prediction.
4. correct prediction.

34. The algorithm that need to access a table several times during execution is

1. nearest neighbor search.
2. n-table scan algorithm.
3. zoom scan algorithm.
4. hybrid algorithm.

35. In K-nearest neighbor algorithm K stands for

1. random number.
2. number of neighbors that are investigated.
3. number of iterations.
4. number of total records.

36. Which one of the following is not a part of empirical cycle in scientific research?

1. Prediction.
2. Observation
3. Theory.
4. Self learning.

37. OLAP stands for

1. Online Analytical Problem.
2. Online Analytical Processing.
3. Online Linear Analytical Processing.
4. Online Animated Process.

38. The intermediate unit in perceptron is

1. receptors.
2. photoreceptors.
3. associators.
4. responders.

39. What is a planning optimization application written for KLM

1. AIRLINES.
2. PILOTS.
3. CAPTAINS.
4. CUSTOMERS.

40. The set of attribute in a database that refers to data in another table is called

1. super key.
2. primary key.
3. candidate key.
4. foreign key.

41. Translation of problem to learning technique is called as

1. learning algorithm.
2. reengineering.
3. translational engineering.
4. representational engineering.

42. In KDD and data mining, noise is referred to as

1. random errors in database.
2. repeated data.
3. complex data.
4. meta data.

43. What is used to load the information from operational database.

1. Transformation engineering.
2. Replication technique.
3. Reengineering technique.
4. Engineering technique.

44. Hidden knowledge can be found by using

1. clues.
2. searching algorithm.
3. pattern recognition algorithm.
4. searching algorithm.

45. What is the heart of knowledge discovery in database process.

1. Creative coding.
2. Selection.
3. Data ware house.
4. Data mining.

46. OLAP is used to explore the ___________ knowledge.

1. hidden.
2. shallow.
3. deep.
4. multidimensional.

47. The DB vendor who is able to operate massively parallel computers is

1. Wipro.
2. TCS.
3. IBM.
4. CTS.

48. SQL helps to find

1. data under constraints that are already known
2. the interesting data
3. hidden information
4. intermediate data

49. The ever increasing amount of data is compared to that of infinite library by Jorge Louis Borges in his short stories namely

1. the library of Boulevard.
2. the library of Louis.
3. the library of Borges.
4. the library of Babel.

50. In which approach data ware house is build first and all information needed is selected.

1. DSS.
2. top-down.
3. client/server.
4. bottom-up.