Given,
A = x (y′ + z′)
= xy′ + xz′
To express as a complete sum-of-products, expand using all variable combinations:
= xy′(z + z′) + xz′(y + y′)
= xy′z + xy′z′ + xyz′ + xy′z′
After simplification, duplicate terms are removed:
A = xyz′ + xy′z + xy′z′
UGC NET Computer Science Digital Logic Previous Year Questions (PYQs)
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations
Study Stuff for MCA Examinations
Consider the Boolean expression A(x, y, z) = x (y′ + z′).
Which of the following is the complete sum-of-products form of the given Boolean expression?
1
2
3
4
Solution
Binary equivalent to $(A0F)_{16}$ is:
1
2
3
4
Solution
A = 1010,
0 = 0000,
F = 1111
So, $(A0F){16} = 101000001111{2}$.
Which of the following gates do not give output 1 when both inputs are 0?
A. NAND gate
B. NOR gate
C. XOR gate
D. XNOR gate
1
2
3
4
Solution
Step-by-step explanation:
a = 12, b = 2
a = a + b → a = 14
b = a / b → b = 7
a = a * b → a = 98
b = a - b → b = 91
→ c = 91
Hence, -(*i) = -91
Output: 91 (negative of c printed as -(-91) → 91)
Gray code equivalent to decimal number 8 is:
1
2
3
4
Solution
Binary of 8 = 1000
Gray code is obtained by XORing each bit with the next bit.
→ MSB remains same.
→ Remaining bits: perform XOR with the bit to its left.
So,
$1000 \rightarrow 1100$
UGC NET Computer Science
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
UGC NET Computer Science
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
