Let the message be M : 1001 0001 and the generator function is G : 1001
Solution :
CRC sender
<u> </u>
1001 | 1001 0001 000
<u> 1001 </u>
<u> 0000 0001 </u>
1000
<u> 1001 </u>
0001 000
<u> 1 001 </u>
0001
Here the generator is 4 bit - 1, so we have to take three 0's which will be replaced by reminder before sending to received--
eg 1001 0001 001
Now CRC receiver
<u> </u>
1001 | 1001 0001 001
<u> 1001 </u>
0000 0001
<u> 1001 </u>
1000
<u> 1001 </u>
0001 001
<u> 0001 001 </u>
0000
No error
Answer:
Access installation through shared drive
Explanation:
Answer:
Explanation:
some distros like ubuntu do not even allow su to switch to root. furthermore the su to root is dangerous because the user becomes the all-powerful administrative account, so no warnings are issued if the application team user tries to do something system-breaking.
Answer: True
Explanation: But it depends on two factors that's the problem and the experience of the computer user support
Answer:
long power(int i)
{
return pow(2,i);
}
Explanation:
The above written function is in C++.It does not uses loop.It's return type is long.It uses the function pow that is present in the math library of the c++.It takes two arguments return the result as first argument raised to the power of second.
for ex:-
pow(3,2);
It means 3^2 and it will return 9.
