(Question 2) A ring counter utilizes one flip flop for each state in its sequence. It has the advantage that decoding gates are not required. If a 10-bit ring counter as shown in Figure 2 has the initial state 1010000000, determine the waveform for each of the Q outputs. PRE CLR CLK Qo Qo Q Q D D D D D D D D 2/6

Design the following combinational logic circuit with a four-bit input and a three-bit output. The input represents two unsigned 2-bit numbers: A1 A0 and B1 B0. The output C2 C1.C0 is the result of the integer binary division A1 A0/B1 B0 rounded down to three bits. The 3-bit output has a 2-bit unsigned whole part C2 C1 and a fraction part CO. The weight of the fraction bit CO is 21. Note the quotient should be rounded down, i.e. the division 01/11 should give the outputs 00.0 (1/3 rounded down to 0) not 00.1 (1/3 rounded up to 0.5). A result of infinity should be represented as 11.1. A minimal logic implementation is not required. (Hint: start by producing a truth table of your design).

Question 37 Use Boolean algebra to simplify the following logic gate circuit: A B C Output

6- Set BX to 4567H, CX to FEDCH and SP to A59FH, then run the instructions: PUSH BX PUSH CX a. What is the new value of SP ? b. Display the memory locations where you pushed the values of BX and CX in the stack.