What is the fundamental distinction in algorithmic problems?

• The difference between a problem and an instance of a problem

• The difference between sorting and searching

• The difference between algorithms and data structures

• The difference between input and output

What is the output of the sorting algorithm?

• A sequence of unsorted keys

• The original input sequence

• The number of keys in the input sequence

• The permutation of the input sequence in sorted order

What is an example of an instance of the sorting problem?

• A list of numbers

• The definition of sorting

• The concept of algorithms

• The algorithm for sorting

What is the first step towards solving an algorithmic problem?

• Identifying the algorithm

• Determining the instance of the problem

• Understanding the output

• Defining the input

What is the main goal of an algorithm?

• To maximize the number of algorithms

• To create complex programs

• To minimize code length

• To transform input instances to desired output

What is a desirable property of a good algorithm?

• It should be the longest possible solution

• It should be correct and efficient

• It should be complex

• It should be difficult to implement

What does a proof of correctness provide for an algorithm?

• A guarantee of speed

• An explanation of why it works

• A comparison with other algorithms

• A list of all possible inputs

What is the problem addressed by the Robot Tour Optimization?

• Finding the fastest route for delivery

• Maximizing the efficiency of a robot's battery

• Minimizing the time for a robot arm to solder components

• Sorting a list of robot parts

What is the input for the Robot Tour Optimization problem?

• A set of points in the plane

• A list of robot arms

• A sequence of soldering tasks

• A collection of circuit boards

What does the nearest-neighbor heuristic do?

• Visits the farthest point first

• Selects the closest unvisited neighbor

• Randomly selects any point

• Visits all points in a random order