summaryrefslogtreecommitdiff
path: root/1964/CH15/EX15.13/ex15_13.sce
blob: d7a2d70d4f2e1535b7adff7d9a4439db30dbfb2b (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
//Chapter-15, Example 15.13, Page 503
//=============================================================================
clc
clear
//CALCULATIONS
//for (a)
disp('given=> Y=(A+AB+AB''C)')
disp('Y=A+AB''C')//by (A+AB=A)------>step 1
disp('A(A+B''C)')//by distributive law--------->step 2
disp('A(1.(1+B''C))')//by talking A as common--------->step 3
disp('A.1=A')//by 1+B''C=1--------->step 4
//for (b)
disp('given=> Y=(A''+B)C+ABC')
disp('A''C+BC+ABC')//by distributive law-------->step 1
disp('A''C+BC(1+A)')//by taking BC as common--------->step 2
disp('A''C+BC')//by rule 2 --------->step 3
disp('C(A''+B)')//taking C as common term-------->step 4
//for (c)
disp('given=> Y=(AB''BCD+AB''CDE+AC'')')
disp('AB''CDE+AC''')//applying rules 8 and 7 to first and second terms,respectively -------->step 1
disp('A(B''CDE+C'')')//taking A as common term--------->step 2
disp('A(B''DE+C'')')//by applying B''CDE+C'=B'DE+C'--------->step 3
//=================================END OF PROGRAM=======================================================================================================