July 17, 2021 in C and CPP
1.9 Which of the following expressions accesses the (i,j)^th entry of a m ´ n matrix stored in a column major form ?
A) m * ( i –1 ) + j
B) m * ( j –1 ) + i
C) m * ( n – j ) + i
D) m * ( m – i ) + jJuly 17, 2021 in C and CPP
1.8 Any string of bits of length n represents a unique non-negative integer between
A) 0 and 2^n-1 -1
B) 0 and 2^n-1
C) 1 and 2^n-1
D) none of the aboveJuly 17, 2021 in C and CPP
1.7. Given two sorted lists of size “m” and “n” respectively, the number of comparisons needed in the worst case by the merge sort will be:
A) m*n
B) max(m,n)
C) min(m.n)
D) m + n – 1July 17, 2021 in C and CPP
1.6. The smallest number of keys that will force a B-Tree of order 3 to have a height 3 is:
A) 12
B) 10
C) 7
D) none of the aboveJuly 17, 2021 in C and CPP
1.5. Number of nods in a complete binary tree of depth k is
A) 2k
B) 2k
C) 2k-1
D) none of the aboveJuly 17, 2021 in C and CPP
1.4. In linked list representation, a node contains at least
A) node address field, data field
B) node number, data field
C) next address field, information field
D) none of the aboveJuly 17, 2021 in C and CPP
1.3. The prefix expression for the infix expression a * ( b + c ) /e - f is
A) /* a + bc – ef
B) -/ * + abc ef
C) - / * a + bcef
D) none of the aboveJuly 17, 2021 in C and CPP
1.2. Time complexity of insertion sort algorithm in the best case is
A) O(n)
B) O(n log2 n)
C) O(n2)
D) none of the aboveJuly 17, 2021 in C and CPP
1.1. Adjacency matrix for a digraph is
A) Unit Matrix
B) Symmetric Matrix
C) Asymmetric matrix
D) none of the aboveJuly 17, 2021 in C and CPP
b) What are the different methods of handling overflow in hashing?
