Given the Boolean function F in three variables R, S and T as F=$$\,\overline R \,S\overline T + R\overline {S\,} T + RST$$

(a) Express F in the minimum sum-of-products from.
(b) Express F in the minimum product-of-sums from.
(c) Assuming that both true and complement froms of the input variables are avialable, draw a cicruit to implement F using the minimum number of 2input NAND gates only.

Its is desired to generate the following three Boolean functions. $$\eqalign{ & {F_1} = a\,\overline b \,c + \overline a \,b\overline c + bc \cr & {F_2} = \,a\,\overline b \,c + ab + \overline a \,b\overline c \cr & {F_3} = \,\overline a \,\overline b \,\overline c + abc + \overline a c \cr} $$

By using an OR gate array as shown in figure where $${P_{1\,}}\,to\,{P_5}$$ are the product terms in one or more of the variables a, $$\overline a $$, b, $$\,\overline b $$, c and $$\overline c $$.

Each cell of a static Random Access Memory Contains

A 12-bit ADC is operating with a 1$$\mu $$ sec clock period and the total conversion time is seen to be 14 $$\mu $$ sec. The ADC must br of the