Perform the following operations by converting the operands to 2’s complement binary  numbers and then doing the addition or subtraction shown. Please show all work in binary, operating on  8-bit numbers. Is there an overflow? (a) 48 + 96 (b) -45 - 28 (c) -67 - (-41)

Assume that a mad scientist has created a computer that has 12-bit registers (storage). The most significant bit is the sign bit. He wants to execute the following computation using 12-bit register. 124-435 (Subtract decimal 435 from decimal 124) Use 2's complement method (in binary) to find the result of the above operation in binary system. Then convert the result back to decimal to check your answer. NOTE: Please don't do the subtraction in decimal! Show all the computations in the answer. Paragraph В I +v Add a File Record Audio

the following operation: write the operand as 4-bit 2's complement binary numbers, perform the process shown, show all work in binary operating on 4-bit numbers, and •   identify overflow if necessary 2 - 4

in ASM (Irvine 32) write a code that solves  R = (A % B) % (C % D). Note that ABC are 8 bit signed integers and % is the operator modulo  which holds the division operation remainder.

Use the following data declarations. Assume that the offset of byte Val is 00000000: .data byte Val sbyte 1,2,3.-7h word Val word 1000h.2000h 3000h, 4000h dwordVal dword 34567890h, 90785634h, 1234674Sh Show the value of the final destination operand after each of the following code fragments has executed: (If any instructions is invalid, indicate "INV" as the answer and briefly explain why) a. moy di 2 mov al, byte Val[di] b. mov bx, word Val mov esi, offset wordVal+4 xchg bx, [esi] R c. movsx cx, byte Val+3 d. mov ax, word ptr [dwordVal mov bl. byte ptr [dwordVal +10] e. mov al, 80h number add al 40h signed ;signed number answer al-= answer bx= answer (show your answer in binary) CX- answer |esi= answer bl= SF=

Using bitwise operators, what would be the best way to multiply/divide 208 and 416.Show your steps clearly to receive credit. Also, express your solution in C logic. You donot need to write the whole code.  you may utilize addition and subtractionoperations. However, majority of the computations must be done using bitwise operations.

Question 5: Based on the for 32-bit division hardware diagram shown in the next page. Perform the division for 4 bits unsigned integers. Where the dividend is 1011 and the divisor is 0010. Write the division table, with header steps, action, quotient, divisor, and remainder. Divisor 64-DRALU Remainder 64 bits Shift right 64 bits While Control best Quotient Shill left Convert the dividend, divisor, and the calculated results in question (5-1) to decimal to verify your results. Consider the number -1.36875 x 10¹ as the dividend and 5.625 x 10¹ as the divisor. Find their binary representation. Put the results that you got it in question (5-3) in the 8-bit quarter-precision format (1 for sign bit, 2 for exponent, and 5 for fraction) 1. floating-point number. Use the IEEE 754 standard. 2. signed integer. e. Show all the steps of the division to results that you got it in question (5-4). Indicate if there is overflow or underflow by assuming that there is a guard bit, a round bit, and a…

I do not understand how to do this help please

Explain what the following MIPS code does: (do not explain each line but explain what these two lines of codes do together) li $v0, 5syscall