Mena Sargios
Quiz by , created more than 1 year ago

Algorithms and Data Structures | Test 3 Review | CSCI-3110-002 MTSU

250
0
0
Mena Sargios
Created by Mena Sargios over 7 years ago
Close

10. Hashing Collision

10. Hashing Collision

Question 1 of 16

1

Which probing applies a hash function until it finds an empty space or the key that is sought for?

Select one of the following:

  • Linear

  • none of the above

Explanation

Question 2 of 16

1

What does separate chaining allow for in the case of collisions?

Select one of the following:

  • Allows the hash table to accommodate more than one item in the same location

  • none of the above

Explanation

Question 3 of 16

1

Pick a correct example of Quadratic Probing increments:

Select one of the following:

  • A) 1, 2^2, 3^3, etc

  • B) 2^0, 2^1, 2^2, etc

  • C) 1^2, 2^2, 3^2, etc

  • D) 1^1, 2^2, 3^3, etc

Explanation

Question 4 of 16

1

What are two ways to handle hashing collisions?

Select one of the following:

  • 1.Move down one at a time till a free space is found.
    2.Move down n^2 where n is how many times you have collided and moved.

  • none of the above

Explanation

Question 5 of 16

1

what is a hash collision?

Select one of the following:

  • A,two distinct pieces of data have the same hash value

  • B.two distinct pieces of data have the different hash value

  • C.it hold 3 values at once

  • D.none of the above

Explanation

Question 6 of 16

1

Separate Chaining allows the hash table to accommodate more than one item in the same location.

Select one of the following:

  • True
  • False

Explanation

Question 7 of 16

1

Double Hasing uses two has functions what does each do?

Select one of the following:

  • one specifies the first location, the other gives the step size.

  • none of the above

Explanation

Question 8 of 16

1

Which type of probing searches the hash table at the beginning at the
original specified by the hash function and continuing at increments
of 1^2, 2^2, 3^2, ...?

Select one of the following:

  • A) Linear Probing

  • B) Square Probing

  • C) Polynomial Probing

  • D) Quadratic Probing

Explanation

Question 9 of 16

1

What does Separate Chaining do?

Select one of the following:

  • Allows the hash table to accommodate more than one item in the same location (each location is a linked list). This makes the hash table dynamic

  • none of the above

Explanation

Question 10 of 16

1

What searches the hash table sequentially, starting from the original locatiom specified by the hash function?

Select one of the following:

  • A. Linear Probing

  • B. Bilinear Probing

  • C. Circular Probing

  • D. Alien Probing

Explanation

Question 11 of 16

1

What is separate chaining?

Select one of the following:

  • A) Each location in a hash table is a linked list. Effectively, it's dynamic.

  • B) Making each has table a linked list

  • C) None of the above

Explanation

Question 12 of 16

1

Which of the following is NOT a type of collision handling?

Select one of the following:

  • A. Separate chaining

  • B. Linear probing

  • C. Double Hashing

  • D. Trigonometic probing

Explanation

Question 13 of 16

1

In separate chaining, what is the load factor?

Select one of the following:

  • A. the load factor is the average length of all the lists, including the lists with the length of zero

  • B. the load factor is the shortest length of all the lists, including the lists with the length of zero

  • C. the load factor is the longest length of all the lists, including the lists with the length of zero

  • D. the load factor is the average length of all the lists, excluding the lists with the length of zero

Explanation

Question 14 of 16

1

When using separate chaining for collision handling in a hash table the load factor is the average length of all of the list.

Select one of the following:

  • True
  • False

Explanation

Question 15 of 16

1

collision resolution schemes that probe for an empty, or open, location in the hash table

Select one of the following:

  • True
  • False

Explanation

Question 16 of 16

1

What is the difference between separate chaining and open addressing?

Select one of the following:

  • Separate chaining uses linked lists as each index of the has table, and pushes older entries back from the front when new entries are provided. Open adressing uses two types of probing (linear and quadratic) to find an open location within the hash table.

  • none of the above

Explanation

Previous
Check answer
Next