Report an issue

FeaturesSubjectsPricing Schools

Loading subject…

IB
B2.2.4 Concept of a Queue as a "First In, First Out" (FIFO) Data Structure

IB Computer Science Topic B2.2.4: Concept of a Queue as a "first In, First Out" (FIFO) Data Structure Key Definitions

A1.1 Computer hardware and operation

A1.2 Data representation and computer logic

A1.3 Operating systems and control systems

A1.4 Translation (HL only)

A2.1 Network fundamentals

A2.2 Network architecture

A2.3 Data transmissions

A2.4 Network security

A3.1 Database fundamentals

A3.2 Database design

A3.3 Database programming

A3.4 Alternative databases and data warehouses (HL only)

A4.1 Machine learning fundamentals

A4.2 Data preprocessing (HL only)

A4.3 Machine learning approaches (HL only)

A4.4 Ethical considerations

B1.1 Approaches to computational thinking

B2.1 Programming fundamentals

B2.2 Data structures

B2.3 Programming constructs

B2.4 Programming algorithms

B2.5 File processing

B3.1 Fundamentals of OOP for a single class

B3.2 Fundamentals of OOP for multiple classes (HL only)

B4.1 Fundamentals of ADTs

B2.2.4 Concept of a Queue as a "First In, First Out" (FIFO) Data Structure Key Definitions

Definition

Circular queue

An array-backed queue whose front and rear indices wrap back to 0 using the modulo operator, so slots freed by earlier dequeues are reused instead of being left unusable.

Definition

Queue

A linear data structure in which elements are added at the rear and removed from the front, so the first element added is the first one removed.

Definition

Task scheduling

Task scheduling is the process of determining the order and timing of process execution.

Key Definitions