We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More

Quiz-3 Dated: Jan 29, 15

Dear Students,

It is intimated that you are going to appear for the third quiz of CS614 on 3rd of February 2015, which will open for two days. The quiz will start on 3rd of February 2015 and end on 4th of February 2015. The quiz will have questions from lecture 23 to lecture 28.

For any query: CS614@vu.edu.pk

Instructor CS614

+ Click Here To Join also Our facebook study Group.

..How to Join Subject Study Groups & Get Helping Material?..


See Your Saved Posts Timeline

Views: 3629

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

Replies to This Discussion

The quiz will have questions from lecture 23 to lecture 28.

Share ur quiz here.

.

Please all students related this subject Share your online Quizzes here to help each other.thanks

 

Please share the question and their answers of this quiz if anyone has done.
Thanks. 

CS-614 Quiz # 3 fall 2014

______ index stores first value in each block in the sequential file and a pointer to the block.
Sparse
Dense
B-Tree
Hash
If a task takes “T” time units to execute on a single data item, then execution of this task on “N” data items will take _______ time units.
N*T
N/T
N+T
N-T
Bitmap index is appropriate for:
Low cardinality data
High cardinality data
Clustered data
Aggregated data
In B-tree index, the lowest level index blocks are called leaf blocks, and these blocks contain:
NULL value to make the leaf terminal node
Every indexed data value and a corresponding ROWID
Every indexed data value and pointer to next level block
Every indexed data value and pointer to root block
One of the preconditions to decide about operations to be parallelized is that:
Operations can be implemented independent of each other
Output of one operation becomes input of other
Operations share same memory location
Operations share same namespace
In context of nested-loop join, actual number of matching rows returned as a result of the join would be ______ of the order of tables
Dependent
Independent
Superset
Subset
Which of the following is NOT one of the parallel hardware architectures?
Symmetric Multi Processing
Massively Parallel Processing
Non-uniform Memory Access
Shared Memory
In context of data parallelism, the work done by query processor should be:
Almost zero
Maximum
Pipelined
Filtered across partitions
Which of the following is not an activity of Data Quality Analysis Project?
“Define”
“Measure”
“Analyze”
“Compression”
The optimizer uses a hash join to join two tables if they are joined using an equijoin and
Outer table has less number of rows
Inner table has less number of rows
Cardinality of tables is equal
Large amount of data needs to be joined
In context of data parallelism, to get a speed-up of N with N partitions, it must be ensured that:
There are enough computing resources
Query-coordinator is very fast as compared to query servers
Work done in each partition almost same
All of the given options
An optimized structure which is built primarily for retrieval, with update being only a secondary consideration is
OLTP
OLAP
DSS
Inverted Index
_________ lists each term in the collection only once and then shows a list of all the documents that contain the given term.
Inverted Index
Bitmap index
Cluster index
Join index
Parallelism can be exploited, if there is:
Symmetric multi-processors (SMP)
Sufficient I/O bandwidth
Underutilized or intermittently used CPUs
All of the given options
_______ do not (typically) keep the index values in sorted order
Dense index
Sparse index
B-Tree index
Hash based index
A join is identified by multiple tables in the ____ clause
FROM
SELECT
GROUP BY
SORT BY

For Preparation 

1_ In context of data parallelism, the work done by query processor should be:

Maximum

2_  _______ do not (typically) keep the index values in stored order

Hash based index

3_ if every key in the data is represented in the index file then it is called

Dense index

4_ In context of bitmap index, the length of the bit vector is: 

the number of records in the base table 

5_ In context of joining tables, the join condition is specified in _____ clause.

WHERE

6_ A join is identified by multiple tables in the  _____ clause.

From 

7_  Parallelism can be exploited, if there is:

All of the given options    

8_ In ____ index, the ith bit is set to "1" if the ith row of the base table has the value for the indexed column.

Bitmap index

9_ As the number of processors increase, the speedup should also increase. thus we should have linear speedup. Which of the following is NOT the one of the barriers

 to achieve this linear speed-up?

Amdah'l Law  not sure 

10_ Bitmap index is appropriate for:

Low cardinality data 

 

Q1:   in context of nested-loop join, actual number os matching rows returned as a result of the join would be ________ of the order of tables.
Independent.

Q2:  Which of the following is NOT one of the parallel hardware architecture?
Shared Memory

Q3: If resources increase in proportion to increase in data size. time is constant’. The statement refers to:
Scale-Up

Q4: If every key in the data file is represented in the index file then it is called?
Dense Index

Q5: In context of data parallelism, to get a speed-up of N with N partitions, it must be ensured that.
All

Q6: In nested-loop join case, if there are ‘M’ rows in outer table and N rows in inner table, time complexity is.
o(MN)

Q7: The goal of__________ is to look at as few blocks as possib le to find the matching records(s).
Indexing

Q8: Parallelism can be exploited, if there is.
All of the given options

Q9: If we apply Run Length Encoding on the input “11001100”, the output will be.
21#20#21#20

Q10: Which of the following is NOT one of the variants of Nested-loop join?
Binary index nested-loop join.

Q11: In context of data parallelism, the work done by query processor should be:
Maximum.

Q12: ___________ do not (typically) keep the index values in sorted oreder
Hash based Index

Q13: if every key the data file is represented in the index file then it is called.
Dense Index

Q14: In context of bitmap index, the length of the bit vector is: 
The number of records in the base table

Q15; In context of joining tables, the join condition is specified in ______ clause:
Where

Q16: A join is identified by multiple tables in the________ clause.
From

Q17: Parallelism can exploited, if there is 
All of the given options

Q18: In ________ index, the ith bit is set to “1” if the ith row of the base table has the value for the index column
Bitmap index

Q19: As the number of processors increase, the speedup should also increase. Thus we should have linear speedup. Which of the following is NOT one of the barriers to achieve this linear speed-up?
Amdahl’ Law

Q20: Bitmap index is appropriate for:
Low cardinality data

Q21: If a task takes “T” time units to execute on a single data item, then execution of the task on “N” data items will take______ time units?
N*T

Q22: _________ lists each term in the collection only once and then shows a list of all the documents the contain the given term.
Inverted index

Q23: “More resources means proportionally less time for given amount of data”. The statement refers to:
Speed-UP

Q24: In context of data parallelism, to get a speed-up of N with N partitions, it must be ensured that:
All of the given option

Q25: In context of bitmap index, the length of the bit vector is 
the number of records in the base table.

Q26: One of the preconditions to decide about operations to be parallelized is that: 
Operation can be implemented independent of each other

Q27: A_________ index, if fits in the memory, costs only one disk I/O access to locate a record given a key.
Dense Index

Q28: In context of nested-loop join, actual number of matching rows returned as a result of the join would be ___ of the order of tables 
Independent

Q29: __________ refers to “ Parallelexectution of single data operation across multiple partitions of data”
 Data Parallelism.


 

 

 

A join is identified by multiple tables in the _ FROM ___ clause

In context of joining tables, the join condition is specified in _ WHERE ___ clause

The goal of ______ ing Goal _____ is to look at as few blocks as possible to find the matching records(s).

__ Sparse Index _____ index uses even less space than __ dense ____ index, but the block has to be searched, even for unsuccessful searches.

In context of data parallelism, to get a speed-up of N with N partitions, it must be ensured that:

If we apply Run Length Encoding on the input “11001100”, the output will be:

In B-tree index, the lowest level index blocks are called leaf blocks, and these blocks contain:

every indexed data value and a corresponding ROWID

 

 

___ Sparse Index ___ index stores first value in each block in the sequential file and a pointer to the block

 

1_ In context of data parallelism, the work done by query processor should be:

Maximum

2_  _______ do not (typically) keep the index values in stored order

Hash based index

3_ if every key in the data is represented in the index file then it is called

Dense index

4_ In context of bitmap index, the length of the bit vector is: 

the number of records in the base table 

5_ In context of joining tables, the join condition is specified in _____ clause.

WHERE

6_ A join is identified by multiple tables in the  _____ clause.

From 

7_  Parallelism can be exploited, if there is:

All of the given options    

8_ In ____ index, the ith bit is set to "1" if the ith row of the base table has the value for the indexed column.

Bitmap index

9_ As the number of processors increase, the speedup should also increase. thus we should have linear speedup. Which of the following is NOT the one of the barriers

 to achieve this linear speed-up?

Amdah'l Law  not sure 

10_ Bitmap index is appropriate for:

Low cardinality data 

 

Q1:   in context of nested-loop join, actual number os matching rows returned as a result of the join would be ________ of the order of tables.
Independent.

Q2:  Which of the following is NOT one of the parallel hardware architecture?
Shared Memory

Q3: If resources increase in proportion to increase in data size. time is constant’. The statement refers to:
Scale-Up

Q4: If every key in the data file is represented in the index file then it is called?
Dense Index

Q5: In context of data parallelism, to get a speed-up of N with N partitions, it must be ensured that.
All

Q6: In nested-loop join case, if there are ‘M’ rows in outer table and N rows in inner table, time complexity is.
o(MN)

Q7: The goal of__________ is to look at as few blocks as possib le to find the matching records(s).
Indexing

Q8: Parallelism can be exploited, if there is.
All of the given options

Q9: If we apply Run Length Encoding on the input “11001100”, the output will be.
21#20#21#20

Q10: Which of the following is NOT one of the variants of Nested-loop join?
Binary index nested-loop join.

Q11: In context of data parallelism, the work done by query processor should be:
Maximum.

Q12: ___________ do not (typically) keep the index values in sorted oreder
Hash based Index

Q13: if every key the data file is represented in the index file then it is called.
Dense Index

Q14: In context of bitmap index, the length of the bit vector is: 
The number of records in the base table

Q15; In context of joining tables, the join condition is specified in ______ clause:
Where

Q16: A join is identified by multiple tables in the________ clause.
From

Q17: Parallelism can exploited, if there is 
All of the given options

Q18: In ________ index, the ith bit is set to “1” if the ith row of the base table has the value for the index column
Bitmap index

Q19: As the number of processors increase, the speedup should also increase. Thus we should have linear speedup. Which of the following is NOT one of the barriers to achieve this linear speed-up?
Amdahl’ Law

Q20: Bitmap index is appropriate for:
Low cardinality data

Q21: If a task takes “T” time units to execute on a single data item, then execution of the task on “N” data items will take______ time units?
N*T

Q22: _________ lists each term in the collection only once and then shows a list of all the documents the contain the given term.
Inverted index

Q23: “More resources means proportionally less time for given amount of data”. The statement refers to:
Speed-UP

Q24: In context of data parallelism, to get a speed-up of N with N partitions, it must be ensured that:
All of the given option

Q25: In context of bitmap index, the length of the bit vector is 
the number of records in the base table.

Q26: One of the preconditions to decide about operations to be parallelized is that: 
Operation can be implemented independent of each other

Q27: A_________ index, if fits in the memory, costs only one disk I/O access to locate a record given a key.
Dense Index

Q28: In context of nested-loop join, actual number of matching rows returned as a result of the join would be ___ of the order of tables 
Independent

Q29: __________ refers to “ Parallelexectution of single data operation across multiple partitions of data”
 Data Parallelism.


 

 

 

A join is identified by multiple tables in the _ FROM ___ clause

In context of joining tables, the join condition is specified in _ WHERE ___ clause

The goal of ______ ing Goal _____ is to look at as few blocks as possible to find the matching records(s).

__ Sparse Index _____ index uses even less space than __ dense ____ index, but the block has to be searched, even for unsuccessful searches.

In context of data parallelism, to get a speed-up of N with N partitions, it must be ensured that:

If we apply Run Length Encoding on the input “11001100”, the output will be:

In B-tree index, the lowest level index blocks are called leaf blocks, and these blocks contain:

every indexed data value and a corresponding ROWID

 

 

___ Sparse Index ___ index stores first value in each block in the sequential file and a pointer to the block

 

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 _______.
Validity
Security
Integrity 
None of above 

The automated, prospective analyses offered by data mining move beyond the analyses of past events provided by _____________ tools typical of decision support systems.
Introspective
Intuitive
Reminiscent
Retrospective

The technique that is used to perform these feats in data mining is called modeling, and this act of model building is something that people have been doing for a long time, certainly before the _________ of computers or data mining technology.
Access
Advent
Ascent
Avowal

Classification consists of examining the properties of a newly presented observation and assigning it to a predefined ____________.
Object 
Container 
Subject 
Class

During business hours, most ______ systems should probably not use parallel execution.
OLAP
DSS
Data Mining
OLTP


In contrast to statistics, data mining is ______ driven.
Assumption
Knowledge 
Human 
Database



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. 
Furrow
Streak
Trough
Vein


As opposed to the outcome of classification, estimation deal with __________ valued outcome.
Discrete
Isolated
Continuous
Distinct

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.
In Parallel
Distributed
Sequentially
None of above


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.
OLTP
OLAP
DSS
DWH

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.
Larger 
Smaller
Unambiguous
Superior

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

Indexing
Partitioning
Joining 
None of above



In nested-loop join case, if there are ‘M’ rows in outer table and ‘N’ rows in inner table, time complexity is
O (M log N)
O (log MN)
O (MN)
O (M + N)


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.
Furrow
Streak
Trough
Vein


The technique that is used to perform these feats in data mining is called modeling, and this act of model building is something that people have been doing for a long time, certainly before the _________ of computers or data mining technology. 
Access
Advent
Ascent
Avowal

There are many variants of the traditional nested-loop join. If there is an index and that index is exploited, then it is called
Naive nested-loop join
Index nested-loop join
Temporary index nested-loop join
None of these

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
Non-Exploratory
Exploratory
Computer Science
None of these

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.
Cell 
Disk 
Folder
Vault

The automated, prospective analyses offered by data mining move beyond the analyses of past events provided by _____________ tools typical of decision support systems.
Introspective
Intuitive
Reminiscent
Retrospective

There are many variants of the traditional nested-loop join. When the entire table is scanned it is called
Index nested-loop join
Naive nested-loop join
Temporary index nested-loop join
None of these

As opposed to the outcome of classification, estimation deal with __________ valued outcome.
Discrete
Isolated
Continuous
Distinct

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.
OLTP
OLAP
DSS
DWH

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 _______.
Validity
Security
Integrity
None of these



In contrast to statistics, data mining is ______ driven.
Assumption
Knowledge
Human
Database

The goal of ___________ is to look at as few blocks as possible to find the matching records(s).
Indexing
Partitioning
Joining
None

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

Dense Index
Sparse Index
Inverted Index
None

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

OLTP
OLAP
DSS
inverted Index

Which of the following is not an “Orr’s Law of Data Quality”?

Data that is not used cannot be correct!”
Data quality is a function of its use, not its co
Data will be no better than its most stringent use!”
Data duplication can be harmful for the organization!”

During business hours, most ______ systems should probably not use parallel execution.
OLAP
DSS
Data Mining
OLTP

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

An Inverted Index
A Sparse Index
A Dense Index
None of these
_______________, if too big and does not fit into memory, will be expensive when used to find a record by given key.

An Inverted Index
A Sparse Index
A Dense Index
None of these

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

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

Which of the following is not an activity of Data Quality Analysis Project?

“Define”
Measure”
Analyze”
“Compression”

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 in parallel, the greater the scalability of the computation.

Smaller 
Larger 
Shorter 
None


The automated, prospective analyses offered by data mining move beyond the analyses of past events provided by retrospective tools typical of ______________ .
OLTP
OLAP
Decision Support Systems
None of these

Data mining, the ________ of hidden predictive information from large databases, is a powerful new technology with great potential to help companies focus on the most important information in their data warehouses.
Extraction
Insertion
Inclusion
Enclosure


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

Question # 4 of 10 ( Start time: 10:33:23 PM ) Total Marks: 1
If every key in the data file is represented in the index file then index is
Select correct option:
Dense Index
Sparse Index
Inverted Index
None of these

Question # 5 of 10 ( Start time: 10:34:47 PM ) Total Marks: 1
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:
Naive nested-loop join
Index nested-loop join
Temporary index nested-loop join
None of these

Question # 6 of 10 ( Start time: 10:36:08 PM ) Total Marks: 1
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:
OLTP
OLAP
DSS
DWH

Question # 7 of 10 ( Start time: 10:37:30 PM ) Total Marks: 1
A dense index, if fits into memory, costs only ______ disk I/O access to locate a record by given key.
Select correct option:
One
Two
Linear
Quadratic

Question # 8 of 10 ( Start time: 10:38:29 PM ) Total Marks: 1
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:
Furrow
Streak
Trough
Vein

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
Larger
Smaller
Unambiguous
Superior

_______________, if fits into memory, costs only one disk I/O access to locate a record by given key.
An Inverted Index
A Sparse Index
A Dense Index
None of these

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.
Base
Drive 
File 
Log 

The automated, prospective analyses offered by data mining move beyond the analyses of past events provided by _____________ tools typical of decision support systems.
Introspective
Intuitive
Reminiscent
Retrospective

If every key in the data file is represented in the index file then index is
Dense Index
Sparse Index
Inverted Index
None of these

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

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 _______.
Validity
Security
Integrity
None of these

Data mining uses _________ algorithms to discover patterns and regularities in data.
Mathematical
Computational
Statistical
None of these

The goal of ___________ is to look at as few blocks as possible to find the matching records(s).
Indexing
Partitioning
Joining
None of these

_______________, if too big and does not fit into memory, will be expensive when used to find a record by given key.
An Inverted Index
A Sparse Index
A Dense Index
None of these


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
Naive nested-loop join
Index nested-loop join
Temporary index nested-loop join
None of these

_______________, if fits into memory, costs only one disk I/O access to locate a record by given key.
An Inverted Index
A Sparse Index
A Dense Index
None of these
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.
In Parallel
Distributed
Sequentially
None of these


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

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..
OLTP
OLAP
DSS
DWH

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

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

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.
OLTP
OLAP
DSS
DWH 


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
Naive nested-loop join
Index nested-loop join
Temporary index nested-loop join 
None of these

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.
Furrow
Streak
Trough
Vein

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.
Cell
Disk
Folder
Vault

The automated, prospective analyses offered by data mining move beyond the analysis of past 
events provided by respective tools typical of ___________. 
OLTP 
OLAP 
Decision Support systems
None of these 

There are many variants of the traditional nested-loop join, if there is an index is exploited, then it is called…… 
Naïve nested loop join index 
Nested loop join temporary index 
Index nested-loop joins

 

 +..SANA..+ Thx for sharng sis 

RSS

Latest Activity

Shine--Ex-VUStudent liked +++Amara+++++'s discussion Subha -Shaam ki
2 minutes ago
Javeria Nazir updated their profile
33 minutes ago
+++Amara+++++ liked Sharal Khan's blog post ALLAH.........
1 hour ago
+ M.Tariq Malik liked 2.O's discussion Pakistani Currency :P :P
2 hours ago
+ M.Tariq Malik liked 2.O's discussion Cocomo mujhe bhi doo :P :P
2 hours ago
+ M.Tariq Malik liked + ⭐️ Singer ⭐️'s discussion Choose 3 Ning friends to finish this.
2 hours ago
Sharal Khan posted blog posts
2 hours ago
Mano Bilii updated their profile
2 hours ago

Today Top Members 

© 2019   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service