# Data Structures :: Queue

Home > Technical Aptitude > Data Structures > Queue > General Questions
NA
SHSTTON
350
Solv. Corr.
134
Solv. In. Corr.
484
Attempted
0 M:14 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

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
962
Solv. Corr.
196
Solv. In. Corr.
1158
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

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
792
Solv. Corr.
322
Solv. In. Corr.
1114
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

Explanation:

Data inserted first, will leave the queue first i.e. FIFO(First-in-First-Out). The process to add an element into queue is called Enqueue and the process of removal of an element from queue is called "Dequeue".

Workspace

NA
SHSTTON
253
Solv. Corr.
831
Solv. In. Corr.
1084
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

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
762
Solv. Corr.
235
Solv. In. Corr.
997
Attempted
1 M:55 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:

In a queue, one end is always used to insert data (enqueue) and the other is used to delete data (dequeue), because queue is open at both its ends.

Workspace

NA
SHSTTON
592
Solv. Corr.
350
Solv. In. Corr.
942
Attempted
0 M:16 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

Explanation:

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

Workspace

NA
SHSTTON
463
Solv. Corr.
357
Solv. In. Corr.
820
Attempted
0 M:37 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, ___

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
829
Solv. Corr.
53
Solv. In. Corr.
882
Attempted
0 M:4 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:

queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) manner.

Workspace

NA
SHSTTON
568
Solv. Corr.
295
Solv. In. Corr.
863
Attempted
0 M:26 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

Explanation:

option C is correct. 1 is added at the last and deleted the first.following the concept of lifo stack is the answer

Workspace

NA
SHSTTON
43
Solv. Corr.
724
Solv. In. Corr.
767
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

Explanation:

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

Workspace

## Data Structures Queue Questions and Answers pdf

At Data Structures topic Queue, you will get multiple online quiz difficulty wise, which will have a total of 6 quizzes, categorized as easy, medium, and moderate level. While preparing for any Queue, take all the list quiz and check your preparation level for that topic. Each quiz have 10 different question, which needs to be answered in 20 min., all the listed quiz here is free, however, you will get only one chance for each quiz to attempt(Take Quiz seriously), so it is always recommended to take one quiz in each section before you start solving Queue MCQs practice question, and one after solving all the question of the respective level, you can refer back your Queue quiz result any time or you can download it as pdf for reference.

## Data Structures Quiz Online Test

The details of the Data Structures quiz are as follows. There are 10 questions for you. You have to answer them in 20 minutes. Within 20 minutes you have to see the errors in the sentences given as a question. Four options are also given to you, and you have to choose your opinion. You must be confident in your answer that the choices are difficult. Therefore, below we provide you with some information about Data Structures that you see and keep them in mind while answering questions.

## Data Structures MCQs Practice Questions with Answer

On this section of page you will find the easiest quickest ways to solve a question, formulas, shortcuts and tips and tricks to solve various easiest methods to solve Data Structures Question Quickly. It contains all the Data Structures topic Queue questions which are common in any of the preliminary exams of any company. The solution is provided along with the questions. The practice of these questions is a must as they are easy as well as scoring and asked in all the exams They will confirm the selection if all the questions attempted wisely with little practice. It is recommanded to Take Mock test based on Data Structures topic and Queue topic based quiz.

## Data Structures solved examples question

You can get here fully solved Queue examples with a detailed answer and description. You can solve Queue problems with solutions, the questions by companies wise by filtering the questions, additionally, you can check what type of questions are being asked in IT companies Written Round from Queue. Queue became one of the most important sections in the entire competitive exams, Companies Campus, and entrance online test. Go through Queue Examples, Queue sample questions. You can Evaluate your level of preparation in Queue by Taking the Q4Interivew Queue Online Mock Test based on most important questions. All the Queue practice questions given here along with answers and explanations are absolutely free, you can take any number of time any mock Test.

## Why Data Structures Queue?

In this practice section, you can practice Data Structures Questions based on "Queue" and improve your skills in order to face the interview, competitive examination, IT companies Written exam, and various other entrance tests (CAT, GATE, GRE, MAT, Bank Exam, Railway Exam etc.) with full confidence.

## Where can I get Data Structures Queue questions and answers with explanation?

Q4Interview provides you lots of fully solved Data Structures (Queue) questions and answers with Explanation. Solved examples with detailed answer description, explanation are given and it would be easy to understand. You can download Data Structures Queue quiz questions with answers as PDF files and eBooks.

## Where can I get Data Structures Queue Interview Questions and Answers (objective type, multiple-choice, quiz, solved examples)?

Here you can find objective type Data Structures Queue questions and answers for interview and entrance examination. Multiple choice and true or false type questions are also provided.

#### Queue Toughest Qs.

Aayushi Kumari1 month ago
Thank you