The following diagram shows the process_state and other_resources fields of 4 processes in the PCB array. The RCB array shows the state and the waiting_list of 4 resources. The ready list RL contains processes 3 then 2. Consider (1), (2) as independent operations. РСВ 1 PCB 0 PCB 2 PCB 3 process_state blocked blocked ready running other_resources RCB 0 RCB 1 RCB 2 RCB 3 *** state allocated free allocated free waiting list Now consider that Process 3 requests resource 0. Now, answer the following questions: 5.1.1 What is the status of process 3? (a) blocked (b) ready (c) running Answer: 5.1.2 Resource O's waiting list contains: (a) process 0 (b) process 1 (c) process 2 (d) process 3 (e) empty Answer: 5.1.3 Resource 0 is: (a) allocated (b) free Answer:

The following diagram shows the process_state and other_resources fields of 4 processes in the PCB array. The RCB array shows the state and the waiting_list of 4 resources. The ready list RL contains processes 3 then 2. Consider (1), (2) as independent operations. РСВ 1 PCB 0 PCB 2 PCB 3 process_state blocked blocked ready running other_resources RCB 0 RCB 1 RCB 2 RCB 3 *** state allocated free allocated free waiting list Now consider that Process 3 requests resource 0. Now, answer the following questions: 5.1.1 What is the status of process 3? (a) blocked (b) ready (c) running Answer: 5.1.2 Resource O's waiting list contains: (a) process 0 (b) process 1 (c) process 2 (d) process 3 (e) empty Answer: 5.1.3 Resource 0 is: (a) allocated (b) free 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

Assume that a virtual memory is managed using a buffer pool. The buffer pool contains five buffersand each buffer stores one block of data. Memory accesses are bydiskblock ID. Assume thefollowing series of memory accesses takes place: 5 2 5 12 3 6 5 9 3 2 4 1 5 9 8 15 3 7 2 5 9 10 4 6 8 5 For each of the following buffer pool replacement strategies, show the contents of the buffer poolat the end of the series, and indicate how many times a block was found in the buffer pool (insteadof being readinto memory). Assume that the buffer pool is initially empty b.Least frequently used (with counts kept only for blocks currently in memory, counts for a pageare lost when that page is removed, and the oldest item with smallestcount is removed whenthere is a tie). c.Least frequently used (with counts kept for all blocks, and the oldest item with the smallestcount is removed when there is a tie).
Assume that a virtual memory is managed using a buffer pool. The buffer pool contains five buffersand each buffer stores one block of data. Memory accesses are bydiskblock ID. Assume thefollowing series of memory accesses takes place: 5 2 5 12 3 6 5 9 3 2 4 1 5 9 8 15 3 7 2 5 9 10 4 6 8 5 For each of the following buffer pool replacement strategies, show the contents of the buffer poolat the end of the series, and indicate how many times a block was found in the buffer pool (insteadof being readinto memory). Assume that the buffer pool is initially empty a.First in, first out. b.Least frequently used (with counts kept only for blocks currently in memory, counts for a pageare lost when that page is removed, and the oldest item with smallestcount is removed whenthere is a tie). c.Least frequently used (with counts kept for all blocks, and the oldest item with the smallestcount is removed when there is a tie). d.Least recently used.
There are 3 resources R1, R2 and R3 with one instance each and three processes P1, P2 and P3 in an operating system. A snapshot of the system resource allocation graph shows the following: R1 is allocated to P2; R2 is allocated to P1; R3 is allocated to P3; P1 requests R1; P2 requests R3; P3 requests R2. Which of the following is true about this system? answer ) a)Undetermined b)There is deadlock in the system c)Deadlock will never happen d)There is no deadlock in the system
In your opinion what does the term semaphore mean in terms of managing concurrent processes in operating systems. a) consider the case of a non negative counting semaphore S. During an execution, 18P(S) operations and 13 V (S) operations were carried out in some order. What is the largest initial value of S for which at least two P(S) operations are blocked?
Assume that a virtual memory is managed using a buffer pool. The buffer pool contains five buffersand each buffer stores one block of data. Memory accesses are bydiskblock ID. Assume thefollowing series of memory accesses takes place: 5 2 5 1 2 3 6 5 9 3 2 4 1 5 9 8 1 5 3 7 2 5 9 1 0 4 6 8 5. For each of the following buffer pool replacement strategies, show the contents of the buffer poolat the end of the series, and indicate how many times a block was found in the buffer pool (insteadof being readinto memory). Assume that the buffer pool is initially empty. a. First in, first out. b. Least frequently used (with counts kept only for blocks currently in memory, counts for a pageare lost when that page is removed, and the oldest item with smallestcount is removed whenthere is a tie). c. Least frequently used (with counts kept for all blocks, and the oldest item with the smalles d.Least recently used
We are dealing with 6 processes p1;p2; : : : ;p6:(a) Processes p1;p2 in p3 arrive at time 2 ms, respectively. Each of those processesneeds 5 ms of CPU time.(b) Process p4 arrives at time 10 ms and needs 3 ms of CPU time.(c) Processes p5 in p6 arrive at time 19 ms. Process p5 needs 7 ms, while process p6needs 4 ms of CPU time.Scheduling is preemptive, where there process switch takes 1 ms. For the Round-Robinalgorithms with quantum 2 ms illustrate the execution of those processes on a timeline.Then determine the average turnaround time.
1.In the Readers-Writers problem, more than one writer can access the buffer at the same time to write True False 2.Given that processes P1 and P2 are using semaphores to lock resources, determine whether or not the following sequence of requests results in a deadlock. Initially, all resources are available. P1: P2: wait(A) wait(C) wait(B) wait(B) ... .... signal(A) signal(B) signal(B) signal(C) Yes No Insufficient information 3.If no process is executing in its critical section and there exist some processes that wish to enter their critical section, then the selection of the processes that will enter the critical section next cannot be postponed indefinitely. Which option describe best Mutual Exclusion Progress Bounded Waiting None of the above 4.In the producer-consumer problem, the "out" will be used to point to the index in the buffer where a producer can produce next. True False 5.Entry section and Exit section in the code together are referred to as a solution for…
assume a system has 6 identical resources and N processes competing for them. each process can request at most 2 resources. what is the maximum value of N for the system to be deadlock free?
For these questions, assume that memory partitions can be subdivided; multiple processes may fit in a partition if there is room. For example, if we had a 30-MB partition and a 20-MB process that fits in the partition, the partition’s new size is 10 MB after placing the process in it. If a second, 8-MB process arrives, we may place it in the partition, leaving 2 MB free in the partition. (The original memory partition then contains a 10-MB and an 8-MB process.) Consider a swapping system where memory has partitions of the following sizes: 180 MB, 100 MB, 40 MB, 200 MB, 300 MB, and 150 MB (in order). For first fit, how are processes of sizes 180 MB, 30 MB, 150 MB, 80 MB, 100 MB, and 70 MB placed (in order)? Indicate which requests (if any) cannot be satisfied. Repeat question (a) for best fit. Repeat question (a) for worst fit.
Question 4 Execute SRT for the following group of processes and complete the following table: Process A B C D E TArrival 0 2 4 6 8 Ts 2 3 5 1 4 TFinish Answer Answer Answer Answer Answer TR Answer Â Answer Â Answer Â Answer Â Answer Â 1. If the process arriving has the same remaining execution time as the process in the CPU, then the process that is using the CPU will have the highest priority.Â 2. If there is no process in the execution state and two or more processes have the shortest remaining time, then you will use the lowest PID criterion (using lexicographical order). Question 5 Execute HRRN for the following group of processes and complete the following table: Process A B C D TArrival 0 2 4 6 Ts 3 5 4 1 TFinish Answer Answer Answer Answer TR Answer Â Answer Answer Answer Â If two or more processes in the ready queue…
Consider a computer with 250 MB of available memory (not used by the OS), a mouse, a keyboard, and a printer. Three programs, Job1, Job2, and Job3, are submitted for execution at 5 seconds, 10 seconds, and 20 seconds, respectively. We assume minimal processor requirements for Job1 and Job2, and continuous printer use by Job2, and keyboard and mouse use by Job1. In a simple batch environment, these jobs will be executed in sequence. Assuming Job1 completes in 10 seconds, Job2 must wait until the 10 seconds are over and then completes 15 seconds after that. Job3 begins after 30 seconds and completes at 35 seconds. Now, suppose that the jobs are run concurrently under a multiprogramming OS. The memory requirements for Job1, Job2, and Job3 are 100 Mb, 150 Mb, and 70 Mb, respectively. (a) Fill out the following table: Type of job Submission time Duration Memory required Need mouse? Need printer? Need keyboard? Job1 Job2 Job3 Processor utilization (%) Memory usage (%) Printer…
For an old computing system with 2K bytes physical memory, and the virtual address has 13bits. Suppose that the size of page/frame is 256 bytes. For a process A, it has its codes and data inpage 0, 1, 2, 10, 11, 28, 29, where pages 0, 1, 10, 29 are in frame 1, 3, 4 and 6, respectively.Moreover, frame 0 contains kernel OS code/data and all other frames are free.a. Show the page table and the content of each PTE for process A;b. Use a figure to illustrate the address translation for virtual address 1110000100000 and explainwhat happens during the translation (interaction among page table, physical memory, disk, andoperating system);c. Suppose that there is a TLB with 4 entries and the current content has the mapping informationfor pages 0, 1. Draw a new figure to illustrate the translation of address 101000011000 andexplain what happens during the translation process.