1. prepare five basic characteristics of the algorithm.
2. What is the brute force approach? describe it with suitable ex.
3. What is an array of pointers?
4. prepare the function to copy one string into another.
5. What do you mean by polish notation?
6. What do you mean by row-major and column-major order?
7. prepare down the applications of binary trees.
8. How is binary search better than the linear search?
9. Draw the logical diagram of a doubly linked list.
10. What do you mean by self referential structures?