8,463 views

5 Answers

Best answer
17 votes
17 votes
  1. $\overline {x x}= \bar x$
  2. $\overline {x+x}= \bar x . \bar x =\bar x$
  3. $\overline {x .1 }= \bar x + 0= \bar x$
  4. $\overline {x +1}= \bar x. 0 = 0$


Here, $x \text{ NOR }1$  will  not be equal to $ \bar x.$

Hence, option (D) $x \text{ NOR} \ 1$ .

edited by
6 votes
6 votes

x NAND x

Lets do it for AND first  

 x AND x = x (Idempotent property)  Now take negation on both side  ____   __ 

                                                                                                      x.x =  x

x NOR x 

Lets do it for OR first  

 x OR x =x (Idempotent property) Now take negation on both side   _____     ___

                                                                                                  x + x   =    x

x NAND 1 

Again do it for AND first    x AND 1 = x Take negation on both side   ____    __

                                                                                                    x .1 =  x

x NOR 1

Do it for OR first        

 x OR 1 = 1   Noe negate on both side    ______     __

                                                             x + 1   =  1     = 0

So answer is D.

NOTE - Line (---------     ----)  are representing negation  

1 votes
1 votes
D), as X nor 1 will always be 0, irrespective of state of X
Answer:

Related questions

24 votes
24 votes
2 answers
1
Kathleen asked Sep 23, 2014
5,707 views
Which of the following functions implements the Karnaugh map shown below?$\bar{A}B + CD$$D(C+A)$$AD+\bar{A}B$$(C+D) (\bar{C}+D) + (A+B)$
22 votes
22 votes
2 answers
2
Kathleen asked Sep 23, 2014
7,290 views
Zero has two representations inSign-magnitude$2's$ complement$1's$ complementNone of the above
25 votes
25 votes
1 answer
3
Kathleen asked Sep 23, 2014
4,009 views
Let $R = (A, B, C, D, E, F)$ be a relation scheme with the following dependencies $C \rightarrow F, E \rightarrow A, EC \rightarrow D, A \rightarrow B $. Which one of the...
38 votes
38 votes
1 answer
4
Kathleen asked Sep 23, 2014
16,787 views
Consider the join of a relation $R$ with a relation $S$. If $R$ has $m$ tuples and $S$ has $n$ tuples then the maximum and minimum sizes of the join respectively are$m+n$...