Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Consider the brute force implementation of the rod cutting problem in which all the possible cuts are found and the maximum value is calculated. What is the time complexity of this brute force implementation?
In the brute force implementation to find the longest increasing subsequence, all the subsequences of a given sequence are found. All the increasing subsequences are then selected and the length of the longest subsequence is found. What is the time complexity of this brute force implementation?
ABCD is a rectangle and O is point inside the rectangle. Point O joins all four vertices of the rectangle. Which statement(s) is/are wrong? A) Sum of area of △AOB and △DOC is equal to sum of area of △BOC and △AOD B) Sum of area of △AOB and △DOC is half the area of rectangle. C) Sum of area of △BOC and △AOD is half the area of rectangle.
Consider the brute force implementation in which we find all the possible ways of multiplying the given set of n matrices. What is the time complexity of this implementation?
Consider the following statements and select which of the following statement are true. Statement 1: The maximum sum rectangle can be 1X1 matrix containing the largest element If the matrix size is 1X1 Statement 2: The maximum sum rectangle can be 1X1 matrix containing the largest element If all the elements are zero Statement 3: The maximum sum rectangle can be 1X1 matrix containing the largest element If all the elements are negative
If the length of rectangle A is one -half of the length of rectangle B , and the width of rectangle A is one -half of the width of rectangle B, what is the ratio of the area of rectangle A to the area of rectangle B?
If the length of rectangle A is one-half the length of rectangle B, and the width of rectangle A is one-helf the width of rectangle B, what is the ratio of the area of rectangle A to the are of rectangle B?
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?
What is the time complexity of the brute force algorithm used to solve the Knapsack problem?
What is the time complexity of the brute force algorithm used to solve the assembly line scheduling problem?