This document is an assignment for B.Tech. students in the Fundamentals of Electronics Engineering course, due on December 5, 2025. It contains a series of problems involving number conversions, Boolean algebra simplifications, circuit design using logic gates, and K-map techniques. The assignment covers various topics in electronics and digital logic design, requiring students to demonstrate their understanding and application of these concepts.
This document is an assignment for B.Tech. students in the Fundamentals of Electronics Engineering course, due on December 5, 2025. It contains a series of problems involving number conversions, Boolean algebra simplifications, circuit design using logic gates, and K-map techniques. The assignment covers various topics in electronics and digital logic design, requiring students to demonstrate their understanding and application of these concepts.
B.TECH. (SEM I) ASSIGNMENT NUMBER 1 SUBJECT NAME - FUNDAMENTALS OF ELECTRONICS ENGINEERING
Note: Please submit assignment on A-4 sheet paper.
1. Convert the following numbers as indicated
(a) (62.7)8 = ( )16 (b) (BC64)16 = ( )10 (c) (111011)2 = ( )5 2. Add without converting the following octal numbers 7461 and 3465. 3. Convert the following : (a) ( 2CCD)16 = ( )8 = ( )5 (b) ( 784 )9 = ( )10 = ( )4 = ( )2 4. Determine the base of the following: (a) (345)10= (531)x (b) (2374)16=(9076)x 5. Subtract using 1’s complement: (10111)2 – (110011)2 6. Simplify the following function by using the Boolean algebra: AB’C’D + A’B’D + BCD’+ A’B+BC’ 7. Implement the expression of XOR gate with the help of NAND gates only. 8. What are the binary-arithmetic operations for 11.10 + 10.11 + 111.00 + 110.11 + 001.01=? 9. Why are NAND and NOR gates called universal gates? Design basic gates using universal gates. 10. Realize the following expression using NAND Gate only: F(A,B,C,D) = A’BC’+ A’B’C + AC’D + ACD’ 11. Design a circuit using only NOR gates for Boolean expression: Y=ABC’+ BCD’+CD 12. Convert the given expression into canonical SOP form: f= A+ AB+ABC 13. Convert the given expression into canonical POS form: F= (A+B)(B+C)(C+A) 14. By showing all the calculations, do as directed: (i) For a boolean function of 4 variables, ∑(3,7,11,14,15) = Π(?) 15. Simplify the function 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = Σ𝑚(0,2,3,5,7,8,9,10,12,13) + Σd(1,6,11,14) using K-Map and implement the simplified expression using NAND gates only. 16. 𝐹(𝐴, 𝐵, 𝐶, 𝐷, 𝐸) = Σ𝑚(0,1,2,4,5,6,8,10,13,14,16,18,21,22,24,26,29,30) . Simplify the function with the help of K-Map and realize the simplified function using basic logic gates. 17. 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = 𝜋𝑀(3,4,5,7,9,13,14,15) + 𝑑(0,2,8) . Simplify the function with the help of K-Map and realize the simplified function using NOR gates. 18. 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = 𝜋𝑀(0,2,10,11,12,14,15) + 𝑑(5,13) . Simplify the function with the help of K-Map and realize the simplified function using NOR gates. 19. Simplify the function 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = Σ𝑚(0,2,5,6,7,13,14,15) + Σd(8,10) using K-Map and implement the simplified expression using NAND gates only. 20. Minimize the following Boolean function in POS form using the K-map. (𝐴, 𝐵, 𝐶, 𝐷, 𝐸) = 𝜋𝑀(3,5,6,9,10,11,13,19,21,22,23,25,26,27,29) 21. 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = Σ𝑚(0,1,2,3,5,7,13,15) + 𝑑(8,10) . Simplify the function with the help of K-Map and realize the simplified function using basic logic gates. 22. Minimize the following using K-map technique: F(A,B,C,D)= AB’C’ +A’BC + A’B’CD +ABCD + d(1,5) 23. Simplify the following expression using K-Map and realize using NOR gates only. F(A, B, C, D) = A’ B’ C’ + AC’D’ + AB’+ A B C D’ + A’B’C. 24. Subtract by using r’s complement method where r is the base of the number: (a) (3762)2 and (2664)2 (b) (11.0101)2 and (11.100)2
KCC Institute of Technology & Management Faculty- Dr. Navnit Kumar
A Focus on Addition and Subtraction Bringing Mathematics Education Research to the Classroom 1st Edition Caroline B. Ebby - Get instant access to the full ebook with detailed content