Chapter 2, Problem 2.59HW

Explanation of Solution

C expression for given statement:

The C expression for word containing of least significant byte of “x” and the remaining bytes “y” is shown below.

Expression: (x & 0xFF) | (y & ~0xFF)

From the above expression,

• First, performing the “&” operation for “x” and “0xFF”, then the result producing “0x000000EF”.
• Then performs the “&” operation for “y” and “~0xFF”, then the result producing “0x76543200”.
• After performing “|” operation that is “(x & 0xFF) | (y & ~0xFF)”, the final result is “0x765432EF”.

Program:

For the above expression “(x & 0xFF) | (y & ~0xFF)”, a complete program has been developed in the below section:

//Header file

#include <stdio.h>

#include <assert...