Answer:
The answers are: it is used to enable fast DNS queries and It can help reduce the amount of network traffic generated by DNS servers.
Explanation:
Because a DNS server can resolve a query from tis local data sends a recursive qyery to a root server.
Answer:
Parity Bit
Explanation:
Given that Parity bit is a form of strategy or method that utilizes a scheme in adding a solitary bit to a binary string. This can be either 1 or 0, thereby making the total quantity of bit to become either odd parity bit or even parity bit during storage.
Hence, the technique that uses a scheme to sum the individual digits in a number and stores the unit's digit of that sum with the number is called PARITY BIT.
Explanation:
so, what do you think ?
I am sure you have used a computer or a smart phone yourself.
how many clicks or taps do you want to do before you you get what you were looking for ?
hmmmm ?
as few a possible, right ?
ideally, of course, this is one (1) click or tap.
Answer:
public static int maxMagnitude(int a, int b){
int max;
if (a>b){
max = a;
}
else{
max = b;
}
return max;
}
The complete program calling the method is given in the explanation section
Explanation:
import java.util.Scanner;
public class ANot {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
System.out.println("Please Enter two numbers");
int num1= in.nextInt();
int num2 = in.nextInt();
System.out.println("The largest magnitude number is: "+maxMagnitude(num1,num2));
}
public static int maxMagnitude(int a, int b){
int max;
if (a>b){
max = a;
}
else{
max = b;
}
return max;
}
}
The maxMagnitude() method uses if/else statement to compare two ints and return the larger one
