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
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
Is bubble sort adaptive?
Explain Queue
What is a map programming?
In which matrix, we can use multilinked structures?
What is mean by abstract data type?
Explain binary tree traversals?
What is a list of lists?
Which interface treemap implements?
What is merge sort in daa?
Explain the difference between hashset and hashmap?
Do sets allow duplicates?
What happens if we try to insert duplicate key in hashmap?
What are the types of algorithms?
What is nsmutablearray?
Explain the term tail recursion?