0% found this document useful (0 votes)
179 views7 pages

3 CH

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
179 views7 pages

3 CH

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 7
Subject - Digital Techniques (DTE - 22320) (IMP Questions with Answers) ed EK; ont I Scheme - MSBTE Computer & Electronics Engineering Group (CO/CM/CW/DE/EJ/ET/EN/EX/EQ/IE/IS/IC/MU) (Weightage - 18 Marks) 1. Write simple examples of boolean expression for SOP and POS. Answer: 1) SOP Form - Y = AB + BC + AC 2) POS Form - Y = (A+B)(B+C)(A+C) 2. Define Minterm and Maxterm w.r.t. K-map. Answer: Minterm: Standard product term in sum of product is known as minterm. Eg. ABC Maxterm: Standard sum term in product of sum is known as maxterm. Eg. A+B+C 3. Define encoder, write the IC number of IC used as decimal to BCD encoder. Answer: An encoder is a device or circuit that converts information from one format or code to another, for the purpose of standardization, speed or compression. Decimal to BCD encoder IC- 74147 4, State the necessity of multiplexer. Answer: Necessity of multiplexer: 1) It reduces the number of wires required to pass data from source to destination. 2) For minimizing the hardware circuit. 3) For simplifying logic design. | KHARAT ACADEMY 4) In most digital circuits, many signals or channels are to be transmitted, and then it becomes necessary to send the data on a single line simultaneously. 5, Draw logic diagram of half adder circuit. Answer: A Sum Carry 6. Describe the function of Full Adder Circuit using its truth table, K-Map simplification and logic diagram. OR Design a full Adder using Truth Table and K-map. OR Draw logical diagram of full adder using K-map simplification and write truth table. Answer: A full adder is a combinational logic circuit that performs addition between three bits, the two input bits A and B, and carry C from the previous bit. Block Diagram: Digital Techniques KHARAT ACADEMY Truth Table: Input Output A B Cin Sum Carry 0 0 0 0 0 0 0 1 1 0 oO 1 0 a 0 ° 1 1 0 1 1 0 0 1 0 1 0 1 0 1 1 1 0 0 1 1 1 1 1 1 Cay ABYA Cyt B Cig Logic Diagram: 8. L—— Sum B A®B) @Cin Cout (AB + ACn #BCic) KHARAT ACADEMY 7. Draw 16:1 MUX tree using 4:1 MUX. 10 n—+] 2—| 8 1 $1 so “+“— 1s | 6 >| v T s1 so ie 9 >| ss s2 10. >| ! s1 so isa 13 >| ins | s1_ so Digital Techniques KHARAT ACADEMY 9. Design BCD to seven segment decoder using IC 7447 with its truth table. OR Draw the circuit diagram of BCD to 7 - segment decoder and write truth table. Answer: 1) BCD to 7 segment decoder is a combinational circuit that accepts 4 bit BCD input and generates appropriate 7 segment output. 2) In order to:produce the required numbers from 0 to 9 on the display the correct combination of LED segments need to be illuminated. 3) Astandard:7 segment LED display generally has 8 input connections, one from each LED segment & one that acts as a common terminal or connection for all the internal segments 4) Therefore there are 2 types of display 1. Common Anode Display 2. Common Cathode Display Common Anode Display: eee KHARAT ACADEMY . Minimize the following expression using K-Map. f(A,B, C, D) = Em (0, 1, 2, 4,5, 7,8, 9, 10) (4 Marks-W18) . Minimize the following expression using K-Map and implement it. f(A, B, C,D) = TM (1, 3, 5, 7, 8, 10, 14) (4 Marks-S19) . Realize given expression using K-Map. f(A, B, C, D) = Em (3, 5, 7, 8, 10, 11, 12,13) (4 Marks-S22) . Minimize the four variable logic function using K map. F(A,B,C,D) = Em(0,1,2,3,5,7,8,9,11,14) (4 Marks-W19) . Implement the following function using de-multiplexer. (i) 1 =¥m(0,2,4,6) (ii) £2 = Em(1.3,5) (4 Marks-W19) . Design 4 bit Binary to Gray code converter. (6 Marks-W18) OR

You might also like