10 MCQ For IBPS IT Officer Exam 2017

1)A list integers is read in, one at a time, and a binary search tree is constructed. Next the tree is traversed would result in a printout which duplicates the original order of the list of integers?
a)Pre – order
b)Post – order
c)In – order
d)All of these
e)None of these

2)Which of the following need not to be a binary tree ?
a)Tree
b)B –Tree
c)AVL – Tree
d)Search Tree
e)None of these

3)Which data structure can be used suitably to solve the Tower of Hanoi problem?
a)Stack
b)Queue
c)Heap
d)Binary
e)None of these

4)Which of the following bitwise operations will you use to set a particular bit to 1?
a)AND
b)OR
c)NOR
d)XOR
e)None of these

5)Which of the following can never be sent by call-by-value?
a)Array
b)Variable
c)Reference
d)Structures
e)None of these

6)Relational operators cannot be used on:
a)Float
b)Char
c)Structure
d)Integer
e)None of these

7)Which of the following bitwise operations will you use to toggle a particular bit?
a)OR
b)NOR
c)NAND
d)XOR
e)None of these

8)Which of the following bitwise operations will you use to set a particular bit to 0?
a)AND
b)NAND
c)NOT
d)XOR
e)None of these

9)Which among the following is odd one out?
a)printf
b)scanf
c)putchar
d)fprintf
e)None of these

10)Which class in Java can be used to represent bit array?
a)Stream
b)Array
c)Vector
d)BitSet
e)None of these

 

Answers:
1)e
2)b
3)a
4)b
5)a
6)c
7)d
8)a
9)b
10)d