- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which of the following option is wrong?

Q. |
## Which of the following option is wrong? |

A. | fibonacci number can be calculated by using dynamic programming |

B. | fibonacci number can be calculated by using recursion method |

C. | fibonacci number can be calculated by using iteration method |

D. | no method is defined to calculate fibonacci number |

Answer» D. no method is defined to calculate fibonacci number | |

Explanation: fibonacci number can be calculated by using dynamic programming, recursion method, iteration method. |

View all MCQs in:
Design and Analysis of Algorithms

- Consider the array {1,1,1,1,1}. Select the wrong option?
- For which of the following inputs would Kadane’s algorithm produce a WRONG output?
- Suppose you have coins of denominations 1,3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For which of the following sums, will the algorithm produce an optimal answer?
- Which of the following strategies does the following diagram depict?
- Which of the following strategies does the following diagram depict?
- You are given n dice each having f faces. You have to find the number of ways in which a sum of S can be achieved. This is the dice throw problem. Which of the following methods can be used to solve the dice throw problem?
- Recursion is similar to which of the following?
- Which of the following problems can’t be solved using recursion?
- In general, which of the following methods isn’t used to find the factorial of a number?
- Which of the following recursive formula can be used to find the factorial of a number?

Login to Continue

It will take less than 2 minutes

Report MCQ