REALIZATION OF A BOOLEAN FUNCTION. AIM: To simplify the given expression and to realize it using Basic gates and Univers

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899603
Joined: Mon Aug 02, 2021 8:13 am

REALIZATION OF A BOOLEAN FUNCTION. AIM: To simplify the given expression and to realize it using Basic gates and Univers

Post by answerhappygod »

Realization Of A Boolean Function Aim To Simplify The Given Expression And To Realize It Using Basic Gates And Univers 1
Realization Of A Boolean Function Aim To Simplify The Given Expression And To Realize It Using Basic Gates And Univers 1 (94.76 KiB) Viewed 59 times
REALIZATION OF A BOOLEAN FUNCTION. AIM: To simplify the given expression and to realize it using Basic gates and Universal gates LEARNING OBJECTIVE: .To simplify the Boolean expression and to build the logic circuit. • Given a Truth table to derive the Boolean expressions and build the logic circuit to realize COMPONENTS REQUIRED: IC 7400, IC 7408, IC 7432, IC 7406, IC 7402, Connecting wires, Bread board. Realization using Basic gates TRUTH TABLE 3 7406 7408 7432 D 7406 7408 Realization using NAND gates INPUTS A B с D 0 000 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 OUTPUT Y 0 0 1 0 0 0 1 0 1 1 1 1 0 0 1 0 B 7400 7400 7400 D 7400 2400
Realization using NOR gates T4C2 Da DoDo 7412 C 742 7402 DoD 7412 2) For the given Truth Table, realize a logical circuit using basic gates and NAND gates D 0 1 0 Output Y 1 1 0 O 1 1 0 1 A 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 Inputs B C 0 0 0 0 0 1 0 1 1 1 0 1 0 1 1 1 1 1 0 0 0 0 0 1 0 1 1 1 0 1 0 0 1 1 1 1 0 1 0 1 0 1 D 1 0 1 0 0 0 0 0 0 0 0 1 0 0 1 1
PROCEDURE: 1. Check the components for their working. Insert the appropriate IC into the IC base. 2. Make connections as shown in the circuit diagram. 3. Provide the input data via the input switches and observe the output on output LEDs Verify the Truth Table RESULT: Simplified and verified the Boolean function using basic gates and universal gates DISCUSSION: 1) What are the different methods to obtain minimal expression? 2) Realize I(A,B,C,D) = (0,1,2,3,4,5,6,7,8,9,10) and show the truthtables. 3) What is a Min term and Max term 4) State the difference between SOP and POS. 5) What is meant by canonical representation? 6) What is K-map? Why is it used? CONCLUSION
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Post Reply