Data Warehousing (CS614)

1. The goal of ideal parallel execution is to completely parallelize those parts of a computation that are not constrained by data dependencies. The ______ the portion of the program that must be executed sequentially, the greater the scalability of the computation.

   1. Larger
   2. Smaller
   3. Unambiguous
   4. Superior

2. Data mining is a/an __________ approach, where browsing through data using data mining techniques may reveal something that might be of interest to the user as information that was unknown previously.

   1. Non-Exploratory
   2. Exploratory
   3. Computer Science
   4. None of the given

3. There are many variants of the traditional nested-loop join. If the index is built as part of the query plan and subsequently dropped, it is called _________.

   1. Naive nested-loop join
   2. Index nested-loop join
   3. Temporary index nested-loop join
   4. None of the given

4. Execution can be completed successfully or it may be stopped due to some error. If some error occurs, execution will be terminated abnormally and all transactions will be ___________

   1. Committed to the database
   2. Rolled back

5. B-Tree is used as an index to provide access to records __________

   1. Without scanning the entire table
   2. By scanning the entire meta data
   3. By scanning the entire table
   4. None of the given

6. __________ modeling technique is more appropriate for data warehouses.

   1. entity-relationship
   2. dimensional
   3. physical
   4. None of the given

7. Naturally Evolving architecture occurred when an organization had a _______ approach to handling the whole process of hardware and software architecture.

   1. Relaxed
   2. Good
   3. Not Relaxed
   4. None of the given

8. __________, if too big and does not fit into memory, will be expensive when used to find a record by given key.

   1. An Inverted Index
   2. A Sparse Index
   3. A Dense Index
   4. None of the given

9. The technique that is used to perform these feats in data mining is called modeling, and this act of model building is something that people have been doing for a long time, certainly before the _______ of computers or data mining technology.

   1. Access
   2. Advent
   3. Ascent
   4. Avowal

10. Data mining, the ________ of hidden predictive information from large databases, is a powerful new technology with great potential to help companies focus on the most important information in their data warehouses.

    1. Extraction
    2. Insertion
    3. Inclusion
    4. Enclosure

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

    1. “Define”
    2. “Measure”
    3. “Analyze”
    4. “Compression”

12. The STAR schema used for data design is a __________ consisting of fact and dimension tables.

    1. Network model
    2. Relational model
    3. Hierarchical data model
    4. None of the given

13. Taken jointly, the extract programs or naturally evolving systems formed a spider web, also known as

    1. Distributed Systems Architecture
    2. Legacy Systems Architecture
    3. Online Systems Architecture
    4. Intranet Systems Architecture

14. The _________ is only a small part in realizing the true business value buried within the mountain of data collected and stored within organizations business systems and operational databases.

    1. Independence on technology
    2. Dependence on technology
    3. None of these

15. The goal of ideal parallel execution is to completely parallelize those parts of a computation that are not constrained by data dependencies. The smaller the portion of the program that must be executed __________, the greater the scalability of the computation.

    1. In Parallel
    2. Distributed
    3. Sequentially
    4. None of the given

16. Relational databases allow you to navigate the data in ____________ that is appropriate using the primary, foreign key structure within the data model.

    1. Only One Direction
    2. Any Direction
    3. Two Direction
    4. None of the given

17. There are many variants of the traditional nested-loop join. If there is an index and that index is exploited, then it is called _________.

    1. Naive nested-loop join
    2. Index nested-loop join
    3. Temporary index nested-loop join
    4. None of the given

18. Data mining uses _________ algorithms to discover patterns and regularities in data.

    1. Mathematical
    2. Computational
    3. Statistical
    4. None of the given

19. The divide&conquer cube partitioning approach helps alleviate the __________ limitations of MOLAP implementation.

    1. Flexibility
    2. Maintainability
    3. Security
    4. Scalability

20. In contrast to statistics, data mining is ______ driven.

    1. Assumption
    2. Knowledge
    3. Human
    4. Database

21. Ad-hoc access means to run such queries which are known already.

    1. true
    2. false

22. Companies collect and record their own operational data, but at the same time they also use reference data obtained from __________ sources such as codes, prices etc.

    1. Operational
    2. Internal
    3. External
    4. None of the given

23. The users of data warehouse are knowledge workers in other words they are _________ in the organization.

    1. DWH Analyst
    2. Decision maker
    3. Database Administrator
    4. Manager

24. The automated, prospective analyses offered by data mining move beyond the analyses of past events provided by retrospective tools typical of __________.

    1. OLTP
    2. OLAP
    3. Decision Support Systems
    4. None of the given

25. To identify the __________ required we need to perform data profiling

    1. Degree of Transformation
    2. Complexity
    3. Cost
    4. Time

26. Multi-dimensional databases (MDDs) typically use ___________ formats to store pre-summarized cube structures.

    1. SQL
    2. proprietary file
    3. Object oriented
    4. Non- proprietary file

27. Virtual cube is used to query two similar cubes by creating a third "virtual" cube by a join between two cubes.

    1. true
    2. false

28. With data mining, the best way to accomplish this is by setting aside some of your data in a vault to isolate it from the mining process; once the mining is complete, the results can be tested against the isolated data to confirm the model's _______.

    1. Validity
    2. Security
    3. Integrity
    4. None of the given

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

    1. One
    2. Two
    3. Linear
    4. Quadratic

30. Classification consists of examining the properties of a newly presented observation and assigning it to a predefined ____________.

    1. Object
    2. Container
    3. Subject
    4. Class

31. The input to the data warehouse can come from OLTP or transactional system but not from other third party database.

    1. true
    2. false

32. Which of the following is not an "Orr’s Law of Data Quality"?

    1. “Data that is not used cannot be correct!”
    2. “Data quality is a function of its use, not its collection!”
    3. “Data will be no better than its most stringent use!”
    4. “Data duplication can be harmful for the organization!”

33. Analytical processing uses __________ , instead of record level access.

    1. multi-level aggregates
    2. Single-level aggregates
    3. Single-level hierarchy
    4. None of the Given

34. __________ gives total view of an organization.

    1. OLAP
    2. OLTP
    3. Data Warehouse
    4. Database

35. __________ is an application of information and data.

    1. Knowledge
    2. Intelligence
    3. Power
    4. Education

36. In _________ system, the contents change with time.

    1. OLTP
    2. ATM
    3. DSS
    4. OLAP

37. It is observed that every year the amount of data recorded in an organization ________.

    1. Doubles
    2. Remains same as previous year
    3. Triples
    4. Quartiles

38. Data Warehouse provides the best support for analysis while OLAP carries out the _________ task.

    1. Mandatory
    2. Whole
    3. Analysis
    4. Prediction

39. Slice and Dice is changing the view of the data.

    1. true
    2. false

40. The goal of star schema design is to simplify ________.

    1. Logical data model
    2. Physical data model
    3. Conceptual data model
    4. None of the given

41. Data warehousing and on-line analytical processing (OLAP) are _______ elements of decision support system.

    1. Unusual
    2. Essential
    3. Optional
    4. None of the given

42. __________ in agriculture extension is that pest population beyond which the benefit of spraying outweighs its cost.

    1. Profit Threshold Level
    2. Economic Threshold Level
    3. Medicine Threshold Level
    4. None of the given

43. If someone told you that he had a good model to predict customer usage, the first thing you might try would be to ask him to apply his model to your customer _______, where you already knew the answer.

    1. Base
    2. Drive
    3. File
    4. Log

44. __________ is the technique in which existing heterogeneous segments are reshuffled, relocated into homogeneous segments.

    1. Clustering
    2. Aggregation
    3. Segmentation
    4. Partitioning

45. People that design and build the data warehouse must be capable of working across the organization at all levels

    1. True
    2. False

46. The automated, prospective analyses offered by data mining move beyond the analyses of past events provided by _________ tools typical of decision support systems.

    1. Introspective
    2. Intuitive
    3. Reminiscent
    4. Retrospective

47. The need to synchronize data upon update is called

    1. Data Imitation
    2. Data Manipulation
    3. Data Replication
    4. Data Coherency

48. There are many variants of the traditional nested-loop join. When the entire table is scanned it is called

    1. Index nested-loop join
    2. Naive nested-loop join
    3. Temporary index nested-loop join
    4. None of the given

49. Data Warehouse is about taking/collecting data from different ________ sources.

    1. Harmonized
    2. Identical
    3. Homogeneous
    4. Heterogeneous

50. DOLAP allows download of "cube" structures to a desktop platform with the need for shared relational or cube server.

    1. true
    2. false

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

    1. An Inverted Index
    2. A Sparse Index
    3. A Dense Index
    4. None of the given

52. During business hours, most ________ systems should probably not use parallel execution.

    1. OLAP
    2. DSS
    3. Data Mining
    4. OLTP

53. Many data warehouse project teams waste enormous amounts of time searching in vain for a ____________.

    1. Silver Bullet
    2. Golden Bullet
    3. Suitable Hardware
    4. Compatible Product

54. The goal of __________ is to look at as few blocks as possible to find the matching records(s).

    1. Indexing
    2. Partitioning
    3. Joining
    4. None of the given

55. A single database, couldn’t serve both operational high performance transaction processing and DSS, analytical processing, all at the same time.

    1. True
    2. False

56. If every key in the data file is represented in the index file then index is _________.

    1. Dense Index
    2. Sparse Index
    3. Inverted Index
    4. None of the given

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

    1. Linear
    2. Quadratic
    3. Exponential
    4. Logarithmic

58. Data mining derives its name from the similarities between searching for valuable business information in a large database, for example, finding linked products in gigabytes of store scanner data, and mining a mountain for a _______ of valuable ore.

    1. Furrow
    2. Streak
    3. Trough
    4. Vein

59. As opposed to the outcome of classification, estimation deal with __________ valued outcome.

    1. Discrete
    2. Isolated
    3. Continuous
    4. Distinct

60. In nested-loop join case, if there are ‘M’ rows in outer table and ‘N’ rows in inner table, time complexity is __________.

    1. O (M log N)
    2. O (log MN)
    3. O (MN)
    4. O (M + N)

61. The growth of master files and magnetic tapes exploded around the mid- _______.

    1. 1950s
    2. 1960s
    3. 1970s
    4. 1980s

62. The performance in a MOLAP cube comes from the O(1) look-up time for the array data structure.

    1. true
    2. false

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

    1. OLTP
    2. OLAP
    3. DSS
    4. Inverted Index

64. In a traditional MIS system, there is an almost linear sequence of queries.

    1. true
    2. false

65. Node of a B-Tree is stored in memory block and traversing a B-Tree involves ________ page faults.

    1. O (n lg n)
    2. O (lg n)
    3. O (n)
    4. O (n²)

66. Data mining evolve as a mechanism to cater the limitations of ________ systems to deal massive data sets with high dimensionality, new data types, multiple heterogeneous data resources etc.

    1. OLTP
    2. OLAP
    3. DSS
    4. DWH

67. Cube is a ________ entity containing values of a certain fact at a certain aggregation level at an intersection of a combination of dimensions.

    1. Logical
    2. Physical
    3. Analytical
    4. None of the given

Select a course code for Objective Questions:

ACC311 ACC501 BIF101 BIF401 BIF501 BIO101 BIO201 BIO202 BIO203 BIO204 BIO301 BIO302 BIO303 BIO401 BIO503 BNK603 BT101 BT201 BT301 BT302 BT401 BT402 BT403 BT404 BT405 BT406 BT501 BT504 BT505 BT604 CHE201 CHE301 CS001 CS101 CS201 CS202 CS204 CS301 CS302 CS304 CS311 CS401 CS402 CS403 CS408 CS501 CS502 CS504 CS506 CS508 CS601 CS602 CS604 CS605 CS607 CS609 CS610 CS614 CS707 CS710 ECO401 ECO402 ECO403 ECO404 EDU302 EDU401 EDU402 EDU501 EDU601 ENG101 ENG201 ENG301 ENG501 FIN611 FIN624 FIN625 ISL201 IT430 MCM101 MCM301 MGMT623 MGT101 MGT211 MGT301 MGT401 MGT402 MGT501 MGT502 MGT503 MGT510 MGT601 MGT603 MKT501 MKT610 MKT630 MTH101 MTH202 MTH302 MTH501 MTH601 MTH634 PAK301 PHY101 PHY301 PSY101 PSY403 PSY502 PSY512 SOC101 SOC301 SOC401 STA301 STA630 STA641 ZOO102 ZOO401 ZOO501 ZOO502 ZOO503 ZOO504 ZOO505 ZOO506 ZOO510 ZOO630

Select a course code for Subjective Questions:

ACC311 CS001 CS101 CS201 CS301 CS607 CS701 CS702 CS703 CS704 CS707 CS708 CS710 CS711 CS718 CS721 CS724 ECO401 ECO403 ENG101 ENG301 MGT703 MTH501 STA301