Data structure Questions-1

1. What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero)
2. Explain binary searching, Fibinocci search.
3. Explain quick sort and merge sort algorithms and derive the time-constraint relation for these. ?
4. What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion?
5. What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?
6. Write the programs for Linked List (Insertion and Deletion) operations
7. How would you sort a linked list?
8. Explain about the types of linked lists
9. Write programs for Bubble Sort, Quick sort
10. Write a Binary Search program
11. Stack can be described as a pointer. Explain.
12. How is it possible to insert different type of elements in stack?
13. Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1
14. Evaluate the following prefix expression " ++ 26 + - 1324"
15. What does abstract data type means?