Quiz on Abstract Data Types

Which of the following best describes an Abstract Data Type (ADT)?

• A data structure implemented using arrays only

• A model that defines the behavior of data and operations

• A predefined data type in C

• A type of sorting algorithm

Which of the following is not a linear abstract data type?

• Stack

• Queue

• Binary Tree

• List

What does the term "abstraction" mean in the context of ADT?

Which operation is not typically supported by a Stack ADT?

• Push

• Pop

• Enqueue

• Peek

In an ADT, the implementation details are hidden from the user.

Mention two advantages of using ADTs in program design.

Which of the following ADTs would you use to simulate a printer queue?

• Stack

• Queue

• Tree

• Graph

In C, how would you declare a structure for a node in a singly linked list?

• struct Node { int data; struct Node *next; };

• int Node; Node *next;

• class Node { int data; Node link; };

• struct List { int node; int next; };

All ADTs must be implemented using linked lists.

Name one real-world application where a Stack ADT is used.