Reading 06: Hash Tables, Maps

Everyone:

Next week, we will study the map (abstract data type) and how to implement them using the hash table (data structure). During our exploration, we will also be introduced to the memoization (a form of dynamic programming) approach to problem solving.

TL;DR

The focus of this reading is maps and hash tables.

Readings

The readings for this week are:

  1. Data Structures Handbook

  2. Learn DS & Algorithms

Optional References

  1. Interview Cake

Quiz

Once you have completed the readings, answer the following Reading 06 Quiz questions:

Submission

To submit your work, follow the same process outlined in Reading 01:

$ git checkout master                 # Make sure we are in master branch
$ git pull --rebase                   # Make sure we are up-to-date with GitHub

$ git checkout -b reading06           # Create reading06 branch and check it out

$ cd reading06                        # Go into reading06 folder
$ $EDITOR answers.json                # Edit your answers.json file

$ ../.scripts/check.py                # Check reading06 quiz
Checking reading06 quiz ...
      Q1 1.00
      Q2 0.40
      Q3 1.00
      Q4 0.60
   Score 3.00 / 3.00
  Status Success

$ git add answers.json                # Add answers.json to staging area
$ git commit -m "Reading 06: Done"    # Commit work

$ git push -u origin reading06        # Push branch to GitHub

Pull Request

Once you have committed your work and pushed it to GitHub, remember to create a pull request and assign it to the appropriate teaching assistant from the Reading 06 TA List.