adplus-dvertising
frame-decoration

Question

Hashing technique which allocates fixed number of buckets is classified as

a.

dynamic hashing

b.

static hashing

c.

external hashing

d.

internal hashing

Answer: (c).external hashing

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Hashing technique which allocates fixed number of buckets is classified as

Similar Questions

Discover Related MCQs

Q. If ' h ' is a hashing function and it is used to hash ' n ' keys into a table of size ' m ' where n <= m . What is the expected number of collisions involving a particular key ' x ' ?

Q. How many different insertion sequences of the key values using the same hash function and linear probing will result in the hash table shown above?

Q. What is the maximum number of ways in which a boolean expression with n + 1 terms can be parenthesized, such that the output is true?

Q. Which of the following gives the total number of ways of parenthesizing an expression with n + 1 terms?

Q. Consider the expression T | F ∧ T. In how many ways can the expression be parenthesized so that the output is F (false)?

Q. Consider the expression T & F ∧ T. What is the number of ways in which the expression can be parenthesized so that the output is T (true)?

Q. Consider the expression T & F | T. What is the number of ways in which the expression can be parenthesized so that the output is T (true)?

Q. You are given a boolean expression which consists of operators &, | and ∧ (AND, OR and XOR) and symbols T or F (true or false). You have to find the number of ways in which the symbols can be parenthesized so that the expression evaluates to true. This is the boolean parenthesization problem. Which of the following methods can be used to solve the problem?

Q. What is space complexity of the above dynamic programming implementation of the dice throw problem where f is the number of faces, n is the number of dice and s is the sum to be found?

Q. What is time complexity of the above dynamic programming implementation of the dice throw problem where f is the number of faces, n is the number of dice and s is the sum to be found?

Q. There are 10 dice having 5 faces. The faces are numbered from 1 to 5. What is the number of ways in which a sum of 4 can be achieved?

Q. There are n dice with f faces. The faces are numbered from 1 to f. What is the maximum possible sum that can be obtained when the n dice are rolled together?

Q. There are n dice with f faces. The faces are numbered from 1 to f. What is the minimum possible sum that can be obtained when the n dice are rolled together?

Q. You have 2 dice each of them having 6 faces numbered from 1 to 6. What is the number of ways in which a sum of 11 can be achieved?

Q. You have 3 dice each having 6 faces. What is the number of permutations that can be obtained when you roll the 3 dice together?

Q. You have n dice each having f faces. What is the number of permutations that can be obtained when you roll the n dice together?

Q. You are given n dice each having f faces. You have to find the number of ways in which a sum of S can be achieved. This is the dice throw problem. Which of the following methods can be used to solve the dice throw problem?

Q. What is the sum of each of the balanced partitions for the array {5, 6, 7, 10, 3, 1}?

Q. Consider a variation of the balanced partition problem in which we find two subsets such that |S1 – S2| is minimum. Consider the array {1, 2, 3, 4, 5}. Which of the following pairs of subsets is an optimal solution for the above problem?

Q. What is the time complexity of the brute force algorithm used to solve the balanced partition problem?