Queue

Queue is a First In and First Out data structure

• TRUE

• FALSE

Which one is correct for ' enqueue( ) '

• Remove element from the front

• Check if the queue is empty

• Check if the queue is full

• Add element to the tail

Which one is correct for ' dequeue( ) '

• Removes the front element from the queue.
• Peeks at the front element without removing it.
• Adds an element to the back of the queue.
• Clears all elements from the queue.

What is the similarity for ' peek( ) ' and ' element( ) '

• Both methods allow access to elements without removal.
• 'peek()' returns the first element only.
• 'element()' can only be used on empty collections.
• Both methods remove elements from the collection.

Select the situations that a Queue data structure would be used?

• 
  Printer in a room full of computers

• Characters typed on a keyboard

• Back button

• Undo button

When to call this method ?

' empty( ) '

• Check whether the queue is empty or not

• Check whether the queue is full or not

In Queue Insertion & Deletion take place at ________________.

• same end

• different end

• first end

• last end

Choose the correct way to create a Queue using a built-in class like (LinkedList)

• Queue q = new LinkedList();

• public class MyQueue {

  }

What operation is used to remove an element from the queue?

• dequeue( )

• enqueue( )

• empty( )

• peek( )

Which of the operations is NOT supported by a standard queue?

• Insertion to a specific location

• enqueue( )

• dequeue( )

• peek( )