Your task is to calculate the quotient and the remainder when 60 is divided by 17. You will assume that both numbers are represented as unsigned 6-bit binary numbers. You will produce a complete division-table like the one shown on slide no. 4 of Chapter 3 (part 2). Fill out all cells of the table with the appropriate steps and the register values. You should use appropriate-size registers for dividing two 6-bit binary numbers. You need to first show all the steps of decimal to binary number conversion, and then present the division table.
. In chapter 3, we learnt about integer division. Your task is to calculate the quotient and the
remainder when 60 is divided by 17. You will assume that both numbers are represented as
unsigned 6-bit binary numbers. You will produce a complete division-table like the one shown on
slide no. 4 of Chapter 3 (part 2). Fill out all cells of the table with the appropriate steps and the
register values. You should use appropriate-size registers for dividing two 6-bit binary numbers.
You need to first show all the steps of decimal to binary number conversion, and then present the
division table. You can learn about decimal to binary number-conversion here:
https://www.geeksforgeeks.org/convert-decimal-fraction-binary-number/


Trending now
This is a popular solution!
Step by step
Solved in 3 steps









