CS614-Midterm
1 / 50
The need to synchronize data upon update is called
2 / 50
Data warehousing and on-line analytical processing (OLAP) are _______ elements of decision support system.
3 / 50
The performance in a MOLAP cube comes from the O(1) look-up time for the array data structure.
4 / 50
The users of data warehouse are knowledge workers in other words they are _______in the organization.
5 / 50
Horizontal splitting breaks a table into multiple tables based upon_______
6 / 50
A dense index, if fits into memory, costs only ______ disk I/O access to locate a record by given key.
7 / 50
The growth of master files and magnetic tapes exploded around the mid- _______. :
8 / 50
Pipeline parallelism focuses on increasing throughput of task execution, NOT on __________ sub-task execution time.
9 / 50
To measure or quantify the similarity or dissimilarity, different techniques are available. Which of the following option represent the name of available techniques?
10 / 50
____________ in agriculture extension is that pest population beyond which the benefit of spraying outweighs its cost.
11 / 50
A single database, couldn‟t serve both operational high performance transaction processing and DSS, analytical processing, all at the same time.
12 / 50
Focusing on data warehouse delivery only often end up _________.
13 / 50
Rearranging the grouping of source data, delivering it to the destination database, and ensuring the quality of data are crucial to the process of loading the data warehouse. Data ____________ is vitally important to the overall health of a warehouse project. 1. Cleansing 2. Cleaning 3. Scrubbing Which of the following options is true?
14 / 50
During ETL process of an organization, suppose you have data which can be transformed using any of the transformation method. Which of the following strategy will be your choice for least complexity?
15 / 50
Relational databases allow you to navigate the data in ____________ that is appropriate using the primary, foreign key structure within the data model.
16 / 50
If w is the window size and n is the size of data set, then the complexity of merging phase in BSN method is___________
17 / 50
_______ is an application of information and data.
18 / 50
Node of a B-Tree is stored in memory block and traversing a B-Tree involves ______ page faults.
19 / 50
If some error occurs, execution will be terminated abnormally and all transactions will be rolled back. In this case when we will access the database we will find it in the state that was before the ____________.
20 / 50
DSS queries do not involve a primary key
21 / 50
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 _______.
22 / 50
The divide & conquer cube partitioning approach helps alleviate the ____________ limitations of MOLAP implementation.
23 / 50
Grain is the ________ level of data stored in the warehouse.
24 / 50
In DWH project, it is assured that ___________ environment is similar to the production environment
25 / 50
The automated, prospective analyses offered by data mining move beyond the analyses of past events provided by _____________ tools typical of decision support systems.
26 / 50
B-Tree is used as an index to provide access to records
27 / 50
Virtual cube is used to query two similar cubes by creating a third “virtual” cube by a join between two cubes.
28 / 50
For a DWH project, the key requirement are ________ and product experience.
29 / 50
________ gives total view of an organization
30 / 50
The goal of ______is to look at as few block as possible to find the matching records.
31 / 50
For a smooth DWH implementation we must be a technologist.
32 / 50
Execution can be completed successfully or it may be stopped due to some error. In case of successful completion of execution all the transactions will be ___________
33 / 50
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.
34 / 50
In horizontal splitting, we split a relation into multiple tables on the basis of
35 / 50
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.
36 / 50
5 million bales.
37 / 50
38 / 50
The purpose of the House of Quality technique is to reduce ______ types of risk.
39 / 50
As apposed to the out come of classification, estimation deal with ____________ valued outcome.
40 / 50
: An optimized structure which is built primarily for retrieval, with update being only a secondary consideration is
41 / 50
_______________, if too big and does not fit into memory, will be expensive when used to find a record by given key.
42 / 50
Analytical processing uses ____________ , instead of record level access.
43 / 50
NUMA stands for __________
44 / 50
_______________, if fits into memory, costs only one disk I/O access to locate a record by given key.
45 / 50
For a relation to be in 4NF it must be:-
46 / 50
Data Transformation Services (DTS) provide a set of _____ that lets you extract, transform, and consolidate data from disparate sources into single or multiple destinations supported by DTS connectivity.
47 / 50
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 computation.
48 / 50
49 / 50
Pre-join technique is used to avoid
50 / 50
Data mining evolve as mechanism to cater the limitations of _____ systems to deal massive data sets with high dimensionality, new data types, multiple heterogeneous data resources etc...
Your score is
The average score is 0%
Restart quiz
