Full Course in Fundamentals of logic design

Course Curriculum

Lecture 1: Introduction

Chapter 1: Unit 1 Numeral Systems – Methods of Conversion

Lecture 1: 1.1 Numeral Systems

Lecture 2: 1.2.a Method 1 —-> Power Series Method

Lecture 3: Example 1 on Power Series Method ( Base 16 to Decimal )

Lecture 4: Example 2 on Power Series Method ( Binary to Decimal )

Lecture 5: 1.2.b Method 2 —-> The Division Method with example 1

Lecture 6: Example 1—> Division method

Lecture 7: 1.2.c Method 3 —> Multiplication Method with example

Lecture 8: Example 2 on the Multiplication Method

Lecture 9: How to convert a non-10 base to a non-10 base

Lecture 10: Quiz 1 solution

Lecture 11: Octal and Hexadecimal Tables

Lecture 12: How to read and write a Binary number

Lecture 13: 1.2.d Method 4 —-> Convert Octal and Hexadecimal to a Binary

Lecture 14: 1.2.e Method 5 —-> Convert a Binary Base to Octal or Hexadecimal Bases

Lecture 15: Qui 2 Solution

Chapter 2: Unit 1 Numerical Systems – Signed and Unsigned numbers Operations

Lecture 1: 1.3 Introduction to Signed and Unsigned numbers

Lecture 2: 1.3-a Addition of Unsigned numbers

Lecture 3: 1.3-b Subtraction of Unsigned numbers

Lecture 4: 1.3-c Multiplication of Unsigned numbers

Lecture 5: 1.3-d Division of Unsigned numbers

Lecture 6: Division of Unsigned numbers Ex2

Lecture 7: Quiz 3 Solution

Chapter 3: Unit 1: Numerical Systems —-> Signed numbers

Lecture 1: Signed 2's Complement

Lecture 2: Signed 1's complement

Lecture 3: 2.4-a Add numbers in 2's complement

Lecture 4: Cases for Addition with 2's complement

Lecture 5: Example on Addition with 2's complement

Lecture 6: 2.4-b Add numbers in 1's complement

Lecture 7: Cases for Addition with 1's complement

Lecture 8: Example Addition with 1's Complement

Lecture 9: Quiz 4 Solution

Lecture 10: 1.5-a Weighted Codes 8-4-2-1 & 6-3-1-1

Lecture 11: 1.5-b Unweighted codes ( Excess-3 , 2-out of-5 and Gray codes)

Lecture 12: ASCII Code

Chapter 4: Unit 2 : Boolean Algebra Part 1

Lecture 1: 2.1 Introduction to boolean algebra

Lecture 2: Definition of Boolean Algebra

Lecture 3: 2.2 AND , OR , INVERTER Gates

Lecture 4: Example 1 —> Boolean Expressions and Truth tables

Lecture 5: Example 2 —>Validate a Boolean Equation

Lecture 6: Example 3 —>Finding a Boolean Expression given a circuit Diagram

Lecture 7: Quiz 5 Solution

Lecture 8: 2.4 Basic theorems of boolean algebra

Lecture 9: 2.5 Commutative,Associative, Distributive and DeMorgan's Law

Lecture 10: 2.6-a Simplification Theorems :Uniting and Absorption Theorems

Lecture 11: 2.6-b Simplification Theorems :Eliminations and Consensus Theorems

Lecture 12: Example 1 —-> Boolean algebra Theorems

Lecture 13: Example 2 —-> Boolean algebra Theorems

Lecture 14: 2.7 Multipling out and Factroing (POS , SOP)

Lecture 15: Example 1 —> SOP , POS

Lecture 16: 2.8 Complementing Boolean Expressions

Lecture 17: Example 1 —> Simplification theorems.

Lecture 18: Example 2 —> Simplification theorems.

Lecture 19: Example 3 —> Simplification theorems.

Lecture 20: Quiz 6 Solution

Chapter 5: Unit 3 : Extension of Boolean Algebra theorems

Lecture 1: the Objectives of this section

Lecture 2: 3.1 Example 1 —> Multiplying out and Factoring

Lecture 3: Example 2 —> Multiplying out and Factoring

Lecture 4: 3.2-a Exclusive-OR (XOR) and equivalence Operations

Lecture 5: 3.2-b XNOR Gate and Example 1

Lecture 6: Example 2 —> XOR Gate

Lecture 7: 3.3 The Consensus Theorem

Lecture 8: Example 1 —> Consensus Theorem

Lecture 9: Example 2 —> Consensus Theorem

Lecture 10: Example 3 —> Consensus Theorem

Lecture 11: Example 4 —> Consensus Theorem

Lecture 12: Quiz 7 Solution

Lecture 13: 3.4 Algebraic Simplification of switching Expressions

Lecture 14: Example 1 —-> Algebraic Simplification

Lecture 15: Example 2 —-> Algebraic Simplification

Lecture 16: Example 3 —-> Algebraic Simplification

Lecture 17: Example 4 —-> Algebraic Simplification

Lecture 18: Example 5 —-> Algebraic Simplification

Lecture 19: Example 6 —-> Algebraic Simplification

Lecture 20: 3.5 Proving Validity of Equations

Lecture 21: Example 1 —> Proving Validity of Equations

Lecture 22: Example 2 —> Proving Validity of Equations

Lecture 23: Example 3 —> Proving Validity of Equations

Lecture 24: Quiz 8 Solution

Chapter 6: Miniterms and Maxterms

Lecture 1: Section Objectives

Lecture 2: 4.1 Conversion of English sentences to Boolean Equations

Lecture 3: Example –> Conversion of English sentences to Boolean Equations

Lecture 4: Quiz 9 Solution

Lecture 5: 4.2 Combinational Logic Design Using a Truth Table

Lecture 6: 7.3 Minterm and Maxterm Expansions