Time Left - 15:00 mins
GATE CS 2022 : Digital Logic-1
Attempt now to get your rank among 242 students!
Minimize the following canonical expression using the Boolean law ABC'D' + ABC'D + AB'C'D + ABCD + AB'CD + ABCD' + AB'CD'
If X = 111101 and Y = 000100 be two 8-bit 2’s complement numbers. Their product in 2’s complement is:
In a multiplexer number of inputs depends on:
(r-1)’s complement of (r-1)’s complement of an integer is
The simplified SOP (Sum of Product) form of the Boolean expression is
The minimum number of 1X2 DEMUX required to implement 1X8 DEMUX is________.
- 242 attempts
- 1 upvote
- 13 comments
Jul 16GATE & PSU CS
Harshita AgarwalMember since Jul 2020