Scribd
Upload
216 views

Assignment 1 Digital

This document contains 20 questions about digital circuits and systems. It covers topics such as defining different types of signals, advantages of digital over analog systems, binary and hexadecimal conversions, positive and negative logic, universal gates, Boolean algebra simplification using K-maps, parity generators, adders including half adders, full adders and BCD adders, flip flops including JK, RS, and Master-Slave operation. The questions involve both theoretical concepts and practical circuit design problems.

Uploaded by

libranhitesh7889
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
216 views

Assignment 1 Digital

This document contains 20 questions about digital circuits and systems. It covers topics such as defining different types of signals, advantages of digital over analog systems, binary and hexadecimal conversions, positive and negative logic, universal gates, Boolean algebra simplification using K-maps, parity generators, adders including half adders, full adders and BCD adders, flip flops including JK, RS, and Master-Slave operation. The questions involve both theoretical concepts and practical circuit design problems.

Uploaded by

libranhitesh7889
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

DIGITAL CIRCUITS AND SYSTEMS

ASSIGNMENT 1

1. Define analog, discrete time and digital signals.


2. What are some of the advantages digital systems compared to analog systems?
3. Convert the following numbers as required in each case.
1234 10 = ( ) 2
25.625 10 = ( ) 2
603.23 10 = ( ) 2
ABCD 16 =( ) 2
15C.38 16 =( ) 2
4. Explain the difference between positive logic and negative logic.
5. What are universal gates? Why are they called so?
6. Use Boolean Algebra to show that
ABC+ABC+ABC+ABC+ ABC = A+BC
7. Using 3-variable KMap simplify the Boolean function given by
F (a, b, c) = m (0, 2, 4, 5, 6, 7)
8. Using 4-variable KMap simplify the Boolean function given by
F (w, x, y, z) = m (2, 3, 10, 11, 12, 13, 14, 15)
9. Using KMap simplify in the product-of-sum form the function given by
F(A,B,C,D} = M (0, 6, 10, 12)
10. How many bits are required to represent all the keys on a Keyboard with 108 keys?
11. Design a circuit to generate odd parity if the data is represented with 4 bits.
12. Design a 1-bit full adder with two half adders and minimum number of additional
gates.
13. What is the significance of the equation C i+1 = G i + P i C i in relation to Carry look-
ahead Adder? Define G i and P i .
14. Write the 8-bit signed-magnitude, twos-complement, and ones- complement
representation for each decimal number:
a) +25
b) +120
c) +82
d) -42
15. Draw the circuit of a BCD adder using 4-bit binary adders.
16. Obtain the excitation table of the JK' flip-flop, i.e. A JK flip-flop with an inverter
between external input K' and internal input K.
17. A set-dominate flip-flop has set and reset inputs. It differs from a conventional RS
flip-flop in that an attempt to simultaneously set and reset results in setting the flip-
flop. Obtain the excitation table of such a flip-flop?
18. Design a binary counter having the following repeated binary sequence. Use JK flip-
flops. 0, 1, 2
19. How many flip-flops will be complemented in a 10-bit binary ripple counter to reach
the next count after the following count: 1001100111
20. Explain the Master-Slave operation of a flip flop.

You might also like