Answer:
hi,hi,hi,hi,hi,hi,hi,hi,hi,hi,hi,hi,hi
import java.util.Scanner;
public class JavaApplication58 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println("Enter a positive integer:");
String num = scan.nextLine();
for (int i = num.length()-1; i >=0; i--){
System.out.println(num.charAt(i));
}
}
}
I hope this helps!
The answer is B bc obliteration is related to covering the document
Answer:
By Using the Greedy- Activity- Selection algorithm
Explanation:
The Greedy- Activity- Selection algorithm in this case involves
First finding a maximum size set S1, of compatible activities from S for the first lecture hall.
Then using it again to find a maximum size set S2 of compatible activities from S - S1 for the second hall.
This is repeated till all the activities are assigned.
It requires θ(n2) time in its worse .
Answer:
I would say false
Explanation:
Threads can be add to anything there is no say in where you should add the thread and into what
