Time left 0:39:16 Question 1 Not yet answered Marked out of 1.00 Flag question Question text Given a hash table T with 25 slots that stores 3000 elements, the load factor α for T is a. 0.0083 b. 0.83 c. 75000 d. 120 Clear my choice Question 2 Not yet answered Marked out of 1.00 Flag question Question text Quick sort uses which of the following technique to implement sorting? a. greedy algorithm b. backtracking c. dynamic programming d. divide and conquer e. searching
Question
Time left 0:39:16 Question 1 Not yet answered Marked out of 1.00 Flag question Question text Given a hash table T with 25 slots that stores 3000 elements, the load factor α for T is
a. 0.0083
b. 0.83
c. 75000
d. 120
Clear my choice Question 2 Not yet answered Marked out of 1.00 Flag question Question text Quick sort uses which of the following technique to implement sorting?
a. greedy algorithm
b. backtracking
c. dynamic programming
d. divide and conquer
e. searching
Solution
Sure, here are the answers to your questions:
Question 1: The load factor α for a hash table is calculated as the number of elements stored in the hash table divided by the number of slots in the table. So in this case, α = 3000 / 25 = 120. Therefore, the correct answer is (d) 120.
Question 2: Quick sort is a sorting algorithm that uses the divide and conquer technique. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then recursively sorted. Therefore, the correct answer is (d) divide and conquer.
Similar Questions
Time left 0:39:16 Question 1 Not yet answered Marked out of 1.00 Flag question Question text Given a hash table T with 25 slots that stores 3000 elements, the load factor α for T is a. 0.0083 b. 0.83 c. 75000 d. 120 Clear my choice Question 2 Not yet answered Marked out of 1.00 Flag question Question text Quick sort uses which of the following technique to implement sorting? a. greedy algorithm b. backtracking c. dynamic programming d. divide and conquer e. searching
Quick Sort
Which of the following sorting algorithm has the running time that is least dependant on the initial ordering of the input? Group of answer choices Selection sort Quick sort Merge sort Insertion sort
QuickSort can be categorized into which of the following?ans.Greedy algorithm Brute Force techniqueDynamic programmingDivide and conquer Previous Marked for Review Next
Which of the following algorithms does not need sorting of elements before performing a search?Group of answer choicesSequential SearchExponential SearchBinary SearchJump Search
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.