Interested to Buy Any Domain ? << Click Here >> for more details...
What is a Stack? Explain with example?
- 0 Answers
- 902 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
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
How do you assign an address to an element of a pointer array ?
What are the advantage of collection classes over arrays?
Tell us the difference between merge and quick sort. Which one would you prefer and why?
0 Answers Agilent, ZS Associates,
What is a minimum spanning tree?
Define linked list data structure.
In what scenario, binary search can be used?
Differentiate between list and map.
Why is merge sort faster?
List the area of applications where stack data structure can be used?
What is an example of an algorithm?
How do you find the complexity of a bubble sort?
Windows 
