Here are some review problems covering Dijkstra's and Prim's Algorithm
Solutions to a review problems: Dijkstra's, and Prim's Algorithm
For Dijkstra's Shortest Path Algorithm, check out the following web site with
"cool" simulations! http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/dijkstra/Dijkstra.html
Try this insertion sequence for testing your knowledge on extendible hashing: Using a bucket size of 3 you are to insert into an empty extendible hash structure 5 values, r1 to r5 whose bit strings after calculating the hash function are all zeros. You are to use a mod 32 hash function for this part of the assignment. I.e., the hash values are 5 zeros, and they are all the same. Hint: you will need overflow buckets for this part of the assignment.