How an array$-$based list might be put into practice? Virtually any context we wish to maintain keys on either a first in first out $($FIFO$)$ or last in first out $($LIFO$)$ basis. A printer queue may be effectuated by implementing an array$-$based list and treating inserted nodes on a FIFO basis. This means we really only implement the same methods we would be implementing if we implement a queue. For the distinction between stacks and queues, see the first two links in References below. Think of other contexts in which the functionality of an array$-$based list is applicable. Consider the myriad contexts in which transactions are processed. Transaction is a general term that might be thought of as a unit of work. An array$-$based list is a cross between a stack and a queue. This makes an array$-$based list a hybridized data structure.

Discussion

Reexamine the implementation of an array$-$based list. See the third link in References below. Try to identify the methods that this data structure shares in common with both stacks and queues. Express contexts in which an array$-$based list might be applied. If you have difficulty thinking of an application, consider transactions.