1. Which is a permanent database in the general model of compiler?

(1) Literal table

(2) Identifier table

(3) Terminal table

(4) Source table

(5) None of these

(2) Identifier table

(3) Terminal table

(4) Source table

(5) None of these

2. The master slave JK flip-flop is effectively a combination of ………….

(1) an SR flip-flop and a T flip-flop

(2) an SR flip-flop and a D flip-flop

(3) a T flip-flop and a D flip-flop

(4) two T flip-flops

(5) None of these

(2) an SR flip-flop and a D flip-flop

(3) a T flip-flop and a D flip-flop

(4) two T flip-flops

(5) None of these

3. Which of the following printers uses light beam and electrostatically sensitive black power?

(1) Daisy wheel printer

(2) Dot matrix printer

(3) Laser printer

(4) Chain printer

(5) None of these

(2) Dot matrix printer

(3) Laser printer

(4) Chain printer

(5) None of these

4. How many comparison are needed to sort an array of length 5 if a straight selection sort is used and array is already in the opposite order?

(1) 20

(2) 26

(3) 39

(4) 10

(5) 14

(2) 26

(3) 39

(4) 10

(5) 14

5. Back patching is useful for handeling……………

(1) Conditional jumps

(2) Unconditional jumps

(3) Backward references

(4) Forward references

(5) None of these

(2) Unconditional jumps

(3) Backward references

(4) Forward references

(5) None of these

6. Which of the following symbols table implementation is based on the property of locality of reference

(1) Hash table

(2) Search tree

(3) Self – organizing list

(4) Linear list

(5) None of these

(2) Search tree

(3) Self – organizing list

(4) Linear list

(5) None of these

7. What should be added so that a CMOS gate drives TTL at the same supply voltage?

(1) Pull up transistor

(2) Pull down transistor

(3) High value capacitor

(4) Buffer

(5) None of these

(2) Pull down transistor

(3) High value capacitor

(4) Buffer

(5) None of these

8. The RST 5.5 Interrupt service routine starts from location ……………

(1) 0020H

(2) 0024H

(3) 0028H

(4) 002CH

(5) 0145H

(2) 0024H

(3) 0028H

(4) 002CH

(5) 0145H

9. When n elements are to be sorted, then what is the worst case time complexity of Bubble sort?

(1) O(1)

(2) O(log

(3) O(n)

(4) O(n

(5) None of these

(2) O(log

_{2}n)(3) O(n)

(4) O(n

^{2})(5) None of these

10. Loop is a collection of nodes that …………..

(1) is strongly connected

(2) is loosely connected and has a unique entry

(3) is strongly connected and a unique entry

(4) All the above

(5) None of the above

(2) is loosely connected and has a unique entry

(3) is strongly connected and a unique entry

(4) All the above

(5) None of the above

Questions | Q1 | Q2 | Q3 | Q4 | Q5 | Q6 | Q7 | Q8 | Q9 | Q10 |

Answers | 3 | 1 | 3 | 1 | 4 | 3 | 2 | 4 | 4 | 3 |

Suggested Reading for your Best Preparation and Practice

- IBPS IT Officer Question Paper – Specialist Officer Recruitment Examination 2014
- IBPS IT Officer Question Bank : Specialist Officer Exam 2014
- IBPS CWE for Specialist Officer : IT Profession Knowledge
- IBPS IT Officer Papers
- IBPS IT Officer Model Papers
- IBPS IT Officer Previous Papers
- IBPS Specialist Officer IT
- IBPS IT Officer Model Question Paper
- IBPS IT Officer Exam
- IBPS Technical Officer