Question 1 : What is the time complexity of Jump Search?
1. O(logn)
2. O(n)
3. O(sqrt(n))
4. O(nlogn)
5.
View Answer   Discuss with Members

Question 2 : Select the code snippet for Jump Search.
1.

public int jumpSearch(int arr[], int key){	int size = arr.length;	int step = flo 
  2.  
public int jumpSearch(int arr[], int key){	int size = arr.length;	int step = flo 
  3.  
public int jumpSearch(int arr[], int key){	int size = arr.length;	int step = flo 
  4.  None of the mentioned 
  5.   

                                                
                                                    
                                                     View Answer
                                                       Discuss with Members
                                            

Question 3 : What is the length of the step in jump search?
1. n
2. n/2
3. sqrt(n)
4. 1
5.
View Answer   Discuss with Members

Question 4 : What are the advantages of Fibonacci Search?
1. When the element being searched for has a non uniform access storage
2. Can be used in magnetic tapes
3. Can be used for large arrays which do not fit in the CPUcache or in the RAM
4. All of the mentioned
5.
View Answer   Discuss with Members

Question 5 : What is the time complexity of Fibonacci Search?
1. O(logn)
2. O(n)
3. O(n²)
4. O(nlogn)
5.
View Answer   Discuss with Members

Question 6 : Choose the recursive formula for the Fibonacci series.(n>=1)
1. F(n) = F(n+1) + F(n+2)
2. F(n) = F(n) + F(n+1)
3. F(n) = F(n-1) + F(n-2)
4. F(n) = F(n-1) – F(n-2)
5.
View Answer   Discuss with Members

Question 7 : Which algorithmic technique does Fibonacci search use?
1. Brute force
2. Divide and Conquer
3. Greedy Technique
4. Backtracking
5.
View Answer   Discuss with Members

Question 8 : Jump search has a worst case time complexity of O(n).
1. True
2. False
3.
4.
5.
View Answer   Discuss with Members

Question 9 : Jump search is worse than linear search in terms of time complexity.
1. True
2. False
3.
4.
5.
View Answer   Discuss with Members

Question 10 : Best case of jump search will have time complexity of _________
1. O(1)
2. O(n)
3. O(log n)
4. O(n log n)
5.
View Answer   Discuss with Members