Questions

  Complete Self-Check #4 within the "Exercises for Section 5.3" subsection in Section 5.3, "Recursive Array Search" of Ch. 5, "Recursion" in Data Structures: Abstraction and Design Using Java. 

#4.  Write a recursive algorithm to find the largest value in an array of integers.

 

• Ch. 5, Data Structures: Abstraction and Design Using Java

 

Complete the following Review Questions within the "Exercises for Sections 5.6" subsection in Section 5.6, "Backtracking" of Ch. 5, "Recursion" in Data Structures: Abstraction and Design Using Java

Review Question #5

Review Question #7

 

5. For Towers of Hanoi, show the output string that would be created by the method call showMoves(3, 'R', 'M', 'L'). Also, show the sequence of method calls.

7. For the maze path found in Figure 5.19, explain why cells (3, 4), (2, 5), (3, 5), and (4, 5) were never visited and why cells (5, 1) and (3, 0) through (9, 0) were visited and rejected. Show the activation frames for the first 10 recursive calls in solving the maze.

 

• Ch. 5, Data Structures: Abstraction and Design Using Java