Scribd
Upload
417 views1 page

Digital Design-Digital Electronics Question Bank

This document contains a 3 semester question bank for the course Digital Design/Digital Electronics from Sankalchand Patel University. It includes 25 questions across two units. Unit 1 covers binary number conversions, Boolean algebra, logic gates, simplifying Boolean functions using logic gates. Unit 2 focuses on simplifying Boolean functions using Karnaugh maps. The questions range from basic binary number conversions and operations to more advanced topics like Boolean algebra, logic gates, Karnaugh maps, and universal gates.

Uploaded by

Pawece
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
417 views1 page

Digital Design-Digital Electronics Question Bank

This document contains a 3 semester question bank for the course Digital Design/Digital Electronics from Sankalchand Patel University. It includes 25 questions across two units. Unit 1 covers binary number conversions, Boolean algebra, logic gates, simplifying Boolean functions using logic gates. Unit 2 focuses on simplifying Boolean functions using Karnaugh maps. The questions range from basic binary number conversions and operations to more advanced topics like Boolean algebra, logic gates, Karnaugh maps, and universal gates.

Uploaded by

Pawece
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/ 1

SANKALCHAND PATEL UNIVERSITY

Sankalchand Patel College of Engineering


Information and Communication Technology
3rd Semester, Question Bank for Digital Design / Digital Electronics

Unit -1

1. (516)8 = ( )10= ( )16


2. (250)10 = ( )8= ( )2
3. (2ED)16=( )8=( )2
4. 42078= ?10
5. Convert (110.101)2 = ( )10
6. Convert (4.47)10 = ( )2
7. Given the two binary numbers X = 1010101 and Y = 1001011, perform the subtraction X-Y
8. Using 10’s complement perform (4572)10-(2102)10.
9. State and prove De-Morgan’s theorem.
10. What are logic gates? Explain the different types of logic gates with truth table and logic circuit
diagram.
11. Simplify following Boolean equation and draw gate level circuit.
a.) AB’C + B + BD’ + ABD’ + A’C
b.) AB + BC + A'C
12. Add the numbers 100111 and 11011?
13. Subtract 1011100 from 0111000?
14. Multiply the binary numbers 1110 and 1011?
15. Divide 110001 by 110?
16. Express the Boolean function F (A, B, C) = AB+ AC+AD’ in a standard sum of min terms form.
17. Describe in brief using examples : (1) BCD (2) Weighted codes
18. Prove NAND gate as a universal Gate with necessary diagram

Unit -2

1. Simplify the function F(A,B,C,D,E)= ∑m(0,2,4,6,9,11,13,15,17,21,25,27,29,31) using Karnaugh


map.
2. Simplify using Karnaugh Map. F= ∑m( 0,1,3,4,5,7,8,9,10,12,13,21,24,25,26,28,29)
3. Minimize following Boolean function using K-map & design the simplified function using logic
gates. F(A,B,C,D) = ∑m(1, 2, 4, 6, 7, 11, 15) + ∑ d(0, 3)
4. Simplify using Karnaugh Map. F= ∑m( 0,1,2,4,5,6)
5. Simplify using Karnaugh Map. F= ∑M( 3,7)

You might also like