Understanding Algorithms and Heuristics

According to the text, what is an algorithm?

• A complex mathematical formula.

• A procedure to accomplish a specific task.

• A computer program written in C.

• A specific instance of a problem.

To be 'interesting,' an algorithm must solve what kind of problem?

• A problem with a single, specific input.

• A problem that is already partially solved.

• A general, well-specified problem.

• A problem that only works on numbers.

What is the fundamental distinction highlighted in the text regarding algorithmic problems?

• Between correctness and efficiency.

• Between input and output.

• Between a problem and an instance of a problem.

• Between sorting and searching.

For the algorithmic problem known as sorting, what is the required output?

• The original sequence of keys.

• The permutation (reordering) of the input sequence such that keys are in non-decreasing order.

• The number of keys in the sequence.

• A randomly shuffled sequence.

Which of the following is given as an example of an instance of the sorting problem?

• The definition of sorting.

• The insertion sort algorithm.

• An array of names, like {Mike, Bob, Sally, Jill, Jan}.

• The procedure to accomplish a specific task.

What does the text state about the generality of the insertion sort algorithm?

• It only works on numbers.

• It only works on names.

• It works just as well on names as it does on numbers, given the appropriate comparison.

• It is specific to the 'INSERTIONSORT' word example.

Which of the following is NOT listed as a desirable property for a good algorithm?

• Correctness

• Efficient

• Easy to implement

• Uses the least amount of code

When does the issue of finding the best possible answer or achieving maximum efficiency usually arise in industrial settings?

• From the very beginning of a project.

• When a better algorithm is known to exist.

• Only after serious performance or legal troubles.

• When the program gives good enough answers.

What is the primary tool needed to distinguish correct algorithms from incorrect ones, as mentioned in the text?

• Intuition

• Testing with a few examples

• A proof of correctness

• User feedback

What is the main reason given for why 'it's obvious' never suffices as a proof of correctness?

• It is too time-consuming.

• It is difficult to understand.

• It requires too much mathematical background.

• It is usually flat-out wrong.