Data Structure

Q1. What is the application of quick sort?

Q2. In which of these, the memoization is used for?

Q3. It is not a criteria of algorithm.

Q4. What is the application of Binpackingproblem?

Q5. Which is procedure for step-by-step for calculations?

Q6. Which data structure allows deletions at the both ends of the list but insertions at only one end?

Q7. What do you mean by merge sort?

Q8. The data structure that allows deleting data elements from front and inserting at rear.

Q9. Visiting root node after visiting left and right sub-trees is called Post-order Traveral.

Q10. What is the application of merge sort?