diff --git a/labs/11_hash_tables/README.md b/labs/11_hash_tables/README.md
index 2c982c2..2961cbc 100644
--- a/labs/11_hash_tables/README.md
+++ b/labs/11_hash_tables/README.md
@@ -1,8 +1,10 @@
 # Lab 11 — Hash Tables
 
-In this lab, you will experiment with our hash table implementation of a set. The key differences between the ds_set class (based on a binary search tree) and the ds_hashset class (based on a hash table, of course), are the performance of insert/find/erase: O(log n) vs. O(1), and the order that the elements are traversed using iterators: the set was in order, while the hashset is in no apparent order.
+In this lab, you will first experiment with our hash table implementation of a set. The key differences between the ds_set class (based on a binary search tree) and the ds_hashset class (based on a hash table, of course), are the performance of insert/find/erase: O(log n) vs. O(1), and the order that the elements are traversed using iterators: the set was in order, while the hashset is in no apparent order.
 
-Provided code: [ds_hashset.h](ds_hashset.h) and [test_ds_hashset.cpp](test_ds_hashset.cpp).
+And then you will practice using std::unordered_map.
+
+Provided code for checkpoint 1 and checkpoint 2: [ds_hashset.h](ds_hashset.h) and [test_ds_hashset.cpp](test_ds_hashset.cpp).
 
 ## Checkpoint 1