Introduction Quiz #2

In the Traveling Salesman problem if we start in Atlanta and need to visit only one other city we have 1 possible route, if we need to visit two other cities we have 2 possible routes (although some routes are symmetric), and if we need to visit three other cities there are 6 possible routes (although there are only 3 unique routes). How many possible routes (counting the symmetric routes) are there if we need to visit 5 other cities?

5!=120

Suppose we have the following distances between 5 cities for the Traveling Salesman problem. If we start in City A and go to City D, what is the next city to visit assuming we are using a Greedy approach with the best choice being the closest city?

B

Suppose we have the following 5 cities for the Traveling Salesmen Problem. If we start in City C, what us the next city to visit assuming we are using a Greedy approach with the best choice being the closest city

E

Any of the four algorithm algorithm strategies (Brute- Force, Greedy, Random, Divide & Conquer) we consider can be easily applied to every problem.

False

In a random approach to solving the Knapsack problem you always get the same answer every time you apply it.

False

In the graph below of the work required to find a name in a phone book using the Divide and Conquer and Brute-Force algorithms, the red graph is for the Divide and Conquer algorithm, and the blue graph is for the Brute-Force algorithm

False

The Greedy approach for the Traveling Salesman problem where the best choice is moving to the closest city always gives the optimal route.

False

Different algorithms for a specific problem may give different answers

True

In the Brute Force approach to solving the Knapsack problem you always get the optimal answer

True

When a greedy approach is used to solve a problem the criteria used to determine the best choice at each step must be specified

True