A ‘Queue’ Collection provides ‘first-in-first-out’ functionality:
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- Which of the following is not a true statement?
- Which of the following classes would provide the most efficient implementation of a First In First Out queue?
- Default Queue has the limit policy of
- A queue follows
- For Arrays & Collection, Sort order & search order need not to be SAME.
- For Arrays & Collection, Sort order & search order need not to be SAME.
- A backout queue is populated with the erroneous records found in the datagram queue
- Which data structure is first-in-first-out?