1. In the Remote Procedure Call (RPC): a. The two processes reside in same machine. b. Each process has own stub. c. The two processes provide services together. d. All above true. e. Nothing of that. Answer:| 2. The long-term scheduler takes a place in: a. Waiting-Ready transition. b. Running-Terminated transition. c. New-Ready transition. d. B+ C. E e. A+ C. Answer:

1. In the Remote Procedure Call (RPC): a. The two processes reside in same machine. b. Each process has own stub. c. The two processes provide services together. d. All above true. e. Nothing of that. Answer:| 2. The long-term scheduler takes a place in: a. Waiting-Ready transition. b. Running-Terminated transition. c. New-Ready transition. d. B+ C. E e. A+ C. Answer:

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

write true or false for each of the following statements:
101. A deadlock can be broken by : a. abort one or more processes to break the circular wait b. abort all the process in the system c. preempt all resources from all processes d. none of the mentioned
59. A system is in the safe state if a. the system can allocate resources to each process in some order and still avoid a deadlock b. there exist a safe sequence c. all of the mentioned d. none of the mentioned
2. a) Your colleague has invented a new scheduling algorithm using the multilevel queue approach. This list of processes showing CPU burst times is below. There are three queues used in the application. The processes all start on the first queue and receive upto 10ms of burst time. Once the process has received the 10ms on the first queue, if the process still requires burst time it is passed to the second queue where it receives upto 20ms. Once the process has received the 20ms on the second queue, if the process still requires burst time it is passed to the third queue where it receives CPU time until it is completed. The operating system will only start allocating CPU time to processes on the second queue when queue 1 is empty. The operating system will only start allocating CPU time to processes on the third queue when queue 2 is empty. Process Number P1 P2 P3 P4 Burst time (ms) 21 8 35 50 i) Does this algorithm give higher priority to any queue over the others and any processes…
Answer the given question with a proper explanation and step-by-step solution. Hello, I am trying to make a program that prints the contents of a file but whenever I try to run it, it just prints a bunch of question marks infinitely and this only happens when I run it on a UTM virtual machine(Linux terminal). It works fine when I run it on my Mac terminal so I am not sure if it has to do with the virtual machine or my program. Please help!! Image 1: cat.c Image 2: input.txt Image 3: output/results
When a process is in the "Blocked" state, waiting for an I/O operation to complete. When a service is canceled, it enters one of the following states: a) State of Termination, b) State of Suspension, c) State of Running, or d) State of Readiness.
I need help with a MINIX programming problem.
P and Q are two processes that share a set of variables that is common. The variable includes: seq, tA and tB: Before either process starts to execute, variable seg initially has the value 10. State the possible sets of different values of seg when both processes have finished executing. Provide an order of execution of statements from processes P and Q that would produce each of the values you give. Justify your answer in detail. P ... P1: tA= seq + 1; P2: seq = tA; .. atle seg inally has the value 10 Q1: tB = seq+ 2; Q2: seq = tB;
Operating system -pls fill in the blanks for the following questions.
P and Q are two processes that share a set of variables that is common. The variable includes: seq, tA and tB: Before either process starts to execute, variable seg initially has the value 10. State the possible sets of different values of seg when both processes have finished executing. Provide an order of execution of statements from processes P and Q that would produce each of the values you give. Justify your answer in detail. ... P1: tA = seq + 1; P2: seq tA; Q1: tB = seqt 2; Q2: seq = tB; %3D %3D
When a process is in the "Blocked" state, waiting for an I/O operation to complete. When a service is canceled, it enters one of the following states: a) State of Termination, b) State of Suspension, c) State of Running, or d) State of Readiness.
For a time-sharing OS, which scheduling approach should be used? Start with what's fastest and easiest. You may be able to beat the other customers to the counter if you move quickly enough. D In a C Round, the longest running jobs are finished first. Robin