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
- 17178 Views
- KPIT, I also Faced
- E-Mail Answers
Answer Posted / achintya singhal
ultimately you will be receiving a matrix of 10*15
A1*A2 give matrix of 10*1
A3*A4 give matrix of 1*5
A5*A6 give matrix of 5*15
therefore use
(A1*A2)*(A3*A4)*(A5*A6)
ALL other will increase the complexity or give matrices of
higher order...
| Is This Answer Correct ? | 8 Yes | 3 No |
Post New Answer View All Answers
How to search binary in a sorted array?
Is heap sort faster than quicksort?
What are the advantages and disadvantages of linked list?
What is sorting and its types?
Which sorting algorithm is used in collections sort?
Is a hashmap a dictionary?
What is dynamic array how it is created?
What is adt in data structure with example?
Describe avl tree or height balanced binary search tree.
Does arraylist maintain insertion order?
Should I use hashmap or hashtable?
What is the difference between array and stack?
How do you determine if a binary tree is height balanced?
Differentiate between queue and stack.
What are the Difference between tcp and udp?
