Discussion
A technique for direct search is :
Answer: C
The direct search technique is Hashing.
Hashing computes the storage address of a record directly from its key by a hash function, so in the ideal case the item is reached in one step, O(1), without comparing it with other keys.
Linear search compares the key with items one by one, binary search halves a sorted list by comparison at each step, and tree search follows a path of comparisons from the root. All three are comparison-based searches rather than direct ones.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development