Reading 03: Lists, Queues

Everyone:

Next week, we will study linked lists, a fundamental data structure, and then discuss how to use them to implement queues, a common abstract data type.

TL;DR

The focus of this reading is linked lists and queues.

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 03 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 reading03           # Create reading03 branch and check it out

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

$ ../.scripts/check.py                # Check reading03 quiz
Checking reading03 quiz ...
      Q1 0.90
      Q2 0.50
      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 03: Done"    # Commit work

$ git push -u origin reading03        # 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 03 TA List.