Data Structure

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

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

Q3. What do you mean by merge sort?

Q4. What is the application of merge sort?

Q5. It is not a criteria of algorithm.

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

Q7. What is the application of Binpackingproblem?

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

Q9. What is the application of quick sort?

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