Originally posted on PH Bytes:
So the idea is to accumulate like a cumulative frequency. Put down the roots of programming and branch out with every new language while the trunk remains the same and strong! So, you have three parts. Root, Branches and Trunk. For the Roots part, I would suggest you to read…

Originally posted on PH Bytes:
To check if the number is multiple of 8, the bitwise way is that: first right shift by 3 and then left shift by 3. Multiple of 8 will remain the same as original number after this operation. Examples: 8:        1000 >> 3 :  0001 <<3  : …

Originally posted on PH Bytes:
C Program to count the set bits: #include int main() { int n = 15; int bits = 0; while(n) { bits = bits + 1; n = n & n-1; } printf(“The number of set bits are %dn”, bits); return 0; }

Originally posted on PH Bytes:
The day stands ahead. That day, where it would be difficult to judge on who deceived us. Was it a machine or a man? Was it a machine who said it was a man and deceived us OR was it a man who behaved like a machine and deceived us?…