Scribd
Upload
9 views6 pages

In-Class Exercises 6

The document contains a series of exercises for a Discrete Structures course, focusing on Boolean functions and circuit design. Exercises include finding sum-of-products expansions, rewriting expressions without addition, using NAND operators, constructing circuits, simplifying Boolean functions using K-maps, and analyzing a truth table. Each exercise requires the application of logical operations and circuit design principles.

Uploaded by

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

In-Class Exercises 6

The document contains a series of exercises for a Discrete Structures course, focusing on Boolean functions and circuit design. Exercises include finding sum-of-products expansions, rewriting expressions without addition, using NAND operators, constructing circuits, simplifying Boolean functions using K-maps, and analyzing a truth table. Each exercise requires the application of logical operations and circuit design principles.

Uploaded by

foxblue259
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Name:mohammed mattar Student ID:60106724 Section:

DACS2101 – Discrete Structures


In-Class Exercises 6

Exercise 1
Find the sum-of-products expansion of the Boolean function F(w, x, y, z) that has the value 1 if and
only if an odd number of w, x, y, and z have the value 1. Draw the corresponding circuit.

1
Name:mohammed mattar Student ID:60106724 Section:

Exercise 2
Write the below expression without using the addition operation
a) x+y
b) x + y + z
c) x + y z

Exercise 3
The NAND operator is defined as x ↑ y=xy
Write the below expression by using only the NAND operator
a) x
b) x + y
c) x . y
d) What can you conclude?
e) Application: write x + y z using only the NAND operator

2
Name:mohammed mattar Student ID:60106724 Section:

Exercise 4
Construct circuits from inverters, AND gates, and OR gates to produce these outputs.

a)
b)
c)

d)

3
Name:mohammed mattar Student ID:60106724 Section:

Exercise 5
Simplify each Boolean function using K-maps.
a) x yz+ x y z
b) xyz + xy z+ x yz + x y z
c) xy z+ x y z + x y z + x yz+ x y z
d) xyz + x y z + x y z
e) xyz + x y z + x y z + x y z
f) x y z + x y z + x y z+ x y z

4
Name:mohammed mattar Student ID:60106724 Section:

Exercise 6
We consider the function F of four variables defined by the following truth table:

W X Y Z F(W,X,Y,Z)
0 0 0 0 1
0 0 0 1 1
0 0 1 0 0
0 0 1 1 1
0 1 0 0 0
0 1 0 1 0
0 1 1 0 0
0 1 1 1 1
1 0 0 0 1
1 0 0 1 1
1 0 1 0 1
1 0 1 1 1
1 1 0 0 1
1 1 0 1 0
1 1 1 0 1
1 1 1 1 1

Reorder this table so that the variables W,X,Y,Z follow a Gray code.
Represent this function in a K-map, find the corresponding simplified expression, and draw the
corresponding circuit.

5
Name:mohammed mattar Student ID:60106724 Section:

You might also like