DAA Quiz
Authored by shobana marudhachalam
Education
University
Used 7+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
10 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the running time of Strassen's algorithm for matrix multiplication?
O(n2.81)
O(n3)
O(n1.8)
O(n2)
2.
MULTIPLE CHOICE QUESTION
45 sec • 1 pt
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
3.
MULTIPLE CHOICE QUESTION
45 sec • 1 pt
In dynamic programming, the technique of storing the previously calculated values is called .....
Saving value property
Storing value property
Memoization
Mapping
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
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
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Floyd Warshall’s Algorithm is used for solving ____________
All pair shortest path problems
Single Source shortest path problems
Network flow problems
Sorting problems
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the time complexity of Dijikstra’s algorithm?
O(N)
O(N3)
O(N2)
O(logN)
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Prim's algorithm is a .....
Divide and conquer algorithm
Greedy algorithm
Dynamic Programming
Approximation algorithm
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?
