Assume a company with a multi-million row customer table i.e. n rows. Checking for Referential Integrity (RI), using a smart technique with some kind of a tree data structure would require ______________time.

• A) O(log n)
• B) O(1)
• C) O(n)
• D) None of the given

A join is identified by multiple tables in the ____ clause

• A) SORT BY
• B) GROUP BY
• C) SELECT
• D) FROM

Which of the following is not an activity of Data Quality Analysis Project?

• A) “Analyze”
• B) “Measure”
• C) “Compression”
• D) “Define”

Bitmap index is appropriate for:

• A) Low cardinality data
• B) High cardinality data
• C) Aggregated data
• D) Clustered data

_______ index uses even less space than ______ index, but the block has to be searched, even for unsuccessful searches.

• A) Dense, sparse
• B) Sparse, dense
• C) Dense, inverted
• D) Sparse, inverted

Which of the following is not an “Orr’s Law of Data Quality”?

• A) “Data will be no better than its most stringent use!”
• B) “Data that is not used cannot be correct!”
• C) “Data duplication can be harmful for the organization!”
• D) “Data quality is a function of its use, not its collection!”

_____________ is the degree to which data accurately reflects the real-world object that the data represents.

• A) Intrinsic Data Quality
• B) Strong Data Quality
• C) Weak Data Quality
• D) Realistic Data Quality

Parallelism can be exploited, if there is:

• A) Sufficient I/O bandwidth
• B) Symmetric multi-processors (SMP)
• C) Underutilized or intermittently used CPUs
• D) All of the given options

One of the main reasons for the failure of DWH deployments is ______________.

• A) Data duplication
• B) Data anomaly
• C) Data integrity
• D) Data quality

______________ incorporates the concept of product quality, process control, quality assurance, and quality improvement.

• A) Realistic Data Quality Management
• B) Strong Data Quality Management
• C) Intrinsic Data Quality Management
• D) Total Quality Management

______________ is the extent to which data is regarded as true and credible.

• A) Completeness
• B) Accessibility
• C) Believability
• D) Consistency

In context of data parallelism, to get a speed-up of N with N partitions, it must be ensured that:

• A) Work done in each partition almost same
• B) Query-coordinator is very fast as compared to query servers
• C) There are enough computing resources
• D) All of the given options

___________is a/an measure of how current or up to date the data is.

• A) Accessibility
• B) Timeliness
• C) Completeness
• D) Consistency

_______ do not (typically) keep the index values in sorted order

• A) Sparse index
• B) Dense index
• C) B-Tree index
• D) Hash based index

________ in a database or data warehouse has no actual value; it only has potential value.

• A) Data
• B) Data marts
• C) Flat tables
• D) Entity

Which of the following is NOT one of the parallel hardware architectures?

• A) Shared Memory
• B) Symmetric Multi Processing
• C) Massively Parallel Processing
• D) Non-uniform Memory Access

The exact formula for Speed-up is:

• A) (Time on Serial Processor) / (Time on parallel processors)
• B) (Time on Serial Processor) * (Time on parallel processors)
• C) (Time on Serial Processor) + (Time on parallel processors)
• D) (Time on Serial Processor) - (Time on parallel processors)

An optimized structure which is built primarily for retrieval, with update being only a secondary consideration is

• A) DSS
• B) OLTP
• C) Inverted Index
• D) OLAP

Assume a company with a multi-million row customer table i.e. n rows. Checking for Referential Integrity (RI) using a naive approach would take _______________ time.

• A) O(1)
• B) O(log n)
• C) None of the given
• D) O(n)

Data is the “_____________” on which a Data Warehouse (DWH) runs.

• A) Element
• B) Entity
• C) Fuel
• D) Component