- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- What can be the maximum sum of digits fo...

Q. |
## What can be the maximum sum of digits for a 4 digit number? |

A. | 1 |

B. | 16 |

C. | 36 |

D. | 26 |

Answer» C. 36 | |

Explanation: the sum of digits will be maximum when all the digits are 9. thus, the sum will be maximum for the number 9999, which is 36. |

View all MCQs in:
Design and Analysis of Algorithms

- What can be the minimum sum of digits for a 4 digit number?
- Which of the following methods can be used to find the sum of digits of a number?
- 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
- 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?
- 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?
- Which is the smallest number of 3 digits that is divisible by 2, 4, 8?
- 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?
- 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)?

Login to Continue

It will take less than 2 minutes

Report MCQ