Differentiate between hashset and hashmap.
- 0 Answers
- 520 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
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).
List the basic operations carried out in a linked list?
1) Program A and B are analyzed and found to have worst- case running times no greater than 150nlog2n and n2 respectively.Answer the folloWing questions if possible.. i) which program has the better guarantee on the running time,for larger values of n(n>10000) ? ii) which program has the better guarantee on the running time,for small values of n(n<100) ? iii) which program will run faster on average for n =1000 2) wRite a program to compute the number of collisions required in a long random sequence of insertions using linear probing ,quadratic probing and double hashing 3) what is the optimal way to compute A1 A2 A3 A4 A5 A6 where the dimensions of the matrices are A1:10*20 A2 : 20 * 1 A3 : 1 * 40 A4 : 40*5 A5 : 5 * 30 A6 : 30 X 15
What do you mean by primary clustering?
Which is better hashmap or hashtable?
Explain the Stack
Which interfaces are implemented by linkedhashset?
Briefly explain recursive algorithm 50 how do you search for a target key in a linked list?
Why is sorting important?
How can you represent a linked list node?
How can avl tree be useful in all the operations as compared to binary search tree?
What is a data structure?
Windows 
