Download presentation

Presentation is loading. Please wait.

Published byAnissa Barnard Modified over 4 years ago

1
Chapter Objectives To learn about recursive data structures and recursive methods for a LinkedList class To understand how to use recursion to solve the Towers of Hanoi problem To understand how to use recursion to process two- dimensional images To learn how to apply backtracking to solve search problems such as finding a path through a maze CS340 1

2
Recursive Data Structures CS340 2

3
Recursive Data Structures Data structures that are defined recursively – with another version of itself as a component Linked lists and trees Recursive methods provide a natural mechanism for processing recursive data structures CS340 3

4
Recursive Definition of a Linked List Each node of a linked list References another linked list That references another linked list … The last node references an empty list CS340 4

5
Class LinkedListRec LinkedListRec implements several list operations using recursive methods public class LinkedListRec { private Node head; // inner class Node here // (from chapter 2) } CS340 5

6
Recursive size Method CS340 6

7
Recursive toString Method CS340 7

8
Recursive replace Method 8

9
Recursive add Method 9

10
Recursive remove Method CS340 10

11
Recursive remove Method (cont.) CS340 11

12
Problem Solving with Recursion CS340 12

13
Simplified Towers of Hanoi Move the three disks to a different peg, maintaining their order (largest disk on bottom, smallest on top, etc.) Only the top disk on a peg can be moved to another peg A larger disk cannot be placed on top of a smaller disk CS340 13

14
Towers of Hanoi CS340 14

15
Algorithm for Towers of Hanoi CS340 15 Solution to Two-Disk Problem: Move Three Disks from Peg L to Peg R 1. Move the top two disks from peg L to peg M. 2. Move the bottom disk from peg L to peg R. 3. Move the top two disks from peg M to peg R.

16
Algorithm for Towers of Hanoi (cont.) CS340 16 Solution to Two-Disk Problem: Move Top Two Disks from Peg M to Peg R 1. Move the top disk from peg M to peg L. 2. Move the bottom disk from peg M to peg R. 3. Move the top disk from peg L to peg R.

17
Algorithm for Towers of Hanoi (cont.) CS340 17 Solution to Four-Disk Problem: Move Four Disks from Peg L to Peg R 1. Move the top three disks from peg L to peg M. 2. Move the bottom disk from peg L to peg R. 3. Move the top three disks from peg M to peg R.

18
Recursive Algorithm for Towers of Hanoi CS340 18 if n is 1 move disk 1 (the smallest disk) from the starting peg to the destination peg else move the top n – 1 disks from the starting peg to the temporary peg (neither starting nor destination peg) move disk n (the disk at the bottom) from the starting peg to the destination peg move the top n – 1 disks from the temporary peg to the destination peg

19
Recursive pseudo code for towers of Hanoi problem FUNCTION MoveTower(disk, source, dest, spare): IF disk == 0, THEN: move disk from source to dest ELSE: MoveTower(disk - 1, source, spare, dest) move disk from source to dest MoveTower(disk - 1, spare, dest, source) END IF CS340 19

20
Recursive Algorithm for Towers of Hanoi (cont.) CS340 20

21
Backtracking CS340 21

22
Backtracking Implementing a systematic trial and error search for a solution Ex. find a path through a maze Backtracking is a systematic, nonrepetitive approach to trying alternative paths and eliminating them if they dont work CS340 22

23
Backtracking (cont.) Recursion allows you to implement backtracking Each activation frame is used to remember the choice that was made at that particular decision point CS340 23

24
Finding a Path through a Maze Problem Use backtracking to find a display the path through a maze From each point in a maze, you can move to the next cell in a horizontal or vertical direction, if the cell is not blocked CS340 24

25
Finding a Path through a Maze (cont.) Analysis The maze will consist of a grid of colored cells The starting point is at the top left corner (0,0) The exit point is at the bottom right corner (getNCols() – 1, getNRow -1) All cells on the path will be BACKGROUND color All cells that represent barriers will be ABNORMAL color Cells that we have visited will be TEMPORARY color If we find a path, all cells on the path will be set to PATH color CS340 25

26
Recursive Algorithm for Finding Maze Path CS340 26 if the current cell is outside the maze return false (you are out of bounds) else if the current cell is part of the barrier or has already been visited return false (you are off the path or in a cycle) else if the current cell is the maze exit recolor it to the path color and return true (you have successfully completed the maze) else // Try to find a path from the current path to the exit: mark the current cell as on the path by recoloring it to the path color for each neighbor of the current cell if a path exists from the neighbor to the maze exit return true // No neighbor of the current cell is on the path recolor the current cell to the temporary color (visited) and return false

27
Testing Test for a variety of test cases: Mazes that can be solved Mazes that can't be solved A maze with no barrier cells A maze with a single barrier cell at the exit point CS340 27

Similar presentations

OK

1 Breadth First Search s 2 5 4 7 8 369. 2 s 2 5 4 7 8 369 0 Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.

1 Breadth First Search s 2 5 4 7 8 369. 2 s 2 5 4 7 8 369 0 Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.

© 2018 SlidePlayer.com Inc.

All rights reserved.

By using this website, you agree with our use of **cookies** to functioning of the site. More info in our Privacy Policy and Google Privacy & Terms.

Ads by Google

Ppt on introduction to object-oriented programming interview questions Ppt on nitrogen cycle and nitrogen fixation in plants Ppt on depth first search vs breadth Ppt on obesity diet Ppt on channels of distribution activities Ppt on 2nd world war end Ppt on seasons in india Ppt on the road not taken frost Ppt on poem the road not taken Ppt on id ego superego theory