) Consider two CPU scheduling algorithms for a single CPU: Preemptive Shortest-JobFirst (also known as Shortest Remaining Time First) and Round-Robin. Assume that no time is lost during context switching. Given five processes with arrival times and expected CPU time as listed below, draw a Gantt chart to show when each process executes using a) Preemptive Shortest-Job-First (Shortest Remaining Time First). b) Round-Robin with a time quantum of 5. Of course, assume that the expected time turns out to be the actual time. Process Arrival Time Expected CPU Time P1 0 14 P2 2 9 P3 4 10 P4 8 4 P5 17 7

Is a string of code written to hurt others by damaging or destroying

What percentage of companies is projected to use social media to locate new employees in 2012

You need to design a circuit that implements the functions in the following table: s0 s1 function0 0 a + 10 1 a – b1 0 a + b1 1 a – 1s0 and s1 are 1-bit control inputs to select the function of the circuit. inputs a and b are 4-bitnumbers in 2s complement form. the output is also a 4-bit number in 2s complement form.you are allowed to use only one ttl 7483 4-bit adder to implement all the functions. but anynumber of other components (except the adder) can be used.hint: design a combinational logic circuit to modify the input b and the “carry input” of theadder depending on the control inputs s0 and s1.important: lab grade will depend on the working of the circuit & will be checked of by your labinstructor.1. is the output valid for the following input combinations: a. s0 = 0, s1 = 0, a = 7, b = 3? b. s0 = 0, s1 = 1, a = 7, b = 3? c. s0 = 1, s1 = 0, a = -4, b = -5? d. s0 = 1, s1 = 1, a = -8, b = 6? 2. what is the range of inputs (for both a and b) that will produce the valid output for all the functions?