Register

NIELIT 2016 MAR Scientist B - Section C: 17

• retagged by
1,316 views
0 votes
0 votes

A hash function $f$ defined as $f(\text{key})=\text{key mod }7$, with linear probing, insert the keys $37,38,72,48,98,11,56$ into a table indexed from $11$ will be stored in the location

  1. $3$
  2. $4$
  3. $5$
  4. $6$
• retagged by
User Avatar

2 Answers

0 votes
0 votes
OPTION  C

U CAN EASILY CALCULATE  IT  USING LINEAR PROBING  

BUT REMEMBER

FXN GIVEN AS KEY%7

SOTHAT IMPLIES U HAVE A TABLE OF 7 BLOCK (0-6)
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
3 answers
1
admin asked Mar 31, 2020
1,353 views
NIELIT 2016 MAR Scientist B - Section C: 20
A hash table has space for $100$ records. Then the probability of collision before the table is $10\%$ full, is $0.45$ $0.5$ $0.3$ $0.34$ (approximately)
A hash table has space for $100$ records. Then the probability of collision before the table is $10\%$ full, is$0.45$$0.5$$0.3$$0.34$ (approximately)
User Avatar
4 votes
4 votes
11 answers
2
admin asked Mar 31, 2020
15,621 views
NIELIT 2016 MAR Scientist B - Section C: 12
Which of the following sorting algorithms does not have a worst case running time of $O(n​^2​)$? Insertion sort. Merge sort. Quick sort. Bubble sort.
Which of the following sorting algorithms does not have a worst case running time of $O(n​^2​)$?Insertion sort.Merge sort.Quick sort.Bubble sort.
User Avatar
1 votes
1 votes
2 answers
3
admin asked Mar 31, 2020
1,437 views
NIELIT 2016 MAR Scientist B - Section C: 22
Time complexity of an algorithm $T(n)$, where $n$ is the input size is given by $\begin{array}{ll}T(n) & =T(n-1)+\frac{1}{n}, \text{ if }n>1\\ & =1, \text{ otherwise} \end{array}$ The order of this algorithm is $\log n$ $n$ $n^2$ $n^n$
Time complexity of an algorithm $T(n)$, where $n$ is the input size is given by$\begin{array}{ll}T(n) & =T(n-1)+\frac{1}{n}, \text{ if }n>1\\ & =1, \text{ otherwise} \en...
User Avatar
2 votes
2 votes
1 answer
4
admin asked Mar 31, 2020
674 views
NIELIT 2016 MAR Scientist B - Section B: 17
Following marks are obtained by the students in a test: $81,72,90,90,86,85,92,70,71,83,89,95,85,79,62$. Range of the marks is $9$ $17$ $27$ $33$
Following marks are obtained by the students in a test:$81,72,90,90,86,85,92,70,71,83,89,95,85,79,62$. Range of the marks is$9$$17$$27$$33$
User Avatar
Link Copied!