Question: [8] This exercise is about the bit-wise operators in C. Complete each function skeleton using only straight-line code (i.e., no loops, conditionals, or function calls)
![[8] This exercise is about the bit-wise operators in C. Complete](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f50cefd223a_66366f50cef4721d.jpg)
[8] This exercise is about the bit-wise operators in C. Complete each function skeleton using only straight-line code (i.e., no loops, conditionals, or function calls) and limited of C arithmetic and logical C operators. Specifically, you are only allowed to use the following eight operators: ! ~,&,,+ >. - For more details on the Bit-Level Integer Coding Rules on p. 128/129 of the text. A specific problem may restrict the list further: For example, to write a function to compute the bitwise xor of x and y, only using & , int bitxor(int x, int y) { return ((x&~y) | (~x & y));} (a) /* copyLSbit:Set all bits of result to least significant bit of x * Example: copyLSB(5) = 0xFFFFFFFF, copyLSB(6) = 0x00000000 * Legal ops: ! & | + > */ int copyLSbit(int x) { return 2; } (b) /* negate - return -x * Example: negate(1) = -1. = * Legal ops:! | + > */ int negate(int x) { return 2; } (c) /* isEqual return 1 if x == y, and 0 otherwise * Examples: isEqual(5,5) = 1, isEqual(4,5) = 0 * Legal ops: ! & | + > */ int isEqual(int x, int y) { return 2; }
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
