Answer:
Give me brainliest thanks
Answer:
5,10; 6,12; 7,14
Explanation:
We will demonstrate the iteration of the loop:
First iteration: Number = 7, Count = 5 at the beginning. We will check if Count <= Number? Since it is correct, prints 5,10. Increment the Count by 1.
Second iteration: Number = 7, Count = 6. We will check if Count <= Number? Since it is correct, prints 6,12. Increment the Count by 1.
Third iteration: Number = 7, Count = 7. We will check if Count <= Number? Since it is correct, prints 7,14. Increment the Count by 1.
Forth iteration: Number = 7, Count = 8. We will check if Count <= Number? Since it is not correct, the loop stops.
Answer:
The answer is A
Explanation:
Basically, Shortest job first (SJF) is a scheduling policy that selects jobs on queue for execution within a short execution time.
From the definition of SJF above, it means that there are a lot of process on queue and the (SJF) job is to receive processes on queue to execute within a short execution time.
Therefore, if all the jobs or process arrives at the SJF at the same time, the SJF will forfeit one of its major purpose which is scheduling of jobs.
That will therefore not make Non-preemptive Shortest Job First (SJF) not function at its optimal point.
Required: program to return the largest of three numbers.
pseudocode
input parameters, int A,B,C;
int T; // temporary storage
if (A>B) T=A;
else T=B;
if (T>C) print(T);
else print(C);
