Prepare
Practice
Interview
Aptitude
Reasoning
English
GD
Placement papers
HR
Current affairs
Engineering
MCA
MBA
Online test
Login
Hashing is fastest way to store & retrieve data - Data Structure
Home
>>
Category
>>
Programming Language (MCQ) questions
>>
Data Structure
Q. Which of the following is the fastest ways to store and retrieve data?
- Published on 26 Aug 15
a.
Sorting
b.
Hashing
c.
Indexing
d.
both A and C
ANSWER: Hashing
Related Content
Networking (
207
)
Database (
97
)
C programming (
58
)
Software Engineering (
28
)
SQL (
5
)
HTML (
74
)
Web Technologies (
11
)
Data Structure (
140
)
Operating System (
96
)
Java (
25
)
Oracle (
5
)
C++ (
50
)
Algorithms (
7
)
PL/SQL (
13
)
JavaScript (
7
)
XML (
0
)
CSS (
1
)
Discussion
Nirja Shah
-Posted on 21 Nov 15
There are many techniques to store and retrieve data and the performance of these techniques is depending upon the type and structure of data. According to given question hashing is the fastest ways to store and retrieve data.
Almost all searching technique, the search time is dependent on the number of items and many key comparisons are involved. Hashing is a technique where search time is independent of the number of items. This technique uses hash function to generate an address from a key. We can write hash function as follows
h(k)=a;
Where h is hash function, k is the key, a is the hash value of the key.
➨
Post your comment / Share knowledge
Required!
Required!
Invalid Email Id!
Required!
Enter the code shown above:
Please enter the code shown above
(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
MCQs
English
Tutorials
Download
▲