NEW
New Website Launch
Experience the best way to solve previous year questions with mock tests (very detailed analysis), bookmark your favourite questions, practice etc...

## Marks 1

More
Suppose we are given n keys, m has table slots, and two simple uniform hash functions h1 and h2. Further suppose our has...
GATE CSE 2022
Consider a double hashing scheme in which the primary hash function is h1(k)=k mod 23, and the secondary hash function i...
GATE CSE 2020
Given a hash table $$𝑇$$ with $$25$$ slots that stores $$2000$$ elements, the load factor $$\alpha$$ for $$𝑇$$ is ___...
GATE CSE 2015 Set 3
Consider the following two statements: i. A hash function (these are often used for computing digital signatures) is an...
GATE CSE 2007
A hash table contains 10 buckets and uses linear probing to resolve collisions. The key values are integers and the hash...
GATE CSE 2005
Given the following input (4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199) and the hash function x mod 10, which of the ...
GATE CSE 2004
An advantage of chained hash table (external hashing) over the open addressing scheme is
GATE CSE 1996

## Marks 2

More
Consider a dynamic hashing approach for 4-bit integer keys: 1. There is a main hash table of size 4. 2. The 2 least si...
GATE CSE 2021 Set 1
Which one of the following hash functions on integers will distribute keys most uniformly over $$10$$ buckets numbered \$...
GATE CSE 2015 Set 2
Consider a hash table with 100 slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is t...
GATE CSE 2014 Set 3
Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by chaining. The fo...
GATE CSE 2014 Set 1
A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 v...
GATE CSE 2010
A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 v...
GATE CSE 2010
The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using open addressi...
GATE CSE 2009
Consider a hash table of size 11 that uses open addressing with linear probing. Let h(k) = k mod 11 be the hash function...
GATE CSE 2008
Consider a hash function that distributes keys uniformly. The hash table size is 20. After hashing of how many keys will...
GATE CSE 2007
Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table...
GATE CSE 2007

### Joint Entrance Examination

JEE Main JEE Advanced WB JEE

### Graduate Aptitude Test in Engineering

GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN

NEET

Class 12