Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Multiple choice questions In which state does a process reside if it is not currenlty resident in main memory? A) Blocked B) Suspended C) Running

Multiple choice questions

In which state does a process reside if it is not currenlty resident in main memory?

A) Blocked

B) Suspended

C) Running

D) New

image text in transcribed

image text in transcribed

image text in transcribed

image text in transcribedimage text in transcribed

(Dont have to answer this as I do not have the select boxes)

image text in transcribed

image text in transcribed

image text in transcribed

image text in transcribedimage text in transcribed

image text in transcribed

image text in transcribedimage text in transcribed

image text in transcribed

D Question 3 2 pts To which state does the currently executing process return when it is interrupted by the operating system? Ready Running O Suspended O Blocked New As Question 4 2 pts To which state does a process move when the CPU scheduling algorithm determines it may next use the CPU? Ready O New O Blocked Suspended Running D Question 5 2 pts Which of the following shares CPU time among multiple processes to create the illusion that each user has a dedicated machine? Memory Management Process Management O Multiprogramming Timesharing CPU Scheduling Question 6 2 pts Which of the following is a technique for keeping more than one process in memory at the same time? CPU Scheduling Timesharing o Multiprogramming O Memory Management Process Management Question 7 2 pts Which of the following describes a memory management technique in which a program is divided into fixed sized sections and stored into areas memory called frames? Physical Address Logical Address Single Contiguous Round Robin Paged Question 8 2 pts In which state does a process reside if it does not have a needed resource, such as a page from secondary memory? O Ready O New O Blocked Suspended Running Question 9 15 pts Consider the following implementation of the Binary Search Algorithm: SET upper to length - 1 SET laver TO WHILE upper - lower SET med pt TO upper + lower) 1 2 IF decet mid_p 1 Select) Select Select

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Expert Performance Indexing In SQL Server

Authors: Jason Strate, Grant Fritchey

2nd Edition

1484211189, 9781484211182

More Books

Students also viewed these Databases questions

Question

=+1. What is discipline?

Answered: 1 week ago