Register

NIELIT STA 2021

265 views
0 votes
0 votes

Which open addressing technique is free from clustering problems ? 

  1. Linear Probing 
  1. Quadratic Probing 
  1. Double hashing 
  1. Rehashing 
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
rsansiya111 asked Dec 6, 2021
584 views
NIELIT STA 2021
Which of the following is true ? $\log_{17} 275 = \log_{19} 375$ $\log_{17} 275 > \log_{19} 375$ $\log_{17} 275 < \log_{19} 375$ None of these
Which of the following is true ? $\log_{17} 275 = \log_{19} 375$$\log_{17} 275 \log_{19} 375$$\log_{17} 275 < \log_{19} 375$None of these
User Avatar
0 votes
0 votes
0 answers
2
rsansiya111 asked Dec 6, 2021
296 views
NIELIT STA 2021
What is the main objective of ISO 9001 ? Verification Validation S/W Testing H/W Testing
What is the main objective of ISO 9001 ? Verification ValidationS/W TestingH/W Testing
User Avatar
0 votes
0 votes
1 answer
3
rapidxy asked Dec 14, 2021
391 views
NIELIT STQC STA 2021
Let $C(n,r)= \binom{n}{r}$.The value of $\sum_{k=0}^{20}(2k+1)C(41,2k+1)$ is : A)40(2)^40 B)40(2)^39 C)41(2)^40 D)41(2)^39
Let $C(n,r)= \binom{n}{r}$.The value of $\sum_{k=0}^{20}(2k+1)C(41,2k+1)$ is :A)40(2)^40 B)40(2)^39C)41(2)^40D)41(2)^39
User Avatar
1 votes
1 votes
0 answers
4
rsansiya111 asked Dec 6, 2021
408 views
NIELIT STA 2021
If a hash table is implemented asa search tree, the expected time required to enter n names and make m searches is proportional to: (n + m) $log_{2} n$ (n + m) $log_{2} m$ mn $log_{2} n$ mn $log_{2} m$
If a hash table is implemented asa search tree, the expected time required to enter n names and make m searches is proportional to: (n + m) $log_{2} n$(n + m) $log_{2} m$...
User Avatar
Link Copied!