If A and B are two matrix of order 25x40 and 40x11 . What is the number of multiplications required to multiply the two matrices?

• 25x40

• 25x11

• 25x40x11

• 40x40

Consider the strings "ABCCABAACB" and “ CACBABA”. What is the length of the longest common subsequence?

______________ is the Technique used to solve dynamic programming

• Memoization

• Tabulation

• Brute force

• Greedy

An Example of Dynamic Programming is ______________

• String Matching

• Fractional knapsack

• 0/1 knapsack problem

• Job Scheduling

State True or False : In 0/1 Knapsack items can be indivisible

To determine transitive closure of any graph using _____________

• Adjacency Matrix

• weighted graph

• Directed graph

• weighted Directed graph

In dynamic Programming Time Complexity of Warshall Transitive Closure is _____

• O(n)

• O(1)

• O(n log n)

• O(n³)

__________ is the modified version of warshall's algorithm

The traveling salesman problem involves visiting each vertex how many times?

• 0

• 2

• 1

• 3

In Optimal Binary Search tree ,Frequent words will be arranged near _______