Scribd
Upload
21 views2 pages

Tutorial 2 - KKKL2163 - 20182019

This document outlines a tutorial on digital electronics that includes 9 problems involving simplifying logic terms and equations using Quine McCluskey and Karnaugh maps, designing digital circuits from logic equations, comparing input values, implementing functions using logic gates, identifying hazards in circuits, and designing hazard-free circuits. The problems involve tasks such as minimizing logic expressions, drawing truth tables, designing circuits using different gate types including NAND and NOR gates, and realizing functions with a minimum number of gates.

Uploaded by

Muhd Hijazz Farhan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views2 pages

Tutorial 2 - KKKL2163 - 20182019

This document outlines a tutorial on digital electronics that includes 9 problems involving simplifying logic terms and equations using Quine McCluskey and Karnaugh maps, designing digital circuits from logic equations, comparing input values, implementing functions using logic gates, identifying hazards in circuits, and designing hazard-free circuits. The problems involve tasks such as minimizing logic expressions, drawing truth tables, designing circuits using different gate types including NAND and NOR gates, and realizing functions with a minimum number of gates.

Uploaded by

Muhd Hijazz Farhan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

PROGRAM KEJURUTERAAN ELEKTRIK DAN ELEKTRONIK

FAKULTI KEJURUTERAAN DAN ALAM BINA

KL2163 – Digital Electronics

Tutorial 2

1. Simplify the following terms, equations and truth table using Quine McCluskey
and confirm the results using Karnaugh Map.

(a) 𝐹 = 𝑝̅ 𝑞𝑟 + 𝑝𝑞̅ 𝑟 + 𝑝𝑞𝑟

(b) 𝐴 = ∏𝑀(4,8,10,14,15) + ∑𝑑 (7,9,11)

(c)

2. You are given the following equation

𝑓 = ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
(𝑤 + 𝑥̅ ). (𝑧𝑦̅ + 𝑥 )

(a) Draw a digital circuit for the equation

(b) Convert the equation using a De Morgan’s theorem and design a


circuit using NOR-OR gates only.

3. You are asked to design a digital circuit that compare 2-bit input A and 2-bit
input B. If A is higher or equal to B, the output F will be “I”, otherwise it is “0”.
(a) Draw the truth table.
(b) Obtain the minimal SOP expressions using Karnaugh Map.
(c) Draw the circuit for the design.
(d) Draw the circuit using NAND gates only.
PROGRAM KEJURUTERAAN ELEKTRIK DAN ELEKTRONIK
FAKULTI KEJURUTERAAN DAN ALAM BINA

4. Implement 𝑓 (𝑎, 𝑏, 𝑐, 𝑑 ) = ∑ 𝑚(3,4,5,6,7,11,15) as two levels gate circuit, using a


minimum number of gates.
(a) Use AND gates and NAND gates
(b) Use OR gates and NAND gates
(c) Use NAND gates only

5. Realise each of the following functions as a minimum two-level NAND-gate


circuit and as a minimum two-level NOR-gate circuit:
(a) 𝑓 (𝑎, 𝑏, 𝑐, 𝑑 ) = ∑ 𝑚(0,2,5,10) + ∑ 𝑑 (3,6,9,13,14,15)
(b) 𝑓 (𝑎, 𝑏, 𝑐, 𝑑 ) = ∏ 𝑀(0,1,7,9,10,13). ∏ 𝐷(2,6,14,15)

6. A combinational switching circuit has four inputs (A,B,C,D) and one output (F).
F=0 if three or four of the inputs are 0.
(a) Write the maxterm expansion for F.
(b) Using AND and OR gates, find a minimum three-level circuit to realize F.

7. A two-level, NOR-NOR circuit implements the function:


𝑓 (𝑎, 𝑏, 𝑐, 𝑑 ) = (𝑎 + 𝑑̅ )(𝑏̅ + 𝑐 + 𝑑)(𝑎̅ + 𝑐̅ + 𝑑̅ )(𝑏̅ + 𝑐̅ + 𝑑)
(a) Find all hazards in the circuit.
(b) Redesign the circuit as two-level, NOR-NOR circuit free of all hazards and
using minimum number of gates.

8. Consider the following logic function:


𝑓 (𝑎, 𝑏, 𝑐, 𝑑 ) = ∑ 𝑚(0,2,5,6,7,8,9,12,13,15)
(a) Realise the functions as a minimum OR-AND circuit.
(b) Find all hazards in the circuit.
(c) Find an OR-AND circuit for F that has no hazards.

9. Find all hazards in the following circuit equations, and realise the hazard free
equation.
𝐹 = [(𝑎 + 𝑏𝑐 )𝑑 + (𝑏̅ + 𝑎𝑐̅)𝑑̅ ]𝑎̅𝑏

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy