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 / supra
A belongs to theta(nlogn) class.
B belongs to theta(n^2) class.
Hence at larger inputs,A has a better effeciency
However at smaller inputs say 10,
150*10*1>10*10
Hence B ia better.
But in average case on all inputs, nlogn is always better than n^2.Hence A is better.
For 3) Its all abt matrix compatibility.
First A7=A1*A2(it ll give 10*1 matrix after multiplication)
Next, A8=A3*A4(1*5)
A9=A5*A6(5*15)
Next, A10=A7*A8(10*5). Lastly, A11= A10*A9(10*15)
| Is This Answer Correct ? | 1 Yes | 2 No |
Post New Answer View All Answers
an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
What exactly is a thread?
What is the family trees and connection by clause?
What is sorted list in data structure?
What is impact of signed numbers on the memory using data structures?
What does enum do?
What can be stored in an arraylist?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Define depth and height of a tree?
Mention one advantage and disadvantage of using quadratic probing?
What is the capacity of arraylist?
What is sorting and classifying?
Does arraylist have index?
What is fibonacci search?
What are the 3 types of measurement?