Courses / HEC NSCT – National Skill Competency Test: Complete Preparation for Computing Graduates

3.5 Hashing

Area 3 – Data Structures & Algorithms (10%) · 35 min read · 12 MCQs to check yourself

A hash table stores key–value pairs. A hash function turns a key into an index, e.g. h(k) = k mod m (m = table size, ideally a prime).

Hash tables in 4 minutes (Michael Sambol)

This lesson ends with a quiz of 12 MCQs. Open the lesson on PrepOasis to take it and save your progress.

Previous: 3.4 Graphs · Next: 3.6 Searching, Sorting and Algorithm Design

All lessons in HEC NSCT – National Skill Competency Test: Complete Preparation for Computing Graduates