Dark Mode

Recent questions tagged canonical-normal-form

0 votes

2 answers

1

Database Relations | Heighest normal form
MSQ A relation R(A,B,C,D) has only trivial functional dependencies of the form ( A→A, AB→AB,ABC→A, etc) Then consider the following options: The relation is surely in BCNF The relation is surely in 3NF The relation is surely in 2NF None of the above

Souvik33 asked in Databases Dec 17, 2022

199 views

13 votes

4 answers

2

GATE CSE 2020 | Question: 28
Consider the Boolean function $z(a,b,c)$. Which one of the following minterm lists represents the circuit given above? $z=\sum (0,1,3,7)$ $z=\sum (1,4,5,6,7)$ $z=\sum (2,4,5,6,7)$ $z=\sum (2,3,5)$

Arjun asked in Digital Logic Feb 12, 2020

by Arjun

5.6k views

33 votes

11 answers

3

GATE CSE 2019 | Question: 50
What is the minimum number of $2$-input NOR gates required to implement a $4$ -variable function expressed in sum-of-minterms form as $f=\Sigma(0,2,5,7, 8, 10, 13, 15)?$ Assume that all the inputs and their complements are available. Answer: _______

Arjun asked in Digital Logic Feb 7, 2019

by Arjun

24.1k views

1 vote

2 answers

4

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

Jason asked in Digital Logic Mar 21, 2018

by Jason

1.9k views

2 votes

1 answer

5

Canonical Normal Form, Boolean Expression, Minimization
Are multiple SOP and POS expressions possible such that they all are unique ?

rishi71662data4 asked in Digital Logic Oct 17, 2017

by rishi71662data4

609 views

20 votes

3 answers

6

GATE CSE 1990 | Question: 5-a
Find the minimum product of sums of the following expression $f=ABC + \overline{A}\;\;\overline{B}\;\;\overline{C}$

makhdoom ghaya asked in Digital Logic Nov 24, 2016

by makhdoom ghaya

4.4k views

0 votes

1 answer

7

GATE Overflow | Digital Logic | Test 1 | Question: 20
The minimum number of $T$ –gates required to implement the following function is $F(w,x,y,z) = \sum m (0,1,2,4,7,8,9,10,12,15) $

Bikram asked in Digital Logic Sep 20, 2016

by Bikram

95 views

1 vote

2 answers

8

GATE Overflow | Digital Logic | Test 1 | Question: 19
The Min-term expansion of $F(P,Q,R)= PQ+Q\bar R+P\bar R$ is $m_2 + m_4 + m_6 + m_7$ $ m_0 + m_1 + m_6 + m_7$ $m_0 + m_1 + m_3 + m_5$ $m_2 + m_3 + m_4 + m_5$

Bikram asked in Digital Logic Sep 20, 2016

by Bikram

92 views

15 votes

6 answers

9

ISRO2016-16
The simplified SOP (Sum of Product) from the Boolean expression $(\text{P} + \overline{\text{Q}} + \overline{\text{R}}) . (\text{P} + \text{Q + R) . (P + Q} +\overline{\text{R}})$ is $(\overline{\text{P}}.\text{Q}+\overline{\text{R}})$ $(\text{P + Q}.\overline{\text{R}})$ $(\text{P}.\overline{\text{Q}}+\text{R})$ $\text{(P.Q + R)}$

Arjun asked in Digital Logic Jul 4, 2016

by Arjun

7.4k views

10 votes

5 answers

10

ISRO-2013-28
The most simplified form of the Boolean function $x (A, B, C, D) = \sum (7, 8, 9, 10, 11, 12, 13, 14, 15)$ (expressed in sum of minterms) is? A + A'BCD AB + CD A + BCD ABC + D

makhdoom ghaya asked in Digital Logic Apr 27, 2016

by makhdoom ghaya

3.9k views

26 votes

2 answers

11

TIFR CSE 2015 | Part B | Question: 9
A Boolean expression is an expression made out of propositional letters (such as $p, q, r$) and operators $\wedge$, $\vee$ and $\neg$; e.g. $p\wedge \neg (q \vee \neg r)$. An expression is said to be ... Boolean expression is equivalent to an expression without $\wedge$ operator. Every Boolean expression is equivalent to an expression without $\neg$ operator.

makhdoom ghaya asked in Digital Logic Dec 8, 2015

by makhdoom ghaya

1.8k views

3 votes

3 answers

12

F = {X -> YZ, Y -> XZ, Z -> X} How many no. of minimal and canonical covers are possible?
Answer is 2 minimal and 2 canonical covers. Please give full explanation of how to solve.

Shefali asked in Databases Jul 22, 2015

1.5k views

36 votes

6 answers

13

GATE CSE 2015 Set 3 | Question: 44
Given the function $F = P' +QR$, where $F$ is a function in three Boolean variables $P, Q$ and $R$ and $P'=!P$, consider the following statements. $(S1) F = \sum(4, 5, 6)$ $(S2) F = \sum(0, 1, 2, 3, 7)$ $(S3) F = \Pi (4, 5, 6)$ ... , (S2)-False, (S3)-False, (S4)-True (S1)-False, (S2)-False, (S3)-True, (S4)-True (S1)-True, (S2)-True, (S3)-False, (S4)-False

go_editor asked in Digital Logic Feb 15, 2015

6.3k views

41 votes

7 answers

14

GATE CSE 2015 Set 3 | Question: 43
The total number of prime implicants of the function $f(w, x, y, z) = \sum (0, 2, 4, 5, 6, 10)$ is __________

go_editor asked in Digital Logic Feb 15, 2015

12.1k views

3 votes

4 answers

15

Kindly have a try .... IN canonical POS form following equation is written as (ABC)=AB+BC+AC (A)πM(0,1,2,4) (B)πM(3,5,6,7) (A)πM(0,1,2,3) (A)πM(4,5,6,7)

Gobind asked in Digital Logic Oct 11, 2014

by Gobind

2.8k views

24 votes

3 answers

16

GATE CSE 2010 | Question: 6
The minterm expansion of $f(P,Q,R) = PQ +Q \bar{R}+P\bar{R}$ is $m_2+m_4+m_6+m_7$ $m_0+m_1+m_3+m_5$ $m_0+m_1+m_6+m_7$ $m_2+m_3+m_4+m_5$

go_editor asked in Digital Logic Sep 29, 2014

5.8k views

51 votes

4 answers

17

GATE CSE 2002 | Question: 2-1
Consider the following logic circuit whose inputs are functions $f_1, f_2, f_3$ and output is $f$ Given that $f_1(x,y,z) = \Sigma (0,1,3,5)$ $f_2(x,y,z) = \Sigma (6,7),$ and $f(x,y,z) = \Sigma (1,4,5).$ $f_3$ is $\Sigma (1,4,5)$ $\Sigma (6,7)$ $\Sigma (0,1,3,5)$ None of the above

Kathleen asked in Digital Logic Sep 16, 2014

10.1k views

34 votes

5 answers

18

GATE CSE 2008 | Question: 8
Given $f_1$, $f_3$ and $f$ in canonical sum of products form (in decimal) for the circuit $f_1 = \Sigma m(4, 5, 6, 7, 8)$ $f_3 = \Sigma m(1, 6, 15)$ $f = \Sigma m(1, 6, 8, 15)$ then $f_2$ is $\Sigma m(4, 6)$ $\Sigma m(4, 8)$ $\Sigma m(6, 8)$ $\Sigma m(4, 6, 8)$

Kathleen asked in Digital Logic Sep 11, 2014

7.5k views

To see more, click for the full list of questions or popular tags.

Recent questions tagged canonical-normal-form