3_ Bill Inmon argues that requirements are well understood only after
Data warehouse is populated _ pg285

Bill Inmon argues that requirements are well understood only after:

“a thorough examination of the business processes and objectives.”

Inmon emphasizes that understanding the business processes and objectives is crucial for designing an effective data warehouse. This thorough examination ensures that the data warehouse aligns with the actual needs and goals of the organization, leading to a more effective and relevant system.

4_ Goal driven approach of data warehouse development was result of ______ work
Böhnlein and Ulbrich-vom _ pg285

The goal-driven approach to data warehouse development resulted from Bill Inmon’s work.

Bill Inmon, often referred to as the “father of data warehousing,” advocated for a methodical, top-down approach to data warehouse development. This approach focuses on defining business goals and requirements first and then designing the data warehouse to meet these needs. It emphasizes the importance of a clear understanding of business objectives and data requirements before designing and implementing the data warehouse.

In contrast, Ralph Kimball’s approach is known for its bottom-up methodology, which focuses on building data marts first and then integrating them into a comprehensive data warehouse. Both approaches have their own merits, but Inmon’s goal-driven approach is specifically recognized for its emphasis on aligning data warehouse development with business goals and objectives.

1_ As per Bill Inmost, a data warehouse, in contrast with classical applications is:

Data driven _ pg285

According to Bill Inmon, a prominent figure in the field of data warehousing, a data warehouse is distinguished from classical applications by several key characteristics:

1. Subject-Oriented: Data warehouses are designed around key subjects or business areas (such as sales, finance, or customer information), rather than focusing on individual applications or processes.

2. Integrated: Data in a data warehouse is collected from multiple sources and is integrated into a consistent format. This integration allows for unified reporting and analysis across the organization.

3. Time-Variant: Data warehouses store historical data, allowing users to analyze trends and changes over time. This time dimension is crucial for tracking business performance and making long-term decisions.

4. Non-Volatile: Once data is entered into a data warehouse, it is not typically updated or deleted. This ensures that the data remains stable and can be used for historical analysis without being altered.

5. Optimized for Querying and Reporting: Unlike classical applications, which are optimized for transaction processing, data warehouses are optimized for complex queries and analysis. This optimization allows for efficient reporting and decision-making.

In summary, according to Bill Inmon, a data warehouse is subject-oriented, integrated, time-variant, non-volatile, and optimized for querying and reporting, distinguishing it from classical applications that are more focused on transaction processing and operational tasks.

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

The following are variants of the nested-loop join:

1. Basic Nested-Loop Join: A straightforward nested-loop join where for each tuple in the outer relation, the inner relation is scanned entirely.

2. Block Nested-Loop Join: Instead of processing one tuple at a time, this method processes a block of tuples from the outer relation, which can reduce the number of disk I/O operations.

3. Index Nested-Loop Join: This variant uses an index on the inner relation to quickly find matching tuples, which can significantly speed up the join operation.

NOT a variant:

4. Hash Join: This is not a variant of the nested-loop join. Instead, it’s a different join algorithm that uses a hash table to partition one or both of the relations before performing the join.

So, Hash Join would be the correct answer if you’re asked which one is not a variant of the nested-loop join.

Data driven _ pg285

2_ Which of the following is NOT one of the three parallel tracks in Kimball’s approach?
Lifecycle Maintenance track

3_ Bill Inmon argues that requirements are well understood only after
Data warehouse is populated _ pg285

4_ Goal driven approach of data warehouse development was result of ______ work
Böhnlein and Ulbrich-vom _ pg285

5_ Identify the TRUE statement:
Clustering is unsupervised learning and classification is supervised learning _ pg 270

6_ Normally the term “DWH face to the business user” refers to:
Lifecycle Analytical Applications track _ pg 306

7_ In ________learning you don’t know the number of clusters and no idea about their attributes.
Unsupervised learning
https://www.cs.uic.edu/~liub/teach/cs583-fall-05/CS583-unsupervised-learning.ppt

8_ Waterfall model is appropriate when
Requirements are clearly defined _ pg 284

9_ Implementation of a data warehouse requires ________ activities.
none of above

10_ Normally the input data structure (a database table) for a data mining algorithm:
Has more number of records than attributes (not sure)

Question # 1 of 10 ( Start time: 04:09:48 PM ) Total Marks: 1
In nested-loop join case, if there are ‘M’ rows in outer table and ‘N’ rows in inner table, time complexity is
Select correct option:

O(MN) (Correct)

Quiz Start Time: 04:09 PM Time Left 35
sec(s)

Question # 2 of 10 ( Start time: 04:11:20 PM ) Total Marks: 1
In context of data mining definition, the term “value” means:
Select correct option:

importance of hidden perameters discovered (Correct)

Quiz Start Time: 04:09 PM Time Left 56
sec(s)

Question # 3 of 10 ( Start time: 04:12:51 PM ) Total Marks: 1
Classification consists of examining the properties of a newly presented observation and assigning it to a predefined ____________.
Select correct option:

Class (Correct)

Quiz Start Time: 04:09 PM Time Left 25
sec(s)

Question # 4 of 10 ( Start time: 04:13:44 PM ) Total Marks: 1
The optimizer uses a hash join to join two tables if they are joined using an equijoin and
Select correct option:

Large amount of data need to be joined (Correct)
A large amount of data needs to be joined.
A large portion of the table needs to be joined.

Quiz Start Time: 04:09 PM Time Left 20
sec(s)

Question # 5 of 10 ( Start time: 04:15:07 PM ) Total Marks: 1
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
Select correct option:

Independent (Correct)

Quiz Start Time: 04:09 PM Time Left 13
sec(s)

Question # 6 of 10 ( Start time: 04:16:36 PM ) Total Marks: 1
Normally the input data structure (a database table) for a data mining algorithm:
Select correct option:

Quiz Start Time: 04:09 PM Time Left 12
sec(s)

Question # 7 of 10 ( Start time: 04:18:07 PM ) Total Marks: 1
Mining multi dimensional databases allow users to:
Select correct option:

Analyze Data (Correct)

Quiz Start Time: 04:09 PM Time Left 24
sec(s)

Question # 8 of 10 ( Start time: 04:19:38 PM ) Total Marks: 1
________ refers to the overall process of discovering useful knowledge from data and data mining refers to a particular step in this process.
Select correct option:

Knowledge discovery in database (Correct)

Quiz Start Time: 04:09 PM Time Left 17
sec(s)

Question # 9 of 10 ( Start time: 04:21:01 PM ) Total Marks: 1
In case of nested-loop join, Inner table is accessed _____ for each qualifying row (or touple) in outer table
Select correct option:

One Time (Correct)

Quiz Start Time: 04:09 PM Time Left 10
sec(s)

Question # 10 of 10 ( Start time: 04:22:32 PM ) Total Marks: 1
In contrast to data mining, statistics is ______ driven.
knowledge (Correct)

Quiz Start Time: 08:50 PM Time Left 55
sec(s)

Question # 1 of 10 ( Start time: 08:50:34 PM ) Total Marks: 1
In context of data mining definition, the term “value” means:
Select correct option:

The primary key of table
The index location of the record
Importance of hidden patterns discovered (Answer)
Numerical or string measure assigned to an attribute

Quiz Start Time: 08:50 PM Time Left 22
sec(s)

Question # 2 of 10 ( Start time: 08:51:23 PM ) Total Marks: 1
Data mining is all about:
Select correct option:

Knowledge discovery in database
Finding hidden patterns in data
Finding relationships in data
All of the given options ( may be Answer)

Quiz Start Time: 08:50 PM Time Left 19
sec(s)

Question # 3 of 10 ( Start time: 08:52:41 PM ) Total Marks: 1
In contrast to statistics, data mining is ______ driven.
Select correct option:

Assumption (Answer)
Knowledge
Human
Database

Quiz Start Time: 08:50 PM Time Left 55
sec(s)

Question # 4 of 10 ( Start time: 08:53:56 PM ) Total Marks: 1
Mining multi dimensional databases allow users to:
Select correct option:

Categorize the data
Analyze the data (Answer)
Summarize the data
All of the given options

Quiz Start Time: 08:50 PM Time Left 18
sec(s)

Question # 5 of 10 ( Start time: 08:54:40 PM ) Total Marks: 1
In context of data mining definition, the term “nontrivial” means:
Select correct option:

Discovering information is a simple task
Discovering information is a complex task
We can not discover information
We simply find things rather than discovery (Answer)

Quiz Start Time: 08:50 PM Time Left 1
sec(s)

Question # 6 of 10 ( Start time: 08:55:56 PM ) Total Marks: 1
Identify the TRUE statement:
Select correct option:

Clustering is unsupervised learning and classification is supervised learning
Clustering is supervised learning and classification is unsupervised learning
Both clustering and classification are unsupervised learning
Both clustering and classification are supervised learning

Quiz Start Time: 08:50 PM Time Left 27
sec(s)

Question # 7 of 10 ( Start time: 08:57:26 PM ) Total Marks: 1
In ________learning you don’t know the number of clusters and no idea about their attributes.
Select correct option:

Supervised learning
Unsupervised learning (Answer)
Multi Dimension modeling
None of the given options

Quiz Start Time: 08:50 PM Time Left 50
sec(s)

Question # 8 of 10 ( Start time: 08:58:39 PM ) Total Marks: 1
In context of clustering, the term “distance” means:
Select correct option:

Similarity/dissimilarly of records (Answer)
The difference between the primary keys of two records
The relation of a record with corresponding record in child table
None of the given options

Quiz Start Time: 08:50 PM Time Left 15
sec(s)

Question # 9 of 10 ( Start time: 08:59:22 PM ) Total Marks: 1
In data mining, initially you _____ what you are looking for.
Select correct option:

Know
Don’t know (Answer)
May or may not know
None of the given options

Quiz Start Time: 08:50 PM Time Left 52
sec(s)

Question # 10 of 10 ( Start time: 09:00:41 PM ) Total Marks: 1
The optimizer uses a hash join to join two tables if they are joined using an equijoin and
Select correct option:

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 (Answer)

System Driven

Highly integrated

Loosely integrated

Tightly decoupled

None of the given

Question # 1 of 10 ( Start time: 04:09:48 PM ) Total Marks: 1
In nested-loop join case, if there are ‘M’ rows in outer table and ‘N’ rows in inner table, time complexity is
Select correct option:

O(MN) (Correct)

Quiz Start Time: 04:09 PM Time Left 35
sec(s)

Question # 2 of 10 ( Start time: 04:11:20 PM ) Total Marks: 1
In context of data mining definition, the term “value” means:
Select correct option:

importance of hidden perameters discovered (Correct)

Quiz Start Time: 04:09 PM Time Left 56
sec(s)

Question # 3 of 10 ( Start time: 04:12:51 PM ) Total Marks: 1
Classification consists of examining the properties of a newly presented observation and assigning it to a predefined ____________.
Select correct option:

Class (Correct)

Quiz Start Time: 04:09 PM Time Left 25
sec(s)

Question # 4 of 10 ( Start time: 04:13:44 PM ) Total Marks: 1
The optimizer uses a hash join to join two tables if they are joined using an equijoin and
Select correct option:

Large amount of data need to be joined (Correct)
A large amount of data needs to be joined.
A large portion of the table needs to be joined.

Quiz Start Time: 04:09 PM Time Left 20
sec(s)

Question # 5 of 10 ( Start time: 04:15:07 PM ) Total Marks: 1
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
Select correct option:

Independent (Correct)

Quiz Start Time: 04:09 PM Time Left 13
sec(s)

Question # 6 of 10 ( Start time: 04:16:36 PM ) Total Marks: 1
Normally the input data structure (a database table) for a data mining algorithm:
Select correct option:

Quiz Start Time: 04:09 PM Time Left 12
sec(s)

Question # 7 of 10 ( Start time: 04:18:07 PM ) Total Marks: 1
Mining multi dimensional databases allow users to:
Select correct option:

Analyze Data (Correct)

Quiz Start Time: 04:09 PM Time Left 24
sec(s)

Question # 8 of 10 ( Start time: 04:19:38 PM ) Total Marks: 1
________ refers to the overall process of discovering useful knowledge from data and data mining refers to a particular step in this process.
Select correct option:

Knowledge discovery in database (Correct)

Quiz Start Time: 04:09 PM Time Left 17
sec(s)

Question # 9 of 10 ( Start time: 04:21:01 PM ) Total Marks: 1
In case of nested-loop join, Inner table is accessed _____ for each qualifying row (or touple) in outer table
Select correct option:

One Time (Correct)

Quiz Start Time: 04:09 PM Time Left 10
sec(s)

Question # 10 of 10 ( Start time: 04:22:32 PM ) Total Marks: 1
In contrast to data mining, statistics is ______ driven.
knowledge (Correct)

Quiz Start Time: 08:50 PM Time Left 55
sec(s)

Question # 1 of 10 ( Start time: 08:50:34 PM ) Total Marks: 1
In context of data mining definition, the term “value” means:
Select correct option:

The primary key of table
The index location of the record
Importance of hidden patterns discovered (Answer)
Numerical or string measure assigned to an attribute

Quiz Start Time: 08:50 PM Time Left 22
sec(s)

Question # 2 of 10 ( Start time: 08:51:23 PM ) Total Marks: 1
Data mining is all about:
Select correct option:

Knowledge discovery in database
Finding hidden patterns in data
Finding relationships in data
All of the given options ( may be Answer)

Quiz Start Time: 08:50 PM Time Left 19
sec(s)

Question # 3 of 10 ( Start time: 08:52:41 PM ) Total Marks: 1
In contrast to statistics, data mining is ______ driven.
Select correct option:

Assumption (Answer)
Knowledge
Human
Database

Quiz Start Time: 08:50 PM Time Left 55
sec(s)

Question # 4 of 10 ( Start time: 08:53:56 PM ) Total Marks: 1
Mining multi dimensional databases allow users to:
Select correct option:

Categorize the data
Analyze the data (Answer)
Summarize the data
All of the given options

Quiz Start Time: 08:50 PM Time Left 18
sec(s)

Question # 5 of 10 ( Start time: 08:54:40 PM ) Total Marks: 1
In context of data mining definition, the term “nontrivial” means:
Select correct option:

Discovering information is a simple task
Discovering information is a complex task
We can not discover information
We simply find things rather than discovery (Answer)

Quiz Start Time: 08:50 PM Time Left 1
sec(s)

Question # 6 of 10 ( Start time: 08:55:56 PM ) Total Marks: 1
Identify the TRUE statement:
Select correct option:

Clustering is unsupervised learning and classification is supervised learning
Clustering is supervised learning and classification is unsupervised learning
Both clustering and classification are unsupervised learning
Both clustering and classification are supervised learning

Quiz Start Time: 08:50 PM Time Left 27
sec(s)

Question # 7 of 10 ( Start time: 08:57:26 PM ) Total Marks: 1
In ________learning you don’t know the number of clusters and no idea about their attributes.
Select correct option:

Supervised learning
Unsupervised learning (Answer)
Multi Dimension modeling
None of the given options

Quiz Start Time: 08:50 PM Time Left 50
sec(s)

Question # 8 of 10 ( Start time: 08:58:39 PM ) Total Marks: 1
In context of clustering, the term “distance” means:
Select correct option:

Similarity/dissimilarly of records (Answer)
The difference between the primary keys of two records
The relation of a record with corresponding record in child table
None of the given options

Quiz Start Time: 08:50 PM Time Left 15
sec(s)

Question # 9 of 10 ( Start time: 08:59:22 PM ) Total Marks: 1
In data mining, initially you _____ what you are looking for.
Select correct option:

Know
Don’t know (Answer)
May or may not know
None of the given options

Quiz Start Time: 08:50 PM Time Left 52
sec(s)

Question # 10 of 10 ( Start time: 09:00:41 PM ) Total Marks: 1
The optimizer uses a hash join to join two tables if they are joined using an equijoin and
Select correct option:

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 (Answer)

Question # 1 of 10 ( Start time: 04:09:48 PM ) Total Marks: 1
In nested-loop join case, if there are ‘M’ rows in outer table and ‘N’ rows in inner table, time complexity is
Select correct option:

O(MN) (Correct)

Quiz Start Time: 04:09 PM Time Left 35
sec(s)

Question # 2 of 10 ( Start time: 04:11:20 PM ) Total Marks: 1
In context of data mining definition, the term “value” means:
Select correct option:

importance of hidden perameters discovered (Correct)

Quiz Start Time: 04:09 PM Time Left 56
sec(s)

Question # 3 of 10 ( Start time: 04:12:51 PM ) Total Marks: 1
Classification consists of examining the properties of a newly presented observation and assigning it to a predefined ____________.
Select correct option:

Class (Correct)

Quiz Start Time: 04:09 PM Time Left 25
sec(s)

Question # 4 of 10 ( Start time: 04:13:44 PM ) Total Marks: 1
The optimizer uses a hash join to join two tables if they are joined using an equijoin and
Select correct option:

Large amount of data need to be joined (Correct)
A large amount of data needs to be joined.
A large portion of the table needs to be joined.

Quiz Start Time: 04:09 PM Time Left 20
sec(s)

Question # 5 of 10 ( Start time: 04:15:07 PM ) Total Marks: 1
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
Select correct option:

Independent (Correct)

Quiz Start Time: 04:09 PM Time Left 13
sec(s)

Question # 6 of 10 ( Start time: 04:16:36 PM ) Total Marks: 1
Normally the input data structure (a database table) for a data mining algorithm:
Select correct option:

Quiz Start Time: 04:09 PM Time Left 12
sec(s)

Question # 7 of 10 ( Start time: 04:18:07 PM ) Total Marks: 1
Mining multi dimensional databases allow users to:
Select correct option:

Analyze Data (Correct)

Quiz Start Time: 04:09 PM Time Left 24
sec(s)

Question # 8 of 10 ( Start time: 04:19:38 PM ) Total Marks: 1
________ refers to the overall process of discovering useful knowledge from data and data mining refers to a particular step in this process.
Select correct option:

Knowledge discovery in database (Correct)

Quiz Start Time: 04:09 PM Time Left 17
sec(s)

Question # 9 of 10 ( Start time: 04:21:01 PM ) Total Marks: 1
In case of nested-loop join, Inner table is accessed _____ for each qualifying row (or touple) in outer table
Select correct option:

One Time (Correct)

Quiz Start Time: 04:09 PM Time Left 10
sec(s)

Question # 10 of 10 ( Start time: 04:22:32 PM ) Total Marks: 1
In contrast to data mining, statistics is ______ driven.
knowledge (Correct)

Quiz Start Time: 08:50 PM Time Left 55
sec(s)

Question # 1 of 10 ( Start time: 08:50:34 PM ) Total Marks: 1
In context of data mining definition, the term “value” means:
Select correct option:

The primary key of table
The index location of the record
Importance of hidden patterns discovered (Answer)
Numerical or string measure assigned to an attribute

Quiz Start Time: 08:50 PM Time Left 22
sec(s)

Question # 2 of 10 ( Start time: 08:51:23 PM ) Total Marks: 1
Data mining is all about:
Select correct option:

Knowledge discovery in database
Finding hidden patterns in data
Finding relationships in data
All of the given options ( may be Answer)

Quiz Start Time: 08:50 PM Time Left 19
sec(s)

Question # 3 of 10 ( Start time: 08:52:41 PM ) Total Marks: 1
In contrast to statistics, data mining is ______ driven.
Select correct option:

Assumption (Answer)
Knowledge
Human
Database

Quiz Start Time: 08:50 PM Time Left 55
sec(s)

Question # 4 of 10 ( Start time: 08:53:56 PM ) Total Marks: 1
Mining multi dimensional databases allow users to:
Select correct option:

Categorize the data
Analyze the data (Answer)
Summarize the data
All of the given options

Quiz Start Time: 08:50 PM Time Left 18
sec(s)

Question # 5 of 10 ( Start time: 08:54:40 PM ) Total Marks: 1
In context of data mining definition, the term “nontrivial” means:
Select correct option:

Discovering information is a simple task
Discovering information is a complex task
We can not discover information
We simply find things rather than discovery (Answer)

Quiz Start Time: 08:50 PM Time Left 1
sec(s)

Question # 6 of 10 ( Start time: 08:55:56 PM ) Total Marks: 1
Identify the TRUE statement:
Select correct option:

Clustering is unsupervised learning and classification is supervised learning
Clustering is supervised learning and classification is unsupervised learning
Both clustering and classification are unsupervised learning
Both clustering and classification are supervised learning

Quiz Start Time: 08:50 PM Time Left 27
sec(s)

Question # 7 of 10 ( Start time: 08:57:26 PM ) Total Marks: 1
In ________learning you don’t know the number of clusters and no idea about their attributes.
Select correct option:

Supervised learning
Unsupervised learning (Answer)
Multi Dimension modeling
None of the given options

Quiz Start Time: 08:50 PM Time Left 50
sec(s)

Question # 8 of 10 ( Start time: 08:58:39 PM ) Total Marks: 1
In context of clustering, the term “distance” means:
Select correct option:

Similarity/dissimilarly of records (Answer)
The difference between the primary keys of two records
The relation of a record with corresponding record in child table
None of the given options

Quiz Start Time: 08:50 PM Time Left 15
sec(s)

Question # 9 of 10 ( Start time: 08:59:22 PM ) Total Marks: 1
In data mining, initially you _____ what you are looking for.
Select correct option:

Know
Don’t know (Answer)
May or may not know
None of the given options

Quiz Start Time: 08:50 PM Time Left 52
sec(s)

Question # 10 of 10 ( Start time: 09:00:41 PM ) Total Marks: 1
The optimizer uses a hash join to join two tables if they are joined using an equijoin and
Select correct option:

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 (Answer)

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

Question # 2 of 10 ( Start time: 10:37:38 PM ) Total Marks: 1
Identify the TRUE statement:
Select correct option:
Clustering is unsupervised learning and classification is supervised learning (Correct)
Clustering is supervised learning and classification is unsupervised learning
Both clustering and classification are unsupervised learning
Both clustering and classification are supervised learning

Question # 3 of 10 ( Start time: 10:38:00 PM ) Total Marks: 1
Waterfall model is appropriate when
Select correct option:
When the budget is low
When the deadline is strict
When resources are limited
Requirements are clearly defined (Correct)

Question # 4 of 10 ( Start time: 10:38:22 PM ) Total Marks: 1
Which of the following is the most ignored step during data warehouse development
Select correct option:
The requirement verification
The vision definition
Schema validation
Success criteria development (Correct)

Question # 5 of 10 ( Start time: 10:38:58 PM ) Total Marks: 1
In ______ phase of a fundamental data warehouse life cycle model, a working model of data warehouse is deployed for a selective set of users
Select correct option:
Design
Prototype (Correct)
Deployment
Operation

Question # 6 of 10 ( Start time: 10:39:19 PM ) Total Marks: 1
One of the drawbacks of waterfall model is that:
Select correct option:
Customers can not review the product during development
It does not work when the resources are limited
It does not define the project timeline/schedule
All of the given options (Correct)

Question # 7 of 10 ( Start time: 10:39:38 PM ) Total Marks: 1
Identify the TRUE statement:
Select correct option:
The data value increases as volume decreases (Correct)
The data value decreases as the volume decreases
The data value is independent of data volume
All of the given options

Question # 8 of 10 ( Start time: 10:39:56 PM ) Total Marks: 1
In contrast to statistics, data mining is ______ driven.
Select correct option:
Assumption
Knowledge (Correct)
Human
Database

Question # 9 of 10 ( Start time: 10:40:48 PM ) Total Marks: 1
In context of data mining definition, the term “value” means:
Select correct option:
The primary key of table
The index location of the record
Importance of hidden patterns discovered (Correct)
Numerical or string measure assigned to an attribute

Question # 10 of 10 ( Start time: 10:41:24 PM ) Total Marks: 1
In context of clustering, the term “distance” means:
Select correct option:
Similarity/dissimilarly of records (Correct)
The difference between the primary keys of two records
The relation of a record with corresponding record in child table
None of the given options