4 4 votes Programming in C hashing linear-probing data-structures + – Rahul Jain25 1.9k views answer comment Share Follow Print See all 8 Comments 8 8 Comments reply Show 5 previous comments ManojK commented Oct 7, 2016 reply Follow flag Yes you are correct. We generally use above aproach when input is not specified. However in your example i am unable to interprate the meaning of A,B...Z. 0 0 replyShare Rahul Jain25 commented Oct 7, 2016 reply Follow flag @Manoj, here we will be hashing the key and storing the data. But i am not able to understand solution in key. If locations are given as T[1]-T[11] then how will they stored. I mean A has key 4 then it will be stored in T[5] or [4] and what is unsucessfull probe for each key? 0 0 replyShare ManojK commented Oct 7, 2016 reply Follow flag That is what i am saying once you know value attached with A then you can easily find number of probes in searching A.But here i am unable to figure out what is value attached with A. 0 0 replyShare Please log in or register to add a comment.
1 1 vote First of all do the normal hasihng table. Remember search will be succesfull only if you are hased to any one of the * record in table. Therefore, No of succesfull probes=Total no of probes for each of the record / Total records in table=13/8=1.6 we can be hashed to any of the entry and still we can have a unsuccesfull search, Therefore No of probes for unsuccesfull search= Total no of probes from each hash value to make a unsuccesfull search / Total capacity of table =(8+7+6+5+4+3+2+2+3)/11=3.6 Rahul Jain25 answered Oct 7, 2016 Rahul Jain25 comment Share Follow See all 3 Comments 3 3 Comments reply rio commented Oct 23, 2017 reply Follow flag please explain unsuccessful probe calculation sir 0 0 replyShare arch commented Nov 26, 2017 reply Follow flag how unsuccessful probe calculated? 0 0 replyShare Harshitkmr commented Mar 28, 2020 reply Follow flag shed some light on unsuccessful search :( 0 0 replyShare Please log in or register to add a comment.
