Answer:
See explanation
Explanation:
My explanation to the author is that:
The reduction in size of the attachment doesn't mean that some parts of the book (i.e. the attachment) has been deleted.
I'll also made him understand that the book will retain its original size and contents after downloading by the recipient of the mail.
Answer:
So then the value of the maximum I/O wait that can be tolerated is 0.720 or 72 %
Explanation:
Previous concepts
Input/output operations per second (IOPS, pronounced eye-ops) "is an input/output performance measurement used to characterize computer storage devices like hard disk drives (HDD)"
Solution to the problem
For this case since we have 4GB, but 512 MB are destinated to the operating system, we can begin finding the available RAM like this:
Available = 4096 MB - 512 MB = 3584 MB
Now we can find the maximum simultaneous process than can use with this:
And then we can find the maximum wait I/O that can be tolerated with the following formula:
The expeonent for p = 14 since we got 14 simultaneous processes, and the rate for this case would be 99% or 0.99, if we solve for p we got:
So then the value of the maximum I/O wait that can be tolerated is 0.720 or 72 %
The simulation, player 2 will always play according to the same strategy.
Method getPlayer2Move below is completed by assigning the correct value to result to be returned.
Explanation:
- You will write method getPlayer2Move, which returns the number of coins that player 2 will spend in a given round of the game. In the first round of the game, the parameter round has the value 1, in the second round of the game, it has the value 2, and so on.
#include <bits/stdc++.h>
using namespace std;
bool getplayer2move(int x, int y, int n)
{
int dp[n + 1];
dp[0] = false;
dp[1] = true;
for (int i = 2; i <= n; i++) {
if (i - 1 >= 0 and !dp[i - 1])
dp[i] = true;
else if (i - x >= 0 and !dp[i - x])
dp[i] = true;
else if (i - y >= 0 and !dp[i - y])
dp[i] = true;
else
dp[i] = false;
}
return dp[n];
}
int main()
{
int x = 3, y = 4, n = 5;
if (findWinner(x, y, n))
cout << 'A';
else
cout << 'B';
return 0;
}
Answer:
a. The network will not satisfy the customers because the required addresses is 128 but what can be offered is 126.
b. 195.200.0.0/22
Explanation:
195.200.0.0/16
The number of bits to give 512 is 9
2^9=512
2^8=256 which is not up to our expected 320 customers that requires a network ip
Note we have to use a bit number that is equal or higher than our required number of networks.
The number of host per each subnet of the network (195.200.0.0/25) is (2^7)-2= 128-2=126
The network will not satisfy the customers because the required addresses is 128 but what can be offered is 126.
b. 64 customers requires 6 bits to be taken from the host bit to the network bit
i.e 2^6 = 64
195.200.0.0/22
The number of host per each subnet of the network (195.200.0.0/22) is (2^10)-2=1024 - 2 = 1022 hosts per subnet
This network meet the requirement " 64 customers want 128 addresses/customer "
