Are collections thread safe?
No Answer is Posted For this Question
Be the First to Post Answer
What is comparable interface?
Explain the difference between a list and array.
Name few collections map implementations?
Is hashset synchronized?
Why it is important to have aligned addresses? What is the exception generated when there is a misaligned address?
State the difference between queues and linked lists?
What is difference between list and linked list?
What is unbounded queue?
How to search binary in a sorted array?
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
where do you use double linked list?
What is the use of threaded binary tree?