9- Devices that let the computer communicate with you (a) Input (b) Print (c) Output (d) None of these 10- Which of the following algorithms tends to minimize the process flow time? (a) First come First served (b) Earliest Deadline First (c) Shortest Job First (d) Longest Job First

9- Devices that let the computer communicate with you (a) Input (b) Print (c) Output (d) None of these 10- Which of the following algorithms tends to minimize the process flow time? (a) First come First served (b) Earliest Deadline First (c) Shortest Job First (d) Longest Job First

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

Related questions

Q: Čonsider the following set of processes, with the length of the CPU burst time given in…

A: 1. At time 0, there are two process P1 and P2 are available. Out of which P1 has higher priority so…

Q: Suppose a program has four conditional execution states (it does one of four things, depending on…

A: The weighted average of the response time is: 0.60 x 50 + 0.24 x 172 + 0.12 x 1400 + 0.04 x 3400 =…

Q: Before procecding with its execution, each process must acquire all the resources it needs, This is…

A: Hold and Wait and Circular Wait are conditions that are met when deadlocks occur. This means that if…

Q: During an optimal use of the computer, where there are several application running the CPU usage…

A: Given that During an optimal use of the computer, where there are several application running the…

Q: (a) A program is run on a system with two types of machine language instructions: type A…

A: The answer is..

Q: 4. Does the following group communication of 4 computers respect the FIFO order? p1 p2 p3 physical…

A: Below is the answer of the above query. I hope this will help.

Q: Consider a system using preemptive Shortest Job First algorithm. The systems is running tasks P1,…

A: In Preemptive SJF Scheduling, jobs are put into the ready queue as they come. A process with the…

Q: Identify the states of a process O a. New, Ready, Running, wait O b. New, Ready, Running, wait and…

A: Required:

Q: Every algorithm must satisfy the following criteria: input, output, finiteness, definiteness,…

A: The algorithm is a step-by-step process to solve a specific problem. The word "finite" here means…

Q: 2. Assume there are 6 processes with id, arrival time and burst time as shown below (see Table 2).…

A: Solution: Given, a) i) Round Robin(RR): Grant Chart: Job Arrival Time…

Q: A task runs to completion in X seconds, where X is the least significant two digits of your student…

A: A task runs to completion in X seconds, where X is the least significant two digits of your student…

Q: :4 Processes (P1,P2,P3) arrived at time 0. The Duration of the processes are (2,4,6,8). All…

A: The waiting time of P0 is 0 the completion time of P0 is 8.88 waiting time P1 =8.88 similarly…

Q: create code in a python notebook to show the Ghant chart and metrics for the various Scheduling…

A: # Python program for implementation of # RR scheduling # Function to find the waiting time # for…

Q: In a timesharing OS we have the following cpu timeline for two tasks X and Y. The timeslice is 1s.…

A: Answer:-

Q: 3. Assume that there are SIX (6) processes with id, arrival time and burst time as shown below (see…

A: Note - Since you have posted a question with multiple sub-parts, we will solve first three subparts…

Q: To solve a certain problem, some of its procedures are executed on distinct machines, possibly…

A: To execute a program written in high level language must be translated into machine understandable…

Q: Five et processes namely P1, P2, P3, P4 and PS av at time. The bunt fimes of each process is as…

Q: A system has 4 processes and 5 allocatable resource. The current allocation and maximum needs are as…

A: Introduction :Given , 4 process are given ,Number of resources are = 5.we have to calculate the…

Q: 4. Does the following group communication of 4 computers respect the FIFO order? p1 p2 physical time…

A: Answer: I have given answer in the brief explanation.

Q: Suppose that a system has only one CPU with the following list of processes, which are represented…

A: 1. preventative Scheduling:Preemptive programing is employed once a method switches from running…

Q: a. When a deadlock occurs b. When it has a starvation and not a deadlock c. When the result of a…

A: Given: What is known as a race condition?

Q: Computers often have to deal with scheduling the programs whích are submitted to them by program-…

A: CPU scheduling is the process that allocates the system resource to various tasks by an operating…

Q: 9. The process where in the processor constantly checks the status flags is called as a. Polling b.…

A: Answer is given below .

Q: the arrival times and execution times for the following processes: Process time Execution time…

A: The given question is as follows, Process Time Execution Time Arrival Time P1 20 0 P2 25…

Q: What exactly is optimum performance in computer terms?

A: The Answer is in step2

Q: consider the following process synchronization problem. an ice-cream store has a variety (k type of…

A: When on a particular task, when every operation tries to connect and communicate with the system,…

Q: Three processes of an operating system has P(arrival time, burst time) as follows: P1(0,6),P2(2,5),…

A: In given question, we have 3 Processes P1, P2 and P3 with arrival time and burst time. And we have…

Q: 2. Consider the following set of processes, with the length of the CPU burst and arrival time given…

A: Solution:

Q: Question Number 4 Consider the following processes who wish for the CPU. The scheduler is using SRT…

Q: 6. In Operating Systems, which of the following is/are CPU scheduling algorithms? a) Round Robin b)…

A: In CPU scheduling there are a number of algorithms which are used to help the operating system such…

Q: Choose the most correct answer from the options below: In a time-sharing Operating system CPU time…

A: Explanation: A time shared OS uses CPU scheduling to provide a small portion of a shared computer at…

Q: 4 Processes (P1,P2.P3) arivea at fime o. The Duration of the processes cre (2.4.6.8). A processes…

A: The waiting time of P0 is 0. The completion time of P0 is 8.88. So, the waiting time of P1 is 8.88.…

Q: The processes A, B. C, and D are arrived to a system as shown in the table below. If the scheduling…

A: Scheduling : SRTF AWT = ?

Q: Please refer to this textbook: “A. Silberschatz, P. B. Galvin and G. Gagne, “Operating System…

A: Please refer to this textbook: “A. Silberschatz, P. B. Galvin and G. Gagne, “Operating System…

Q: Assume that the following processes are the only processes in a computer system and that there are…

A: Here in this question four process are given with thier arrival time and burst time..we have asked…

Q: Q2. An operating system uses shortest remaining time first scheduling algorithm. Consider the…

A: We need to find Gantt chart, average turnaround time, waiting time and response time of the given…

Q: Consider a system with processes, P1, P2 and P3 are presented in the table below, calculate the…

A: GIVEN Consider a system with processes P1, P2, and P3 are presented in the table below Processes…

Q: 3. Does the following group communication of 4 computers respect the FIFO order? p1 p2 p3 physical…

A: Here, p4 sends_message A and p2 sends_message B. The first_message is_sent by p4 and_then by p2.so,…

Q: 1. Schedule the following programs with listed workload and burst time and calculate average wait…

Q: Given below are the arrival and burst times of four processes P1, P2, P3 and P4. Using SJF…

A: Actually, given information is: PROCESS NO Arrival time (msec) Burst time(msec) P1 2…

Q: If you deny an entire service (i.e., the computer doesn't respond to the user), how does it affect…

A: Describe a case in which a user's total denial of service (i.e., the user receives no answer from…

Q: Discuss how the following pairs of scheduling criteria conflict in certain settings. CPU utilization…

A: According to the information given:- We have to discuss pairs of scheduling criteria.

Q: Q1. An operating system uses SJF Scheduling algorithm. Consider the following set of processes, with…

A: Given that, the table contains four processes P1, P2, P3, P4 and their burst times. SJF stands for…

Q: Q1. An operating system uses SJF Scheduling algorithm. Consider the following set of processes, with…

A: Answer - SJF scheduling means the shortest job first. In this case, the system will take and process…

Q: There are 12 processors in a network, each processor stores a different piece of information about a…

A: In questions with many questions, we must answer 1. Rоuting Infоrmаtiоn Рrоtосоl (RIР) is а…

Q: Assume the following set of processes with arrival tim nd length of CPU Burst time given in…

A: In preemptive priority algorithm, if a process with a higher priority than one running arrives, it…

Q: Software characterized by number of conventional numerical algorithms are a. application software…

A: Embedded software is computer software, written to control machines or devices that are not…

Q: Based on the previous question (UNIX passwords are derived

A: The average time to crack a password with brute force on a UNIX system is approximately 1.5 days.

Q: Q2. An operating system uses shortest remaining time first scheduling algorithm. Consider the…

Q: 8 The process of deciding which process should use the CPU is called as _______________ a. Planning…

A: Answer : - option C) Scheduling

Concept explainers

Concurrency Control

The simultaneous occurrence of two or more operations is called concurrence and the situation is called concurrency. In concurrency, the function of one operation can affect the function of the other and put data integrity at risk. Hence, management for the control of concurrency is required. The management or controlling system in the Database Management System (DBMS) that coordinates concurrent access is called the concurrency control system.

Question

9- Devices that let the computer communicate with you
(a) Input
(b) Print
(c) Output
(d) None of these
10- Which of the following algorithms tends to minimize the process flow time?
(a) First come First served
(b) Earliest Deadline First
(c) Shortest Job First
(d) Longest Job First

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Problem Analysis:

VIEW

Answers AND Explanation:

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Please Implement in C programming Language Given the list of processes, their CPU burst times, arrival times, and priorities implement the SJF scheduling algorithm on the processes with preemption. Compute and print the completion Time(CT), Turnaround Time(TAT), and Waiting Time(WT) for each process using C Programming. Waiting time: Processes need to wait in the process queue before execution starts and in execution while they get preempted. Turnaround time: Time elapsed by each process to get completely served. (Difference between submission time and completion time). Task 1: SJF Scheduling with preemption You can use the following input as a sample:
The most effective method of process scheduling has been shown to be
Let the processes P1, P2, P3, and P4 be given. They arrive in the system at the same time in this order. The processes have the following service times (in time units): P2 17 Process Service time (CPU burst) P1 53 P3 68 P4 24 For the scheduling method "Shortest Job First" (SJF), specify the execution order of the processes, the average execution time (average turnaround time) and the average waiting time over all processes. You must show your calculations. You will not have to draw Gantt charts.
Do the Shortest Remaining Time First scheduling algorithm to the list of processes. The process should provide : a. A detailed gantt chart b. finish time, turnaround time, waiting time c. The average turnaround time d. The average waiting time
104. The process to be aborted is chosen on the basis of the following factors : a. priority of the process b. process is interactive or batch c. how long the process has computed d. all of the mentioned
Please Implement in C programming Language Given the list of processes, their CPU burst times, arrival times, and priorities implement the Priority scheduling algorithm on the processes with preemption. Compute and print the completion Time(CT), Turnaround Time(TAT), and Waiting Time(WT) for each process using C Programming. Waiting time: Processes need to wait in the process queue before execution starts and in execution while they get preempted. Turnaround time: Time elapsed by each process to get completely served. (Difference between submission time and completion time).
Draw the shortest job first (SJF non-premptive) Gantt chart showing the execution of CPU considering the given data. Draw the shortest remaining time first (SRTF) Gantt chart showing the execution of CPU considering the given data.
Write the process scheduling of the following Scenario
9. Write a program for the accurate iterative feasibility test of scheduling with the DM algorithm
Apply the following scheduling algorithms to the list process. 1. Shortest Remaining Time 2. Round Robin:Quantom =3 For each process scheduling algorithm, provide the following: a. Finish time Turnaround time Waiting time b. A detailed gantt chart c. The average turnaround time d. The average waiting time
Make a list of the CPU scheduling algorithms. Note: This is an operating system question; please answer it completely and correctly.
Explain how wait() is used to end a process, preferably with an example of its use in code.