Question

Final Exam - Tuesday on-line. Available Tuesday 3/24/2020 from 4:00pm until 10:00pm with a 2 hour time limit.

W20 CIS D031 63Z Operating System Concept

Question 21 -30

Mutual exclusion, hold and wait, and no preemption

None of these, a deadlock can arise without any of these conditions

Mutual exclusion, hold and wait, no preemption and circular wait

Hold and wait, no preemption and circular wait

Mutual exclusion and no preemption

Question 22

Chp07 Lai Chi: Which of the following is FALSE regarding safe state, unsafe state and deadlock?

Group of answer choices

A system is in a safe state only if there exists a safe sequence

The operating system can avoid unsafe states as long as the state is safe

A state is safe if the system can allocate resources to each process (up to its maximum) in some order and still avoid a deadlock

A deadlocked state may not be an unsafe state

A safe state is not a deadlocked state

Question 23

Chp08 Heather: What is the technique that partitions memory into logically related data units ?:

Group of answer choices

Paging

segmetation

Swapping

Overlays

Compaction

Question 24

Chp08 Heather: Which one is incorrect about paging?:

Group of answer choices

Paging permits the physical address space of a process to be noncontiguous.

It divides physical memory into fixed-sized blocks called frames.

It divides logical memory into blocks of same size as frames called pages.

There's most likely internal fragmentation with paging.

none of these

Question 25

Chp08 Jeffery: Dynamic loading has better memory-space utilization because:

Group of answer choices

unused routine is waiting in memory and thus executes faster

unused routine is written in real-time by the programmer while the system waits

unused routine is loaded when program first loaded

unused routine is not loaded until referenced

unused routine runs pre-emptively so the results are created before the routine is called

Question 26

Chp08 Jeffery: This hardware device maps virtual memory addresses to physical memory addresses:

Group of answer choices

arithmetic logic unit (ALU)

instruction decode unit (IDU)

central processing unit (CPU)

random access memory (RAM)

memory management unit (MMU

Question 27

Chp09 Donghun: What is the page replace algorithm which replaces page with smallest count?

Group of answer choices

FIFO Algorithm

RR Algorithm

Clock Page-Replacement Algorithm

None of these

LRU Algorithm

Question 28

Chp09 Fabiane: In LRU page replacement algorithm, when a page must be replaced:

Group of answer choices

Newest page is chosen

Most used page is chosen

Random page is chosen

Oldest page is chosen

none of these

Question 29

Chp09 Fabiane: When a program tries to access a page that is mapped in address space but not loaded in physical memory, then:

Group of answer choices

Segmentation fault occurs

Fatal error occurs

No error occurs

Page fault occurs

Lazy swapper occurs

Question 30

Chp10 Danielle: What is the technique of splitting data across multiple devices?

Group of answer choices

Logical Formatting

Mirroring

Physical Formatting

Swap-space management

Data striping

Answer 1