PadhaikoAll subjects

Past exam question: 2075 Baisakh (Back), Q3

Data Structure and Algorithms · 6 marks

Open in the Padhaiko app

Topic: Linked List

Question

Explain array representation of list? How does it differ from dynamic list?

Solution

Array Representation of List: An array list stores sequential elements inside a contiguous fixed-size array items[MAX] alongside a length counter size:

Comparison with Dynamic List (Linked List):

CriterionArray (Static) ListDynamic (Linked) List
SizeFixed at MAX; risks overflow or wasted RAMGrows/shrinks dynamically per node
Memory LayoutSingle contiguous blockScattered heap nodes linked by pointers
Access Time direct indexing sequential traversal
Insert/Delete (Head/Mid) element shifting pointer update (given predecessor)
Answer:

An array list uses contiguous fixed-capacity storage with indexing and shifts on insert/delete, whereas a dynamic list uses heap-allocated pointer-linked nodes with dynamic sizing and splicing at the cost of sequential access.

All past exam questions for Data Structure and Algorithms