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
- 19138 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
Given an array of integers, devise a program to replace every element with the next greatest element on the right side in the array. Also, replace the last element with 5 as there no element on the right side of it.
Define 2-3 tree?
why boundary tag representation is used?
Tell me do array subscripts always start with zero?
What is meant by deque?
Which is the parent class of linkedhashset class?
What is meant by ordered and sorted in collections?
There are 2 int type array data type. One is containing 50 elements, and another one is containing 30 elements. Can we assign the array of 50 elements to an array of 30 elements?
What are the types of queues?
What is the difference between data types and data structures?
What is the order of selection sort?
Which programming language is best for data structures?
Differentiate between failfast and failsafe.
Which sorting algorithms are in place?
Which data structures are used in bfs and dfs algorithm?
