1. (25 pts) Convert the following C++ pseudo code to ASM:

if (A > B){ B = A; } if (A > C) { C = A; } else if(A == C) { D= A; }

2. (25 pts) Convert the following MASM code into a higher order language form (like C++, Java, C#)

mov eax, 20 mov ebx, 30

cmp eax, ebx jge then1 jle then2 jmp next

then1: mov eax, 30 jmp next then2: mov eax, 40 jmp next next:

3. (10 pts) What value or values is pushed onto the stack when the CALL mnemonic is called? What happens on the stack the END mnemonic is called?

4. (30 pts) Given the below statement

mov al, 0Fh mov bl, 06h mul bl

What values are in AX? Show how the two numbers would be multiplied together in binary.

5. (10 pts) Given the following number in 2 byte hexadecimal, ABCD, what is value of the in number in decimal if the number is read in as a big endian? Little endian?