Jobs By Abekus

Operating-systems Questions Set 50:

Quiz Mode

The address generated by the CPU is referred to as:

Logical address

Physical address

Physical as well as logical address

None of these

Solution:

Which CPU scheduling policy is well-suited for a time-shared operating system?

Shortest job first

Round robin

First-come, first-served

None of the above

Solution:

Consider a system with byte-addressable memory, 32 bit logical addresses, 4 kilobyte page size and page table entries of 4 bytes each. The size of the page table in the system in megabytes is

Solution:

A processor has 40 distinct instructions and 24 general purpose registers. A 32-bit instruction word has an opcode, two register operands and an immediate operand. The number of bits available for the immediate operand field is

Solution:

The LRU (Least Recently Used) page replacement algorithm associates with each page the time of that page's last use.

page after and before it

time it was brought into memory

all of the mentioned

the time of that page's last use

Solution:

Consider the following code fragment:

`if (fork() == 0) { a = a + 5; printf("%d, %p", a, &a); } else`

`{ a = a - 5; printf("%d, %p", a, &a); }`

u = x + 10 and v = y

u = x + 10 and v != y

u + 10 = x and v = y

u + 10 = x and v != y

Solution:

Assume that for a certain processor, a read request takes 50 nanoseconds on a cache miss and 5 nanoseconds on a cache hit. Suppose while running a program, it was observed that 80% of the processor’s read requests result in a cache hit. The average read access time in nanoseconds is____________

Solution:

Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63, moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing these requests is:

Solution:

Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is given: 45, 20, 90, 10, 50, 60, 80, 25, 70. Assume that the initial position of the R/W head is on track 50. The additional distance that will be traversed by the R/W head when the Shortest Seek Time First (SSTF) algorithm is used compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves towards 100 when it starts execution) is _________ tracks

Solution:

Which of the following statements about synchronous and asynchronous I/O is NOT true?

An ISR is invoked on completion of I/O in synchronous I/O but not in asynchronous I/O

In both synchronous and asynchronous I/O, an ISR (Interrupt Service Routine) is invoked after completion of the I/O

A process making a synchronous I/O call waits until I/O is complete, but a process making an asynchronous I/O call does not wait for completion of the I/O

In the case of synchronous I/O, the process waiting for the completion of I/O is woken up by the ISR that is invoked after the completion of I/O

Operating-systems Questions Set 50:

The address generated by the CPU is referred to as:

Solution:

Which CPU scheduling policy is well-suited for a time-shared operating system?

Solution:

Consider a system with byte-addressable memory, 32 bit logical addresses, 4 kilobyte page size and page table entries of 4 bytes each. The size of the page table in the system in megabytes is

Solution:

A processor has 40 distinct instructions and 24 general purpose registers. A 32-bit instruction word has an opcode, two register operands and an immediate operand. The number of bits available for the immediate operand field is

Solution:

The LRU (Least Recently Used) page replacement algorithm associates with each page the time of that page's last use.

Solution:

Consider the following code fragment:

`if (fork() == 0) { a = a + 5; printf("%d, %p", a, &a); } else`

`{ a = a - 5; printf("%d, %p", a, &a); }`

Solution:

Assume that for a certain processor, a read request takes 50 nanoseconds on a cache miss and 5 nanoseconds on a cache hit. Suppose while running a program, it was observed that 80% of the processor’s read requests result in a cache hit. The average read access time in nanoseconds is____________

Solution:

Solution:

Solution:

Which of the following statements about synchronous and asynchronous I/O is NOT true?

Solution:

Related Question Sets:

Related Topics:

Operating-systems Questions Set 50:

The address generated by the CPU is referred to as:

Solution:

Which CPU scheduling policy is well-suited for a time-shared operating system?

Solution:

Consider a system with byte-addressable memory, 32 bit logical addresses, 4 kilobyte page size and page table entries of 4 bytes each. The size of the page table in the system in megabytes is

Solution:

A processor has 40 distinct instructions and 24 general purpose registers. A 32-bit instruction word has an opcode, two register operands and an immediate operand. The number of bits available for the immediate operand field is

Solution:

The LRU (Least Recently Used) page replacement algorithm associates with each page the time of that page's last use.

Solution:

Consider the following code fragment: if (fork() == 0) { a = a + 5; printf("%d, %p", a, &a); } else { a = a - 5; printf("%d, %p", a, &a); }

Solution:

Assume that for a certain processor, a read request takes 50 nanoseconds on a cache miss and 5 nanoseconds on a cache hit. Suppose while running a program, it was observed that 80% of the processor’s read requests result in a cache hit. The average read access time in nanoseconds is____________

Solution:

Solution:

Solution:

Which of the following statements about synchronous and asynchronous I/O is NOT true?

Solution:

Related Question Sets:

Related Topics:

Consider the following code fragment:

`if (fork() == 0) { a = a + 5; printf("%d, %p", a, &a); } else`

`{ a = a - 5; printf("%d, %p", a, &a); }`