praxis.ibLog in
B4.1 Fundamentals of ADTsB4.1.6

Core principles of ADTs — hash tables

Explain the core principles of ADTs

AHL≈ 60 minCommand term: ExplainPremium

In this lesson

  • Giving a high-level description of an ADT, its operations and its purpose
  • Explaining how a hash table works: hash functions, collisions and their resolution, load factor
  • Explaining how sets and maps (dictionaries) store and find data using hash tables
  • Using HashMap and HashSet in Java, and dict and set in Python

This lesson is part of Premium

Every topic has one free lesson. Premium unlocks every interactive lesson, the exam-style questions at the end of each one, and the rest of Praxis IB.

Log in or sign upTry the free lesson: B4.1.1 Properties and purpose of ADTs in programming

What's inside

  1. LearnFrom key to slot
  2. LabA hash table at work
  3. PracticeLinear probing by hand
  4. CodeHashMap and HashSet, dict and set
  5. LearnMap operations in Java and Python
  6. CheckChaining or open addressing?
  7. CheckQuick check
  8. ExamWorked exam answer
  9. ReviewMistakes examiners see
  10. Exam practiceExam-style questions

Ends with 3 exam-style questions worth 8 marks, with a self-marking markscheme.