11. (16 pts) Using a table similar to that shown in Figure 3.10, calculate 5710 divided by 13o using the hardware described in Figure 3.8. You should show the contents of each register on each step. Assume both inputs are unsigned 6-bit integers a. (1 pt) What's the binary value of 5710? Express as a 6-bit unsigned integer Place this value into the right 6 bits of the remainder field in the table below b. (1 pt) What about 130? Express as a 6-bit unsigned integer. Place the 6 bits into the high (first) 6 bits of the Divisor field (1 pt) When you add six 0's to the right end of the divisor, you are shifting it left 6 positions, or multiplying it by 246. What's the new number in decimal? c. A side note: that divisor you just calculated is what you're actually going to start off subtracting from the remainder. Then after each step, you'll divide the divisor by 2, discarding any fractional part, subtracting it from the remainder again. As you can see, you're going to have to divide the divisor in half a bunch of times before it's small enough to be subtracted from remainder with a result 20. That's how many steps you have to progress before you start inserting 1's into the quotient. d. (13 pts, 1 per step group) Complete the table below. I've provided what we all know is the answer at the end. Your job is to get there too. For division, stop after n+l steps 7 Divisor in Dec Remainder in Dec 13 57 Step Action Quotient Divisor Remainder 0 Load values 1.1 Remainder Rem Div DRemco,+Div, sll Q, 00-0 1.2 1.3 Shift Div right 2.1 Remainder Rem Div DRemco,+Div, sill Q, 00-0 2.2 2.3 Shift Div right 3.1 Remainder Rem Div Div, sll Q, 00-0_ DRem20, sll Q, Q0-1 3.3 Shift Div right 4.1 Remainder Rem Div ORem Using a table similar to that shown in Figure 3.10, calculate 5710 divided by 13o using the hardware described in Figure 3.8. You should show the contents of each register on each step. Assume both inputs are unsigned 6-bit integers a. (1 pt) What's the binary value of 5710? Express as a 6-bit unsigned integer Place this value into the right 6 bits of the remainder field in the table below b. (1 pt) What about 130? Express as a 6-bit unsigned integer. Place the 6 bits into the high (first) 6 bits of the Divisor field (1 pt) When you add six 0's to the right end of the divisor, you are shifting it left 6 positions, or multiplying it by 246. What's the new number in decimal? c. A side note: that divisor you just calculated is what you're actually going to start off subtracting from the remainder. Then after each step, you'll divide the divisor by 2, discarding any fractional part, subtracting it from the remainder again. As you can see, you're going to have to divide the divisor in half a bunch of times before it's small enough to be subtracted from remainder with a result 20. That's how many steps you have to progress before you start inserting 1's into the quotient. d. (13 pts, 1 per step group) Complete the table below. I've provided what we all know is the answer at the end. Your job is to get there too. For division, stop after n+l steps 7 Divisor in Dec Remainder in Dec 13 57 Step Action Quotient Divisor Remainder 0 Load values 1.1 Remainder Rem Div DRemco,+Div, sll Q, 00-0 1.2 1.3 Shift Div right 2.1 Remainder Rem Div DRemco,+Div, sill Q, 00-0 2.2 2.3 Shift Div right 3.1 Remainder Rem Div Div, sll Q, 00-0_ DRem20, sll Q, Q0-1 3.3 Shift Div right 4.1 Remainder Rem Div ORem