Data Types, Data Structures & ADT

DSA, Database System & Operating System — Data Structure, Lists, Linked Lists and Trees, NEC licence examination syllabus (Nepal Engineering Council).

Data Types, Data Structures, and ADTs: three words that sound the same but aren't

Getting this vocabulary straight now saves confusion for the rest of the subject.

📦 Three Related but Different Concepts

Data typeA classification of data (int, float, char) that tells the compiler how to interpret and store a value.

Data structureA specific way of organizing multiple pieces of data together (array, linked list, tree) so operations on them are efficient.

Abstract Data Type (ADT)A conceptual DEFINITION of a data structure's behaviour (what operations it supports) WITHOUT specifying how it's implemented internally. A stack is an ADT; the array or linked-list version of it is the actual data structure.

💡 One-liner: "How does an ADT differ from a data structure?" → An ADT defines WHAT operations exist (push, pop) without saying HOW they're implemented; the data structure is the actual concrete implementation.

What the abstraction actually buys

The three definitions are correct but the point of the ADT only lands with an example. A stack ADT is defined entirely by its behaviour:

Stack ADT — what it promises: push(x) add x to the top pop() remove and return the top item peek() look at the top without removing isEmpty() is there anything in it Notice what is NOT here: no mention of arrays, pointers, memory, or how any of it is stored.

That same ADT can be implemented two entirely different ways:

🔧 One ADT, two implementations

Array-backedKeep a top index. Push writes and increments; pop reads and decrements. Fast and cache-friendly, but the capacity is fixed unless it resizes.

Linked-list-backedPush adds a node at the head; pop removes it. Grows without limit, at the cost of a pointer per element and scattered memory.

Code written against the ADT works with either, unchanged. That is the whole value: the interface is a contract, so the implementation can be swapped for performance reasons without touching anything that uses it — the same argument as the ISA being a contract between hardware and software.

💡 The exam distinction in one line: an ADT says what operations exist and what they mean; a data structure says how they are implemented. Stack is an ADT; "stack implemented with an array" is a data structure. A question asking whether an array is an ADT is testing exactly this — it is not, it is a concrete structure.

Why data types are the third, separate idea

A data type operates at a lower level again: it tells the compiler how many bytes a value occupies and how to interpret the bit pattern. The same 32 bits mean different numbers as an int and as a float.

So the three form a hierarchy of abstraction — data type interprets bits, data structure organises many values, ADT specifies behaviour independent of both.

💡 Primitive types are effectively built-in ADTs: int also promises operations (+, −, ×) without your knowing whether the hardware uses two's complement or how the adder is wired. The idea is the same; only the level differs.

Syllabus points

Data type vs data structure vs abstract data type
Primitive vs non-primitive structures

Create a free account to tick topics off, take notes as you read, watch the video lessons and get a day-by-day study plan built around your exam date.