/* We do not support C11 . */

/*

* bitAnd - x&y using only ~ and |

* Example: bitAnd(6, 5) = 4

* Legal ops: ~ |

* Max ops: 8

* Rating: 1

*/

int bitAnd(int x, int y) {

return 2; /* # replace this */

}

/*

* getByte - Extract byte n from word x

* Bytes numbered from 0 (LSB) to 3 (MSB)

* Examples: getByte(0x12345678,1) = 0x56

* Legal ops: ! ~ & ^ | + << >>

* Max ops: 6

* Rating: 2

*/

int getByte(int x, int n) {

return 2; /* # replace this */

}

/*

* logicalShift - shift x to the right by n, using a logical shift

* Can assume that 0 <= n <= 31

* Examples: logicalShift(0x87654321,4) = 0x08765432

* Legal ops: ~ & ^ | + << >>

* Max ops: 20

* Rating: 3

*/

int logicalShift(int x, int n) {

return 2;/* # replace this */

}

/*

* fitsBits - return 1 if x can be represented as an

* n-bit, two's complement integer.

* 1 <= n <= 32

* Examples: fitsBits(5,3) = 0, fitsBits(-4,3) = 1

* Legal ops: ! ~ & ^ | + << >>

* Max ops: 15

* Rating: 2

*/

int fitsBits(int x, int n) {

return 2;/* # replace this */

}

/*

* negate - return -x

* Example: negate(1) = -1.

* Legal ops: ! ~ & ^ | + << >>

* Max ops: 5

* Rating: 2

*/

int negate(int x) {

return 2;/* # replace this */

}

/*

* isPositive - return 1 if x > 0, return 0 otherwise

* Example: isPositive(-1) = 0.

* Legal ops: ! ~ & ^ | + << >>

* Max ops: 8

* Rating: 3

*/

int isPositive(int x) {

return 2; /* # replace this */

}