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

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter13: Internet And Distributed Application Services

Section: Chapter Questions

Problem 24VE

See similar textbooks

Similar questions

a. Can a process make transition from Ready state to Blocked state? Why orwhy not?b. Which scheduler must work very fast in order not to waste significantCPU time? Which can be slowc. What are the advantages of multiprogramming over non-multiprogramming systems?d. Is there any protection between threads of a process?e. How threads are more efficient in multiprocessor system?f. What is the advantage of thread switching over process switching? Why?g. What is the advantage of implementing threads in the kernel?h. When are counting semaphores used?i. What is the difference between multiprogramming and multiprocessing?j. When should a user use time-sharing system than personal computer orsingle-user?
The portion of the process scheduler in an operating system that dispatches processes is concerned with ____________ 1. assigning ready processes to CPU 2. assigning ready processes to waiting queue 3. assigning running processes to blocked queue 4. all of the mentioned
Mention 3 open source with these characteristics1.- Name of the operating system2.-Provider3.-Use priority or Round Robin4.- Priority Rank5.-How many process queues are used?6.- Queue size7.-Kernel parameters that control these algorithms
The portion of the process scheduler in an operating system that dispatches processes is concerned with ____________ 1. assigning ready processes to CPU2. assigning ready processes to waiting queue3. assigning running processes to blocked queue4. all of the mentioned
57. What is the reusable resource? a. that can be used by one process at a time and is not depleted by that use b. that can be used by more than one process at a time c. that can be shared between various threads d. none of the mentioned
2)Regardless of how user level threads are implemented,if a program has two or more user level threads,the kernel must see at least one schedule able entity.TrueFalse
. In order to keep track of the state of each running process, the operating system creates a _____________ for each. process control block linked list CPU thread Which PCB fields below can have their values changed when a process is in "Running" state. parent, children, open_files process_state, children process_state, open_files children, open_files . Considering the implementation of a process create() function, select the correct choice for each of the following when the function is executed to create a process p. p.process_state = p.parent = p.children = p.cpu_state = READY, BLOCKED, NULL, RUNNING
The portion of the process scheduler in an operating system that dispatches processes is concerned with ____________ a) assigning ready processes to CPU b) assigning ready processes to waiting queue c) assigning running processes to blocked queue d) all of the mentioned
All of the following are possible options to recover from a deadlock EXCEPT: Select one: A. Terminate a thread or process, forcing it to give up resources. B. Preempt resources without killing it off. C. Shut down the system and restart. D. Rollback actions of deadlocked threads or processes.
This question is from Operating Systems. I just need clarification on a question the book didn't throughouly the concept. I tried reading the book and I can really only find one reason for the ULTs. Questions: 1) If a process exits and there are still of that process running, will they continue to run? 2) When a User-level-thread (ULT) executes a system call, why is that thread blocked, but also all the other threads within the process are blocked?
A deadlock occurs in an operating system when a process enters an endless waiting state due to another process holding a requested resource. Suggest THREE (3) strategies to avoid a stalemate, and use examples from the actual world to illustrate each one.
Mention 3 commercial operating systems with these features 1.- Name of the operating system 2.-Provider 3.-Use priority or Round Robin 4.- Priority Rank 5.-How many process queues are used? 6.- Queue size 7.-Kernel parameters that control these algorithms