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: Assume that a software system will experience 150 failures in infinite time. The system has now…

A: Hello studentIn reliability engineering, understanding the failure intensity of a software system is…

Q: Referring to the digraph above, schedule the tasks on two processors using the decreasing-time-list…

Q: Task 1: Turing Machine for Bit Inverter The state transition diagram for a Turing machine that…

A: A Turing machine is a numerical model of calculation portraying a theoretical machine that controls…

Q: Assume the following transection T1 and T2 executing in serial schedule. The Initial value of A=20…

A: Answer: In serial schedule a process performs all transaction exclusively. After completing the all…

Q: a. Following are the processes need to be scheduled, apply all algorithms i.e FCFS,…

A: Given: Following are the processes need to be scheduled, apply all algorithms i.e FCFS,…

Q: The main advantage of a multiprogramming system is: A More than one job can be processed at a given…

A: the answer is an all of the above

Q: Question 1 (Task Scheduling Suppose that we have n tasks to schedule on a computer with a…

A: Hello student Greetings In the context of task scheduling, the problem involves scheduling a set…

Q: 1. Shortest Remaining Time (SRT) is used to schedule the arriving processes. Jobs and arrival…

A: Answer:option B, 6ms Turn Around Time(TAT): TAT is the time spent by the process from the time of…

Q: 30. A(n). occurs when there is a hardware fault in a system A Interrupt B Spooling € Breaker D…

A: given data is 30) A(n)_______ occurs when there is a hardware fault in a system 31) The number of…

Q: Assume that there are 3 different types of instructions in a program. 70% of the instructions have a…

A: Introduction: Instructions are processors it defines by operations, and it is machine language, the…

Q: If two processes are running, postponing execution until one finishes. Generally, phase 1 is more…

A: Introduction: The operating system links the hardware of the computer to the running applications.…

Q: Computer Science Processor A has a 3Hz clock and runs a program in 10 seconds. Processor B runs the…

A: Given : For processor A : 3Hz clock Running time is 10 seconds For processor B : 4Hz clock…

Q: Distinguish between the two methods by which computers may run many processes at the same time and…

A: The two methods that computers employ to execute many processes are as follows:

Q: A system contains five tasks. There are three resources X, Y, and Z. The resource requirements of…

A: The answer is as follow:

Q: Amdahl's Law is as applicable to software as it is to hardware. An oft-cited programming truism…

Q: A process may be blocked and located into the correspondi for an event of a specific type, however…

A: A process is characterized as a substance which addresses the essential unit of work to be executed…

Q: In the above, we had the three concurrent processes p1, p2 and p3, each with the number s1 = 2, s2 =…

A: According to the information given:- We have to follow the instruction to perform above task.

Q: For the scheduling method "Round Robin" (RR), specify the average execution time (average turnaround…

A: All the process arrive at same time in the sequence P1->P2->P3->P4. The time quantum time…

Q: the shortest job first (SJF non-premptive) Gantt chart showing the execution of CPU considering the…

A: The SJF and SRTF Gantt chart showing the execution of CPU considering the data

Q: cess loop, or machine cycle, consists of the followi omponents. In what ways do machine cycles matte…

A: Introduction: Using a standard DLX 5 stage Multicycle pipeline and MIPS give 2 example that would…

Q: The "turn-around" time of a user's job is the: Time since its submission to the time its results…

A: Please find the answer below :

Q: N.B.Provide quality solution with step-by-step explanation CPU scheduler will decide which process…

Q: Imagine you have a CPU with the following conditions: cpu operating frequency of 200.002 Hz -…

A: Given: Cpu operating frequency (f) = 200.002 Hertz Transistors in CPU capacitance (C) = 1.567…

Q: Burst Arrival Process Time Time SJF (NP) TAT SJF (NP) WT SRTF TAT SRTF WT (BT) (AT) P1 15 P2 10 P3 9…

A: SJF(non premptive) and Shortest remaining time first is detailed in step 2.

Q: Round Robin Process Suppose we have a four (4) core processor and all processes are designed to…

A: Here i am applying round robin scheduling:…

Q: C. URdasirabla ro D, Better use of CPU 41. When a process is in a waiting state, it possibly needs…

A: 41) Answer :- option D) an input/output event. Because process are in waiting state when it need…

Q: If you have many processes that are running concurrently, some code is a critical section if one of…

A: Here we have given the option which refers to the critical section. You can find the solution in…

Q: As far as processor scheduling strategies are concerned, the acronym SJF stands for A Smartest Job…

A: Answer C) Shortest Job First.

Q: ccording to Amdahl's Law, what is the maximum possible % reduction in execution time when: process…

A: In computer architecture, Amdahl’s law (or Amdahl’s argument) is a formula which gives the…

Q: Computer A and Computer B use exactly the same CPU. The table below shows the types of instructions…

A: We have two exactly same computers A and B Same program is executed on both. 5 instruction types are…

Q: A system has four periodic tasks, A,B,C,D and two processors, P1 and P2. The period of A and B is…

A: Solution: The system is scheduled with EDF that is, the task with the lowest execution time is…

Q: When a job is in processing by system that performs I/O operations and CPU is idle, describes…

A: Given that, When a job is in processing by system that performs I/O operations and CPU is idle,…

Q: Question: For P1, P2,..,P5 processes, choose random and different millisecond time units between…

A: Task : Given the process: P1, P2, P3 P3, and P5.

Q: 9- Devices that let the computer communicate with you (a) Input (b) Print (c) Output (d) None of…

A: Answer 9 Devices that are used to communicate with the user are Input Devices. Input devices reads…

Q: 16MB RAM sel Id cir Text Memory PC Value to Register A Bus B Bus C Bus 1 Rs, Rn 2 MUX Rs *3 MUX Rn…

A: MSCPU The MSCPU, which implements the flexible operand, or Operand2, of the ARM CPU, is represented…

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

A: Your roll number is 51 (the previous part (19101003) is common I guess) SRT is a preemptive…

Q: 5. A concurrent work of two computers is represented by the diagram: write(a,2), read(b,1), computer…

A: A concurrent work of two computers is represented in the given diagram. The objective is to state…

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

A: The Correct option: a (None of the options) The average waiting time of the processes when the…

Q: Suppose that you are working with a CISC machine using a 2 GHz clock (i.e., the clock ticks 2…

A: Ans:) Given data: 2.4GHz processor = 2, 400, 000, 000 cycles per second

Q: Imagine you have a CPU with the following conditions: cpu operating frequency of 200.002 Hz

A: The answer is

Q: We have 4 periodical processes II₁, I₂, I3 and II4, that process a video. We know their periods P;…

A: Rate Monotonic Scheduling(RMS) algorithm is a type of preemptive OS scheduling algorithm. Here,…

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

The processes A, B, C, and D are arrived to a system as shown in the table below. If the scheduling mechanism is the Shortest Remaining Time First, what is the average waiting time for the processes? The switch time is assumed to be zero. Process Arrival Time CPU Burst Time (ms) A 1 2 C 2 5 D 3 Lütfen birini seçin: O a. 3.25 O b. None of the options О с. 4.5 O d. 2 О е.4.25
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
OS Process P1 P2 P3 P4 P5 Let's Try This (1) CPU-burst 75 40 25 20 45 Arrival Time (a) Solve using RR with Q=15 (b) Solve using preemptive SJF 0 10 10 80 85 65
The total number of processes that gets completed in a unit time is called a. Turnaround time O b. Throughput c. Response time d. Waiting Time
Answer question 46, 47, 48 showing fully all the steps. Solution should be perfect(very correct), clear, brief and explicit enough!
help please
2. Write programs in eitherCor Java or python (choose your preference ) to simulate the following scheduling Algorithms with their respective Gantt Charts displayed during run time: (i) FCFS- First Come First Serve Scheduling (ii) SJF- Shortest Job First Scheduling (Non - Preemptive and Pre-emptive both) (iii) LJB-Longest Job First Scheduling (Non - Preemptive and Pre-emptive both) (iv) Priority Scheduling (Non - Preemptive and Pre-emptive both)
Please written by computer source All answers and responses must be written in python code, please dont bother to respond if you respond without python code.
what is the CPU time if the number of instructions executed by the program is 500, cycles per instruction is 5 and the clock cycle time is 200 ps ? a) 1000 secb) 50000 secc) 500000 secd) 10000 sec answer
A system has 5 processes and 5 types of resources. The current state of the system is as follows: Process Allocated (C) Requested (R) Available (A) II₁ 1 2 2 3 1 0 3 3 3 3 A 2 4 1 7 II2 2 120 1 6 23 2 3 II3 5 1 002 9 322 0 II4 202 1 1 3 1 402 II5 2011 0 12 4 505 What is the smallest values of \ for which the system is in a safe state? Justify your answer.
Q3: Suppose there is a processing unit composed by CPU and I/O component. For a specific task, CPU takes 5 second to finish the execution and I/O takes 2 second to process. The communication time between CPU and I/O can be elimiate under this circumstance. Execution Time 7 second 5second 2 second CPU time I/O time If CPU time decreases by 25% per year for 3 years and I/O time decreases by 20% per year 1) How many times faster is this program after 3 years? 2) What percentage of new time is I/O? and what percentage of new time is CPU?
e to search What is the state table corresponding to the following state diagram? X-0 X-1 A/L 5% X-0 0/0 X-1 5/1 X-0 Select one: O a O b. OC X-1 O d. A B C D A B C D 4 A B C D 9 A 8 C D 4 X-1 X+0 77 M/ X-0 x=0 X-0 A A A X-0 B C D C of D X=1 non-g X-1 A A A Z 0001 HODON 2 1 0 0