Question:
Which one is false ?
Which one is false ?
Updated On: Aug 8, 2024
\(X.1=X\)
\(X+\bar X=1\)
\(1+X=X\)
\(X.X=0\)
Hide Solution
Verified By Collegedunia
The Correct Option is C, D
Solution and Explanation
The correct options are (C) & (D).
Was this answer helpful?
0
0
Top Questions on Boolean Algebra
- Which one of the following options is not a property of Boolean Algebra? (Note: $+$ is OR operation, $\cdot$ is AND operation, and $'$ is NOT operation.)
- CUET (PG) - 2026
- Computer Science
- Boolean Algebra
- Define Truth Table.
- JKBOSE XII - 2026
- Computer Science
- Boolean Algebra
- Explain De-Morgan’s principle with two steps to reduce a Boolean expression.
- JKBOSE XII - 2026
- Computer Science
- Boolean Algebra
- Identity Law is
- JKBOSE XII - 2026
- Computer Science
- Boolean Algebra
Consider the following Karnaugh Map (K-map). Minimal Function generated by this Karnaugh map is:
- CUET (PG) - 2025
- Computer Science
- Boolean Algebra
View More Questions
Questions Asked in GATE CS exam
- With respect to a TCP connection between a client and a server, which of the following is true?
- GATE CS - 2026
- Computer Networks
- Let $P, Q, R, S$ be relational schemas. Let ``$\rightarrow$'' indicate a functional dependency (FD) in this context. Which of the following best describes the meaning of a functional dependency?
- GATE CS - 2026
- Database Management Systems
- Let a Non-deterministic Finite Automaton (NFA) have 6 states over a finite alphabet. Which of the following cannot be the number of states in a minimal Deterministic Finite Automaton (DFA) that is equivalent to this NFA?
- GATE CS - 2026
- Theory of Computations
- A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?
- GATE CS - 2026
- Computer Organization and Architecture
- Consider $Z = X - Y$, where $X$, $Y$ and $Z$ are all in sign-magnitude form. $X$ and $Y$ are each represented in $n$ bits. To avoid overflow, the representation of $Z$ would require a minimum of:
- GATE CS - 2026
- Computer Organization and Architecture
View More Questions