Question 1: Draw a circuit diagram for an encoder given the following table:

A	B	C	D	E	F	G	H	S2	S1	S0
1	0	0	0	0	0	0	0	0	0	1
0	1	0	0	0	0	0	0	0	1	0
0	0	1	0	0	0	0	0	0	1	1
0	0	0	1	0	0	0	0	1	0	0
0	0	0	0	1	0	0	0	1	0	1
0	0	0	0	0	1	0	0	1	1	0
0	0	0	0	0	0	1	0	1	1	1
0	0	0	0	0	0	0	1	1	1	1

Question 2: Draw a circuit diagram for a decoder given the following table:

A	B	C	D	E	F	G	H	S2	S1	S0
0	1	0	0	0	0	0	0	0	0	0
0	0	0	0	1	0	0	0	0	0	1
0	0	0	0	0	0	0	1	0	1	0
0	0	1	0	0	0	0	0	0	1	1
0	0	0	1	0	0	0	0	1	0	0
0	0	0	0	0	0	1	0	1	0	1
1	0	0	0	0	0	0	0	1	1	0
0	0	0	0	0	1	0	0	1	1	1

Question 3: Draw a circuit diagram for a multiplexer with 8 inputs.

Question 4: Design a simple 4-bit memory system using D flip-flops.

Question 5: Design a 3-bit ripple counter using T flip-flops. Include the corresponding timing diagram.

Question 6: Illustrate a finite state machine/diagram that accepts a string that meets the following criteria:

does not start with a

contains an instance of the pattern acbc

does not end with c

Question 7 uses a 3-bit "counter" that outputs the following repeating pattern: 2, 5, 1, 7, 4, 0, 6, 3 ...

Create a state table for your transitions. Use the convention of S for starting states and N for next states.

Create the Karnaugh bit maps and the minimal transition functions for the state table.

Create a circuit that implements this counter using JK flip-flops.