Queue

•Suppose a queue of size 30 is implemented using a circular array. How many items are in the queue of the front is index 27 and the rear is index 6? (front & rear both were initialized with “0”)

• a)9

• b)10

• c)11

• d)12

•Suppose a queue of size 40 is implemented using a circular array. How many items are in the queue of the front is index 38 and the rear is index 9? (front & rear both were initialized with “0”)

• a)10

• b)11

• c)12

• d)13

•In general, a queue Abstract Data Type allows:

• a)Insertions and removals anywhere.

• b)Insertions and removals only at one end.

• c)Insertions at the back and removals from the front.

• d)None of the above.

•Suppose a queue of size 50 is implemented using a circular array. How many items are in the queue if the front is at index 45 and the rear is at index 4? (front & rear both were initialized with “0”)

• a)9

• b)10

• c)11

• d)12

•Which of the following is the most appropriate way to implement a queue using a singly-linked list?

• a)Enqueue at the head, dequeue at the tail.

• b)Enqueue at the tail, dequeue at the head.

• c)Both enqueue and dequeue at the head.

• d)Both enqueue and dequeue at the tail.

•Which of the following is the property of “queue”?

• a)Last in, Last Out

• b)First in, First Out

• c)Accessed by both ends

• d)May be implemented using Arrays

• e)All of the choices

•Which of the following is not an “operation” of the queue?

• a)Enqueue

• b)Dequeue

• c)Peek

• d)isFull

• e)None

•Which of the following is kept movable while implementing queue using “brute force” method?

• a)Front

• b)Rear

• c)Both

• d)None

•Which of the following is kept movable while implementing queue using “circular array”?

• a)Front

• b)Rear

• c)Both

• d)None

•How much time it will take to apply “clear( )” operation on queue?

• a)O(1)

• b)O(n)

• c)O(log n)

• d)It is not an operation of queue