A scheduling algorithm assigns priority proportional to the waiting time of a p

Sail E0 Webinar

Question

A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?

Options:

A . This algorithm is equivalent to the first-come-first-serve algorithm.

B . This algorithm is equivalent to the round-robin algorithm.

C . This algorithm is equivalent to the shortest-job-first algorithm.

D . This algorithm is equivalent to the shortest-remaining-time-first algorithm.

Answer: Option B

-NA-

Was this answer helpful ?

Next Question

Submit Solution

More Questions on This Topic :

Question 1. Which of the following statements is/are FALSE? 1. For every non-deterministic Turing machine, there exists an equival....complementation. 4. Turing recognizable languages are closed under union and intersection.

Question 2. Which of the following statements are TRUE? 1. The problem of determining whether there exists a cycle in an undirecte....there exists a non-deterministic polynomial time algorithm to solve A.

Question 3. In a k-way set associative cache, the cache is divided into v sets, each of which consists of k lines. The lines of a s....mapped to any one of the cache lines from

Question 4. What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices? ....shortest path algorithm on a complete graph of n vertices?

Question 5. Which one of the following expressions does NOT represent exclusive NOR of x and y? ....

Question 6. Consider the following relational schema. Students(rollno: integer, sname: string) Courses(courseno: integer, cname: ....âˆ§ SR, 107, RP > Ïµ Registration âˆ§ RP>90)}

Question 7. Consider the following languages. L1 = {0p 1q 0r | p, q, r â‰¥ 0} L2 = {0p 1q 0r | p, q, r â‰¥ 0, p â‰ r....p â‰ r} Which one of the following statements is FALSE?

Question 8. A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of th....maximum possible value of x after all processes complete execution?

Question 9. Determine the maximum length of the cable (in km) for transmitting data at a rate of 500 Mbps in an Ethernet LAN with f....the signal speed in the cable to be 2,00,000 km/s.

Chapter 1 - GLOBAL STEEL SCENARIO & INDIAN STEEL INDUSTRY Part 1 : (13-04-2024) INDUSTRY AND COMPANY AWARENESS (ICA)

Direction Sense Test Part 1 Reasoning (Hindi)

Chapter 1 - RMHP / OHP / OB & BP Part 1 : (14-02-2024) GPOE

Cube & Cuboid Part 1 Reasoning (Hindi)

Data Interpretation (DI) Basic Concept Reasoning (Hindi)

Counting Figures Part 1 Counting Of Straight Lines Reasoning (Hindi)

Sail E0 free webinar Webinars

Real Numbers Part 7 Class 10 Maths

Real Numbers Part 1 Class 10 Maths

Polynomials Part 1 Class 10 Maths

DSP Combined 1 Free Revision Test SAIL JO E-0

GPOE / GPA Combined 1 Free Revision Test SAIL JO E-0

BSP Plant Specific Review Test SAIL JO E-0

BSL Combined 1 Free Revision Test SAIL JO E-0

GFM Combined 1 Free Revision Test SAIL JO E-0