left[0]=a[0];
for(int i=1;i<=n-1;i++)
left[i]=(left[i-1]*a[i])%M;
right[n-1]=a[n-1];
for(int i=n-2;i>=0;i--)
right[i]=(right[i-1]*a[i])%M;
for query q
if(q==0)
return right[1]%M;
if(q==n-1)
return left[n-2]%M;
return (left[q-1]*right[q+1])%M;
Answer:
kinesthetical
Explanation:
please give brainliest please and good luck :)
Answer:
z = a.c' + a.b.d' + b.c'.d'
Explanation:
The truth table for this question is provided in the attachment to this question.
N.B - a' = not a!
The rows with output of 1 come from the following relations: 01 > 00, 10 > 00, 10 > 01, 11 > 00, 11 > 01, 11 > 10
This means that the Boolean expression is a sum of all the rows with output of 1.
z = a'bc'd' + ab'c'd' + ab'c'd + abc'd' + abc'd + abcd'
On simplification,
z = bc'd' + ab'c' + ac'd' + ac'd + abc' + abd'
z = ac' + abd' + bc'd'
Hope this helps!
Since resistance and current are inversely proportional, when the resistance doubles, the current is cut in half.
Answer: C. File encryption
Explanation: To ensure security and privacy of files and its content, encrypting the file may be an option. File encryption refers to a process of ensuring the security and privacy of individual files so as to prevent unauthorized access to the content. File encryption works by setting up a security key which will be requested or needed when the file is being clicked such that only users or individuals with the authorized pass code or password can open and read its content or modify the file, this is called file decryption.
