recategorized by
321 views

1 Answer

1 votes
1 votes
$F= \bar w\bar x\bar y+w\bar x\bar y+\bar wxy\bar z+\bar xy\bar z$

$\implies F= \bar w\bar x\bar y(z+\bar z)+w\bar x\bar y(z+\bar z)+\bar wxy\bar z+(w+\bar w)\bar xy\bar z$

$\implies F=\bar w\bar x\bar yz+\bar w\bar x\bar y\bar z+w\bar x\bar yz+w\bar x\bar y\bar z+\bar wxy\bar z+w\bar xy\bar z+w\bar xy\bar z $

$\implies F=\sum (0,1,2,6,8,9,10)$

 solve using k-map we get

$F=\bar x\bar y+w\bar xz+\bar w y\bar z $

Related questions

3 votes
3 votes
0 answers
2
admin asked Dec 15, 2022
374 views
Count the number of perfect matchings in the bipartite graph whose adjacency matrix $\text{A}$ is as follows.\[\left[\begin{array}{lll}1 & 1 & 0 \\0 & 1 & 1 \\1 & 1 & 1\e...
1 votes
1 votes
0 answers
3
admin asked Dec 15, 2022
277 views
Given a tree $\text{T}$ and $\lambda \geq 2$ colours $\left(c_{1}, c_{2}, \ldots, c_{\lambda}\right),$ how many proper colourings of the tree $\text{T}$ are possible?
1 votes
1 votes
1 answer
4
admin asked Dec 15, 2022
242 views
If the maximum height of a binary tree is $\mathrm{N},$ then how many number of nodes will there be?