Dark Mode

Recent questions tagged k-map

0 votes

0 answers

1

Self doubts
Minimal SOP and POS forms are always Identical. true or false?

JAINchiNMay asked in Digital Logic Nov 9

91 views

0 votes

1 answer

2

simplify the following logic functionf(ABC)USING k-MAP f(ABC)=(A+B+C') .(A+B'+C')
simplify the following logic functionf(ABC)USING k-MAP f(ABC)=(A+B+C') .(A+B'+C')

saba780 asked in Digital Logic Apr 26

206 views

3 votes

5 answers

3

NIELIT 2016 DEC Scientist B (IT) - Section B: 45
Which will be the equation of simplification of the given K-map? $AB' + B'CD' + A'B'C'$ $AB' + A'B'D' + A'B'C'$ $B'D' + AB' + B'C'$ $B'D' + A'B'C' + AB'$

Lakshman Patel RJIT asked in Digital Logic Mar 31, 2020

by Lakshman Patel RJIT

848 views

2 votes

2 answers

4

NIELIT 2016 DEC Scientist B (CS) - Section B: 45
What will be the equation of the given K-map? $A’B’D’+C’D+AB’C’$ $B’CD’+AB’C’+A’C’$ $B’D’+C’D$ $C’D+B’CD’$

Lakshman Patel RJIT asked in Digital Logic Mar 31, 2020

by Lakshman Patel RJIT

480 views

1 vote

5 answers

5

Minimization doubt in DIGITAL LOGIC

Gitika Babbar asked in Digital Logic Jun 14, 2019

by Gitika Babbar

2.0k views

0 votes

1 answer

6

Morris Mano Edition 3 Exercise 3 Question 27 (Page No. 113)
Simplify the Following boolean function by means of the tabulation method. (a) P(A,B,C,D,E,F,G)=$\sum(20,28,52,60)$ (b) P(A,B,C,D,E,F,G)= $\sum(20,28,38,39,52,60,102,103,127)$ (C) P(A,B,C,D,E,F) = $\sum(6,9,13,18,19,25,27,29,41,45,57,61)$

ajaysoni1924 asked in Digital Logic Apr 2, 2019

by ajaysoni1924

2.1k views

2 votes

1 answer

7

Morris Mano Edition 3 Exercise 3 Question 25 (Page No. 112)
Implement the following boolean function F together with the don’t-care conditions d using no more than two NOR gates. Assume both normal and the compliment inputs are available. F(A,B,C,D) = $\sum(0,1,2,9,11) $ $d(A,B,C,D) = \sum(8,10,14,15)$

ajaysoni1924 asked in Digital Logic Apr 2, 2019

by ajaysoni1924

2.5k views

0 votes

1 answer

8

Morris Mano Edition 3 Exercise 3 Question 24 (Page No. 112)
A logic circuit implements the following Boolean function: F = A’C + AC’D’ it is found that the circuit input combination A=C=1 can never occur. Find a simpler expression for F using the proper don't-care conditions.

ajaysoni1924 asked in Digital Logic Apr 2, 2019

by ajaysoni1924

1.9k views

0 votes

0 answers

9

Morris Mano Edition 3 Exercise 3 Question 23 (Page No. 113)
Simplify the boolean function F together with the don’t care conditions d in (1) sum of products and (2)product of sums. (A) $F(w,x,y,z) = \sum(0,1,2,3,7,8,10)$ $d(w,x,y,z) = \sum(5,6,11,15)$ (b) $F(A,B,C,D) = \sum (3,4,13,15)$ $d(A,B,C,D) =\sum(1,2,5,6,8,10,12,14)$

ajaysoni1924 asked in Digital Logic Apr 2, 2019

by ajaysoni1924

428 views

0 votes

0 answers

10

Morris Mano Edition 3 Exercise 3 Question 22 (Page No. 112-113)
Simplify the following boolean function F together with the don’t care condition d; then express the simplified function in the sum of minterms. (a)$F(x,y,z)=\sum(0,1,2,4,5) $ $d(x,y,z)= \sum(3,6,7)$ (b) $F(A,B,C,D) = \sum(0,6,8,13,14)$ $d(A,B,C,D) = \sum(2,4,10)$ (C) $F(A,B,C,D) = \sum(1,3,5,7,9,15)$ $d(A,B,C,D)= \sum(4,6,12,13)$

ajaysoni1924 asked in Digital Logic Apr 2, 2019

by ajaysoni1924

381 views

2 votes

1 answer

11

Morris Mano Edition 3 Exercise 3 Question 11 (Page No. 112)
Draw the AND-OR gate implementation of the following function after simplifying it in (a) sum of products and (b) product of sums. F= (A,B,C,D) = $\sum (0,2,5,6,7,8,10)$

ajaysoni1924 asked in Digital Logic Apr 1, 2019

by ajaysoni1924

906 views

0 votes

0 answers

12

Morris Mano Edition 3 Exercise 3 Question 10 (Page No. 112)
Simplify the following boolean expressions into (1) Product of sums (2) sum of products. x’z’ + y’z’ + yz’ + xy AC’ + B’D + A’CD + ABCD (A’ + B’ + D’)(A + B’ + C’)(A’ + B + D’)(B + C’ + D’)

ajaysoni1924 asked in Digital Logic Apr 1, 2019

by ajaysoni1924

439 views

0 votes

0 answers

13

Morris Mano Edition 3 Exercise 3 Question 9 (Page No. 111)
Simplify the following boolean functions in product of sums: F(w,x,y,z) = $\sum(0,2,5,6,7,8,10)$ F(A,B,C,D) = $\prod(1,3,5,7,13,15)$ F(x,y,z) = $\sum(2,3,6,7)$ F(A,B,C,D) = $\prod(0,1,2,3,4,10,11)$

ajaysoni1924 asked in Digital Logic Apr 1, 2019

by ajaysoni1924

395 views

0 votes

0 answers

14

Morris Mano Edition 3 Exercise 3 Question 8 (Page No. 111)
Simplify the following boolean function using five variable maps. F(A,B,C,D,E) = $\sum (0,1,4,5,16,17,25,21,29)$ F(A,B,C,D,E) = $\sum (0,2,3,4,5,6,7,11,15,16,18,19,23,27,31)$ F= A’B’CE’ + A’B’C’D + B’D’E’ + B’CD’ + CDE’ + BDE’

ajaysoni1924 asked in Digital Logic Apr 1, 2019

by ajaysoni1924

1.2k views

0 votes

0 answers

15

Morris Mano Edition 3 Exercise 3 Question 7 (Page No. 111)
Simplify the following boolean functions by first finding the essential prime implicants. F(w,x,y,z) = $\sum (0,2,4,5,6,7,8,10.13,15)$ F(A,B,C,D) = $\sum (0,2,3,5,7,8,10,11,14,15)$ F(A,B,C,D) = $\sum (1,3,4,5,10,11,12,13,14,15)$

ajaysoni1924 asked in Digital Logic Apr 1, 2019

by ajaysoni1924

272 views

0 votes

0 answers

16

Morris Mano Edition 3 Exercise 3 Question 6 (Page No. 111)
Find the Minterms of the each of the following expression by first plotting each function in the map. xy + yz + xy’z C’D + ABC’ +ABD’ + A’B’D wxy + x’z’ + w’xz

ajaysoni1924 asked in Digital Logic Apr 1, 2019

by ajaysoni1924

470 views

2 votes

0 answers

17

Morris Mano Edition 3 Exercise 3 Question 5 (Page No. 111)
Simplify the following boolean expressions using Four variable K-maps. w’z + xz + x’y + wx’z B’D + A’BC’ + AB’C + ABC’ AB’C + B’C’D’ + BCD + ACD’ + A’B’C + A’BC’D wxy + yz + xy’z + x’y

ajaysoni1924 asked in Digital Logic Apr 1, 2019

by ajaysoni1924

627 views

Page:

1
2
3
4
next »

Recent questions tagged k-map