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 For a binary search tree with n-nodes, External Path Length = Internal Path Length +
log2n.
2.2 Implementation of priority queue using list is advantageous than that using array.
2.3 In a Circular linked list one can traverse the list backward.
2.4 For an ordered data set, partition exchange sort is better than bubble sort.
2.5 If the hash table is maintained in external storage on a disk, time is the critical factor for hashing.
2.6 Queues can be created by setting up an ordinary contiguous array to hold the items.
2.7 In an expression tree, leaves at the last level are either operands or operators.
2.8 Recursive algorithms always terminate without any condition.
2.9 In-fix expression can be converted to post-fix expression using a data structure called
stack.
2.10Automatic variables can be declared within any block and remain in existence until the
block is terminated.
