0 votes 0 votes A hash function f defined as f(key) = key mod 7, with linear probing used to resolve collisions. Insert the keys 37, 38, 72, 48, 98 and 11 into the table indexed from 0 to 6. What will be the location of 11 ? (A) 3 (B) 4 (C) 5 (D) 6 DS ugcnetcse-dec2009-paper2 data-structures hashing + – rishu_darkshadow asked Sep 17, 2017 • retagged Oct 4, 2018 by Pooja Khatri rishu_darkshadow 2.9k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 0 votes 0 votes given hashing function f(key) = key mod 7 with linear probing LP(k,i) = (f(key) + i) mod 7 0 98 1 2 37 3 38 4 72 5 11 6 48 pawan kumarln answered Sep 17, 2017 • selected Sep 21, 2017 by rishu_darkshadow pawan kumarln comment Share Follow See all 0 reply Please log in or register to add a comment.