Reminder that you must complete the pre-reading before each class.

On this page:
✔️ Pre-reading for Tuesday 4/20
✔️ Pre-reading for Thursday 4/22

---

Pre-Reading for Hashtables, Tuesday 4/20

Essential Questions

Before attending class, please complete the material below and use the following questions to guide your note-taking:

✔️ What is a hashtable and what purpose does it serve?
✔️ What is the difference between a hashtable and a map?
✔️ What is a collision and how do we resolve it?

Read/Watch/Review

Before attending class, please complete the material below:

• Read Tables
• Read Simple Table
• Read Hash Table In C++
• Watch Data Structures: Hash Tables (6 min)
• Read the first two answers to this stackoverflow post

For those of you who know Java and are curious to know the differences between Java’s HashMap and HashTable, read this article.

In Class

In today’s class we’ll be reviewing hashtables.

---

Pre-Reading for Q&A / Interview Prep, Thursday 4/22

Essential Questions

Before attending class, please complete the material below and use the following questions to guide your note-taking:

✔️ How can I use what I’ve learned in this class to prepare for technical interviews?
✔️ What kinds of questions should I expect during an interview?
✔️ What is Dijkstra’s algorithm and purpose does it serve?
✔️ How does Dijkstra’s algorithm work?

Read/Watch/Review

• Read Getting a Gig: A Guide
• Read How Data Structures and Algorithms are important for Computer Science Graduates?
• Read Dijkstra’s Algorithm
  • For a step-by-step explanation and visualization, read Dijkstra’s Shortest Path Algorithm - A Detailed and Visual Introduction
• Review Practice Interview Questions and Sites

In Class

In today’s class we’ll be reviewing tips and tricks for interview questions and I’ll be aswering any course related questions you may have. You’ll also have time to finish working on Lab 13.