A double ended queue is an ordered collection of items similar to a queue. In fact, it is a queue in essence. It is only a queue with both front-end and back-end supporting insert and delete operations, which is more practical. Therefore, there is no such statement as FIFO.
We can do this through arrays, but in order to write a more efficient data structure, we use objects.