MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 2 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
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. | |
| 2. |
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) | |