Recent questions tagged k-map

+2 votes

0 answers

1

Essential prime implicants
Total number of essential prime implicants in the given K-map (x represents don't care) are ___ ?

asked Oct 31 in Digital Logic by kapilbk1996 (379 points) | 78 views

0 votes

1 answer

2

Prime implicants and essential implicants

asked Oct 1 in Digital Logic by Na462 Loyal (6.9k points) | 58 views

0 votes

0 answers

3

Self Doubt
"Every cyclic K-map given cyclic function and every cyclic function can be the self-dual function." What is the meaning of cyclic K-map?

asked Sep 23 in Digital Logic by Shaik Masthan Boss (35.9k points) | 33 views

0 votes

0 answers

4

Minimization of POS
Please verify my approach for calculation the minimal POS form for a function f. STEPS: Find out the f' in sum of minterms. Minimize f' and find out minimal SOP form. Using DeMorgan's law, find out f. The calcuated f will be minimal and in ... approach. However, I need a confirmation whether this method is actually correct and is bound to give me correct results all the time..!

asked Jul 26 in Digital Logic by Harsh Kumar Junior (803 points) | 13 views

0 votes

1 answer

5

UGCNET-July-2018-II-99
Simplify the following using K-map: $F(A, B, C, D) = \Sigma (0, 1, 2, 8, 9, 12, 13)$ $d(A, B, C, D) = \Sigma (10, 11, 14, 15)$ d stands for don't care condition $A+\bar{B} \bar{D} +BC$ $A+\bar{B} \bar{D} + \bar{B} \bar{C}$ $\bar{A} + \bar{B} \bar{C}$ $\bar{A} + \bar{B} \bar{C} + \bar{B} \bar{D}$

asked Jul 13 in Others by Pooja Khatri Active (5k points) | 58 views

0 votes

2 answers

6

K MAP
what will be the k Map for- $(P+Q'+R').(P+Q'+R).(P+Q+R')$ and the simplified SOP (Sum of Product) for the above the Boolean expression? Please try to make a k map in this format-

asked May 25 in Digital Logic by iarnav Loyal (9k points) | 82 views

0 votes

3 answers

7

k map
Consider the Karnaugh map given below, where X represents "don't care" and blank represents 0. what will be the SOP?

asked May 25 in Digital Logic by iarnav Loyal (9k points) | 90 views

0 votes

2 answers

8

k map minimization digital logic
What is the minimal $Sum-Of-Products$ of the map? ($X$ is a don't care)

asked May 25 in Digital Logic by iarnav Loyal (9k points) | 68 views

0 votes

0 answers

9

Kmap doubt
For converting or Using Kmap the expression needs to be in SOP form but in this Question : https://gateoverflow.in/8162/gate2015-2-37. In best chosen answer he didnt convert the expression in SOP and did it directly what is this Method can anybody explain please ?

asked Apr 17 in Digital Logic by Na462 Loyal (6.9k points) | 46 views

+1 vote

2 answers

10

Don't Care term in POS
Should we use Don't care terms while calculating POS expression?

asked Mar 21 in Digital Logic by Jason Active (1.5k points) | 217 views

+2 votes

1 answer

11

GATE1995-15-b
What is the equivalent minimal Boolean expression (in sum of products form) for the Karnaugh map given below?

asked Feb 12 in Digital Logic by jothee Veteran (105k points) | 172 views

+2 votes

1 answer

12

Cyclic Prime Implicant K-map
Hi Guys, Any justification for the mentioned answer or what could be the answer ?

asked Jan 31 in Digital Logic by Chhotu Boss (11.4k points) | 351 views

+2 votes

0 answers

13

SOP and POS
Consider the following kmap minimum number of NAND/NOR gates to implement the above kmap.

asked Jan 21 in Digital Logic by Anjan Active (1.7k points) | 129 views

+1 vote

1 answer

14

False Essential Prime Implicant
How many number of false essential prime implicants for the given Boolean functions f(A,B,C) = $\sum{m(0,3,7)}.$

asked Jan 17 in Digital Logic by Shubhanshu Boss (16.2k points) | 405 views

0 votes

0 answers

15

#self_doub_DLD
a subcube of 2^m cell is possible if and only if ,in that subcube for every cell m number of cells must be adjacent cell . please explain what is adjacent cell, here ????

asked Dec 30, 2017 in Digital Logic by air1ankit Active (3.9k points) | 18 views

0 votes

1 answer

16

K-Map
POS of (AB+C)

asked Dec 8, 2017 in Digital Logic by Mk Utkarsh Boss (23.6k points) | 74 views

+2 votes

3 answers

17

Essential prime implicants

asked Nov 29, 2017 in Digital Logic by Parshu gate Active (5k points) | 252 views

+1 vote

0 answers

18

Essential Prime Implicants Related Question

asked Nov 11, 2017 in Digital Logic by Sourajit25 Junior (975 points) | 203 views

+3 votes

1 answer

19

Digital Logic Doubt
The number of minterms covered by Essential Prime Implicants in the function f(a,b,c,d)=Σ(1,2,4,5,6,7,8,9,10,11,12,15) is Answer is 0.While my answer is coming 2.

asked Nov 11, 2017 in Digital Logic by Sourajit25 Junior (975 points) | 275 views

0 votes

1 answer

20

Self doubt on literal count in k-map
Find least literal count of POS for the following k-map. X 1 0 1 0 1 X 0 1 X X 0 X 0 0 X Ans: Minterms = 2 quads + 2 pairs = 2*2 + 3*2 = 10 literals OR, = 1 quad + 2 pairs = 1*2 + 3*2 = 8 literals ... approach? Should I favour quad over pair or should it be according to requirement? Since here minimum no.of literals are asked to find so is 2nd approach correct?

asked Nov 7, 2017 in Digital Logic by Tuhin Dutta Loyal (8.3k points) | 161 views

+5 votes

1 answer

21

Digital Logic Doubt
The K-Map for a boolean function is shown below.The number of essential prime implicants for this function is ? 1 1 0 1 0 0 0 1 1 0 0 0 1 0 0 1 The answer given is 3. But I think it will be 4 - (0,8,10,2) , (0,1) , (3,6) and (8,12)

asked Oct 23, 2017 in Digital Logic by Sourajit25 Junior (975 points) | 247 views

+1 vote

1 answer

22

Number of Essential prime implicants
Find the number of Essential prime implicants present in the K Map of the function f=Σ(2,3,5,7,8,12,13).Here the answer is 2,can anybody explain why it is 2?

asked Oct 15, 2017 in Digital Logic by Sourajit25 Junior (975 points) | 310 views

+2 votes

1 answer

23

Finding Essential Prime Implicants
Consider the Boolean function, F(w, x, y, z) = wy + xy + w̅xyz + w̅ x̅ y + xz + x̅y̅z̅. Which one of the following is the complete set of essential prime implicants? (A) w,y,xz,x̅z̅ (B) w,y,xz (C) y,x̅y̅z̅ (D) ... the KMAP by finding out minterms, the circled terms contribute to Essential prime implicants, but i dont' see any such options, the Answer is given D

asked Oct 13, 2017 in Digital Logic by Salazar Active (1.1k points) | 263 views

+1 vote

1 answer

24

#K-Map
The function f(A, B, C, D) = Σm(0, 1, 4, 6, 7, 8, 10, 14, 15). The number of prime implicants and essential prime implicants are (a) 6, 1 (b) 6,2 (c) 7, 1 (d) 7, 2 Explain how to count number of Prime implicants and essential prime implicants...

asked Oct 6, 2017 in Digital Logic by Harsh Mehta Active (1.3k points) | 81 views

+2 votes

1 answer

25

#K-Map
Minimum size of ROM required to implement following set of Boolean equations is F1 (w,x,y,z) = Σm( 0,1,2,5,7,12,13,15 ) F2 (w,x,y,z) = Σm( 0,5,6,9, 13,15 ) F3 (w,x,y,z) = Σm( 6,7,9,12,14,15 ) (a) 16 x 4 (b) 16 x 3 (c) 16 x 8 (d) 16 x 12

asked Oct 6, 2017 in Digital Logic by Harsh Mehta Active (1.3k points) | 120 views

0 votes

0 answers

26

Five Variable K Map
F(a,b,c,d,e) = min terms are {0,4,6,8,12,13,14,15,16,17,18,21,24,25,26,28,29,31} obtain the minimal 1) SOP form. 2) POS form. Using 5 Variable K map.

asked Sep 1, 2017 in Digital Logic by Shubhanshu Boss (16.2k points) | 249 views

+1 vote

1 answer

27

Digital electronics : Essential prime implicant

asked Jul 25, 2017 in Digital Logic by Nitesh Choudhary Active (2.7k points) | 562 views

0 votes

2 answers

28

K map minimization and Dont cares
It might be silly thing, but I am confused here, In K-Map minimization, suppose there are don't care terms. When we want to get minimal SOP, we assume don't care to be 1 and will get the switching expression. Suppose for the same function we ... assumed separately for SOP and POS. Don't care terms which are used to get SOP are not used to get POS and vice-versa.

asked May 31, 2017 in Digital Logic by AnilGoudar Active (4.6k points) | 342 views

+1 vote

1 answer

29

Digital Logic Doubt
In the min term we select (1), in the max term we select (0). But 1 is greater than 0. Selecting 1 should be called max-term and selecting 0 should be called Min-term. Why they have the name otherwise?

asked Mar 25, 2017 in Digital Logic by shivani2010 Junior (905 points) | 132 views

+22 votes

3 answers

30

GATE2017-1-21
Consider the Karnaugh map given below, where $X$ represents "don't care" and blank represents $0$. Assume for all inputs $\left ( a,b,c,d \right )$, the respective complements $\left ( \bar{a}, \bar{b}, \bar{c}, \bar{d} \right )$ are also available. The above logic is implemented using $2$-input $\text{NOR}$ gates only. The minimum number of gates required is ____________ .

asked Feb 14, 2017 in Digital Logic by Arjun Veteran (363k points) | 3.3k views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions tagged k-map

Recent Posts

Recent Blog Comments