Data Structure (QUEUE)

a year ago

riyxh.99_718780

Save

Edit

Host a game

Live GameLive

Homework

Solo Practice

Practice

20 QuestionsShow answers

- Question 130 secondsQ.
Which one of the following is an application of Queue Data Structure?

answer choices - Question 230 secondsQ.
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.

answer choices - Question 330 secondsQ.
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.

answer choices - Question 445 secondsQ.
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.

answer choices - Question 545 secondsQ.
Which of the following is true about linked list implementation of queue?

answer choices - Question 630 secondsQ.
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 :

answer choices - Question 745 secondsQ.
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) ?

answer choices - Question 845 secondsQ.
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?

answer choices - Question 945 secondsQ.
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:

answer choices - Question 1045 secondsQ.
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?

answer choices - Question 1130 secondsQ.
The difference between queue and stack is ____

answer choices - Question 1245 secondsQ.
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.

answer choices - Question 1330 secondsQ.
Two variables used in queue are ____

answer choices - Question 1430 secondsQ.
which data structure type allows deleting data elements from front and inserting at rear?

answer choices - Question 1530 secondsQ.
Which node will be deleted in the linked list using queue?

answer choices - Question 1630 secondsQ.
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?

answer choices - Question 1745 secondsQ.
Show the content of a queue after the following operations are execute.

Initialize (Q)

Add (A, Q)

Add (F, Q)

Add (X, Q)

Remove (Q)

answer choices - Question 1830 secondsQ.
Which of the following operation will access each data item exactly once so that it can be processed?

answer choices - Question 1930 secondsQ.
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?

answer choices - Question 2030 secondsQ.
Which is an abstract data type that serves a collection of elements called push and pop?

answer choices

Report Quiz

Why show ads?