Suppose a Veteran Wants a Visit to All the War

question 18

Multiple Choice

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?

• A) Finding an Euler circuit on a graph
• B) Applying the nearest-neighbor algorithm for the traveling salesman problem
• C) Applying Kruskal's algorithm for finding a minimum-cost spanning tree for a graph
• D) None of these techniques is likely to apply

---

Definitions:

Fixed-Interval

A schedule of reinforcement where a response is rewarded only after a specified amount of time has elapsed, commonly used in behavioral psychology.

Variable-Ratio

A reinforcement schedule where rewards are given after a random number of responses, encouraging high and steady response rates.

Behavior Modification

Using conditioning to improve behavior.

Operant Conditioning

A method of learning wherein the intensity of an action is altered by either rewards or penalties.