0% found this document useful (0 votes)
110 views4 pages

Digital Electronics Important Questions

The document contains questions from various units on digital systems and logic design. It covers topics such as binary numbers, boolean algebra, logic gates, k-maps, combinational circuits, sequential circuits, memories, PLDs and hazards in logic design.

Uploaded by

whitebox6623
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
110 views4 pages

Digital Electronics Important Questions

The document contains questions from various units on digital systems and logic design. It covers topics such as binary numbers, boolean algebra, logic gates, k-maps, combinational circuits, sequential circuits, memories, PLDs and hazards in logic design.

Uploaded by

whitebox6623
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Marks Question

unit 1
1 Define Digital Systems?
1 List basic axiomatic definitions Boolean algebra?
1 State signed binary numbers? DONE
1 Convert (1011001)2 = ( ? )8 DONE
1 define Binary logic? DONE
Explian the purpose of Binary storage and
3 DONE
Registers?
List the basic theorems with their properties of
3 DONE
boolean algebra?

3 List out Digital logic gates with it's truth tables? DONE

Convert the following


3 i.(58) 10 =( ? )16 ii. (FD89) DONE
16 =( ? ) 8 iii. (568) 8 =( ? ) 10
Write the 1's complement and 2's complement of
3 the binary numbers DONE
i. 1011011 ii. 0110101 iii. 10110 iv. 00110
(a) 11011 + 101101 (b) 101011 – 110011 using
3 DONE
2’s complement
Verify the following Boolean algebraic expression.
Justify each step with a reference to a theorem or
5 DONE
postulate.
(AB +C +D) (C’ +D) (C’+D +E) = ABC’ + D

(a)Write about canonical and standard forms with


example. (b)Reduce the following Boolean
5 DONE
expression using theorems. F =
A’B’C+ABC+A’BC+ABC’+A’B’C’
(a) State and prove the duality theorem.
5 (b)Explain about Demorgan's DONE
laws ?
i. Convert (1596.675)10 to hexadecimal
ii. Convert (11110.1011)2 to
decimal iii.
5 DONE
Convert (10110001.01101001)2 to octal and
Hexadecimal. iv. Convert
(235.0657)8 to Binary
unit 2
How many cells required for two variables K-
1 4 DONE
Map?
1 What is meant by Don't care conditions? DONE
1 what is prime implicant in k-Map DONE
1 What is Octate? 8 DONE
1 How many cells an n-variable K-Map can have? 2^n DONE
3 Realise Basic gates by using NAND Gate? DONE
3 what is meant by Min term and Max term DONE
3 what are the limitations of K-Map DONE
Simplify the Boolean function
3 DONE
F(X,Y,Z)=Σm(3,4,6,7) using K-map
Write the reduced SOP form of F(W,X,Y,Z)=Ʃm(0,
3 DONE
7,8,9,10,12)+d(2,5,13)

Simplify the following Boolean


functionsF(w,x,y,z)=∑(1,2,4,7,12,14,15, using a
5 four variable Karnaugh map method and DONE
implement the simplified function using NAND
gates

Reduce the following expression by using K-Map


5 DONE
(A+B)(A+B'+C)(A+C')
Reduce the following expression by using three
5 DONE
variable map a)AB'C+A'BCD'+ABC'D+ABC
5 Explain 5 variable K-Map with an example? DONE
Determine the simplified expression in POS
5 (product of sums) of DONE
F(w,x,y,z)=∏(1,2,4,7,12,14,15) using K-maps.
unit 3
1 Define Combinational circuit DONE
1 Write Sum expression of Half Adder DONE
What is the difference between decoder and
1 DONE
demultiplexer
1 Define Priority Encoder DONE
How many selection lines will be required for 4
1 DONE-2
TO 1 MUX ?
3 compare between decoder and demultiplexer DONE
Compare Encoder with decoder and Mux with
3 DONE
Demux?
3 Implement 8X1 MUX using 2X1 MUX DONE
3 Write the truth table for 2 bit comparator ?
Explain the operation Decimal adder with an
3 DONE
Example?

5 Design 3x8 decoder and octal to binary encoder ? DONE

Implement a Full adder using two half adders and


5 DONE
one OR gate.
5 Design 4 bit Binary Adder-Subtarctor? DONE
Design &Give expression for 2 bit Magnitude
5
comparator?
5 Design full adder using 3X8 decoder? DONE
unit 4
1 Define Sequential Circuit. DONE
1 what is Flip Flop? DONE
1 What is Register? DONE
1 What are the types of Counters? DONE
1 What is Excitation table? DONE

3 Derive the characteristic equation of Jk flip-flop. DONE

Distinguish between a combinational logic circuit


3 DONE
and a sequential logic circuit.
Distinguish between a synchronous counters and
3 DONE
Asynchronous counters .
differentiate edge triggering and level triggering
3 DONE
of flipflops.
3 convert D FlipFlop to T FlipFlop. DONE
Draw and Explain the Operation of JK FlipFlop
5 DONE
with its Timing Diagram
Explain the operation of Parallel to Serial shift
5 DONE
registers?
5 Explain the operation of ring counter ? DONE
Design a synchronous counter for sequence: 0 →
5 DONE
1 → 3 → 4 → 5 → 7 → 0, using T flip-flop.

Design a Modulo-10 ASynchronous counter Using


5
T-Flip Flops and draw the Circuit diagram

unit 5
1 Is the ROM a volatile memory?Explain? DONE
1 Write the Excitation table of SR LATCH. DONE
What are the advantages of using a PROM as a
1 DONE
PLD?
1 What are the types of memories? DONE
1 Define Hazards in Logic Design?
3 Explain the Memory organization and operation DONE

3 Differentiate between PROM and EPROM? DONE


Compare the three combinational PLDs-
3 DONE
PROM,PLA,PAL
What are the steps for the design of
3
asynchronous sequential circuit?

Explain the content addressable memory (CAM)


3
and charge de coupled device memory (CCD),
Given the 8‐bit data word 01011011, generate
the 13‐bit composite word for the Hamming code
5
that corrects single errors and detects double
errors.

Implement the following boolean functio using


5 PAL: f1(w,x,y,z) = DONE
Ʃm(0,2,5,7,8,10,12,13)
Design a BCD to XS-3 Code converter using a
5 DONE
i)PROM ii)PLA iii)PAL
Tabulate the PLA Programming table for the four
Boolean functions listed below?
5 DONE
A(x,y,z)= Ʃm(1,2,4,6) B(x,y,z)= Ʃm(0,1,6,7)
C(x,y,z)=
Ʃm(2,6) B(x,y,z)= Ʃm(1,2,3,5,7)
Find the circuit that has no static Hazards and
5 implement the Boolean Function
F(A,B,C,D)=Σ(0,2,6,7,8,10,12)

You might also like

pFad - Phonifier reborn

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

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy