Wednesday , 18 December 2024

CS614 Solved MCQs Mega Collection for Mid Term Papers

VUassignments.com upload a Mega collection of CS614 Solved MCQs Mega Collection for Mid term Papers. Try to solved the given MCQs yourself for the better preparation of your Upcoming Papers and Quizzes

Qestion

The Kimball s iterative data warehouse development approach drew on decades of experience to develop the _____________.

  1. Business Dimensional Lifecycle
  2. Data Warehouse Dimension
  3. Business Definition Lifecycle
  4. OLAP Dimension

Qestion

For a smooth DWH implementation we must be a technologist.

  1. True
  2. False  

Qestion

During the application specification activity, we also must give consideration to the organization of the applications.

  1. True  
  2. False

Qestion

The most recent attack is the ________ attack on the cotton crop during 2003- 04, resulting in a loss of nearly 0.5 million bales.

  1. Boll Worm  
  2. Purple Worm
  3. Blue Worm
  4. Cotton Worm

Qestion

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

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

Qestion

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

  1. Horizontal splitting  
  2. Vertical splitting

Qestion

As apposed to the out come of classification , estimation deal with ____________ value outcome.

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

Qestion

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

  1. Joining
  2. none of these
  3. nested loop join
  4. none of these

Qestion

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.

  1. Access Advent
  2. Ascent Avowal

Qestion

A data warehouse may include

  1. Legacy systems
  2. Only internal data sources
  3. Privacy restrictions
  4. Small data mart

Qestion

De-Normalization normally speeds up

  1. Data Retrieval
  2. Data Modification
  3. Development Cycle
  4. Data Replication

Qestion

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

  1. Common Column Values
  2. Common Row Values
  3. Different Index Values
  4. Value resulted by ad-hoc query

Qestion

For a given data set, to get a global view in un-supervised learning we use

  1. One-way Clustering
  2. Bi-clustering
  3. Pearson correlation
  4. Euclidean distance

Qestion

In DWH project, it is assured that ___________ environment is similar to the production environment.

  1. Designing
  2. Development
  3. Analysis
  4. Implementation

Qestion

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:

  1. Owner’s Perspective
  2. Customer’s Perspective
  3. Decision Maker’s Perspective
  4. Employee’s Perspective

Qestion

Which is the least appropriate join operation for Pipeline parallelism?

  1. Hash Join
  2. Inner Join
  3. Outer Join
  4. Sort-Merge Join

Qestion

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

Qestion

With data mining, the best way to accomplish this is by setting aside some of your data in a ________ 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 validity.

  1. Cell
  2. Disk
  3. Folder
  4. Vault

Qestion

We must try to find the one access tool that will handle all the needs of their users.

  1. True
  2. False

Qestion

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

  1. Extreme Technology Design
  2. Extreme Architecture Design


Qestion

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

  1. OLTP
  2. OLAP
  3. Decision Support systems
  4. None of these

Qestion

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

  1. Navy nested loop join index
  2. Nested loop join temporary index
  3. Index nested-loop joins

Qestion

 A data warehouse implementation without an OLAP tool is always possible.

  1. True
  2. False

Qestion

_____modeling technique is more appropriate for data warehouses.

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

Qestion

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

  1.  True
  2. False

Qestion

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

Qestion

Slice and Dice is changing the view of the data.

  1. True
  2. False

Qestion

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

Qestion

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 

Qestion

Analytically processing uses ____________ , instead of record level access.

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

Qestion

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

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

Qestion

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

  1. True
  2. False

Qestion

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

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

Qestion

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

  1.  True
  2. False

Qestion

The STAR schema used for data design is a __________ consisting of fact and dimension tables.
Select correct option:

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

Qestion

Data Warehouse provides the best support for analysis while OLAP carries out the _________ task.
Select correct option:

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

Qestion

Virtual cube is used to query two similar cubes by creating a third “virtual” cube by a join between two cubes.
Select correct option:

  1.  True
  2.  False

Qestion

Data warehousing and on-line analytical processing (OLAP) are _______ elements of decision support system.
Select correct option:

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

Qestion

Data mining uses _________ algorithms to discover patterns and regularities in data.
Select correct option:

  1. Mathematical
  2. Computational
  3. Statistical
  4. None of these

Qestion

The goal of ___________ is to look at as few blocks as possible to find the matching records(s).
Select correct option:

  1. Indexing
  2. Partitioning
  3. Joining
  4. None of these

Qestion

An optimized structure which is built primarily for retrieval, with update being only a secondary consideration is
Select correct option:

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

Qestion

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

  1. Dense Index
  2. Sparse Index
  3. Inverted Index
  4. None of these

Qestion

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
Select correct option:

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

Qestion

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.
Select correct option:

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

Qestion

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

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

Qestion

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.
Select correct option:

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

Qestion

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 plus ‘b’ I/Os for each data block then the total cost of accessing table-B is _____________ logical I/Os approximately.
Select correct option:

  1. (a + b)M
  2. (a – b)M
  3. (a + b + M)
  4. (a * b * M)

Qestion

________ is the technique in which existing heterogeneous segments are reshuffled, relocated into homogeneous segments.
Select correct option:

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

Qestion

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

Qestion

_______________, 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 these

Qestion

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

Qestion

 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

Qestion

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 these

Qestion

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

Qestion

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 these

Qestion

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

  1. Mathematical
  2. Computational
  3. Statistical
  4. None of these

Qestion

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 these

Qestion

_______________, 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 these

Qestion

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 these

Qestion

_______________, 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 these

Qestion

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 plus ‘b’ I/Os for each data block then the total cost of accessing table-B is _____________ logical I/Os approximately.

  1. (a + b)M
  2. (a – b)M
  3. (a + b + M)
  4. (a * b * M)

Qestion

With data mining, the best way to accomplish this is by setting aside some of your data in a ________ 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 validity.

  1. Cell
  2. Disk
  3. Folder
  4. Vault

Qestion

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 these

Qestion

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. Compute Science
  4. none of these

Qestion

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

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

Qestion

To identify the __________________ required we need to perform data profiling

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

Qestion

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
  3. Rolled Froward
  4. Database

Qestion

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. None of these
  3. Internal
  4. External

Qestion

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

  1. True
  2. False

Qestion

____________ 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 these

Qestion

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

  1. True
  2. False

Qestion

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

Qestion

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

Qestion

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

  1. File
  2. Application
  3. Aggregate
  4. Database

Qestion

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. lg (n)
  4. n

Qestion

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

  1. I Only
  2. II Only
  3. Both I & II
  4. None of I & II

Qestion

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.

  1. Pipeline Parallelism
  2. Overlapped Parallelism
  3. Massive Parallelism
  4. Distributed Parallelism

Qestion

Non uniform distribution, when the data is distributed across the processors, is called ______.

  1. Skew in Partition
  2. Pipeline Distribution
  3. Distributed Distribution
  4. Uncontrolled Distribution

Qestion

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. None of these
  2. Sequentially
  3. In Parallel
  4. Distributed

Qestion

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. Exploratory
  2. Non-Exploratory
  3. Computer Science

Qestion

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

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

Qestion

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

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

Qestion

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

  1. Pearson correlation is the only technique
  2. Euclidean distance is the only technique
  3. Both Pearson correlation and Euclidean distance
  4. None of these

Qestion

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

  1. Tools
  2. Industry
  3. Software
  4. None of these

Qestion

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

  1. Increasing
  2. Decreasing
  3. Maintaining
  4. None of these

Qestion

Focusing on data warehouse delivery only often end up _________.

  1. Rebuilding
  2. Success
  3. Good Stable Product
  4. None of these

Qestion

Pakistanis one of the five major ________ countries in the world.

  1. Cotton-growing
  2. Rice-growing
  3. Weapon Producing

Qestion

_____________ is a process which involves gathering of information about column through execution of certain queries with intention to identify erroneous records.

  1. Data profiling
  2. Data Anomaly Detection
  3. Record Duplicate Detection
  4. None of these

Qestion

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 these

Qestion

DSS queries do not involve a primary key

  1. True
  2. False

Qestion

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

  1. The lack of data integration and standardization
  2. Missing Data
  3. Data Stored in Heterogeneous Sources

Qestion

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

  1. OLE DB
  2. OLAP
  3. OLTP
  4. Data Warehouse

Qestion

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.

  1. Tools
  2. Documentations
  3. Guidelines

Qestion

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 ____________.

  1. Execution of package
  2. Creation of package
  3. Connection of package

Qestion

To judge effectiveness we perform data profiling twice. 

  1. One before Extraction and the other after Extraction
  2. One before Transformation and the other after Transformation
  3. One before Loading and the other after Loading

Qestion

The need to synchronize data upon update is called

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

Qestion

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

Qestion

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

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

Qestion

Which statement is true for De-Normalization?

  1. Redundant data is a performance liability at query time, but is a performance benefit at update time.
  2. Redundant data is a performance benefit at both query time and update time.
  3. Redundant data is a performance liability at both query time and update time.
  4. Redundant data is a performance benefit at query time, but is a performance liability at update time.

Qestion

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

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

Qestion

Pre-computed _______ can solve performance problems

  1. Aggregates  
  2. Facts
  3. Dimensions
  4. Horizontal

Qestion

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

  1. 0 and 1  
  2. 0 and 10
  3. 0 and 100
  4. 0 and 99

Qestion

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

  1. Two  
  2. Three
  3. Four
  4. All

Qestion

NUMA stands for __________

  1. Non-uniform Memory Access
  2. Non-updateable Memory Architecture
  3. New Universal Memory Architecture

Qestion

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 these

No related posts.

Check Also

CS614 Data Warehousing GDB 01 Spring 2013

Total Marks 5 Starting Date Thursday, July 11, 2013 Closing Date Friday, July 12, 2013 …

Leave a Reply

Your email address will not be published. Required fields are marked *

CAPTCHA

*