Most AI Pilots Fail to Scale. MIT Sloan Teaches You Why — and How to Fix It
Learn Excel & Financial Modeling the Way Finance Teams Actually Use Them
Overview
Syllabus
Week 1: Introduction to Number Systems and Binary Arithmetic
· Importance of digital systems in electronics.
· Number systems: Binary, Octal, Decimal, and Hexadecimal.
· Conversion between different number systems.
· Binary arithmetic: Addition, subtraction, multiplication, and division.
· Signed numbers and 1’s, 2’s complement representation.
Outcome: Understand and perform number conversions and binary arithmetic operations.
Week 2: Fundamentals of Boolean Algebra
· Boolean variables and logic expressions.
· Basic postulates and theorems of Boolean algebra.
· Canonical forms – SOP and POS.
· Simplification using Boolean laws.
Outcome: Simplify and represent logical expressions using Boolean algebra
Week 3: Logic Gates and Implementation using Universal Gates
· Basic logic gates: AND, OR, NOT, NAND, NOR, XOR, XNOR.
· Truth tables and logic symbols.
· Implementation of logic functions using NAND and NOR gates.
· Introduction to logic families (TTL, CMOS).
Outcome: Design basic logic functions using universal gates.
Week 4: Combinational Logic Circuits – Basic Building Blocks
· Half adder and full adder circuits.
· Half subtractor and full subtractor.
· Encoders and decoders – concept and applications.
Outcome: Analyze and design simple arithmetic and code-conversion circuits.
Week 5: Multiplexers and Demultiplexers
· Concept of data selection and distribution.
· Working principle of multiplexers (MUX) and demultiplexers (DEMUX).
· Realization of Boolean expressions using MUX.
· Practical examples and applications.
Outcome: Use multiplexers and demultiplexers for logic design and data routing.
Week 6: K-map Techniques for Logic Simplification
· Karnaugh map (K-map) method – 2, 3, and 4-variable maps.
· Grouping and minimization rules.
· Don’t care conditions and their applications.
· Simplified circuit design examples.
Outcome: Minimize logic expressions effectively using K-map techniques.
Week 7: Sequential Logic Circuits – Introduction
· Difference between combinational and sequential logic.
· Flip-flops: SR, JK, D, and T – symbol, truth table, and operation.
· Concept of clocking and triggering.
Outcome: Understand the working and use of flip-flops in memory and control applications.
Week 8: Registers – Data Storage and Transfer
· Need for data storage in digital systems.
· Shift registers: Serial-in Serial-out (SISO), Serial-in Parallel-out (SIPO), etc.
· Parallel registers and their applications.
Outcome: Design and use registers for data movement and temporary storage.
Week 9: Counters – Design and Applications
· Concept of counting in digital circuits.
· Asynchronous (ripple) and synchronous counters.
· Up and down counters.
· Applications in digital clocks, frequency division, etc.
Outcome: Design and analyze different types of counters.
Week 10: Analysis and Design of Synchronous Sequential Circuits
· State diagram and state table representation.
· State reduction and assignment.
· Design of simple synchronous sequential circuits like sequence detectors.
Outcome: Develop logic-based sequential systems using state machine concepts.
Week 11: Memory Devices – ROM and RAM
· Concept of memory and storage.
· Read Only Memory (ROM), Programmable ROM (PROM), and EEPROM.
· Random Access Memory (RAM): Static and dynamic types.
· Applications of memory devices in digital systems.
Outcome: Identify and understand the operation of memory devices used in digital systems.
Week 12: Applications of Digital Techniques in Embedded and IoT Systems
· Role of digital electronics in embedded systems.
· Applications in automation, sensors, and control systems.
· Overview of microcontrollers and digital interfacing concepts.
· Emerging trends in digital electronics.
Outcome: Relate digital techniques to real-world applications in embedded and IoT environments
Taught by
Dr. Sunanda Ambulker