Which algorithm is best suited for searching in a sorted linked list?
A. Binary Search
B. Interpolation Search
C. Linear Search
D. Jump Search
Select an option to see the answer and solution.
What is the time complexity of interpolation search in the best case scenario?
A. O(log n)
B. O(1)
C. O(n log n)
D. O(log n)
Select an option to see the answer and solution.
What is the best case time complexity of linear search?
A. O(n log n)
B. O(log n)
C. O(1)
D. O(n)
Select an option to see the answer and solution.
What type of data structure is best for implementing binary search?
A. Linked List
B. Hash Table
C. Tree
D. Array
Select an option to see the answer and solution.
What is the time complexity of hash search in the worst case?
A. O(n)
B. O(log n)
C. O(1)
D. O(n log n)
Select an option to see the answer and solution.
Which of the following is a sub string of "HELLOINDIA"?
A. HELL
B. LOIND
C. HELD
D. LOND
Select an option to see the answer and solution.
How many jumps will be made in the worst case of jump search(let block jumped =k)?
Select an option to see the answer and solution.
Which of the following is not an advantage of Fibonacci Search?
A. When the element being searched for has a non uniform access storage
B. It can be applied efficiently on unsorted arrays
C. Can be used for large arrays which do not fit in the CPU cache or in the RAM
D. Can be used in magnetic tapes
Select an option to see the answer and solution.
How can Jump Search be improved?
A. Step size should be other than sqrt(n)
B. Cannot be improved
C. Begin from the kth item, where k is the step size
D. Start searching from the end
Select an option to see the answer and solution.
What is the time complexity of Jump Search?
A. O(logn)
B. O(n)
C. O(sqrt(n))
D. O(nlogn)
Select an option to see the answer and solution.
What is the worst case runtime of linear search(recursive) algorithm?
A. O(n)
B. O(logn)
C. O(n2 )
D. O(nx)
Select an option to see the answer and solution.
Given an array arr = {5, 6, 77, 88, 99} and key = 88; How many iterations are done until the element is found?
Select an option to see the answer and solution.
What is the length of the step in jump search?
Select an option to see the answer and solution.
Given an array arr = {45, 77, 89, 90, 94, 99, 100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations?
A. 90 and 99
B. 90 and 100
C. 89 and 94
D. 94 and 99
Select an option to see the answer and solution.
What is the time complexity of exponential search when the input array is sorted but the values are not uniformly distributed?
A. O(n1/2 )
B. O(log log n)
C. O(n)
D. O(log n)
Select an option to see the answer and solution.
What is the value of jump taken for maximum efficiency while implementing jump search?
Select an option to see the answer and solution.
Which of the following step is taken after finding an element having value greater than the element being searched?
A. binary search takes place in the forward direction
B. binary search takes place in a backward direction
C. linear search takes place in the forward direction
D. linear search takes place in the backward direction
Select an option to see the answer and solution.
Given, arr = {1, 3, 5, 6, 7, 9, 14, 15, 17, 19} key = 17 and delta = {5, 3, 1, 0}
How many key comparisons are made?(exclude the comparison used to decide the left or right sub array)
Select an option to see the answer and solution.
Binary Search can be categorized into which of the following?
A. Brute Force technique
B. Divide and conquer
C. Greedy algorithm
D. Dynamic programming
Select an option to see the answer and solution.
What is the auxiliary space requirement of interpolation search?
A. O(n)
B. O(2n )
C. O(1)
D. O(log n)
Select an option to see the answer and solution.