Data Structure (QUEUE)
a year ago
riyxh.99_71878
Save
Edit
Host a game
Live GameLive
Homework
Solo Practice
Practice
• Question 1
30 seconds
Q.

Which one of the following is an application of Queue Data Structure?

When a resource is shared among multiple consumers.

When data is transferred asynchronously (data not necessarily received at same rate as sent) between two processes

All of the above

• Question 2
30 seconds
Q.

How many stacks are needed to implement a queue. Consider the situation where no other data structure like arrays, linked list is available to you.

1

2

3

4

• Question 3
30 seconds
Q.

How many queues are needed to implement a stack. Consider the situation where no other data structure like arrays, linked list is available to you.

1

2

3

4

• Question 4
45 seconds
Q.

A priority queue can efficiently implemented using which of the following data structures? Assume that the number of insert and peek (operation to see the current highest priority item) and extraction (remove the highest priority item) operations are almost same.

Array

Heap Data Structure like Binary Heap, Fibonacci Heap

None of the above

• Question 5
45 seconds
Q.

Which of the following is true about linked list implementation of queue?

In the push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.

In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.

None of the above

• Question 6
30 seconds
Q.

A Priority-Queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is given below :

10, 8, 5, 3, 2

Two new elements “1” and “7” are inserted in the heap in that order. The level-order traversal of the heap after the insertion of the elements is :

10, 8, 7, 5, 3, 2, 1

10, 8, 7, 2, 3, 1, 5

10, 8, 7, 1, 2, 3, 5

10, 8, 7, 3, 2, 1, 5

• Question 7
45 seconds
Q.

A queue is implemented using array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT (n refers to the number of items in the queue) ?

Both operations can be performed in O(1) time

At most one operation can be performed in O(1) time but the worst case time for the other operations will be Ω(n)

The worst case time complexity for both operations will be Ω(n)

Worst case time complexity for both operations will be Ω(log n)

• Question 8
45 seconds
Q.

Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which of the following statement is true with respect to this modified stack?

A queue cannot be implemented using this stack.

A queue can be implemented where ENQUEUE takes a single instruction and DEQUEUE takes a sequence of two instructions.

A queue can be implemented where ENQUEUE takes a sequence of three instruction and DEQUEUE takes a single instruction.

A queue can be implemented where both ENQUEUE and DEQUEUE takes a single instruction each

• Question 9
45 seconds
Q.

A priority queue is implemented as a max-heap. Initially, it has five elements. The level-order traversal of the heap is as follows:

20, 18, 15, 13, 12

Two new elements ‘10’ and ‘17’ are inserted in the heap in that order. The level-order traversal of the heap after the insertion of the element is:

20, 18, 17, 15, 13, 12, 10

20, 18, 17, 12, 13, 10, 15

20, 18, 17, 10, 12, 13, 15

20, 18, 17, 13, 12, 10, 15

• Question 10
45 seconds
Q.

Consider the following statements:

i. First-in-first out types of computations are efficiently supported by STACKS.

ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on

an array for almost all the basic LIST operations.

iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES

on a linear array with two indices.

iv. Last-in-first-out type of computations are efficiently supported by QUEUES.

Which of the following is correct?

II and III

I and II

III and IV

II and IV

• Question 11
30 seconds
Q.

The difference between queue and stack is ____

queues requires dynamic memory but stack do not

stack requires dynamic memory but queue do not

queue use two ends of the structure, stack use only one

stack use two ends of the structure, queue use only one

• Question 12
45 seconds
Q.

Which of the following are TRUE about queue?

I. Queue in data structure which follow first-in-first-out (FIFO) concept

II. Primary queue operations are enqueue and dequeue

III. Queue allows node to be added or removed from the front (head.

IV. The similarity between queue and stack is on process for adding and removing data.

I and II

II and III

I, II, IV

II, III, IV

• Question 13
30 seconds
Q.

Two variables used in queue are ____

top and down

rear and front

left and right

rear and top

• Question 14
30 seconds
Q.

which data structure type allows deleting data elements from front and inserting at rear?

Stacks

Queues

Dequeue

Binary search tree

• Question 15
30 seconds
Q.

Which node will be deleted in the linked list using queue?

At the tail

After all other entries are greater than the new entry

After all other entries are smaller than the new entry

• Question 16
30 seconds
Q.

If letter 'D', 'C', 'B', 'A', are sequentially inserted into a queue, and then deleted one by one, in which sequence will the letter be deleted from the queue?

A, B, C, D

A, B, D, C

D, C, A, B

D, C, B, A

• Question 17
45 seconds
Q.

Show the content of a queue after the following operations are execute.

Initialize (Q)

Remove (Q)

A and F

A and X

F and X

A, F and X

• Question 18
30 seconds
Q.

Which of the following operation will access each data item exactly once so that it can be processed?

Insertion

Traversal

Sorting

• Question 19
30 seconds
Q.

If the elements 'T', 'H', 'E', 'V', and 'A' are placed in a queue and are deleted one at a time what will be the order when removed?

T H E V A

A V E H T

H E V A T

• Question 20
30 seconds
Q.

Which is an abstract data type that serves a collection of elements called push and pop?