225_33_Hashing - 1. Divideintoteamsof45students. 2.

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
1 1. Divide into teams of 4-5 students. 2. Repeat until your group has completed 100 experiments:     Flip a coin until it comes up heads and then record the number  of coin flips it took to get heads. 3. Fill out a chart and use it to compute the average number of  flips.      Number of flips for heads Number of trials 1 2 3
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 Assignment #5: Available from class web page. Due Friday Dec.  2 at the beginning of class. There is a CSC 225 tutorial next week: Monday Nov. 28. Final exam tutorial: Wednesday Dec. 7 at 12:00pm,  Elliott 061. 8 old final exams are available from our class web page. Try analysing the variants of Kruskal’s algorithm as per the  2009 final exam, question #4.
Background image of page 2
Hashing Just as radix sort can beat the  (n log n) barrier for the  comparison model, hashing can be faster in practice  (although not always in the worst case) than the log n  time used in a binary search. Slides today from Spring 2007 were created by
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/15/2012 for the course CSC 225 taught by Professor Valerieking during the Spring '10 term at University of Victoria.

Page1 / 24

225_33_Hashing - 1. Divideintoteamsof45students. 2.

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online