0% found this document useful (0 votes)
154 views3 pages

Inverse Trigo Multiple

This document provides solutions to 7 questions about computer organization topics including instruction pipelining, cache and main memory, and secondary storage. The questions cover topics such as determining the number of stages in a pipelined CPU based on speedup and efficiency, calculating the number of sets in a cache based on its size and block size, converting binary to 2's complement decimal, identifying what component tracks instruction execution sequence, and calculating average access time and tag size based on cache specifications.

Uploaded by

kitana_sect
Copyright
© © All Rights Reserved
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
0% found this document useful (0 votes)
154 views3 pages

Inverse Trigo Multiple

This document provides solutions to 7 questions about computer organization topics including instruction pipelining, cache and main memory, and secondary storage. The questions cover topics such as determining the number of stages in a pipelined CPU based on speedup and efficiency, calculating the number of sets in a cache based on its size and block size, converting binary to 2's complement decimal, identifying what component tracks instruction execution sequence, and calculating average access time and tag size based on cache specifications.

Uploaded by

kitana_sect
Copyright
© © All Rights Reserved
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/ 3

COMPUTER ORGANIZATIONS

(Instruction Pipelining, Cache & Main Memory, Secondary Storage)

SOLUTIONS

1. A pipelined CPU has a speed up of 4.5 over non-pipelined CPU and has an efficiency of 90%.
How many stages are there?

(a) 5 (b) 4
(c) 6 (d) 3

Solution: Option (a)

Explanation:

90 45
[x] = 4.4 ⇒ x = =5
100 9

2. A 2 way set associative cache is 256 Kbytes in size. What is the number of sets if block size is
16 Bytes?

(a) 4096 (b) 8192


(c) 1024 (d) 16,384

Solution: Option (b)

Explanation:

256K 218 14
214
Number of Blocks = = 4 = 2 ; Number of sets = = 213 = 8192
16 2 2

3. The decimal integer value of 1101 1001 (in 2’s complement form) is

(a) – 39 (b) – 24
(c) – 57 (d) – 88

Solution: Option (a)

4. Which of the following keeps track of instruction execution sequence?

1
(a) Accumulator (b) Program Counter
(c) Stack Pointer (d) Instruction Register

Solution: Option (b)

Explanation:

PC stores the Address the Address of the next instruction.

5. Cache has the following specifications:

Number of sets = 128


2 way set Associative
Cache size = 4Kbytes
Main memory has 21 bit address

What are the sizes of the cache blocks and number of cache blocks respectively?

(a) 16 Bytes, 256 (b) 32 Bytes, 128


(c) 8 Bytes, 64 (d) 16 Bytes, 64

Solution: Option (a)

Explanation:

128 × 2 × x = 4k; (Block size)x = 16 Bytes

4k 212
Number of blocks = = 4 = 28 = 256 Blocks
16 2

6. A cache is having 60% hit ratio for read operation. Cache access time is 30 ns and main
memory access time is 100 ns, 50% operations are read operation.

What will be the average access time for read operation?

(a) 50 ns (b) 58 ns
(c) 100 ns (d) 70 ns

Solution: Option (d)

Explanation:

0.60 × 30 + 0.40 × 130 = 70ns

2
7. A CPU has 30 bit memory address and 512Kbyte cache organized into 8-way set associative
cache and block size is 32 Bytes.

What is the number of bits required in TAG for comparator matching?

(a) 16 (b) 11
(c) 17 (d) 14

Solution: Option (d)

Explanation:

A TAG = 14

You might also like