1. Explain the distinction between an ambiguity in a proposed algorithm and an ambiguity in the representation of an algorithm.

2. Describe how the use of primitives helps remove ambiguities in an algorithm's representation.

3. What is the difference between a formal programming language and a pseudo-code?

4. What is the difference between syntax and semantics?

5. Four prospectors with only one lantern must walk through a mine-shaft. At most, two prospectors can travel together and any prospector in the shaft must be with the lantern. The prospectors, named Andrews, Blake, Johnson, and Kelly, can walk through the shaft in one minute, two minutes, four minutes, and eight minutes, respectively. When two walk together they travel at the speed of the slower prospector.
How can the prospectors get through the mine-shaft in only 15 minutes? After you have solved this problem, explain how you got your foot in the door.

*An interactive solution to a similar problem (5 people and 30 seconds), that helps to determine the solution, can be found at:

http://www.plastelina.net/examples/games/game3.html