Interested to Buy Any Domain ? << Click Here >> for more details...
Explain binary searching and Fibinocci search?
- 0 Answers
- 962 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
what is the need of data structure
Is map a data structure?
Explain the applications of stack?
What is complexity of bubble sort?
Define linked lists?
How does a hashmap work?
Explain how to find 3rd element from end in a linked list in one pass?
What are linked lists used for?
What are all the classes and interfaces that are available in the collections?
How do signed and unsigned numbers affect memory?
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
Why is hashing used?
Windows 
