Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Explain non-pre-emptive algorithms?
Non preemptive algorithms: In this algorithm a job is provided to CPU for execution as long as the job is non-completed the CPU cannot be provided to other processes.
There are three kinds of non preemptive algorithms.
(i) First-come-first-serve (FCFS): This is simplest CPU scheduling algorithm. Along with this scheme, the process which requests the CPU at first is provided to the CPU at first. The implementation of First Come First Serve is easily managed through with a FIFO queue.
(ii) Shortest-job-first (SJF): It is also termed as SPN (shortest process next). In this algorithm the burst times of all the jobs that are waiting in the queue are compared. The job that is containing the least CPU execution time will be provided to the processor at first. In such turnaround time and waiting times are least. It also suffers along with starvation. Indefinite waiting time is termed as starvation. This is complex than FCFS.
(iii) Priority: In this method every job is related with CPU execution time, arrival time and the priority. Here the job that is containing the higher priority will be specified to the execution at first. It also suffers with starvation. And through using aging technique starvation effect may be decreased.
Name the four steps in pipelining. Fetch : Read the instruction from the memory. Decode : Decode the instruction and get the source operand. Execute : Perform the operat
What are the conditions that have to be met for a condition to be an invariant of the class? Ans) ? The condition should hold at the end of each constructor. ? The conditi
Modus ponens rule: In fact the general format for the modus ponens rule is as follows: like if we have a true sentence that states the proposition A implies proposition B and
A sorting method which uses the binary tree concept such that label of any node is larger than all the labels in the sub trees, is called A Sorting method which uses the binar
What are Language Processor Development Tools (LPDTs)? LPDT that is Language processor development tools focuses upon generation of the analysis phase of language processors. T
Remember, the value of α is between 0 and 1. Now, let us put some values of α and compute the speed up factor for increasing values of number of processors. We get that the S(N) k
Explain Time Division Switching. Time Division Switching: A switching component can be shared at the same time with number of active speech circuits. It is the principle of
Is it true that the Logical Database reads the data from the database tables using Select Statements. Yes. We are coding that in Database part of LDB.
Chains of Inference: Now we have to look at how to get an agent to prove a given theorem using various search strategies? Thus we have noted in previous lectures that, there i
The output of SR flip flop when S=1, R=0 is ? Ans. When for the SR flip-flop S=set i/p R=reset i/p, as S=1, R=0, Flip-flop will be set means output will be one.
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd