PadhaikoAll subjects

Past exam question: 2078 Baishakh (Back), Q1

Data Structure and Algorithms · 4 marks

Open in the Padhaiko app

Topic: Introduction

Question

Compare primitive and non-primitive data structures.

Solution

Comparison of Primitive and Non-Primitive Data Structures:

FeaturePrimitive Data StructuresNon-Primitive Data Structures
DefinitionFundamental, built-in data types directly supported by machine instructionsDerived structures built from primitive (or other non-primitive) types
Structure ComplexityStore a single atomic value per variableOrganize collections of multiple related values
OperationsBasic arithmetic, logical, and relational operations (+, -, <, ==)Structural operations: insertion, deletion, traversal, searching, sorting
Memory LayoutFixed size per type (e.g., 4 bytes for int, 1 byte for char)Contiguous (arrays) or dynamic scattered nodes (linked lists, trees)
Examplesint, float, char, double, pointersArrays, Stacks, Queues, Linked Lists, Trees, Graphs
Answer:

Primitive data structures (int, float, char) are atomic, hardware-supported built-in types storing single values, whereas non-primitive data structures (arrays, stacks, queues, linked lists, trees, graphs) organize multiple values into linear or non-linear relationships with structural operations like insertion, deletion, and traversal.

All past exam questions for Data Structure and Algorithms