Answer:
Explanation:
Two ways of interpreting this question
(I) Shifting all the bits along with the choosen four,
in that case it will be i1>>2;
(ii) Just shifting the choosen four bits and keeping the remaining as it is.
It is equivalent to replacing the first four bits of i1 with i1>>2. let us call N = i1, and M = i1>>2.
max = ~0 //All one's
//1's through position 4, then all zeros
left = max - ((1<<4) - 1);
So we just have zeros between bits one to four and other are one.
Now final step;
(N&left) | m
Answer:
Check the explanation
Explanation:
The two examples for each type of violation:
A) Power failure and Act of sabotage
B) Accidental deletion of file and Permission failure
C) Tampering of data, Denial of service attack
D) Failures of HDD (hard disk) and finding program bugs.
Note:
There is a difference in trusted behavior for pc's and servers are relevant because pea-to-peer system must be designed to cope with the looser interpretation of trust for pi s
<span>The statement that the order or sequence of rules in a Prolog program is usually critical. is false. </span>Prolog programs are simply
knowledge bases. And knowledge bases are collections of facts and rules which describe some collection of relationships that we find interesting.
It's how you format your hard drive
