Scribd
Upload
3 views3 pages

DLD Detailed Notes

The document provides detailed notes on Digital Logic Design, covering number systems, logic gates, K-Maps, and combinational circuits. Key concepts include binary to decimal conversions, the function of various logic gates, and the use of Karnaugh Maps for simplifying Boolean expressions. It also outlines the functions of half adders, full adders, multiplexers, demultiplexers, encoders, and decoders.

Uploaded by

rathodom256
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
3 views3 pages

DLD Detailed Notes

The document provides detailed notes on Digital Logic Design, covering number systems, logic gates, K-Maps, and combinational circuits. Key concepts include binary to decimal conversions, the function of various logic gates, and the use of Karnaugh Maps for simplifying Boolean expressions. It also outlines the functions of half adders, full adders, multiplexers, demultiplexers, encoders, and decoders.

Uploaded by

rathodom256
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

Digital Logic Design (DLD) - Detailed Notes & Short

Answers

1. Number System & Codes

Q. Binary to Decimal
Multiply each binary digit with powers of 2 and add the results.

Q. Decimal to Binary
Divide the decimal number repeatedly by 2 and write remainders from bottom to top.

Q. 1's Complement
Replace 1 with 0 and 0 with 1.

Q. 2's Complement
Find 1's complement and add 1.

Q. BCD Code
Each decimal digit is represented using 4-bit binary.

Q. Gray Code
Only one bit changes at a time.

Q. Binary Subtraction using 2's Complement


Take 2's complement of subtrahend and add.

2. Logic Gates

Q. AND Gate
Output is 1 only when all inputs are 1. Y = A.B

Q. OR Gate
Output is 1 when any input is 1. Y = A + B

Q. NOT Gate
Produces complement of input. Y = A■

Q. NAND Gate
NOT of AND gate. Universal gate.

Q. NOR Gate
NOT of OR gate. Universal gate.

Q. XOR Gate
Output is 1 when inputs are different.

Q. Why NAND/NOR are Universal Gates?


Because all logic gates can be implemented using only NAND or NOR.

3. K-Map

Q. What is K-Map?
Karnaugh Map is used to simplify Boolean expressions.

Q. SOP Form
Sum of Products form.

Q. POS Form
Product of Sums form.

Q. Steps of K-Map
Draw K-map, fill values, group adjacent cells, write simplified expression.

Q. Advantages
Less hardware, lower cost, and faster circuits.

4. Combinational Circuits

Q. Half Adder
Adds two bits. S = A⊕B, C = A.B

Q. Full Adder
Adds three bits including carry input.

Q. Half Subtractor
Performs subtraction of two bits.

Q. Multiplexer
Selects one input from many inputs.

Q. Demultiplexer
Sends one input to many outputs.

Q. Encoder
Converts many inputs into coded binary output.

Q. Decoder
Converts binary input into many outputs.

Important Short Notes / Viva Answers

• Binary uses base 2 number system.

• BCD represents each decimal digit using 4 bits.

• Gray code changes only one bit at a time.

• NAND and NOR are universal gates.

• K-map simplifies Boolean expressions.

• Half adder adds two binary bits.

• Full adder adds three bits including carry.

• MUX selects one input from many.

• DEMUX distributes one input to many outputs.

• Encoder compresses data into binary code.

• Decoder converts binary input into multiple outputs.

• Combinational circuits do not have memory.

• Sequential circuits have memory.

You might also like