Define a function named stackToQueue. This function expects a stack as an argument.

1. Using the format of Table 15.2, complete a table that involves the following sequence of queue operations:

Label your answer columns using the following wording: State of the Queue After the Operation; Value Returned; and Comment.

2. Define a function named stackToQueue. This function expects a stack as an argument. The function builds and returns an instance of LinkedQueue that contains the elements in the stack. The function assumes that the stack has the interface described in Chapter 14. The function’s postconditions are that the stack is left in the same state as it was before the function was called, and that the queue’s front element is the one at the top of the stack.

find the cost of your paper

Suggest a modification of the binary search algorithm that emulates this strategy for a list of names.

1. Suppose that a list contains the values 20 44 48 55 62 66 74 88 93 99 at index positions 0 through 9. Trace the values of the variables….

Explain why insertion sort works well on partially sorted lists.

1. Which configuration of data in a list causes the smallest number of exchanges in a selection sort? Which configuration of data causes the largest number of exchanges? 2. Explain….

Draw a class diagram that shows the relationships among the classes in this new version of the system

Jack decides to rework the banking system, which already includes the classes BankView, Bank, SavingsAccount, and RestrictedSavingsAccount. He wants to add another class for checking accounts. He sees that savings….