Lab. No 12 Feed Back Scheme Direction: Feedback scheme.

Lab. No 12 Feed Back Scheme Direction: Feedback scheme. #include #include usingnamespace std; structprocess { int pid; int atime; int btime; int rtime; int priority; int stime; int etime; }; structmycomp { booloperator()(constprocess& lhs, constprocess& rhs) const { return lhs.priority > rhs.priority; } }; void printproc(process arr[],int n) { printf("\nPROCESS TABLE"); for(int i=0;i, mycomp> q1; queue q2; int time=0,turn; turn = 0; int quanta=4,rquanta=4; int flag1=0; while((!q1.empty())||(!q2.empty())||(flag1==0)||(turn0) q2.push(q1.top()); q1.pop(); quanta=4; } } elseif(!q2.empty()) { q2.front().rtime = q2.front().rtime-1; printf("\nIn RR rtime for %d is : %d",q2.front().pid,q2.front().rtime); chart[time]=q2.front().pid; rquanta--; if(q2.front().rtime==0) { q2.pop(); rquanta=4; } elseif(rquanta==0) { printf("\trquanta is zero, removing and adding at end %d",q2.front().pid); q2.push(q2.front()); q2.pop(); rquanta=4; } } printf("\nAt time= %d Current Chart: ",time); for(i=0;i<=time;i++) printf("%d",chart[i]); printf("\n"); time= time+1;} printf("\nCurrent Chart: "); for(i=0;i<=time;i++) printf("%d",chart[i]); printf("\n"); for(i=0;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