PadhaikoAll subjects

Past exam question: 2073 Bhadra (Regular), Q1

Data Structure and Algorithms · 4 marks

Open in the Padhaiko app

Topic: Introduction

Question

Differentiate between primitive and non-primitive data structure.

Solution

Primitive vs. Non-Primitive Data Structures:

FeaturePrimitive Data StructureNon-Primitive Data Structure
NatureBuilt-in atomic types directly understood by hardware/compilerComposite structures built out of primitive types
ValuesHolds a single scalar valueOrganizes multiple values in linear or non-linear order
OperationsArithmetic, relational, logical operatorsTraversal, insertion, deletion, searching, sorting
Examplesint, float, char, doubleArray, 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.

All past exam questions for Data Structure and Algorithms