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.

##### 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.

# Data Structures :: Queue

Home > Data Structures > Queue > General Questions

#### Co. Cloud

1. How is Data in a queue accessed

| | | |

Explanation:

Here is no explanation for this answer

Workspace

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

| | | |

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. The dequeue process removes data from the front of the single ended queue

| | | |

Explanation:

Here is no explanation for this answer

Workspace

4. Time taken for addition of element in queue is

| | | |

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

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

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

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

7. 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?

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

9. 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 ?

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

10. 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?

| | | |