CS614-Midterm
1 / 50
Investing years in architecture and forgetting the primary purpose of solving business problems, results in inefficient application. This is the example of _________ mistake.
2 / 50
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.
3 / 50
The growth of master files and magnetic tapes exploded around the mid- _______. :
4 / 50
The degree of similarity between two records, often measured by a numerical value between _______, usually depends on application characteristics.
5 / 50
in agriculture extension is that pest population beyond which the benefit of spraying outweighs levels
6 / 50
Many data warehouse project teams waste enormous amounts of time searching in vain for a _______.
7 / 50
The divide & conquer cube partitioning approach helps alleviate the ____________ limitations of MOLAP implementation.
8 / 50
A dense index, if fits into memory, costs only ______ disk I/O access to locate a record by given key.
9 / 50
Pre-computed _______ can solve performance problems
10 / 50
In horizontal splitting, we split a relation into multiple tables on the basis of
11 / 50
The need to synchronize data upon update is called
12 / 50
Relational databases allow you to navigate the data in ____________ that is appropriate using the primary, foreign key structure within the data model.
13 / 50
B-Tree is used as an index to provide access to records
14 / 50
_____modeling technique is more appropriate for data warehouses.
15 / 50
For a given data set, to get a global view in un-supervised learning we use
16 / 50
Taken jointly, the extract programs or naturally evolving systems formed a spider web, also known as
17 / 50
Data mining is a/an ______ approach , where browsing through data using mining techniques may reveal something that might be of interest to the user as information that was unknown previously.
18 / 50
If every key in the data file is represented in the index file then index is :
19 / 50
_______________, if too big and does not fit into memory, will be expensive when used to find a record by given key.
20 / 50
: An optimized structure which is built primarily for retrieval, with update being only a secondary consideration is
21 / 50
DTS allows us to connect through any data source or destination that is supported by ____________
22 / 50
.______ is class of Decision Support Environment.
23 / 50
De-Normalization normally speeds up
24 / 50
The goal of star schema design is to simplify ________
25 / 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:
26 / 50
Ad-hoc access means to run such queries which are known already.
27 / 50
Pakistan is one of the five major ________ countries in the world.
28 / 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.
29 / 50
As apposed to the out come of classification, estimation deal with ____________ valued outcome.
30 / 50
Data warehousing and on-line analytical processing (OLAP) are _______ elements of decision support system.
31 / 50
32 / 50
Pipeline parallelism focuses on increasing throughput of task execution, NOT on __________ sub-task execution time.
33 / 50
34 / 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 ____________.
35 / 50
The technique that is used to perform these feats in data mining modeling, and this act of model building is something that people have been doing for long time, certainly before the _______ of computers or data mining technology.
36 / 50
A single database, couldn‟t serve both operational high performance transaction processing and DSS, analytical processing, all at the same time.
37 / 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.
38 / 50
Node of a B-Tree is stored in memory block and traversing a B-Tree involves ______ page faults.
39 / 50
_________ breaks a table into multiple tables based upon common column values.
40 / 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 ___________
41 / 50
Naturally Evolving architecture occurred when an organization had a _______ approach to handling the whole process of hardware and software architecture.
42 / 50
43 / 50
44 / 50
45 / 50
_______________, if fits into memory, costs only one disk I/O access to locate a record by given key.
46 / 50
Suppose the amount of data recorded in an organization is doubled every year. This increase is __________ .
47 / 50
For a DWH project, the key requirement are ________ and product experience.
48 / 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.
49 / 50
50 / 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.
Your score is
The average score is 0%
Restart quiz
