Recent questions tagged linear-probing / GATE Overflow for GATE CSE

0 votes

0 answers

1

Memory Based GATE DA 2024 | Question: 54
Hashing question: Given alpha asking for the expected no of probes. Consider the average time complexity in an unsuccessful search for open-addressing hashing with linear probing. If $ \alpha $ represents the load factor, which expression accurately represents the average time complexity ... 1 + \alpha}\right) \) $ 1 + \alpha $ $1 + \frac{ \alpha}{2} $

Hashing question: Given alpha asking for the expected no of probes.Consider the average time complexity in an unsuccessful search for open-addressing hashing with linear ...

GO Classes

224 views

GO Classes asked Feb 4

2 votes

1 answer

2

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 25
A linear-probing hash table of length $10$ uses the hash function $h(x)=x \bmod 10$ ... that apply. $34,42,23,52,33,46$ $46,34,42,23,52,33$ $42,46,33,23,34,52$ $42,23,34,52,46,33$

A linear-probing hash table of length $10$ uses the hash function $h(x)=x \bmod 10$. After inserting six integer keys into an initially empty hash table, the array of key...

GO Classes

400 views

GO Classes asked Jan 13

0 votes

1 answer

3

Made Easy Test Series 2024
Numerical Answer Type Que? (please Try to give some ahortcut trick also or important concept is there to solve that question )

Numerical Answer Type Que?(please Try to give some ahortcut trick also or important concept is there to solve that question )

Ray Tomlinson

509 views

Ray Tomlinson asked Aug 9, 2023

2 votes

4 answers

4

GO Classes 2023 | IIITH Mock Test 1 | Question: 16
Consider a hash table of $9$ slots implemented with linear probing. Suppose we insert $2$ elements in a sequence to a hash table with a simple uniform hashing assumption. What is the probability that we end up with $2$ consecutive slots of the hash table filled? ... $1/2$ $1/3$ $1/4$ $2/3$

Consider a hash table of $9$ slots implemented with linear probing. Suppose we insert $2$ elements in a sequence to a hash table with a simple uniform hashing assumption....

GO Classes

919 views

GO Classes asked Mar 26, 2023

3 votes

1 answer

5

DRDO CSE 2022 Paper 2 | Question: 22
A hash table contains $10$ buckets and uses linear probing to resolve collisions. The key values are intergers and the hash function used is $\text{Key}\%10.$ If we insert values $43,165,62,123,152$ sequentially in the table, in what bucket will the key $152$ be inserted?

A hash table contains $10$ buckets and uses linear probing to resolve collisions. The key values are intergers and the hash function used is $\text{Key}\%10.$ If we inser...

admin

553 views

admin asked Dec 15, 2022

0 votes

1 answer

6

Data structures and algorithms
Consider the last four digits of your register number and form the following numbers: 1. first digit 2. second digit 3. third digit 4. fourth digit 5. 2 digit number with the first two digits 6. 2 digit number with the last two digits ... inserted into a hash table whose description is given above and the contents of the table after insertion are to be clearly given.

Consider the last four digits of your register number and form the following numbers:1. first digit2. second digit3. third digit4. fourth digit5. 2 digit number with the ...

Karthi2003

493 views

Karthi2003 asked Nov 7, 2022

0 votes

2 answers

7

Madeeasy Test Series
A hash table of size 10 using open addressing with linear probing and hash function is h(k)= (k)mod10 , where k is key value , initially table is empty . Following keys are inserted into table in given order . 44,87,43,68,30,20,67 How many number of probes required to insert 17 in table after inserting above keys?

A hash table of size 10 using open addressing with linear probing and hash function is h(k)= (k)mod10 , where k is key value , initially table is empty . Following keys a...

Manisha Jaishwal

983 views

Manisha Jaishwal asked Jul 25, 2022

0 votes

2 answers

8

UGC NET CSE | December 2005 | Part 2 | Question: 22
A hash function $f$ defined as $f(\text{key}) =\text{key mod}$ $7$, with linear probing it is used to insert the key $37,38,72,48,98,11,56$ into a table index from $0$ to $6$. What will be the locations of $11$: $3$ $4$ $5$ $6$

A hash function $f$ defined as $f(\text{key}) =\text{key mod}$ $7$, with linear probing it is used to insert the key $37,38,72,48,98,11,56$ into a table index from $0$ to...

go_editor

235 views

go_editor asked Mar 27, 2020

0 votes

1 answer

9

#TestBook-algo
The characters of the string K R P C S N Y T J M are inserted into a hash table of size of size 10 using hash function h(x) = (ord(x) - ord(A) +1) If linear probing is used to resolve collisions, then the following insertion causes collision 1:Y 2:C 3:M 4:P The given ans is 3.. but what is the approach and what do we mean by ord?

The characters of the string K R P C S N Y T J M are inserted into a hash table of size of size 10 using hash functionh(x) = (ord(x) - ord(A) +1)If linear probing is used...

anjali007

243 views

anjali007 asked Dec 17, 2018

1 votes

1 answer

10

doubt regarding NUMBER OF INSERTION SEQUENCES IN HASH TABLE

neerajyadav

719 views

neerajyadav asked Dec 4, 2018

4 votes

2 answers

11

ISRO2018-36
A hash table with $10$ buckets with one slot pet per bucket is depicted here. The symbols, $S1$ to $S7$ ... $4$ $5$ $6$ $3$

A hash table with $10$ buckets with one slot pet per bucket is depicted here. The symbols, $S1$ to $S7$ are initially entered using a hashing function with linear probing...

Arjun

2.5k views

Arjun asked Apr 22, 2018

0 votes

1 answer

12

Made Easy

Lucky sunda

321 views

Lucky sunda asked Dec 15, 2016

4 votes

1 answer

13

DS+ Algorithm test

Rahul Jain25

903 views

Rahul Jain25 asked Oct 7, 2016

2 votes

1 answer

14

hashing
The keys 25, 6, 37, 79, 51, 13 and 31 are inserted into an initially empty hash table of length 7 using open addressing with hash function h(k)=k mod 7 and linear probing. What is the number of collision if linear probing is used to resolve the collision? 8 9 11 10

The keys 25, 6, 37, 79, 51, 13 and 31 are inserted into an initially empty hash table of length 7 using open addressing with hash function h(k)=k mod 7 and linear probing...

Amit puri

422 views

Amit puri asked Aug 24, 2016

3 votes

3 answers

15

ISRO2014-64
Consider a 13 element hash table for which f(key)=key mod 13 is used with integer keys. Assuming linear probing is used for collision resolution, at which location would the key 103 be inserted, if the keys 661, 182, 24 and 103 are inserted in that order? 0 1 11 12

Consider a 13 element hash table for which f(key)=key mod 13 is used with integer keys. Assuming linear probing is used for collision resolution, at which location would ...

go_editor

3.3k views

go_editor asked Jul 1, 2016

5 votes

1 answer

16

ISRO2016-29
A Hash Function $f$ defined as $f(key)= key \mod 7$. With linear probing while inserting the keys $37,38,72,48,98,11,56$ into a table indexed from $0$, in which location key $11$ will be stored (Count table index $0$ as $0^{th}$ location)? 3 4 5 6

A Hash Function $f$ defined as $f(key)= key \mod 7$. With linear probing while inserting the keys $37,38,72,48,98,11,56$ into a table indexed from $0$, in which location ...

sh!va

4.9k views

sh!va asked Jun 18, 2016

1 votes

2 answers

17

Hash table
A hash table can store a max of 10 records, currently, there are records in locations 1,3,4,7,8,9,10. The probability of a new record going into location 2,with a hash function resolving collisions by linear probing is..

A hash table can store a max of 10 records, currently, there are records in locations 1,3,4,7,8,9,10. The probability of a new record going into location 2,with a hash fu...

Soumyashree

9.0k views

Soumyashree asked Nov 21, 2015

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true