Question

(3) Use K-map to simplify the following expressions, and implement them with two-level NAND gate circuits:

(a) F(A,B,C,D)=A’B’C+AC’+ACD+ACD’+A’B’D’

(b) F(A,B,C)=(A’+B’+C’)(A’+B’)(A’+C’)

Answer #1

**I am providing hand written solution:**

**Here,we used de-morgan's law and k-map to
simplify and then NAND gates to build the expression.**

(a) Implement the following Boolean function F using the
two-level forms: AND-NOR and
OR-NAND , F = B'D'+ AC'D'+ACD+A'CD'
(b) Convert the above problem into standard POS, expression using
the truth table and minimize
using K-map.
(c) Design a combinational circuit with four inputs and one output.
The Algebraic expression
must be minimized using K-MAP. The output must be one for the
digits which are present in
your Roll Number Digits. Any duplications must be avoided.

Expand the following expression into minterms and then simplify
it using K-map.
F(A,B,C,D) = BC'D' + A'C'D + ACD + BCD + A'BD

Using K-map to simplify the following Boolean function:
F(A,B,C,D) = m(1,3,5,6,7,9,11,12,13,15)

Using K-map to simplify the following Boolean function:
F(A,B,C,D) = å
m(1,3,5,6,7,9,11,12,13,15)

simplify the following boolean expresions by use of k map
a'b' + bc + a'bc'
p'qr + pq'r' + pq'r
xy' + x'y

ENGR Logical Circuits
How many PROM AND array rows do you use to implement the
following function?
F1(A,B,C,D,E) = A'BCDE' + AC'D'E' + BCD'E

VIVA QUESTIONS: 1. Implement the following function using VHDL
coding. (Try to minimize if you can). F(A,B,C,D)=(A'+B+C).
(A+B'+D'). (B+C'+D') . (A+B+C+D) 2. What will be the no. of rows in
the truth table of N variables? 3. What are the advantages of VHDL?
4. Design Ex-OR gate using behavioral model? 5. Implement the
following function using VHDL code f=AB+CD. 6. What are the
differences between half adder and full adder? 7. What are the
advantages of minimizing the logical expressions?...

Logic Circuit
Problem #3
Given the following logic function: F(a,b,c,d) = ?
m(0,3,7,9,11,13,15)+?d(4,6,8) use a Karnaugh Map to, a) Find a
minimal SOP expression Answer: F(a,b,c,d) = b) Find a minimal POS
expression
Answer: F(a,b,c,d) =
Problem #4
Implement the function F(a,b,c,d) given in problem #3 using two
3-to-8 decoders, both active low enabled and active low output.
F(a,b,c,d) = ? m(0,3,7,9,11,13,15)+?d(4,6,8)
Answer:
Problem #5
Implement the function in the previous problem: F(a,b,c,d) = ?
m(0,3,7,9,11,13,15)+?d(4,6,8), using a single 4...

Simplify the following Boolean functions, using K-maps. Find all
the prime implicants, and determine which are essential:
(a) F (w, x, y, z) = ? (1, 4, 5, 6, 12, 14, 15)
(b) F (A, B, C, D) = ? (2, 3, 6, 7, 12, 13, 14)
(c) F (w, x, y, z) = ? (1, 3, 4, 5, 6, 7, 9, 11, 13, 15)

#9) You are to implement the following function
F(A,B,C,D,E,F) which outputs a 1 whenever the binary number
represented by ABCDE is ODD and 0 otherwise. A is the MSB and E is
the LSB.
Draw the function F(A,B,C,D,E,F) and show the work that led you
to that answer.
Since I am not so sadistic as to have you draw
the truth table of a 6 variable function and draw the K-map of such
a function, you should realize, as a...

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 6 minutes ago

asked 21 minutes ago

asked 27 minutes ago

asked 37 minutes ago

asked 39 minutes ago

asked 47 minutes ago

asked 54 minutes ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago