summaryrefslogtreecommitdiff
path: root/3860/CH3/EX3.10/EX3_10.sce
diff options
context:
space:
mode:
Diffstat (limited to '3860/CH3/EX3.10/EX3_10.sce')
-rw-r--r--3860/CH3/EX3.10/EX3_10.sce51
1 files changed, 51 insertions, 0 deletions
diff --git a/3860/CH3/EX3.10/EX3_10.sce b/3860/CH3/EX3.10/EX3_10.sce
new file mode 100644
index 000000000..c49d62aba
--- /dev/null
+++ b/3860/CH3/EX3.10/EX3_10.sce
@@ -0,0 +1,51 @@
+//Example 3.10: Reduce expression using k-map *Don't be greedy*
+clc; //clears the window
+clear; //clears all existing variables
+//Mapping the expression//
+disp('This example is called as **Dont be greedy**')
+disp(' A''B'' A''B AB AB'' ')
+disp('C''D'' 1 ')
+disp('CD'' 1 1 1 ')
+disp('CD 1 1 1 ')
+disp('CD'' 1 ')
+disp(' From the map, high outputs are for 1,5,6,7,11,12,13,15 ')
+//given logic equation//
+a=[0 0 0 1;0 1 0 1;0 1 1 0;0 1 1 1 ;1 0 1 1;1 1 0 0;1 1 0 1;1 1 1 1']
+disp(a)
+for i=1: 8
+ if a(i,1)==1 then
+ b(i,1)='A'
+ else
+ b(i,1)='A'''
+ end
+ if a(i,2)==1 then
+ b(i,2)='B'
+ else
+ b(i,2)='B'''
+ end
+ if a(i,3)==1 then
+ b(i,3)='C'
+ else
+ b(i,3)='C'''
+ end
+ if a(i,4)==1 then
+ b(i,4)='D'
+ else
+ b(i,4)=' D'''
+ end
+end
+disp(' Evaluating expression from truth table and map ')
+x1=strcat([ b(1,1),b(1,2),b(1,3),b(1,4) ])
+x2=strcat([ b(2,1),b(2,2),b(2,3),b(2,4) ])
+x3=strcat([ b(3,1),b(3,2),b(3,3),b(3,4) ])
+x4=strcat([ b(4,1),b(4,2),b(4,3),b(4,4) ])
+x5=strcat([ b(5,1),b(5,2),b(5,3),b(5,4) ])
+x6=strcat([ b(6,1),b(6,2),b(6,3),b(6,4) ])
+x7=strcat([ b(7,1),b(7,2),b(7,3),b(7,4) ])
+x8=strcat([ b(8,1),b(8,2),b(8,3),b(8,4) ])
+x=[x1"+",x2"+",x3"+",x4"+",x5"+",x6"+",x7"+",x8]
+disp(x)
+//Expression is displayed//
+disp('Reduced expression using boolean algebra')
+disp('G= A''BC'' + A''CD + ABC + AC''D')
+