Data Structures :: Hashing

Home > Technical Aptitude > Data Structures > Hashing > General Questions
NA
SHSTTON
39
Solv. Corr.
45
Solv. In. Corr.
84
Attempted
0 M:0 S
Avg. Time

1 / 52

Choose the correct option.

If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :

Aless than 1

Bless than n.

Cless than m.

Dless than n/2.

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
24
Solv. Corr.
90
Solv. In. Corr.
114
Attempted
0 M:9 S
Avg. Time

2 / 52

Choose the correct option.

The hash function is
H1(k) = k % 50.
In the case of collision, the hash function used is
H(k) = (H1(k) + M x H2(k)) % 50
where H1(k) = k % 50 and H2(k) = k % 20.
M is initialized to 0 and is incremented by 1 each time a collision occurs.
This could be categorized under which of the following collision detection technic

ALinear Probing

CRe-Hashing

DDouble Hashing

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
50
Solv. Corr.
87
Solv. In. Corr.
137
Attempted
0 M:27 S
Avg. Time

3 / 52

Choose the correct option.

Which of these are core interfaces in the collection framework. Select the one correct answer.

ATree

BStack

CQueue

DMap

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
27
Solv. Corr.
7
Solv. In. Corr.
34
Attempted
0 M:0 S
Avg. Time

4 / 52

Choose the correct option.

Which of the following is used in hash tables to determine the index of any input record?

Ahash function

Chash chaining

Dhash tree

Explanation:

Hash table is an example of a data structure that is built for fast access of elements. Hash functions are used to determine the index of any input record in a hash table.

Workspace

NA
SHSTTON
21
Solv. Corr.
14
Solv. In. Corr.
35
Attempted
0 M:0 S
Avg. Time

5 / 52

Choose the correct option.

Which of the following technique stores data in the hash table itself in case of a collision?

CChaining using binary tree

Explanation:

Open addressing is used to store data in the table itself in case of a collision. Whereas chaining stores data in a separate entity.

Workspace

NA
SHSTTON
29
Solv. Corr.
1
Solv. In. Corr.
30
Attempted
0 M:0 S
Avg. Time

6 / 52

Choose the correct option.

Hashing is the problem of finding an appropriate mapping of keys into addresses.

ATRUE

BFALSE

Explanation:

Hashing is a data structure which is used to locate data in a table based on a key value.

Workspace

NA
SHSTTON
22
Solv. Corr.
17
Solv. In. Corr.
39
Attempted
0 M:0 S
Avg. Time

7 / 52

Choose the correct option.

In a hash table of size 10, where is element 7 placed?

A6

B7

C6

D17

Explanation:

The hash location is defined as hash(f)= key mod table_size.
7 mod 10 gives 7. It is placed in 7th position.

Workspace

NA
SHSTTON
11
Solv. Corr.
18
Solv. In. Corr.
29
Attempted
0 M:0 S
Avg. Time

8 / 52

Choose the correct option.

What should be the load factor for separate chaining hashing?

A0.5

B1

C2

D1.5

Explanation:

For hashing using separate chaining method, the load factor should be maintained as 1. For open addressing method, it should not exceed 0.5.

Workspace

NA
SHSTTON
16
Solv. Corr.
11
Solv. In. Corr.
27
Attempted
0 M:0 S
Avg. Time

9 / 52

Choose the correct option.

Which of the following trait of a hash function is most desirable?

Ait should cause less collisions

Bit should cause more collisions

Cit should be easy to implement

Dit should occupy less space

Explanation:

Hash function calculates and returns the index for corresponding data. So the most important trait of a hash function is that it should cause a minimum number of collisions.

Workspace

NA
SHSTTON
22
Solv. Corr.
6
Solv. In. Corr.
28
Attempted
0 M:0 S
Avg. Time

10 / 52

Choose the correct option.

A hash table may become full in the case when we use open addressing.

ATRUE

BFALSE

Explanation:

A hash table may become full in the case when we use open addressing. But when we use separate chaining it does not happen.

Workspace

Data Structures Hashing Questions and Answers pdf

At Data Structures topic Hashing, you will get multiple online quiz difficulty wise, which will have a total of 6 quizzes, categorized as easy, medium, and moderate level. While preparing for any Hashing, take all the list quiz and check your preparation level for that topic. Each quiz have 10 different question, which needs to be answered in 20 min., all the listed quiz here is free, however, you will get only one chance for each quiz to attempt(Take Quiz seriously), so it is always recommended to take one quiz in each section before you start solving Hashing MCQs practice question, and one after solving all the question of the respective level, you can refer back your Hashing quiz result any time or you can download it as pdf for reference.

Data Structures Quiz Online Test

The details of the Data Structures quiz are as follows. There are 10 questions for you. You have to answer them in 20 minutes. Within 20 minutes you have to see the errors in the sentences given as a question. Four options are also given to you, and you have to choose your opinion. You must be confident in your answer that the choices are difficult. Therefore, below we provide you with some information about Data Structures that you see and keep them in mind while answering questions.

Data Structures MCQs Practice Questions with Answer

On this section of page you will find the easiest quickest ways to solve a question, formulas, shortcuts and tips and tricks to solve various easiest methods to solve Data Structures Question Quickly. It contains all the Data Structures topic Hashing questions which are common in any of the preliminary exams of any company. The solution is provided along with the questions. The practice of these questions is a must as they are easy as well as scoring and asked in all the exams They will confirm the selection if all the questions attempted wisely with little practice. It is recommanded to Take Mock test based on Data Structures topic and Hashing topic based quiz.

Data Structures solved examples question

You can get here fully solved Hashing examples with a detailed answer and description. You can solve Hashing problems with solutions, the questions by companies wise by filtering the questions, additionally, you can check what type of questions are being asked in IT companies Written Round from Hashing. Hashing became one of the most important sections in the entire competitive exams, Companies Campus, and entrance online test. Go through Hashing Examples, Hashing sample questions. You can Evaluate your level of preparation in Hashing by Taking the Q4Interivew Hashing Online Mock Test based on most important questions. All the Hashing practice questions given here along with answers and explanations are absolutely free, you can take any number of time any mock Test.

Why Data Structures Hashing?

In this practice section, you can practice Data Structures Questions based on "Hashing" and improve your skills in order to face the interview, competitive examination, IT companies Written exam, and various other entrance tests (CAT, GATE, GRE, MAT, Bank Exam, Railway Exam etc.) with full confidence.

Where can I get Data Structures Hashing questions and answers with explanation?

Q4Interview provides you lots of fully solved Data Structures (Hashing) questions and answers with Explanation. Solved examples with detailed answer description, explanation are given and it would be easy to understand. You can download Data Structures Hashing quiz questions with answers as PDF files and eBooks.

Where can I get Data Structures Hashing Interview Questions and Answers (objective type, multiple-choice, quiz, solved examples)?

Here you can find objective type Data Structures Hashing questions and answers for interview and entrance examination. Multiple choice and true or false type questions are also provided.