Chapter - 1
NUMBER SYSTEM
Number System
A number system in computer ideology is regarded as the method or system of
numbering and representing of digits in the computer ‘inner’ system. In other words, it is a
technique used in representing numbers in the computer system architecture. The digital
computer represents all kinds of data and information in binary numbers. This implies every
value/number that you are saving or feeding into/fetching from the computer system memory
has a defined number system. The value/data feed in/fetch from can includes but not limited
to: audio, graphics, video, text file, numbers etc. The total number of digits used in a number
system is called its base or radix. The base is written after the number as subscript; for instance
10001102 (1000110 base 2), 5610 (56 to base of 10), 718 (71 base 8) etc.
Computer architecture supports following number systems.
i. Binary number system (Base 2)
ii. Octal number system (Base 8)
iii. Decimal number system (Base 10)
iv. Hexadecimal number system (Base 16)
The above all are also known as Positional Number system.
1) Binary Number System
A Binary number system has only two digits, which are 0 and 1. Every number (value) is
represented with 0 and 1 in this number system. The base of binary number system is 2, because
it has only two digits. Though DECIMAL (No 3) is more frequently used in Number
representation, BINARY is the number system form which the system/machine accepts.
2) Octal number system
Octal number system has only eight (8) digits from 0 to 7. Every number (value) is represented
with 0,1,2,3,4,5,6 and 7 in this number system. The base of octal number system is 8, because
it has only 8 digits.
3) Decimal number system
Decimal number system has only ten (10) digits from 0 to 9. Every number (value) is
represented with 0,1,2,3,4,5,6, 7,8 and 9 in this number system. The base of decimal number
system is 10, because it has only 10 digits.
4)Hexadecimal number system
A Hexadecimal number system has sixteen (16) alphanumeric values from 0 to 9 and A to F.
Every number (value) represents with 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E and F in this
number system. The base of hexadecimal number system is 16, because it has 16 alphanumeric
values. Here, we have 0 to 9, representing 0 – 9 but from 10, we have A is 10, B is 11, C is 12,
D is 13, E is 14 and F is 15.
The table above shows the sample representations
Number system Base Used digits Example
Binary 2 0,1 (11110000)2
Octal 8 0,1,2,3,4,5,6,7 (360)8
Decimal 10 0,1,2,3,4,5,6,7,8,9 (240)10
0,1,2,3,4,5,6,7,8,9,
Hexadecimal 16 (F0)16
A,B,C,D,E,F
Remaining All the Examples / Conversions are available in Assignment Note.
Chapter – 2
Propositional Logic(PART - I)
Propositional Logic
The simplest ,and most abstract logic we can study is called propositional logic. Propositional logic
can be described as a simple form of logic where propositions are used to create all the statements. The
proposition can be described as a declarative statement, which means it is used to declare some facts.
The statements of propositional logic can either be true or false, but they cannot be both.
Propositional Constant
A propositional constant is an example of a statement with a definite truth value
TRUTH TABLE
The truth table is a systematic representation of all truth values of a logical expression. It consists of all
the inputs and gives the required output. It takes a combination of inputs to get the desired output. Truth
tables are mainly used in Boolean algebra so, a variable can take two values 0 or 1.
As in the truth table, we generally work with binary there will be 2n number of rows, where n is the
number of input variables.
The basic logic operations are – negation, conjunction, disjunction, conditional and biconditional.
1. Negation
The negation of statement p is another statement that is exactly the opposite of statement p. The
negation of p is "not p."The symbol used to indicate the negation is ∼, and the negation of
statement p is written ∼p.
p ∼p
0 1
1 0
2. Conjunction
If p and q are simple statements, their conjunction is “p and q” noted as p∧q.
p q p∧q
0 0 0
0 1 0
1 0 0
1 1 1
3. Disjunction
If p and q are simple statements, their disjunction is “p or q” noted as p∨q.
p q p∨q
0 0 0
0 1 1
1 0 1
1 1 1
4. Conditional
A conditional statement consists of two simple statements p and q joined as “If p, then q.” We write
this as p→q. The simple statement used in the "if" part is the antecedent and the simple statement used
in the "then" part is called the consequent. Sometimes a conditional statement is called
an implication, and we say that "p implies q.
p q p→q
0 0 1
0 1 0
1 0 1
1 1 1
Remaining All the Examples / Conversions are available in Assignment Note.
5. Biconditional
A biconditional statement/Equivalence consists of two simple statements p and q joined as “p if and
only if q.” A biconditional statement is a conjunction of the two conditional statements "If p, then q"
and "If q, then p." We write this as p↔q.
p q p↔q
0 0 1
0 1 0
1 0 0
1 1 1
A truth table can be termed as either tautology ,contradiction or contingency.
• Tautology
A proposition that is always true, regardless of the truth values of its variables. In a truth table, a
tautology is true in every row.
• Contradiction
A proposition that is always false, regardless of the truth values of its variables. In a truth table, a
contradiction is false in every row.
• Contingency
A proposition that is neither a tautology nor a contradiction, meaning it can be true in some cases and
false in others. In a truth table, a contingency has at least one row where it is true and at least one row
where it is false.
Chapter – 2
LOGIC GATES AND TRUTH TABLE(PART - II)
A logic gate is a building block of a digital circuit. Most logic gates have two inputs and one output and are
based on Boolean algebra. At any given moment, every terminal is in one of the two binary conditions
true (high) or false (low). False represents 0, and true represents 1. Depending on the type of logic gate being
used and the combination of inputs, the binary output will differ.
Basic logic gates
There are seven basic logic gates: AND, OR, XOR, NOT, NAND, NOR, and XNOR.
AND gate
Input 1 Input 2 Output
0 0 0
0 1 0
1 0 0
1 1 1
OR GATE
Remaining All the Examples / Conversions are available in Assignment Note.
NOT GATE
NAND GATE
NOR GATE
EXCLUSIVE-OR GATE (X-OR) GATE
Remaining All the Examples / Conversions are available in Assignment Note.
EXCLUSIVE-NOR (X-NOR) GATE
Remaining All the Examples / Conversions are available in Assignment Note.