martes, 13 de diciembre de 2011

FIFO and Queue

FIFO: Allows data exchange between processes, with a queue where read us and write bytes.

A queue holds a collection of data or elements and follows the FIFO rule.
The FIFO that means which data added first in the list, only that element can be removed or retrieved first from the list.

I explain how a queue is implemented.

- This is the constructor of the LinkedList class. This class importing the java.util package.

Removes and returns the first element of the list

Removes and returns the last element of the list.

This method checks whether the list is empty or not.

This method used to remove the elements in the list in a specified sequence.

This entry is for points in second opportunity.

No hay comentarios:

Publicar un comentario