Write a program that takes in a positive integer as input, and outputs a string of 1's and O's representing the integer in reverse binary. For an integer x, the algorithm is: As long as x is greater than 0 Output x 2 (remainder is either 0 or 1) x = x / 2 Note: The above algorithm outputs the 0's and 1's in reverse order. Ex: If the input is: 6 the output is: 011 6 in binary is 110; the algorithm outputs the bits in reverse. 1 import java.util.Scanner; 2 8695 AWNH 3 public class LabProgram { 4 7} public static void main(String[] args) { /* Type your code here. */

1. Convert 1337g to decimal (base 10) Use sum of expansion of products (don't skip steps!)

In single precision (IEEE-754 standard), 8 bits are used for storing the exponent (the bias is 127), and 23 bits are used for storing the mantissa.  (a) What are the smallest and the largest positive numbers that can be stored in single precision? (b) What is the smallest value of the mantissa that can be stored?

please answer the follwoing question regarding assemly

with a detailed step-by-step process, convert the following decimal numbers into binary, IEEE 754 and hexadecimal formats. i) -142.62 ii) 1/(2.25).

just convert to binary, don't bother with hex

Compute floating-point addition(binary)and multiplication(binary) for the following inputs 1.001 x 2-4 and 1.010 x 2-5

-128 64 32 -128 1 -128 64 32 0 0 -120--128 16 -128 64 32 1 0 0 (a) An eight-position two's complement value box 16 0 8 16 0 4 8 0 4 0 2 (b) Convert binary 10000011 to decimal 4 0 2 1 +2 2 0 1 8 1 +8 (c) Convert decimal -120 to binary 1 1 +1=-125 1 0

Briefly explain bitwise multiplication

Convert the following expressions from reverse Polish notation to infix notation. U V W X Y Z + * - * - X Y Z + V W – * Z - + X Z + W / X Z - W / - Show details of conversion