5.1 Abstract data structures
This section discusses abstract data structures, including two-dimensional arrays, stacks, and queues. It describes their characteristics, applications, and the construction of algorithms using them. It emphasises the LIFO principle for stacks and FIFO for queues and highlights their various applications. It also explains the use of arrays as static stacks and queues. Students must be able to: 2D Arrays - Teacher...