For a binary search tree with n-nodes, External Path Length = Internal Path Length + log2n.

July 17, 2021 in C and CPP

For a binary search tree with n-nodes, External Path Length = Internal Path Length + log2n.

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.

July 17, 2021 in C and CPP

A stack can be used to

1.10 A stack can be used to
A) allocate resources by the operating system
B) to schedule jobs on round-robin basis
C) process procedure call in a program
D) none of the above

July 17, 2021 in C and CPP

In an 16-bit computer, 30 digit integer can be stored in

1.9 In an 16-bit computer, 30 digit integer can be stored in
A) an integer variable
B) floating point variable
C) a circular list
D) none of the above

July 17, 2021 in C and CPP

Which of the following statements are true:

1.8 Which of the following statements are true:
A) binary search is always better than sequential search.
B) binary search is better than sequential search when number of elements is small.
C) binary search is better than sequential search when number of elements is very large.
D) binary search is always inferior to sequential search.

July 17, 2021 in C and CPP

To implement the problem which checks whether parentheses, braces and brackets are in proper position or not, stack has been used.

1.7 To implement the problem which checks whether parentheses, braces and brackets are in
proper position or not, stack has been used. If ((H)*{([J+K])}) is the expression, what will be the content of stack from bottom when input pointer is at J.
A) ({([
B) (( ){([
C) {([( )
D) ( )({([

July 17, 2021 in C and CPP

A forest is obtained from a tree when

1.6 A forest is obtained from a tree when
A) its children are removed
B) a sub-tree is removed
C) root of the tree is removed
D) none of the above

July 17, 2021 in C and CPP

Binary Search Tree is a

1.5 Binary Search Tree is a
A) tree whose right and left sub-tree has value less than root.
B) tree whose right and left sub-tree has value more than root.
C) tree whose left sub-tree has value less than root and right sub-tree has value more than
root.
D) none of the above.

July 17, 2021 in C and CPP

The property of hash function is that

1.4 The property of hash function is that
A) it minimizes the rate of overflow
B) it preserves the order of key values.
C) it minimizes number of collisions.
D) none of the above.

July 17, 2021 in C and CPP

An ordered set of items from which items may be deleted at either end and into which items may be inserted at either end is called.

1.3 An ordered set of items from which items may be deleted at either end and into which
items may be inserted at either end is called.
A) Queue
B) Stack
C) Heap
D) Dequeue

July 17, 2021 in C and CPP

If the records to be sorted are in auxiliary storage, sorting is called

1.2 If the records to be sorted are in auxiliary storage, sorting is called
A) Internal
B) External
C) Stable
D) None of the above