MSE7_merged_merged

Module 7 Summary Exercises Due Aug 13 at 11:59pm Points 31 Questions 14 Available Aug 5 at 12am - Aug 13 at 11:59pm Time Limit 1,440 Minutes Allowed Attempts 2 Instruc � ons Score for this attempt: 27 out of 31 Submitted Aug 11 at 4:07pm This attempt took 68 minutes. Instruc � ons These exercises are based on the concepts introduced in Module 7. I encourage you to attempt these exercises twice, especially as a learning and study aid. You will have two attempts, each of which will last for 24 hours, and only the top score will be counted. You are allowed any resources (including explorations, Ed Discussions, Teams, classmates, the internet, etc...). Good luck! Take the Quiz Again 2 / 2 pts Question 1 Match the instruction to its purpose. STD Set direc � on fl ag - String CLD Clear direc � on fl ag - Strin Module 7 Summary Exercises: COMPUTER ARCH & ASSEM LA... https://canvas.oregonstate.edu/courses/1923269/quizzes/2877677/take?... 1 of 7 8/11/2023, 7:03 PM

Other Incorrect Match Options: • Set direction flag - String primitives will increment ESI/EDI • Clear direction flag - String primitives will decrement ESI/EDI 2 / 2 pts Question 2 Which of the following string primitives will compare the BYTE stored in the memory locations pointed to by EDI to the contents of the AL register? SCASB MOVSB LODSB CMPSB STOSB 2 / 2 pts Question 3 If the string direction flag is not set, string operations will move backward through the string. True False Module 7 Summary Exercises: COMPUTER ARCH & ASSEM LA... https://canvas.oregonstate.edu/courses/1923269/quizzes/2877677/take?... 2 of 7 8/11/2023, 7:03 PM

Neither Macros Nor Procedures Both Macros and Procedures Procedures 2 / 2 pts Question 7 Which structure is the following true for? _________ have a return mechanism involving the system stack. Both Macros and Procedures Macros Procedures Neither Macros Nor Procedures 2 / 2 pts Question 8 Which structure is the following true for? _________ have a calling mechanism involving the EIP. Both Macros and Procedures Neither Macros Nor Procedures Macros Module 7 Summary Exercises: COMPUTER ARCH & ASSEM LA... https://canvas.oregonstate.edu/courses/1923269/quizzes/2877677/take?... 4 of 7 8/11/2023, 7:03 PM

Procedures 3 / 3 pts Question 9 Suppose that a program's data and executable code require 1,024 bytes of memory. A new section of code must be added; it will be used with various values 82 times during the execution of a program. When implemented as a macro, the macro code requires 79 bytes of memory. When implemented as a procedure, the procedure code requires 103 bytes (including parameter-passing, etc.), and each procedure call requires 7 bytes. How many bytes of memory will the entire program require if the new code is added as a procedure? 1,701 1,701 2 / 2 pts Question 10 Which of the following postfix expressions corresponds to the given infix expression? 1 + 2 * (4 - 2) / 4 ^ (1 + 1) 1 2 4 2 - * 4 1 1 + ^ / + 1 2 4 2 - * 4 / 1 1 + ^ + 1 2 4 2 - * 4 1 ^ 1 + / + Module 7 Summary Exercises: COMPUTER ARCH & ASSEM LA... https://canvas.oregonstate.edu/courses/1923269/quizzes/2877677/take?... 5 of 7 8/11/2023, 7:03 PM

2 / 2 pts Question 13 The IA-32 FPU is directly connected to the ALU via internal bus. True False 2 / 2 pts Question 14 Which of the following infix notations corresponds to the given FPU manipulations? FINIT FLD A FLD B FLD C FSUB FLD D FLD E FMUL FDIV FADD FSTP Z Z = A + (B - C) / D * E Z = A + (B - C) / (D * E) Z = A + B - C / (D * E) Z = (A + B - C) / (D * E) Quiz Score: 27 out of 31 Module 7 Summary Exercises: COMPUTER ARCH & ASSEM LA... https://canvas.oregonstate.edu/courses/1923269/quizzes/2877677/take?... 7 of 7 8/11/2023, 7:03 PM

8/5/23, 3:18 PM Module 7 Summary Exercises: COMPUTER ARCH & ASSEM LANGUAGE (CS_271_400_U2023) https://canvas.oregonstate.edu/courses/1923269/quizzes/2877677 1/8 Module 7 Summary Exercises Due Aug 13 at 11:59pm Points 31 Questions 14 Available Aug 5 at 12am - Aug 13 at 11:59pm Time Limit 1,440 Minutes Allowed Attempts 2 Instructions Score for this attempt: 31 out of 31 Submitted Aug 5 at 3:16pm This attempt took 23 minutes. Instructions These exercises are based on the concepts introduced in Module 7. I encourage you to attempt these exercises twice, especially as a learning and study aid. You will have two attempts, each of which will last for 24 hours, and only the top score will be counted. You are allowed any resources (including explorations, Ed Discussions, Teams, classmates, the internet, etc...). Good luck! Take the Quiz Again 2 / 2 pts Question 1 If the string direction flag is not set, string operations will move backward through the string. True False 8/5/23, 3:18 PM Module 7 Summary Exercises: COMPUTER ARCH & ASSEM LANGUAGE (CS_271_400_U2023) https://canvas.oregonstate.edu/courses/1923269/quizzes/2877677 2/8 2 / 2 pts Question 2 Which of the following string primitives will copy a BYTE from the AL register to the memory location pointed to by EDI ? STOSB SCASB MOVSB CMPSB LODSB 2 / 2 pts Question 3 Which of the following string primitives will copy a BYTE from the memory location pointed to by ESI to the memory location pointed to by EDI ? STOSB MOVSB CMPSB SCASB LODSB 2 / 2 pts Question 4

8/5/23, 3:18 PM Module 7 Summary Exercises: COMPUTER ARCH & ASSEM LANGUAGE (CS_271_400_U2023) https://canvas.oregonstate.edu/courses/1923269/quizzes/2877677 5/8 Suppose that a program's data and executable code require 1,024 bytes of memory. A new section of code must be added; it will be used with various values 51 times during the execution of a program. When implemented as a macro, the macro code requires 76 bytes of memory. When implemented as a procedure, the procedure code requires 110 bytes (including parameter-passing, etc.), and each procedure call requires 8 bytes. How many bytes of memory will the entire program require if the new code is added as a procedure? 1,542 1,542 2 / 2 pts Question 10 Which of the following postfix expressions corresponds to the given infix expression? 56 / (42 * 4 * 2) + (256 / (128 - 64)) * 3 ^ 12 56 42 4 * 2 * / 256 128 64 - / 3 12 * ^ + 56 42 4 * 2 * 256 /128 64 - / 3 12 ^ * + 56 42 4 * 2 * / 256 128 64 - 3 12 / ^ * + 56 42 4 * 2 * / 256 128 64 - / 3 12 ^ * + 2 / 2 pts Question 11 8/5/23, 3:18 PM Module 7 Summary Exercises: COMPUTER ARCH & ASSEM LANGUAGE (CS_271_400_U2023) https://canvas.oregonstate.edu/courses/1923269/quizzes/2877677 6/8 Which of the following infix expressions corresponds to the given postfix expression? 2 3 ^ 5 4 * / 10 + 2 ^ (3 / (5 * 4)) + 10 2 ^ 3 / 5 * 4 + 10 2 ^ 3 / (5 * 4) + 10 2 ^ 3 / 5 * (4 + 10) 4 / 4 pts Question 12 Find the decimal value of the postfix (RPN) expression. Round answers to one decimal place (e.g. for an answer of 13.45 you would enter 13.5): 2 2 ^ 4 5 - / 6 * -24 -24 margin of error +/- 0.2 2 / 2 pts Question 13 Which instruction is used to convert an integer value to float and push it onto the FPU stack? FIPUSH

8/5/23, 3:18 PM Module 7 Summary Exercises: COMPUTER ARCH & ASSEM LANGUAGE (CS_271_400_U2023) https://canvas.oregonstate.edu/courses/1923269/quizzes/2877677 7/8 FILD FLD FINIT 2 / 2 pts Question 14 Which of the following FPU manipulations corresponds to the given infix notation? Z = A * (B / (C - D)) - E FINIT FLD A FLD B FMUL FLD C FDIV FLD D FLD E FSUB FSUB FSTP Z FINIT FLD A FLD B FLD C FLD D FSUB FDIV FMUL FLD E FSUB FSTP Z 8/5/23, 3:18 PM Module 7 Summary Exercises: COMPUTER ARCH & ASSEM LANGUAGE (CS_271_400_U2023) https://canvas.oregonstate.edu/courses/1923269/quizzes/2877677 8/8 FINIT FLD A FLD B FLD C FDIV FMUL FLD D FSUB FLD E FSUB FSTP Z FINIT FLD A FLD B FLD C FLD D FSUB FLD E FSUB FDIV FMUL FSTP Z Quiz Score: 31 out of 31

CMPSB Correct!

Which structure is the following true for? For _________, the entire code is substituted for each call. Macros Correct!

Which of the following postfix expressions corresponds to the given infix expression? 1 + 2 * (4 - 2) / 4 ^ (1 + 1)