Prepare
Practice
Interview
Aptitude
Reasoning
English
GD
Placement papers
HR
Current affairs
Engineering
MCA
MBA
Online test
Login
Online Practice Test
>
Data Structure 1
« Previous
Next »
___________ is one of the fastest ways to store and retrieve data
Options
- Sorting
- Hashing
- Indexing
- both b and c
CORRECT ANSWER : Hashing
Discussion Board
Data Structure - Hashing
Hashing is one of the fastest ways to store and retrieve data. Hashing is used to index and retrieve items in a database because it is faster to find the item using the shorter hashed key than to find it using the original value. It is also used in many encryption algorithms.
Prajakta Pandit 02-1-2017 03:20 AM
why not "both b and c"?
indexing is also one of the best practices?
athos 01-9-2015 08:12 AM
« Previous
Next »
Write your comments
*
*
Email must be in the form someone@domain.com
*
*
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.)
Related Content
C test (42)
C (12)
C++ for beginners (10)
C++ (20)
C++ (24)
C++ (18)
C++ (14)
C++ (12)
C++ (15)
C++ (15)
Data structure (20)
Data structure (10)
Data structure (10)
Data structure (10)
PERL (25)
VC++ (11)
Oops (30)
Mainframe (41)
Mainframe (15)
Embedded systems (15)
OOAD (49)
Advertisement
▲