# HackWithInfy Queue Quiz-2

Question 1

Time: 00:00:00
A priority queue is introduced by building a data system explicitly called:-

binary trees

binary trees

b-trees

b-trees

heap

heap

list

list

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 2

Time: 00:00:00
Monotone priority queues are queues for the

the case where no item is ever inserted that has a lower priority

the case where no item is ever inserted that has a lower priority

the case where no item is ever inserted that has a higher priority

the case where no item is ever inserted that has a higher priority

a and b

a and b

none of these

none of these

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 3

Time: 00:00:00
The double-ended queue is often named as

deque

deque

deck

deck

all

all

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 4

Time: 00:00:00
In a doubly ended queue,elements cannot be inserted at:-

at the end

at the end

at the beginning

at the beginning

at the middle

at the middle

at the tail

at the tail

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 5

Time: 00:00:00

one

one

two

two

three

three

a or b

a or b

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 6

Time: 00:00:00
What is true about an  input-restricted deck?

deletion can be made from both ends, but insertion can be made at one end only.

deletion can be made from both ends, but insertion can be made at one end only.

insertion can be made from both ends, but deletion can be made at one end only.

insertion can be made from both ends, but deletion can be made at one end only.

deletion and insertion can be made at one end only.

deletion and insertion can be made at one end only.

a and b

a and b

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 7

Time: 00:00:00
What is true about an  output-restricted double ended queue?

deletion can be made from both ends, but insertion can be made at one end only.

deletion can be made from both ends, but insertion can be made at one end only.

insertion can be made from both ends, but deletion can be made at one end only.

insertion can be made from both ends, but deletion can be made at one end only.

deletion and insertion can be made at one end only.

deletion and insertion can be made at one end only.

a and b

a and b

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 8

Time: 00:00:00
Applications of Priority Queue:

CPU Scheduling

CPU Scheduling

Dijkstra’s shortest path algorithm

Dijkstra’s shortest path algorithm

Prim’s Minimum Spanning Tree

Prim’s Minimum Spanning Tree

all

all

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 9

Time: 00:00:00
What are the ways to efficiently implement a deque-

dynamic array

dynamic array

a and b

a and b

None of these

None of these

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 10

Time: 00:00:00
What are the basic operations on a deck are :-

enqueue on either end.

enqueue on either end.

append and peek

append and peek

enqueue and dequeue on either end.

enqueue and dequeue on either end.

peek on both ends

peek on both ends

Once you attempt the question then PrepInsta explanation will be displayed.

Start

["0","40","60","80","100"]
["Need more practice!","Keep trying!","Not bad!","Good work!","Perfect!"]

Personalized Analytics only Availble for Logged in users

Analytics below shows your performance in various Mocks on PrepInsta

Your average Analytics for this Quiz

Rank

-

Percentile

0%

Completed

0/0

Accuracy

0%