I would say...
C: Use graphics and content for educational purposes in small amounts if you give the creator credit.
Answer:
Following are the code block in the Java Programming Language.
//define recursive function
public static long exponentiation(long x, int n) {
//check the integer variable is equal to the 0.
if (x == 0) {
//then, return 1
return 1;
}
//Otherwise, set else
else {
//set long data type variable
long q = exponentiation(x, n/2);
q *= q;
//check if the remainder is 1
if (n % 2 == 1) {
q *= x;
}
//return the variable
return q;
}
}
Explanation:
<u>Following are the description of the code block</u>.
- Firstly, we define the long data type recursive function.
- Then, set the if conditional statement and return the value 1.
- Otherwise, set the long data type variable 'q' that sore the output of the recursive function.
- Set the if conditional statement and check that the remainder is 1 and return the variable 'q'.
List, resumes, spread sheet, databases, contracts
Answer:
step 1:- start
step 2:-read principal amount, rate and time
step 3:- calculate interest using formula sI=((amount*rate*time)/100)
step 4:- print simple interest
step 5:- //CPP program to find compound interest for. //given values
Answer: Provided in the explanation section
Explanation:
The Question says;
Identify a logical operation (along
with a corresponding mask) that, when
applied to an input string of 8 bits,
produces an output string of all 0s if and
only if the input string is 10000001.
The Answer (Explanation):
XOR, exclusive OR only gives 1 when both the bits are different.
So, if we want to have all 0s, and the for input only 10000001, then we have only one operation which satisfies this condition - XOR 10000001. AND
with 00000000 would also give 0,
but it would give 0 with all the inputs, not just 10000001.
Cheers i hope this helped !!
