In Systems & CS
A collection data structure operating on a first-in, first-out (FIFO) basis where new elements are added to the end and removed from the beginning.
In AI & ML
A waiting list or line of paths under consideration during the search process.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
In Systems & CS
6Each in their own terms, from the easiest level.
Brian Yu
A first-in, first-out data type where the very first thing we add to the frontier is the first one we'll explore.Hal Abelson & Gerald Jay Sussman
A data structure supporting operations to make a new queue, insert items, delete the first item, access the front item, and test if it is empty.Gerald Jay Sussman
A data structure with primitive operations like make-queue, insert-queue!, delete-queue!, front-queue, and empty-queue? where items are added at the end and removed from the beginning.David J. Malan
An abstract data type operating on a First In, First Out (FIFO) basis.Ryan O'Donnell
A data structure where you put things in on one side and take them out at the other side.
In AI & ML
1Lectures that assume it
6Connections
22The lectures that define it or assume it, and the concepts next to it.