The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
DataStructure
0
votes
95
views
is hashing there in gate 2019 syllabus?
datastructures
hashing
asked
Dec 9, 2018
in
DS
by
abhishek1995_cse
(
111
points)

95
views
answer
comment
0
Yes see the syllabus of GATE CSE 2019
http://gate.iitm.ac.in/Syllabus
0
Yes, it is very much in the syllabus
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
+1
vote
1
answer
1
ISRO202024
In linear hashing, if blocking factor $bfr$, loading factor $i$ and file buckets $N$ are known, the number of records will be $cr= i+bfr+N$ $r=ibfrN$ $r=i+bfrN$ $r=i*bfr*N$
asked
Jan 13
in
DS
by
Satbir
Boss
(
24.1k
points)

98
views
isro2020
datastructures
hashing
normal
+4
votes
3
answers
2
Made Easy Test Series: DSHash Table
Consider a hash table with $N$ slots. It is given that the collision resolution technique used in chaining. Assume simple uniform hashing, what is the probability that the last $k$ slots are unfilled after the first $'r'$ insertions? $A)\left ( 1\frac{N}{k} \right )^{r}$ ... $C)\left ( 1+\frac{N}{k} \right )^{r1}$ $D)\left ( 1\frac{k}{N} \right )^{r1}$
asked
May 5, 2019
in
DS
by
srestha
Veteran
(
119k
points)

173
views
datastructures
madeeasytestseries
hashing
0
votes
0
answers
3
MadeEasy Test Series 2019: Programming & DS  Hashing
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 is_ Answer 1.647
asked
Jan 27, 2019
in
DS
by
Ram Swaroop
Loyal
(
5.4k
points)

239
views
programminginc
datastructures
hashing
madeeasytestseries2019
madeeasytestseries
0
votes
1
answer
4
Insertion in Hash table. (M.E.)
The number of different insertion sequences of numbers $\left \{ 7,20,32,50,66,77 \right \}$ on an initially empty hash table H of size $6$ and a hash function $h\left ( k \right )=k\mod6$ with linear probing scheme for collision resolution such that the hash table obtained ... ${\color{Blue} {2}}$ ${\color{Blue} {3}}$. ${\color{Blue} {4}}$ ${\color{Blue} {5}}$
asked
Jan 16, 2019
in
DS
by
srestha
Veteran
(
119k
points)

218
views
hashing
datastructures
Quick search syntax
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
Recent Posts
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
All categories
General Aptitude
1.9k
Engineering Mathematics
7.5k
Digital Logic
2.9k
Programming and DS
4.9k
Programming
3.5k
DS
1.3k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.1k
Operating System
4.5k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.4k
Others
1.4k
Admissions
595
Exam Queries
573
Tier 1 Placement Questions
23
Job Queries
72
Projects
18
Follow @csegate
Recent Blog Comments
Which questions are u challenging..?
ONLY T MADE EASY STUDENTS CAN UNDERSTAND,
Yes and few more questions also
nkg_master9 you challenged that dbms query...
@nsaisirisha Yes they will give marks only...
50,737
questions
57,353
answers
198,477
comments
105,247
users