Skip to content
VUBuddy
CS614

CS614 Final Term Solved MCQs with References by Arslan

Data Warehousing PDF 1.4 MBUpdated 23 Oct 2026
Download free Open CS614 course
Final term past paper CS614 Final Term Solved MCQs with References by Arslan PDF 1.4 MB
vubuddy.com
Type
Final term past paper
Course
CS614 Data Warehousing
Size
PDF 1.4 MB
Updated
23 Oct 2026
Free download 0 of 3 used today
Download free · 1.4 MB

You get 3 free files a day on the website. Add the Chrome extension for 30 a day.

Unlimited downloads in the Android app Get it free on Google Play

Preview text

Text from pages 1, 2, 3 of 40. Download the file for all 40 pages.

Solved MCQ(S) · From FinalTerm Papers · BY Arslan · Jan 14, 2018 · V-U

Updated.

Final-Term Papers Solved MCQS with Reference

  1. Suppose the amount of data recorded in an organization is doubled every year. This increase is
  •  Linear
  •  Quadratic
  •  Logarithmic

 Exponential PG # 15

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

 Subject PG # 35

  •  Object
  •  Aggregate
  •  Detail
  1. De-Normalization normally speeds up

 Data Retrieval PG # 51

  •  Data Modification
  •  Development Cycle
  •  Data Replication
  1. 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.

  1. Non recording facts have a disadvantage that it has

 Lack of Information PG # 120

  •  Redundant Information
  •  Repeated Information
  •  Normalized Information
  1. 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
  1. A cube is not a data warehouse, it is a _______________

 Data Mart PG # 131

  •  Data Extraction
  •  Data Loading
  •  Query Manager
  1. 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
  1. _______________, 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
  1. _______________, 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
  1. _______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

Related CS614 files

All CS614 files →
CS614 Data Warehousing All CS614 handouts, past papers, quizzes and MCQs in one place. Open course page

Get more out of VUBuddy, for free

Android app Free on Google Play
  • Unlimited downloads
  • The explanation behind every MCQ answer
  • Study offline on slow data
Get the Android app
Chrome extension Free on the Chrome Web Store
  • 30 downloads a day instead of 3
  • Sign in and buy Pro Semester here
Add to Chrome

One Pro Semester membership works in both the extension and the app.