Note 1

Take Note:

Take a note while surfing.





Note With Ink

Give your Note a Colorful Tag.




Easy to Access

Stay on same information and in Sync wherever you are.

Note 2

Take Note:

Organize your information,It may take Shape.





Think With Ink

Differ your Content by Color.




Easy to Access

Easy to pull up your content from anywhere anytime.

Note 3

Take Note:

Don't Let information to miss,Because it take shape





Note With Ink

Simple an Easy Way to take a note.




Easy to Access

Get the same in next visit.


Please wait...

  Take Quiz (Monsoon) Beta Version !!
  Do You have Qs. in your Mind ??? Ask it as Qs. or MCQs or create it as polling Live Now !!

Data Structures :: Queue

Home > Data Structures > Queue > General Questions

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace

2 / 15

 Item in priority queue can jump to the front on the line if they have priority

Answer: Option A

Explanation:

A priority queue is similar to a simple queue in that items are organized in a line and processed sequentially. However, items on a priority queue can jump to the front of the line if they have priority. Priority is a value that is associated with each item placed in the queue.

Workspace

3 / 15

 The dequeue process removes data from the front of the single ended queue

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace

4 / 15

 Time taken for addition of element in queue is

Answer: Option C

Explanation:

I think this answer should be A. O(1). because this question is asked about the normal queue.



For priority queue this should be O(log n).

Workspace

5 / 15

 A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

6 / 15

 The data structure required for Breadth First Traversal on a graph is

Answer: Option A

Explanation:

queue is not a graph type, is a linear type, but how can it answer


Workspace


Tags:  No Tags on this question yet!

7 / 15

 Let the following circular queue can accommodate maximum six elements with the following data
front = 2 rear = 4
queue = _______; L, M, N, ___, ___
What will happen after ADD O operation takes place?

Answer: Option A

Explanation:

Because Queue is FIFO so when we add 0 its obvious that it will come after N at position 5.


2. L

3.M

4.N

and when add o in this Queue as its FIFO it comes at position 5

5.O

6.

Workspace


Tags:  No Tags on this question yet!

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

9 / 15

 6, 8, 4, 3, and 1 are inserted into a data structure in that order. An item is deleted using only a basic data structure operation. If the deleted item is a 1, the data structure cannot be a ?

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

10 / 15

 We need to implement a queue using a circular array. If DATA is a circular array of CAPACITY elements, and rear is an index into that array, what will be the index for the element after rear?

Answer: Option D

Explanation:

option A should be correct, modulus of a will always be zero in case of integer value.

Workspace


Tags:  No Tags on this question yet!