X; cout << Y; Z = X + Y; cout

Convert the following into Pep/9 assembly language:   #include <iostream> using namespace std;   int num   int main() {  cin >> num;  num = num % 16;  cout << "num=" << num << endl;  return 0; }   Hint for the %16 part: 0 % 16 = 01 % 16 = 12 % 16 = 2...14 % 16 = 1415 % 16 = 1516 % 16 = 017 % 16 = 1...30 % 16 = 1431 % 16 = 1532 % 16 = 0... Convert all the results to binary. What do they all have in common?

E In the following code block(Reference:Q11), you will a set of assembly instructions with corresponding line numbers (line numbers are for informational purpose only and they are not part of the source code). 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 mov edx, 5 dec ecx jmp LABEL1 mov eax, 1 LABEL1: mul edx jmp ecx mov edx, 0678h sub edx, eax jmp DWORD PTR [edx] neg ebx add ecx, ebx mov eax, 0 For each of the conditions/scenario listed below, indicate the corresponding line number (that cause or is associated with the condition/scenario). Enter 0 (Zero) if the condition is not caused by the block of code. 1) Memory indirect jump: type your answer... type your answer... type your answer... type your answer... 2) Register indirect jump: 3) Relative short jump: type your answer... 5) Two's complement type your answer... 4) Relative near jump: 6) Unreachable code

Convert the following into Pep/9 assembly language:   #include <iostream> using namespace std; int num int main() {  cin >> num;  num = num % 16;  cout << "num=" << num << endl;  return 0; }   Hint for the %16 part: 0 % 16 = 01 % 16 = 12 % 16 = 2...14 % 16 = 1415 % 16 = 1516 % 16 = 017 % 16 = 1...30 % 16 = 1431 % 16 = 1532 % 16 = 0... Convert all the results to binary. What do they all have in common?