McqMate

Q. |
## Which of the following gives the sum of the first n natural numbers? |

A. | nc2 |

B. | (n-1)c2 |

C. | (n+1)c2 |

D. | (n+2)c2 |

Answer» C. (n+1)c2 | |

Explanation: the sum of first n natural numbers is given by n*(n+1)/2, which is equal to (n+1)c2. |

1.6k

0

Do you find this helpful?

8

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- You are given infinite coins of denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. This problem can be solved using
- You are given infinite coins of N denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. What is the time complexity of a dynamic programming implementation used to solve the coin change problem?
- Consider the 2×3 matrix {{1,2,3},{1,2,3}}. What is the sum of elements of the maximum sum rectangle?
- Consider the 2×2 matrix {{-1,-2},{-3,-4}}. What is the sum of elements of the maximum sum rectangle?
- What is the worst case time complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
- What will be the auxiliary space complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
- 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 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?