# Recent questions tagged k-map

1 vote
1
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?
2
The function shown in the figure when simplified will yield a result with _______ terms $2$ $4$ $7$ $14$
3
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 ____________ .
4
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.
5
Is'nt all options are correct??
6
1 vote
7
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
8
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.
9
For F(x,y,z)=$\sum (1,3,4,5)$ , what is the number of implicants and prime implicants?
10
What is the minimized logic expression corresponding to the fiven K-map?
11
A Boolean function $f$ is to be realized only by $NOR$ gates. Its $K-map$ is given below: The realization is
12
13
The max no. of prime implicants in the minimized expression with n-variable is 2^n-1 . Can someone please explain how ?
14
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
15
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$
16
The function represented by the $\text{k}$-map given below is $A ⋅ B$ $AB + BC + CA$ $\overline{B \bigoplus C}$ $A ⋅ B ⋅ C$
1 vote
17
Simplify E(x,y,z,t)=Σ (0,2,7,8,10,15) using K-maps.
18
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
19
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.
20
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?
21
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
22
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?
23
Given explanation. I am not able to understand what is asked in the question. Please explain.
24
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'}$
25
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$
26
Consider the following expression $a\bar d + \bar a\bar c + b\bar cd$ Which of the following Karnaugh Maps correctly represents the expression?
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})$
Implement a circuit having the following output expression using an inverter and a nand gate $Z=\overline{A} + \overline{B} +C$
The function represented by the Karnaugh map given below is $A.B$ $AB+BC+CA$ $\overline{B \oplus C}$ $A.BC$