Operating System Practice Test 3

Question 1 of 20

1. With paging there is no ________ fragmentation.

internal

external

either type of

none of the mentioned

Question 1 of 20

Question 2 of 20

2. All unsafe states are ____________

none of the mentioned

fatal

deadlocks

not deadlocks

Question 2 of 20

Question 3 of 20

3. External fragmentation exists when?

a request cannot be satisfied even when the total memory is free

the total memory is insufficient to satisfy a request

none of the mentioned

enough total memory exists to satisfy a request but it is not contiguous

Question 3 of 20

Question 4 of 20

4. The base register is also known as the ____________

basic register

delocation register

regular register

relocation register

Question 4 of 20

Question 5 of 20

5. The size of a process is limited to the size of ____________

none of the mentioned

external storage

physical memory

secondary storage

Question 5 of 20

Question 6 of 20

6. Swapping requires a _________

keyboard

monitor

backing store

motherboard

Question 6 of 20

Question 7 of 20

7. Binding of instructions and data to memory addresses can be done at ____________

Compile time

Load time

Execution time

All of the mentioned

Question 7 of 20

Question 8 of 20

8. A state is safe, if ____________

all of the mentioned

the system does not crash due to deadlock occurrence

the system can allocate resources to each process in some order and still avoid a deadlock

the state keeps the system protected and safe

Question 8 of 20

Question 9 of 20

9. The idea of overlays is to ____________

enable a process to be larger than the amount of memory allocated to it

keep in memory only those instructions

all of the mentioned

data that are needed at any given time

Question 9 of 20

Question 10 of 20

10. The run time mapping from virtual to physical addresses is done by a hardware device called the ____________

Virtual to physical mapper

None of the mentioned

Memory mapping unit

Memory management unit

Question 10 of 20

Question 11 of 20

11. If no cycle exists in the resource allocation graph ____________

then the system will not be in a safe state

none of the mentioned

all of the mentioned

then the system will be in a safe state

Question 11 of 20

Question 12 of 20

12. Paging increases the ______ time.

waiting

context - switch

execution

all of the mentioned

Question 12 of 20

Question 13 of 20

13. Those processes should be aborted on occurrence of a deadlock, the termination of which?

incurs minimum cost

all of the mentioned

safety is not hampered

is more time consuming

Question 13 of 20

Question 14 of 20

14. Another solution to the problem of external fragmentation problem is to ____________

permit smaller processes to be allocated memory at last

permit the logical address space of a process to be noncontiguous

permit larger processes to be allocated memory at last

all of the mentioned

Question 14 of 20

Question 15 of 20

15. Swapping _______ be done when a process has pending I/O, or has to execute I/O operations only into operating system buffers.

must

can

must never

maybe

Question 15 of 20

Question 16 of 20

16. Smaller page tables are implemented as a set of _______

registers

queues

stacks

counters

Question 16 of 20

Question 17 of 20

17. Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called?

paging

none of the mentioned

fragmentation

mapping

Question 17 of 20

Question 18 of 20

18. Program always deals with ____________

relative address

physical address

absolute address

logical address

Question 18 of 20

Question 19 of 20

19. The first fit, best fit and worst fit are strategies to select a ______

all of the mentioned

processor to run the next process

process from a queue to put in memory

free hole from a set of available holes

Question 19 of 20

Question 20 of 20

20. In contiguous memory allocation ____________

each process is contained in a single contiguous section of memory

the memory space is contiguous

none of the mentioned

all processes are contained in a single contiguous section of memory

Question 20 of 20

« Prev - Operating System Practice Test 2

» Next - Operating System Practice Test 4