MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 7 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structures and Algorithms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What is the time complexity of Jump Search? |
| A. | O(logn) |
| B. | O(n) |
| C. | O(sqrt(n)) |
| D. | O(nlogn) |
| Answer» D. O(nlogn) | |
| 2. |
What is the length of the step in jump search? |
| A. | n |
| B. | n/2 |
| C. | sqrt(n) |
| D. | 1 |
| Answer» D. 1 | |
| 3. |
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. | Can be used in magnetic tapes |
| C. | Can be used for large arrays which do not fit in the CPU cache or in the RAM |
| D. | It can be applied efficiently on unsorted arrays |
| Answer» E. | |
| 4. |
What are the advantages of Fibonacci Search? |
| A. | When the element being searched for has a non uniform access storage |
| B. | Can be used in magnetic tapes |
| C. | Can be used for large arrays which do not fit in the CPUcache or in the RAM |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 5. |
What is the time complexity of Fibonacci Search? |
| A. | O(logn) |
| B. | O(n) |
| C. | O(n<sup>2</sup>) |
| D. | O(nlogn) |
| Answer» C. O(n<sup>2</sup>) | |
| 6. |
Choose the recursive formula for the Fibonacci series.(n>=1) |
| A. | F(n) = F(n+1) + F(n+2) |
| B. | F(n) = F(n) + F(n+1) |
| C. | F(n) = F(n-1) + F(n-2) |
| D. | F(n) = F(n-1) – F(n-2) |
| Answer» D. F(n) = F(n-1) ‚Äö√Ñ√∂‚àö√ë‚àö¬® F(n-2) | |
| 7. |
Which algorithmic technique does Fibonacci search use? |
| A. | Brute force |
| B. | Divide and Conquer |
| C. | Greedy Technique |
| D. | Backtracking |
| Answer» C. Greedy Technique | |