Which is faster arraylist or hashmap?


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Data Structures Interview Questions

What is a simple graph?

0 Answers  


What are the difference between a stack and a queue?

0 Answers  


What do you mean by overflow and underflow?

0 Answers  


What is a cycle or a circuit?

0 Answers  


Explain heapsort. What is its complexity?

0 Answers   Essar,


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

5 Answers   KPIT,


Why merge sort is better than insertion sort?

0 Answers  


What are linked lists most commonly used for?

0 Answers  


What are the disadvantages of representing a stack or queue by a linked list?

0 Answers  


What is placement new in data structures?

0 Answers  


How can I search for data in a linked list?

0 Answers  


What do you mean by external sorting?

0 Answers  


Categories