Implement following questions using NAND gate only:

Welcome back.

and 3 others joined a min ago.

96kviews

written 9.5 years ago by

teamques10 ★ 70k

modified 3.8 years ago by

pedsangini276 • 4.8k

i) F = ∑m (1,2,3,4,7,11,13) + d(9,15)
ii) F = ∏M (4,5,6,7,8,12) + d(1,2,3)

Mumbai University > ELECTRO > Sem 3 > Digital Circuits and Designs

Marks: 10M

Year: Dec 2013

digital circuits and design

ADD COMMENT EDIT

1 Answer

8.4kviews

written 9.5 years ago by

teamques10 ★ 70k

A Karnaugh map provides a pictorial method of grouping together expressions to minimize a given boolean function.

(i) Consider the following function.

F = ∑m (1,2,3,4,7,11,13) + d(9,15) It is given in terms of minterms, hence the minimized expression will be in the form of SOP. The K-map minimization of …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT

i think your second question (F = ∏M (4,5,6,7,8,12) + d(1,2,3)) figure is wrong...... the sign u've given of and gate ,,,,,,,while it should be or gate sign.

8.2 years ago by teamques10 ★ 70k

Community

Content

Company