CS614-Midterm
1 / 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 ___________
2 / 50
Investing years in architecture and forgetting the primary purpose of solving business problems, results in inefficient application. This is the example of _________ mistake.
3 / 50
: The goal of ___________ is to look at as few blocks as possible to find the matching records(s).
4 / 50
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.
5 / 50
.______ is class of Decision Support Environment.
6 / 50
NUMA stands for __________
7 / 50
A dense index, if fits into memory, costs only ______ disk I/O access to locate a record by given key.
8 / 50
Which statement is true for De-Normalization?
9 / 50
In horizontal splitting, we split a relation into multiple tables on the basis of
10 / 50
In a traditional MIS system, there is an almost linear sequence of queries.
11 / 50
All data is ______________ of something real. I An Abstraction II A Representation Which of the following option is true?
12 / 50
Normalization effects performance
13 / 50
5 million bales.
14 / 50
For a relation to be in 4NF it must be:-
15 / 50
Pakistan is one of the five major ________ countries in the world.
16 / 50
Cube is a __________ entity containing values of a certain fact at a certain aggregation level at an intersection of a combination of dimensions.
17 / 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.
18 / 50
As apposed to the out come of classification, estimation deal with ____________ valued outcome.
19 / 50
Collapsing tables can be done on the ___________ relationships
20 / 50
The purpose of the House of Quality technique is to reduce ______ types of risk.
21 / 50
_____________, if fits into memory , costs only one disk I/O access to locate a record by given key.
22 / 50
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.
23 / 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 ____________.
24 / 50
25 / 50
Pipeline parallelism focuses on increasing throughput of task execution, NOT on __________ sub-task execution time.
26 / 50
Pre-join technique is used to avoid
27 / 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...
28 / 50
DTS allows us to connect through any data source or destination that is supported by ____________
29 / 50
30 / 50
The automated, prospective analyses offered by data mining move beyond the analyses of past events provided by _____________ tools typical of decision support systems.
31 / 50
Analytical processing uses ____________ , instead of record level access.
32 / 50
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.
33 / 50
For good decision making, data should be integrated across the organization to cross the LoB (Line of Business). This is to give the total view of organization from:
34 / 50
35 / 50
The key idea behind ___________ is to take a big task and break it into subtasks that can be processed concurrently on a stream of data inputs in multiple, overlapping stages of execution.
36 / 50
To judge effectiveness we perform data profiling twice.
37 / 50
In DWH project, it is assured that ___________ environment is similar to the production environment
38 / 50
Node of a B-Tree is stored in memory block and traversing a B-Tree involves ______ page faults.
39 / 50
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.
40 / 50
Ad-hoc access means to run such queries which are known already.
41 / 50
42 / 50
_______________, if fits into memory, costs only one disk I/O access to locate a record by given key.
43 / 50
Multidimensional databases typically use proprietary __________ format to store pre-summarized cube structures.
44 / 50
Data warehousing and on-line analytical processing (OLAP) are _______ elements of decision support system.
45 / 50
Non uniform distribution, when the data is distributed across the processors, is called ______.
46 / 50
Horizontal splitting breaks a table into multiple tables based upon_______
47 / 50
People that design and build the data warehouse must be capable of working across the organization at all levels
48 / 50
If every key in the data file is represented in the index file then index is :
49 / 50
50 / 50
Pre-computed _______ can solve performance problems
Your score is
The average score is 0%
Restart quiz
