1) prepare the comparisons between the Array and the linked list.
2) describe two applications of the linear data structures.
3) describe the term BST.
4) describe the directed and un-directed graph?
5) The time complexity for the binary search is O ( logn). describe and justify this statement.
6) What do you understand by the bubble sort; also specify its time complexity.
7) describe the divide and conquer method?
8) Describe the greedy algorithm with the help of an ex.
9) describe what is meant by the knapsack problem?
10) describe some of the constraints of the 8-queens problem?