<u>Answer:</u>
I am writing <em>partial code in</em> <em>c++ to calculate weighted average</em>. The weighted average should be calculated based on multiplying the test score and its <em>respective weight and finally add all the test score.</em>
<u>Explanation:</u>
<em>int arrtestscore[100];</em>
<em>int arrweight[100];</em>
<em>int n;</em>
<em>double weightedavg;</em>
<em>cout<<”Enter the number of test score for which weighted average needs to be calculated”;</em>
<em>cin>>n;</em>
<em>for(int x = 0; x <n;x++)</em>
<em>{</em>
<em> cout<<”Enter test score :” + (x+1) ;</em>
<em> cin>>arrtestscore[x];</em>
<em> count<<”Enter the respective weight:”;</em>
<em> cin>>arrweight[x];</em>
<em>}</em>
<em>for (int i=0; i<n;i++)</em>
<em>{</em>
<em> weightedavg = weightedavg + (arrtestscore[i] * arrweight[i])</em>
<em>}</em>
<em>cout<<”weighted average = “ <<weightedavg; </em>
Answer:
No. This is not more secure.
Explanation:
this is not more secure than having all of Carol, bob and Alice having the same key.
alice would be able to know Carol's key for her to be able to verify the answer Carol gave to a challenge by her. she would also have to know bob's key to do the same.
any of these 3 would have to know someone else's secret key to verify answers to any challenge.
the challenge is to know the secret keys if the other two and if done, decryption can easily be done and they can impersonate.
Answer / Explanation:
195.200.0.0/16
Note: Class C address can not be assigned a subnet mask of /16 because class c address has 24 bits assigned for network part.
2ⁿ = number of subnets
where n is additional bits borrowed from the host portion.
2ˣ - 2 = number of hosts
where x represent bits for the host portion.
Assuming we have 195.200.0.0/25
In the last octet, we have one bit for the network
number of subnets = 2¹ =2 network addresses
number of host = 2⁷ - 2= 126 network addresses per subnets
Its 10, value always has to be positive.
Answer:
Sentences:
1.My computer has a virus
2.Technology may take over the world someday
Explanation:
