Consider the following Boolean expression of a function F :
πΉ(π, π) = (πΜ
+ π) β(πΜ
π)
Which of the following expressions is/are equivalent to F ?
The given Boolean function is \( F(P, Q) = (\overline{P} + Q) \oplus (\overline{P}Q) \). We need to test each option against the truth table of F.
Step 1: Construct the truth table for F.
For each combination of P and Q, compute \(\overline{P} + Q\) and \(\overline{P}Q\), then XOR them.
So F equals 1, 0, 0, 1 for (P,Q) = (0,0), (0,1), (1,0), (1,1) respectively. This is exactly the truth table of the XNOR function, that is \(F = \overline{P \oplus Q}\).
Step 2: Check option (A) \(\overline{P \oplus Q}\).
\(P \oplus Q\) is 0,1,1,0 for the same four rows, so its complement is 1,0,0,1, which matches F exactly. Option A is equivalent to F.
Step 3: Check option (B) \(P \oplus Q\).
This gives 0,1,1,0, which is the exact complement of F, not F itself. Option B is not equivalent.
Step 4: Check option (C) \(\overline{P} \oplus Q\).
Evaluate at each row: (0,0): \(1 \oplus 0 = 1\); (0,1): \(1 \oplus 1 = 0\); (1,0): \(0 \oplus 0 = 0\); (1,1): \(0 \oplus 1 = 1\). This gives 1,0,0,1, matching F exactly. Option C is equivalent to F.
Step 5: Check option (D) \(\overline{P} \oplus \overline{Q}\).
Since complementing both inputs of an XOR does not change its value, \(\overline{P} \oplus \overline{Q} = P \oplus Q\), which is 0,1,1,0, not matching F.
Therefore, the expressions equivalent to F are options A and C.
\[ \boxed{\text{Options A and C}} \]A schedule of three database transactions \(T_1\), \(T_2\), and \(T_3\) is shown. \(R_i(A)\) and \(W_i(A)\) denote read and write of data item A by transaction \(T_i\), \(i = 1, 2, 3\). The transaction \(T_1\) aborts at the end. Which other transaction(s) will be required to be rolled back?

Which one of the following options is not a property of Boolean Algebra?
Note: + is OR operation, . is AND operation, and β² is NOT operation
Consider a 2-bit saturating up/down counter that performs the saturating up count
when the input P is 0, and the saturating down count when P is 1. The Next State
table of the counter is as shown. The counter is built as a synchronous sequential
circuit using D flip-flops.
Input
Current
State
Next
State
π
π1
π0
π1
+
π0
+
0
0
0
0
1
0
0
1
1
0
0
1
0
1
1
0
1
1
1
1
1
0
0
0
0
1
0
1
0
0
1
1
0
0
1
1
1
1
1
0
Which one of the following options corresponds to the expressions for the inputs of
the D flip-flops, π·1 and π·0?

Consider a Boolean function F with the following minterm expression:
πΉ(π, π, π
, π) = βπ (1, 2, 3, 4, 5, 7, 10, 12, 13, 14)
Which of the following options is/are the minimal sum-of-products expression(s)
of F ?
Consider the following 4-variable Boolean function
πΉ(π΄, π΅, πΆ, π·) = Ξ£π(0, 1, 2, 3, 8, 9, 10, 11)
Consider π΄ as MSB, π· as LSB. Which one of the following options represents the
minimal sum of products form for the above function?
Note: + is OR operation, . is AND operation, β² is NOT operation
Consider the digital circuit shown below with two input lines A and B, two select
lines S0 and S1, and an output line Y. The blocks Q and M represent active high
2:4 decoder and 4-to-1 multiplexer, respectively. Out of 16 possible input
combinations, the number of combinations that produce Y=1 is ____________.
(answer in integer)
Note: One input combination is an instance of [A B S1 S0].
