DSA · Theory

Dictionary Data Structure

Theory

163/810

Dictionary Data Structure

Dictionary Data Structure is a DSA topic. In plain words you use it for name → phone in a diary. Don’t start with a slogan — start with that picture.

Smallest example: key % size + collision plan. Type it, run it, and say what you see. If you can do that from memory, you know Dictionary Data Structure.

From the example next to this theory — Dictionary Data Structure: dry-run [4, 1, 3].

Trap — bad hash → pile-up. Fix that before you talk about advanced DSA.

Viva — what is Dictionary Data Structure? Then show key % size + collision plan. Then name the trap.

Exam tip

What is Dictionary Data Structure? Show this: key % size + collision plan. Trap: bad hash → pile-up.

Example

# Dictionary Data Structure
data = [4, 1, 3]
print("start", data)
if data[0] > data[1]:
    data[0], data[1] = data[1], data[0]
print("after one step", data)

Dictionary Data Structure: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefDictionary Data Structure — name → phone in a diary.
Rulekey % size + collision plan
Trapbad hash → pile-up
Usea diary

DSA · Theory

Dictionary Data Structure

← All stacks

Theory

163/810

Dictionary Data Structure

Dictionary Data Structure is a DSA topic. In plain words you use it for name → phone in a diary. Don’t start with a slogan — start with that picture.

Smallest example: key % size + collision plan. Type it, run it, and say what you see. If you can do that from memory, you know Dictionary Data Structure.

From the example next to this theory — Dictionary Data Structure: dry-run [4, 1, 3].

Trap — bad hash → pile-up. Fix that before you talk about advanced DSA.

Viva — what is Dictionary Data Structure? Then show key % size + collision plan. Then name the trap.

Exam tip

What is Dictionary Data Structure? Show this: key % size + collision plan. Trap: bad hash → pile-up.

Example

# Dictionary Data Structure
data = [4, 1, 3]
print("start", data)
if data[0] > data[1]:
    data[0], data[1] = data[1], data[0]
print("after one step", data)

Dictionary Data Structure: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefDictionary Data Structure — name → phone in a diary.
Rulekey % size + collision plan
Trapbad hash → pile-up
Usea diary

Dictionary Data Structure

Example

Short notes

Questions

Dictionary Data Structure

Example

Short notes

Questions