McqMate
Sign In
Hamberger menu
McqMate
Sign in
Sign up
Home
Forum
Search
Ask a Question
Sign In
McqMate Copyright © 2025
→
Computer Science Engineering (CSE)
→
Data Structures (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
1.6k
0
Do you find this helpful?
11
View all MCQs in
Data Structures (DS)
Discussion
No comments yet
Login to comment
Related MCQs
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.
Pushing an element into stack already having five elements and stack size of 5, then stack becomes
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 stack, if a user tries to remove an element from empty stack it is called
In a priority queue, insertion and deletion takes place at ………………
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?
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?