# GATE1991-5-b

969 views
Find the minimum sum of products form of the logic function $f(A,B,C,D) = \Sigma m(0,2,8,10,15)+ \Sigma d(3,11,12,14)$ where $m$ and $d$ represent minterm and don't care term respectively.

edited
1
Make square is minimum as well as possible

The minimum SOP form of the logic function is given as:  $f(A,B,C,D) = B'D'+AC$

edited

4 variable K-map will be used

Here we will get two quads
1. quad of (0,2,8,10 ) ---->B'D'

2. quad of (10.11.14,15) ---> AC

F = B'D'+AC

0
@praveen_saini sir, in this question why we are taking (10,11,14,15) for 2nd part, we can also take (15,11)??? please explain sir
3
one pair reduce one variable in minimization

one quad reduces 2 , and one octet reduce 3.. so on

we must pick the group of maximum minterms ..

## Related questions

1
7.6k views
Find the maximum clock frequency at which the counter in the figure below can be operated. Assume that the propagation delay through each flip flop and each AND gate is $10$ $\text{ns}$. Also assume that the setup time for the $JK$ inputs of the flip flops is negligible.
Analyse the circuit in Fig below and complete the following table ${\begin{array}{|c|c|c|}\hline \textbf{a}& \textbf{b}& \bf{ Q_n} \\\hline 0&0\\\ 0&1 \\ 1&0 \\ 1&1 \\ \hline \end{array}}$
Design a 1024 bit serial-in/serial-out unidirectional shift register using a 1K $\times$ 1 bit RAM with a data input $D_{in}$, data output $D_{out}$ and control input $\text{READ}/\overline{\text{WRITE}}$. You may assume the availability of standard SSI and MSI components such as gates, registers and counters.
Using D flip-flop gates, design a parallel-in/serial-out shift register that shifts data from left to right with the following input lines: Clock $\text{CLK}$ Three parallel data inputs $A, B, C$ Serial input $S$ Control input $\text{load} / \overline{\text{SHIFT}}$.