- 2071 Bhadra · 2 marks
ADT versus data structure
Short answer
ADT is a logical model specifying what is stored and what operations are allowed, independent of implementation. Data structure is a concrete implementation detailing how data is stored (array, linked list) and how operations are coded. One ADT may be implemented by multiple data structures.
Differentiate between ADT and Data Structure.
| Abstract data type (ADT) | Data structure |
|---|---|
| Logical/mathematical model: what is stored and what operations exist | Concrete implementation: how the data is stored and operated on |
| Independent of any programming language | Written in a particular language (e.g., C) |
| Defined by value and operator definitions (specification) | Defined by memory layout and code (arrays, pointers, structs) |
| Hides implementation details from the user | Exposes details; the programmer manages them |
| Example: STACK with push, pop, empty | Array-based or linked-list-based stack |
| One ADT can have many data structures | A data structure implements one or more ADTs |
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Define data structure; explain ADT · Data Structure and Algorithm, chapter 1
- Data type and ADT definition · Data Structure and Algorithm, chapter 1 · asked 3×
- Types of data structures; ADT example · Data Structure and Algorithm, chapter 1
- Primitive vs non-primitive data structure · Data Structure and Algorithm, chapter 1
- Define ADT with example · Data Structure and Algorithm, chapter 1 · asked 3×
- ADT of linked list · Data Structure and Algorithm, chapter 1
- Data versus signal · Data Communication, chapter 1
- Structure versus array · Computer Programming, chapter 8 · asked 4×
- Data abstraction versus encapsulation · Object Oriented Programming, chapter 1
- Differentiate Finite State Machine and Automata · Discrete Structure, chapter 2 · asked 2×