Digital Logic - Boolean Algebra
17. In the following Karnaugh map, corresponding switching function in its minimal form is
- Option : D
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
18. The minimum Boolean expression for the circuit is
- Option : A
- Explanation : y = A(B+C) + AB + (A+B)C = AB + AC + AB + AC + BC = AB + AC + BC
You must be logged in to post a comment.
You must be logged in to post a comment.
19. Consider a function that is defined by the following truth table:
|
A |
B |
C |
F(A, B, C ) |
|
0 |
0 |
0 |
1 |
|
1 |
0 |
0 |
1 |
|
0 |
1 |
0 |
1 |
|
1 |
1 |
0 |
1 |
|
0 |
0 |
1 |
1 |
|
1 |
0 |
1 |
0 |
|
0 |
1 |
1 |
X |
|
1 |
1 |
1 |
X |
- Option : A
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
20. What is the Boolean expression for the circuit given below ?
- Option : A
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
You must be logged in to post a comment.