Question
a.
push, pop
b.
pop, push
c.
insert, delete
d.
delete, insert
Posted under Stacks and Queues Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. 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.
Similar Questions
Discover Related MCQs
Q. ……………. Is a pile in which items are added at one end and removed from the other.
View solution
Q. Which data structure allows deleting data elements from and inserting at rear?
View solution
Q. A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
View solution
Q. Which data structure is used in breadth first search of a graph to hold nodes?
View solution
Q. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
View solution
Q. In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
View solution
Q. In a circular queue the value of r will be ..
View solution
Q. Which of the following statement is true?
i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.
ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
View solution
Q. What will be the value of top, if there is a size of stack STACK_SIZE is 5
View solution
Q. ………… is not the operation that can be performed on queue.
View solution
Q. Which of the following is not the type of queue?
View solution
Q. Which is/are the application(s) of stack
View solution
Q. A data structure where elements can be added or removed at either end but not in the middle is called …
View solution
Q. When does top value of the stack changes?
View solution
Q. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
View solution
Q. In a priority queue, insertion and deletion takes place at ………………
View solution
Q. Which of the following is an application of stack?
View solution
Q. Which of the following name does not relate to stacks?
View solution
Q. The term "push" and "pop" is related to the
View solution
Q. A data structure where elements can be added or removed at either end but not in the middle
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
