A hyperlink is a link that can direct a person to another website when clicked. So the answer would click on the link to go directly to a website. To insert an image or sound you would use something else. And a hyperlink doesn't restrict a person to just the publisher information. I hope this helps!
There will be 1 person going, and there will be no secretary at the meeting
Answer:
Sky blueeeee!!
Explanation:
It's the color of my eyes. And I just like it ^^
Answer:
An interpreter is quite different from a complier due to the following statement below:
O. An interpreter translates and executes code line by line, while a compiler translates all code at once so that it is ready to be executed at any time.
Explanation:
For an interpreter, it works in translating and execution of the codes line after another line. In a situation where there is a mistake in the code, the next line would not be able to be executed, but rather display error message. On the other hand, compiler translate all codes at once and execute them as a single work.
<em>During its translation of the codes in compiler, should there be any error, it would not be able to execute despite the fact that, the error might be in the last line of the code.</em>
Answer:
- public class Main {
-
- public static void main (String [] args) {
-
- for(int i = 2; i < 10000; i++){
- if(isPrime1(i)){
- System.out.print(i + " ");
- }
- }
-
- System.out.println();
-
- for(int i = 2; i < 10000; i++){
- if(isPrime2(i)){
- System.out.print(i + " ");
- }
- }
- }
-
- public static boolean isPrime1(int n){
-
- for(int i=2; i <= n/2; i++){
- if(n % i == 0){
- return false;
- }
- }
-
- return true;
- }
-
- public static boolean isPrime2(int n){
-
- for(int i=2; i <= Math.sqrt(n); i++){
- if(n % i == 0){
- return false;
- }
- }
-
- return true;
- }
- }
<u></u>
Explanation:
Firstly, create the first version of method to identify a prime number, isPrime1. This version set the limit of the for loop as n/2. The for loop will iterate through the number from 2 till input n / 2 and check if n is divisible by current value of i. If so, return false to show this is not a prime number (Line 22 - 26). Otherwise it return true to indicate this is a prime number.
In the main program, we call the isPrime1 method by passing the i-index value as an argument within a for-loop that will iterate through the number 2 - 10000 (exclusive). If the method return true, print the current i value). (Line 5 - 9)
The most direct way to ensure all the prime numbers below 10000 are found, is to check the prime status from number 2 - 9999 which is amount to 9998 of numbers.
Next we create a second version of method to check prime, isPrime2 (Line 31 - 40). This version differs from the first version by only changing the for loop condition to i <= square root of n (Line 33). In the main program, we create another for loop and repeatedly call the second version of method (Line 13 - 17). We also get the same output as in the previous version.
