Nalanda Open University
Annual Examination 2016
Bachelor in Computer Application Part-II
Paper-XI (Introduction to Computer Organization)
Time: 3.00 Hrs. Full Marks: 80
Answer any five questions. All questions carry equal marks.
fdUgha ik¡p ç'uksa ds mÙkj nhft, A lHkh ç'uksa ds vad leku gSa A
1. Convert the following:
1165 to its BCD equivalent.
(334)8 to Decimal number.
467 to its Binary equivalent.
(1100110010)2 to Hexadecimal number.
2. Simplify the following Boolean function using Sum-of-Product form, by Karnaugh's map:
10, 13, 15). Also draw the circuit diagram for it.
3. Design a combinational circuit that accepts a 3 bit binary number and generates an output
binary number equal to 1 if the sum of input numbers are equal to in binary, otherwise the
output is 0.
4. Write a program in 8086 assembly language to generate the first five terms of the Fibonacci
sequence. Also draw an appropriate flow chart for your program.
5. Describe memory hierarchy in computers. Explain the main memory to-cache mapping using
a set associative scheme, with the help of an example.
6. "Counter is a register." Justify this statement. Draw and explain the working principles of a 4
bit ripple counter.
7. In some situation, multiple interrupts occur at the same time. Explain how one can deal with
these multiple interrupts. Give any two approaches.
8. Using four x multiplexers and four full adders, construct a 4 bit arithmetic circuit, with
the help of suitable tables, explain how this circuit can perform different arithmetical
operations.
9. What is bus arbitration? Explain the Daisy chaining and polling bus arbitration methods with
the help of a suitable diagram for each. Draw any two DMA configurations and explain the
advantages and disadvantages of these configurations.
10. What is the need of many addressing modes in a machine? Explain different types of addressing
modes with examples.