Computer Science · Theme B: Computational thinking and problem-solving

B2.2 — Data structures

Computer Science · SL / HL · syllabus-mapped notes

1. CS_B2.2.1

   Static versus dynamic data structures

   Memory allocation and resizing, and trade-offs in speed, memory and flexibility.

2. CS_B2.2.2

   Arrays and Lists

   1D and 2D arrays, ArrayLists / Lists, and adding, removing and traversing elements.

3. CS_B2.2.3

   Stacks (LIFO)

   The push, pop, peek and isEmpty operations and their performance and memory impact.

4. CS_B2.2.4

   Queues (FIFO)

   The enqueue, dequeue, front and isEmpty operations and their performance and memory impact.