Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 19258 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
Explain what is the data structures used to perform recursion?
What is peek in stack?
Which sorting algorithm is considered the fastest?
Which is better hashmap or treemap?
Why do we need searching algorithms?
What are the different binary tree traversal techniques?
What are control structures?
What is m way tree in data structure?
Why do we use dynamic arrays?
How do you do a selection sort?
Define a complete binary tree?
What is the idea behind splaying?
How memory is reserved using a declaration statement in data structure?
What are the advantages of linked list over an array?
Describe queue operation.
