It's UWAweek 9 (1st semester, week 1)


This forum is provided to promote discussion amongst students enrolled in CITS2002 Systems Programming.
Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!"  followup message.
Displaying selected article
Showing 1 of 1168 articles.
Currently 7 other people reading this forum.

 UWA week 42 (2nd semester, week 12) ↓
SVG not supported

Login to reply

5:52am Wed 18th Oct, Christopher M.

> If we were to use a hash table, would we still need to define HASHTABLE_SIZE for the hash table or is there a way to grow this dynamically as well?
There certainly are more complicated implementations of hashtables that 'grow' as the number of their elements pass some threshold. Extending the initial vector of pointers to the lists is the easy part, but then you also have to determine where, in the extended hashtable, that each list will now belong (each string on each list *may* now have a different value when hashed). The usual (easiest) approach is to allocate a second hashtable, migrate all the old contents over to it, then delete the original hashtable.

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  5:07AM Sep 06 2023
Privacy policy