1. ... is very uselul in situations when diata have to be stored asd the retrieve in the reverse order (a) Stack (b) Quieue (c) Link hist (d) Array 2. Insering an item into the stack, when stack is not cmpty is callod operation and deletion of item from stack is not enupty is called (3) Push, pop (b) Rop, push (c) Insert delcte (d) Delete, insert 3. Which or the following isa nomlinear data structur (i) Stack (b) Eist (c) String (d) Tress +. The simplest typo of datu structures is (a) Muhi- dimersional array (brtincar array (c) Two-dimensional array (d) threc-dimensional array 5. ininc... is a pile in which items ane added af one eod and remo irm the other (a) Stack (b) Queue (d) Keys 16. Each node in a graph data structure is tepresented by a?" (a) Edge (b) Adjacent (c) Path (d) Vertex 17. Which of the following atgerithm is quite effective for lurge size data sets (a) Quick sart (b) Selection sort (c) Bubble sart (d) Insertion sort 18. The technique that converts a range of key values into a range of indexes of an arriy is called? (a) Algorithm (b) Hashing (c) Soring (d) Selection 19. All the following are characteristics of data structures except (a) Correctness (b) Time complexity (c) Entity set (d) Space complexity 20. The complexity of an algonthm is dependent on and (a) Input and output (b) Theta and omega notations (c) Black box and white box testing (d) Time factor and space factor 2. (a) What is asymptotic analysis? (b) Explain the following termis in data struetures: i. Time complexily if Worse case iii. Average case iv. Space complexity 3. (a) What is Traversal (2. M.AKS) (b) What is binary search tree (2.MARKS) (c) Explain how the elements in the tree can be traverse in the followin methods i) In-order Imenal ii) Pre-order Iraversil iii) Post-order Traversal 4. (a) Explain the following i. Big O Notation ii. Omega Natation iii. Theta Notation (9 MARKS) (b) State two problems that can be solved using data structures (1 MARK) 5. (a) Explain the following terms i) Greedy algorithm ii) Divide and conquer iii) Dynamic programming (9 MARKS) (b) State two problems that current technology applications faces? (I MARK) SECHON B (40 MARKS) WSWER QUESTION ONE (1) AND ANY OTHER TWO (2) (a) What is data structures (2. MARES) (b) Ait arithunetic expression can be written in three diffenent bet chuivalent notations, Copy and complete the table befow sorted using the following. i. Bubble sort ii. Selection sort iii. Insertion sor (d) What is Depth First Search algorithm and show how the follongat at will be stored in-stack bs.