Jobs By Abekus

Operating-systems Questions Set 51:

Quiz Mode

Consider a process that has frame number of 230 and page offset of 50. Find the physical address.

180

190

280

230

Solution:

Which scheduler performs the "swapping out" or "swapping in" of processes?

Long-term scheduling

Medium-term scheduling

Short-term scheduling

None of the above

Solution:

Which of the following CPU scheduling algorithms gives the minimum average waiting time?

Round Robin

Shortest Job First

First Come First Serve

None of the above

Solution:

Multimedia files stored on a remote server are delivered to a client across the network using a technique known as ___________

flowing

streaming

download

leaking

Solution:

Which page replacement algorithm suffers from Belady's Anomaly?

Optimal Replacement

Least Recently Used (LRU)

First-In-First-Out (FIFO)

Both Optimal Replacement and FIFO

Solution:

If the wait-for graph does not contain a cycle, then:

then a deadlock does not exist

then a deadlock exists

then the system is in a safe state

either deadlock exists or system is in a safe state

Solution:

What is a reusable resource?

that can be used by one process at a time and is not depleted by that use

that can be used by more than one process at a time

that can be shared between various threads

All of the above

Solution:

How does a CPU generally handle an interrupt?

As soon as an interrupt is raised

By checking the interrupt register after finishing the execution of the current instruction

By checking the interrupt register at fixed time intervals

By checking the interrupt register at the end of the fetch cycle

Solution:

Thread synchronization is required because threads of a process share the same global variables, address space, and files.

all threads of a process share the same global variables

all threads of a process share the same address space

all threads of a process can share the same files

All of the mentioned

Solution:

Assume a two-level inclusive cache hierarchy, L1 and L2, where L2 is the larger of the two. Consider the following statements.
S1 : Read misses in a write through L1 cache do not result in writebacks of dirty lines to the L2
S2 : Write allocate policy must be used in conjunction with write through allocate caches and no-write allocation policy is used with writeback caches.
Which of the following statements is correct?

S1 is true and S2 is false

S1 is false and S2 is true

S1 is true and S2 is true

S1 is false and S2 is false

Solution:

Scroll to Top

Company

About Us Our Values Mission Approach Abekus Family Careers Privacy Policy Terms & Conditions Cancellation & Refunds Job Guidelines Shipping and Exchanges

Product

Resume Builder Blog Jobs for Recruiters Abekus (Learning)AI Resume Analysis Bulk Resume Analyser

Get in touch

Social Network:

Operating-systems Questions Set 51:

Consider a process that has frame number of 230 and page offset of 50. Find the physical address.

Solution:

Which scheduler performs the "swapping out" or "swapping in" of processes?

Solution:

Which of the following CPU scheduling algorithms gives the minimum average waiting time?

Solution:

Multimedia files stored on a remote server are delivered to a client across the network using a technique known as ___________

Solution:

Which page replacement algorithm suffers from Belady's Anomaly?

Solution:

If the wait-for graph does not contain a cycle, then:

Solution:

What is a reusable resource?

Solution:

How does a CPU generally handle an interrupt?

Solution:

Thread synchronization is required because threads of a process share the same global variables, address space, and files.

Solution:

Solution:

Related Question Sets:

Related Topics: