Each statement below is either TRUE or FALSE. Choose the most appropriate one
and ENTER in the “tear-off” sheet attached to the question paper, following
instructions therein.
2.1 The Structures cannot contain a pointer to itself.
2.2 A simple graph is connected if and only if it has a spanning tree.
2.3 Insertion of an element in an array requires shifting of some elements of the array by
one position.
2.4 Two sorted lists with m elements and n elements can be merged into a sorted list using
no more than m+n-1 comparisons.
2.5 The number of disk accesses required for most operations on a B tree is inversely
proportional to the height of the tree.
2.6 The time required to perform a sequence of data structure operations is averaged over
all the operations performed in an Amortized analysis.
2.7 All the terminal nodes are traversed in the same order from left to right in in-order,
preorder and post-order traversals of a binary tree.
2.8 A complete binary tree with n internal nodes has (n-1) leaves.
2.9 AVL trees, 2-3 trees and B trees permits searches, inserts, deletes in O(log n) time.
2.10 The in-degree of a vertex is the number of edges leaving it.
