PDS - 04225 Algorithms - Chapter 3

In programming, is there anything more important than performance?.

• Yes

• No

Does the heuristic technique for algorithms seeks optimal and accurate precision for it's solutions?.

• No

• Yes

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.

Are binary trees a self-adjusting data structure?.

• Yes

• No

Are all greedy algorithms optimal?.

• Yes

• No

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.

Does Dynamic programming avoids recomputing previously computed results by storing and reusing such results?

• Yes

• No

Any algorithm that splits a problem into smaller sub-problems is using dynamic programming?.

• True

• False

Suppose a move-to-front heuristic is used on a list that starts as (56, 11, 92, 81, 68, 44). A first search for 81 compares against how many list items?

• 0

• 3

• 4

In a self-adjusting heuristic, which scenario results in faster searches?

• Back-to-back searches for the same key

• Every search is for a key different than the previous search.