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
Explain what are the types of collision resolution techniques and the methods used in each of the type?
What you mean by sorting?
Is a list an array?
How do you sort in ascending order in arraylist?
What is the use of treemap?
Differentiate between push and pop?
Define indegree of a graph?
What does arraylist remove return?
How do you explain bubble sort?
You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?
What is application of data structure?
Is a hashset ordered?
What does simulation of queues mean?
How do you find the number of comparisons in bubble sort?
How is the front of the queue calculated ?