Stacks in Data Structures MCQ question and answer with solution

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. Push

B. Pop

C. Peek

D. Size

A. Last In First Out

B. Last In Last Out

C. First In First Out

D. First In Last Out

A. By using a singly linked list

B. By using a doubly linked list

C. By using a circular linked list

D. All of the above

A. Queue

B. Stack

C. Linked list

D. Binary Tree

A. An error is thrown

B. The stack returns null

C. The stack remains unchanged

D. It creates a new stack

A. Check if the top pointer is null

B. Check if the size is zero

C. Check if the top pointer is zero

D. Check if the last element is null

A. Pop

B. Push

C. Peek

D. Size

A. For implementing recursion

B. For implementing a queue

C. For implementing a graph

D. For implementing a priority queue

A. By using a dynamic array

B. By using a linked list

C. By using a fixed-size array

D. By using a hash table