FUTURECompEng Newbie Poster 50 posts since Feb 2011 Reputation Points: 0 [?] Q&As Helped to Solve: 0 [?] Skill Endorsements: 0 [?] •Community Member 0 2 Years Ago Review for a final and I had a question... You are give a hash function h(x) = x%11 and the size of the hash table is 11. The inputs are 4371,1323,6173,4199,4344,9679,1989. What would the resulting hash table be using quadratic probing. Would I start with 4371 and then do the following (h(x)+i^2)%size = location ? h(x) = 4371mod11 = 4 size = 11 i = ??? Not sure thanks for any help (the book is confusing me even more ).