How To Exam?

a knowledge trading engine...


Kurukshetra University 2009-4th Sem B.Tech Computer Science and Engineering . - exam paper

Wednesday, 03 July 2013 01:10Web

Roll No. ....................... Total No. of pages: 2
BT-4/M09
Computer Architecture and Organization
Paper: CSE-202E
Time: 3 Hours] [Maximum Marks: 100

Note: - Attempt any 5 ques.. Selecting at lowest 1 ques. from every unit.


UNIT-1


1) A) discuss the Flynn’s classification of computers. 10.

B) explain I/O unit of a digital computer. discuss working of a laser printer. 10.


2) A) explain the advantages of Risc architecture over Cisc architecture. What is overlapping window?
10.
b) Differentiate fixed and variable kind instruction set format. 8.

UNIT-2


3) A) What is pipelining? How it improves the performance of computing? 10.

B) Differentiate hardwired and microprogrammed control unit. State advantages and disadvantages of every. 10.



4 a) discuss instruction cycle and its phases. 8.

b) explain the accumulator based CPU. Also discuss the design of accumulator. 12.

UNIT-3


5) A) elaborate various kinds of semiconductor memories? provide their merits, demerits and area of applications. 10.

b) discuss function of cache memory. describe the terms cache hit and cache miss. Also discuss the direct mapping used in cache. 10.



6) a) describe virtual memory. discuss logical and physical address. How logical address is mapped into physical address, explain? 12.

b) discuss swapping. Why it is used in memory management? 8.


UNIT-4



7 a) what is the advantage of interrupt driven I/O over programmed I/O? discuss daisy chain in detail.
10.

b)explain different kinds of instructions with examples. 10.


8 a) draw the flow chart of computer operation and discuss it in detail. 10.
B) write short notes on:
(i) DMA controller
(ii) Address sequencing. 2X5.



( 1 Vote )

Add comment


Security code
Refresh

Earning:   Approval pending.
You are here: PAPER Kurukshetra University 2009-4th Sem B.Tech Computer Science and Engineering . - exam paper