Answer the following questions.
Question 1) Explain in detail the primitive data structures.
Question 2) What are the demerits of a linear stack?
Question 3) Write down the applications of linked lists.
Question 4) What are the procedure for binary tree representation?
Question 5) Write the algorithm for Merge sort.
Question 6) Write down the advantages of binary search over sequential search?
Question 7) Convert the following from infix expression to post-fix and pre-fix expression.
(A – B) + (C * (D – E)) / (E + F)
Question 8) What are the operations performed in a stack? Describe in detail .
Question 9) Describe in detail about binary tree representation.
Question 10) Explain Quick sorts with suitable example.
Question 11) Describe search techniques with example.