Scribd
Upload
45 views2 pages

Computer Architecture Organisation

This document contains questions about various topics in computer architecture and organization: (1) It asks to describe De Morgan's laws, differentiate between SISD and MIMD architectures, logical and arithmetic shift operations, and primary and secondary storage. It also defines seek time, rotational delay, access time, locality of reference, cache hit, cache miss, and hit ratio. (2) It asks about advantages of pipelining and zero-address instruction format. Design of half adder and S-R flip flop. Definition of MIPS and MFLOPS. (3) Drawing logic gates from NAND gates. Performance metrics. Flynn's classification of computer architectures. Examples of arithmetic

Uploaded by

soc11559
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
45 views2 pages

Computer Architecture Organisation

This document contains questions about various topics in computer architecture and organization: (1) It asks to describe De Morgan's laws, differentiate between SISD and MIMD architectures, logical and arithmetic shift operations, and primary and secondary storage. It also defines seek time, rotational delay, access time, locality of reference, cache hit, cache miss, and hit ratio. (2) It asks about advantages of pipelining and zero-address instruction format. Design of half adder and S-R flip flop. Definition of MIPS and MFLOPS. (3) Drawing logic gates from NAND gates. Performance metrics. Flynn's classification of computer architectures. Examples of arithmetic

Uploaded by

soc11559
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

(i)

COMPUTER ARCHITECTURE & ORGANISATION

Q1. (a) Describe DeMorgan law. (b) Differentiate between SISD, MIMD architecture. (c) Differentiate between logical shift and arithmetic shift operation. (d) Compare primary and secondary types. (e) Define the terms:-Seek Time, Rotational Delay, Access Time. (f) Define the terms:- locality of reference, cache hit, cache miss, hit ratio. (g) Explain advantages of using pipelining. (h) Explain zero-address instruction format. Q2. (a) Design and explain the following: (i) Half adder (ii) S-R flip flop (b) Explain MIPS and MFLOPS. Q3. (a) Draw all logic gates from NAND gate. (b) Write note on performance metrics. (c) Explain the Flynns classification of computer system architecture. Q4.(a) Explain any 5 arithmetic and 5 shift instructions. (b) Compare RISC architecture with CISC architecture. Q5. Explain various addressing modes by giving suitable example for each mode. Q6. (a) A digital computer has a memory unit of 64K*16 and a cache memory of 1K words. (i) How many blocks can be Cache accommodate? (ii) How many bits are there in the tag, index, block and words field of the address format? (iii) How many bits are there in each word of cache and how they are divided into functions?

(b) Explain Memory Hierarchy. Q7. (a) What is the advantage of set-associative mapping over direct mapping? State the difference between a cache line and a cache block? (b)What are the different types of semiconductor memories? Give their merits and demerits. Q8. (a) A non-pipeleine system takes 50 ns to process a task. The same task can be processed in a 6 segment pipeline with a clock cycle of 10ns. Determine the speedup ratio of the pipeline for 100 tasks. What is tye maximum speed that can be achieved? (b) Compare instruction level parallelism with processor level parallelism. Q9. Write short note on: (i) Accumulator Logic (ii) Various types of interrupts (iii) Different micro-instruction formats.

You might also like