TUTORIAL-1

1. Simplify the following Boolean expression

abc’d+ab’c’d+abcd+a’b’c’d+abc’d’+a’bcd’
2. Simplify using k-map
F=Ʃm(0,1,4,7,9,13)+d(2,11)
3. Realize the following expression
ab’c+abc+ab’+ac’+a’b’c
4. Implement using any universal gate

5. Convert into canonical form

a’b+bc’+ab’c+ac

TUTORIAL-2
1. Consider a binary code that consists only four valid codewords as given below.

00000, 01011, 10101, 11110

Let minimum Hamming distance of code be ‘d’ and maximum number of erroneous
bits that can be corrected by the code be ‘e’. Find the value of ‘d’ and ‘e’.

2. Discuss the types of parity bit and discuss how the simple parity bit can detect a
damaged data unit with example.
3. Convert (A0CB.EE)16 = (___)10.
4. Represent 4 bit code 1101 into 7 bit even parity Hamming code.
5. Find the Excess 3 code of (546)10.

TUTORIAL-3
1. Implement the following function using Quine McCluskey method
F (A, B, C, D) =A’BC’D’+AB’C’D’+A’B’C’D+ABC’D+ABC’D’
2. Design the given function using Prime implicant method F=Ʃm(0,1,2,4,5,6,8,9,12)
3. 3. Realize ABC+AB’+BC’+A’BC using logic gates.
4. Realize F = XY + X(X + Z) + Y(X + Z) using logic gates.
5. Minimize the expression F(XYZ)=X’Y’Z + X’YZ+YZ’.
 TUTORIAL-4
1. Realize the expression using NOR gate only.
F = XY + X(X + Z) + Y(X + Z).
2. Implement Y= (B+C)(C+ D’)(A+ B +C’)
3. Convert into canonical form
F=ABCD+AB’C’D’+AB’C+AB
4. Realize using NAND gate only
Y=(AB+C)' D
5. Minimize the following
F=πM(0,2,3,6,7) + d(8,10,11,15)

TUTORIAL-5
1. Differentiate between a MUX and a De-MUX.
2. Realize F(w, x, y, z)= Σ m(1,4,6,10,11,15) using 8 to 1 MUX.
3. Explain adder subtractor circuit.
4. Design of a 1×8 demultiplexer circuit.
5. Implement F (A, B, C, D) = BC’+CD+B’CD’ using MUX.

TUTORIAL-6
1. Differentiate between an encoder and decoder.
2. Construct a 3:8 decoder using 2:4 decoder.
3. Construct a full subtractor using decoder.
4. Discuss a decimal to BCD encoder and draw the circuit using logic gates.
5. Perform the addition of (1101)2 with (1001)2.