Scribd
Upload
62 views1 page

EC110 ProbSheet1

This document contains a problem sheet with exercises on logic gates, Boolean algebra, and combinational circuits for students of the Department of Electronics & Communication Engineering at the National Institute of Technology Karnataka. The problem sheet includes exercises to prove Boolean identities, simplify logic functions, implement logic functions using circuits, obtain truth tables, minimize logic functions using K-maps, and design decoder circuits.

Uploaded by

Ayush Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
62 views1 page

EC110 ProbSheet1

This document contains a problem sheet with exercises on logic gates, Boolean algebra, and combinational circuits for students of the Department of Electronics & Communication Engineering at the National Institute of Technology Karnataka. The problem sheet includes exercises to prove Boolean identities, simplify logic functions, implement logic functions using circuits, obtain truth tables, minimize logic functions using K-maps, and design decoder circuits.

Uploaded by

Ayush Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Department of Electronics & Communication Engineering

National Institute of Technology Karnataka


Surathkal, Mangalore-575025(Karnataka), India
Problem Sheet-1
Module: Logic Gates, Boolean Algebra and Combinational Circuits
1.

2.

3.
4.

Using axioms, or theorems already proved, prove each of the following:


(i) X + X .Y = X + Y
(ii) X .( X + Y ) = X .Y
(iii) X .Y + X .Z + Y .Z = X .Y + X .Z (iv) ( X + Y ).( X + Z ).(Y + Z ) = ( X + Y ).( X + Z )
Simplify each of the following:
(i) A.B.C + A.B + A.B.C
(ii) X .Y .Z + X .Z (iii) ( X + Y ) .( X + Y )
(iv) A.C + A.B.C + A.C
(v) ( B.C + A.D ).( A.B + C .D )
If F = X + Y .Z find F . Hence verify F .F = 0 and F + F = 1
(a) Determine the logic function implemented by the circuit shown.
(b) Simplify the function and hence give an alternative logic circuit for the function and
implement it using NAND gates only.
C

X
A
B

5.

For each of the following functions, obtain the truth table and express each in sum of minterms
form:
. y + x.z )
. B + C )
(ii) ( A + B )(
(iii) + . + .
(i) ( x. y + z )(
6.
Simplify the following Boolean functions using K-map:
(a) F ( w, x, y, z ) = (2, 3,10,11,12,13,14,15) (b) F ( A, B, C , D) = (0, 2, 4, 5, 6, 7, 8,10,13,15)
(c) F ( w, x, y , z ) = w.x. y + y.z + x. y .z + x . y
(d) F ( A, B, C , D ) = A.B .C + B .C .D + B.C .D + A.C .D + A.B .C + A.B.C .D
7.
Simplify the following Boolean functions into product-of-sum form :
(a) F ( w, x, y, z ) = (0, 2, 5, 6, 7, 8,10)

8.

9.

(b) F ( A, B, C , D) = (1, 3, 5, 7,13,15)


Simplify the following Boolean functions taking into account the specified dont care
conditions:
d = (3, 6, 7)
(a) F ( x, y, z ) = (1, 2, 5)
(b) F ( A, B, C , D) = (0, 6, 8,13,14)

d = (2, 4,10)

(c) F ( A, B, C , D) = (1, 3, 5, 7, 9,15)

d = (4, 6,12,13)

Design 3 to 8 decoder logic circuit using 2 to 4 decoder with enable high and also write truth
table.

You might also like