0 penilaian0% menganggap dokumen ini bermanfaat (0 suara)
52 tayangan2 halaman
539 R E. Vth Semester Computer Science Examination COMPUTER ORGANISATION Paper-CSE-303-C Time allowed: 3 hours Maximum Marks: 100 Attempt any five questions out of eight.
539 R E. Vth Semester Computer Science Examination COMPUTER ORGANISATION Paper-CSE-303-C Time allowed: 3 hours Maximum Marks: 100 Attempt any five questions out of eight.
Hak Cipta:
Attribution Non-Commercial (BY-NC)
Format Tersedia
Unduh sebagai PDF, TXT atau baca online dari Scribd
539 R E. Vth Semester Computer Science Examination COMPUTER ORGANISATION Paper-CSE-303-C Time allowed: 3 hours Maximum Marks: 100 Attempt any five questions out of eight.
Hak Cipta:
Attribution Non-Commercial (BY-NC)
Format Tersedia
Unduh sebagai PDF, TXT atau baca online dari Scribd
COMPUTER ORGANISATION Paper-CSE-303-C Time allowed: 3 hours Maximum Marks: 100
Note: Attempt any five questions out of eight.
1. (a) Draw a combinational circuit that accepts a 2 bit
number and generates an olp binary which is equal to square of i/p. 8 (b) Explain the conversion technique of 1.K. Flip flop to T-Flip flop. 6
(c) What is look ahead carry? Explain its significance. 6
2. (a) What are different arithmatic micro-operations,
when implemented in a serial computer. Assume that initially carry flip flop is clear. Use shift registers, flip flops and adders to implement the structures. 12
(b) What are the advantages of hard wired control than a
microprogrammed control unit? Contrast and compare the things. 8 3. (a) Explain all types of instructions. 1 (b) Explain interrupt cycle through a flow chart. 0 539-800-P-2-Q-8 (04) P.T.O. 1
0 (2) 6. 4. What is addressing mode? Explain any eight addressing mode using practic<).l data. Calculate the effective addresses in each mode. 20
5. Write a program to evaluate the following arithmatic
statement using:
(ii) Two address instructions (iii)
One address instructions [A * B / C + D]. E X = ------- + G 20 D*F+C+B E A 6. (a) Explain the algorithm for floating point addition. Draw its flow chart. 10 (b) Draw flow chart for fixed point multiplication. 10
7. Define the following terms. Also explain them: 2
0 (i) Types of interrupts (ii) Micro program sequencer (ili) Design of accumulator logic (iv) Bus and memory transfer.
8. (a) Discuss the advantages of interleaved memory 6 (b) How
do we read from associative memory. 6 (c) Explain, how data is accessed from virtual memory Draw its construction also. 8