DS_WeeklyTest-4

1.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 ?

• Queue

• Stack

• Tree

• Linked list

2.A queue is a ?

• FIFO (First In First Out) list

• LIFO (Last In First Out) list.

• Ordered array

• Linear tree

3. If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

• ABCD

• DCBA

• DCAB

• ABCD

4. In the array implementation of circular queue, which of the following operation take worst case linear time?

• Insertion

• Deletion

• To empty a queue

• None

5.In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?

• Insertion

• Deletion

• To empty a queue

• Both a) and c)

6.If the MAX_SIZE is the size of the array used in the implementation of circular queue. How is rear manipulated while inserting an element in the queue?

• rear=(rear%1)+MAX_SIZE

• rear=rear%(MAX_SIZE+1)

• rear=(rear+1)%MAX_SIZE

• rear=rear+(1%MAX_SIZE)

7.If the MAX_SIZE is the size of the array used in the implementation of circular queue, array index start with 0, front point to the first element in the queue, and rear point to the last element in the queue. Which of the following condition specify that circular queue is FULL?

• Front=rear= -1

• Front=(rear+1)%MAX_SIZE

• Rear=front+1

• Rear=(front+1)%MAX_SIZE

8.A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

• Queue

• Circular queue

• Dequeue

• Priority queue

9. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue?

• Only front pointer

• Only rear pointer

• Both front and rear pointer

• None of the front and rear pointer

10. A normal queue, if implemented using an array of size MAX_SIZE, gets full when

• Rear=MAX_SIZE-1

• Front=(rear+1)mod MAX_SIZE

• Front=rear+1

• Rear=front