summaryrefslogtreecommitdiff
path: root/3860/CH2/EX2.9/Ex2_9.sce
diff options
context:
space:
mode:
Diffstat (limited to '3860/CH2/EX2.9/Ex2_9.sce')
-rw-r--r--3860/CH2/EX2.9/Ex2_9.sce8
1 files changed, 8 insertions, 0 deletions
diff --git a/3860/CH2/EX2.9/Ex2_9.sce b/3860/CH2/EX2.9/Ex2_9.sce
new file mode 100644
index 000000000..75d02db23
--- /dev/null
+++ b/3860/CH2/EX2.9/Ex2_9.sce
@@ -0,0 +1,8 @@
+//Example 2.9: Finding reduced boolean expression using Boolean laws
+clc // Clears the console
+disp('Z2 = A''BCD + AB''CD + ABC''D + ABCD'' + ABCD')
+disp('the last terms ABCD can be combined with each of the others. Thus, if we make four copies of it and then utilize for times we obtain')
+disp('Z2 = BCD + ACD + ABD + ABC')
+disp('No further simplification is possible; this is minimum SOP form')
+disp('Z1 = A''BCD + AB''CD + ABC''D + ABCD'' ')
+disp('In case of Z1 no simplification is possible it has 16 literals whereas expression for Z2 only has 12 literals.')