18CSC201J
DATA STRUCTURES AND
ALGORITHMS
Session 2
Data Structure Operations & ADT
, ADT
• ADT means - Abstract Data Type
• Definition:
- It’s the logical representation of collection of data in a data structure
along with set of operations that are permitted over the data items in the
data structure.
- Example
- List ( Creation, Insert, Delete, Search )
-Stack (Push, Pop)
- Queue (Enqueue, Dequeue)
DATA STRUCTURES AND
ALGORITHMS
Session 2
Data Structure Operations & ADT
, ADT
• ADT means - Abstract Data Type
• Definition:
- It’s the logical representation of collection of data in a data structure
along with set of operations that are permitted over the data items in the
data structure.
- Example
- List ( Creation, Insert, Delete, Search )
-Stack (Push, Pop)
- Queue (Enqueue, Dequeue)