Computer System Architecture,Question Paper of BCA (D) 4th Semester, Download Previous Years Question Paper 1

Roll no ……..
Total No. of Questions : 13]

PAPER ID 2037

BCA (Semester -4th)

COMPUTER SYSTEM ARCHITECTURE

BCA-403

Time :3 Hours

Instruction to Candidates:

1.     Section – A is compulsory.

2.     Attempt any Nine questions from section- B

Section –A

1.      

a.     Define the term operation code.

b.     What information is there in INPR and OUTR?

c.      Differentiate LDA and STA instruction

d.     What is the task of ALU

e.      What is stack pointer?

f.       Convert (3*4)+(5*6) into reverse polish notation.

g.     What are the one address instruction ?

h.     What is the task of LOAD instruction ?

i.       What is asynchronous data transfer?

j.       Differentiate main memory and secondary memory.

k.     What is swapping ?

l.       Define content addressable memory.

m.  Write short note on dynamic loading.

n.     Differentiate external and internal fragmentation.

o.     What the difference between sequential access and direct access?

Section –B

2.     Explain the demonstration of direct and indirect addressing by taking examples .

3.     Explain the difference between hardwired control and micro programmed control.

4.     Explain memory reference instructions in  detail.

5.     What are the difference between register stack and memory stack?   

6.     Explain all types of addressing modes?

7.     Explain the bus architecture in input output interface.

8.     Describe four possible devices that produce an acceptable output for person to understand.

9.     Explain the  difference between programmed I/O and interrupt initiated I/O.

10.                        Explain  DMA and  why does  DMA have priority over the CPU when both request memory transfer.

11.                        Explain RAM chip with the block diagram.

12.                         What is booting and what function are done by boot strap loader.

13.                        Explain different page replacement algorithms.