Best posts made by zareen

zareen

Final Term Papers Solved

zareen

Bahauddin Zakariya University BZU Ba Bsc Result 2019 Part 1, 2

Please Check Result by visiting given link:

BZU BA/BSc Result Link 1
BZU BA/BSc Result Link 2

zareen

… is a merger of two giant platforms.

Elanner
Odesk
Upwork
Fiverr

zareen

The Java JAR file “ubnt-discovery-v2.5.1.jar” could not be launched.

zareen

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 ﬁle is represented in the index ﬁle 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