15.2 Boolean Algebra and Logic Circuits (3)

Resources | Revision Questions | Computer Science

Login to see all questions

Click on a question to view the answer

1.

The Boolean function f(x, y, z) is defined as the sum of the minterms in the following truth table:

xyzf(x, y, z)
0000
0011
0100
0111
1000
1010
1101
1111

Construct a Karnaugh map to simplify the Boolean expression for f(x, y, z). State the simplified Boolean expression in terms of x, y, and z.

2.

Consider a system requiring a counter that increments on each clock pulse. Compare and contrast the use of JK flip-flops versus D flip-flops in implementing such a counter. Highlight the key differences in their operation and the resulting impact on the counter's functionality and design.

3.

Describe the operation of both SR and JK flip-flops, including their truth tables and identifying their key advantages and disadvantages. Consider how these differences impact their suitability for different digital logic applications.