- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which of the following methods can be us...

Q. |
## Which of the following methods can be used to find the nth Catalan number? |

A. | recursion |

B. | binomial coefficients |

C. | dynamic programming |

D. | recursion, binomial coefficients, dynamic programming |

Answer» D. recursion, binomial coefficients, dynamic programming | |

Explanation: all of the mentioned methods can be used to find the nth catalan number. |

View all MCQs in:
Design and Analysis of Algorithms

- Which of the following recurrence relations can be used to find the nth fibonacci number?
- Which of the following is NOT a Catalan number?
- What is the time complexity of the recursive implementation used to find the nth fibonacci term?
- What is the space complexity of the recursive implementation used to find the nth fibonacci term?
- Which of the following implementations of Catalan numbers has the smallest time complexity?
- 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?
- Which of the following methods can be used to find the sum of digits of a number?
- Which of the following methods can be used to find the largest and smallest number in a linked list?
- Given a string, you have to find the minimum number of characters to be inserted in the string so that the string becomes a palindrome. Which of the following methods can be used to solve the problem?
- In general, which of the following methods isn’t used to find the factorial of a number?

Login to Continue

It will take less than 2 minutes

Report MCQ