Professional Documents
Culture Documents
Cte 121
Cte 121
Cte 121
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
Digital Computer Fundamentals I
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
CTE 121
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
e n v i l l e p o l y t e c h n i c e n v i l l e p o l y t e c h n i c e n v i l l e p o l y t e c h n i cEnville
e n v i l l e pPolytechnic
olytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
Elijah Emmanuel
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
envillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnicenvillepolytechnic
CHAPTER 1
THE CONCEPT OF DATA AND INFORMATION PRESENTATION IN DIGITAL SYSTEM
Digits of a Number: This is defined as a single symbol used alone (e.g “3”) or in combination (e.g “37”) to
represent number in a positional number system. The ten numerical digits are in order of their value
arranged as: 0,1,2,3,4,5,6,7,8,9.
Number Base: This is also called positional number system or number system. It is defined as the number
of unique digits including zero, used to represent number. In any standard positional number system, a
number is conventionally written as xy with x as the string of digits and y as its base or radix.
Note: for number in base ten, the base is usually assumed and therefore omitted.
Example
a. 1734 = (1 x 1000) + (7 x 100) + (3 x 10) + (4 x 1)
b. 568.23 = (5 x 100) + (6 x 10) + (8 x 1) + (2 x 0.1) + (3 x 0.01)
c. EGN.DR = (E x 102) + (G x 101) + (N x 100) + (D x 10-1) + (R x 10-2) In general.
https://www.javatpoint.com/python-tutorial
Solution:
Therefore, 421510 =10000011101112
2. Convert the following decimal numbers to their binary equivalents:
(a) 0.375
Solution:
Decimal to Octal
Decimal numbers can be converted to octal by repeated division of the number by 8 while recording the
remainder. Let’s take an example to see how this happens.
Reading the remainders from bottom to top,
47310 = 7318
Example 3
Convert the decimal numbers to their octal equivalents: (a) 2980
Solution:
2980
(b) 0.685
Solution:
0.685
101100101012 = 26258
To convert an octal number to binary, each octal digit is converted to its 3-bit binary equivalent according to
this table.
Octal Digit 0 1 2 3 4 5 6 7
Binary Equivalent 000 001 010 011 100 101 110 111
546738 = 1011001101110112
Binary to Hexadecimal
To convert a binary number to hexadecimal number, these steps are followed −
Write down the binary number and group the digits in set of four starting from right to left.
If the leftmost group doesn’t have enough digits to make up the set of four, add extra 0’s to make a
group.
Convert each group into its equivalent number.
Let’s take an example to understand this.
10110110101 2
Unlike a linear, or analogue circuits, such as AC amplifiers, which process signals that are constantly
changing from one value to another, for example amplitude or frequency, digital circuits process signals that
contain just two voltage levels or states, labelled, Logic “0” and Logic “1”.
Generally, logic “1” represents a higher voltage, such as 5 volts, which is commonly referred to as a HIGH
value, while logic “0” represents a low voltage, such as 0 volts or ground, and is commonly referred to as a
LOW value. These two discrete voltage levels representing the digital values of “1’s” (one’s) and “0’s”
(zero’s) are commonly called: BInary digiTS, and in digital and computational circuits and applications they
are normally referred to as binary BITS.
Because there are only two valid Boolean values for representing either a logic “1” or a logic “0”, makes the
system of using Binary Numbers ideal for use in digital or electronic circuits and systems.
The Special Relationship between Binary, Octal and Hexadecimal Number Systems
Now let's compare the number 827.2510 using the four number systems we have discussed. The table below
gives the value of this number in binary, octal, decimal, and hexadecimal.
When we order these numbers by the size of the base, we can see a general pattern: the smaller the base, the
more digits that are needed to represent the same number. We can also see a special relationship between
three of these number systems. Binary, octal, and hexadecimal all have bases that are powers of 2. This
relationship allows us to convert between these systems quite easily.
To convert 1473.28 to binary, we simply replace each digit with an equivalent 3-bit binary number.
We can see the 3 to 1 relationship between octal and binary when we compare their bases. Octal has a base
of 8 or 23 and binary has a base of 2 or 2 1. As you might guess, binary and hexadecimal have a 4 to 1
relationship since the base of hexadecimal is 16 or 24. We can also convert easily between binary and
hexadecimal using this 4 to 1 relationship.
Since octal and hexadecimal are easy to convert to binary, they are often used as a shorthand method for
writing binary numbers. For example, the code for the color blue in this text is 0033CC16 which is much
easier to read and write than the binary number below which is what the computer actually understands.
0000000000110011110011002 = BLUE
Example
3. Gray Code: It is the non-weighted code and it is not arithmetic codes. It has a very special feature, in
converting BCD code to gray code, you follow the following steps:
i. Record the MSB as it is
ii. Add the MSB to the next bit, record the um and neglect the carry
iii. Repeat the process
4. ASCII CODE: ASCII stands for American Standard Code for Information Interchange. Computers can
only understand numbers, so an ASCII code is the numerical representation of a character such as 'a' or
'@' or an action of some sort. It is a character encoding based on the English alphabet. The first 32
characters in the ASCII-table are unprintable control codes and are used to control peripherals such as
printers.
Note: to
convert
from either
binary or
BCD code
to Seven
6. Unicode: Is an international encoding standard use with different languages and scripts, by which each
letter, digit, or symbol is assigned to a unique numeric value that applies across different platforms and
programs. Below are the examples of Unicode. UNICODE function in excel “returns the number (code
point) corresponding to the first character of the text.” UNICODE is an encoding method that can be
applied for different encodings for the likes of UTF-8, UTF-16, etc. and was first introduced in Excel
2013 version. If you are using earlier versions, then you will not see this function.
In most of the websites, UTF-8 is the common encoding, and the first 128 characters are from the ASCII
character set. Some of the examples for UNICODE commonly used are and more:
CHAPTER 2
BINARY OPERATIONS
1. Binary Addition
Since binary number is number in base 2, if the sum of the bits is up to 2, write 0 and carry 1. Therefore in
binary:
0+0=0
0+1=1
1+0=1
1 + 1 = 1 0 (which is zero carry 1)
1 + 1 + 1 = 11 (which is one carry 1)
Example 1: 1000111
+0010110
1011101
Example 2: 1001
+1111
11000
Example3: 11.011
+10.110
110.001
2. Binary Subtraction
In binary subtraction, whatever thing you borrow is 2 and not 10 as in denary. This is for cases where you
cannot subtract one from 0.
0–0=0
1–1=0
1–0=1
0 – 1 = 1 0 (with a borrow of 1 which is 2)
Example 1: 1001
-101
0100
Example 2: 10000
-11
01101
Example 3: 110.01
-100.10
001.11
3. Binary Multiplication
Rule for binary multiplication are:
0x0=0
0x1=0
1x0=0
1x1=1
Example 1: 110
x100
000
000
110 .
11000
× 110.1
Solution:
Note: the decimal point is placed three places from the LSB. Because in 1011.01, the decimal point is 2
places from the LSB and in 110.1, the decimal point is placed 1 place from the LSB.
Example 3:
1010
×101
1010
0000
01010
1010 .
110010
4. Binary Division
The main rules of the binary division include:
1÷1 = 1
1÷0 = Meaningless
0÷1 = 0
0÷0 = Meaningless
Therefore, 1111100 ÷ 10 = 111110
2's complement
The 2's complement of binary number is obtained by adding 1 to the Least Significant Bit (LSB) of 1's
complement of the number.
2's complement = 1's complement + 1
Example of 2's Complement is as follows.
Example 3
Add + 1010 and - 1100
Solution:
+ 1 0 1 0 ⇒ 0 1 0 1 0
- 1 1 0 0 ⇒ 1 0 0 1 1 (1’s complement)
1 1 1 0 1
Hence the required sum is – 0010. (1’s complement)
Example 4
Add (ii) -0110 and -0111.
Solution:
- 0 1 1 0 ⇒ 1 1 0 0 1 (1’s complement)
- 0 1 1 1 ⇒ 1 1 0 0 0 (1’s complement)
1 0 0 0 1
1 carry
1 0 0 1 0
Hence the required sum is - 1101 (1’s complement of 0010)
Assignment
i. Add -1010 and -0101
ii. + 0011 and - 1101
Example 3
Find the sum of – 0011 and – 0101
Solution:
- 0 0 1 1 ⇒ 1 1 1 0 1 (2’s complement)
- 0 1 0 1 ⇒ 1 1 0 1 1 (2’s complement)
(Carry 1 discarded) 1 1 0 0 0
2’s complement of 1000 is (0111 + 0001) or 1000.
Hence the required sum is – 1000
Assignment
Add the following using 2’s complement:
i. + 0111 and – 0011
ii. + 0 1 0 0 and - 0 1 1 1
iii. -0111 and – 0010
Fixed Point Number Representation: In this method of number representation, data is converted into
binary form and then data processed, stored and used by the system.
Sign bit: A positive number has a sign bit “0”, while a negative number has a sign bit “1”.
Integral Part: The integral part is of different lengths at different places. It depends on the register’s size,
like in an 8-bit register, integral part is 4 bits.
Fractional part: Fractional part is also of different lengths at different places. It depends on the register’s
size, like in an 8-bit register; integral part is of 3 bits.
Example
Represent the following in fixed point notation
i. 4.510
ii. -15.87510
iii. +15.87510
Solution
i.
ii.
iii.
Note: Fixed point notation ranges from -15.875 to +15.875 which is very small. It is not suitable for
presenting large amount of data, so it is not used in computer nowadays.
Scientists feel that the system needs new representation format with no limit therefore they came up with
floating point representation.
To represent the values above in a digital computer, it has to be first converted from denary to binary that is;
The mantissa and the exponent will be in binary form, and the base will become 2 as shown in the examples
below:
Example 1:
Represent 6.5 x 103 in floating point using 16 bits register
Sol.
The mantissa: 6.510 = 110.12
The exponent: 310 = 112
Since both mantissa and exponent positive number, we write zero to precede each indicating positive
sign bit i.e. 0110.1 and 011 respectively.
Using 16 bits register, the mantissa will have 10 bits and the exponent 6 bits as shown below:
0 1 1 0 1 0 0 0 0 0 0 0 0 0 1 1
Mantissa Exponent
Example 2:
Represent the floating point below in denary
0 1 0 1 0 1 0 0 0 0 0 0 0 0 1 0
Mantissa Exponent
Note: The number of time you count the mantissa from the sign bit to either right or left to determine the
decimal place is based on the value and sight bit of the exponent.
Binary Conversion Scale:
32 16 8 4 2 1 0.5 0.25 0.12 0.0625
5
Example 3:
0 1 0 0 0 0 0 0 0 1 1 1 1 1 1 0
Mantissa Exponent
Sol.
Exponent = -2
Mantissa = 0.001 = 0.125
∴ 010000000102 = 0.12510
Exercise
Convert the following floating point binary numbers into denary using 16 bits register and both mantissa and
exponent in 2’s complement. (i)0110110000000100 (ii)0101000000111111. Answer (i) 13.510 (ii) 0.312510
CHAPTR 3
MINIMIZATION AND SIMPLIFIFICATION OF COMBINATIONAL DIGITAL CIRCUITS
Venn diagrams are the diagrams that are used to represent the sets, relation between the sets and operation
performed on them, in a pictorial way.
We can use the below formula to solve the problems based on two sets.
n(X ⋃ Y) = n(X) + n(Y) – n(X ⋂ Y)
The formula used to solve the problems on Venn diagrams with three sets is given below:
n(A ⋃ B ⋃ C) = n(A) + n(B) + n(C) – n(A ⋂ B) – n(B ⋂ C) – n(A ⋂ C) + n(A ⋂ B ⋂ C)
Complement of set
A’ is the complement of set A. This set contains all the elements which are not there in set A.
A + A’ = U
It means that the set formed with elements of set A and set A’ combined is equal to U.
(A’)’= A
The complement of a complement set is a set itself.
Properties of Complement of set:
A ∪ A′ = U
A ∩ A′ = φ
(A ∪ B)′ = A′ ∩ B′
(A ∩ B)′ = A′ ∪ B′
U′ = φ
φ′ = U
https://www.allaboutcircuits.com/textbook/digital/chpt-8/boolean-relationships-on-venn-diagrams/