B.C.A Computer Application 1st Sem BASIC COMPUTER STSTEM ARCHITECTUREAND DESIGN Alagappa University, Karaikudi question paper

University question paper, B.C.A Computer Application 1st Sem BASIC COMPUTER STSTEM ARCHITECTUREAND DESIGN Alagappa University, Karaikudi

B.Sc./B.C.A. DEGREE EXAMINATION, APRIL 2011
Computer Science/ Computer Applications/I.T/Software
BASIC COMPUTER STSTEM ARCHITECTUREAND DESIGN
(Non-CBCS—2004 onwards)
[Common for Computer Science/ ComputerApplications/ I.T/ Software]
Time : 3 Hours Maximum : 100 Marks
Part A (10 × 1 = 10)
Answer all questions.
1. A control function is a ———— variable.
2. The output generated by the compilier is called the ———— program.
3. The signed – 1‘s complements of – 14 is ———— if a word is 8 bits.
4. A sequence of microinstruction constitutes a ————
5. An item that is delected from stack is called ———— operation.
6. Expand RISC.
7. What is effective address ?
8. Define Strobe.
9. Define Address space.
10. What is meant by logical address ?
Part B (5 × 6 = 30)
Answer any five questions.
11. Briefly explain the complement and its types.
12. Explain defferent kinds of computer instructions formats.
13. Explain control memory.
14. Explain Instruction pipeline.
15. Explain priority Interrupt briefly.
16. Explian the concept of page Replacement.
17. Write a not on Cache coherence.
Part C (5 × 12 = 60)
Answer any five questions.
18. Explain timing and control in detail.
19. Discuss Basic Computer Registers. With a diagram.
20. Explain microinstruction format with a neat diagram
21. Explain pipeline processing with an example.
22. Discuss Asynchronous serial transfer in detail.
23. Explain DMA controller with a neat diagram.
24. Describe the organization of associative memory with a neat diagram.
25. Explain Direct mapping process in Cache memory 

Share This