Scribd
Upload
12 views4 pages

Boolean Algebra Exercises and Solutions

Uploaded by

Abu Ahmed Yacine
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
12 views4 pages

Boolean Algebra Exercises and Solutions

Uploaded by

Abu Ahmed Yacine
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

University of Blida Faculty of Sciences Department of Computer Science

1st Year of Engineering 1st Semester

Computer Architecture
– Tutorial 3 –

EXERCISE 1 :

1- Show how the AND operator can be obtained from the OR and NOT operators. Likewise, for
the OR operator using the AND and NOT operators.
2- Based on Boolean rules, demonstrate the following equalities:
 𝐵 + 𝐴𝐵 + 𝐴𝐵 = 1
 𝐴 + 𝐵 + 𝐵 + 𝐴𝐵 = 0
 (𝐴 + 𝐵)(𝐴̅ + 𝐵) = 𝐵
 𝐴̅ (𝐴̅ + 𝐵) + 𝐴𝐵 = 𝐴𝐵
 𝐴̅𝐵𝐶 + 𝐴̅𝐵𝐶̅ + 𝐴𝐵 𝐶 + 𝐴𝐵𝐶̅ = 𝐴 ⊕ 𝐵
 𝐴𝐵 + 𝐵𝐶 + 𝐴𝐶 + 𝐴 𝐵𝐶̅ + 𝐴̅𝐵𝐶̅ + 𝐴̅ 𝐵 𝐶 = 𝐴 + 𝐵 + 𝐶

EXERCISE 2:

- Determine the logical expressions corresponding to the following logic diagrams.

EXERCISE 3:

Simplify the following expressions using Boolean algebra rules:

1- 𝐹(𝐴, 𝐵, 𝐶) = (𝐴 + 𝐵 + 𝐶). (𝐴̅ + 𝐵 + 𝐶) + 𝐴 𝐵 + 𝐴̅ 𝐵 𝐶

2- 𝐹(𝐴, 𝐵, 𝐶) = 𝐴 + 𝐵 + 𝐴̅ + 𝐶̅ + 𝐴 + 𝐶

3- 𝐹(𝐴, 𝐵, 𝐶) = (𝐴 + 𝐵) . (𝐴 + 𝐵 + 𝐶) + 𝐴̅ + 𝐵 + (𝐴𝐵 + 𝐶). (𝐴𝐵 + 𝐶̅ )

4- 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = (𝐴̅ 𝐵 + 𝐴 𝐵 + 𝐴 𝐵). (𝐶 𝐷 + 𝐶̅ 𝐷) + 𝐶̅ 𝐷 (𝐴̅ 𝐵 + 𝐴 𝐵)

1/3
EXERCISE 4 :

1- Write the functions defined by the following propositions in the SOP canonical form :
 f(A, B, C) = 1 if and only if none of the variables A, B, C takes the value 0.
 f(A, B, C) = 1 if and only if at most two of the variables A, B, C takes the value 0.
 f(A, B, C) = 1 if and only if exactly two of the variables A, B, C takes the value 1.
 f(A, B, C) = 1 if and only if at least one of the variables A, B, C takes the value 0.

2- Write the functions defined by the following propositions in the POS canonical form :
 g(A, B, C) = 0 if and only if none of the variables A, B, C takes the value 0.
 g(A, B, C) = 0 if and only if at most two of the variables A, B, C takes the value 0.
 g(A, B, C) = 0 if and only if exactly two of the variables A, B, C takes the value 1.
 g(A, B, C) = 0 if and only if at least one of the variables A, B, C takes the value 1.

EXERCISE 5 :

Let's consider the following Boolean expressions:


𝐹(𝐴, 𝐵, 𝐶) = (𝐴 + 𝐵). (𝐶 + 𝐵). (𝐴̅ + 𝐶̅ )
𝐹(𝐴, 𝐵, 𝐶) = (𝐴. 𝐵 + 𝐴̅. 𝐶). (𝐴̅. 𝐵 + 𝐴. 𝐶̅ )
For each of these expressions:
1. Create the corresponding truth table.
2. Create the corresponding logic diagram.
3. Determine the SOP and POS canonical forms from the truth table.
4. Determine the SOP and POS canonical forms using the rules of Boolean algebra.

EXERCISE 6:

1- Simplify the following functions to the maximum extent using the Karnaugh map:

 F (A, B, C) = A B C + A C + A B C
 F (A, B, C) = A B C + A B C + A B C + A B C
 F (A, B, C, D) = B + A B + A B D + A B C D
 F (A, B, C, D) = A B C + 𝐴 𝐵 𝐶 D + B C D + A B C + A B 𝐶 D

2- Simplify the following expressions using 5-variable Karnaugh maps:

𝐹(𝐴, 𝐵, 𝐶, 𝐷, 𝐸) = (0, 1, 2, 4, 8, 10, 12, 14, 16, 17, 18, 20, 24, 26, 27, 30, 31)

𝐹(𝐴, 𝐵, 𝐶, 𝐷, 𝐸) = (0, 1, 4, 5, 8, 9, 10, 16, 17, 20, 21, 24, 26, 28, 29, 30, 31)

2/3
EXERCISE 7 :

- Analyze the following logic circuit :

EXERCISE 8 :
a jury consisting of 4 members asks a question to a player, who in turn provides an answer.
Each jury member toggles their switch to '1' when they believe the player's response is correct
(favorable opinion) and '0' otherwise (unfavorable opinion). The jury members' switches are labeled A,
B, C, D.
The response is processed in such a way that a success variable (S=1) is set when the majority
of the jury members are favorable, a failure variable (E=1) is set when the majority of the jury
members are unfavorable, and an equality variable (N=1) is set when there is an equal number of
favorable and unfavorable opinions.

Based on these assumptions::

- Deduce a truth table for the problem.


- Provide the simplified equations for S and E.
- Deduce the equation for N.

EXERCISE 9 :
The following figure represents the block diagram of a combinational circuit with four inputs A3, A2,
A1, A0, and a two outputs S0 et S1. The operation of this circuit is summarized as follows:
– When only one input line among A3, A2, A1, and A0 is at a high level (i.e., equal to 1),
its number is encoded in binary on the outputs S1 and S0.
– If multiple input lines are simultaneously at a high level, the highest-numbered line is
encoded.
– If all input lines are at a low level, the outputs S1 and S0 will be set to 0.
Examples :

– If (A3, A2, A1, A0) = (0,0,0,0) So: (S1, S0) = (0,0)


– If (A3, A2, A1, A0) = (0,0,1,0) So: (S1, S0) = (0,1)
– If (A3, A2, A1, A0) = (0,1,1,0) So: (S1, S0) = (1,0)

3/3
1- Establish the truth table for this circuit.
2- Provide the simplified logical equation for S1 and S0 using Karnaugh maps.
3- Draw the logical diagram of the simplified circuits.

4/3

Common questions

Powered by AI

Using a Karnaugh map to simplify complex Boolean functions involves plotting the function's true values onto a grid that represents all possible combinations of input variables. Groups of adjacent 1s are formed (minterms) and then represented by simplified Boolean terms. Overlapping and identifying larger groupings in powers of two enables further simplification, ensuring each cell's relation to the function's output is considered without redundant terms .

To simplify the expression 𝐹(𝐴, 𝐵, 𝐶) = (𝐴+ 𝐵) . (𝐴+ 𝐵+ 𝐶)' using Boolean algebra, first apply De Morgan's laws and distribution properties. This ultimately leads to more manageable terms via negations and distributions, leveraging the rule that distributing complements within grouped terms often results in inevitable reductions through identified identities (e.g., A+A' and B+B') that cancel each other, minimizing overall complexity .

In this combinational circuit, the operational rule encodes the binary number of the highest active input line among A3, A2, A1, A0. Each input represents a binary code output on S1 and S0, with the highest line taking precedence, effectively pairing the maximum active input level to a binary encoder output. If no line is active, a (0,0) state is output. The truth table and Karnaugh map can verify and derive simplified logical equations for S0 and S1 .

The XOR operator can be expressed using basic logic gates in Boolean algebra with the formula: A XOR B = (A AND B') OR (A' AND B). This expression shows XOR's inequality condition where differing inputs yield true, utilizing only the AND, OR, and NOT operators to emphasize exclusive alternation .

The POS form for a function g(A, B, C) = 0 if at least one of the variables is 1 can be constructed by considering the OR operation to cover all conditions excluding the given: g = (A' + B' + C'). The function outputs 0 when all variables are satisfied to not equal 0, indicating a lack of fulfilment for the OR clause contrary to the sum condition full realization .

The AND operator can be derived using the OR and NOT operators by applying De Morgan's Theorems. Specifically, the expression for AND in terms of OR and NOT is given by the formula (A AND B) = NOT (NOT A OR NOT B). This transformation uses De Morgan's law, stating that conjunctions can be rewritten as negations of disjunctions, and allows expressing AND with only OR and NOT operations .

To determine the majority opinion among switches A, B, C, and D, their binary inputs must be analyzed to ensure that at least three switches are in the '1' position. The success variable S=1 when the sum A+B+C+D is equal to or greater than 3, whereas the failure variable E=1 when the sum A+B+C+D is 2 or less. Additionally, N=1 when the sum equals exactly 2, indicating an equal favorable and unfavorable opinion count .

The logical function that results in an output of 1 only when all variables A, B, and C are equal to 1 is the product (AND operation) of all the variables: f(A, B, C) = A AND B AND C. In Boolean algebra, this condition directly represents the conjunction where all inputs need to be true, adhering to straightforward multiplication of states for representation .

The expression (A + B)(A' + B) simplifies to B because applying the Distributive Law gives B as a common term. The equation represents the 'absorption' identity, where one term takes precedence due to overlap. This reflects a known identity where one input, when masked by a contradictory term, leaves the common input (B) as the result .

The Boolean expression in the Sum of Products (SOP) form for the function where f(A, B, C) = 1 if exactly two variables are 1, can be represented as: f = AB'C + A'BC + ABC'. This expression covers each combination where exactly two out of the three variables are true while the third is false .

You might also like