Scribd
Upload
3 views3 pages

DLD Important Questions Notes

The document provides important questions and brief answers related to digital logic design, covering topics such as number systems, logic gates, Karnaugh maps, and combinational circuits. Key concepts include binary conversions, logic gate functions, K-map simplifications, and the roles of encoders and decoders. It emphasizes the significance of universal gates and the advantages of using K-maps for circuit design.

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 Important Questions Notes

The document provides important questions and brief answers related to digital logic design, covering topics such as number systems, logic gates, Karnaugh maps, and combinational circuits. Key concepts include binary conversions, logic gate functions, K-map simplifications, and the roles of encoders and decoders. It emphasizes the significance of universal gates and the advantages of using K-maps for circuit design.

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

DLD Important Questions with Brief Answers

1. Number System & Codes

Q. Convert Binary to Decimal


Binary number is converted by multiplying each digit with powers of 2. Example: 1011■ = 11■■

Q. Convert Decimal to Binary


Divide decimal number repeatedly by 2. Example: 25■■ = 11001■

Q. 1’s Complement
Change 1→0 and 0→1. Example: 1010 → 0101

Q. 2’s Complement
2’s complement = 1’s complement + 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 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
Gives complement of input. Y = ■

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?


All logic gates can be implemented using only NAND or NOR.

4. K-Map

Q. What is K-Map?
Karnaugh Map is used for simplifying 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 cells, write simplified expression.

Q. Advantages
Less hardware, less cost, faster circuit.

5. 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.

Difference Between Encoder and Decoder

Encoder Decoder
Many inputs Many outputs
Binary output Binary input
Compresses data Expands data

You might also like