Q. Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done until the element is found?

View solution

Q. 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?

View solution

Q. What is the time complexity of binary search with iteration?

View solution

Q. When is the uniform binary search an optimization over the usual binary search?

View solution

Q. Given delta[4] is a global array and number of elements in the sorted array is 10, what are the values in the delta array?

View solution

Q. What is the time complexity of uniform binary search?

View solution

Q. 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)

View solution

Q. How can Jump Search be improved?

View solution

Q. Which of the following false about Jump Search?

View solution

Q. Which algorithmic technique does Fibonacci search use?

View solution

Q. Choose the recursive formula for the Fibonacci series.(n>=1)

View solution

Q. What is the time complexity of Fibonacci Search?

View solution

Q. What are the advantages of Fibonacci Search?

View solution

Q. What is the length of the step in jump search?

View solution

Q. What is the time complexity of Jump Search?

View solution

Q. What is an in-place sorting algorithm?

View solution

Q. In the following scenarios, when will you use selection sort?

View solution

Q. What is the worst case complexity of selection sort?

View solution

Q. What is the advantage of selection sort over other sorting techniques?

View solution

Q. What is the average case complexity of selection sort?

View solution