Prof. Dr. Thorsten Jungmann (last updated 2026-10-19)

Relates to DET-03 Representation and minimization of logic functions

Task

A logic function can be written in several equivalent forms: as a truth table, as a minterm list or a maxterm list, and as a canonical disjunctive normal form (DNF) or a canonical conjunctive normal form (CNF). In this exercise, you switch between these forms. In each function, the first variable has the highest weight, as in the truth tables of the lesson.

a) The function has the following truth table. Give its minterm list, its maxterm list, its canonical DNF and its canonical CNF.

Row
0001
1010
2101
3111

b) Set up the truth table of , and give its canonical DNF.

c) Give the minterm list and the canonical CNF of , and draw the two-level circuit of the canonical CNF.

d) The function has the following truth table. Give its minterm list and its maxterm list. Which of the two canonical normal forms needs fewer gates? Write that normal form down.

Row
000001
100010
200101
300111
401001
501011
601100
701111
810001
910011
1010101
1110110
1211000
1311011
1411101
1511111