Part 4 | Maps: hash tables and other implementations, Strings: Trie and sub-string search algo

• Objectives
• To read
• Exercises A
  • Exercise 4.1.1
  • Exercise 4.1.2
  • Exercise 4.1.3
  • Exercise 4.1.4
  • Exercise 4.1.5
  • Exercise 4.1.6
  • Exercise 4.1.7
  • Exercise 4.1.8
  • Exercise 4.1.9
  • Exercise 4.1.10 (Rabin-Karp)
  • Exercise 4.1.11 (Rabin-Karp)
  • Exercise 4.1.12 (INGInious: MCQ)
  • Exercise 4.1.13 (INGInious: MCQ)
  • Exercise 4.1.14 (INGInious)
  • Exercise 4.1.15 (INGInious)
  • Exercise 4.1.16 (INGInious)
  • Exercise 4.1.17 (INGInious)
• Exercises B
  • Exercise 4.2.1 (Hash of Long and Double)
  • Exercise 4.2.2 (Hash and casting of integers)
  • Exercise 4.2.3 (String Hashing: Choice of M and R Constants)
  • Exercise 4.2.4 (Design of a Hash Function for Vehicles)
  • Exercise 4.2.5 (Design of a Hash Function: Citizens)
  • Exercise 4.2.6 (Rabin-Karp Revisited)
  • Exercise 4.2.7 (INGInious: Linear Probing)
  • Exercise 4.2.8 (INGInious: Tries and Autocompletion)
  • Exercise 4.2.9 (INGInious: A Fun Exercise Using Hash Tables)
  • Exercise 4.2.10 (INGInious: Bitset)