Hashing and Sorting Quiz

Which step is NOT part of the basic algorithm for inserting an item using hashing?

• Input the key.

• Calculate the hash value using a hash function.

• Sort the array after insertion.

• Store the key in the array location pointed to by the hash value.

What happens if the calculated hash value points to a location that already contains a different key?

• The key is overwritten.

• The collision must be resolved using techniques like chaining or open addressing.

• The key is discarded.

• The hash function recalculates the value until an empty spot is found.

Which of the following is NOT a use case of hashing?

• Table lookup or data comparison tasks.

• Sorting elements in an array.

• Detecting duplicated records in a large file.

• Indexing for efficient database searches.

When using a hash function, what is the term for the large original data being converted?

• Hash code.

• Key.

• Index.

• Array.

What is the first step in the algorithm for retrieving or searching for a key using hashing?

• Calculate the hash value.

• Input the key.

• Compare the key with stored values.

• Start a linear search in the array.

Bubble sort is also known as ______________ sort

• Linear.

• Exchange.

• Binary

• Divide

Insertion sort algorithm works on the basis of placing a key in the appropriate position.

• False.

• True.

Which of the following is NOT TRUE about Bubble sort.

• It repeatedly goes through the list to be sorted.

• Compares each pair of adjacent items and swaps them if they are in the wrong order.

• The bubble sort knows that it is finished when it examines the entire array and no "swaps" are needed.

• It uses Divide and Conquer approach

Merge sort uses which of the following technique to implement sorting?

• Backtracking
  

• Greedy algorithm
  

• Divide and conquer
  

• Dynamic programming

What will be the number of passes to sort the elements using insertion sort?
14, 12,16, 6, 3, 10

• 6

• 5

• 7

• 1