Udemy
    •  
    •  
    •  
    •  
    •  
    •  
    •  
    •  
Turn what you know into an opportunity and reach millions around the world.
Learn More
Your cart is empty.
Keep shopping
Full Course in Fundamentals of logic design
Rating: 4.4 out of 5(75 ratings)
488 students

Full Course in Fundamentals of logic design

Digital Logic Design
Created byMoe Alqarain
Last updated 9/2020
English

What you'll learn

  • Number System and conversion
  • Boolean Algebra
  • Applications of Boolean Algebra Miniterm and Maxterm Expansions
  • Karnaugh Maps
  • Multi-Level Gate Circuits NAND and NOR Gates

Course content

10 sections150 lectures20h 7m total length
  • Introduction3:47

    In this course :

    1- after watching section 1, students will be introduced to Different numerical systems such as Binary ,Decimal ,Octal ,Hexadecimal ,etc. . also students will learn how to convert from a base to another.

    2-after watching section 2, students would be able to Add/Subtract/Multiply and Divide Unsigned numbers.

    3- after studying  section 3, Students would be able to Add/Subtract Signed numbers

    4- After finishing  Section 4, Students will learn the Basic Gates ( AND , OR , Inverter ) and be able to use the Theorems of Boolean algebra .

    5- when completing  section 5, Students should know from memory and be able to use any of the laws and theorems of Boolean algebra studied in section 4 by doing lots of problems.

    6- after finishing  section 6 , Students would be able to find the Miniterm (SOP) and a Maxterm (POS) of any expression or circuit for F and F' , and they will be introduced to the Don't Care term.

    7- After studying  section 7, Students will be able to add and subtract numbers using half and full adders , they will also be able to design them.

    8- After watching section 8, Students would be able to use a k-map to obtain the most simplified form of any expression including 2,3,4 and 5 variables.

    9- After watching section 9, Students will learn about the Universal gates (NAND and NOR ) and how to use them to represent any gate to design a two and multi level circuits

Requirements

  • this is the first course in the logic design of digital systems
  • no prerequisites are needed to start this course with

Description

1- Number systems and Conversion

1.1 Digital Systems and Switching Circuits

1.2 Number Systems and Conversion

1.3 Binary Arithmetic

1.4 Representation of Negative Numbers using

a- sign and Magnitude Numbers

b- 2's Complement Numbers

c- 1's Compliment Numbers

and all the above addition

1.5 Binary Codes


2- Boolean Algebra

2.1 Introduction

2.2 Basic Operations

2.3 Boolean Expressions and Truth Tables

2.4 Basic Theorems

2.5 Commutative, Associative, Distributive, and DeMorgan's Laws

2.6 Simplification Theorems

2.7 Multiplying Out and Factoring

2.8 Complementing Boolean Expression


3-Boolean Algebra Theorems

3.1 Multiplying Out and Factoring Expression

3.2 Exclusive-OR and Equivalence Operations

3.3 The Consensus Theorem

3.4 Algebraic Simplification of Switching Expressions

3.5 Proving Validity and Equation


4- Applications of Boolean Algebra Minterm and Maxterm Expansions

4.1 Conversion of English Sentences to Boolean Equations

4.2 Combinational Logic Design Using a Truth Table

4.3 Minterm and Maxterm Expansions

4.4 General Minterm and Maxterm Functions

4.5 Incompletely Specified Functions

4.6 Examples of Truth Table Construction

4.7 Design of Binary Adders and Subtracters


5- Karnaugh Maps

5.1 Minimum Forms of Switching Functions

5.2 Two- and Three- Variable Karnaugh Maps

5.3 Four-Variable Karnaugh Maps

5.4 Determination of Minimum Expressions Using Essential Prime Implicant

5.5 five-Variable Karnaugh Maps

5.6 Other Uses of Karnaugh Maps

5.7 Other Forms of Karnaugh Maps


7-Multi-Level Gate Circuits NAND and NOR Gates.

7.1 Multi-Level Gate Circuits.

7.2 NAND and NOR Gates.

7.3 Design of Two-Level NAND- and NOR-Gate Circuits

7.4 Design of Multi-Level NAND- and NOR-Gate Circuits

7.5 Circuit Conversion Using Alternative Gate Symbols

7.6 Design of Two-Level, Multiple-Output Circuits


Who this course is for:

  • Beginners in Computers who would like to understand the logic of computers language
  • anyone who would like to learn the fundamental concepts of Boolean algebra to describe the signals and interconnections in a logic circuit