Quiz: Finite-State Automata (Treasure Hunt)

Multiple-Choice Questions

1. What everyday object is used in this activity to represent a finite-state automaton?
A) A calculator
B) A treasure map
C) A deck of playing cards
D) A calendar

2. At each island, how many ship choices does a traveller have?
A) One (A only)
B) Two (A or B)
C) Three (A, B, or C)
D) As many as they like

3. What is shown on the back of each island card?
A) A picture of the island
B) The name of a pirate
C) The secret instructions for where ships A and B travel to
D) A list of all the islands

4. In the finite-state automata diagrams, how is the final island (with the treasure) shown?
A) As a square
B) As a triangle
C) As a double circle
D) As a star

5. According to the resource, what does it mean if a route on the map takes you around in circles (a loop) in a real-world system like a phone menu?
A) It means the system is working perfectly
B) It is an error in the design and can be frustrating for the user
C) It means the call will end automatically
D) It means you have reached the final state

6. Which of the following is given as a real-world example of a finite-state automaton in use?
A) A bank cash machine leading you through a sequence of events
B) A television remote control
C) A calculator adding two numbers
D) A weather forecast

7. What was the name of the famous 1960s computer program mentioned that had conversations with people, pretending to be a psychotherapist?
A) HAL
B) Eliza
C) Watson
D) Siri

8. In the "Mysterious Coin Game," how many "islands" does the hint say the map has?
A) 2
B) 3
C) 4
D) 6

---

Short-Answer Questions

9. In the demonstration map described in the resource, what happens if you start at Pirates' Island, ask for ship A, then ask for ship A again, then ask for ship B? Describe what happens using the routes described.

10. Explain, based on the resource, what rule Map (a) follows for a sequence of As and Bs to end at the treasure island (the double circle).

11. Using the "What's it all about?" section, explain in your own words why finite-state automata are useful to computer scientists, giving at least one example from the text.

---

Answer Key

1. B
2. B
3. C
4. C
5. B
6. A
7. B
8. C
9. You travel from Pirates' Island to Shipwreck Bay (ship A), then back to Pirates' Island (ship A again), then from Pirates' Island to Dead Man's Island (ship B) — at Dead Man's Island you get stuck, since no ships sail from there.
10. Map (a) finishes at the double circle (island 2) only if the sequence has an odd number of As (for example, AB, BABAA, or AAABABA).
11. Answers will vary but should reference that FSAs help computers process a sequence of characters or events, such as key presses on a phone menu system or a bank cash machine leading a user through steps like dispensing cash, printing a statement, or ejecting a card.