Describe one simple rehashing policy
The simplest rehashing policy is linear probing. Suppose a key K hashes to location i. Suppose other key occupies H[i]. The following function is used to generate alternative locations:
rehash(j) = (j + 1) mod h
where j is the location most recently probed. Initially j = i, the hash code for K. Notice that this version of rehash does not depend on K.
What is a priority queue?
Waiting queue may not operate on a strictly first in first out basis, but on some complex priority scheme based on such factors as what compiler is being used, the execution time required, number of print lines, etc. The resulting queue is called a priority queue.
Give the example of applications in which stacks are used?
The first application majorly deals with the recursion, the second application is a classical and the last one is known as stack machines which chiefly deals with insertion and deletion from the stack.
Advantages and disadvantages of B-star trees over Binary trees?
One of the basic question algorithm and data structure problem which is asked in the algorithm questions. B-star trees have better data structure and are faster in search than Binary trees, but it is more complex than simple binary tree and very hard to maination the B-star treee data structure.