The term "push" and "pop" is related to the

Related Questions

• The term push and pop is related to
• Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?
• In stack terminology, the __________operations are known as push and pop operations respectively.
• What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?
• When the push operation is performed on stack the value of TOS will be ______
• Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
• Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?
• A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
• ……………. Is a pile in which items are added at one end and removed from the other.
• ………… is very useful in situation when data have to stored and then retrieved in reverse order.