The pseudocode of Figure 6.15 illustrates the basic push() and pop() operations of the based stack array. Assuming that this algorithm can be used in a concurrent execution environment, return answer the following questions: a. Which data has competitive status? b. How can the competitive situation be corrected?
push(item){ if (top < SIZE){ stack[top] = item; top++; } else ERROR } pop(){ if (!isempty()){ top--; return stack[top]; } else ERROR } isempty(){ if (top == 0) return true; else return false; }
push()
pop()
isempty()
var
This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)