EXAM SOLUTIONS > CS300 SAMPLE MIDTERM2 SOLUTIONS
Sabancı University CS 300 1) Given input {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hash function h(x) = x (mod () 10), show the resulting: a. separate chaining hash table On the assumption that we add collisions to the end of the list (which is the easier way if a hash table is being built by hand), the separate chaining hash table that results is shown here. b. ...[Show More]
Access Full Document
Instant download after payment
Preview 4 out of 18 pages
Reviews( 0 )
No Recommended Resources Yet.
| Category: | EXAM SOLUTIONS |
| Number of pages: | 18 |
| Language: | English |
| Last updated: | 1 month ago |
| Downloads: | 1 |
| Views: | 9 |
