Question 1

Which of the following best explains the ability to solve problems algorithmically?

Accepted Answer

There exist some problems that cannot be solved algorithmically using any computer.

Answer

Any problem can be solved algorithmically, though some algorithmic solutions may require humans to validate the results.

Answer

Any problem can be solved algorithmically, though some algorithmic solutions must be executed on multiple devices in parallel.

Answer

Any problem can be solved algorithmically, though some algorithmic solutions require a very large amount of data storage to execute.

Question 2

For which of the following situations would it be best to use a heuristic in order to find a solution that runs in a reasonable amount of time?

Accepted Answer

Finding the fastest route that visits every location among n
 locations, which requires n!
 possible routes be examined.

Answer

Appending a value to a list of n
 elements, which requires no list elements be examined.

Answer

Performing a binary search for a score in a sorted list of n
 scores, which requires that fewer than n
 scores be examined.

Answer

Performing a linear search for a name in an unsorted database of n
 people, which requires that up to n
 entries be examined.

Question 3

Under which of the following conditions is it most beneficial to use a heuristic approach to solve a problem?

Accepted Answer

When the problem cannot be solved in a reasonable time and an approximate solution is acceptable

Answer

When the problem can be solved in a reasonable time and an approximate solution is acceptable

Answer

When the problem can be solved in a reasonable time and an exact solution is needed

Answer

When the problem cannot be solved in a reasonable time and an exact solution is needed

Untitled

Questions in this quiz (3)