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 14 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

Q131.

Using Pop (S1,Item) ,Push(S1, Item), Getlist(Item), Pop(S2,Item), and the variables S1,S2(stacks with Top1 and Top2) and Item and given the input file: A,B,C,D,E,F Which stack are possible?

No possible stacks with A,B,C,D,E and F

All possible stacks with A,B,C,D,E and F

Twice as many stacks as can be produced with S1 alone

Exact and only those stacks which can be produced with S1 alone

Discuss

Answer: (a).No possible stacks with A,B,C,D,E and F

Q132.

Following sequence of operations is performed on a stack push(1),push(2),pop, push(1),push(2)pop,pop,pop,push(2),pop.The sequence of poped out values are

2,1,2,2,1

2,1,2,2,2

2,2,1,1,2

2,2,1,2,2

Discuss

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

Q133.

In eveluating the arithmetic expression 2*3-(4+5),using stacks to evaluate its equivalent postfix form, which of the following stack configuration is not possible?

4 6

9 6

5 4 6

9 3 2

Discuss

Answer: (d).9 3 2

Q134.

Stack A has the entries a,b,c(with a on top). Stack B is empty.An entry popped out of stack A can be printed immediately or pushed to stack B.An entry popped out of the stack B can only be printed. In this arrangement, which of the following permutations of a,b,c are not possible?

b c a

b a c

c b a

c a b

Discuss

Answer: (d).c a b

Q135.

Stack can't be used to

Implement recursion

Evaluate an arithmetic expression in postfix form

Allocate resources(like CPU)by the operating system

Convert a given arithmetic expression in infix form to its evaluate postfix form

Discuss

Answer: (c).Allocate resources(like CPU)by the operating system

Q136.

Which of the following permutations can be obtained in the output(in the same order),using a stack assuming that the input is the sequence 1,2,3,4,5 in that order?

1,5,2,3,4

3,4,5,2,1

3,4,5,1,2

5,4,3,2,1

Discuss

Answer: (b).3,4,5,2,1

Q137.

Stack is useful for implementing

Radix

Recursion

Breadth first search

None of these

Discuss

Answer: (b).Recursion

Q138.

The postfix equivalent of the prefix * + a b - c d is

ab+cd-*

ab + cd * -

ab + - cd *

ab cd + - *

Discuss

Answer: (a).ab+cd-*

Q139.

Stacks cannot be used to

implement recursion

evaluate an arithmetic expression in postfix form

allocate resources (like CPU) by the operating system

convert a given arithmetic expression in infix form to its equivalent postfix form

Discuss

Answer: (c).allocate resources (like CPU) by the operating system

Q140.

The postifx expression for the infix expression A + B* (C+D) / F + D*E is

AB+CD + *F/ D+E*

A + *BCD/ F* DE ++

A*B + CD / F* DE ++

ABCD + *F / + DE* +

Discuss

Answer: (d).ABCD + *F / + DE* +

Page 14 of 25

Welcome to the Stacks and Queues MCQs Page

Stacks and Queues MCQs | Page 14 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

C Programming

Neural Networks

PHP

MS Office

Systems Programming

Object Oriented Programming Using C++

Data Science

UNIX

MongoDB