- What is the space complexity of the dynamic programming solution for the Longest Bitonic Subsequence problem? A) O(n) B) O(n log n) C) O(n^2) D) O(1)
- Which of the following approaches is used in dynamic programming solutions for the Longest Bitonic Subsequence problem? A) Divide and Conquer B) Memoization C) Backtracking D) Greedy Technique
- What does the Longest Bitonic Subsequence problem find? A) The longest subsequence with alternating elements. B) The longest subsequence with increasing elements followed by decreasing elements. C) The longest subsequence with decreasing elements followed by increasing elements. D) The longest subsequence with equal elements.
- What is the time complexity of the dynamic programming solution for the Longest Bitonic Subsequence problem? A) O(n) B) O(n log n) C) O(2^n) D) O(n^2)
- ______is the primary objective of Operations Research A) Maximizing profits B) Minimizing costs C) Making better decisionsD) Maximizing efficiency
- Which of the following algorithms is commonly used to solve the Longest Bitonic Subsequence problem? A) Breadth-First Search (BFS) B) Depth-First Search (DFS) C) Dynamic Programming (DP) D) Greedy Algorithm
- "In Java which data structure is often used to represent a sequence of elements?" A) Array B) ArrayList C) LinkedList D) Set
- Which data structure is commonly used to implement the dynamic programming solution for the Longest Bitonic Subsequence problem? A) Array B) Linked List C) Stack D) Queue
- Which method is used to find the initial feasible solution in Transportation Problems?- A) North West Corner Rule (NWCR)- B) Least Cost Method (LCM)- C) Vogel's Approximation Method (VAM) - D) Modified Distribution (MODI) Method
- What does the "longest" in the Longest Bitonic Subsequence problem refer to? A) The subsequence with the maximum sum of elements B) The subsequence with the maximum number of elements. C) The subsequence with the maximum product of elements. D) The subsequence with the maximum length.
- What is the primary assumption underlying Linear Programming?- A) Non-linear relationships- B) Unlimited resources- C) Linearity of objective function and constraints - D) Perfect information
- Which method is used to solve Linear Programming problems graphically? - A) Simplex Method- B) Matrix Inversion- C) Graphical Method- D) Gradient Descent
- After minimizing row and column we have to test for optimality and see if every row has at least one?
- In assignment problem if there are 3 boxes in optimality and if 1 zero is not there in every row you will make how many lines?
- In maximization transportation problem (MODI) Total cost is calculated by multiplying?
- What does the Critical Path represent in Critical Path Method (CPM)?A) The shortest path in the network B) The longest path in the network C) The path with the most critical activities D) The path with the least number of activities
- What is the objective of Assignment Problems? - A) Maximizing profits- B) Minimizing costs - C) Maximizing efficiency- D) Minimizing time
- In Transportation problem what do you have to check first?
- In maximisation transportation problem (VAM) you have to subtract whole table with?
- In Assignment Problems, what is a prohibited assignment?- A) An assignment that violates constraints - B) An assignment that minimizes costs- C) An assignment that maximizes profits - D) An assignment with surplus resources