[Updated] Goldman Sachs Aptitude Test Questions and Answers
Practice List of TCS Digital Coding Questions !!!
Take 50+ FREE!! Online Data Interpretation Mock test to crack any Exams.

Hashing Questions

Home > Technical Aptitude > Data Structures > Hashing > General Questions
NA
SHSTTON
24
Solv. Corr.
49
Solv. In. Corr.
73
Attempted
0 M:0 S
Avg. Time

41 / 52

Choose the correct option.

What are the values of h1(k) and h2(k) in the hash function?


Ah1(k) = m mod k h2(k) = 1+ (m’ mod k)

Bh1(k) = 1 + (m mod k) h2(k) = m’ mod k

Ch1(k) = k mod m h2(k) = 1+ (k mod m’)

Dh1(k) = 1+ (k mod m) h2(k) = k mod m

Answer: Option C

Explanation:

The values h1(k) and h2(k) are k mod m and 1+(k mod m’) respectively where m is a prime number and m’ is chosen slightly less than m. (m’=m-1).

Workspace

NA
SHSTTON
88
Solv. Corr.
135
Solv. In. Corr.
223
Attempted
0 M:0 S
Avg. Time

42 / 52

Choose the correct option.

What is the running time of double hashing?


ATheta(m)

BTheta(m2)

CTheta(m3)

DTheta(m log k)

Answer: Option A

Explanation:

The running time of double hashing is Theta(m) since each possible (h1(k), h2(k)) pair yields a distinct probe sequence. Hence the performance of double hashing is better.

Workspace

NA
SHSTTON
15
Solv. Corr.
58
Solv. In. Corr.
73
Attempted
0 M:0 S
Avg. Time

43 / 52

Choose the correct option.

Which technique has the greatest number of probe sequences?


ALinear probing

BQuadratic probing

CClosed hashing

DDouble hashing

Answer: Option D

Explanation:

Double hashing has the greatest number of probe sequences thereby efficiently resolves hash collision problems.

Workspace

NA
SHSTTON
78
Solv. Corr.
289
Solv. In. Corr.
367
Attempted
0 M:51 S
Avg. Time

44 / 52

Choose the correct option.

Where does the number 14 get inserted in the following table?


hash-1


A2

B9

C8

D4

Answer: Option B

Explanation:

Here the hash table is of size 13 with h1(k) = k mod 13 and h2(k) = 1 + k mod 11. Since 14 = 1 (mod 13) and 14 = 3 (mod 11), the key 14 is inserted into empty slot 9.

Workspace

NA
SHSTTON
11
Solv. Corr.
54
Solv. In. Corr.
65
Attempted
0 M:0 S
Avg. Time

45 / 52

Choose the correct option.

What is the value of m’ if the value of m is 19?


A11

B18

C15

D17

Answer: Option D

Explanation:

The value of m’ is chosen as a prime number slightly less than the value of m. Here the value of m is 19, hence the value of m’ can be chosen as 17.

Workspace

NA
SHSTTON
90
Solv. Corr.
142
Solv. In. Corr.
232
Attempted
0 M:59 S
Avg. Time

46 / 52

Choose the correct option.

Hash tree is generalization of ______


AHeap

BHash list

CB – tree

DBST

Answer: Option B

Explanation:

Hash list is the list of hashes of the blocks in a set file. Hash tree is a generalization of the hash list in which leaves are labeled with the hash of a data block and every non-leaf node is hash of the labels of its children.

Workspace

NA
SHSTTON
54
Solv. Corr.
8
Solv. In. Corr.
62
Attempted
0 M:0 S
Avg. Time

47 / 52

Choose the correct option.

Hash tree is used in effective data verification in distributed systems.


ATRUE

BFALSE

Answer: Option A

Explanation:

Hash trees are used in distributed systems for efficient data verification. Hash tree used hashes instead of the full files, hence they are efficient. Because Hashes are ways of encoding files that are much smaller than the actual file itself.

Workspace

NA
SHSTTON
43
Solv. Corr.
296
Solv. In. Corr.
339
Attempted
0 M:15 S
Avg. Time

48 / 52

Choose the correct option.

Which of the following is a widely used form of the hash tree?


AB+ – tree

BT tree

CHtree

DTiger tree hash

Answer: Option D

Explanation:

The general form the hash tree which is used widely is the Tiger tree hash. It uses a binary hash tree, usually has a data block size of 1024 bytes and uses the Tiger hash.

Workspace

NA
SHSTTON
21
Solv. Corr.
46
Solv. In. Corr.
67
Attempted
0 M:0 S
Avg. Time

49 / 52

Choose the correct option.

Which of the following is true for a Hash tree?


AHashing is used for sequential access

BIndexing is used for direct access

CHashing is used for direct access

DHash tree allows only sequential access

Answer: Option C

Explanation:

Hash tree allows direct as well as sequential access of the records. Hashing is used for direct access and indexing is generally used for the sequential access.

Workspace

NA
SHSTTON
69
Solv. Corr.
293
Solv. In. Corr.
362
Attempted
0 M:9 S
Avg. Time

50 / 52

Choose the correct option.

Hash tree is also known as _____


AMerkle tree

BT -tree

CBx-tree

DHash table

Answer: Option A

Explanation:

Hash tree is generally known as Merkle tree after Ralph Merkle who patented it in 1979. Typically Merkle trees have a branching factor of 2, meaning that each node has up to 2 children.

Workspace

Data Structures Hashing Questions and Answers pdf

At Data Structures topic Hashing page No: 5 you will find list of 10 practice questions, tips/trick and shortcut to solve questions, solved questions, quiz, and download option to download the whole question along with solution as pdf format for offline practice. You can practice all the listed Data Structures Hashing topic questions offline too, by downloading the MCQs practice question of Hashing with detail solution, with formula/Tips & Tricks, with Solved examples and with top-rated users answers, which will give you best answer ascross webs. It is one of the perfect Hashing e-book pdf covering all types of questions in detail. These Data Structures test with answers pdf cover all types of question asked in IIFT, XAT, SNAP, GRE, GMAT, NMAT, CMAT, MAT or for IT companies written exam like Wipro, HCL, Infosys, Accenture, Government exams, IBPS Exams etc. There are multiple formats to download your online free Data Structures Hashing e-book, like fully solved, unsolved questions with Answers sheet. Even you can customize your ebook format by adjusting the given options in the download section to make it your one of the best Data Structures topic-based ebook. It is recommended to bookmark this page Data Structures Hashing for your preparation. Most of the students and fresher candidates finding it hard to clear the Data Structures section in exams. Here Given Hashing practice questions, quiz, fully solved questions, tips & trick and Mock tests, which include question from each topic will help you to excel in Hashing. Each test has all the basics questions to advanced questions with answer and explanation for your clear understanding, you can download the test result as pdf for further reference.

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 Hashing Customize Online Mock Test

This is own type of mock test, where At this Data Structures Hashing MCQs mock test section, you will able to attempt only the questions related to Hashing, in that question will be a different level, important, and all the questions will be part of some of the mock tests across Q4interview FREE Mock test. You need to choose the topic as Hashing, and click on Double click to generate your customize mock test. While attempting the mock test you need to choose any of the one options out of given option. It is recommended to go through the direction given along with each question, as these questions will be randomly and so that same direction will not be applicable across the entire test. Once you submit your mock test, the result will be generated for Hashing Customize mock test, where your performance point points will be highlighted. Q4interview analysis every single point which helps you to improve your topic understanding and help you to know your type of mistakes and way to improve Hashing questions, by providing the same type of practice questions from practice exercise. The best part of this Hashing, all these mock tests listed here are free and you can take as Many time, as many you want. When you continue to give Hashing Customize Online Mock Test here regularly, then you will understand how much you have developed your accuracy on a topic, after that you will be able to decide how much attention you need to focus on. Your continued practice will increase your confidence, speed and thinking ability intensely, the Hashing Customize topic on which you will practice more will beneficial for you in future during campus placement.Hashing Mock Tests

Data Structures Hashing Quiz Online Test

The details of the Data Structures Hashing 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 Hashing that you see and keep them in mind while answering questions.

Data Structures Hashing MCQs Practice Questions with Answer

On this Hashing 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 Hashing 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 Hashing solved examples question

Clarity of concepts is a must if you want to master the skill of solving Data Structures problems. This page contains sample Data Structures Hashing questions and answers for freshers and competitive exams. Hashing Questions with the detailed description, the explanation will help you to master the topic. Here solved examples with detailed answer description, explanations are given and it would be easy to understand. How to solve qHashingData Structures? Here are some examples solved with the Common Rules/tricks/tips of Data Structures. Enhance your chance to score maximum marks in Data Structures sections through. Error Spotting Grammar Questions Online Test for Free. Fully solved Sentence Formation MCQs questions with detailed answer description. Data Structures is an important topic for any exams but most aspirants find it difficult. You need to learn various tricks tips, rules, etc to solve quickly. At this page, you will find frequently asked Hashing questions or problems with solutions, shortcuts, formulas for all-important competitive exams like IT companies exams, interviews. It is always a best practice to go through the example and understand the types of question and way to solve it, so let's do some examples to calculate efficiency, read through all the given here solved examples. You can post your solution, tips, trick and shortcut if you have any in respect to questions.

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.