3 Corrected exercises on Boolean Algebra

Corrected exercises on Boolean algebra and Karnaugh table

This tutorial offers corrected exercises on Boolean algebra and Karnaugh diagrams or tables.

Boolean algebra

Exercise 1

The K-Gaz company decides to recruit employees internally for its subsidiary.

For each employee, we define the following Boolean variables:

  • a = 1 if he has more than 5 years of seniority in the company
  • b = 1 if he has a BTS-IG
  • c = 1 if he speaks fluent English

The human resources department decides that employees can apply:

  •  that meet the three conditions
  •  or who have less than 5 years of seniority but who master English
  • or who do not speak English who have a BTS-IG

Here are the questions:

  1. Give the HR criteria in Boolean expression
  2. Represent the expression by a Karnaugh array
  3. Simplify it
  4. Find the result by calculation using backspace
  5. Conclude on the simplified version

Question 1

Karnaugh boolean algebra

Question 2

We mark a 1 each time an element of the Boolean expression is true.

Karnaugh boolean algebra

Question 3

To simplify the expression, we look in the table at the squares of 4 elements or the rectangles of two elements (not necessarily connected) of which at most one literal changes between row and column.

For example, the green rectangle, only the literal b changes, so äc does not change (ä considering the row and c considering both columns). In the red square, in column, only b changes (a changes in rows, and c changes in column).

We deduce the simplified expression.

Karnaugh boolean algebra

Question 4

The technique of backtracking consists in going back little by little on the results according to the lack of computational element. For example, after factoring by b, we will have ac + C_barre. In view of the formula, it is obvious that ac + äc + c_barre would be necessary for this expression to be equal to 1.

Thus, each time that a computational element is missing to arrive at its finality, it is possible to transform the preceding calculation lines by adding already existing elements or by multiplying by 1 such as for example b + b_barre to reach its ends.

Here is the final reasoning:

Karnaugh boolean algebra

Question 5

Deduces from this that the HR accepts applicants who have a BTS-IG or who have less than 5 years of seniority but mastering English.

Exercise 2

The person in charge of the computer park of a company considers the acquisition of new computers. To equip himself, this manager goes to a computer equipment sales company that offers predefined configurations (computer and peripherals).

We define the criteria:
a: the configuration includes a DVD burner;
b: the configuration includes a printer;
c: the configuration includes a scanner.

Equipment constraints exclude the configuration with a DVD burner but without a scanner, as well as the configurations without a burner and without a printer.

Here are the questions:

  1. Give the Boolean expression E translating the exclusion conditions
  2. Set the Karnaugh table of E
  3. Translate and say if a (b_barre) c is accepted
  4. Determine an expression of F reflecting the acceptance conditions.
  5. Translate the simplified version of F.

1- The expression is E = a (c_barre) + ä (b_barre)

2- The Karnaugh table of E is 

Karnaugh boolean algebra

3- the expression means equipped with a DVD burner and a scanner but without a printer. She is not present in E's Karnaugh so she is allowed

4- Here is the Karnaugh of E

Karnaugh boolean algebra

In green c varies. In red b varies.

5- The simplified expression gives either an engraver and a scanner; or no burner and printer.

Exercise 3

The director of human resources (HRD) of a town hall must recruit a person for a job concerning the circulation of cars in the city center.

To make his choice, the HRD sets up three selection criteria concerning knowledge in computer science, experience in the field concerned and the follow-up of a specific training course.

The recruited person must:

  • have computer knowledge and experience in the relevant field;
  • or not have computer knowledge, but have followed a specific training course;
  • or not have experience in the field concerned, but have followed a specific training course.

We define the following three Boolean variables a, b and c:

  • a = 1 if the person has computer knowledge, a = 0 otherwise;
  • b = 1 if the person has experience in the field concerned, b = 0 otherwise;
  • c = 1 if the person has followed a specific training course, c = 0 otherwise.

Here are the questions:

  1. Describe the situation corresponding to the product ab / c
  2. Define the Boolean expression E corresponding to the HRD selection criteria.
  3. Find a simplified writing of the Boolean expression E.
  4. Explain the simplified version.

1- ab / c means that the person has computer knowledge (a = 1) and experience in the field concerned (b = 1), but has not followed a specific training course (c = 0).

2- E = ab + / ac + bc

3- Karnaugh's table and its simplified model is as follows

Karnaugh boolean algebra

4- This means: The person has computer knowledge (a = 1) and experience in the field concerned (b = 1) OR has followed a specific training course (c = 1).