……………. Is a pile in which items are added at one end and removed from the other.

Related MCQs

• A data structure where elements can be added or removed at either end but not in the middle is called …
• A data structure where elements can be added or removed at either end but not in the middle is called …
• A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?
• Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called ________
• If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
• Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?
• The data items in a record form a ________ structure which can be described by means of level numbers.
• Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
• Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
• Data items that are divided into subitems are called ___________.