Which of the following is NOT an example of an Abstract Data Type?Group of answer choicesStackLinked ListQueueArray

To determine which of the provided options is NOT an example of an Abstract Data Type (ADT), let's define what an ADT is and then evaluate each option.

Understanding Abstract Data Types

1. Abstract Data Type (ADT): An ADT is a model for a data type where the data type is defined by its behavior (operations that can be performed on it) rather than its implementation. Common examples include Stack, Queue, and Linked List.

Evaluating the Options

1. Stack: An ADT where elements are added and removed in a Last In First Out (LIFO) manner.
2. Linked List: An ADT that consists of nodes where each node points to the next node in the sequence, allowing for dynamic memory allocation.
3. Queue: An ADT where elements are added and removed in a First In First Out (FIFO) manner.
4. Array: This is a basic data structure that holds a fixed-size sequence of elements. It does not encapsulate its operations in the same way that typical ADTs do.

Conclusion

Based on the definitions and characteristics of each type:

• Stack, Linked List, and Queue are all examples of Abstract Data Types.
• Array is a concrete data structure rather than an Abstract Data Type.

Final Answer

Array is NOT an example of an Abstract Data Type.