Past exam question: 2073 Bhadra (Regular), Q1
Open in the Padhaiko appQuestion
Differentiate between primitive and non-primitive data structure.
Solution
Primitive vs. Non-Primitive Data Structures:
| Feature | Primitive Data Structure | Non-Primitive Data Structure |
|---|---|---|
| Nature | Built-in atomic types directly understood by hardware/compiler | Composite structures built out of primitive types |
| Values | Holds a single scalar value | Organizes multiple values in linear or non-linear order |
| Operations | Arithmetic, relational, logical operators | Traversal, insertion, deletion, searching, sorting |
| Examples | int, float, char, double | Array, Stack, Queue, Linked List, Tree, Graph |
Answer:
Primitive data structures (int, float, char) store single atomic values directly supported by hardware, whereas non-primitive data structures (arrays, stacks, queues, linked lists, trees, graphs) group multiple values with structural relationships and operations.