i need solution of Part 3 and 4 Question Number 2Below mentioned is an algorithm.Step1:Get the number of process.Step2:Get the id and service time for each process. Step3:Initially the waiting time of first short process as 0 and total time of firstshort is process the service time of that process.Step4:Calculate the total time and waiting time of remaining process.Step5:Waiting time of one process is the total time of the previous process.Step6:Total time of process is calculated by adding the waiting time and servicetime of each process.Step7:Total waiting time calculated by adding the waiting time of cach process.Step8:Total turnaround time calculated by adding all total time of cach process.Step9:calculate average waiting time by dividing the total waiting time by totalnumber of process.Step10:Calculate average turnaround time by dividing the total waiting time bytotal number of process.Step11:Display the result according to Table 2ProcessArrival TimeBurst TimeP1P245P3164P46.4P51P61298P71637Table 21) Which Scheduling Algorithm is mentioned in this question?2) Write and Compile C code of Algorithm mentioned above in Linux. Also displayresult according to Table 2.3) Also draw the Gantt chart of Algorithm according to Table 24) Compute and Compare from Table 2a) Waiting time for all processesb) Average Waiting timec) Turn Around Time for all processesd) Average Turn Around Time

3) Also draw the Gantt chart of Algorithm according to Table 2 4) Compute and Compare from Table 2…

Answered: Question Number 2 Below mentioned is an…

Engineering

Computer Science

Question Number 2 Below mentioned is an algorithm.

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: P1.-P6.: For five selected problems: (a) Start with the definition you were given for O), (_), and…

A: 1. f(n)=O(g(n)) if there exist constants c and n0 such that f(n)≤c×g(n) for all n≥n0.2. f(n)=Ω(g(n))…

Q: 1. Convert the following CFG into Chomsky Normal Form (CNF): S → AbA A → Aa |ε

A: Introduction : CFG stands for Context-Free Grammar, and CNF stands for Chomsky Normal Form.…

Q: Post's Correspondence Problem (PCP) is undecidable. (T

A: Given :- In the above given question, the statement is mention in the above given question Need to…

Q: ay Industries has 275 sales reps in order to sell its latex products, each to be assigned f four…

A: Glassdoor Industries has 252 sales reps in order to sell its latex products, each to be assigned to…

Q: Let f : B 3 → B where f(x, y, z) = (x + z)y. (a) Provide a truth table for the function. (b) Derive…

A: In Boolean algebra, the canonical disjunctive normal form (DNF) and canonical conjunctive normal…

Q: 25. Suppose the coefficient matrix of a system of linear equations has a pivot position in every…

A: Answer: If the coefficient matrix of a system of linear equations has a pivot position in every row,…

Q: problem 7 wasnt solved

A: We need to solve problem 7, which asks to get the sop expression for the given table.

Q: Coding problems: HW5_2 A thin square metal plate has uniform temperature of E1 47, = E, + E2 + T2 +…

A: Here is the solution with an output:-

Q: b. State the Cook-Levin Theorem.

A: Note: There are multiple questions are given in one question. According to the rule, you will get…

Q: Problem 3 Determine the root/s of the following graphically: (Using Matlab/Python) a. f(x) = x³ +…

A: a. To find the roots of f(x) = x^3 + 3x^2 - 9 graphically: Define the function f(x) = x^3 + 3x^2 -…

Q: Problem 1 Describe an algorithm for 1(A) & 1(B). (a) Describe an algorithm for finding the second…

A: Step 1) Put first element of array in Variable largest and second_largest largest = a[0]…

Q: The value of Kp for the reaction 2 A(g) + B(g) + 3 C(g) → 2 D(g) + E(g) is 10490 at a particular…

A: Given, The value of Kp for the reaction is 10490 at a particular temperature. 2 A(g) + B(g) + 3 C(g)…

Q: Thank you so much! But what about the property of additivity? Does that apply to differential…

A: Additivity refers to the property that if you have two solutions to a linear differential equation,…

Q: d) f(a,b,c,d) = Em(1,2,3,5,6,7,8,11,13,15)

Q: Chapter 3, problem 2: expressions: d) f(a,b,c,d) = For each of the following, find all minimum sum…

A: The given function is : f(a, b, c, d) = Σm(1, 2, 3, 5, 6, 7, 8, 11, 13, 15)

Concept explainers

Rod Cutting

A naïve solution for the above-stated problem is to evaluate all of the possible combinations of different pieces of varying size to find the maximum revenue-generating combination. Although this method seems the easiest and quick to practice, it has exponential time complexity. So there is a need to figure out a better method than this.

Question

i need solution of Part 3 and 4

Step3:Initially the waiting time of first short process as 0 and total time of first
short is process the service time of that process.
Step4:Calculate the total time and waiting time of remaining process.
Step5:Waiting time of one process is the total time of the previous process.
Step6:Total time of process is calculated by adding the waiting time and service
time of each process.
Step7:Total waiting time calculated by adding the waiting time of cach process.
Step8:Total turnaround time calculated by adding all total time of cach process.
Step9:calculate average waiting time by dividing the total waiting time by total
number of process.
Step10:Calculate average turnaround time by dividing the total waiting time by
total number of process.
Step11:Display the result according to Table 2
Process
Arrival Time
Burst Time
P1
P2
45
P3
1
64
P4
6.
4
P5
1
P6
12
98
P7
16
37
Table 2
1) Which Scheduling Algorithm is mentioned in this question?
2) Write and Compile C code of Algorithm mentioned above in Linux. Also display
result according to Table 2.
3) Also draw the Gantt chart of Algorithm according to Table 2
4) Compute and Compare from Table 2
a) Waiting time for all processes
b) Average Waiting time
c) Turn Around Time for all processes
d) Average Turn Around Time

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

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps with 2 images

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

Problem 4 Discrete Mathematics.Combinations and Permutations. (5,10,10): Soccer A local high school soccer team has 20 players. However, only 11 players play at any given time during a game. In how many ways can the coach choose 11 players To be more realistic, the 11 players playing a game normally consist of 4 midfielders, 3 defend ers, 3 attackers and 1 goalkeeper. Assume that there are 7 midfielders, 6 defenders, 5 attackers and 2 goalkeepers on the team 2. In how many ways can the coach choose a group of 4 midfielders, 3 defenders, 3 attackers and 1 goalkeeper? 3. Assume that one of the defenders can also play attacker. Now in how many ways can the coach choose a group of 4 midfielders, 3 defenders, 3 attackers and 1 goalkeeper?
Problem (Konigsberg Bridge Problem Updated): In Konigsberg, there are two additional bridges, besides the seven that were present in the eighteenth century. These new bridges connect regions B and C and regions B and D, respectively. 1. Check whether it is possible to start from one region, visit all regions, and return to the starting point while visiting each region exactly once. 2. Is it possible to cross all nine bridges in Konigsberg exactly once and return to the starting point? Good Luck!
B1. a. Find the recurrence relation and the initial conditions for the sequence 3,17,73,297 --
2. Show that each of the following formulas are both satisfiable and falsifiable. (a) y Vxp(x, y). (b) Vr (p(x) V q(x)) → (Vxp(x)) v (Vxq(x)) (c) Vx (yp(x,y) →yq(x, y)).
InstructionsSolve for the following problems numerically using Manual solutions and using Python Code (Numpy)Question 2. Prove the equality of the following trigonometric functions using Euler identities. Furtherprove the equality in Python. Furthermore, plot the left-hand side and right-hand side of the equation andtheir Euler forms as additional proof.
Please answer Parts D and E of this problem
5. Let f:X→Y and g:Y→Z be one-to-one correspondences. (a) Prove that g◦fmust be a one-to-one correspondence. (b) Prove that (g◦f)−1=f−1◦g−1.
PROBLEM 4 Translate each of the following English statements into logical expressions. The domain of discourse is the set of all real mumbers. (a) The reciprocal of every positive mumber less than one is greater than one. (b) There is no smallest mumber. (c) Every number other than 0 has a multiplicative inverse.
Discuss on the need for numerical approximation of solutions to different equations.
State the generalized pigeonhole principle.
Use the Python code for Gauss-Seidel method to solve problem 11.13 to a tolerance of ε s=10^-10. i need code as well.