JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

about the extra credits

Browse Source
This commit is contained in:
Jidong Xiao
2023-11-07 02:19:51 -05:00
parent 0ee15d1e2a
commit 50111f1429
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
labs/11_hash_tables/README.md
View File

@@ -60,7 +60,7 @@ Complete the *isHappy* function using separate chaining. Do not use any of these
**To complete this checkpoint**: Show a TA these additions and the test output. **To complete this checkpoint**: Show a TA these additions and the test output.
## Checkpoint 3: Separate Chaining Hash Table ## Checkpoint 3,4,5,6: Separate Chaining Hash Table (Yes, it's Checkpoint 3,4,5,6, as there are 3 extra credits for make this program work.)
*estimate: 30-40 minutes* *estimate: 30-40 minutes*
@@ -84,6 +84,6 @@ Output: 9
Explanation: The longest consecutive elements sequence is [0, 1, 2, 3, 4, 5, 6, 7, 8]. Therefore its length is 9. Explanation: The longest consecutive elements sequence is [0, 1, 2, 3, 4, 5, 6, 7, 8]. Therefore its length is 9.
``` ```
**To complete this checkpoint**: Show a TA your program and the test results. **To complete checkpoint (3,4,5,6)**: Show a TA your program and the test results.
**Note**: checkpoint 3 is very challenging, if you can't get it work during your lab period, make sure you understand it completely after the lab period, because one of the four problems on Test 3, will be about separate-chaining-based hash tables. It's 100% certain. **Note**: checkpoint (3,4,5,6) is very challenging, if you can't get it work during your lab period, make sure you understand it completely after the lab period, because one of the four problems on Test 3, will be about separate-chaining-based hash tables. It's 100% certain.