Computer Organization MCA CBCS 1SEM
Computer Organization MCA CBCS 1SEM
Part-A (1 0 x 2 = 20 Marks)
1. Determine by means of truth table the validity ofDeMorgan's theorem for three variables
(ABC) 1 = A 1 + B 1 + C 1.
2. Draw 4-bit synchronous binary counter.
3. Explain about Three-State Bus Buffers.
4. Illustrate the need for Accumulator.
5. Define a) Microprogram b) Micro-operation.
6. "A computer is not just a calculator but also a symbol manipulator", Justify.
7. List any four addressing modes where effective address is obtained by computation.
8. Write the steps in division algorithm.
9. Compare isolated 1/0 and memory-mapped I/0.
10. Draw the memory hierarchy in a computer system.
12. a) Discuss the working of a 4-bit binary adder using a figure_ [4]
b) Write and explain the steps involved in an Interrupt Cycle, using flowchart. [6]
15. a) Write about associative mapping and direct mapping in cache memory [5]
b) Explain Daisy-Chaining Priority, using a figure. [5]
16. a) State the different types of flip-flops. Explain using truth tables. [5]
b) Explain Instruction cycle with the help of a Flow Chart. [5]