Digital Logic

A Boolean function, $f(x,y,z)$ with $x$ as MSB and $z$ as LSB is realized by 4:1 multiplexer (MUX) with select lines, $S_1$ and $S_0$ ($S_1$ is MSB, $S_0$ is LSB) and inputs, $I_0,...

A shift-left Shift Register (SR) and a D flip-flop are connected to a synchronized clock as shown in the Figure. Assume that the SR and D flip-flops are initially cleared and the X...

Consider the four-variable Boolean function, f(w, x, y, z) = ∑m(0,2,5,7,8,10,13,14,15) with 'w' as MSB and 'z' as LSB. Which of the following expressions is/are the valid form(s) o...

A 3-input majority logic gate has inputs X, Y, and Z. The output F of the gate is logic '1' if two or more of the inputs are logic '1'. The output F is logic '0' if two or more of...

A positive-edge-triggered sequential circuit is shown below. There are no timing violations in the circuit. Input P0 is set to logic '0' and P1 is set to logic '1' at all times. Th...

A 4-bit priority encoder has inputs $D_3, D_2, D_1$, and $D_0$ in descending order of priority. The two-bit output AB is generated as 00, 01, 10, and 11 corresponding to inputs $D_...

The propagation delay of the 2×1 MUX shown in the circuit is 10 ns. Consider the propagation delay of the inverter as 0 ns. If S is set to 1 then the output Y is _________.

In the circuit shown below, P and Q are the inputs. The logical function realized by the circuit shown below is

Addressing of a $32 K \times 16$ memory is realized using a single decoder. The minimum number of AND gates required for the decoder is :

In the circuit shown, A and B are the inputs and F is the output. What is the functionality of the circuit?

A function F(A, B, C) defined by three Boolean variables A, B and C when expressed as sum of products is given by F = $$\overline A .\overline B .\overline C + \overline A .B.\over...

The minimum number of 2-input NAND gates required to implement a 2-input XOR gate is

The Boolean expression (X+Y)(X+$$\overline Y $$)+($$\overline {(X\overline Y ) + \overline X } $$ simplifies to

For an n - variable Boolean function maximum number of prime implicants is

If X=1 in the logic equation $$\left[ {X + Z\left\{ {\overline Y + (\overline Z + X\overline {Y)} } \right\}} \right]$$ $$\left\{ {\overline X + \overline Z (X + Y)} \right\} = 1,$...

If the functions W, X, Y and Z are as follows W= R+$$\overline P Q + \overline R $$ S X = $$X = PQ\overline R \,\overline S + \overline P \,\overline Q \,\overline R \,\overline S...

The number of distinct Boolean expressions of 4 variables is

The Logical expression $$Y = A + \overline A B$$ is equivalent to

Two 2' s complement numbers having sign bits x and y added and the sign bit of the result is z. Then, the occurrence of overflow is indicated by the Boolean function.

The number of Boolean functions that can be generated by n variable is equal to:

Indicate which of the following logic gates can be used to realize all possible combinational Logic functions: