Answer:
The risks associated with this kind of connectivity are that online hackers may see your information and that makes the human race too dependent on robots and technology which is never a good thing.
Explanation:
<h3>be happy</h3>
Answer:
import java.io.*;
public class Main
{
public static void main(String[] args) throws IOException {
BufferedReader bufferObject=new BufferedReader(new InputStreamReader(System.in));
String stringObject=bufferObject.readLine();
while(!stringObject.equals("99:99AM")){
System.out.println(convertedTime(stringObject));
stringObject=bufferObject.readLine();
}
}
public static String convertedTime(String stringObject){
String s=stringObject.substring(stringObject.length()-2);
String[] timeObject=stringObject.substring(0,5).split(":");
if(s.equals("AM")){
if(timeObject[0].equals("12")) return "00"+timeObject[1];
else return timeObject[0]+timeObject[1];
}
else{
if(timeObject[0].equals("12")) return "12"+timeObject[1];
else{
int hours=Integer.valueOf(timeObject[0]);
timeObject[0]=String.valueOf(12+hours);
return timeObject[0]+timeObject[1];
}
}
}
}
Explanation:
- Inside the main method run a while loop until stringObject is not equal to the string "99:99AM".
- Call the convertedTime method and display the results.
- Use the same hours and minutes except for 12th hour If the time is in AM.
- Use "00" instead of 12, if it is 12th hour.
- Add hours to 12, if the time is in PM and don't change anything in case of 12.
Answer:
See explanation below
Explanation:
Previos concepts
First Come First Serve (FCFS) "is an operating system scheduling algorithm that automatically executes queued requests and processes in order of their arrival".
Shortest job next (SJN), or the shortest job first (SJF) or shortest "is a scheduling policy that selects for execution the waiting process with the smallest execution time".
Shortest remaining time (SRF) "is a scheduling method that is a preemptive version of shortest job next scheduling'".
Round robin (RR) is an algorithm where the time parts "are assigned to each process in equal portions and in circular order, handling all processes without priority"
Solution for the problem
Assuming the dataset given on the plot attached.
Part a
For this algorithm the result would be:
Job A 0-6
Job B 6-(6+3) = 6-9
Job C 9-(9+1) = 9-10
Job D 10-(10+4) = 10-14
Part b
For this algorithm the result would be:
Job A 0-6
Job C 6-(6+1) = 6-7
Job B 7-(7+3) = 7-10
Job D 10-(10+4) = 10-14
Part c
For this algorithm the result would be:
Job A 0-1 until 14
Job B 2-(2+3) = 2-5
Job C 3-(3+2) = 3-5
Job D 9-(9+5) = 9-14
Part d
For this algorithm the result would be:
Job A 0-2 , 7-9, 12-14
Job B 2-4, 9-10
Job C 4-(4+1) = 4-5
Job D 5-7, 10-12
i dont know that game but ill see if i like it and if i do ill send u my ID number ok
