sharif sir check list

📘 ECE 2103 - [ ] Master Checklist (Instructor 1)

📝 Chapter 1: Number Systems and Arithmetic

• Base Conversions ✅ 2026-07-27
  • [ ] Convert integer/fraction decimals to base-3, base-4, base-7, octal, hex, base-12 (e.g., 249.6 or 247.8). [PYQ: 2015, 2016, 2017, 2022, 2023, 2025] (1.01)
  • [ ] Convert hexadecimal with fractions to decimal, octal, binary (e.g., 2AC5.D, 2CA5.D). [PYQ: 2015, 2017, 2025] (1.01)
  • [ ] Calculate binary equivalent of fractions (e.g., 2/3 out to 8 places) and verify accuracy. [PYQ: 2021, 2023] (1.01)
• Base Complements & Arithmetic ✅ 2026-07-27
  • [ ] Binary subtraction using 1’s and 2’s complement (and check via straight subtraction). [PYQ: 2015, 2018, 2019] (1.02) ✅ 2026-07-27
  • [ ] Multiplication in non-decimal bases (e.g., base-6, base-8) without converting to decimal first. [PYQ: 2024] (1.02) ✅ 2026-07-27
• Computer Arithmetic (The 8-bit Two’s Complement Problem) ✅ 2026-07-27
  • [ ] Compute $A+B$, $A-B$, $B-A$, and $-A-B$ using 8-bit two’s complement arithmetic (e.g., A=25, B=-46 or A=25, B=-48). [PYQ: 2016, 2017, 2020, 2021, 2025] (1.03) ✅ 2026-07-27

📝 Chapter 2: Digital Codes & Error Detection

• Code Concepts & Definitions
  • [ ] Distinction between number system and code. [PYQ: 2018] (2.01) ✅ 2026-07-27
  • [ ] Define Error detection code. [PYQ: 2017] (2.04) ✅ 2026-07-27
  • [ ] Differences between error detecting and error correcting codes. [PYQ: 2018] (2.04) ✅ 2026-07-27
  • [ ] Define self-complementary code. [PYQ: 2017, 2021, 2023, 2025] (2.02) ✅ 2026-07-27
  • [ ] Mathematical Proof: “Excess-3 code is a self-complementary code”. [PYQ: 2021, 2023, 2025] (2.02) ✅ 2026-07-27
• Specific Code Systems
  • [ ] Conversions for BCD, Excess-3, 2421, 5211, and 84-2-1 codes. [PYQ: 2018, 2019] (2.01, 2.02) ✅ 2026-07-27
  • [ ] Gray Code (Reflected Code): Definition and Gray-to-Binary XOR logic conversions. [PYQ: 2017, 2018, 2024] (2.03) ✅ 2026-07-27
• Parity Bit Checkers
  • [ ] Design a combinational circuit to check for even parity of 4 bits (Logic 1 output if NOT even parity). [PYQ: 2015, 2020, 2023, 2024] (2.04) ✅ 2026-07-27
  • [ ] Design a 3-bit parity generator and 4-bit parity checker using odd parity bit. [PYQ: 2022, 2025] (2.04) ✅ 2026-07-27

📝 Chapter 3: Boolean Algebra & Logic Simplification

• Fundamentals of Boolean Algebra
  • [ ] Significance/Importance of studying digital electronics. [PYQ: 2020, 2024, 2025] (3.01, 3.02) ✅ 2026-07-27
  • [ ] Define Duality Principle, Positive/Negative logic. [PYQ: 2015, 2016, 2018, 2019, 2022] (3.01, 4.07) ✅ 2026-07-27
  • [ ] Duality Proof 1: The dual of XOR is equal to its complement. [PYQ: 2015, 2018] (3.01) ✅ 2026-07-27
  • [ ] Duality Proof 2: A positive-logic AND gate is a negative-logic OR gate. [PYQ: 2015, 2018, 2019, 2023, 2025] (4.07) ✅ 2026-07-27
• Standard and Canonical Forms
  • [ ] Definitions: Canonical form vs. Standard form. [PYQ: 2015, 2016, 2019, 2021, 2022, 2024] (3.03) ✅ 2026-07-27
  • [ ] Mathematical conversions: Express equations into full SOP (Sum of Minterms) and POS (Product of Maxterms) forms using missing variable expansion. [PYQ: 2015, 2016, 2017, 2019, 2021, 2022, 2024] (3.04) ✅ 2026-07-27
• Karnaugh Maps (K-Maps)
  • [ ] 4-variable K-map simplifications for expressions. [PYQ: 2022, 2023] (3.04, 3.05) ✅ 2026-07-27
  • [ ] Simplify functions combining both SOP & POS using K-maps, including “Don’t Care” conditions. [PYQ: 2016, 2018] (3.06) ✅ 2026-07-27
• The Tabular Method
  • [ ] Define and explain prime implicants. [PYQ: 2018] (3.05) ✅ 2026-07-27
  • [ ] Quine-McCluskey (Tabular) method: Determining prime implicants and simplifying functions. [PYQ: 2023, 2024, 2025] (3.05) ✅ 2026-07-27

📝 Chapter 4: Universal Gates & Advanced Logic Families

• Gate Implementations & Circuit Analysis

  • [ ] Define Universal gate and implement basic functions using NOR/NAND. [PYQ: 2021] (4.02) ✅ 2026-07-27
  • [ ] Analyze drawn logic circuits: extract the Boolean function, simplify it, or represent it with a single logic gate. [PYQ: 2016, 2018, 2019, 2020, 2022, 2023, 2024, 2025] (4.07) ✅ 2026-07-27
  • [ ] Proof: Show that a specific 5-gate NOR circuit acts as an Exclusive-OR. [PYQ: 2015, 2021] (4.02) ✅ 2026-07-27

• Characteristics of Logic Gates

  • [ ] Definitions: Fan-out, Propagation delay, Power dissipation, Noise margin, Current Sourcing. [PYQ: 2015, 2016, 2021, 2024, 2025] (4.06) ✅ 2026-07-27
  • [ ] Open collector TTL gates: Operation of a common bus system and Wired-AND logic proof. [PYQ: 2019] (4.05) ✅ 2026-07-27
  • [ ] TTL NAND gate: Working principle and necessary circuit diagram. [PYQ: 2023, 2025] (4.05) ✅ 2026-07-27
  • [ ] DTL Gate: Prove the output transistor goes into saturation when inputs are high ($h_{FE}=20$). [PYQ: 2021] (4.04) ✅ 2026-07-27
  • [ ] BJT Inverter operation: Mathematical proof of saturation/cut-off given circuit parameters. [PYQ: 2016, 2019] (4.03) ✅ 2026-07-27

• [ ] Transistor Basics: Draw and explain the Transistor Base and Transistor Collector characteristics for an npn silicon transistor. [PYQ: 2022] (4.04) ✅ 2026-07-27

• [ ] DTL Gate: Prove the output transistor goes into saturation when inputs are high ($h_{FE}=20$). [PYQ: 2021, 2022] (4.04) ✅ 2026-07-27

• [ ] Standard TTL Gates: Working principle and necessary circuit diagrams for a TTL NAND gate and a TTL AND gate. [PYQ: 2023, 2025] (4.05) ✅ 2026-07-27

• [ ] Open Collector TTL: Operation of a common bus system and Wired-AND logic proof. [PYQ: 2015, 2019] (4.05) ✅ 2026-07-27

• [ ] CMOS Logic: Draw the circuit of a three-input NAND gate using CMOS transistors. [PYQ: 2019] (4.06) ✅ 2026-07-27

📝 Chapter 5: Combinational Circuit Design

• Arithmetic Circuits
  • [ ] Implement 4 specific Boolean functions ($D,E,F,G$) using three Half-Adders. [PYQ: 2015, 2018, 2019] (5.01) ✅ 2026-07-27
  • [ ] Show output carry of a Full-Adder: $C_{i+1}=G_i+P_i{C}_i$. [PYQ: 2018] (5.01) ✅ 2026-07-27
  • [ ] Convert a Full-Adder to a Full-Subtractor using one inverter. [PYQ: 2020] (5.01) ✅ 2026-07-27
  • [ ] Multiplier circuit design: Multiply two 2-bit binary numbers. [PYQ: 2022] (5.01) ✅ 2026-07-27
• Code Converters
  • [ ] Design a converter for a Decimal digit from 2,4,2,1 code to 8,4,-2,-1 code. [PYQ: 2017, 2019, 2020, 2023, 2024, 2025] (5.02) ✅ 2026-07-27
  • [ ] Design BCD to Excess-3 code converter. [PYQ: 2018] (2.02) ✅ 2026-07-27
• Comparators
  • [ ] Design a 4-bit Magnitude Comparator: Output $x=1$ if $A=B$, and $x=0$ if $A\ne B$. [PYQ: 2023, 2024, 2025] (5.01) ✅ 2026-07-27
• Data Routing (MUX, Demux, Decoders)
  • [ ] Implement functions using Decoders and external gates. [PYQ: 2016, 2017, 2018, 2020] (5.02, 5.06) ✅ 2026-07-27
  • [ ] Tree Networks: Design 16-to-1 MUX using 4-to-1 MUXes. [PYQ: 2016, 2017] (5.03) ✅ 2026-07-27
  • [ ] Tree Networks: Construct 4-to-16 line decoder using five 2-to-4 decoders with enable. [PYQ: 2021] (5.03) ✅ 2026-07-27
  • [ ] Tree Networks: Construct 5-to-32 decoder using four 3x8 decoders and one 2x4 decoder. [PYQ: 2024, 2025] (5.03) ✅ 2026-07-27
  • [ ] Tree Networks: Implement 1x16 Demux using 2-to-4 decoders. [PYQ: 2023] (5.03) ✅ 2026-07-27
  • [ ] Implement Boolean functions using a Multiplexer (8x1 or 4x1). [PYQ: 2016, 2019, 2022, 2023, 2024] (5.02) ✅ 2026-07-27
  • [ ] Implement a Full-Adder with two 4x1 multiplexers. [PYQ: 2021] (5.02) ✅ 2026-07-27
  • [ ] Design a 4-to-1 MUX using ONLY NAND gates. [PYQ: 2018] (5.06) ✅ 2026-07-27
• Programmable Logic (ROM & PLA)
  • [ ] Define/Distinguish operation between ROM and PLA. [PYQ: 2017, 2024, 2025] (5.04) ✅ 2026-07-27
  • [ ] Draw the internal block diagram of a PLA. [PYQ: 2017, 2018] (5.04) ✅ 2026-07-27
  • [ ] ROM Design: Circuit that accepts a 3-bit number and generates a binary output equal to its square. [PYQ: 2015, 2017, 2020, 2021, 2025] (5.04) ✅ 2026-07-27
  • [ ] PLA Design: Implement specific functions with a PLA having three inputs, four product terms, and two outputs. [PYQ: 2015, 2023, 2024, 2025] (5.04) ✅ 2026-07-27
• Application-Specific Combinational Logic (Word Problems)
  • [ ] Restaurant voting logic (Jane, Joe, Sue tie-breakers). [PYQ: 2016] (5.05) ✅ 2026-07-27
  • [ ] Spaceship battery monitor (Analog to digital voltage > 6V logic). [PYQ: 2017] (5.05) ✅ 2026-07-27
  • [ ] Boiler alarm logic (Sensors for flame, chimney temp, pressure, water temp). [PYQ: 2021] (5.05) ✅ 2026-07-27
  • [ ] Divisibility indicator (Multi-bit input divisible by 2 and 3). [PYQ: 2022] (5.05) ✅ 2026-07-27

📘 Specialized Edge-Case Checklist (Instructor 1)

📝 Relay & Switching Logic Circuits

(This is the only major textbook application that actually appears in the Term Exams)

• [ ] Analyze a physical switching circuit (drawn with series/parallel switches and a lightbulb) and express it in a binary logic notation / Boolean expression. [PYQ: 2024, 2025] (4.07) ✅ 2026-07-27
• [ ] Find a simplified switching expression and draw the equivalent logic gate network for a given switching circuit. [PYQ: 2016] (4.07) ✅ 2026-07-27

📝 Additional Weighted Codes

(While the 6,3,1,1 code never appeared, another rare weighted code did make a single appearance)

• [ ] Convert decimal numbers into the 5211 weighted code. [PYQ: 2018] (2.01) ✅ 2026-07-27