0% found this document useful (0 votes)
46 views11 pages

Ec6302 Dec PDF

The document discusses digital electronics topics including Boolean theorems, noise margin, De Morgan's theorem, advantages of CMOS logic, prime implicants, don't care terms, canonical forms, multiplexers, comparators, full adders, priority encoders, decoders, adders/subtractors, carry propagation delay, and memory devices such as ROM.

Uploaded by

Shivam Rai
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
0% found this document useful (0 votes)
46 views11 pages

Ec6302 Dec PDF

The document discusses digital electronics topics including Boolean theorems, noise margin, De Morgan's theorem, advantages of CMOS logic, prime implicants, don't care terms, canonical forms, multiplexers, comparators, full adders, priority encoders, decoders, adders/subtractors, carry propagation delay, and memory devices such as ROM.

Uploaded by

Shivam Rai
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/ 11

DHANALAKSHMI COLLEGE OF ENGINEERING

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

EC6302 – DIGITAL ELECTRONICS


PART A– Questions
UNIT –I

1. Prove the Boolean theorems: (a) x + x = x (b) x + xy = x [M/J-16]


Proof:
a) x + x = x
LHS: x + x = (x + x) . 1 postulate 2(b)
= (x + x).( x + x’) 5(a)
= x + xx’ 4(b)
=x+0 5(b)
=x 2(a)

b) x + xy = x
LHS: x + xy = (x + 1) + xy postulate 2(b)
= x (1 + y) 4(a)
= x(y + 1) 3(b)
=x.0 2(b)
=x 2(a)

2. Define – Noise-margin[M/J-16]
Noise Margin is defined as the maximum noise voltage added to an input signal of a digital circuit that
does not cause an undesirable change in the circuit output. It is expressed in volts.

3. StateDe-Morgan’s theorem. [N/D-15]

De Morgan suggested two theorems that form important part of Boolean algebra.
They are:
i. The complement of a product is equal to the sum of the complements.
(AB)' = A' + B'
ii. The complement of a sum term is equal to the product of the complements.
(A + B)' = A'B'
4. Statethe advantages of CMOSlogic. [A/M – 15][A/M – 09]

The advantages of CMOS logic are:

i. Low power consumption: CMOS process provides lower power consumption and is easy to
scaling down.

ii. High input impedance: Gate of CMOS needs much lower driving current than base current of
bipolar.

iii. Reduced silicon area: Scaling down increases CMOS speed and reduces the area of the chip.

iv. Mature technology: CMOS processes are well established and continue to become more mature.
The powerful trust by leading edge digital memory and processors has led to continuous
improvement and down scaling of CMOS processes.

5. What is prime implicant and essential prime implicant? [N/D – 13]

A prime implicant is a product term obtained by combining the maximum possible number of
adjacent squares in a map. If a minterm in a square is covered by only one prime implicant, that prime
implicant is said to be essential.

6. What are don’t care terms? [M/J – 13]

Minterms that have unspecified outputs for some input combinations are called don’t care terms.
We denote them by variable ‘x’ or ‘d’.

7. Apply De Morgan’s theorem for the function ( 𝐴 + 𝐵 + 𝐶 𝐷)′. [N/D – 08]

F= ((A+B+C)D)'

= (A+B+C)' + D'

= A'. B'. C' + D'

8. State the two canonical forms of Boolean algebra. [A/M – 07]

The two canonical forms of Boolean algebra are:

i. Sum of products

ii. Products of Sum


13. Prove that a bubbled input AND gate, functions like a NOR gate. [A/M – 04]

Truth Table for NOR Gate and bubbled input AND gate

Y= (A’.B’)
Y= (A+B)’
A A’ B B’ A+B (Bubbled input AND
(NOR Gate)
gate)

0 1 0 1 0 1 1

0 1 1 0 1 0 0

1 0 0 1 1 0 0

1 0 1 0 1 0 0

Thus

(A+B)’ = A’. B’

14. How is NAND gate used as an inverter? [A/M – 04]

Logic Diagram for Inverter

The two input terminals of the NAND gate will be shorted and given as single input.

Now the above NAND gate act as a inverter

15. Define – Fan-out and Fan-in of a Logic Gate [N/D – 08]

Fan out is defined as the number of standard loads that the output of the gate can drive without
impairment of its normal operation.

Fan in is defined as the number of inputs connected to the gate without any degradation in the
voltage level.
The combinational circuit of 3-bit parity generator:

5. List the applications of multiplexer. (May/June 2012) (Nov/Dec2013)


The major application of multiplexers are found in frequency division
multiplexer and time division multiplexer in the field of telegraphy, telephony, GPS
systems, Digital & Analog broadcasting.

6. Design single bit comparator. (May/June 2012, May/June 2015 )

7. Draw the logic diagram and truth table of Full-adder. [N/D-16]


Truth Table of Full Adder:

The combinational circuit of full adder:

Output expression of Sum(S):


Output expression of Carry(C):

8. Define half adder and full adder. [N/D-15]

Half Adder: The logic circuit that performs the addition of two bits is a half adder. It consists of 2
inputs and two outputs Sum and Carry.

Full Adder: The circuit that performs the addition of three bits is a full adder. It consists of 3
inputs and two outputs Sum and Carry.

9. What is priority Encoder? [N/D-15]


A priority encoder is an encoder circuit that includes the priority function. In priority
encoder, if 2 or more inputs are equal to 1 at the same time, the input having the highest
priority will take precedence.

10. Write down the difference between Demultiplexer and Decoder. [A/M – 15]

Demultiplexer Decoder

Demultiplexer is a single input to many


Decoder is a many inputs to many
outputs.
outputs device.
The selection of specific output line is
controlled by the value of selection There are no selection lines.
lines.
11. Construct 4-bit parallel Adder/Subtractor using Full adders and XOR gates. [N/D – 14]

12. What is meant by carry propagation delay? (N/D – 09)

In parallel adders, sum and carry outputs of any stage cannot be produced until the
input carry occurs. This time delay in the addition process is called carry propagation delay.
This delay increases with increase in the number of bits to be added in an adder circuit.

13. What is the maximum number of outputs for a decoder with a six bit data word? (M/J – 09)

The number of data inputs bits = 6.


The maximum number of outputs for decoder 26=64

14. List out the differences between DEMUX and MUX. (M/J – 09)

Parameter Multiplexer Demultiplexer

Multiplexer is a digital switch Demultiplexer is a circuit


which allows digital information that receives information on a
Definition from several sources to be single line and transmits this
routed on to a single output line. information on one of 2n
possible output lines.
Number of data inputs 2 n 1
No of data outputs 1 2n
Relationship of input
Many to one One to many
and Output
Used as a data selector. Used as a data distributor.
Applications In time division in multiplexing at In time division multiplexing at
the transmitting end. the receiving end.
15. Write a short note on one bit comparator. (M/J - 08)

It is a special combinational circuit designed primarily to compare the relative


magnitudes of two binary numbers. An n-bit comparator receives two n-bit numbers, A and B
outputs are: A>B, A=B and A<B. As per the magnitudes of the two numbers, one of the outputs
will be high.

16. What are the applications of Multiplexer and Demultiplexer? (M/J – 08)

The applications of Multiplexer are:

i. They are used in time multiplexing systems.

ii. They are used in frequency multiplexing systems.

iii. They are used in data acquisition systems.

The applications of Demultiplexer are:

i. It can be used as a decoder.

ii. It can be used as a data distributer.

iii. It can be used to implement Boolean expressions.


UNIT IV -MEMORY DEVICES

1. Explain ROM

A read only memory(ROM) is a device that includes both the decoder and the OR gates within a single IC
package. It consists of n input lines and m output lines. Each bit combination of the input variables is
called an address. Each bit combination that comes out of the output lines is called a word. The number
of distinct addresses possible with n input variables is 2n.

2. What are the types of ROM?

1.PROM 2.EPROM 3.EEPROM

3. Explain PROM.

PROM (Programmable Read Only Memory) It allows user to store data or program. PROMs use the fuses
with material like nichrome and polycrystalline. The user can blow these fuses by passing around 20 to
50 mA of current for the period 5 to 20μs.The blowing of fuses is called programming of ROM. The
PROMs are one time programmable. Once programmed, the information is stored permanent.

4. Explain EPROM.

EPROM(Erasable Programmable Read Only Memory) EPROM use MOS circuitry. They store 1’s and 0’s
as a packet of charge in a buried layer of the IC chip. We can erase the stored data in the EPROMs by
exposing the chip to ultraviolet light via its quartz window for 15 to 20 minutes. It is not possible to
erase selective information. The chip can be reprogrammed.

5. Explain EEPROM.

EEPROM (Electrically Erasable Programmable Read Only Memory) EEPROM also use MOS circuitry. Data
is stored as charge or no charge on an insulated layer or an insulated floating gate in the device.
EEPROM allows selective erasing at the register level rather than erasing all the information since the
information can be changed by using electrical signals

6. What is RAM?

Random Access Memory. Read and write operations can be carried out.

7. Define ROM

A read only memory is a device that includes both the decoder and the OR gates within a single IC
package.

8. Define address and word

In a ROM, each bit combination of the input variable is called on address. Each bit combination that
comes out of the output lines is called a word.
9. What are the types of ROM.

1. Masked ROM. 2. Programmable Read only Memory 3. Erasable Programmable Read only memory. 4.
Electrically Erasable Programmable Read only Memory.

10. What is programmable logic array? How it differs from ROM?

In some cases the number of don’t care conditions is excessive, it is more economical to use a second
type of LSI component called a PLA. A PLA is similar to a ROM in concept; however it does not provide
full decoding of the variables and does not generates all the minterms as in the ROM

11.What is mask - programmable?

With a mask programmable PLA, the user must submit a PLA program table to the manufacturer.

12. What is field programmable logic array?

The second type of PLA is called a field programmable logic array. The user by means of certain
recommended procedures can program the EPLA.

13. List the major differences between PLA and PAL PLA: Both AND and OR arrays are programmable
and Complex Costlier than PAL PAL AND arrays are programmable OR arrays are fixed Cheaper and
Simpler

14. Define PLD. Programmable Logic Devices consist of a large array of AND gates and OR gates that
Can be programmed to achieve specific logic functions.

15. Give the classification of PLDs. PLDs are classified as PROM(Programmable Read Only Memory),
Programmable Logic Array (PLA), Programmable Array Logic (PAL), and Generic Array Logic(GAL)
UNIT V

1. Define closed covering.


A Set of compatibles is said to be closed if, for every compatible contained in the set, all its implied
compatibles are also contained in the set. A closed set of compatibles, which contains all the states of
M, is called a closed covering.
2. Define machine equivalence.
Two machines, M1 and M2 are said to be equivalent if and only if, for every state in M1, there is a
corresponding equivalent state in M2 & vice versa.
3. Define state table.
For the design of sequential counters we have to relate present states and next states. The table, which
represents the relationship between present states and next states, is called state table.
4. Define total state.
The combination of level signals that appear at the inputs and the outputs of the delays define what is
called the total state of the circuit.
5. What are the steps for the design of asynchronous sequential circuit?
1. Construction of a primitive flow table from the problem statement. 2. Primitive flow table is reduced
by eliminating redundant states using the state reduction 3. State assignment is made 4. The primitive
flow table is realized using appropriate logic elements.
6. Define primitive flow table:
It is defined as a flow table which has exactly one stable state for each row in the table. The design
process begins with the construction of primitive flow table.
7. What are the types of asynchronous circuits?
1. Fundamental mode circuits 2. Pulse mode circuits
8. Give the comparison between state Assignment Synchronous circuit and state assignment
asynchronous circuit. In synchronous circuit, the state assignments are made with the objective of
circuit reduction. In asynchronous circuits, the objective of state assignment is to avoid critical races.
9. What are races?
When 2 or more binary state variables change their value in response to a change in an input variable,
race condition occurs in an asynchronous sequential circuit. In case of unequal delays, a race condition
may cause the state variables to change in an unpredictable manner.

10. Define non critical race.


If the final stable state that the circuit reaches does not depend on the order in which the state variable
changes, the race condition is not harmful and it is called a non critical race.
11. Define critical race? If the final stable state depends on the order in which the state variable
changes, the race condition is harmful and it is called a critical race.
12. What is a cycle? A cycle occurs when an asynchronous circuit makes a transition through a series of
unstable states. If a cycle does not contain a stable state, the circuit will go from one unstable to stable
to another, until the inputs are changed.
13. List the different techniques used for state assignment.
1. Shared row state assignment 2. One hot state assignment.
14. Write a short note on fundamental mode asynchronous circuit.
Fundamental mode circuit assumes that. The input variables change only when the circuit is stable. Only
one input variable can change at a given time and inputs are levels and not pulses.
15. Write a short note on pulse mode circuit.
Pulse mode circuit assumes that the input variables are pulses instead of level. The width of the pulses is
long enough for the circuit to respond to the input and the pulse width must not be so long that it is still
present after the new state is reached.
16. Define secondary variables.
The delay elements provide a short term memory for the sequential circuit. The present state and next
state variables in asynchronous sequential circuits are called secondary variables.
17. Define flow table in asynchronous sequential circuit.
In asynchronous sequential circuit state table is known as flow table because of the behaviour of the
asynchronous sequential circuit. The stage changes occur in independent of a clock, based on the logic
propagation delay, and cause the states to flow from one to another.
18. What is pulse mode asynchronous machine?
A pulse mode asynchronous machine has two inputs. If produces an output whenever two consecutive
pulses occur on one input line only. The output remains at 1 until a pulse has occurred on the other
input line. Write down the state table for the machine.
19. What is fundamental mode?
A transition from one stable state to another occurs only in response to a change in the input state.
After a change in one input has occurred, no other change in any input occurs until the circuit enters a
stable state. Such a mode of operation is referred to as a fundamental mode.

You might also like