adplus-dvertising

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.

frame-decoration

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 12 of 25

Explore more Topics under Data Structures and Algorithms

Q111.
Stack can be implemented using ___________ and _________.

a.

Array and Linked List

b.

Queue and Graphs

c.

Trees and Linked List

d.

Array and Graphs

Discuss
Answer: (a).Array and Linked List
Q112.
Well formed parenthesis can be checked using following data structure ?

a.

Queue

b.

Stack

c.

Hash Map

d.

List

Discuss
Answer: (b).Stack
Q113.
Post fix form of
A + (B * C)
is -

a.

AB * C +

b.

ABC * +

c.

AB + C *

d.

ABC + *

Discuss
Answer: (b).ABC * +
Q114.
Post fix form of -
(A + B) * C

a.

AB + C*

b.

ABC * +

c.

ABC + *

d.

AB * C +

Discuss
Answer: (a).AB + C*
Q115.
Consider following Scenario -

1. The five items : P,Q,R,S and T are inserted into stack A one after other starting from T in reverse order.

2. The stack is popped three times and each element is inserted into another stack B.

3. Then two elements are deleted from the stack B and pushed back onto the stack A.

What are the topmost elements of stack A and Stack B respectively?

a.

R P

b.

R Q

c.

Q R

d.

Q P

Discuss
Answer: (d).Q P
Q116.
If memory for the run-time stack is only 150 cells(words), how big can N be in Factorial(N) before stack overflow?

a.

12

b.

66

c.

60

d.

26

Discuss
Answer: (b).66
Q117.
Stack A has 3 Elements in it Say X,Y and Z with X on top.

1. Stack B is empty.
2. An Element popped out from Stack A can be printed immediately or pushed to stack B.
3. An Element popped out from Stack B can only be printed.

In this arrangement, which of the following permutations of X,Y,Z are not possible ?

a.

Y X Z

b.

Z X Y

c.

Y Z X

d.

Z Y X

Discuss
Answer: (b).Z X Y
Q118.
An item that is read as input can be either pushed to a stack and later popped and printed, or printed directly. Which of the following will be the output if the input is the sequence of items 1, 2, 3, 4, 5 ?

a.

5 4 3 1 2

b.

3 4 5 1 2

c.

3 4 5 2 1

d.

1 5 2 3 4

Discuss
Answer: (c).3 4 5 2 1
Q119.
Which of the following is a collection of items into which items can be inserted arbitrarity and from which only the smallest item can be removed?

a.

Fifo queue

b.

Ascending priority queue

c.

Descending priority queue

d.

None of these

Discuss
Answer: (b).Ascending priority queue
Q120.
A priority queue is used to implement a stack S that stores characters PUSH(C)is implemented as INSERT(Q,C,K)where K is an appropriate integer key chosen by the implementation.POP is implemented as DELETEMIN(Q)(Q). For a sequence of operations, the keys chosen are in

a.

Non-increasing order

b.

Non-decreasing order

c.

Strictly increasing order

d.

Strictly decreasing order

Discuss
Answer: (d).Strictly decreasing order
Page 12 of 25

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Computer Architecture

Unveil the science behind computer design with our Computer Architecture MCQs. Topics...

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...

Cyber Security

Understand the fundamentals of safeguarding digital assets with our Cyber Security...

IT Fundamentals

Navigate the basics of information technology with our IT Fundamentals MCQs. Get a...

Microprocessor

Understand the heart of your computer with our Microprocessor MCQs. Topics include...

UNIX

Become proficient with the Unix operating system using our UNIX MCQs. Learn about...

Wireless and Mobile Communications

Get to grips with modern communication technologies with our Wireless and Mobile...

Discrete Mathematics

Refine your mathematical skills essential for computer science with our Discrete...