Problem 1
Indicate which structure would be a more suitable choice for each of the following applications by marking them as follows: A. Stack B. Queue C. Tree D. Binary search tree E. Graph A bank simulation of its teller operation to see how waiting times would be affected by adding another teller.
Problem 2
Indicate which structure would be a more suitable choice for each of the following applications by marking them as follows: A. Stack B. Queue C. Tree D. Binary search tree E. Graph A program to receive data that is to be saved and processed in the reverse order.
Problem 3
Indicate which structure would be a more suitable choice for each of the following applications by marking them as follows: A. Stack B. Queue C. Tree D. Binary search tree E. Graph An electronic address book, kept ordered by name.
Problem 4
Indicate which structure would be a more suitable choice for each of the following applications by marking them as follows: A. Stack B. Queue C. Tree D. Binary search tree E. Graph A word processor with a PF key that causes the preceding command to be redisplayed; every time the PF key is pressed, the program is to show the command that preceded the one currently displayed.
Problem 5
Indicate which structure would be a more suitable choice for each of the following applications by marking them as follows: A. Stack B. Queue C. Tree D. Binary search tree E. Graph A dictionary of words used by a spell checker to be built and maintained.
Problem 6
Indicate which structure would be a more suitable choice for each of the following applications by marking them as follows: A. Stack B. Queue C. Tree D. Binary search tree E. Graph A program to keep track of patients as they check into a medical clinic, assigning patients to doctors on a first-come, first-served basis.
Problem 7
Indicate which structure would be a more suitable choice for each of the following applications by marking them as follows: A. Stack B. Queue C. Tree D. Binary search tree E. Graph A program keeping track of where canned goods are located on a shelf.
Problem 8
Indicate which structure would be a more suitable choice for each of the following applications by marking them as follows: A. Stack B. Queue C. Tree D. Binary search tree E. Graph A program to keep track of the soccer teams in a city tournament.
Problem 9
Indicate which structure would be a more suitable choice for each of the following applications by marking them as follows: A. Stack B. Queue C. Tree D. Binary search tree E. Graph A program to keep track of family relationships.
Problem 10
Indicate which structure would be a more suitable choice for each of the following applications by marking them as follows: A. Stack B. Queue C. Tree D. Binary search tree E. Graph A program to maintain the routes in an airline.
