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

Q1.

Stack is used for

CPU Resource Allocation

Breadth First Traversal

Recursion

None of the above

Discuss

Answer: (c).Recursion

Q2.

push() and pop() functions are found in

queues

lists

stacks

trees

Discuss

Answer: (c).stacks

Q3.

Minimum number of queues required for priority queue implementation?

Discuss

Answer: (d).2

Q4.

What data structure is used for breadth first traversal of a graph?

queue

stack

list

none of the above

Discuss

Answer: (a).queue

Q5.

A queue data-structure can be used for −

expression parsing

recursion

resource allocation

all of the above

Discuss

Answer: (c).resource allocation

Q6.

If locality is a concern, you can use _______ to traverse the graph.

Breadth First Search

Depth First Search

Either BFS or DFS

None of the above!

Discuss

Answer: (b).Depth First Search

Q7.

Aposterior analysis are more accurate than apriori analysis because −

it contains the real data.

it assumes all other factors to be dynamic.

it assumes all other factors to be constant.

it is a result of reverse-engineering.

Discuss

Answer: (b).it assumes all other factors to be dynamic.

Q8.

Prefix notation is also known as

Reverse Polish Notation

Reverse Notation

Polish Reverse Notation

Polish Notation

Discuss

Answer: (d).Polish Notation

Q9.

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)

Ο(n2)

Discuss

Answer: (b).Ο(n)

Q10.

If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?

Ο(n), Ο(n)

Ο(n), Ο(1)

Ο(1), Ο(n)

Ο(1), Ο(1)

Discuss

Answer: (d).Ο(1), Ο(1)

Page 1 of 25

Welcome to the Stacks and Queues MCQs Page

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

Digital Image Processing (DIP)

Software Engineering

Reverse Engineering

Neural Networks

Hadoop

CSS

Java Spring Framework

Discrete Mathematics

Wireless and Mobile Communications