CS614 Final Term Solved MCQs Set 2 by Junaid

1. Classification consist of examining the properties of a newly presented observation and assigning it to a predefined__________  Object  Class  Container  Subjects
2. In context of clustering the term “distance” means  The relation of a record with corresponding records in child table  None of these  The difference between the primary keys of two records  Similarity dissimilarity of record
3. In contrast to data mining statistics is_____driven  Discovery  Knowledge  Database  Assumption
4. ______is the technique in which existing heterogeneous segments are reshuffled, relocated into homogenous segments.  Clustering  Partitioning  Aggregation  Segmentation
5. In context of data mining definition, the term “Value” means.  Importance of hidden pattern discovered  The primary key of table  The index location of record  Numerical or string measure assigned to an attributes
6. As oppose to the outcome of classification, estimation deal with____valued outcomes  Discrete  Continuous  Isolated  distinct
7. _________ incorporates the con cept of product quality, process control, quality assurance, and quality improvement.

o Total Quality Management

o Intrinsic Data Quality Management o Realistic Data Quality Management o Strong Data Quality Management

8. The extent to which data is in appropriate languages, symbols and units, and the definitions are clear is known as __________.

o Interpretability

9. The degree to which values are present in the attributes that require them is known as __________.
10. The ________ dimension represents data correctness.

o Free-of-error

o Correctness

11. In B-tree index, the lowest level index blocks are called leaf blocks, and these blocks contain: o NULL value to make the leaf terminal node

o Every indexed data value and a corresponding ROWID

o Every indexed data value and pointer to next level block o Every indexed data value and pointer to root block

12. Data is the __________ on which a Data Warehouse (DWH) runs. o Fuel o Element o Component o Entity
13. Mining Multi dimensional databases allow users to:  Categorize the data  Summarize the data  Analyze the data  All of the given
14. In context of data parallelism to get a speed-up of N with N partitions, it

must be ensured that: o There are enough computing resources o Query-coordinator is very fast as compared to query servers o Work done in each partition almost same

o All of the given options

13. Which of the following is not an activity of Data Quality Analysis Project? o " Define" o " Measure" o " Analyze"

o "Compression"

Q14. Which of the following is not a Data Quality Validation Technique?

1. Referential Integrity
2. Using Data Quality Rules
3. Data Histograming
4. Indexes

Correct answer: Indexes

Q15. One of the preconditions to decide about operations to be parallelized is that

1. Operation can be implemented independent of each other
2. Output of one operation becomes input of other
3. Operations share same memory location
4. Operations share same namespace

Correct answer: Operation can be implemented independent of each other

Q16. ___________do not (typically) keep the index values in sorted order

1. Dense index
2. Sparse index
3. B-Tree Index
4. Hash Based index

Correct answer: Hash Based index

17. Parallelism can be exploited, if there is : o Symmetric multi processors (SMP) o Sufficient I/O bandwidth o Underutilized or intermittently used CPUs

o All of the given options

18. Which of the following is NOT one of the parallel hardware architectures? o Symmetric Multi-Processing o Massively Parallel Processing o Non-uniform Memory Access o