10.4 Intro. to Abstract Data Types (ADT) Cambridge iAS 9618

What is an Abstract Data Type (ADT)?

• A collection of data and a set of operations that can be performed on that data.

• A method to define the structure of a data file.

• A type of data that doesn't support any operations.

• A class of data that can be directly accessed without any restrictions.

Which of the following is an example of an ADT?

• Stack

• Integer

• String

• Array

What does a stack do in terms of data management?

• Follows the Last In, First Out (LIFO) principle.

• Follows the First In, First Out (FIFO) principle.

• Allows data to be accessed in any order.

• Stores data in a sorted manner.

What is a queue?

• A data structure that follows the First In, First Out (FIFO) principle.

• A data structure that follows the Last In, First Out (LIFO) principle.

• A type of tree that stores data in nodes.

• A collection of unordered data.

Which ADT is most suitable for managing tasks that need to be processed in the order they arrive?

• Queue

• Stack

• Linked List

• Tree

What is the main feature of a linked list?

• It stores elements where each element points to the next one.

• It stores elements in a continuous block of memory.

• It only stores data that is linked in a sorted order.

• It can be accessed in a random manner.

How are elements accessed in a stack?

• The most recently added element is accessed first.

• The first added element is accessed first.

• Elements are accessed in a random order.

• Elements are accessed based on a priority system.

What is an operation that can be performed on a stack?

• Push (to add an element).

• Peek (to remove an element).

• Enqueue (to add an element in the middle).

• Dequeue (to remove an element from the top).

Which of the following operations is associated with a queue?

• Enqueue (to add an element to the back).

• Pop (to remove the front element).

• Insert (to place an element in the middle).

• Remove (to delete an element from the middle).

In a linked list, what does each node typically contain?

• Data and a reference (pointer) to the next node.

• Only data, without any reference to the next node.

• Data and a reference to the previous node only.

• Data and a reference to the first node only.