[go: up one dir, main page]
Scribd
Upload
21 views2 pages

Electronics Tutorials 2&3

The document outlines tutorials for the Fundamentals of Electronics Engineering course at Moradabad Institute of Technology, focusing on topics such as K-map minimization, Boolean algebra simplification, and various digital logic operations. It includes exercises for minimizing functions, simplifying Boolean expressions, and performing binary and hexadecimal conversions. The tutorials also cover the implementation of logic gates and the definition of key concepts in electronics engineering.

Uploaded by

guidetalkpriyanshu
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
21 views2 pages

Electronics Tutorials 2&3

The document outlines tutorials for the Fundamentals of Electronics Engineering course at Moradabad Institute of Technology, focusing on topics such as K-map minimization, Boolean algebra simplification, and various digital logic operations. It includes exercises for minimizing functions, simplifying Boolean expressions, and performing binary and hexadecimal conversions. The tutorials also cover the implementation of logic gates and the definition of key concepts in electronics engineering.

Uploaded by

guidetalkpriyanshu
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/ 2

MORADABAD INSTITUTE OF TECHNOLOGY, MORADABAD

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

Sub.: Fundamentals of Electronics Engineering


Sem.: 1st Subject Code: BEC-101

Tutorial – 2
Minimize the following using K-map
1. F(A,B,C,D) = Ʃ (1,5,7,9,11,13,15 )
2. F(A,B,C,D) = Ʃ ( 4,5,8,9,11,12,13,15 )
3. F(A,B,C,D) = Ʃm ( 1,5,6,7,11,12,13,15 )
4. F(A,B,C,D) = Ʃ ( 0,1,2,5,13,15 )
5. F(A,B,C,D) = Ʃm ( 1,4,8,12,13,15 ) + d (3,14)
6. F(A,B,C,D) = Ʃ ( 1,3,7,11,15 ) +Ʃd (0,2,5,8,14)
7. F(A,B,C,D) = πM ( 0,2,3,5,7 )
8. F(A,B,C,D) = πM ( 1,5,6,7,8,9,10,14 )
9. F(A,B,C,D,E) = Ʃm ( 0,1,7,9,11,13,15,16,17,23,25,27 )
10. F(A,B,C,D,E) = Ʃm ( 0,2,5,7,13,15,18,20,21,23,28,29,31 )
Simplify the following expressions using Boolean Theorems
1. AB+BC+B’C
2. A’B+AB+A’B
3. A+AB’+A’B
4. A’B+CD’
5. ̅̅̅̅̅̅̅̅̅̅̅̅
𝐴’𝐵 + 𝐶𝐷 ’
6. AB+𝐴𝐶 ̅̅̅̅ +AB’C(AB+C)
7. (A’+B) (A+B)
8. ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅̅̅̅̅̅̅̅̅̅̅̅̅̅
𝐴𝐵’ + 𝐴𝐵𝐶 + A(B + AB’)
9. 𝐴𝐵𝐶 + 𝐴𝐵 ′ 𝐶 + 𝐴𝐵𝐶 ′
10. 𝐴′ 𝐵 ′ 𝐶 ′ + 𝐴′ 𝐵𝐶 ′ + 𝐴𝐵 ′ 𝐶 ′ + 𝐴𝐵𝐶 ′
11. ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
(𝐴𝐵 + 𝐶 ′ )(𝐴 ̅̅̅̅̅̅̅̅
+ 𝐵 + 𝐶)
MORADABAD INSTITUTE OF TECHNOLOGY, MORADABAD
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

Sub.: Fundamentals of Electronics Engineering


Sem.: 1st Subject Code: BEC-101
Tutorial – 3
1. (1010110100.110)2 = ( )10
2. Simplify the Boolean function using Boolean algebra theorems.
A'B'C' + A'BC' + AB'C' + ABC
3. (a) Subtract using 10's complement : (9754)10– (364)10
(b) Subtract using 1's complement: (10111)2 – (110011)2
4. Minimize F(A,B,C,D) = M(3,4,5,7,9,13,14,15),d(0,2,8) using K-Map and realize using NOR
Gate only.
5. Minimize F(A,B,C,D,E) = m(0,1,2,4,5,6,10,13,14,18,21,22,24,26,29,30) and realize the
simplified function using basic logic gates.
6. Determine the base of the following.
(a) (345)10 = (531) x
(b) (2374)16 = (9076) x
7. Write the truth table of the two input EX-OR and two input EX-NOR Gate.
8. Perform the following operations as indicated.
(a) Determine 2's complement of (1010.110)2.
(b) Convert (25.125)10 into hexadecimal number.
(c) Add binary number (1011)2 and (1111)2.
(d) State Demorgan's Theorem.
(e) Define Minterms and Maxterms.
9. Define Universal Logic Gates, realize basic logic gates using NAND and NOR Gates.
10. Simplify the function F(A,B,C,D) = Ʃm(0,2,5,6,7,12,14,15) + d(8,10) using K-Map and
implement the simplified function using NAND Gate only.

You might also like