Question

In: Computer Science

use logism: For each of the following functions, simplify using Karnaugh Maps, then build, and hand...

use logism: For each of the following functions, simplify using Karnaugh Maps, then build, and hand in a properlydocumented circuit. You need to submit both a K-Map as well as the circuit for each part. a) F1 (a,b,c,d) = Σ(1, 2, 3, 4, 5, 9,10,11) b) F2 (a,b,c,d) = Σ(2, 3, 4, 6, 8, 11, 15) δ(a,b,c,d) = Σ(0, 5, 7, 9, 10)

Solutions

Expert Solution

a)

The given function is :

F1 (a,b,c,d) = Σ(1, 2, 3, 4, 5, 9,10,11)

The Kmap for the given function is :

There is only one quad and 2 pairs.

Quad1 = b ' d

Pair1 = a ' b ' c

Pair2 = a ' b c '

The simplified expression for F1 ( a,b,c,d) is :

F1 = b ' d +   a ' b ' c +  a ' b c ' = b ' d + a ' ( b XOR c ).

The circuit diagram using logism is :

In the above figure, if the values of a, b, c and d are 0, 0, 1 and 0, then the output will be 1 that is true.

b)

The given function is :

F2 (a,b,c,d) = Σ(2, 3, 4, 6, 8, 11, 15)

The don't care function is :

δ(a,b,c,d) = Σ(0, 5, 7, 9, 10)

The Kmap for the given function is :

Here, x represents a don't care value.

There are 4 quads.

Quad1 = c d

Quad2 = a ' c

Quad3 = a ' b

Quad4 = a b '

The simplified expression for F2 ( a,b,c,d) is :

F2 = c d +  a ' c + a ' b +  a b ' = c ( d + a ' ) + ( a XOR b ).

The circuit diagram using logism is :

In the above figure, if the values of a, b, c and d are 0, 1, 0 and 0, then the output will be 1 that is true.


Related Solutions

Simplify the following logical function using Karnaugh Maps. You will write the result as a sum...
Simplify the following logical function using Karnaugh Maps. You will write the result as a sum of products. Do not leave blank spaces in the expression. Write the literals of the terms in alphabetical order. For example, instead of writing the term acb 'write ab'c. Write the function starting with the term that has the fewest literals, and then proceeding in ascending order of literals per term. That is, if for example the simplified function has a term with 4...
For each of the following functions, find all the minimum SOP expressions using the Karnaugh map....
For each of the following functions, find all the minimum SOP expressions using the Karnaugh map. g(v,x,y,z,w)= Σm(0,1,4,5,8,9,10,15,16,18,19,20,24,26,28,31)       (1 solution)
1) For each of the following functions, find all the minimum SOP expressions using the Karnaugh...
1) For each of the following functions, find all the minimum SOP expressions using the Karnaugh map. a) f(a,b,c) = Σm(0,1,5,6,7) (2 solutions) b) g(v,x,y,z,w)= Σm(0,1,4,5,8,9,10,15,16,18,19,20,24,26,28,31) (1 solution) c) h(a,b,c,d) = Σm(01,2,5,7,9)+Σd(6,8,11,13,14,15) (4 solutions) d) f(a,b,c,d) = Σm(5,7,9,11,13,14)+Σd(2,6,10,12,15) (4 solutions)
1. Simplify each of the following sets as much as possible. a) ((? ∪ ??)? ∩...
1. Simplify each of the following sets as much as possible. a) ((? ∪ ??)? ∩ (? ∩ ∅?))? b) (ℤ ∩ ℚ+)? ∩ ℤ? 2.  Determine the cardinality of each set: a) ((ℂ − ℝ) ∩ ℕ) ∪ (ℤ+ − ℕ) b) ?(ℤ?? ∩ ℤ??)
Simplify the following Boolean expressions to the minimum number of terms using the properties of Boolean...
Simplify the following Boolean expressions to the minimum number of terms using the properties of Boolean algebra (show your work and write the property you are applying). State if they cannot be simplified A. X’Y + XY B. (X + Y)(X + Y’) C. (A’ + B’) (A + B)’ D. ABC + A’B + A’BC’ E. XY + X(WZ + WZ’)
Simplify the following Boolean expressions to the minimum number of terms using the properties of Boolean...
Simplify the following Boolean expressions to the minimum number of terms using the properties of Boolean algebra (show your work and write the property you are applying). State if they cannot be simplified. A. A’B + AB B. XY + X(WZ + WZ’) C. X’Y’(X’+Y)(Y’+Y) D. ABC + A’B + A’BC’ E. (A+B)(AC+AC’)+AB+B Draw the circuit logic diagrams for both the original and simplified expressions.
Symbolize the following arguments then check for validity using a truth table. To simplify, leave the...
Symbolize the following arguments then check for validity using a truth table. To simplify, leave the parenthetical parts out of your symbolization. All of the arguments are based loosely on arguments in Chapter One of The Branded Mind by Eric Du Plessis. A.(The primary function of emotions is to direct attention, so) If your client’s purchase was motivated by emotion then it was related to attention. Your client’s purchase was (motivated by a desire for well-being or cultural acceptance and...
In this assignment, we will build custom functions in R. As an example, the following function...
In this assignment, we will build custom functions in R. As an example, the following function called addPercent converts a value into a percentage with one decimal place. addPercent - function(x){ percent - round(x*100, digits = 1) result - paste(percent, "%", sep = "") return(result) } Below are a few output results from this function. addPercent(.1) [1] "10%" addPercent(10) [1] "1000%" addPercent(10.1) [1] "1010%" addPercent(0.1443) [1] "14.4%" Write a custom R function that inputs a temperature in Fahrenheit Fo and...
42. Describe the order of growth of each of the following functions using O notation. a....
42. Describe the order of growth of each of the following functions using O notation. a. N2+3N b. 3N2+N c. N5+100N3+245 d. 3NlogN+N2 2 e. 1+N+N2 +N3 +N4 f. (N * (N − 1)) / 2 Describe the order of growth of each of the following code sections, using O notation: count = 0; for (i = 1; i <= N; i++) count++; count=0; for (i = 1; i <= N; i++) for (j = 1; j <= N; j++)...
You must write each of the following scheme functions. You must use only basic scheme functions...
You must write each of the following scheme functions. You must use only basic scheme functions do not use third-party libraries to support any of your work. Do not use any function with side effects. Write a function (merge-sorter L1) that takes list-of-integers L1 and returns all elements of L1 in sorted order. You must use a merge-sort technique that, in the recursive case, a) splits L1 into two approximately-equal-length lists, b) sorts those lists, and then c) merges the...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT