MCQs

Disclaimer:

Educational Use Only:

The website links provided are to be used strictly for educational and knowledge-gaining purposes only.

No Misuse:

Do not misuse the links or the information contained therein for any commercial, illegal, or unethical activities.

Respect for Websites and Businesses:

Respect the intellectual property and business interests of the websites and their owners. Do not attempt to alter, copy, or redistribute content without proper authorization.

Acknowledge Value of Knowledge:

Recognize and value the knowledge and resources shared by these websites. Use the information responsibly and ethically.

No Endorsement:

The provision of these links does not imply endorsement of the linked sites, their content, or their products and services. Users are responsible for evaluating the suitability and accuracy of the information.

User Responsibility:

By accessing these links, you agree to use the information at your own risk and to comply with all applicable laws and website terms of use.

Overall MCQs for Reference

Which principle does a stack follow?
a. FIFO
b. LIFO
c. LILO
d. FILO
Answer: b. LIFOexamveda+1
What is the main operation used to remove an element from a stack?
a. Insert
b. Peek
c. Pop
d. Push
Answer: c. Poptestbook+1
Which operation adds an element to the stack?
a. Pop
b. Insert
c. Push
d. Append
Answer: c. Pushsanfoundry+1
What is the time complexity of a push operation in an array-based stack?
a. O(log n)
b. O(n)
c. O(n^2)
d. O(1)
Answer: d. O(1)acceldata+1
What does stack overflow refer to?
a. Inserting in an empty stack
b. Removing from a stack
c. Exceeding stack capacity
d. Searching stack
Answer: c. Exceeding stack capacityscribd+1
Which of the following is NOT an application of a stack?
a. Expression evaluation
b. Managing function calls
c. Breadth-first search
d. Parentheses checking
Answer: c. Breadth-first searchgeeksforgeeks+1
What happens when you try to pop from an empty stack?
a. Overflow
b. Underflow
c. Top set to 0
d. Stack full
Answer: b. Underflowexamveda+1
Which data structure is used for implementing recursion?
a. Array
b. Queue
c. Linked list
d. Stack
Answer: d. Stacksurakuacademy+1
Which term describes the top element of a stack?
a. Front
b. Rear
c. Head
d. Top
Answer: d. Topscribd+1
What is a common application of stacks in computer languages?
a. Memory management
b. Function calls
c. String searching
d. Sorting
Answer: b. Function callsalmabetter+1
When is a stack considered empty?
a. Top = 0
b. Top = max size
c. Top = -1
d. Top = n
Answer: c. Top = -1surakuacademy+1
In infix to postfix conversion, what data structure is essential?
a. Array
b. Queue
c. Stack
d. Tree
Answer: c. Stacksrinix+1
Which of these is true for a stack’s linked list implementation?
a. Stack grows in both directions
b. No need for a fixed size
c. Only for numbers
d. Cannot be dynamic
Answer: b. No need for a fixed sizeacceldata+1
For expression evaluation, stacks are mainly used to:
a. Store results
b. Store operators
c. Store memory
d. Store arrays
Answer: b. Store operatorssimplilearn+1
Which scenario is solved using a stack?
a. Backtracking
b. Random access
c. Indexing
d. Hashing
Answer: a. Backtrackingsimplilearn+1
Which notation uses stacks for evaluation?
a. Prefix
b. Postfix
c. Infix
d. Both a and b
Answer: d. Both a and bgeeksforgeeks+1
What is the space complexity of a stack implemented via array?
a. O(log n)
b. O(n)
c. O(1)
d. O(n^2)
Answer: b. O(n)examveda+1
Which operation retrieves but does NOT remove the top element?
a. Pop
b. Push
c. Peek
d. Insert
Answer: c. Peektestbook+1
When a stack is full, which error condition occurs?
a. Underflow
b. Overflow
c. Null pointer exception
d. Deadlock
Answer: b. Overflowscribd+1
Which of the following is used for Undo/Redo functionality?
a. Queue
b. HashMap
c. Stack
d. Tree
Answer: c. Stackalmabetter+1
How does stack help in checking balanced parentheses?
a. Storing strings
b. Counting brackets
c. Tracking opening brackets
d. Reversing string
Answer: c. Tracking opening bracketsgeeksforgeeks+1
If five items are pushed onto a stack then popped one at a time, which is removed first?
a. First pushed
b. Last pushed
c. Middle
d. None
Answer: b. Last pushedexamveda+1
In stack, which pointer is updated during push and pop?
a. Start
b. End
c. Top
d. Rear
Answer: c. Topsurakuacademy+1
Which operation will increase the value of ‘top’ in stack?
a. Pop
b. Peek
c. Push
d. Search
Answer: c. Pushtestbook+1
Which data structure is NOT typically used for depth-first search?
a. Stack
b. Queue
c. Recursion
d. None
Answer: b. Queuesimplilearn+1
What is a stack frame?
a. A stack overflow
b. A single memory block
c. Structure for function call context
d. Array index
Answer: c. Structure for function call contextalmabetter+1
Which stack operation has constant time complexity?
a. Push
b. Pop
c. Peek
d. All of these
Answer: d. All of theseacceldata+1
What does the stack ‘top’ refer to?
a. Lowest memory location
b. Highest memory location
c. Middle of stack
d. Linked list head
Answer: b. Highest memory locationscribd+1
In C, what value is assigned to ‘top’ when a stack is initialized?
a. 0
b. -1
c. 1
d. n
Answer: b. -1surakuacademy+1
Which of the following uses stack for its operation?
a. Reversing strings
b. Sorting arrays
c. Binary search
d. Traversing trees
Answer: a. Reversing stringsgeeksforgeeks+1
What is the maximum number of elements in a stack of size 10?
a. 1
b. 9
c. 10
d. 11
Answer: c. 10examveda+1
What condition indicates stack underflow?
a. Top == -1
b. Top == max_size
c. Top == 0
d. Data == NULL
Answer: a. Top == -1scribd+1
Which application needs stacks for syntax parsing?
a. Arithmetic calculation
b. Compilers
c. Sorting
d. Searching
Answer: b. Compilerssimplilearn+1
Stacks are used in memory management to:
a. Allocate objects randomly
b. Track memory blocks in use
c. Sort memory addresses
d. Merge memory regions
Answer: b. Track memory blocks in useenjoyalgorithms+1
What is the role of stack in recursion?
a. Storing results
b. Storing return addresses
c. Storing input data
d. None
Answer: b. Storing return addressessurakuacademy+1
Which operation cannot be performed on an empty stack?
a. Push
b. Pop
c. Search
d. Peek
Answer: b. Popscribd+1
What will happen if you keep pushing elements to a limited stack?
a. Underflow
b. Infinite loop
c. Overflow
d. None
Answer: c. Overflowscribd+1
Which statement correctly describes stack’s order?
a. The entries are stored in a linked list
b. Stack entries may be compared with the ‘<‘ operation
c. There is a sequential entry one by one
d. Stack is unordered
Answer: c. There is a sequential entry one by onesanfoundry+1
Which of these describes stack memory usage?
a. Memory is allocated dynamically
b. Memory is fixed
c. Memory grows and shrinks as needed
d. Both a and c
Answer: d. Both a and cenjoyalgorithms+1
In practical application, stacks are used for:
a. Storing arrays
b. Tracking caller contexts
c. Sorting numbers
d. Searching text
Answer: b. Tracking caller contextsalmabetter+1
Which data structure helps in solving the stock span problem?
a. Queue
b. Tree
c. Array
d. Stack
Answer: d. Stackgeeksforgeeks+1
When is stack preferred over queue?
a. When LIFO needed
b. When FIFO needed
c. When searching elements
d. When sorting elements
Answer: a. When LIFO neededacceldata+1
Which of the following explains stack’s dynamic resizing?
a. Fixed arrays
b. Linked lists
c. Hash tables
d. None
Answer: b. Linked listsacceldata+1
Which error occurs if an operation is performed on an empty stack?
a. Index out of bounds
b. Stack underflow
c. Segmentation fault
d. Stack overflow
Answer: b. Stack underflowexamveda+1
What is an abstract data type associated with stacks?
a. List
b. Map
c. Stack
d. Set
Answer: c. Stackenjoyalgorithms+1
Which stack operation is checked for overflow?
a. Pop
b. Push
c. Peek
d. Search
Answer: b. Pushscribd+1
What is the best use of stack in expression conversion?
a. Copying strings
b. Balancing operators
c. Converting infix to postfix
d. Merging arrays
Answer: c. Converting infix to postfixsrinix+1
Stacks in Data Science are mainly used for:
a. Sorting values
b. Data storage
c. Sequence management
d. Backtracking algorithms
Answer: d. Backtracking algorithmssimplilearn+1
Stack is best suited for which kind of parsing?
a. Syntax parsing
b. Binary parsing
c. Data parsing
d. Image parsing
Answer: a. Syntax parsinggeeksforgeeks+1
What is the main advantage of stacks over queues?
a. Fast search
b. Constant time access
c. Efficient LIFO operations
d. Fixed size
Answer: c. Efficient LIFO operationsacceldata+1

Blog

Systemethic Technologies

Leave a Reply Cancel reply

Useful links

Other Terms & Policies

Contact Info