Operating Systems Exam 2

Mutex locks and couting semaphores are essentially the same thing

One necessary condition for deadlock is _____, which states that a resource can be released only voluntarily by the process holding the resource.

In Peterson's solution, the ______ variable indicates if a process is ready to enter its critical section.

Mutex locks and binary semaphores are essentially the same thing.

The value of a counting semaphore can range only between 0 and 1.

An instruction that executes atomically _______.

A(n) _______ refers to where a process is accessing/updating shared data

A solution to the critical section problem does not have to satisfy which of the following requirements?

_____ scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU bursts.

The _____ occurs in first-come-first-served scheduling when a process with a long CPU burst occupies the CPU.

________ is the number of processes that are completed per time unit.

Which of the following scheduling algorithms must be nonpreemptive?

A significant problem with priority scheduling algorithms is _________.

In preemptive scheduling, the sections of code affected by interrupts must be guarded from simultaneous use.

In Little's formula, λ, represents the ____.

____ scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU bursts.

The most complex scheduling algorithm is the multilevel feedback-queue algorithm

Round-robin (RR) scheduling degenerates to first-come-first-served (FCFS) scheduling if the time quantum is too long.

In RR scheduling, the time quantum should be small with respect to the context-switch time.

A significant problem with priority scheduling algorithms is _____.

______ allows a thread to run on only one processor.

With _______ a thread executes on a processor until a long-latency event (i.e. A memory stall) occurs.

The mapping of a logical address to a physical address is done in hardware by the ________.

Consider a 32-bit address for a two-level paging system with an 8 KB page size. The outer page table has 1024 entries. How many bits are used to represent the second-level page table?

Assume a system has a TLB hit ratio of 90%. It requires 15 nanoseconds to access the TLB, and 85 nanoseconds to access main memory. What is the effective memory access time in nanoseconds for this system?

A relocation register is used to check for invalid memory addresses generated by a CPU.

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

Which of the following is true of compaction?

A(n) ____ page table has one page entry for each real page (or frame) of memory.

_____ is the method of binding instructions and data to memory performed by most general-purpose operating systems.

With segmentation, a logical address consists of _____.

Consider a logical address with a page size of 8 KB. How many bits must be used to represent the page offset in the logical address?

Assume the value of the base and limit registers are 1200 and 350 respectively. Which of the following addresses is legal?

Absolute code can be generated for ____.

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

What size segment will be allocated for a 39 KB request on a system using the Buddy system for kernel memory allocation?

Given the reference string of page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and a system with three page frames, what is the final configuration of the three frames after the true LRU algorithm is applied?

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 FIFO replacement algorithm, what will be the final configuration of the three frames following the execution of the given reference string?

The _____ allocation algorithm allocates available memory to each process according to its size.

The _____ is an approximation of a program's locality.

Belady's anomaly states that ____.

Which of the following statements is false with regard to allocating kernel memory?

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

The ____ is the number of entries in the TLB multiplied by the page size.

Optimal page replacement ____.