Question Completion Status:QUESTION 7PolicyOA. determines how to do somethingOB. determines what will be doneOC. is not likely to change across placesOD. is not likely to change over timeQUESTION 8A boot blockOA. typically only knows the location and length of the rest of the bootstrap programOB. typically is sophisticated enough to load the operating system and begin its executionOC. is composed of multiple disk blocksOD. is composed of multiple disk cylindersClick Save and Submit to save and submit. Click Save All Answers to save all answers. QUESTION 9Microkernels useOA. message passingOB. shared memoryOC. system callsOD. virtualizationfor communication.QUESTION 10A process control blockOA) includes information on the process's stateOB) stores the address of the next instruction to be processed by a different processOC) determines which process is to be executed nextOD) is an example of a process queueClick Save and Submit to save and submit. Click Save All Answers to save all answers.Q SearchODEC

In computer science and operating systems, understanding key concepts such as policies, boot blocks,…

QUESTION 7 Policy OA. determines how to do something OB. determines what will be done OC. is not likely to change across places OD. is not likely to change over time QUESTION 8 A boot block OA. typically only knows the location and length of the rest of the bootstrap program OB. typically is sophisticated enough to load the operating system and begin its execution OC. is composed of multiple disk blocks OD. is composed of multiple disk cylinders

QUESTION 7 Policy OA. determines how to do something OB. determines what will be done OC. is not likely to change across places OD. is not likely to change over time QUESTION 8 A boot block OA. typically only knows the location and length of the rest of the bootstrap program OB. typically is sophisticated enough to load the operating system and begin its execution OC. is composed of multiple disk blocks OD. is composed of multiple disk cylinders

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

LAB MAKEUP 1 Initial value of shared variable m is equal to 0. Four threads A, B, Y, Z use this variable as follows: Processes A and B increase the value of m by 1. Processes Y and Z decrease the value of m by 1. Since m is shared, each process protects the critical region using semaphore S initialized to 2. Run your program to show that it is possible that m's value can be equal 2 after all processes run once. S=2 Proses A W(S) m=m+1 S(S) ADD TEXT OF YOUR CODE HERE Proses B W(S) m=m+1 S(S) ADD PRINTSCREEN OF YOUR OUTPUT HERE Proses Y W(S) m=m-1 S(S) Proses Z W(S) m=m-1 S(S)
MCQ: 4. What will happen when a process terminates? i) It is removed from all queues ii) It is removed from all, but the job queue iii) Its process control block is de-allocated iv) Its process control block is never de-allocated
Correct and detailed Answers will be given Upvoted else down What is the use of Thread synchronization?
In execution of a program a new thread (A) is created and begins in the New state. As it requires an input from the user, the schedular is called and changes it into the runnab state. Finally it gets a time slice from the processor but suddenly a new urgent thread (B) appears which needs to be handled by the CPU. Thus, the thread (A) is blocked and moved back to the run queue.
Is it possible to halt a process when it is in the middle of executing another? Please elaborate on your responses.
Is there a reason why threads are called "light-weight" processes? When a new thread is created, what system resources are consumed? Do they vary from those used when a procedure is established?
This may be accomplished by analyzing the scheduling of processes and threads side by side and comparing and contrasting the two.
What will happen if two thread of the same priority are called to be processed simultaneously? O Anyone will be executed first lexographically Both of them will be executed simultaneously None of them will be executed It depends on the operating system
Is it even feasible to have a deadlock if there is just one process that is using a single thread? Please elaborate on your response.
An example of a Windows process may be used to demonstrate the relationship between processes and threads.
That's why we refer to threads as "lightweight processes." What system resources are needed to launch a new thread? What sets them different from the tools used to create a procedure?
WIMP layout is used on computers. WIMP implementations leverage the Desktop metaphor to translate common operations into actual ones. Drag a file to a new folder or the desktop by clicking and dragging. Give us two processes and their applications?