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
- 17120 Views
- KPIT, I also Faced
- E-Mail Answers
Answer Posted / atta un nabi
150nlog2n has an advantage if the value is sufficiently high weather the n^2 has an advantages but in some interval of value that may be smaller then 10000 or not.
according to me if the input size is smaller then 100 it may be exchange their advantages at size 18 or round about it. since n^2 is better.
n^2 is better for average size of 1000.
| Is This Answer Correct ? | 2 Yes | 0 No |
Post New Answer View All Answers
What is meant by deque?
What is tree in computer science?
What is integer max_value?
Can arraylist be empty?
In tree construction which is the suitable efficient data structure?
Which are the sorted collections?
When will you use array over arraylist?
How to sort 1 million floating point numbers?
Explain set interface?
What do you mean by union-by-weight?
How do you do binary search?
Why null is allowed in hashmap?
Where will be the free node available while inserting a new node in a linked list?
What is a map in programming?
Does arraylist maintain insertion order?
