This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Counting Boolean Parenthesizations”. 1. You are given a boolean expression which consists of operators &, | and ∧ (AND, OR and XOR) and symbols T or F (true or false). You have to find the number of ways in which the symbols … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Dice Throw Problem”. 1. 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 … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Balanced Partition”. 1. 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 … Read more
This set of Data Structure Problems focuses on “Maximum Sum Rectangle in a 2D Matrix”. 1. Given a 2D matrix, find a submatrix that has the maximum sum. Which of the following methods can be used to solve this problem? a) Brute force b) Recursion c) Dynamic programming d) Brute force, Recursion, Dynamic programming 2. … Read more
This set of Data Structure Assessment Questions and Answers focuses on “Minimum Insertions to form a Palindrome”. 1. 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? … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Assembly Line Scheduling”. 1. Which of the following methods can be used to solve the assembly line scheduling problem? a) Recursion b) Brute force c) Dynamic programming d) All of the mentioned 2. What is the time complexity of the brute force … Read more
This set of Data Structure Multiple Choice Questions & Answers focuses on “Catalan Number using Dynamic Programming”. 1. Which of the following is NOT a Catalan number? a) 1 b) 5 c) 14 d) 43 2. Which of the following numbers is the 6th Catalan number? a) 14 b) 429 c) 132 d) 42 3. … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Wagner-Fischer Algorithm”. 1. Wagner–Fischer is a ____________ algorithm. a) Brute force b) Greedy c) Dynamic programming d) Recursive 2. Wagner–Fischer algorithm is used to find ____________ a) Longest common subsequence b) Longest increasing subsequence c) Edit distance between two strings d) Longest … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Edit Distance Problem”. 1. Which of the following methods can be used to solve the edit distance problem? a) Recursion b) Dynamic programming c) Both dynamic programming and recursion d) Greedy Algorithm 2. The edit distance satisfies the axioms of a metric … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Longest Palindromic Subsequence”. 1. Which of the following methods can be used to solve the longest palindromic subsequence problem? a) Dynamic programming b) Recursion c) Brute force d) Dynamic programming, Recursion, Brute force 2. Which of the following is not a palindromic … Read more
