Topic 5 - Abstract Data Structures
The topic “Abstract Data Structures” covers the characteristics and applications of two-dimensional arrays, stacks, and queues. It includes constructing algorithms using these structures and their access methods. Stacks follow a Last-In-First-Out (LIFO) principle, useful in recursive processes. Queues follow a First-In-First-Out (FIFO) principle, useful in modelling physical queues. The use of arrays as static stacks...