Question

9. The following C-like code calculates the greatest common divisor (GCD) of the two 8-bit positive integers a and b (Aside: This is Euclid's algorithm from 300 BC). Complete the HLSM for the code (Answers are case sensitive) Inputs: byte a, byte b, bit go Outputs: byte gcd, bit done GCD while (1) ( while (!go); done 0 while (a!-b){ if(a>b){ a-a b else gcd-a done 1 Inputs: go (bit), a, b (8 bits) Outputs: done (bit), ged (8 bits) Local Registers: a reg (8 bits), b_reg (8 bits) a reg b reg) a reg:-a reg -b rejg a rega bregb doneo b reg b reg-a reg gcd:- Y done-Z 10. For problem 9, assume the input a-00011110, b-01010100, answer the output gcd in 8-bit format. gcd-

Answer 1

ns- Gvena 00011110 b = o101 01 00 GCD = greatest common divisor 0 GCD二 2