Write T for true and F for false You will get 1 point for a

Write T for true and F for false. You will get +1 point for a correct answer, and -1 point for an incorrect answer. You may leave unanswered questions, for which you will get 0 point. Private member of a class X is visible to the member functions of class X and its derived classes, but not accessible from the outside of class X or its derived classes. Conceptual data type independent of programming language is called concrete data type. Insert and delete operation at arbitrary position of a growable array (vector) take O(n), where n is the number of stored elements. Insert and delete operation at arbitrary position of a linked list take O(n), where n is the number of stored elements. Assume that we can find the median element in O(n), where n is the number of stored elements. Then, the worst case complexity of quick sort algorithm is O(n log n). We can find the median element in O(n) for an array of floating point numbers by comparing them. Quick sort algorithm cannot be applied to linked list, because index based element access is not allowed in linked list. Linear list is a special case of a tree. In a tree, the number of node is always one more than the number of edges.

Solution

9)true,no of nodes=no of edges+1

8)false

7)true

6)true

5)true

4)true

3)false

2)true

1)true