Physics · Digital Electronics
A = a1a0 and B = b1b0 are two 2-bit unsigned binary numbers. If F(a1, a0, b1, b0) is a Boolean function such that F = 1 only when A > B, and F = 0 otherwise, then F can be minimized using a Karnaugh map to the form:
- 1a1b'1 + a1a0b'0 + a0b'0b1
- 2a1a0b'0 + a0b'0b'1
- 3a1b'1 + a1a0b'0 + a0b'0b'1✓
- 4a1b'1 + a1a0b'0
Correct answer
a1b'1 + a1a0b'0 + a0b'0b'1
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Physics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Digital Electronics?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Physics · Digital Electronics