BIT 121 DATA STRUCTURES AND ALGORITHMS
BIT 121 DATA STRUCTURES AND ALGORITHMS QUESTION ONE a) Define an algorithm and explain different criteria that satisfy the algorithm? (3 marks) b) i. What is a binary search tree? How is it different from a binary tree? (2 marks) ii. Write an algorithm for the preorder traversal of a tree. (2 marks) c) Differentiate between Data Structure, Primitive Data type and abstract DataType (ADTs) (3marks) d) Explain the concept of memory leak and stack overflow as used in the study of data structures. (2 marks) e) Algorithm analysis is the study of an algorithm’s efficiency with respect to resource utilization. What are these resources? (2 marks) f) You are given an array elements of size n=100 of time complexity of f(n). Suppose you are to search for a given value using sequential search strategy explain the condition that...