Operating Systems for Programmers - Module 3 - Pre-Quiz

Question 1

_____ is the algorithm implemented on most systems.

Accepted Answer

LRU

Answer

FIFO

Answer

Least frequently used

Answer

Most frequently used

Question 2

In systems that support virtual memory, ____.

Accepted Answer

physical memory is separated from logical memory

Answer

virtual memory is separated from logical memory

Answer

virtual memory is separated from physical memory

Answer

physical memory is separated from secondary storage

Question 3

An address generated by a CPU is referred to as a ____.

Accepted Answer

logical address

Answer

physical address

Answer

post relocation register address

Answer

memory management unit (MMU) generated address

Question 4

_____ is the dynamic storage allocation algorithm that results in the largest leftover hole in memory.

Accepted Answer

Worst-fit

Answer

First-fit

Answer

Best-fit

Answer

None of the above

Question 5

_____ occurs when a process spends more time paging than executing.

Accepted Answer

Thrashing

Answer

Memory mapping

Answer

Demand paging

Answer

Swapping

Question 6

Which of the following statements is true with respect to hashed page tables?

Accepted Answer

They are a common approach for handling address spaces larger than 32 bits.

Answer

They only work for sparse address spaces.

Answer

The virtual address is used to hash into the hash table.

Answer

Hash table collisions do not occur because of the importance of paging.

Question 7

Which of the following data structures is appropriate for placing into its own segment?

Accepted Answer

all of the above

Answer

heap

Answer

kernel code and data

Answer

user code and data

Question 8

Belady's anomaly states that ____.

Accepted Answer

for some page replacement algorithms, the page fault rate may increase as the number of allocated frames increases

Answer

giving more memory to a process will improve its performance

Answer

as the number of allocated frames increases, the page fault rate may decrease for all page replacement algorithms

Answer

for some page replacement algorithms, the page fault rate may decrease as the number of allocated frames increases

Question 9

Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are three frames within our system. Using the LRU replacement algorithm, what is the number of page faults for the given reference string?

Accepted Answer

8

Answer

14

Answer

13

Answer

10

Question 10

Systems in which memory access times vary significantly are known as __________.

Accepted Answer

non-uniform memory access

Answer

memory-mapped I/O

Answer

demand-paged memory

Answer

copy-on-write memory

Operating Systems for Programmers - Module 3 - Pre-Quiz

Información

Escríbenos

¿Qué te parece el nuevo diseño?