Scribd
Upload
440 views6 pages

Important Questions For Digital Logic Design

DLD questions

Uploaded by

varnikagusain00
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
440 views6 pages

Important Questions For Digital Logic Design

DLD questions

Uploaded by

varnikagusain00
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/ 6

Important questions for Digital Logic Design

A. Solve the following problems


1. (234)10= ( )2= ( )8

2. (BC2D) H + (A18E) H = ( ? )16

3. (3FF)16 = ( )10 = ( )2

4. (110011011)2 = ( )8

5. (110011011)2 + (011001011)2 = ( )2

6. (110011011)2 - (011001011)2 = ( )2

B. Solve the following problem using 1’s and 2’s complement method:

1. (25)10 – (9)10

2. (110011)2- (011010)2

3. (60)8 – (25)8

4. (66)10 –(95)10

5. (1111000)2-(0001110)2

C. Write a short note on the BCD (Binary-Coded Decimal), Grey code, and ASCII
(American Standard Code for Information Interchange).

D. Draw the logic diagram of Digital Logic Gates:(AND, NAND, OR, NOR, EX-OR,
EX-NOR) along with their truth table.

E. Write a properties of XOR Gate.


F. Define Universal Gates? Realize the AND, OR, NOR, EX-OR using NAND gate
and AND, NAND, OR, EX-NOR using NOR gate.

G. Write down the basic theorem of Logic gates.

H. Explain the Canonical and Standard Form.

I. Express the Boolean function F = A + B’C as standard sum of minterms.

J. Express the Boolean function F = xy + x’z as a product of maxterms.

K. Convert the following Boolean function into Standard SOP form.

f=p′qr+pq′r+pqr′+pqr

L. Convert the following Boolean function into Standard POS form.


f=(p+q+r)⋅(p+q+r′)⋅(p+q′+r)⋅(p′+q+r)

M. Deriving a SOP & POS Expression from a Truth Table


1. Write all Laws and Identities of Boolean algebra.
2. State the De Morgan’s Theorem and prove both theorems.

3. Simplification of Logic Expressions

• A. (A + B)
• (A + B) (A + C)
• AB (B’C + AC)
• (A + B’ + C’) (A +B’+ C) (A + B + C’)
4. Solve the following using Karnaugh Map and also design logic gate from simplified
expression:

• F (A, B, C) = Σm (0, 1, 6, 7) + Σd (3, 5)


• F (A, B, C, D) = ∑m (0,1,5,9,13,14,15) + d (3,4,7,10,11)
• F (A, B, C, D) = Σm(0, 1, 2, 5, 7, 8, 9, 10, 13, 15)
• F (A, B, C, D) = ∏M(0, 1, 3, 5, 7, 8, 9, 11, 13, 15)
• F (A, B, C, D) = ∏M 1, 3, 4, 6, 8, 9, 11, 13, 15) + ∏d(0, 2, 14)
1. Adders and Subtractors:
o Design and explain the working of a half adder and a full adder along with
logic diagram and truth table.
o Describe the design and function of a binary subtractor.
2. Code Converters and Multiplexers:
o Design a circuit that converts 4 Bit BCD to binary converter and binary to
Gray converter along with proper diagram.
o Explain the working of a 4:1 multiplexer and provide a practical application.
3. Encoders and Decoders:
o Describe the function and design of an encoder and a decoder and write
difference between them.
o Write different types of encoder and decoder also design 2:4 decoder.
1. Flip-Flops and Latches:
o Explain the S-R, J-K, D, and T flip-flops. Provide their characteristic tables
and equations.
o Explain the race around condition. Describe the function of a master-slave flip-
flop.
2. Registers and Counters:
o Explain the different types of registers (shift registers, parallel registers) and
their applications.
o Design and analyze a synchronous counter and a ripple counter.
1. Memory Circuits:

• Describe the types, operation, and applications of RAM (Random Access


Memory) and ROM (Read-Only Memory).
• Explain PAL, PLA and PROM in digital systems.
2. Programmable Logic Devices:
• Design a Programmable Logic Array (PLA) and Programmable Array Logic
(PAL) for a given combinational logic function.
I. Half Adder
II. Full Adder
III. F (a, b,c)=∑m(0,1,3,5)

You might also like