Thread-specific data is data that is not associated with any process. has been m

Question

Thread-specific data is data that

is not associated with any process.

has been modified by the thread but not yet updated to the parent process.

is generated by the thread independent of the thread's process.

is copied and not shared with the parent process.

2 points

QUESTION 13

Which of the following is NOT a property of an operating system?

almost always requires other programs to interface with hardware

serves as an intermediary between the user and the machine hardware

designed in some cases for efficiency

designed in some cases for user convenience

2 points

QUESTION 14

Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1. Suppose that there are also three frames within our system (empty in the beginning). Using the FIFO replacement algorithm, what will be the final configuration of the three frames following the execution of the given reference string?

4, 1, 2

3, 1, 2

4, 2, 1

1, 2 ,3

2 points

QUESTION 15

Given the following processes, priorities, and burst times, what will be the average wait time using a simple priority-based scheduler?

Process            Bust Time        Priority

P1                    10                    3

P2                    9                      1

P3                    20                    4

P4                    2                      5

P5                    3                      2

15

14

17

10

2 points

QUESTION 16

What is the average waiting time using the SJF scheduling algorithm given that process one through three have burst times of twenty, fifteen, and thirty-five milliseconds respectively?

10 ms

16.7 ms

20 ms

13.3 ms

2 points

QUESTION 17

The following code, using semaphores, will result in what kind of problem

mutex.acquire

criticalSection();

mutex.acquire();

mutual exclusion violation

deadlock

livelock

no problem will result in most cases

2 points

QUESTION 18

Which of the following statements is true?

A safe state is a deadlocked state.

An unsafe state may lead to a deadlocked state.

An unsafe state is necessarily, and by definition, always a deadlocked state.

A safe state may lead to a deadlocked state.

2 points

QUESTION 19

Which of the following is NOT a way in which the binding of instructions and data to memory addresses is typically performed?

execution time binding

load time binding

compile time binding

interrupt binding

2 points

QUESTION 20

The free-space list can be implemented using a bit vector approach. Which of the following is a drawback of this technique?

The technique is more complicated than most other techniques.

To traverse the list, each block must be read on the disk

This technique is not feasible for small disks.

It is not feasible to keep the entire list in main memory for large disks.

is not associated with any process.

has been modified by the thread but not yet updated to the parent process.

is generated by the thread independent of the thread's process.

is copied and not shared with the parent process.

Explanation / Answer

is copied and not shared with the parent process.

13. almost always requires other programs to interface with hardware

14, 4, 2, 1

15. 10

16. 13.3

17. deadlock

18. An unsafe state may lead to a deadlocked state.

19.interrupt binding

20. It is not feasible to keep the entire list in main memory for large disks.

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.