Section 29.6 Vocabulary
- circular (ring) buffer:
- A fixed sized array used so that moving off either end of the array wraps around to the other end.
- container adapter:
- A class template that wraps around an underlying container to provide a specific interface to that container.
- deque:
- A “double ended queue”. A data structure that allows efficient insertion and deletion of elements at both ends.
- FIFO:
- First In, First Out. A principle that describes the order in which elements are added and removed from a data structure.
- LIFO:
- Last In, First Out. A principle that describes the order in which elements are added and removed from a data structure.
- stack:
- A data structure that follows the Last In, First Out (LIFO) principle, where elements are added and removed from the same end.
- queue:
- A data structure that follows the First In, First Out (FIFO) principle, where elements are added at the rear and removed from the front.
You have attempted of activities on this page.
