Logic Gates and Boolean Algebra

Engineering

Master the fundamental building blocks of all digital hardware — from NOT, AND, and OR gates through to NAND universal gates and Boolean algebra — and see how these simple switches combine to form adders and, ultimately, entire processors.

57 XP
Reward
12
Questions
5–10 min
Time
Q1 Question 1 of 12

What is the output of a NOT gate when the input is 1?

Q2 Question 2 of 12

A 3-input AND gate has inputs A=1, B=1, C=0. What is the output?

Q3 Question 3 of 12

A 2-input NAND gate has inputs A=1 and B=1. What is the output?

Q4 Question 4 of 12

What makes NAND (or NOR) gates 'universal'?

Q5 Question 5 of 12

Apply De Morgan's theorem to simplify NOT(A AND B).

Q6 Question 6 of 12

Using Boolean algebra, simplify: A AND 1.

Q7 Question 7 of 12

An XOR gate has inputs A=1 and B=1. What is the output?

Q8 Question 8 of 12

In a half-adder, what are the Sum and Carry outputs when adding 1 + 1?

Q9 Question 9 of 12

A full adder differs from a half adder because a full adder:

Q10 Question 10 of 12

Which Boolean expression correctly describes the output of a NOR gate with inputs A and B?

Q11 Question 11 of 12

Simplify the Boolean expression: A AND NOT(A).

Q12 Question 12 of 12

What hardware component stores a single bit of data in a sequential logic circuit?