# HackWitjInfy Queue Quiz-1

Question 1

Time: 00:00:00
Which among the following is true about Queues?

i:)These are abstract data structures

ii:)These follows the FIFO order

iii.)Insertion and deletion is performed at one end only

i and ii

i and ii

ii and iii

ii and iii

i and iii

i and iii

i,ii,iii

i,ii,iii

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

Start

Question 2

Time: 00:00:00
Queues in the application areas are implied as the __________

templates parameters

templates parameters

member types

member types

functions

functions

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

Start

Question 3

Time: 00:00:00
Different types of Queues are

circular queue

circular queue

priority queue

priority queue

doubly ended queue

doubly ended queue

all of the above

all of the above

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

Start

Question 4

Time: 00:00:00
To implement a stack,how many ques are required?

one

one

two

two

three

three

four

four

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

Start

Question 5

Time: 00:00:00
The Priority queue of pairs can have two types of ordering –

Ordered by the first element of pair

Ordered by the first element of pair

Ordered by the second element of pair

Ordered by the second element of pair

Either a and b

Either a and b

Both a and b

Both a and b

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

Start

Question 6

Time: 00:00:00
Which among the following is an application of queue?

i:)Flood Fill Algorithm

ii:)Chess Knight Problem

iii:)Shortest path in a maze

i and ii

i and ii

ii and iii

ii and iii

i and iii

i and iii

i,ii,iii

i,ii,iii

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

Start

Question 7

Time: 00:00:00
What is the benefit of using a circular queue?

The iterator can comeback to start when he reaches last

The iterator can comeback to start when he reaches last

There is no end iterator for circular queue

There is no end iterator for circular queue

a and b

a and b

None of the above

None of the above

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

Start

Question 8

Time: 00:00:00
What are the basic queue operations?

Enqueue and Dequeue

Enqueue and Dequeue

isEmpty and isFull

isEmpty and isFull

front

front

all of the above

all of the above

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

Start

Question 9

Time: 00:00:00
Priority Queue is the extension of the queue comprising the features.

1. Each object has its related priority.

2. The high priority element is dequeued from the low priority element.

3. If two elements have the same priority, any of them are executed

i and ii

i and ii

ii and iii

ii and iii

i and iii

i and iii

i,ii,iii

i,ii,iii

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

Start

Question 10

Time: 00:00:00
The C++ containers used to build priority queues:-

vectors

vectors

deques.

deques.

a and c

a and c

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%