Evaluate the expression: (1 AND 0) 
OR 
(0 AND 1).

First, evaluate the AND operations: 
(1 AND 0) = 0 
and 
(0 AND 1) = 0. 
Now substitute back into the OR operation: 
0 OR 0 = 0.

What is De Morgan's Theorem in binary logic?

Negation of AND becomes OR, and negation of OR becomes AND.

What is the output of the expression: 
NOT (1 OR 0)?

First, evaluate the OR operation: 
1 OR 0 = 1. 
Now apply the NOT operation: 
NOT 1 = 0.

How do you represent the NAND operation in terms of AND and NOT?

NAND is the negation of the AND operation. It can be expressed as NAND(A, B) = NOT (A AND B).

What is the truth table for the NAND operation?

NAND Truth Table Explained

• A= 0, B = 0 gives 1

• A= 0, B = 1 gives 1

• A = 1, B = 1 gives 0

What is the significance of binary logic in computer science?

Binary logic is fundamental in computing.

• Forms the basis of digital circuits.

• Enables data representation as 0s and 1s.

• Drives all computational operations.

Evaluate the expression: (1 OR 0) AND (NOT 1).

First, evaluate the OR operation: 
1 OR 0 = 1. 
Next, apply NOT: 
NOT 1 = 0. 
Finally, combine: 
1 AND 0 = 0.

What is the XOR operation and how does it differ from OR?

XOR (exclusive OR) returns true only when exactly one of the operands is true. In contrast, OR returns true if at least one operand is true.

If A is true and B is false, what is the value of A AND (NOT B)?

First, evaluate NOT B: NOT false = true. 
Now evaluate A AND true: true AND true = true.

How does binary logic apply to decision-making in algorithms?

Binary logic aids algorithm decisions.

• Uses logical operators for conditions.

• Enables branching based on evaluations.

• Essential for algorithm efficiency.