List of top Computer Science Questions on Introduction to stack (LIFO Operations) asked in CUET (UG)

A stack follows ______ principle.

You try to pop an element from a stack which is empty. This can result into a special kind of condition, which is known as ________.

Which out of the following can be picked as the application of stack ?

if len(Stack) =0 : print("error") The above statement is handling the situation called :

identify the stack in given example :

Which one of the fallowing statement is wrong for Queue and stack data structures ?

There are five statements listed below. Each statement having some information related to data structure. Identify the correct statement(s).
(A) A stack is an example of a FIFO data structure 
(B) The function top() removes the value from the top of a stack 
(C) The term deque stands for double ended queue 
(D) A queue is a data structure in which items can be added or removed from either end 
(E) PEEK is an operation used to view elements at the front of the queue, without removing it from the queue 
Choose the correct answer from the options given below: