Bissoy.com
Doctors Medicines MCQs Q&A

Which of the following criteria(n) is/are being used to compare the CPU scheduling algorithms? A. Throughput B. CPU utilization C. Waiting time D. Response time

Which of the following criteria(n) is/are being used to compare the CPU scheduling algorithms? A. Throughput B. CPU utilization C. Waiting time D. Response time Correct Answer A, B, C and D

The correct answer is option 4.

Concept:

CPU Scheduling is a process of determining which process will own CPU for execution while another process is on hold. All Cpu scheduling algorithms use various parameters which are,

Arrival Time: Time at which the process arrives in the ready queue.

Schedule time: Time at which the process arrives ready to running state.

Completion Time: Time at which the process arrives running to terminate state.

Burst Time:  Time spends the process running state.

Turn Around Time:

Turn Around Time= Completion Time – Arrival Time.

Waiting Time:

Waiting time is the total time spent by the process in the ready state waiting for the CPU.

Response time:

Response time is the difference between first execution time and Arrival time.

CPU utilization:

CPU utilization refers to a computer's usage of processing resources or the amount of work handled by a CPU.

Throughput:

Throughput is the amount of work completed in a unit of time.

Throughput = no .of process completed / time taken.

Hence the correct answer is A, B, C, and D.

Related Questions

One of the Scheduling method is also known as Shortest-­next­-CPU­-burst algorithm, because scheduling through this method depends on the length of the next CPU burst of a process rather than its total length. Which of the following scheduling method is being discussed here?
Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?
Consider an arbitrary set of CPU – bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?
Which among the following is/are most appropriate for introducing the topic "comparison of size of different objects" in class I : a: Observe different objects and compare. b: Measure using non-standard units and compare. c: Measure using standard units and compare. d: Superimpose the objects and compare.
Given below are some famous algorithms and some algorithm design paradigms Algorithms Design Paradigm  1. Dijkstra's shortest path algorithms  (a) Greedy design  2. Floyd-Warshall's all-pair-shortest path algorithms  (b) Divide and conquer  3. Kruskal's minimum spanning tree algorithm  (c) Dynamic programming  4. Merge Sort algorithm     Which of the following correspondence is correct?
What is the full form of the abbreviation RLWL in relation to trains? A. Regret Loss Waiting List B. Remote Location Waiting List C. Railway Location Waiting List D. Railway List Waiting Locked
Consider the following statements: Non-performing assets (NPAs) decline in value when 1. Demand revives in the ecnomy. 2. Capacity utilization increases. 3. Capacity utilization, though substantive, is yet sub-optimal. 4. Capacity utilization decreases consequent upon merger of unit. Which of the above statement are correct?
A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. The total CPU utilization is?
A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. The total CPU utilization is ____________
According to Bode stability criterian, a system is unstable, if the open loop frequency response exhibits an amplitude ratio exceeding unity at frequency for which phase lag is