1) Write a function which counts the number of set bits (1) inside the second byte...

Transcribed Image Text:

1) Write a function which counts the number of set bits (1) inside the second byte from right of an integer. Example: - Integer: 346453838 - Binary: 00010100 10100110 01110111 01001110 Answer: 6 2) Write a function which detects whether the sequence "110" appears inside the second byte from right of an integer. Example: - Integer: 346453838 Binary: 00010100 10100110 01110111 01001110 Answer: Yes Integer: 5788886 - Binary: 00000000 01011000 01010100 11010110 Answer: No You can use the following function to print the bits of an integer. #include void print_bits(int number) { int i, count=0; for(i=31; i>=0; i--) { if (number & 1 < < i) { printf("1"); } else { printf("0"); } count++; if ((count>>3) < <3 == count) { printf(" ");} 1) Write a function which counts the number of set bits (1) inside the second byte from right of an integer. Example: - Integer: 346453838 - Binary: 00010100 10100110 01110111 01001110 Answer: 6 2) Write a function which detects whether the sequence "110" appears inside the second byte from right of an integer. Example: - Integer: 346453838 Binary: 00010100 10100110 01110111 01001110 Answer: Yes Integer: 5788886 - Binary: 00000000 01011000 01010100 11010110 Answer: No You can use the following function to print the bits of an integer. #include void print_bits(int number) { int i, count=0; for(i=31; i>=0; i--) { if (number & 1 < < i) { printf("1"); } else { printf("0"); } count++; if ((count>>3) < <3 == count) { printf(" ");}

Answer rating: 100% (QA)

source code file is submitted at httpsgithu... View the full answer