Data Structure

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

Q2. What is the application of Binpackingproblem?

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

Q4. It is not a criteria of algorithm.

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

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

Q7. What do you mean by merge sort?

Q8. What is the application of quick sort?

Q9. What is the application of merge sort?

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