1. Draw recursion tree of given recursion functions 2. AVL tree insertion and deletion for given sequence of numbers 3. Binary heap insertion and deletion for given sequence of numbers 4. Binomial tree and heap: draw binomial tree of given degree, draw binomial heap of given number of nodes. 5. Do DFS and BFS for a given graph 6. Find MST, SPT, shortest path for given weighted graph 7. Formula of statistics summary of the given data sets. 1. Draw recursion tree of given recursion functions 2. AVL tree insertion and deletion for given sequence of numbers 3. Binary heap insertion and deletion for given sequence of numbers 4. Binomial tree and heap: draw binomial tree of given degree, draw binomial heap of given number of nodes. 5. Do DFS and BFS for a given graph 6. Find MST, SPT, shortest path for given weighted graph 7. Formula of statistics summary of the given data sets