Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / surendra gour
Hashing is the technique to search data.Its main purpose to
eliminate the unnecessary searching time by using the direct
addressing method.
| Is This Answer Correct ? | 0 Yes | 3 No |
Post New Answer View All Answers
What is quick sort example?
Differentiate between list and map.
How will you check the validity of an expression containing nested parentheses?
Explain implementation of deletion from a binary tree.
What is difference between hashmap and linkedhashmap?
What is the slowest sorting algorithm?
Is bucket sort stable?
Find duplicates in infinite range. Which data structure to be used to give efficient solution?
How to inverting a function in sort and searching?
What is fibonacci search?
How does insertion sort works?
Does arraylist guarantee insertion order?
How do you define a set?
Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).
what are the applications that use Linked lists?
