A

Presentation
On
“DIGITAL TECHNIQUES AND MICROPROCESSOR”
By

Gaurav Kailas Sonawane

nd
Diploma 2 year IF

Under The Guidance of

Mr. Swapnil Deshmukh.

Department of Information Technology

G. H. Raisoni Polytechnic Savkheda Jalgaon
Maharashtra State Board of Technical Education
Mumbai
Year 2019-2020 1
Number System :
• A number system defines a set of values used to represent a quantity.
• Computer architecture supports following number systems.

1. Binary number system

2. Octal number system

3. Decimal number system

4. Hexadecimal (hex) number system

2
1. Binary number System :
 A binary number system uses only two digits that are 0 and 1.
 The base of binary number system is 2, because it has only two
digits.
Example :
Mathematically, we can write it as
1101.011 = (1 × 23) + (1 × 22) + (0 × 21) + (1 × 20) + (0 × 2-1) + (1 × 2-2)
+ (1 × 2-3)

2. Octal number system :-

The base use for octal number is 8.
Example :
Mathematically, we can write it as
1457.236 = (1 × 83) + (4 × 82) + (5 × 81) + (7 × 80) + (2 × 8-1) + (3 × 8-2)
+ (6 × 8-3)

3
3. Decimal number system :-
In Decimal number system we can expressed any decimal
number in units or tens, hundreads so on.
Example :
Mathematically, we can write it as
1358.246 = (1 × 103) + (3 × 102) + (5 × 101) + (8 × 100) +
(2 × 10-1) + (4 × 10-2) + (6 × 10-3)

4. Hexa-decimal number system:

 It has base of 16 having 16 character 0 to 9 and A to F.
Example :
Mathematically, we can write it as,
1A05.2C4 = (1 × 163) + (10 × 162) + (0 × 161) + (5 × 160)
+ (2 × 16-1) + (12 × 16-2) + (4 × 16-3)

4
 Boolean Algebra
Rules of boolean algebra :

1) Binary 1 for HIGH and Binary 0 for LOW.

2) Complement of variable is represented by a ovrbar(-). Thus
complement of variable B is represented as ‾B. Thus if B=0
then ‾B = 1 and if B=1 then ‾B=0.
3) ORing of the variables is represented by a plus (+) sign
between them. For EX. ORing of A, B, C is represented as A + B
+ C.
4) ANDing of the variables is represented by a dot (·) sign
between them. For EX. ORing of A, B, C is represented as
A·B·C
5
Boolean Laws :
1. Commutative Law : Commutative law states that we can
change the sequence of the variables (inputs) without
having any effect on the output of a logic circuit.
a. A.B=B.A
b. A+B=B+A

2. Associative Law : This law states that the order in which

the logic operation are performed is not at all important
ultimate outcomes is the same. i.e.
a. (A · B) · C = A · (B · C)
b. (A + B) + C = A + (B + C)

3. Distributive Law : The Distributive law states that following

condition
A · (B + C) = AB + AC
6
4. AND Law : a) A · 0 = 0
b) A · 1 = A
c) A · A = A
d) A · A = 0

5. OR Law : a) A + 0 = A
b) A + 1 = 1
c) A + A = A
d) A +‾A = 1

6. INVERSION Law : This law uses the “NOT”

operation.
if A = 0 then ‾A = 1 and (‾ˉA) = 0
.: A = (‾ˉA) = 0

7
 8 bit substraction
 The SUB instruction is used to substract the data in source from the data
in destination and stores result in destination.
Operation :-
Destination ← source - destination

8
8086 Microprocessor
Instruction Set

8086 supports 6 types of instructions.

1. Data Transfer Instructions

2. Arithmetic Instructions

3. Logical Instructions

4. String manipulation Instructions

5. Process Control Instructions

6. Control Transfer Instructions

9
8086 Microprocessor Assemble Directives

 Instructions to the Assembler regarding the program being

executed.
 Control the generation of machine codes and organization of
the program; but no machine codes are generated for
assembler directives.
 Also called ‘pseudo instructions’

 Used to :
 specify the start and end of a program
 attach value to variables
 allocate storage locations to input/ output data
 define start and end of segments, procedures, macr etc..

10