Navigation

  • index
  • suivant |
  • précédent |
  • Documentation LINFO1121 2024-2025 »
  • Part 4 | Maps: hash tables and other implementations, Strings: Trie and sub-string search algo

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 (Hash of String: the choice of M and R constants)
    • Exercise 4.2.4 (Design of Hash function for Vehicules)
    • Exercise 4.2.5 (Design of Hash function: Citizens)
    • Exercise 4.2.6 Rabin-Karp, the return of revenge
    • Exercise 4.2.7 (Inginious: Linear Probing)
    • Exercise 4.2.8 (Inginious: Tries and Autocompletion)
    • Exercise 4.2.9 (Inginious: An funny exercise using HashTables)
    • Exercise 4.2.10 (Inginious: Bitset)

Sujet précédent

Exercises B

Sujet suivant

Objectives

Recherche rapide

Navigation

  • index
  • suivant |
  • précédent |
  • Documentation LINFO1121 2024-2025 »
  • Part 4 | Maps: hash tables and other implementations, Strings: Trie and sub-string search algo
Created using Sphinx 3.3.1.
Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.