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
- 17177 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
How do we find duplicate elements in an array?
In what order the elements of a hashset are retrieved?
How do you sort an arraylist in descending order?
Questions related to arrays, such as given a 2 integer array, find the common elements.
What is minimum depth of binary tree?
Define a path in a tree?
What is a dequeue?
Can treemap have null values?
What is binary tree give example?
Sorting is not possible by using which of the methods?
Why null is allowed in hashmap?
How many null values are allowed in hashmap?
How efficient is binary search?
Does treeset allow null?
What is data type explain?
