Full Course in Fundamentals of logic design

Full Course in Fundamentals of logic design - Druckversion

+- Forum Rockoldies (https://rockoldies.net/forum)
+-- Forum: Fotobearbeitung - Photoshop (https://rockoldies.net/forum/forumdisplay.php?fid=16)
+--- Forum: E-Learning, Tutorials (https://rockoldies.net/forum/forumdisplay.php?fid=18)
+--- Thema: Full Course in Fundamentals of logic design (/showthread.php?tid=45988)

Full Course in Fundamentals of logic design - Panter - 17.02.2022

[Bild: gnchipgt8s61j1ftdcbs44vjcw.jpg]

Full Course in Fundamentals of logic design
MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHz
Language: English | Size: 11.2 GB | Duration: 20h 7m

Digital Logic Design

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

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

Show Content

Download from RapidGator

Download from Rapidgator:

Show Content

Download from Keep2Share

Show Content