A data structure that follows the First-In First-Out (FIFO) principle, where elements are added at the rear and removed from the front, analogous to a waiting line. It is one of the most frequently tested data structures alongside stacks, with exam questions typically requiring candidates to trace element insertion and removal order.

Past questions testing this term · 2 questions

• 2018h30h #96先入れ先出し(First-In First-Out，FIFO)処理を行うのに適したキューと呼ばれるデータ構造に対して“8”，“1”，“6”，“3”の順に値を格納…
• 2011h23tokubetsu #58あるキューに要素“33”，要素“27”及び要素“12”の三つがこの順序で格納されている。このキューに要素“45”を追加した後に要素を二つ取り出す。2番目に取り出…