10 MCQ For IBPS IT Officer Exam 2017

1)For the tree below, write the in-order traversal.
a)2, 7, 5, 6, 11, 2, 5, 4, 9
b)3, 5, 8, 9, 12, 5, 4, 6, 7
c)1, 3, 4, 7, 9, 13, 2, 4, 8
d)2, 4, 6, 8, 10, 12, 3, 5, 7
e)None of these

2)In previous question, the average access time will be
a)266 units
b)245 units
c)268 units
d)270 units
e)None of these

3)Consider the strings “PQRSTPQRS” and “PRATPBRQRPS”. What is the length of the longest common subsequence?
a)15
b)7
c)9
d)10
e)None of these

4)The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?
a)3
b)4
c)2
d)0
e)None of these

5)A text is made up of the characters a, b, c, d, e each occurring with the probability .12, .4, .15, .08 and .25 respectively. The optimal coding technique will have the average length of
a)2.15
b)1.15
c)3.25
d)5.25
e)None of these

6)The order of an algorithm that finds whether a given Boolean function of ‘n’ variables, produces a 1 is
a)Structure
b)Algorithm
c)Constant
d)Stack
e)None of these

7)Which of the following methods can be used to find the sum of digits of a number?
a)Recursion
b)Bubble sort
c)Iteration
d)Both recursion and iteration
e)None of these

8)What can be the maximum sum of digits for a 4 digit number?
a)36
b)9
c)16
d)4
e)None of these

9)The running time of an algorithm is given by
T(n) = T(n – 1) + T(n – 2) – T(n – 3), if n > 3
n, otherwise.
a)logn
b)nn
c)n
d)n2
e)None of these

10)Topological sort is equivalent to which of the traversals in trees?
a)Pre-order traversal
b)Heap
c)Merge sort
d)In-order traversal
e)None of these