Question

Suppose you are given a single array. You are required to implement two non-overlapping stack data structures Stack1 and Stack2 without making use of any other array or list (an additional set of integer variables is permitted.) That is, write algorithms (in pseudocode) four functions pushl(e), push2(e), pop1(), pop2(), is_empty1(), is_empty2(), and is_full() where push1, pop1, and is_empty1 are operations on Stack1, and push2, pop2, and empty2 are operations on Stack2. The function is_full returns 1 if and only if there is no empty slot in the array to insert items for either stack. Your implementation should allow push1 and push2 to successfully add items to the corresponding stack as long as there is at least one available empty slot in the array.

          Suppose you are given a single array. You are required to implement two non-overlapping stack data structures Stack1 and Stack2 without making use of any other array or list (an additional set of integer variables is permitted.) That is, write algorithms (in pseudocode) four functions pushl(e), push2(e), pop1(), pop2(), is_empty1(), is_empty2(), and is_full() where push1, pop1, and is_empty1 are operations on Stack1, and push2, pop2, and empty2 are operations on Stack2. The function is_full returns 1 if and only if there is no empty slot in the array to insert items for either stack. Your implementation should allow push1 and push2 to successfully add items to the corresponding stack as long as there is at least one available empty slot in the array.

Suppose you are given a single array. You are required to implement two non-overlapping stack data structures Stack1 and Stack2 without making use of any other array or list (an additional set of integer variables is permitted.) That is, write algorithms (in pseudocode) four functions pushl(e), push2(e), pop1(), pop2(), isempty1(), isempty2(), and isfull() where push1, pop1, and isempty1 are operations on Stack1, and push2, pop2, and empty2 are operations on Stack2. The function isfull returns 1 if and only if there is no empty slot in the array to insert items for either stack. Your implementation should allow push1 and push2 to successfully add items to the corresponding stack as long as there is at least one available empty slot in the array.

Added by John L.

Question

Please give Ace some feedback