CS614 Midterm Online Quiz

0%

CS614-Midterm

1 / 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.

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 __________ the portion of the program that must be executed sequentially, the greater the scalability of computation.

3 / 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.

4 / 50

in agriculture extension is that pest population beyond which the benefit of spraying outweighs levels

5 / 50

To measure or quantify the similarity or dissimilarity, different techniques are available. Which of the following option represent the name of available techniques?

6 / 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.

7 / 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?

8 / 50

To judge effectiveness we perform data profiling twice.

9 / 50

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

10 / 50

If every key in the data file is represented in the index file then index is :

11 / 50

It is observed that every year the amount of data recorded in an organization :

12 / 50

There are many variants of the traditional nested-loop join, if there is an index is exploited, then it is called……

13 / 50

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

14 / 50

The purpose of the House of Quality technique is to reduce ______ types of risk.

15 / 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 _______.

16 / 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.

17 / 50

The goal of ______is to look at as few block as possible to find the matching records.

18 / 50

Multidimensional databases typically use proprietary __________ format to store pre-summarized cube structures.

19 / 50

Investing years in architecture and forgetting the primary purpose of solving business problems, results in inefficient application. This is the example of _________ mistake.

20 / 50

Slice and Dice is changing the view of the data.

21 / 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...

22 / 50

For a smooth DWH implementation we must be a technologist.

23 / 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.

24 / 50

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

25 / 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?

26 / 50

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

27 / 50

Multidimensional databases typically use proprietary __________ format to store pre-summarized cube structures.

28 / 50

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

29 / 50

_____ contributes to an under-utilization of valuable and expensive historical data, and inevitably results in a limitedcapability to provide decision support and analysis.

30 / 50

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

31 / 50

All data is ______________ of something real. I An Abstraction II A Representation Which of the following option is true?

32 / 50

DTS allows us to connect through any data source or destination that is supported by ____________

33 / 50

NUMA stands for __________

34 / 50

Change Data Capture is one of the challenging technical issues in _____________

35 / 50

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

36 / 50

De-Normalization normally speeds up

37 / 50

For a DWH project, the key requirement are ________ and product experience.

38 / 50

In _________ system, the contents change with time. :

39 / 50

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

40 / 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.

41 / 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.

42 / 50

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

43 / 50

Pipeline parallelism focuses on increasing throughput of task execution, NOT on __________ sub-task execution time.

44 / 50

NUMA stands for __________

45 / 50

The degree of similarity between two records, often measured by a numerical value between _______, usually depends on application characteristics.

46 / 50

_________ breaks a table into multiple tables based upon common column values.

47 / 50

In horizontal splitting, we split a relation into multiple tables on the basis of

48 / 50

If „M‟ rows from table-A match the conditions in the query then table-B is accessed „M‟ times. Suppose table-B has an index on the join column. If „a‟ I/Os are required to read the data block for each scan and „b‟ I/Os for each data block then the total cost of accessing table-B is _____________ logical I/Os approximately.

49 / 50

The automated, prospective analyses offered by data mining move beyond the analysis of past events provided by respective tools typical of ___________.

50 / 50

 ________ gives total view of an organization

Your score is

The average score is 0%

0%

Qunoot e Nazilah
Dua e Hajat
4 Qul
6 Kalma
Dua-e-Akasha
Darood Akbar
Surah Fatiha
Dua-e-Ganj Ul Arsh
Dua-e-Jamilah
Ayat-ul-Kursi