Write a C++ program to convert a decimal value to an eight-bit two's complement binary number. Let the user enter a decimal whole number X, either positive or negative, and output the equivalent two's complement binary number. The value of X will range between -128 <= X <= 127. Error check input size. Output to the screen, each X and its eight-bit two's complement equivalent separated by a space, =, and then another space. Refer to the sample output below. Sample Runs (2): Enter a value: 15 15 = 00001111 Enter a value: -49 -49 = 11001111

Write a C++ program that asks the user to enter a positive integer n and then that reads n user input integers and finally prints the message The numbers you entered are in increasing order if they are in increasing order or the message The numbers you entered are NOT in increasing order if they are not. See the remark below. Remark:- Remember given the numbers a1, az, as, ..., an; we say they are in increasing order if ay 5 a, 5 a,≤ .... ≤ an. Moreover remember that if you have only one number from the user input then the number automatically is in increasing order.(CAN ONLY USE WHILE LOOPS)

Write a program using signed 8-bit variables that computes finalVal = 2*X + 3*Y - Z. X, Y, and Z should be variables that are created in your .data section. Additionally, start with X = 1; Y should be set to five times the value of X. Z should be two times the value of X. Only X should be set in the data section; Y and Z should start uninitialized and then set in the main procedure as described. Create the program in assembly to compute finalVal. Does the value that is computed make sense (show work). In separate runs of the program double your value of X continuing to set the values for X, Y, and Z such that Y = 5X and Z = 2X until the value stored in finalVal no longer make sense. What are the values of X, Y, and Z before and after the result stored is correct. Show the contents in memory and describe why the value in finalVal no longer makes sense.

Question 2. Write a Program to replace all 0’s with 1 in a given integer. Given an integer as an input, all the 0’s in the number has to be replaced with 1. For example, consider the following number Input: 102405Output: 112415 Input: 56004Output: 56114 DM your S.