You need to use bitwise to solve this question--- tmaz(),tmin(),fitsBits(x,n),is

Question

You need to use bitwise to solve this question--- tmaz(),tmin(),fitsBits(x,n),isLessOrEqual(x,y),IsAsciiDigit(x),howManyBits as graph which is shown below.

But I do not need any code. This is an example you should follow which is shown below, You are required to use specific examples to show that. Give me process!

int bitAnd(6, 5)

The binary for 6 is 0110

The binary for 5 is 0101

6&5. ->0100, changed to decimal, it must be 2^2=4

Explanation / Answer

tmin() -shift the '1' bit for 31 times so that we get 10000000000000000000000000000000 and the 2's complement of it this

howManyBits(x) - for this we can get in the following manner,

For eg: consider 4 for getting 2's compliment of 4 we first write it in binary format it's binary format is 100 and the 2's complement of it is 100. if we take less no of bits than 3 we cannot get the complement.

isLessOrEqual(x,y)- if x<=y then automatically bit representation of x <= bit representation of y and viceversa.

Related Questions

Navigate

• Browse (All)
• Browse Y
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.