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

On this page:
✔️ Pre-reading for Tuesday 6/8
✔️ Pre-reading for Wednesday 6/9
✔️ Pre-reading for Thursday 6/10

---

Pre-Reading for Binary Search

Essential Questions

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

✔️ How does the binary search algorithm work?
✔️ What’re the differences between a linear/traditional search algorithm and the binary search algorithm?
✔️ What’s the time complexity of binary search?

Read/Watch/Review

Before attending class, please complete the material below:

• Read Visual Introduction to Algorithms: Binary Search
• Watch Algorithms: Binary Search (6 min)
• Watch Linear Search vs Binary Search (5 min)

---

Pre-Reading for Sets & Maps

Essential Questions

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

✔️ How does a set work and when should it be used?
✔️ How does a map work and when should it be used?

Read/Watch/Review

Before attending class, please complete the material below:

• Read std::set
• Read std::map
• Watch Sets and Maps - Udacity (2 min)
• Watch Set and Maps (7 min)

---

Pre-Reading for Hashmaps

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.