# Data Structures :: Queue

Home > Technical Aptitude > Data Structures > Queue > General Questions

NA
SHSTTON
265
Solv. Corr.
96
Solv. In. Corr.
361
Attempted
0 M:15 S
Avg. Time

1 / 42

Choose the correct option.

How is Data in a queue accessed

AFirst in First out

BFirst in last out

CLast in First out

DNone of these

| | | Asked In BOA (Bank of America) |

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
752
Solv. Corr.
155
Solv. In. Corr.
907
Attempted
0 M:27 S
Avg. Time

2 / 42

Choose the correct option.

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

ATRUE

BFALSE

CNone of these

| | | Asked In BOA (Bank of America) |

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

NA
SHSTTON
626
Solv. Corr.
247
Solv. In. Corr.
873
Attempted
0 M:19 S
Avg. Time

3 / 42

Choose the correct option.

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

ATRUE

BFALSE

CNone of these

| | | Asked In BOA (Bank of America) |

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
170
Solv. Corr.
678
Solv. In. Corr.
848
Attempted
0 M:15 S
Avg. Time

4 / 42

Choose the correct option.

Time taken for addition of element in queue is

AO(1)

BO(n)

CO(log n)

DNone of these options

| | | Asked In BOA (Bank of America)Societe Generale |

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

NA
SHSTTON
592
Solv. Corr.
186
Solv. In. Corr.
778
Attempted
2 M:38 S
Avg. Time

5 / 42

Choose the correct option.

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

Aqueue.

Bstack.

Ctree.

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
454
Solv. Corr.
286
Solv. In. Corr.
740
Attempted
0 M:15 S
Avg. Time

6 / 42

Choose the correct option.

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

Aqueue

Bstack

Carray

Dtree

| | | Asked In Societe Generale |

Explanation:

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

Workspace

NA
SHSTTON
342
Solv. Corr.
282
Solv. In. Corr.
624
Attempted
0 M:35 S
Avg. Time

7 / 42

Choose the correct option.

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?

Afront = 2 rear = 5 queue = ______; L, M, N, O, ___

Bfront = 3 rear = 5 queue = L, M, N, O, ___

Cfront = 3 rear = 4 queue = ______; L, M, N, O, ___

Dfront = 2 rear = 4 queue = L, M, N, O, ___

| | | Asked In Societe Generale |

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

NA
SHSTTON
651
Solv. Corr.
39
Solv. In. Corr.
690
Attempted
0 M:0 S
Avg. Time

8 / 42

Choose the correct option.

A queue is a,

AFIFO (First In First Out) list.

BLIFO (Last In First Out) list.

COrdered array.

DLinear tree.

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
429
Solv. Corr.
218
Solv. In. Corr.
647
Attempted
0 M:0 S
Avg. Time

9 / 42

Choose the correct option.

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 ?

AQueue

BTree

CStack

DHash Table

| | | Asked In Societe Generale |

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
32
Solv. Corr.
548
Solv. In. Corr.
580
Attempted
0 M:0 S
Avg. Time

10 / 42

Choose the correct option.

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?

A(rear + 1) % CAPACITY

Brear + (1 % CAPACITY)

Crear % (1 + CAPACITY)

D(rear % 1) + CAPACITY

| | | Asked In Societe Generale |

Explanation:

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

Workspace