What are data structures in programming?
- 0 Answers
- 707 Views
- I also Faced
- E-Mail Answers
Why might quick sort might be better than merge sort?
What is faster array or arraylist?
Can a stack be described as a pointer? Explain.
State the properties of a binary tree?
What is a hash index?
Are duplicates allowed in list?
Tell me about the different sorting techniques.
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
What is mean by merge sort?
Can you change size of array once created?
Does hashset allow duplicates?
What type of memory allocation is referred for Linked lists?
Windows 
