MCQ IN COMPUTER SCIENCE & ENGINEERING

COMPUTER SCIENCE AND ENGINEERING

DATA STRUCTURES

Please wait while the activity loads.
If this activity does not load, try refreshing your browser. Also, this page requires javascript. Please visit using a browser with javascript enabled.

If loading fails, click here to try again

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]

Which is not a typical subroutine used in the implementation of a queue?

A	isFull()
B	isEmpty()
C	enQueue(item)
D	deQeueue(item)

Explanation:

Detailed explanation-1: -Answer-B) Single Ended Queue is not a type of queue. 5.

Detailed explanation-2: -Explanation: Queue always has two ends. So, single ended queue is not the type of queue.

Detailed explanation-3: -Implementation of Queue Data Structure Queue can be implemented using an Array, Stack or Linked List. The easiest way of implementing a queue is by using an Array. Initially the head(FRONT) and the tail(REAR) of the queue points at the first index of the array (starting the index of array from 0 ).

Detailed explanation-4: -A queue can be implemented in two ways: Sequential allocation: It can be implemented using an array. A queue implemented using an array can organize only a limited number of elements. Linked list allocation: It can be implemented using a linked list.

There is 1 question to complete.