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].

The circuit has a 2-to-4 active-high decoder \(Q\) whose two inputs are \(A\) and \(B\), and a 4-to-1 multiplexer \(M\) whose two select lines are \(S_1\) and \(S_0\). The four decoder outputs feed the four data lines of the multiplexer, and tracing the wires in the figure shows that some decoder output lines branch and feed two adjacent multiplexer data lines, so \(Y\) is not simply the decoder output picked by \(S_1S_0\).
Step 1: Decoder behaviour. For a 2:4 active-high decoder with address inputs \(A\) (MSB) and \(B\) (LSB), exactly one output is HIGH for every \((A,B)\) pair: \(D_0=1\) only for \(AB=00\), \(D_1=1\) only for \(AB=01\), \(D_2=1\) only for \(AB=10\), \(D_3=1\) only for \(AB=11\).
Step 2: Multiplexer data-line connections read from the figure: \(I_0=D_0\), \(I_1=D_1+D_2\), \(I_2=D_2+D_3\), \(I_3=D_3\). The multiplexer output is \(Y=I_k\), where \(k\) is the decimal value of \(S_1S_0\).
Step 3: Check each of the 4 possible \(S_1S_0\) values against the 4 possible \((A,B)\) values.
Step 4: Total count. Adding the counts for each select value gives \(1+2+2+1=6\). The 6 combinations of \([A\ B\ S_1\ S_0]\) are 0000, 0101, 1001, 1010, 1110 and 1111.
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?

Consider the following Boolean expression of a function F :
𝐹(𝑃, 𝑄) = (𝑃̅ + 𝑄) ⊕(𝑃̅𝑄)
Which of the following expressions is/are equivalent to F ?
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