Linear Data Structures: Arrays, Stacks, Queues & Linked Lists
Linear data structures store elements in a sequential order, where each element connects to the next. This topic covers arrays, stacks, queues, and linked lists — their representations, operations, and real-world applica…
A linear data structure stores elements in a sequence where each element has at most one predecessor and one successor.
Array address formula: $\text{Address}(A[i]) = B + i \times w$, giving $O(1)$ random access.
Array insertion or deletion in the middle costs $O(n)$ due to element shifting.
~25 min · full explanation, examples & memory tricks in the app
❓ Leveled MCQ practice
Try the smart MCQs from this kit
17 questions laddered from warm-up to topper-level, each with an explanation. A taste:
Which property defines a linear data structure?
Beginner
A Elements are always stored in contiguous memory.B Elements are always ordered by priority.C Each element has at most one predecessor and one successor.D Each element can have many predecessors and successors.
Show answer & explanation
Each element has at most one predecessor and one successor.
A linear data structure stores elements in a sequence where each element has at most one predecessor and one successor. Contiguity is an array property, not a requirement for all linear structures.
Using the formula $\text{Address}(A[i]) = B + i \times w$, what does $w$ represent?
Beginner
A The base address of the arrayB The index of the elementC The size of each element in bytesD The total number of elements
Show answer & explanation
The size of each element in bytes
In the array address formula, $B$ is the base address, $i$ is the index, and $w$ is the width or size of each element in bytes.
A stack follows which order rule?
Beginner
A Random orderB Highest priority firstC FIFO — First In, First OutD LIFO — Last In, First Out
Show answer & explanation
LIFO — Last In, First Out
A stack inserts and deletes only at the top, so the last element pushed is the first one popped — LIFO.
In a queue, where does insertion take place?
Beginner
A At the frontB At the rearC At both ends simultaneouslyD At the top
Show answer & explanation
At the rear
A queue enqueues at the rear and dequeues from the front, giving FIFO behaviour.
🃏 Flashcards
Tap a card to flip it
28 flashcards in this kit — the app reviews them with
spaced repetition so the right card returns on the right day.
🎮 Learning games
Play your way through this kit
Every game is built from this kit's own content — scores feed your
mastery, so playing counts as studying.
Word Match True False Memory Match Flashcard Battle Speed Quiz Guess Term Sequence Builder Categorization Revision Battle Playable in the app
The full Veda Bites deck, complete notes, spaced-repetition
flashcards, leveled MCQs, tests and games for this kit — plus
Daily Facts and the Arena, every day.