menu
search
Log In
Quick search syntax
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

Subjects

Recent questions tagged k-map

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions tagged k-map

1 vote
1 answer
1
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?
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 shivani2010 225 views
0 votes
1 answer
2
ISRO 2006- ECE K Map
The function shown in the figure when simplified will yield a result with _______ terms $2$ $4$ $7$ $14$
The function shown in the figure when simplified will yield a result with _______ terms $2$ $4$ $7$ $14$
asked Mar 3, 2017 in Digital Logic sh!va 403 views
39 votes
4 answers
3
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 ____________ .
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 Arjun 7.2k views
0 votes
1 answer
4
DIGITAL LOGIC Kmap DOUBT
by solving K-MAP , i am not getting any of the A or B, ithink there is an extra term ACD in a option and ACD' in b option but given ans. is C. someone confirm this.
by solving K-MAP , i am not getting any of the A or B, ithink there is an extra term ACD in a option and ACD' in b option but given ans. is C. someone confirm this.
asked Feb 4, 2017 in Digital Logic mohit chawla 147 views
0 votes
0 answers
5
Correct Statement ( K-Map )
Is'nt all options are correct??
Is'nt all options are correct??
asked Jan 23, 2017 in Digital Logic vishwa ratna 161 views
1 vote
1 answer
7
Cyclic prime implicant/Minterm and maxterm
1.How many minterms are there in 3 variable boolean operation? is it 2^n?If yes then how https://gateoverflow.in/26487/how-many-minterms-are-present-in-8-input-exor-gate is true? 2.How many prime implicants are in cyclic prime implicant ... was:- Number of minterms Is it number of minterms or no. of minterms which are 1?In either case ,ways please explain
1.How many minterms are there in 3 variable boolean operation? is it 2^n?If yes then how https://gateoverflow.in/26487/how-many-minterms-are-present-in-8-input-exor-gate is true? 2.How many prime implicants are in cyclic prime implicant kmap? Answer given was:- Number of minterms Is it number of minterms or no. of minterms which are 1?In either case ,ways please explain
asked Dec 21, 2016 in Digital Logic rahul sharma 5 2.3k views
2 votes
2 answers
8
GATE1988-3a-b
The Karnaugh map of a function of (A, B, C) is shown on the left hand side of the above figure. The reduced form of the same map is shown on the right hand side, in which the variable C is entered in the map itself. Discuss, The methodology by ... the reduced map has been derived and the rules (or steps) by which the boolean function can be derived from the entries in the reduced map.
The Karnaugh map of a function of (A, B, C) is shown on the left hand side of the above figure. The reduced form of the same map is shown on the right hand side, in which the variable C is entered in the map itself. Discuss, The methodology by which the reduced map has been derived and the rules (or steps) by which the boolean function can be derived from the entries in the reduced map.
asked Dec 19, 2016 in Digital Logic jothee 598 views
0 votes
2 answers
9
Implicants and prime implicants
For F(x,y,z)=$\sum (1,3,4,5)$ , what is the number of implicants and prime implicants?
For F(x,y,z)=$\sum (1,3,4,5)$ , what is the number of implicants and prime implicants?
asked Nov 26, 2016 in Digital Logic Rakesh K 645 views
0 votes
2 answers
10
Digital Logic , IES 2005
What is the minimized logic expression corresponding to the fiven K-map?
What is the minimized logic expression corresponding to the fiven K-map?
asked Nov 22, 2016 in Digital Logic Nithish 581 views
16 votes
4 answers
11
GATE1987-16-a
A Boolean function $f$ is to be realized only by $NOR$ gates. Its $K-map$ is given below: The realization is
A Boolean function $f$ is to be realized only by $NOR$ gates. Its $K-map$ is given below: The realization is
asked Nov 15, 2016 in Digital Logic makhdoom ghaya 1.8k views
3 votes
1 answer
13
The max no. of prime implicants in the minimized expression
The max no. of prime implicants in the minimized expression with n-variable is 2^n-1 . Can someone please explain how ?
The max no. of prime implicants in the minimized expression with n-variable is 2^n-1 . Can someone please explain how ?
asked Nov 14, 2016 in Digital Logic Aakash Das 1.8k views
2 votes
3 answers
14
Variable Entered K-Map (VEM)
From the given K-map for the function F=(a,b,c,d,e), answer the following questions: In the minimized form of the function how many minterms are free from e, e’ (The term should not include any of e, e’) 2 3 1 0
From the given K-map for the function F=(a,b,c,d,e), answer the following questions: In the minimized form of the function how many minterms are free from e, e’ (The term should not include any of e, e’) 2 3 1 0
asked Nov 7, 2016 in Digital Logic Shashank Chandekar 1.9k views
0 votes
1 answer
15
UGCNET-AUG2016-II: 8
The Karnaugh map for a Boolean function is given as The simplified Boolean equation for the above Karnaugh Map is $AB + CD + A\bar{B} + AD$ $AB + AC + AD + BCD$ $AB + AD + BC + ACD$ $AB + AC + BC + BCD$
The Karnaugh map for a Boolean function is given as The simplified Boolean equation for the above Karnaugh Map is $AB + CD + A\bar{B} + AD$ $AB + AC + AD + BCD$ $AB + AD + BC + ACD$ $AB + AC + BC + BCD$
asked Sep 24, 2016 in Digital Logic makhdoom ghaya 963 views
0 votes
1 answer
16
UGCNET-June2010-II: 10
The function represented by the $\text{k}$-map given below is $A ⋅ B$ $AB + BC + CA$ $\overline{B \bigoplus C}$ $A ⋅ B ⋅ C$
The function represented by the $\text{k}$-map given below is $A ⋅ B$ $AB + BC + CA$ $\overline{B \bigoplus C}$ $A ⋅ B ⋅ C$
asked Sep 15, 2016 in Digital Logic makhdoom ghaya 738 views
1 vote
1 answer
17
Gate Discrete maths solve k maps
Simplify E(x,y,z,t)=Σ (0,2,7,8,10,15) using K-maps.
Simplify E(x,y,z,t)=Σ (0,2,7,8,10,15) using K-maps.
asked Jun 26, 2016 in Digital Logic LavTheRawkstar 232 views
4 votes
2 answers
18
ISRO2009-20
Consider the following boolean function of four variables $f(w,x,y,z) = \Sigma(1,3,4,6,911,12,14)$, the function is Independent of one variable Independent of two variables Independent of three variables Dependent on all variables
Consider the following boolean function of four variables $f(w,x,y,z) = \Sigma(1,3,4,6,911,12,14)$, the function is Independent of one variable Independent of two variables Independent of three variables Dependent on all variables
asked Jun 14, 2016 in Digital Logic jothee 2.4k views
4 votes
0 answers
19
ISI2011-PCB-CS-6b
For the function given by the Karnaugh map shown below, you can change at most one $1$ or one $0$ entry to a DON'T CARE. Determine what single change of this kind produces the simplest two-level AND-OR realization. Assume both uncomplemented and complemented inputs are available.
For the function given by the Karnaugh map shown below, you can change at most one $1$ or one $0$ entry to a DON'T CARE. Determine what single change of this kind produces the simplest two-level AND-OR realization. Assume both uncomplemented and complemented inputs are available.
asked Jun 3, 2016 in Digital Logic jothee 375 views
0 votes
1 answer
20
Morris Mano 4th Edition 3.9 (c) Essential Implicants
I get answer with terms as BC' an AC.The Solution give has A'B'D as well. Is the blue pairing done correct? Are they Prime Implicants too? By def. Prime Implicant should not be part of a group or pair?
I get answer with terms as BC' an AC.The Solution give has A'B'D as well. Is the blue pairing done correct? Are they Prime Implicants too? By def. Prime Implicant should not be part of a group or pair?
asked May 22, 2016 in Digital Logic Avinesh Benjamin 332 views
0 votes
2 answers
21
K-Map
How to comprehend this k-map? Usually we have 00,01,10,11 terms in K-map. But what does those (C+D) terms signify
How to comprehend this k-map? Usually we have 00,01,10,11 terms in K-map. But what does those (C+D) terms signify
asked Jan 21, 2016 in Digital Logic Sumit1311 180 views
2 votes
2 answers
22
Ace Test Series: Digital Logic - K Map
They have taken 1 extra combination which is already a subset of 2 other combos. Is it because that they have asked ALL POSSIBLE k-maps??? Is it right?
They have taken 1 extra combination which is already a subset of 2 other combos. Is it because that they have asked ALL POSSIBLE k-maps??? Is it right?
asked Jan 14, 2016 in Digital Logic Tushar Shinde 503 views
0 votes
2 answers
23
Question on K-maps
Given explanation. I am not able to understand what is asked in the question. Please explain.
Given explanation. I am not able to understand what is asked in the question. Please explain.
asked Jan 4, 2016 in Digital Logic shikharV 3.9k views
24 votes
2 answers
24
GATE2006-IT-35
The boolean function for a combinational circuit with four inputs is represented by the following Karnaugh map. Which of the product terms given below is an essential prime implicant of the function? $\text{QRS}$ $\text{PQS}$ $\text{PQ'S'}$ $\text{Q'S'}$
The boolean function for a combinational circuit with four inputs is represented by the following Karnaugh map. Which of the product terms given below is an essential prime implicant of the function? $\text{QRS}$ $\text{PQS}$ $\text{PQ'S'}$ $\text{Q'S'}$
asked Oct 31, 2014 in Digital Logic Ishrat Jahan 2.8k views
23 votes
2 answers
25
GATE2007-IT-79
Consider the following expression $a\bar d + \bar a \bar c + b\bar cd$ Which of the following expressions does not correspond to the Karnaugh Map obtained for the given expression? $\bar c \bar d+ a\bar d + ab\bar c + \bar a \bar cd$ ... $\bar b\bar c \bar d + ac\bar d + \bar a \bar c + ab\bar c$
Consider the following expression $a\bar d + \bar a \bar c + b\bar cd$ Which of the following expressions does not correspond to the Karnaugh Map obtained for the given expression? $\bar c \bar d+ a\bar d + ab\bar c + \bar a \bar cd$ $\bar a\bar c + \bar c\bar d + a\bar d + ab\bar cd$ $\bar a\bar c + a\bar d + ab\bar c + \bar cd$ $\bar b\bar c \bar d + ac\bar d + \bar a \bar c + ab\bar c$
asked Oct 31, 2014 in Digital Logic Ishrat Jahan 2.6k views
25 votes
2 answers
26
GATE2007-IT-78
Consider the following expression $a\bar d + \bar a\bar c + b\bar cd$ Which of the following Karnaugh Maps correctly represents the expression?
Consider the following expression $a\bar d + \bar a\bar c + b\bar cd$ Which of the following Karnaugh Maps correctly represents the expression?
asked Oct 31, 2014 in Digital Logic Ishrat Jahan 2.3k views
15 votes
4 answers
27
GATE1996-2.24
What is the equivalent Boolean expression in product-of-sums form for the Karnaugh map given in Fig $B\overline{D} + \overline{B}D$ $(B + \overline{C} +D) (\overline{B} + C + \overline{D})$ $(B + {D})(\overline{B} +\overline{ D})$ $(B + \overline{D})(\overline{B} + {D})$
What is the equivalent Boolean expression in product-of-sums form for the Karnaugh map given in Fig $B\overline{D} + \overline{B}D$ $(B + \overline{C} +D) (\overline{B} + C + \overline{D})$ $(B + {D})(\overline{B} +\overline{ D})$ $(B + \overline{D})(\overline{B} + {D})$
asked Oct 9, 2014 in Digital Logic Kathleen 3.9k views
10 votes
2 answers
28
GATE1995-15-a
Implement a circuit having the following output expression using an inverter and a nand gate $Z=\overline{A} + \overline{B} +C$
Implement a circuit having the following output expression using an inverter and a nand gate $Z=\overline{A} + \overline{B} +C$
asked Oct 8, 2014 in Digital Logic Kathleen 1.3k views
18 votes
1 answer
29
GATE1998-2.7
The function represented by the Karnaugh map given below is $A.B$ $AB+BC+CA$ $\overline{B \oplus C}$ $A.BC$
The function represented by the Karnaugh map given below is $A.B$ $AB+BC+CA$ $\overline{B \oplus C}$ $A.BC$
asked Sep 26, 2014 in Digital Logic Kathleen 4k views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...