Question: use this simple layout to work completely through the search algorithm by hand twice -- once with stack storage, and once with queue storage 1

use this simple layout to work completely through the search algorithm by hand twice -- once with stack storage, and once with queue storage

1 O O O O O O O 2 

Answer the following:

How does the choice of Storage configuration (stack vs queue) affect the sequence in which paths are explored in the search algorithm? (This requires more than a "stacks are LIFOs and queues are FIFOs" answer.)

Is the total number of search states (possible paths) affected by the choice of stack or queue?

How is memory use (the maximum number of states in Storage at one time) affected by the choice of underlying structure?

What is the Big-Oh runtime for the search algorithm? Does it reflect the maximum size of Storage? Does it reflect the number of board posisions? Does it reflect the number of paths explored? Does it reflect the maximum path length? Is it something else?

Does using one of the storage structures usually find a solution in fewer steps than the other? Always?

Does using either of the storage structures guarantee that the first solution found will be a shortest path?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!