B2.2 Data structures

This section introduces students to fundamental data structures and how they are used to organize and manage data within programs. Students will compare static and dynamic data structures, gaining insight into their memory management and flexibility. They will construct programs using arrays and lists, and explore how stacks and queues operate—understanding stacks as LIFO (last in, first out) and queues as FIFO (first in, first out) structures—building a foundation for more advanced algorithmic problem-solving.