Scribd
Upload
51 views24 pages

DLD Presentation 1

The document discusses number systems and conversion between decimal, binary, and other bases. It explains R's complement and (R-1)'s complement methods for representing negative numbers. It then covers converting decimal numbers to binary using repeated division by 2. The reverse process of converting a binary number to decimal is also described by writing the binary number and listing the powers of 2. Finally, basic logic gates such as AND, OR, NOT, NAND, NOR, XOR and XNOR are introduced along with their truth tables.

Uploaded by

Jay Dubal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
51 views24 pages

DLD Presentation 1

The document discusses number systems and conversion between decimal, binary, and other bases. It explains R's complement and (R-1)'s complement methods for representing negative numbers. It then covers converting decimal numbers to binary using repeated division by 2. The reverse process of converting a binary number to decimal is also described by writing the binary number and listing the powers of 2. Finally, basic logic gates such as AND, OR, NOT, NAND, NOR, XOR and XNOR are introduced along with their truth tables.

Uploaded by

Jay Dubal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 24

Number system

.
R’s complement And (R-1)’s Complement
R’s Complement

To find radix complement of a number N where


N = Number
r. = base of the number
n = Number of digits in the number.
The r’s complement of the number is given as
rn – N Or
r-1’s complement + 1 =>
[( rn -1) – N] + 1
R’s complement And (R-1)’s Complement?
(R-1)’s Complement

Suppose a number N is given


N = Number
r = base of the number
n = Number of digits in the number.
The r-1’s complement of the number is given by the formula.
(rn – 1) – N
Decimal To Binary

• Method of converting decimal to binary


number equivalents is to write down the
decimal number and to continually
divide-by-2 (two) to give a result and a
remainder of either a “1” or a “0” until
the final result equals zero.

• This divide-by-2 decimal to binary


conversion technique gives the decimal
number 4710 an equivalent of 1011112 in
binary, reading from right to left.
Binary To Decimal
Write down the binary number and list
the powers of 2 from right to left.

• Let's say we want to convert the binary


number 100110112 to decimal. First, write
it down. Then, write down the powers of
two from right to left. Start at 20,
evaluating it as "1". Increment the
exponent by one for each power. Stop
when the amount of elements in the list
is equal to the amount of digits in the
binary number.
Click to editBoolean
Master Logic Operations And Logic Gates:-
title style

• OR
• AND
• NAND
• NOR
• X-OR
• X-NOR
• NOT

6
AND, OR, NOT Operation
Click to edit Master title style

It is represented by A'. It is represented by A+B.​ It is represented by A'.​

If A=1 then A’=0 and vice It gives high logic if either one If A=1 then A'=0 and vice
versa​ of the inputs is high .​ versa.​

7
Click to edit Master title style

NAND, NOR Operation

It is not of and gate (A.B)’.​


It is not of or gate (A+B)’.​
A=1,B=1 then (A.B)’=0, and 1 in rest of
cases.​ A=0,B=0 then (A+B)’=1, and 0 in rest of cases.​

8
EX-OR, EX-NOR
Click to edit Master title style

Operation

It is called as exclusive or gate, AB’+A’B​ ​It is complement of ex-or, (AB)’ + AB.​

It is also called as odd ones counter , it gives high output If gives the output high when the no of ones in
when no of ones in the in are odd in number. ​ input are even.​
9
Truth Table For AND Gate

 The output Q is true if BOTH input A “AND”


input B are both true, giving the Boolean
Expression of: ( Q = A and B ).
 Boolean Expression for AND gate can be written
as: A.B
Truth Table For OR Gate

 the output Q is true if EITHER input A “OR” input B is true, giving the Boolean
Expression of: ( Q = A or B ).
 Boolean Expression for OR gate can be written as: A+B
Truth Table For NOT Gate

 the output Q is ONLY true when the input is “NOT” true, the
output is the inverse or complement of the input giving the
Boolean Expression of: ( Q = NOT A ).
 Boolean Expression for NOT gate can be written as: A'.
Truth Table For NAND Gate

 the output Q is NOT true if BOTH input A and


input B are true, giving the Boolean Expression of:
( Q = not(A AND B) ).
 Boolean Expression for NAND gate can be written as:
(A.B)'.
Truth Table For NOR Gate

 the output Q is true if BOTH input A and input B are NOT


true, giving the Boolean Expression of: ( Q = not(A OR
B) ).
 Boolean Expression for NOR gate can be written as:
(A+B)'.
Truth Table For EX-OR Gate

 the output Q is true if EITHER input A or if input B is true, but NOT


both giving the Boolean Expression of: ( Q = (A and NOT B) or (NOT A
and B) ).
 Boolean Expression for NOR gate can be written as: (A.B')+(A'.B).
Truth Table For EX-NOR Gate

 the output Q is true if BOTH input A and input B are the same, either
true or false, giving the Boolean Expression of: ( Q = (A and B) or (NOT A
and NOT B) ).
 Boolean Expression for NOR gate can be written as: (A.B)+(A'.B').
Click to edit Master title style

Basic postulates and


fundamental terms of boolean
algebra.

17
Click to
Basic Postulates:
edit Master title style
• The common postulates used to formulate algebraic structures are:
1. Closure: w.r.t to operator + and .
2. Associative law: This law allows the removal of brackets from an
expression and regrouping of the variables.
A + (B + C) = (A + B) + C = A + B + C (OR Associate Law)
A(B.C) = (A.B)C = A . B . C (AND Associate Law)
3. Commutative law : The order of application of two separate terms is not
important for eg. A . B = B . A & A + B = B + A .
4. Identity element: A + 0 = A A. 1=A
5. Idempotent Law – An input that is AND‘ed or OR´ed with itself is equal to
that input. A + A = A
A.A=A
6. Distributive Law – This law permits the multiplying or factoring out of an
expression. A(B + C) = A.B + A.C (OR Distributive Law)A + (B.C) = (A +
B).(A + C) (AND Distributive Law)
18 18
Click to edit Master title style

19 19
Click to edit
Boolean Functions
Master title style

A Boolean function is an expression formed with


binary variables , the two binary operators OR and
AND, the unary operator NOT, parantheses, and
equal sign.

For example,

F1= x y z'
F2 = x + y'z
F3 = x' y' z + x' y z + x y'
F4 = x y' + x' z

20 20
Click to edit
Boolean Functions
Master title style

In Boolean algebra,Boolean function can be


expressed as Canonical Disjunctive Normal
Form known as minterm and some are
expressed as Canonical Conjunctive Normal
Form known as maxterm .

21 21
22
So, F can be expressed as sum of
product

F=X’Y’Z + XYZ’ + XYZ

Or F can be expressed as product of


sum

F=(X+Y+Z)(X+Y’+Z)(X’+Y+Z)(X’+Y+Z’)
Group 9

93-Himanshu sharma (slide 20 to slide 24)


141-Jay dubal (slide 1 to slide 5)
135-Yash sadhu (slide 17 to slide 19)
156-Rahul mavaliya (slide 6 to slide 16

You might also like