Hi there!
For #1 the answer is the site may not be trustworthy, and you risk identity theft. If you are not sure a site legit then don't trust it. Some sites can easy to tell if they can be trusted by the amount of detail put into the site itself, but others are not so easy to tell. In general, if a site does not have https:// in the web address, but instead has just http:// (no "s" in it) then don't trust it.
For #2 the answer is to use<span> a secure browser. If the browser you are using is insecure then the info you put into a site can be compromised and stolen by the browser itself because it reads all info put on it.
For #3 the answer is i</span><span>t has a secure payment page. Again going back to the https:// vs. the http:// if the page that you pay on is not secured then your credit card info can be stolen when put in because the site without a secured page will allow others with access to see your info.
-Your friend in tech, </span>ASIAX Frequent Answerer
Answer:
Explanation:
The following code is written in Java and like requested prompts the user for a number to continue or a letter to exit. Then loops and keeps adding all of the numbers to the sum variable and adding 1 to the count for each number entered. Finally, it prints the sum and the average using printf and the variables.
import java.util.Scanner;
class Examine1 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int sum = 0;
int count = 0;
System.out.println("Enter a number to continue or a letter to exit.");
while(in.hasNextInt()) {
System.out.println("Enter a number:");
sum += in.nextInt();
count += 1;
}
System.out.printf("The sum is %s.%n", sum);
System.out.printf("The average is %s.", (sum / count));
}
}
Answer: The FP-s are stored as sign (1.)111111111111 - number of bits.
Also 24 bits resolution there can be 23 zeros
Explanation:
The –1·2²⁴ might be stored as -1 · 1.00000000000000000000000(1 ←the 2⁰), it depends on how the FFP “engine” manages this, it may also be code specific a n+1–n does return 1 but 1–n+n does not. you should carry out a test for a specific compiler/computer
This is what javascript does with double (k+=1; n-=1) e.g
the (k+=2; n-=2) should be used to pass ±0x20000000000000
Answer:
sol 1,2 = (-b +- sqrt(b^2 -4ac))/2a
And rest is as in the image attached. I have added a flow chart.
Explanation:
Please check the attachment.