Lab No 6 First Come First Serve (FCFS) Algorithm

Perhaps, First-Come-First-Served algorithm is the simplest scheduling algorithm. Processes are dispatched according to their arrival time on the ready queue. Being a non-preemptive discipline, once a process has a CPU, it runs to completion. The FCFS scheduling is fair in the formal sense or human sense of fairness but it is unfair in the sense that long jobs make short jobs wait and unimportant jobs make important jobs wait. FCFS is more predictable than most of other schemes since it offers time. FCFS scheme is not useful in scheduling interactive users because it cannot guarantee good response time. The code for FCFS scheduling is simple to write and understand. One of the major drawback of this scheme is that the average time is often quite long. The First-Come-First-Served algorithm is rarely used as a master scheme in modern operating systems but it is often embedded within other schemes. Direction: FCFS(first come first serve) in C++. #include using namespace std; int main() { int n,bt[20],wt[20],tat[20],avwt=0,avtat=0,i,j; cout<<"Enter total number of processes(maximum 20):"; cin>>n; cout<<"nEnter Process Burst Timen"; for(i=0;i>bt[i];} wt[0]=0; //waiting time for first process is 0 //calculating waiting time for(i=1;i

Comments

Post a Comment

Popular posts from this blog

Magnifier- Magnifying Glass Privacy Policy

    Privacy Policy App built the Magnifier app as a Free app. This SERVICE is provided by App at no cost and is intended for use as is. This page is used to inform visitors regarding my policies with the collection, use, and disclosure of Personal Information if anyone decided to use my Service. If you choose to use my Service, then you agree to the collection and use of information in relation to this policy. The Personal Information that I collect is used for providing and improving the Service. I will not use or share your information with anyone except as described in this Privacy Policy. The terms used in this Privacy Policy have the same meanings as in our Terms and Conditions, which are accessible at Teleprompter unless otherwise defined in this Privacy Policy. Information Collection and Use For a better experience, while using our Service, I may require you to provide us with certain personally identifiable information. The information that I request will be retai
Read more

Boot Windows Oops, we get this horrible error! new method

Image
Whenever you use a partitioning tool against an installed system, there's a chance of a problem, filesystem corruption and who knows what else. There is no guarantee for success. Re-partitioning of installed operating systems is risky. This is why you should always create your setup BEFORE installations, so you never have to face this kind of problem. Repair unbootable Windows installation Following the instructions, we will boot from the Windows installation disc. Click on Repair your computer: And you will see this menu: Let Windows repair itself. It should do a pretty good job. Indeed, we're up and running. Windows 7 will start booting and recommend you run check disk against your disk, offering yet another hint that the resizing procedure messed things up a little. You should indeed let the tool run. And soon, you'll see the login menu: And here we can see the changes in My Computer and the Disk Management. One thing that Windows 7 does not report corr
Read more

Lab. No 8 Shortest Job First Operating System

Lab. No 8 Shortest Job First Shortest-Job-First (SJF) is a non-preemptive discipline in which waiting job (or process) with the smallest estimated run-time-to-completion is run next. In other words, when CPU is available, it is assigned to the process that has smallest next CPU burst. The SJF scheduling is especially appropriate for batch jobs for which the run times are known in advance. Since the SJF scheduling algorithm gives the minimum average time for a given set of processes, it is probably optimal. The SJF algorithm favors short jobs (or processors) at the expense of longer ones. The obvious problem with SJF scheme is that it requires precise knowledge of how long a job or process will run, and this information is not usually available. Like FCFS, SJF is non-preemptive therefore; it is not useful in timesharing environment in which reasonable response time must be guaranteed. Direction: Shortest Job First Algorithm In C++. #include #include void main() { int i, j, n, proce
Read more