Which term best describes a sequence of work objects that are waiting to be processed?

The term that best describes a sequence of work objects that are waiting to be processed is "Queue." A queue is a data structure that follows the First-In-First-Out (FIFO) principle, meaning that elements are processed in the order they arrive. This is analogous to a line of people: the first person to arrive is the first one to be served.

In computing, queues are often used in scenarios such as task scheduling, where tasks must be processed in the order they are received. For example, operating systems may use queues to manage processes waiting for CPU time or to handle print jobs waiting to be printed.

Other terms like stack, array, and list have different characteristics. A stack operates on a Last-In-First-Out (LIFO) basis, where the most recently added elements are processed first. An array is a collection of elements with a fixed size and can be accessed randomly, while a list is a more general term that can refer to an ordered collection but does not necessarily imply a waiting order for processing. Thus, "Queue" is the most accurate term for describing a sequence of work objects waiting to be processed.