charles babbage is the father of computer's
The answer is False. <span>To keep your audience interested in your speech, you should do the ff techniques :
</span><span>1. Talk about something your audience is interested in
</span><span>2. Tell them why they should listen
</span><span>3. Don’t make it too easy or too hard
</span><span>4. “Change grabs attention”
</span><span>5. Tell stories
</span><span>6. Have frequent breaks
</span><span>7. Make it short</span>
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.
Answer:
//Code is created using java
import java.util.*;
// returns the sum
public int sum(int N)
{
if(N==1)
return (1);
else
return N+sum(N-1);
}
// code to return the Bipower ouput
public int BiPower(int N)
{
if(N==1)
return (2);
else
return 2*BiPower(N-1);
}
// Code to return TimesFive output
public int TimesFive(int N)
{
if(N==1)
return 5;
else
return 5 + timesFive(N-1);
}
public static void main(String args[])
{
//Prompts the user to enter a nonnegative integer
int N = Integer.parseInt.(console.readLine("Enter a nonnegative integer: "));
//Outputs the sum, Bipower and TimesFive
System.out.println(sum(n));
System.out.println(BiPower(n));
System.out.println(TimesFive(n));
}
}
Algorithm is part of computer science. You an learn it on Khan academy. (you probably werent looking for this but no one was answering)
