7.4Memory organisation
The idea
Big memories are built from small chips: more chips side by side widen the word, more chip rows add words, and a decoder picks the row.
Think of it like this: Building a wall from bricks: columns for width, rows for height.
Why it exists
Chip counts and address lines are a favourite numerical question.
How it works
- Columns = word width ÷ chip width.
- Rows = total words ÷ chip words.
- Chips = rows × columns.
- Row select needs a decoder with log2(rows) inputs.
Worked example: 1M × 32 from 256K × 8 chips
Rows = 4, columns = 4 → 16 chips, 2-to-4 decoder, 20 address lines.
Now play with it
- →Edit the target and chip sizes and watch the grid redraw.
row 0
row 0
row 0
row 0
row 1
row 1
row 1
row 1
row 2
row 2
row 2
row 2
row 3
row 3
row 3
row 3
Each row is a bank that responds to one chip-select; columns side by side widen the word.
Check yourself
How many 512 × 8 chips are needed for a 2K × 16 memory?
Exam notes (the dense version)
Capacity = 2n × word width. Build large memory from smaller chips: more words → extra address lines go to a decoder; wider words → chips side-by-side.
Previous year questions: Memory Hierarchy & Main Memory (16)
PYQs are grouped by topic, so this is the full set for Memory Hierarchy & Main Memory; try the ones that match this subtopic. Open all 16 on the topic page.