Collision rate in a hashing function

I am working on a program for a class and it requires me to find the collision rate after some inputs are hashed into tables of various sizes. I am unsure how the collision rate is defined is it (Collisions / # of hashed inputs) X 100% or is it dependent on the hash table size?

Thanks
Disturbedone2004
Sounds like it is just the percentage of inserts that cause a collision. Which would be

number of collisions / number of inserts * 100%
Topic archived. No new replies allowed.