Chapter 5: ADTs Stack and oueue 302 There usually is more than one functionally correct design for the same requirements and specifications When correct ution is the best there problem may determine you find that structures a design off. A more complex algorithm may result in more execution: a ition memory space. always, we must base longer to execute may save the problem's requirements. decisions on what we know about Exercises a suitable data structure for each of the 1. Indicate whether a stack would be lowing applications. expressions according to the specific order a. A program to evaluate arithmetic wr of operators. to see how waiting times b. A bank simulation of its teller operation affected by adding another teller. processed in the A program to receive data that are to be saved and order. d. An address book to be maintained. e. A word processor to have a PF key that causes the preceding command to redisplayed. Every time the user presses the PF key, program shows the command that preceded the one currently displayed. f A dictionary of words used by a spelling checker to be built and maintained g. A program to keep track of patients as they check into a medical clini assigning patients to doctors on a first come, first served basis. h. A data structure used to keep track of the return addresses for nested func- tions while a program is running. 2. Describe the accessing protocol of a stack at the abstract level. 3. show what is written by the following segments of code, given that iteml iten2, and item are int variables. a. StackType stack: itenl 1: item2 0: iten3 stack Push item 2) stack, Push (iteml) stack. Push (iteml iten3) item2 stack. Top stack. Pop stack Push (item 3 item3) Chapter 5: ADTs Stack and oueue 302 There usually is more than one functionally correct design for the same requirements and specifications When correct ution is the best there problem may determine you find that structures a design off. A more complex algorithm may result in more execution: a ition memory space. always, we must base longer to execute may save the problem's requirements. decisions on what we know about Exercises a suitable data structure for each of the 1. Indicate whether a stack would be lowing applications. expressions according to the specific order a. A program to evaluate arithmetic wr of operators. to see how waiting times b. A bank simulation of its teller operation affected by adding another teller. processed in the A program to receive data that are to be saved and order. d. An address book to be maintained. e. A word processor to have a PF key that causes the preceding command to redisplayed. Every time the user presses the PF key, program shows the command that preceded the one currently displayed. f A dictionary of words used by a spelling checker to be built and maintained g. A program to keep track of patients as they check into a medical clini assigning patients to doctors on a first come, first served basis. h. A data structure used to keep track of the return addresses for nested func- tions while a program is running. 2. Describe the accessing protocol of a stack at the abstract level. 3. show what is written by the following segments of code, given that iteml iten2, and item are int variables. a. StackType stack: itenl 1: item2 0: iten3 stack Push item 2) stack, Push (iteml) stack. Push (iteml iten3) item2 stack. Top stack. Pop stack Push (item 3 item3)