diff --git a/README.md b/README.md
index a7fa710..3a52313 100644
--- a/README.md
+++ b/README.md
@@ -1,8 +1,11 @@
 # HashMaps
 
-These HashMap implementations were my final project for **CS 261 - Data Structures**
-at Oregon Sate. hash\_map\_oa.py features open addressing with quadratic probing
-while hash\_map\_sc.py uses separate chaining to handle collisions. Both implementations
-use a dynamic array for the underlying hash table, however hash\_map\_sc.py uses a
-singly linked list for each bucket, and hash\_map\_oa.py uses a single HashEntry
-object at each index of the array.
+These two hash map implementations feature open addressing with quadratic probing
+and separate chaining to handle collisions. The a6\_include module provides the
+underlying data structures, and two hash functions.
+
+Both implementations use the included DynamicArray class for the underlying hash table, 
+however hash\_map\_sc.py uses a singly linked list for each bucket while hash\_map\_oa.py 
+uses a HashEntry object. Additionally, hash\_map\_sc.py includes a seperate function, 
+find\_mode(), that provides a mechanism for finding the value that occurs most
+frequently in the hash map and how many times it occurs.