Learn More
4any current perfect hashing algorithms suffer from the problem of pattern collisions. In this paper, a perfect hashing technique that uses array-based tries and a simple sparse matrix packing algorithm is introduced. This technique eliminates all pattern collisions, and because of this it can be used to form ordered minimal perfect hash functions on(More)
Much attention has been given to the content of introductory computer science courses, but based upon a perusal of introductory textbooks, it appears that somewhat less attention has been given to the programming exercises to be used in these courses. Programming exercises can be modified to provide a better educational experience for the student. An(More)