Digital Electronics Assignment 1 2024-25 PDF

MGM’ s College of Engineering, Nanded Department of Electronics and Telecommunication Engineering Assignment I Class: SY(ECT)-A.Y. 2024-25 Subject : Digital Electronics (BTETC203) Sr....

MGM’ s College of Engineering, Nanded Department of Electronics and Telecommunication Engineering Assignment I Class: SY(ECT)-A.Y. 2024-25 Subject : Digital Electronics (BTETC203) Sr. Question CO BT Level No. 1 Convert the decimal number 247 to its equivalent in binary, C203.1 Apply (Level 3) octal, andhexadecimal number systems. 2 Explain the difference between a weighted and a non-weighted C203.1 Understand (Level number system. Give examples of each. 2) 3 Perform the binary subtraction of 11011 from 101010 using 2's C203.1 Apply (Level 3) complement method. Show all steps involved. 4 Prove De Morgan's laws for three variables and provide a truth C203.1 Analyze(Level 4) table for verification. 5 Simplify the Boolean expression F = A'B + ABC' + AB'C using C203.1 Apply (Level 3) Boolean algebra rules and state the laws/theorems used at each step. 6 Explain the concept of standard representation for logical C203.1 Understand (Level functions and differentiate between canonical and standard 2) forms. 7 Define min-terms and max-terms in Boolean algebra. Provide an C203.1 Remember (Level example of each for a 3-variable Boolean function. 1) 8 Demonstrate how to express the Boolean function F(A, B, C) = C203.1 Apply (Level 3) A'BC + AB + BC' in both the Sum of Minterms (SOP) and Product of Maxterms (POS) forms. 9 Describe the process of binary multiplication with an example C203.1 Understand (Level of multiplying two 4-bit binary numbers. 2) 10 Compare and contrast the properties of the binary, octal, and C203.1 Analyze(Level 4) hexadecimal number systems and discuss their relevance in digital systems. 12 Simplify the Boolean function F(A, B, C, D) = Σ(1, 3, 7, 11, 15) C203.1 Apply (Level 3) using Karnaugh Map (K-map) and express it in Sum of Products (SOP) form. 13 Describe the concept of "don't care" conditions in logic design C203.1 Analyze (Level 4) and simplify the function F(A, B, C) = Σ(1, 3, 7) + d(2, 5) using K-map. 14 Design a BCD-to-7 segment decoder and illustrate its C203.1 Apply (Level 3) implementation using logic gates.  15 Convert a binary code (4-bit) to Gray code using a C203.1 Apply (Level 3) combinational logic circuit. Draw the circuit diagram and explain its operation. 16 Design a 4-bit parallel adder using full adders and explain its C203.1 Apply (Level 3) operation. 17 Explain how a digital comparator is used to compare two 2-bit C203.1 Analyze (Level 4) binary numbers. Draw the logic circuit and truth table. 18 Define a parity generator and checker. How are they used in C203.1 Understand (Level digital communication to detect errors? 2) 19 Explain the working of a clocked SR flip-flop with a suitable C203.2 Understand (Level truth table and timing diagram.? 2) 20 Illustrate the design of a 4-bit synchronous up-counter using JK C203.2 Apply (Level 3) flip-flops. Provide the circuit diagram and explain its operation. 21 Compare and contrast a D flip-flop and a T flip-flop. Convert a C203.2 Analyze (Level 4) D flip-flop into a T flip-flop using a logic diagram. 22 Describe the application of flip-flops in the design of shift C203.2 Apply (Level 3) registers. Draw and explain a 4-bit serial-in, parallel-out shift register. 23 Define the terms lock-out, clock skew, and clock jitter in the C203.2 Understand (Level context of sequential circuit design. 2) 24 Design a 3-bit twisted ring counter and explain its operation C203.2 Apply (Level 3) with the help of a state diagram 25 Illustrate the use of a look-ahead carry adder and describe how it C203.2 Apply (Level 3) reduces propagation delay compared to a ripple carry adder. 26 Explain the design and working of a 4-to-1 multiplexer using C203.2 Understand (Level logic gates. How can a multiplexer be used to implement any 2) Boolean function? Dr. Mrs. K.P. Paithane (Jondhale) D. J. Tuptewar Dr. Mrs. K. P. Paithane(Jondhale) Subject In-charge Module Coordinator Head of Dept.  Mahatma Gandhi Mission's College of Engineering, Nanded Electronics and Telecommunication Engg. [2024-25] Subject : BTETC303Digital Electronics Faculty :Dr. Mrs. K. P. Paithane (Jondhale) Year Third Year - SY-ETC (ODD SEM) Marks : 20 Date : 5thSept. 2023 Duration : 60 Minutes Figures to the right indicate full marks.Draw neat diagram wherever necessary. Assume suitable data if necessary, stating it clearly. Bloom’s Course Sr.No. Question Marks Taxonomy Outcome All questions are compulsory Compare and contrast the properties of the binary, octal, and hexadecimal number systems. Discuss their relevance Analyze 1 5.00 C2O3.1 in digital systems. (Level 4) Perform the binary subtraction of 11011 from 101010 using the 2 2's complement method. Show all the steps involved. 5.00 Apply C2O3.1 (Level 3) Simplify the Boolean expression F = A'B + ABC' + AB'C using 3 Boolean algebra rules, and state the laws/theorems used at each 5.00 Apply C2O3.1 step. (Level 3) Describe the concept of "don't care" conditions in logic design C203.1 4 5.00 Analyze and simplify the function F(A, B, C) = Σ(1, 3, 7) + d(2, 5) using (Level 4) K-map. Dr. Mrs. K.P. Paithane (Jondhale) D. J. Tuptewar Dr. Mrs. K. P. Paithane(Jondhale) Subject In-charge Module Coordinator Head of Dept.  Mahatma Gandhi Mission's College of Engineering, Nanded Electronics and Telecommunication Engg. [2024-25] Subject : BTETC303Digital Electronics Faculty :Dr. Mrs. K. P. Paithane (Jondhale) Year Third Year - SY-ETC (ODD SEM) Marks : 20 Date : 5thSept. 2023 Duration : 60 Minutes Figures to the right indicate full marks.Draw neat diagram wherever necessary. Assume suitable data if necessary, stating it clearly. Bloom’s Course Sr.No. Question Marks Taxonomy Outcome All questions are compulsory Compare and contrast the properties of the binary, octal, and hexadecimal number systems. Discuss their relevance Analyze 1 5.00 C2O3.1 in digital systems. (Level 4) Perform the binary subtraction of 11011 from 101010 using the 2 2's complement method. Show all the steps involved. 5.00 Apply C2O3.1 (Level 3) 3 Simplify the Boolean expression F = A'B + ABC' + AB'C using 5.00 C2O3.1 Boolean algebra rules, and state the laws/theorems used at each Apply step. (Level 3)  Mahatma Gandhi Mission's College of Engineering, Nanded Electronics and Telecommunication Engg. [2024-25] Subject : BTETC303Digital Electronics Faculty :Dr. Mrs. K. P. Paithane (Jondhale) Year Third Year - SY-ETC (ODD SEM) Marks : 20 Date : 5thSept. 2023 Duration : 60 Minutes Figures to the right indicate full marks.Draw neat diagram wherever necessary. Assume suitable data if necessary, stating it clearly. Bloom’s Course Sr.No. Question Marks Taxonomy Outcome Describe the concept of "don't care" conditions in logic design C203.1 4 5.00 Analyze and simplify the function F(A, B, C) = Σ(1, 3, 7) + d(2, 5) using (Level 4) K-map. Dr. Mrs. K.P. Paithane (Jondhale) D. J. Tuptewar Dr. Mrs. K. P. Paithane(Jondhale) Subject In-charge Module Coordinator Head of Dept.