List of top Mathematics Questions on Boolean Algebra

Consider the following four variable Boolean function in sum-of-product form \[ F(b_3, b_2, b_1, b_0) = \sum(0, 2, 4, 8, 10, 11, 12), \] where the value of the function is computed by considering \( b_3 b_2 b_1 b_0 \) as a 4-bit binary number, where \( b_3 \) denotes the most significant bit and \( b_0 \) denotes the least significant bit. Note that there are no don’t care terms. Which ONE of the following options is the CORRECT minimized Boolean expression for \( F \)?

Negation of the statement \( (p \land r) \rightarrow (r \lor q) \) is:

The symbolic form of logic of the circuit given below is

Universal set, \[ U = \{x \mid x^5 - 6x^4 + 11x^3 - 6x^2 = 0\} \] \[ A = \{x \mid x^2 - 5x + 6 = 0\} \] \[ B = \{x \mid x^2 - 3x + 2 = 0\} \] What is $(A \cap B)$ equal to?