PDS - 04225 Algorithms - Chapter 3
Authored by Rafael Orta
Computers
University
Used 325+ 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
In programming, is there anything more important than performance?.
Yes
No
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Does the heuristic technique for algorithms seeks optimal and accurate precision for it's solutions?.
No
Yes
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
A self-adjusting heuristic is :
a linear time complexity algorithm.
an approximation to a program belt curve.
an algorithm that modifies a data structure based on how that data structure is used.
None of the above.
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Are binary trees a self-adjusting data structure?.
Yes
No
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Are all greedy algorithms optimal?.
Yes
No
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Dynamic Programming is :
A technique that focus first on working the details of a program and last on the integration of it.
A problem solving technique that splits a problem into smaller sub-problems.
Letting the computer create the program autonomously.
A problem solving technique that splits a problem into smaller sub-problems, computes and stores solutions to sub-problems in memory, and then uses the stored solutions to solve the larger problem.
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Does Dynamic programming avoids recomputing previously computed results by storing and reusing such results?
Yes
No
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?
