- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which of the following is NOT a Catalan ...

Q. |
## Which of the following is NOT a Catalan number? |

A. | 1 |

B. | 5 |

C. | 14 |

D. | 43 |

Answer» D. 43 | |

Explanation: catalan numbers are given by: (2n!)/((n+1)!n!). |

View all MCQs in:
Design and Analysis of Algorithms

- Which of the following methods can be used to find the nth Catalan number?
- Which of the following implementations of Catalan numbers has the smallest time complexity?
- A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
- If GCD of two number is 8 and LCM is 144, then what is the second number if first number is 72?
- Suppose the first fibonnaci number is 0 and the second is 1. What is the sixth fibonnaci number?
- Which of the following is not a fibonnaci number?
- 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?
- 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?
- Which of the following recurrence relations can be used to find the nth fibonacci number?

Login to Continue

It will take less than 2 minutes

Report MCQ