recategorized by
3,171 views

2 Answers

7 votes
7 votes

Informal meanings:-

Blocking factor = Number of records in a block (DBMS terminology)

Load factor = Number of keys associated with each cell/slot/bucket (Hashing terminology)

 

Here, blocking factor would mean each block contains how many buckets.

So, $bfr*N$ gives total number of buckets.

And $\text{total number of buckets} * \text{load factor}$ would give the number of records.

 

So, Option D

2 votes
2 votes

Answer is (d)

In linear hashing, if blocking factor bfr, loading factor l and file buckets N are known, the number of records will be

 

r=i∗bfr∗N

Answer:

Related questions

3 votes
3 votes
3 answers
1
10 votes
10 votes
3 answers
2
Satbir asked Jan 13, 2020
8,556 views
What is the complexity of the following code?sum=0; for(i=1;i<=n;i*=2) for(j=1;j<=n;j++) sum++;Which of the following is not a valid string?$O(n^2)$$O(n\log\ n)$$O(n)$$O(...
5 votes
5 votes
2 answers
3
Satbir asked Jan 13, 2020
4,532 views
Huffman tree is constructed for the following data :$\{A,B,C,D,E\}$ with frequency $\{0.17,0.11,0.24,0.33\ \text{and} \ 0.15 \}$ respectively. $100\ 00\ 01101$ is decoded...
5 votes
5 votes
5 answers
4
Satbir asked Jan 13, 2020
7,670 views
If an array $A$ contains the items $10,4,7,23,67,12$ and $5$ in that order, what will be the resultant array $A$ after third pass of insertion sort?$67,12,10,5,4,7,23$$4,...