0% found this document useful (0 votes)
17 views7 pages

F W - Quiz#4 Answers

Uploaded by

fwreh903
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views7 pages

F W - Quiz#4 Answers

Uploaded by

fwreh903
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Quiz#4

(Slide8 - Memory)

Name: Florence Wreh

1) Memory is organized in a _____ fashion

a) sequentiall

b) nonlinear

c) hierarchical

d) linear

2) Which type of memory is the fastest ___

a) DROM

b) SRAM

c) Cache

d) Register

3) Which kind of memory can help to provide more memory space ___

a. register

b. main memory
c. cache

d. virtual memory

4) Which kind of memory can speed up CPU performance ?

a. register

b. main memory

c. cache

d virtual

5) To access a particular piece of data, the CPU first sends a request to cache and then send a
request to ___

a) register

b) main memory

c) virtual memory

d) hard drive

6) The principle of locality tell us that once a byte is accessed, it is likely that a nearby data
element will be needed soon. The form of locality is/are:

a) temporal locality

b) spatial locality
c) sequential locality

d) all of the above

7) Cache can speed up accessing data because ___

a) content in cache cannot be changed

b) cache is content addressable

c) all data are stored in cache

d) cache address is directly mapped to main memory

8) EAT is a weighted average that takes into account the hit ratio and relative access times of
successive levels of memory. The EAT for a two-level memory is given by:

EAT = H ´ AccessC + (1-H) ´ AccessMM.

Where H is the cache hit rate and AccessC and AccessMM are the access times for cache and
main memory, respectively.

Consider a two-level memory system with a main memory access time of 200ns, supported by a
cache having a 20ns access time and a hit rate of 80%. Suppose access to cache and main
memory has no overlap, the EAT is

a) 56ns

b) 60ns

c) 200ns

d) 204ns
9) In what situation cache can cause performance degradation?

a) poor locality

b) dirty block in cache

c) cache size is too large

c) all of the above

10) The difference between unified cache and Harvard cache is ___

a) unified cache separates data and instruction

b) Harvard cache puts data and instruction together

c) unified cache puts data and instruction together

d) unified cache is better than Harvard cache

11) If you have three level caches, the lowest level cache should have ___

a) highest speed and largest size

b) lowest speed and largest size

c) highest speed and smallest size

d) lowest speed and smallest size

12) What is virtual address?

a) address in memory
b) physical memory address

c) address in hard disk

d) all of the above

13) When a page does not need immediately, it stored in ___

a) cache

b) main memory

c) virtual memory

d) all of the above

14) Which of the following may cause system fragmentation?

a) paging

b) segmentation

c) both a) and b)

d) none of the above

15) Virtual memory mapping is to ___

a) convert memory address to virtual address

b) convert virtual address to real memory address


c) convert memory address to cache address

d) convert virtual address to cache address

16) Instructions fall into several broad categories that you should be familiar with:

· Data movement. Load or Store

· Arithmetic. Add

· Boolean. And

· Control transfer, Jump

Give at least one MARIE instruction for each of the above category

17) Use postfix notation to write the infix expression: (a x b) - (c / d)

ab x cd / -

18) In byte ordering for big endian machines, the most significant byte is stored in
_____memory address.

a) low b) high

19). A system has 16 registers and 2M of memory.

a) how many bits are needed to access the registers?

4 bits since 2^4=16

b) how many bits needed for addressing memory?

21 bits since (2^(21)=2M

20). UNIX machine most likely use big-endian; while PC machine most likely use little
endian

You might also like