Exam 2: Business Efficiency

On a map there are roads from town A of length 10, 26, 12, and 50 miles. Using the nearest-neighbor algorithm for finding a Hamiltonian circuit starting at town A, which road would be traveled first?

You own a chain of 12 apartment complexes (including your residence) and you want to plan a trip to visit each of your properties. If it takes 1/2 minute to compute the total length of a tour, how long will it take to apply the brute force algorithm to find the optimal tour?

Identify six tasks necessary when building a sandwich, and construct a digraph for these tasks.

What is critical about the critical path of an order-requirement digraph?

Use Kruskal's algorithm for minimum-cost spanning trees on the graph below. What is the cost of the tree found?

Which of the following describes a Hamiltonian circuit for the graph below?

Construct an example of a graph with no Hamiltonian circuit.

For the graph below, what is the cost of the Hamiltonian circuit obtained by using the nearest-neighbor algorithm, starting at C?

Suppose an employee of a power company needs to read the electricity meters outside of each house along the streets in a residential area. Which technique is most likely to be useful in solving this problem?

Which of the following describes a Hamiltonian circuit for the graph below?

Phyllis has her office in Middleton and must visit four clients, each in a different city. The graph below shows each city and the distances between each pair of cities. How many miles would Phyllis travel if she chooses the Hamiltonian circuit for her trip by using the sorted-edges algorithm?

Given the two graphs shown below, which one represents a tree?

Construct an example of a connected graph that has a Hamiltonian circuit but does not have an Euler circuit.

What is the earliest possible completion time for a job whose order-requirement digraph is shown below?

Will the nearest-neighbor algorithm ever use the most expensive edge of a graph?

In the graph below, construct a Hamiltonian circuit.

Given the order-requirement digraph for a collection of tasks shown below, what would the critical path be?

Suppose a veteran wants a visit to all the war memorials in Washington, D.C. in one day. Which technique is most likely to be useful in solving this problem?

You want to create a mileage grid showing the distance between every pair of the 10 Canadian provincial and territorial capitals. How many numbers will you have to compute?

Identify six tasks necessary when preparing for a picnic, and construct a digraph for these tasks.