Digital Logic

Step 1: Define a functionally complete set of gates. A set of logic gates is functionally complete if any possible Boolean function can be realized using only the gates in that set. NAND and NOR gates are known as universal gates because they are functionally complete by themselves.
Step 2: Evaluate the given gates.

(i) NAND: The NAND gate is a universal gate. It can be used to create NOT, AND, and OR functions. Therefore, it is a functionally complete set.
(ii) NOT: The NOT gate only performs inversion. It cannot create AND or OR logic. Therefore, it is not functionally complete.
Since NAND (I) is functionally complete and NOT (II) is not, the correct option is "I but not II".

Step 1: Recall the truth table for a 2-input OR gate. The output of an OR gate is true (1) if at least one of its inputs is true (1). \begin{center} \begin{tabular}{|c|c|c|} \hline Input A & Input B & Output (A OR B)
\hline 0 & 0 & 0
0 & 1 & 1
1 & 0 & 1
1 & 1 & 1
\hline \end{tabular} \end{center}
Step 2: Analyze the options based on the truth table.

(A) The output is 0 when both inputs are 0. Incorrect.
(B) The output is 1 in the last three rows of the table, which covers cases where either A is 1, B is 1, or both are 1. Correct.
(C) This describes an AND gate. Incorrect.
(D) If one input is 0 and the other is also 0, the output is 0. Incorrect.
The condition that makes the output of an OR gate 1 is when any of its inputs are 1.

Step 1: Analyze the definition of Boolean Algebra. Boolean algebra is a branch of algebra in which the values of the variables are the truth values \textit{true} and \textit{false}, usually denoted 1 and 0 respectively.
Step 2: Evaluate the options.

(A) Truth: While it deals with truth values, this is a component of the broader concept.
(B) Logic: Boolean algebra is the mathematical foundation of digital logic and computer science. It operates on logical statements.
(C) Symbol: It uses symbols, but this is true of all algebra, not its fundamental basis.
(D) Numbers: It uses the numbers 1 and 0, but they represent logical states (true/false), not numerical quantities in the traditional sense.
Therefore, Boolean algebra is fundamentally based on logic.

A logic gate is a fundamental building block of a digital circuit. It is an electronic device that performs a logical operation based on the principles of Boolean algebra. A logic gate takes one or more binary inputs (values of 0 or 1, representing false or true) and produces a single binary output based on a specific logical rule. The basic types of logic gates are:

AND (outputs 1 only if all inputs are 1)
OR (outputs 1 if any input is 1)
NOT (inverts the input; 1 becomes 0, 0 becomes 1)
These gates are combined to create more complex circuits that perform calculations and other operations inside a computer.

Step 1: Define a logic gate. A logic gate is a basic building block of a digital circuit that performs a logical operation on one or more binary inputs to produce a single binary output.
Step 2: Analyze the options.

(A) AND: This is a fundamental logic gate. The AND gate outputs true (1) only if all of its inputs are true.
(B) For: This is a keyword for a type of loop in programming.
(C) IFU: This is not a standard term in this context; it might stand for "Instruction Fetch Unit" in computer architecture, which is unrelated to logic gates.
(D) Break: This is a keyword in programming used to exit a loop or switch statement.
Therefore, AND is the term associated with logic gates.