Shortest Job First Algorithm:
Shortest Job First algorithm is a CPU scheduling algorithm, in which the process which has the smallest burst time is allocated to the CPU first. If the burst time of the two processes is the same then the First Come First Serve algorithm is used to break the tie. This algorithm provides minimum waiting time and maximum throughput.
The primary reason that makes the implementation so hard is to calculate the burst time.
Before the process execution, we don't know how much burst time the process will take in execution exactly. We calculate the approximate value of the burst time. If our approximate value calculation method doesn't work correctly then the performance of the system will decrease.
We calculate the burst time on the basis of the process which has already executed. So, this algorithm works on the predicted burst time but not on actual burst time.
We can calculate the burst time by two methods:
The static method is not so reliable because its prediction is not correct always. So, we use the dynamic method for burst time prediction.
operating system (5 points) Explain the primary reason that it is hard to implement a Shortest...
What is the other name for Shortest Job First Preemptive Algorithm? What are the 5 different states a process can be in scheduling (Look into process state diagram)? Shortest Job First is like Priority Scheduling with the priority based on ______ of the process? ________ effect is the primary disadvantage of First Come First Serve Scheduling algorithm. How does Multi Level Feedback queue prevent starvation of processes that waits too long in lower priority queue?
Given a system using the shortest-job-first algorithm for short-term scheduling and exponential averaging with α=0.5, what would be the next expected burst time for a process with burst times of 5, 8, 3, and 5, and an initial value for e1 of 10?
PLEASE EXPLAIN WHY??? WHAT IS THE TRUE REASON MANAGERS GIVE FOR MOST MERGERS? 5. The primary reason managers give for most mergers is to acquire more assets so as to increase sales and market share. a. True b. False ANSWER: False
1. Can an operating system implement the two operational modes (user vs system) if the hardware does not support a mode bit? Explain. 2. Give an example of an operating system that does not implement the dual-mode protection. 3. Explain the main difference that exists between multiprogramming and multitasking.
Question 5 (5 points) Apply Dijkstra's Algorithm to the following graph, computing the shortest path for al vertices from vertex A. Present the results after each vertex has been processed 3 20 B 47 20 You may wish to present the results in the format of the following table: Stage Current Vertex Labels and Distances A 0 A 0 D 231 A 213 E 4 F21 A 90 Each row states (a) the current stage, (b) the vertex just added...
14. (10 points) Using a binary search tree algorithm, draw and explain the tree that describes the following sentence. Discrete math is fun but sometimes hard. 14. (10 points) Using a binary search tree algorithm, draw and explain the tree that describes the following sentence. Discrete math is fun but sometimes hard.
Problem 4 Shortest Path Problem-15 points You are in the market for a new car and a new car costs $10,000. The annual operating costs and resale value of a used car are shown in the Table below. e of Car (Years) Resale Value (S) Costs (S) 300 (year 1) 500 (year 2) 800 (year 3) 1200 (year 4 1600 (year 5) 2200 (year 6) 8000 6000 5000 3000 1500 Assuming that you now have a new car, determine a...
1) A major function of an operating system is to implement system security and protection. List three common techniques used by an operating system to achieve this function. 2) Assume that all programs spend 1/2 of their time waiting for I/O. a) If there is one program loaded in memory what fraction of time will the processor be busy? b) If there are two programs loaded in memory what fraction of time will the processor be busy? 3) Which technology...
describe, in step-by-step form, the procedure that the operating system would use to switch from one user to another in a multiuser time sharing system. Discuss the steps that take place when a process is moved a) from ready state to running state; b) from running state to blocked state; c) from running state to ready state, and d) from blocked state to ready state. Explain deadlocking. The CPU scheduling algorithm (in UNIX) is a simple priority algorithm. The priority...
Plz explain all steps. Make it as simple as possible. Thx! An LTI system has impulse response h(n) - sin (a) Find a difference equation (with real coefficients) to implement the system. Show your work. (b) Find and sketch the poles and zeros of the system An LTI system has impulse response h(n) - sin (a) Find a difference equation (with real coefficients) to implement the system. Show your work. (b) Find and sketch the poles and zeros of the...