In a FIFO data structure, the first element added to the queue will be the first one to be removed i.e. once a new element is added, all elements that were added before have to be removed before the new element can be removed