Number System

Made by :
Megha Sharma - 15
Tanu Chaturvedi - 17
Divya Gorey - 25
Arpit Kapoor - 42
Introduction
 writing system for expressing numbers, that is a mathematical
notation for representing numbers of a given set, using
symbols in a consistent manner.

 It can be classified into 2 types

 Non Positional Number System

 Positional Number System

Non Positional Number System
 In early days human begins counted on fingers , stones ,
pebbles , sticks or stones.
 This method of counting uses an additive approach or the
non-positional number system.
 In this system, we have symbols such as I for 1, II for 2, III for
3, IIII for 4, IIIII for 5, etc.
 Each symbol represents the same value regardless of its
position in the number and the symbols are simply added to
find out the value of a particular number.
Positional Number System
 In a positional number system, there are only a few symbols
called digits, and these symbols represent different values
depending on the position they occupy in the number.
 The value of each digit in such a number is determined by
three considerations:
1. The digit itself,
2. The position of the digit in the number, and
3. The base of the number system.
 Example :- Decimal, Binary, Octal, Hexadecimal
 Decimal Number System
 The decimal numeral system (also called base ten or
occasionally denary) has ten as its base.
 It has Symbols from 0-9
 It’s the most widely used number system
Binary Number System
 The binary numeral Decimal Binary
system, or base-2
number system, 0 0
represents numeric values 1 1
using two symbols, 0 and
1. 2 10
 Owing to its straightforward 3 11
implementation, the binary
system is used internally by 4 100
all modern computers. 5 101
6 110
7 111
Hexa-Decimal Number System
 It’s a base 16 number system
 It uses sixteen distinct symbols, most often the symbols 0–9 to
represent values zero to nine, and A, B, C, D, E, F (or
alternatively a to f) to represent values ten to fifteen.
 Each hexadecimal digit represents four binary digits (bits) and
the primary use of hexadecimal notation is as a human-
friendly representation of binary coded values in computing
and digital electronics.
 For example, byte values can range from 0 to 255 (decimal)
but may be more conveniently represented as two
hexadecimal digits in the range 00 through FF.
 Its commonly used to represent computer memory addresses.
 It may seem ambiguos
Hexa- Decimal Number System
Hexa- Hexa-
Decimal decimal Decimal decimal

0 0 8 8
1 1 9 9
2 2 10 A
3 3 11 B
4 4 12 C
5 5 13 D
6 6 14 E
7 7 15 F
Octal Number System
 The octal numeral system, or oct for short, is the base-8
number system, and uses the digits 0 to 7
 It has the advantage of not requiring any extra symbols as
digits
 Octal is sometimes used in computing instead of
hexadecimal, perhaps most often in modern times in
conjunction with file permissions under Unix systems
Octal Number System

Decimal Octal Decimal Octal

0 0 8 10
1 1 9 11
2 2 10 12
3 3 11 13
4 4 12 14
5 5 13 15
6 6 14 16
7 7 15 17
Conversion Among Bases
 The possibilities:

Decimal Octal

Binary Hexadecimal
Binary to Decimal
 Technique
 Multiply each bit by 2n, where n is the “weight” of the bit
 The weight is the position of the bit, starting from 0 on the
right
 Add the results
Example : - 1010112 => 1 x 20 = 1
1 x 21 = 2
0 x 22 = 0
1 x 23 = 8
0 x 24 = 0
1 x 25 = 32
(43)10
Octal to Decimal
 Technique
 Multiply each bit by 8n, where n is the “weight” of the bit
 The weight is the position of the bit, starting from 0 on the
right
 Add the results
Example : 7248 => 4 x 80 = 4
2 x 81 = 16
7 x 82 = 448
(468)10
Hexadecimal to Decimal
 Technique
 Multiply each bit by 16n, where n is the “weight” of the bit
 The weight is the position of the bit, starting from 0 on the
right
 Add the results
Example : ABC16 => C x 160 = 12 x 1 = 12
B x 161 = 11 x 16 = 176
A x 162 = 10 x 256 = 2560
(2748)10
Decimal to Binary
 Technique
 Divide by two, keep track of the remainder
 First remainder is bit 0 (LSB, least-significant bit)
 Second remainder is bit 1
 Etc.
Example
12510 = ?2 2 125
2 62 1
2 31 0
2 15 1
2 7 1
2 3 1
2 1 1
0 1

12510 = 11111012
Octal to Binary
 Technique
 Convert each octal digit to a 3-bit equivalent binary
representation
 Example :

7058 = ?2

7 0 5

111 000 101

7058 = 1110001012
Hexadecimal to Binary
 Technique
 Divide by 8
 Keep track of the remainder
123410 = ?8

8 1234
8 154 2
8 19 2
8 2 3
0 2

123410 = 23228
Binary to Octal
 Technique
 Group bits in threes, starting on right
 Convert to octal digits
 Example
10110101112 = ?8
1 011 010 111

1 3 2 7

10110101112 = 13278
Decimal to Octal
 Technique
 Divide by 8
 Keep track of the remainder

123410 = ?8

8 1234
8 154 2
8 19 2
8 2 3
0 2
123410 = 23228
Decimal to Hexadecimal
 Technique
 Divide by 16
 Keep track of the remainder

123410 = ?16

16 1234
16 77 2
16 4 13 = D
0 4

123410 = 4D216
Binary to Hexadecimal
 Technique
 Group bits in fours, starting on right
 Convert to hexadecimal digits

10101110112 = ?16

10 1011 1011

2 B B

10101110112 = 2BB16
Octal to Hexadecimal
 Technique
 Use binary as an intermediary
10768 = ?16

1 0 7 6

001 000 111 110

2 3 E
10768 = 23E16
Hexadecimal to Octal
 Technique
 Use binary as an intermediary

1F0C16 = ?8
1 F 0 C

0001 1111 0000 1100

1 7 4 1 4

1F0C16 = 174148
Fractions
 Binary to decimal
10.1011 => 1 x 2-4 = 0.0625
1 x 2-3 = 0.125
0 x 2-2 = 0.0
1 x 2-1 = 0.5
0 x 20 = 0.0
1 x 21 = 2.0
2.6875
Fractions
.14579
 Decimal to binary
x 2
0.29158
3.14579
x 2
0.58316
x 2
1.16632
x 2
0.33264
x 2
0.66528
Ans : 11.001001... x 2
1.33056
etc.
Common Powers
 Base 10

Power Preface Symbol Value

10-12 pico p .000000000001
10-9 nano n .000000001
10-6 micro  .000001
10-3 milli m .001
103 kilo k 1000
106 mega M 1000000
109 giga G 1000000000
1012 tera T 1000000000000
Common Powers
 Base 2

Power Preface Symbol Value

210 kilo k 1024

220 mega M 1048576

230 Giga G 1073741824

Logic Gates and Boolean
Algebra
Definition

A logic gate is a circuit which uses digital signals as its

inputs and outputs.
What makes a circuit a gate is that each output depends
entirely on the signals applied at the inputs.
If these input signals change, then the output signal may
also change.

Digital circuits  which use logic gates are usually

arranged so that a logic 1 appears at an output only for
some definite combination of input signals - for this
reason these circuits are sometimes called combinational
logic circuits.
Boolean Algebra

 It was developed by George Boole.

 It provides an economical and straightforward approach to the

design of relay and other switching circuits.
Postulates of Boolean Algebra
x+0=x
x.1=x
Commutative Law : x+y = y+x
x*y = y*x
Associative Law : x+(y+z) = (x+y)+z=x+y+z
x(yz)=(xy)z=xyz
Distributive Law x(y+z)=xy+xz
x+(y.z)=(x+y).(x+z)
x+x=1
x.x= 0
Boolean Theorems

Theorem 1: (Idempotent Law)

x+x=x
x.X=x

Theorem 2 :
X+1 = 1
x.0=0

Theorem 3: (Absorption Law)

X+x.y=x
x. (x+y) = x
 Boolean Theorems
Theorem 4: (Involution Law)
( x)=x

Theorem 5: Demorgan’s Law

( x + y )’ = x’y’
( x y )’= x’ + y’
 Boolean Constants and Variables

 Boolean 0 and 1 do not represent actual numbers but instead

represent the state, or logic level.

Logic 0 Logic 1
False True
Off On
Low High
No Yes
Open switch Closed switch
Truth Tables
 A truth table is a means for describing how a logic circuit’s
output depends on the logic levels present at the circuit’s
inputs.

Inputs Output
A B x
0 0 1 A
? x
0 1 0
B
1 0 0
1 1 1
Three Basic Logic
Operations
 OR
 AND
 NOT
OR Operation
 Boolean expression for the OR operation:
x =A + B
 The above expression is read as “x equals A OR B”
OR Gate
 An OR gate is a gate that has two or more inputs and whose
output is equal to the OR combination of the inputs.
AND Operation
 Boolean expression for the AND operation:
x =A B
 The above expression is read as “x equals A AND B”
AND Gate
 An AND gate is a gate that has two or more inputs and whose
output is equal to the AND product of the inputs.
 NOT Operation
 The NOT operation is an unary operation, taking only one input
variable.
 Boolean expression for the NOT operation:
x= A
 The above expression is read as “x equals the inverse of A”
 Also known as inversion or complementation.
 Can also be expressed as: A’

A
NOT Circuit
 Also known as inverter.
 Always take a single input
 Application:
 Describing Logic Circuits
Algebraically
 Any logic circuits can be built from the three basic building blocks:
OR, AND, NOT
 Example 1: x = A B + C
 Example 2: x = (A+B)C
 Example 3: x = (A+B)
 Example 4: x = ABC(A+D)
Examples
Examples 3
Example 4
Evaluating Logic-Circuit
Outputs

 x = ABC(A+D)

 Determine the output x given A=0, B=1, C=1, D=1.

 Can also determine output level from a diagram
Solution
Combinational Logic
 A circuit that utilizes more that 1 logic function has
Combinational Logic.

 As an example, if a circuit has an AND gate connected to an

Inverter gate, this circuit has combinational logic.
NOR Gate
 Boolean expression for the NOR operation:

 x=A+B
NAND Gate
 Boolean expression for the NAND operation:
x=AB
Implications and alternative
symbol for NOR function
Implications and alternative
symbol for NAND function
Universality of NAND Gates
Universality of NOR Gates
Alternate Logic-Gate Representation
Thank You