Recent questions tagged k-map / GATE Overflow for GATE CSE

4 votes

1 answer

1

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 26
The figure below represents the Karnaugh map for a function $\text{F(A,B,C,D).}$ Note, $\text{ X'}$ stands for don't care. The simplified logical expression in the sum-of-products (SOP) form (i.e., the minimum number of ... can be converted into a circuit implementation using only NAND gates, which is shown in: a b c d

The figure below represents the Karnaugh map for a function $\text{F(A,B,C,D).}$ Note, $\text{‘X’}$ stands for don’t care.The simplified logical expression in the s...

GO Classes

347 views

GO Classes asked Jan 28

0 votes

1 answer

2

k maps

vivek1211

287 views

vivek1211 asked Nov 18, 2023

0 votes

0 answers

3

K-map

Çșȇ ʛấẗẻ

259 views

Çșȇ ʛấẗẻ asked Aug 28, 2023

2 votes

2 answers

4

Digital Logic, Essential Prime Implicants
The number of essential prime implicants in the function f(a, b, c, d) = Σ(1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 15) is ________.

The number of essential prime implicants in the function f(a, b, c, d) = Σ(1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 15) is ________.

sudiptasamui98

813 views

sudiptasamui98 asked Jun 30, 2023

1 votes

1 answer

5

Made Easy Boolean Algebra,Logic Gates and K-Maps

Sourin Kundu

618 views

Sourin Kundu asked Apr 13, 2023

2 votes

0 answers

6

Choosing prime implicants in K-maps
I got a K-map with the following boolean function: F(A,B,C,D) = ΠM[3,4,6,9,11,14]+ Σd[0,7,8,10,13,15] In the following K-map following prime-implicants are considered: But I can chose ($\bar{A}$+$\bar{D}$) instead of ($\bar{A}$+$B$) like: So now ... $\bar{C}$+$\bar{D}$)($A$+$C$+$D$) So we get different f in the two cases or am I making a mistake somewhere?

I got a K-map with the following boolean function: F(A,B,C,D) = ΠM[3,4,6,9,11,14]+ Σd[0,7,8,10,13,15]In the following K-map following prime-implicants are considered:Bu...

h4kr

444 views

h4kr asked Dec 28, 2022

0 votes

1 answer

7

Unacademy AIMT - 1
What is the minimized expression for the following k-map? $AB + \bar{AB}C + \bar{A}CD + A\bar{C}D + AC\bar{D}$ $AB + \overline{AB}C + \bar{A}CD + A\bar{C}D + AC\bar{D} + \overline{BCD}$ $AB + \overline{AB}C + \bar{A}CD + A\bar{C}D + AC\bar{D} + \bar{B}\bar{C}\bar{D}$ None of these

What is the minimized expression for the following k-map? $AB + \bar{AB}C + \bar{A}CD + A\bar{C}D + AC\bar{D}$$AB + \overline{AB}C + \bar{A}CD + A\bar{C}D + AC\bar{D} + \...

Pranavpurkar

686 views

Pranavpurkar asked Dec 9, 2022

0 votes

0 answers

8

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

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

JAINchiNMay

523 views

JAINchiNMay asked Nov 9, 2022

0 votes

1 answer

9

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')

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

saba780

942 views

saba780 asked Apr 26, 2022

1 votes

1 answer

10

GATE Overflow Test Series | Mock GATE | Test 6 | Question: 37
The literal count of a Boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of $(\overline{x}y + x\overline{z} + \overline{y} z)$ is $6.$ If the minimum possible ... $\alpha$ and $\beta$ respectively, the value of $\alpha + 2\beta = $__________

The literal count of a Boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of $(\overline{x}y + x\...

Arjun

185 views

Arjun asked Jan 30, 2022

3 votes

1 answer

11

GATE Overflow Test Series | Mock GATE | Test 5 | Question: 53
A logic circuit implements the following Boolean function: $F = ABC + AC'D'$ It is found that the circuit input combination $A=D=1$ can never occur. The simplified expression for $F$ using the proper don't-care conditions is $F = AC'+AB $ $F = BC$ $F = BC+C'$ $F = A'B + CD'$

A logic circuit implements the following Boolean function:$F = ABC + AC'D'$It is found that the circuit input combination $A=D=1$ can never occur. The simplified expressi...

gatecse

369 views

gatecse asked Feb 8, 2021

4 votes

1 answer

12

GATE Overflow Test Series | Mock GATE | Test 5 | Question: 54
The implicants being chosen for a circuit implementation are marked in the following four Karnaugh-maps all representing the same function $f$. In which of them, a static-$1$ hazard is possible? (Mark all the appropriate choices)

The implicants being chosen for a circuit implementation are marked in the following four Karnaugh-maps all representing the same function $f$. In which of them, a static...

gatecse

527 views

gatecse asked Feb 8, 2021

2 votes

1 answer

13

GATE Overflow Test Series | Mock GATE | Test 3 | Question: 14
If $f(w,x,y,z) = \Sigma_{m}(0,2,4,6,8) + \Sigma_{\phi}(10,11,12,13,14,15)$, which of the followings is the minimal boolean expression for $f$? $f(w,x,y,z) = \overline{y}$ $f(w,x,y,z) = \overline{z}$ $f(w,x,y,z) = \overline{x}$ $f(w,x,y,z) = \overline{w}$

If $f(w,x,y,z) = \Sigma_{m}(0,2,4,6,8) + \Sigma_{\phi}(10,11,12,13,14,15)$, which of the followings is the minimal boolean expression for $f$?$f(w,x,y,z) = \overline{y}$$...

gatecse

164 views

gatecse asked Jan 26, 2021

12 votes

1 answer

14

GATE Overflow Test Series | Mock GATE | Test 2 | Question: 54
If $f_{1}(w,x,y,z) = \Sigma_{m}(0,1,2,3,5,7 ,13 ,15),f_{2}(a,b,c,d) = \Pi_{M}(0,1,2,4,5,8,10,13,14,15)$ If $\alpha, \beta$ and $\gamma$ denote the respective sum of the number of implicants, prime implicants and essential prime implicants of $f_{1}$ and $f_{2},$ the value of $\alpha - \beta + \gamma$ is _________

If $f_{1}(w,x,y,z) = \Sigma_{m}(0,1,2,3,5,7 ,13 ,15),f_{2}(a,b,c,d) = \Pi_{M}(0,1,2,4,5,8,10,13,14,15)$If $\alpha, \beta$ and $\gamma$ denote the respective sum of the nu...

gatecse

992 views

gatecse asked Jan 17, 2021

2 votes

4 answers

15

UGC NET CSE | October 2020 | Part 2 | Question: 42
Simplified expression/s for following Boolean function $F(A,B,C,D)=\Sigma(0,1,2,3,6,12,13,14,15)$ is/are $A’B’+AB+A’C’D’$ $A’B’+AB+A’CD’$ $A’B’+AB+BC’D’$ $A’B’+AB+BCD’$ Choose the correct answer from the options given below: $(i)$ only $(ii)$ only $(i)$ and $(ii)$ only $(ii)$ and $(iv)$ only

Simplified expression/s for following Boolean function$F(A,B,C,D)=\Sigma(0,1,2,3,6,12,13,14,15)$ is/are$A’B’+AB+A’C’D’$$A’B’+AB+A’CD’$$A’B’+AB+BC’...

go_editor

2.0k views

go_editor asked Nov 20, 2020

4 votes

2 answers

16

GATE Overflow Test Series | Digital Logic | Test 1 | Question: 16
A logic circuit implements the following Boolean function: $F = A'C + ACD'$ It is found that the circuit input combination $A=D=1$ can never occur. The simplified expression for $F$ using the proper don't-care conditions is $F = A'C $ $F = CD'$ $F = C$ $F = A'C + CD'$

A logic circuit implements the following Boolean function: $F = A'C + ACD'$It is found that the circuit input combination $A=D=1$ can never occur. The simplified expressi...

gatecse

336 views

gatecse asked Jul 19, 2020

1 votes

1 answer

17

GATE Overflow Test Series | Digital Logic | Test 1 | Question: 17
A boolean function $F$ together with the don’t care condition $d;$ are given below $F(A,B,C,D) = \sum(1,3,5,7,9,15)$ $d(A,B,C,D)= \sum(4,6,12,14).$ The simplified form of $F$ can be expressed in the sum of minterms as $\sum(1,3,5,6,7,9,14,15)$ $\sum(1,3,5,6,7,9,15)$ $\sum(1,3,5)$ $\sum(1,3,5,7,9,15)$

A boolean function $F$ together with the don’t care condition $d;$ are given below$F(A,B,C,D) = \sum(1,3,5,7,9,15)$$d(A,B,C,D)= \sum(4,6,12,14).$The simplified form of ...

gatecse

258 views

gatecse asked Jul 19, 2020

1 votes

1 answer

18

GATE Overflow Test Series | Digital Logic | Test 1 | Question: 18
If the number of prime implicants and essential prime implicants of $F(A,B,C,D) = \sum(0,6,8,13,14)$ are represented by $m$ and $n$ respectively, the value of $2^m\times 3^n = $

If the number of prime implicants and essential prime implicants of $F(A,B,C,D) = \sum(0,6,8,13,14)$ are represented by $m$ and $n$ respectively, the value of $2^m\times ...

gatecse

321 views

gatecse asked Jul 19, 2020

2 votes

1 answer

19

GATE Overflow Test Series | Digital Logic | Test 1 | Question: 24
The implicants being chosen for the circuit implementation are marked in the following four Karnaugh-maps. In which of them, a static-$1$ hazard is not possible?

The implicants being chosen for the circuit implementation are marked in the following four Karnaugh-maps. In which of them, a static-$1$ hazard is not possible?

gatecse

430 views

gatecse asked Jul 19, 2020

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