edited by
503 views
0 votes
0 votes

edited by

1 Answer

0 votes
0 votes

lets determine dependencies first

12 comes after 2,13,24 

between 2,13,24 any order is possible

62 comes after 12

77 can come anytime(will calculate at last)

82 comes after 62 and 77

91 can come anytime(will calculate at last)

 

3! for 2,13,24

then 12-62

77 can come anywhere in 6 slots of those 5 numbers

3! * 6

then 82

now 91 can come anywhere in 8 slots

3!*6*8=288

 

dependencies==>

(  (2,13,24)-->12-->62 ) --> 82

77--> 82

91

 

see 77 can come anywhere before 82

91 has zero restrictions

again calculating......

3! then 12-62

77 can come in 6 slots

then 82

91 can come in 8 slots

3!*6*8=288

 

 

please check thoroughly to detect any errors

please check thoroughly to detect any errors

@Bikram@Arjun@saxena0612

 

 

 

Related questions

1 votes
1 votes
0 answers
1
charul asked Oct 30, 2017
711 views
https://gateoverflow.in/?qa=blob&qa_blobid=11318007552752576944Answer given is : 40/121
2 votes
2 votes
0 answers
2
sushmita asked Mar 26, 2017
447 views
what is the expected number of probs required when inserting an element into an open address hash table with load factor alpha(a), assume uniform hashing??
0 votes
0 votes
2 answers
3
0 votes
0 votes
1 answer
4
Ram Swaroop asked Jan 27, 2019
1,309 views
Consider the hashing table with 'm' slots and 'n' keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search...