Heap sort is more efficient for small size of file.

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

2.1 Heap sort is more efficient for small size of file.
2.2 The space requirement for the quick sort method depends on the number of nested recursive calls or the size of the stack.
2.3 One of the major drawbacks of the B-Tree is the difficulty of traversing the keys sequentially.
2.4 Breadth-first search algorithm can only be used for undirected graph.
2.5 Any general tree can be converted to a binary tree.
2.6 The method of interpreting a bit pattern is called a data type.
2.7 “Linear probing” as a collection resolution technique in hashing usually leads to clustering of data.
2.8 ‘Insertion in’ and ‘deletion from’ an array does not involve physical movement of elements of the arrays.
2.9 It is advantageous to implement a stack using a doubly connected linked list instead of using a singly connected linked list.
2.10 Insertion of a new element in a priority queue always occurs at the rear of the queue,
irrespective of its priority.

Leave a Reply