CS614 Final Term Solved MCQs with References

Dec 21,2015

PK

Final-Term Papers Solved MCQs CS614- Data Warehousing Including 2016 Final-Term Papers

1. Suppose the amount of data recorded in an organization is doubled every year. This increase is

•  Linear
•  Quadratic
•  Logarithmic

 Exponential

PG # 15

2. The telecommunications data warehouse is dominated by the sheer volume of data generated at the call level area.

 Subject

PG # 35

•  Object
•  Aggregate
•  Detail

3. De-Normalization normally speeds up

 Data Retrieval

PG # 51

•  Data Modification
•  Development Cycle
•  Data Replication

4. ER Model can be simplified in -------- ways

•  One
•  Two

PG # 103

•  Three
•  Four

There are actually two ways of “simplifying” the ER model i.e. (i) De-normalization and (ii) Dimensional Modeling.

5. Non recording facts have a disadvantage that it has

 Lack of Information

PG # 120

•  Redundant Information
•  Repeated Information
•  Normalized Information

6. Fact-less fact table is a fact table without numeric fact columns. It is used to capture relationship between

 Dimensions

PG # 121

•  Attributes
•  Tables
•  Facts

7. A cube is not a data warehouse, it is a

 Data Mart

PG # 131

•  Data Extraction
•  Data Loading
•  Query Manager

8. A dense index, if fits into memory, costs only disk I/O access to locate a record by given key.

•  One

PG # 223

•  Two
•  lg (n)
•  n

9. , if fits into memory, costs only one disk I/O access to locate a record by given key.

 A Dense Index

PG # 223

•  A Sparse Index
•  An Inverted Index

10. , if too big and doesn‟t fit into the memory will be expensive when used to find a record by given key.

 A Dense Index

PG # 223

•  A Sparse Index
•  An Inverted Index

11. operator is conservative in that it assigns to the dimension an aggregate value no higher than the value of its weakest data quality indicator.

 The Min

PG # 188

•  The Simple Ratio
•  The Weighted Average