Q. In the dynamic programming implementation of the assembly line scheduling problem, how many lookup tables are required?

View solution

Q. 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?

View solution

Q. In which of the following cases will the number of insertions to form a palindrome be minimum?

View solution

Q. In the worst case, the minimum number of insertions to be made to convert the string into a palindrome is equal to the length of the string.

View solution

Q. Consider the string “efge”. What is the minimum number of insertions required to make the string a palindrome?

View solution

Q. Consider the string “abbccbba”. What is the minimum number of insertions required to make the string a palindrome?

View solution

Q. Which of the following problems can be used to solve the minimum number of insertions to form a palindrome problem?

View solution

Q. Given a 2D matrix, find a submatrix that has the maximum sum. Which of the following methods can be used to solve this problem?

View solution

Q. In which of the following cases, the maximum sum rectangle is the 2D matrix itself?

View solution

Q. In which of the following cases, the maximum sum rectangle can be a 1 x 1 matrix containing the largest element?

View solution

Q. Consider a matrix in which all the elements are non-zero(at least one positive and at least one negative element). In this case, the sum of the elements of the maximum sum rectangle cannot be zero.

View solution

Q. Consider the 2×3 matrix {{1,2,3},{1,2,3}}. What is the sum of elements of the maximum sum rectangle?

View solution

Q. Consider the 2×2 matrix {{-1,-2},{-3,-4}}. What is the sum of elements of the maximum sum rectangle?

View solution

Q. Consider the 3×3 matrix {{2,1,-3},{6,3,4},{-2,3,0}}. What is the sum of the elements of the maximum sum rectangle?

View solution

Q. What is the time complexity of the brute force implementation of the maximum sum rectangle problem?

View solution

Q. The dynamic programming implementation of the maximum sum rectangle problem uses which of the following algorithm?

View solution

Q. Given an array, check if the array can be divided into two subsets such that the sum of elements of the two subsets is equal. This is the balanced partition problem. Which of the following methods can be used to solve the balanced partition problem?

View solution

Q. In which of the following cases, it is not possible to have two subsets with equal sum?

View solution

Q. What is the time complexity of the brute force algorithm used to solve the balanced partition problem?

View solution

Q. Consider a variation of the balanced partition problem in which we find two subsets such that |S1 – S2| is minimum. Consider the array {1, 2, 3, 4, 5}. Which of the following pairs of subsets is an optimal solution for the above problem?

View solution