Complete BOOLEAN ALGEBRA & LOGIC GATES Guide For Beginners

Name: Complete BOOLEAN ALGEBRA & LOGIC GATES Guide For Beginners
Rating: 4.0 (95 reviews)

Experience a new way of learning by practically applying the logics

Created byDishu Priya

Last updated 11/2015

English

English [Auto],

What you'll learn

Over 22 lectures and 1 hour of content.
At the end of this course students will have a complete understanding of Boolean Laws and how they can be useful in simplification of complex Boolean expressions.
The main purpose of this course is to make students completely familiar and comfortable with complex Boolean Algebra rules and make them a perfectionist in their application in digital electronics.
Students will learn to practically apply the Boolean laws and simplification of Logic gates.
This course will be a treat to the eyes and mind of everyone who takes this course.
While making this course my main aim was to give my students an edge over those people who didn't get the opportunity to get to know about this course and get this level of understanding.

Course content

3 sections • 23 lectures • 1h 1m total length

Introduction0:54

Commutative Law.2:54
Demonstrate how the commutative law works in Boolean algebra by showing A OR B = B OR A and A AND B = B AND A, with truth tables.
Boolean Algebra Introduction.5:31
introduces boolean algebra concepts using two variables a and b, covering or, and, and not operations, truth tables, and how 0 and 1 inputs yield outputs.
Laws of Boolean Algebra.0:25
Explore the laws of boolean algebra, including commutative, associative, distributive, absorption, identity, complement, duality principle, idempotent, and inclusion laws.
Associative Law.5:58
Explore the associative law in boolean algebra, proving (A+B)+C = A+(B+C) and (AB)C = A(BC) with truth-table demonstrations for A, B, and C.
Absorption Law.6:27
Explain the absorption law in Boolean algebra, detailing a + AB' = a, a + a'B = a + B, and a a'B = aB, with truth-table proofs.
Identity Law.2:04
Explore the identity law in boolean algebra and logic gates for beginners, showing how 0 and 1 interact with or and and operations, and build a one-variable truth table.
Complement Law.1:41
Explore the complement law in boolean algebra, showing that A and not A equals 0 and A or not A equals 1 using truth tables for a single variable.
Idempotent Law.1:40
Learn the idempotent law, also known as the redundancy law, in boolean algebra. Prove that A + A = A and A · A = A with simple truth tables.
Involution Law.1:01
Explain the involution law: the dual complement of a variable equals the variable itself. Show that the complement of a bar returns the original.
Distributive Law.3:44
Demonstrate the distributive law in boolean algebra by comparing AB + AC with A(B+C) using truth tables for three variables, showing both sides yield the same results.
The DeMorgan's Theorem.4:48
Explore De Morgan's theorem in boolean algebra, showing that a product's complement equals the sum of complements and a sum's complement equals the product of complements, with truth-table verification.
Duality Principle.1:12
Explore the duality principle in boolean algebra and see how postulate-based expressions remain valid under duality, illustrated by swapping 0 and 1 in 1 + 0 = 1.
Simplification of Boolean Expressions using Boolean Laws.7:07
Learn to simplify boolean expressions using fundamental boolean laws, including distributive, complement, absorption, redundancy (idempotent), and Morgan's theorem, with connections to logic gates.

Logic Gates.0:47
Explore logic gates as the basic building blocks of digital systems, showing how multi-input, single-output circuits operate under specific logic. Learn about and, or, not, nand, nor, and xor gates.
AND Gate.1:15
OR Gate.1:26
Explore how an or gate, a two-input circuit, uses the plus operation to produce outputs as shown in the logic diagram for input combinations of zeros and ones.
NOT Gate.1:16
Learn how the not gate negates a single input, producing y = a bar, with a simple truth table showing 0 maps to 1 and 1 maps to 0.
NOR Gate.2:14
Explore the nor gate and not operation by placing a not in front of an or gate to produce Y = (A + B)′ and study its 00–11 truth table.
NAND Gate.2:08
Explore the nand gate, how an and gate followed by a not creates it, and review two diagrams including a bubble, plus the 0/1 input combinations.
XOR Gate.1:31
Explore the xor gate, an exclusive or with inputs a and b. The output y equals a b' + a' b, shown in its truth table: 00→0, 01→1, 10→1, 11→0.
XNOR Gate.2:04
Learn how the xnor gate works with two inputs A and B, yielding y = a' b' + ab, explained via truth table and logic diagrams.
Logic Gates Simplification.3:43
learn how to simplify logic gates by deriving a boolean expression from a circuit, convert it to a logic diagram, and realize y = a' + bc using and/or gates.

Requirements

Students don't need to have any pre-requisites for taking this course. This course just need your time and patience and the enthusiasm to learn something new.

Description

Boolean Algebra is a very important topic and is easy to understand and apply. It is different from elementary algebra.

In this course students will first understand what Boolean Algebra is all about. Next they will learn about the various Laws and important Theorems (Commutative Law, Assocative Law, Absorption Law, Indentity Law, Complement Law, Idempotent law, Involution Law, Distributive Law, The De-Morgan's Theorem and finally Duality Principle) associated with Boolean Algebra. At the end of this section there is a Live Practice lecture where I have taken up some very good examples to explain how we can apply the different Boolean Laws and Theorems we have learnt to simplify and solve complex Boolean expressions. The main aim is to make you a perfectionist in all the aspects of Boolean Laws, be it their understanding or their application.

In the very next section students will get a very deep and detailed understanding of different types of Logic Gates (AND gate, OR gate, NOT gate, NOR gate, NAND gate, XOR gate and the last one XNOR gate). This section will cover everything one needs to know on Logic Gates. In the last lecture I have taken some examples to explain how one can derive the Boolean Expressions from a give Logic gate diagram and finally simply that complex expression using the Boolean Laws we learnt in the first section.

Overall this is going to be a very exciting course and it is going to be a great fun for my students.

I wish them all the best and look forward for their reviews and discussions.

Who this course is for:

Students studying computer science at A level or university are often required to study logic circuits and Boolean Algebra.
Students who have no preexisting knowledge of Boolean Algebra.
Students who have some knowledge of Boolean Algebra and wish to reinforce and extend their existing knowledge.
Students who have knowledge of Boolean Algebra and want to learn the application of this knowledge in simplification of Boolean expressions.

Complete BOOLEAN ALGEBRA & LOGIC GATES Guide For Beginners

What you'll learn

Explore related topics

Course content

The topics covered in the whole tutorial.1 lecture • 1min

Boolean Algebra And Laws of Boolean Algebra13 lectures • 45min

Logic Gates And Its Simplification9 lectures • 16min

Requirements

Description

Who this course is for: