This question uses the same environment as given in Question #2.  However, for this question using double hashing as the collision resolution strategy with the following hash functions: h1 (x) = x mod 13 and  h2 (x) = 5 – (x mod 5) Create a table just like was done for Question #2.

TEST#4_PWPT_Page_06.jpg

Hashing works best when the hash tables have a high load factor.

When implementing separate chaining, an array of lists is often used.

All trees are graphs but not all graphs are trees.

TEST#4_PWPT_Page_37.jpg

TEST#4_PWPT_Page_14.jpg

TEST#4_PWPT_Page_37.jpg

TEST#4_PWPT_Page_24.jpg

TEST#4_PWPT_Page_09.jpg