Welcome to the Stacks and Queues MCQs Page

Dive deep into the fascinating world of Stacks and Queues with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Stacks and Queues, a crucial aspect of Data Structures and Algorithms. In this section, you will encounter a diverse range of MCQs that cover various aspects of Stacks and Queues, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Data Structures and Algorithms.

Check out the MCQs below to embark on an enriching journey through Stacks and Queues. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Data Structures and Algorithms.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Stacks and Queues. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Stacks and Queues MCQs | Page 7 of 25

Explore more Topics under Data Structures and Algorithms

01

Data Structures Basics

02

Data Types and Abstraction

03

Algorithm Complexity

04

Arrays and Pointers

05

Linked Lists

06

Recursion

07

Trees

08

Graphs

09

String Operations

10

Sorting and Searching

11

Object Oriented Programming

12

Dynamic Programming

Q61.

What is one of the common examples of a stack?

A pile of books

Bus stop

A basket of fruits

A carat of eggs

Discuss

Answer: (a).A pile of books

Q62.

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.

-1

Discuss

Answer: (a).-1

Q63.

What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?

Overflow

Underflow

Top

None of the above

Discuss

Answer: (a).Overflow

Q64.

The total number of elements in a stack at a given point of time can be calculated from the value of______.

Overflow

Top

Queues

Underflow

Discuss

Answer: (b).Top

Q65.

Jan Lukasiewicz, who suggested two alternative notations to represent an arithmetic expression belonged to which nationality?

English

Polish

German

Swedish

Discuss

Answer: (b).Polish

Q66.

In a computer system, when an __________ expression in an infix notation needs to be evaluated, it is first converted into its postfix notation?

Algebraic

Arithmetic

Trigonometric

Geometric

Discuss

Answer: (b).Arithmetic

Q67.

The postfix form of the following infix notation is :

(A + B)* (C*D − E)* F

AB + CD*E − *F*

AB+ CDE + − * F*

AB+ CD − EF + − **

ABCDEF* − + * +

Discuss

Answer: (a).AB + CD*E − *F*

Q68.

What are the sequence of popped out values if the sequence of operations - push(1), push(2), pop, push(1), push(2), pop, pop, pop, push(2), pop are performed on a stack.

2, 2, 1, 1, 2

2, 2, 1, 2, 2

2, 1, 2, 2, 1

2, 1, 2, 2, 2

Discuss

Answer: (a).2, 2, 1, 1, 2

Q69.

In conversion from prefix to postfix using stack data-structure, if operators and operands are pushed and popped exactly once, then the run-time complexity is ............

Ο(1)

Ο(n)

Ο(log n)

Ο(n^2)

Discuss

Answer: (b).Ο(n)

Q70.

push() and pop() functions are found in ...............

queues

lists

stacks

trees

Discuss

Answer: (c).stacks

Page 7 of 25

Welcome to the Stacks and Queues MCQs Page

Stacks and Queues MCQs | Page 7 of 25

Explore more Topics under Data Structures and Algorithms

Data Structures Basics

Data Types and Abstraction

Algorithm Complexity

Arrays and Pointers

Linked Lists

Recursion

Trees

Graphs

String Operations

Sorting and Searching

Object Oriented Programming

Dynamic Programming

Suggested Topics

Java Programming

Microprocessor

Web Technologies

Data Science

Cloud Computing

Embedded Systems

Cryptography and Network Security

Java Spring Framework

C# programming