Choose the correct Answer

6) A mathematical- model with a collection of operations defined on that model is called a. Data structure b. Abstract Data Type c. Primitive Data Type d. Algorithm 7) Input instance for which algorithm take minimum possible time is called a. Worst case b. Best case c. Average case d. Null case 8) The implementation of the data type as a data structure is a. its physical form. b. its logical form. c. Its ADT. d. Its realization of a data type 9) A precondition is a statement giving the condition that is required to a. be true when a function is called. b. be true when a function call is completo c. be fajse when a function is called. d. be done when function is run. 10) A singly linked list facilitates list traversal in a. Single direction d. All b. Any direction c. Circular direction 11) An algorithm must be generic enough to solve all problems of a particular class a. Finiteness b. Definiteness c. Generality d. Effectiveness 12) is considered a non-homogeneous data structure a. Array b. Queue. c. Structure d. String. 13) Which of the following is two way list? a. dynamic linked list. b. circular header list c. linked list with head and trail pointers. d. none of above 14) The maximum number of nodes on level i of a binary tree is a. 21 b. 2^1+1 c. 1+1 d. 241+2 15) Consider the following tree 6 IV 4 12 7 1 5 10 30 11 If this tree is used for sorting, then a new number 8 should be placed as the a. Left child of the node labeled 30 b. Right child of the node labeled 5 c. Right child of the node labeled 30 d. Left child of the node labeled 10