McqMate
Login
Register
Home
Search
Login
Register
Computer Science Engineering (CSE)
Data Structure (DS)
In stack deletion operation is referred ...
Q.
In stack deletion operation is referred as _____
A.
push
B.
pop
C.
peek
D.
none of these
Answer» B. pop
View all MCQs in:
Data Structure (DS)
Discussion
Comment
Related Questions
Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
When a stack is organized as an array, a variable named Top is used to point to the top element of the stack. Initially, the value of Top is set to_______to indicate an empty stack.
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
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 a priority queue, insertion and deletion takes place at ………………
When the push operation is performed on stack the value of TOS will be ______
Which of the following is not the possible operation on stack?
Stack is also called as
What will be the value of top, if there is a size of stack STACK_SIZE is 5
Which is/are the application(s) of stack
Login to Continue
It will take less than 2 minutes
Continue with Google
Continue with Linkedin
Continue with Twitter
Report MCQ
Remark*
Report