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.
Interval between the time of submission and completion of the job is? Ans. Turnaround time is the interval in between the time of submission and completion of the job.
Compare single bus structure and multiple bus structure? A system that having only one bus(i.e only one transfer at a time) is known as a single bus structure. A system is know
What is Cursor? Cursor is a database object used by applications to manipulate data in a set on a row-by- row basis, instead of the typical SQL commands that operate on all the
Q. Describe about full adder? Let's take full adder. For this other variable carry from previous bit addition is added let'us call it 'p'. Truth table and K-Map for this is dis
Period and Space Tradeoffs - artificial intelligence: In practice, you are going to stop your agent for long term using in searching goal at some stage if it has not found a s
advantages of dda line algoritm
Q. What is Indirect Addressing Mode explain? Indirect Addressing Mode In the indirect addressing modes operands employ registers to point to locations in memory. So it is
FACSIMILE : This is often known as 'fax' and it represents the interface between reprographic and computer technology. By using fax, the contents of a sheet of paper (text or illu
Main Objectives: Uploading codes into the microcontrollers Interfacing between both microcontrollers via I 2 C Reading and writing into various ports on the MCU Int
Q. Explain working of Bit Serial Associative Processor? When associative processor accepts bit serial memory organization subsequently it is known as bit serial associative pr
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