A set of 10 readings is stored in memory locations starting at XX50H. The readings are expected to be positive. Write a program to i check each reading to determine whether it is positive or negative ii reject all negative readings iii add all positive readings iv. store FF H in the memory location XX80 H when the sum exceeds 8 bits otherwise store the actual sum at XX80 H.

Problem D. Greatest Input file: Output file: standard input standard output Time limit: 2 seconds Memory limit: 64 megabytes You are given an even number N and an integer K and you have to find the greatest odd number M less than N such that the sum of digits in binary representation of M is at most K. Input 2 numbers. Output 1 number Examples standard input standard output 10 2 25 Note For case when N = 10, K = 2. Binary representation of 10 is 1010 and binary representation of 9 is 1001, hence greatest odd number less than 10 whose sum of digits in its binary representation is at most 2 is 9. Hence output is 9.

5. Hamming Codes a) Suppose we want an error correcting code that will allow all single-bit errors to be corrected for memory words of length 15. How many check bits are necessary? b) Suppose we are now working with memory words of length 8. We have already calculated that we need 4 check bits, and the length of all codewords will be 12. We now receive the following code word: 010011011111 Is this a legal codeword, assuming even parity? If not, where is the error?

Write a code that finds the number of zeros in 16 bit word in memory. Put comments explaing what you are doing