Computer Science · Logic Gates
Which of the following statements is NOT true about NAND gates in Boolean algebra?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Every Boolean expression cannot be represented using only NAND gates.✓
- 2For variables U and V, NAND is represented as (U · V)'.
- 3It is the NOT gate applied to the output of an AND gate.
- 4It is a Universal Gate.
Correct answer
Every Boolean expression cannot be represented using only NAND gates.
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!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Logic Gates MCQs →Want more practice questions on Logic Gates?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Logic Gates