DAA Quiz

What is the running time of Strassen's algorithm for matrix multiplication?

• O(n2.81)

• O(n3)

• O(n1.8)

• O(n2)

Which of the following standard algorithms is not Dynamic Programming based

• Floyd Warshall Algorithm for all pairs shortest paths

• 0-1 Knapsack problem

• Prim's

• Optimal Binary Search Trees

In dynamic programming, the technique of storing the previously calculated values is called .....

• Saving value property

• Storing value property

• Memoization

• Mapping

When dynamic programming is applied to a problem, it takes far less time as compared to other methods that don't take advantage of overlapping sub problems.

• True

• False

 Floyd Warshall’s Algorithm is used for solving ____________

• All pair shortest path problems

• Single Source shortest path problems

• Network flow problems

• Sorting problems

What is the time complexity of Dijikstra’s algorithm?

• O(N)

• O(N3)

• O(N2)

• O(logN)

Prim's algorithm is a .....

• Divide and conquer algorithm

• Greedy algorithm

• Dynamic Programming

• Approximation algorithm

From the following given tree, what is the code word for the character ‘a’?

• 011

• 010

• 100

• 101

Two main measures for the efficiency of an algorithm are

• Time and Space

• Processor and Memory

• Complexity and Capacity

• Data and space

Which algorithm is used to solve a maximum flow problem?

• Prim’s algorithm

• Kruskal’s algorithm

• Dijkstra’s algorithm

• Ford-Fulkerson algorithm