PadhaikoAll subjects

Past exam question: 2075 Baisakh (Back), Q1(a)

Data Structure and Algorithms · 2 marks

Open in the Padhaiko app

Topic: Introduction

Question

Define ADT

Solution

Definition of Abstract Data Type (ADT): An Abstract Data Type (ADT) is a mathematical specification of a data structure defined strictly by:

  1. Value Definition (Data Domain): the set of values and structural relationships stored.
  2. Operator Definition (Interface): the allowed operations, their preconditions, inputs, and postconditions—completely independent of the underlying memory representation (array, linked list, etc.).
Answer:

An Abstract Data Type (ADT) defines a data model by its domain of values and allowed operations while hiding concrete memory representation and implementation details.

All past exam questions for Data Structure and Algorithms