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
- 17125 Views
- KPIT, I also Faced
- E-Mail Answers
Answer Posted / atta un nabi
for n=1000 n^2 is better in average time complexity.
for n<100 n^2is better.
for n>10000 150nlogn is better.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
In what scenario, binary search can be used?
Is quicksort divide and conquer?
What do you mean by the term “percolate down”?
What is linked hash set?
Two linked lists are given, find out the sum of them without altering the linked list?
How does a selection sort work for an array?
write an algorithm to show the procedure of insertion into a b-tree?
What are linear and non linear data structures?
Which method will arrange the element of an array in alphabetical order?
Do you know how to find if linked list has loop?
What does quick sort do?
What are different types of linked lists?
What is data structure and why we need them?
What is the default size of arraylist?
Is queue fifo or lifo?
