The SJF scheduling algorithm is non-preemptive unless specifically implemented as preemptive SRTF (Shortest Remaining Time First). In non-preemptive SJF, once a process is running, it continues until completion. Why Other Options are Wrong: a) SJF minimizes waiting time since shorter jobs are processed first. b) Starvation can occur if shorter jobs keep arriving, delaying longer ones indefinitely. c) It is optimal when job lengths are known in advance. e) SJF focuses on minimizing turnaround and waiting time
Select the correct mirror image of the given word when the mirror is placed along MN.
In the following question, select the related word pair from the given alternatives.
Poem: Poetry
Select the set of numbers that is similar to the following set.
(8, 75, 11)
Read the directions below and answer the following questions.
Six persons Monu, Gita, Dev, Sonu, Golu, and Uma live in a six-floored building....
Statement: Some serious mistakes were found in the technical section of a company.
Course of Action:
I. An efficient technical tea...
In the word ‘MEASUREMENT’ all consonants are written as their preceding letter and all vowels are written as their following letters. Now al...
Statements: L > M = N > O, O > P ≥ T = R
Conclusion:
I. L > T
II. L ≥ R
Looking at a family photo, F pointed to A and said, “She is my sister G’s father D’s sister E’s father B’s wife”. How is B related to F?
Eight persons D, E, F, G, H, I, J and K sit in a row facing north direction. I sits second to the left of G, who is not extreme right end. F is second p...
If you are the 25th person in a queue from one end and 36th from the other end, what is the total number of persons in the queue?