Define the XOR gate and write its Boolean expression.

The XOR (Exclusive OR) gate is a digital logic gate that outputs true (1) when the number of true inputs is odd. For a 2-input XOR gate, it outputs 1 when one of the inputs is 1 and the other is 0, and outputs 0 when both inputs are the same (either both 0 or both 1). The Boolean expression for a 2-input XOR gate is:

A⊕B=A′B+AB′

This expression indicates that the output is true when A and B are different.

Related Questions:

  1. What is a logic gate?
  2. Define truth table.
  3. Define Boolean function.
  4. What is Karnaugh map and why is it used?
  5. Draw three-variable Karnaugh map for variables X, Y, and Z.
  6. Draw the graphical symbols of AND, OR, NOT, NAND, and NOR gates and write their functions.
  7. Explain how NAND and NOR gates can be created using AND, OR, and NOT gates.
  8. Draw truth tables of the following Boolean functions.
  9. Simplify the Boolean functions of Question 5 using Karnaugh map.
  10. Draw the logic circuits of the following Boolean functions.
  11. Describe how basic and compound assignment operators are used.
  12. Why do we use the return 0 statement in the main function of a C program?
  13. Write a program to check whether a given number is even or odd using the modulus operator.
  14. Explain different types of format specifiers used in C with examples.
  15. Write a program that takes input from the user for marks of five subjects, calculates the percentage, and prints the grade based on the following criteria: 90% and above: A+ 80%-89%: A 70%-79%: B 60%-69%: C Below 60%: Fail
  16. Differentiate between if and if-else selection structures.
  17. Differentiate between else-if and switch selection structures. 
  18. What is a nested selection structure?
  19. Write the following statement using the if-else statement.
  20. Write the following statement using the conditional operator.