Nothing Special   »   [go: up one dir, main page]

821 Computer Architecture Sep Oct 2022

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

I lllillll lllll ilt iltil flilt ilil llIl NP - 166

ll Semester B.C.A. Examinatiin, September/Octob er 2022


(NEP) eA21 -22and Onwards)
COMPUTER SCIENCE
2.1 : Computer Architecture

Time : 272 Hours Max. Marks : 60

lnstruction : Answer any four questians from each Section.

SECTION _ A

l. Answer any four questions. Each question carries 2 marks. (4x2=$)

1) Convert 673,0 to binary.


2) Write the logic symbol, expression and truth table of NAND gate.

3) State Demorgan's theorem.


4) Define opcode and operand.

5) Write BSA instruction.

6) Define virtual memory. er-il-,

SECTION _ B

lt. Answer any four questions. Each question carries 5 marks. (4x5=20)

7) Simplify F(A,*,B, C, D) = fm(0, 1, 2, 4, 5,7, 8, g, 10, 11, 12, 13) and draw
a circuit diagram.

8) Define full adder, draw the truth table and logic diagram for the same.

9) Explain memory reference instructions.

10) Explain the addressing modes.


1 1) Explain interrupt cycle with suitable example.
12) Explain Cache memory.
P.T.O.
NP - 166 IrlllililIlililttiiltilIllffiilfi

SECTION _ C

lll. Answer any four questions. Each question carries I marks. (4x8=32)
13) a) Differentiate between von Neumann and Harvard architecture. 4
b) Explain the working of J.K. flip flop with truth table. 4
14) a) Explain I to 3 encoder. 4
b) Explain 4 bit shift register. 4
15) Explain comrnon bus organization of basic computer with neat diagram. 8
16) Explain data manipulation instructions. I
17) Explain isolated versus memory mappeei iiO. I
1B) Explain DIUA with its block diagram and explain its working. I

'i!
iiitt

*.1

You might also like