(1) Modify the array implementation of a stack given so that (1) the bottom will be...

  

Transcribed Image Text:

(1) Modify the array implementation of a stack given so that (1) the bottom will be anchored to the low-indexed end of the array (position 1), and (2) the top will be the higher-indexed element of the ar- ray. Analyze the efficiency of the operations. (2) Modify the array implementation of a stack so that the top will always be the first position of the array. Compare its running time with the standard implementation. (3) Extend the specification of stack to include a function called searchstack that searches for a given element on a stack and returns its position in relation with the top. Write the function. Consider the case in which the element is not found. Provide the algorithm for the array implementation as well as for the pointer implementation. Provide also an implementation based on the standard operations of a stack. Estimate the running time of each version to determine the best option. (4) Write a program that checks whether an input string is a palindrome or not using a stack. (5) How can we efficiently implement 2 stacks when it is known that their mutual size does not exceed n? (1) Modify the array implementation of a stack given so that (1) the bottom will be anchored to the low-indexed end of the array (position 1), and (2) the top will be the higher-indexed element of the ar- ray. Analyze the efficiency of the operations. (2) Modify the array implementation of a stack so that the top will always be the first position of the array. Compare its running time with the standard implementation. (3) Extend the specification of stack to include a function called searchstack that searches for a given element on a stack and returns its position in relation with the top. Write the function. Consider the case in which the element is not found. Provide the algorithm for the array implementation as well as for the pointer implementation. Provide also an implementation based on the standard operations of a stack. Estimate the running time of each version to determine the best option. (4) Write a program that checks whether an input string is a palindrome or not using a stack. (5) How can we efficiently implement 2 stacks when it is known that their mutual size does not exceed n?

Answer rating: 100% (QA)

1 To modify the array implementation of a stack so that the bottom is anchored to the lowindexed end of the array position 1 and the top is the higherindexed element of the array we can simply reverse ... View the full answer