DLD Lab Assignment

Q.
no: 1- Explain what is the difference between digital

and analog with suitable example?
The main difference between them is the type of input
and output signals they operate on. Analog
circuits operate or work with continuous valued signals
or continuously varying signals, these signals are
commonly referred to as analog signals. Example of an
analog signal is sound, light etc. Digital circuits operate or
work on signals whose values exist at two levels only or
has only two values i.e. 0's (zeros) and 1's (ones). These
signals are commonly referred to as digital signals, at any
given instant of time the value of a digital signal can be
either high (1) or low (0).

Q.no: 2- Explain 4 variable K-map with example.
4 Variable K-Map
The number of cells in 4 variable K-map is sixteen, since
the number of variables is four. The following figure
shows 4 variable K-Map.
 There is only one possibility of grouping 16 adjacent
min terms.
 Let R1, R2, R3 and R4 represents the min terms of first
row, second row, third row and fourth row
respectively. Similarly, C1, C2, C3 and C4 represents
the min terms of first column, second column, third
column and fourth column respectively. The
possible combinations of grouping 8 adjacent min
terms are {(R1, R2), (R2, R3), (R3, R4), (R4, R1), (C1, C2),
(C2, C3), (C3, C4), (C4, C1)}.
 If w=0, then 4 variable K-map becomes 3 variable K-
map.
Question
f(a,b,c,d) = ∑ m ( 0,1,2,3,12,13,14,15)
a b c d f
a'b'c'd' 0 0 0 0 1 m0
a'b'c'd 0 0 0 1 1 m1
a'b'cd' 0 0 1 0 1 m2
a'b'cd 0 0 1 1 1 m3
a'bc'd' 0 1 0 0 0 m4
a'bc'd 0 1 0 1 0 m5
a'bcd' 0 1 1 0 0 m6
a'bcd 0 1 1 1 0 m7
ab'c'd' 1 0 0 0 0 m8
ab'c'd 1 0 0 1 0 m9
ab'cd' 1 0 1 0 0 m10
ab'cd 1 0 1 1 0 m11
abc'd' 1 1 0 0 1 m12
abc'd 1 1 0 1 1 m13
abcd' 1 1 1 0 1 m14
abcd 1 1 1 1 1 m15
f= a'b'c'd' + a'b'c'd + a'b'cd' + a'b'cd + abc'd' + abc'd + abcd' + abcd
AND = 8 4 INPUTS
OR = 1 8 INPUTS
NOT = 4
TOTAL =13
C'D' C'D CD CD'

A'B' m0 m1 m3 m2
A'B m4 m5 m7 m6
AB m12 m13 m15 m14
AB' m8 m9 m11 m10
C'D' C'D CD CD'
A'B' 1 1 1 1
A'B 0 0 0 0
AB 1 1 1 1
AB' 0 0 0 0
Y = A'B' + AB
and = 2 2 inputs
or = 1 2 inputs
Not = 2
Total 5
Q.no: 3- Write down the difference between full adder

and 4-bit adder with example (draw circuit).
Full adder is a type of combinational circuit that contains
three inputs and two outputs. The first two inputs are
labelled as A and B and the third input is labelled as C in.
At the output side Carry out is labelled as C out and their
sum as S. Since there are three inputs so the different
combination of inputs are 8. Different output results are
generated according to the inputs provided.
4 bit adder
It is a type of binary adder that adds two 4 bit binary
numbers together. So to implement this type of addition
we need to add four full adders in a parallel arrangement
such that the carry in becomes the ripple carry and
ripples through the last adder as C out. But sum will be
individual for the equivalent bit.
Q-no. 4- Explain Logic gates with examples.

Logic gates are the fundamental components of any digital
device. It's an electronic circuit with just one output and one or
more inputs. A certain logic governs the relationship between
the input and the output. AND gate, OR gate, NOT gate, and so
on are examples of logic gates.
Types of logic gates:

OR Gate
In OR gate the output of an OR gate attains the state 1 if one or more inputs attain the state 1.
The Boolean expression of OR gate is Y = A + B, read as Y equals A ‘OR’ B.

The truth table of a two-input OR basic gate is given as;
Example:
OR gates are used in Door Bell Switches.
AND Gate
In AND gate the output of an AND gate attains the state 1 if and only if all the inputs are in state 1.
The Boolean expression of AND gate is Y = A.B

The truth table of a two-input AND basic gate is given as;
Example:
AND gates are also used in alarm circuits.
NOT Gate
In NOT gate the output of a NOT gate attains the state 1 if and only if the input does not attain the
state 1.
The Boolean expression is Y = Aˉ, read as Y equals NOT A.
The truth table of NOT gate is as follows;
Example:
NOT gates are also used in temperature detector circuits.
The three gates (OR, AND and NOT), when connected in various combinations, give us basic logic
gates such as NAND, NOR gates, which are the universal building blocks of digital circuits.
NAND Gate
This basic logic gate is the combination of AND and NOT gate.
The Boolean expression of NAND gate is Y = Aˉ.B
The truth table of a NAND gate is given as;
Example:
NAND gates are used in buzzer circuits.
NOR Gate
This gate is the combination of OR and NOT gate.
The Boolean expression of NOR gate is Y =
The truth table of a NOR gate is as follows;

Example:
One of its real time applications is ‘Mixer tank’
Exclusive-OR gate (XOR Gate)

In XOR gate the output of a two-input XOR gate attains the state 1 if one adds only input attains the
state 1.
The Boolean expression of the XOR gate is

The truth table of an XOR gate is;
Example:
It behaves as a parity checker and a controlled inverter as well.
Exclusive-NOR Gate (XNOR Gate)
In XNOR gate the output is in state 1 when its both inputs are the same that is, both 0 or both 1.
The Boolean expression of XNOR gate Y =
The truth table of an XNOR gate is given below;
Example:
It is used in arithmetic and encryption circuits.

DLD Lab Assignment

Uploaded by

Copyright:

Available Formats

DLD Lab Assignment

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DLD Lab Assignment

Uploaded by

Copyright:

Available Formats

Q.

no: 1- Explain what is the difference between digital

f= a'b'c'd' + a'b'c'd + a'b'cd' + a'b'cd + abc'd' + abc'd + abcd' + abcd

C'D' C'D CD CD'

Q.no: 3- Write down the difference between full adder

Q-no. 4- Explain Logic gates with examples.

Types of logic gates:

The Boolean expression of OR gate is Y = A + B, read as Y equals A ‘OR’ B.

The Boolean expression of AND gate is Y = A.B

The Boolean expression of NOR gate is Y =

The truth table of a NOR gate is as follows;

Exclusive-OR gate (XOR Gate)

The Boolean expression of the XOR gate is

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.