Complete BOOLEAN ALGEBRA & LOGIC GATES Guide For Beginners
4.3 (20 ratings)
585 students enrolled
Wishlisted Wishlist

Please confirm that you want to add Complete BOOLEAN ALGEBRA & LOGIC GATES Guide For Beginners to your Wishlist.

# Complete BOOLEAN ALGEBRA & LOGIC GATES Guide For Beginners

Experience a new way of learning by practically applying the logics
4.3 (20 ratings)
585 students enrolled
Created by Dishu Priya
Last updated 8/2015
English
Price: \$125
30-Day Money-Back Guarantee
Includes:
• 1 hour on-demand video
• Access on mobile and TV
• Certificate of Completion
What Will I 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.
View Curriculum
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 is the target audience?
• 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.
Compare to Other Algebra Courses
Curriculum For This Course
23 Lectures
01:01:50
+
The topics covered in the whole tutorial.
1 Lecture 00:54
Preview 00:54
+
Boolean Algebra And Laws of Boolean Algebra
13 Lectures 44:32
Preview 02:54

Preview 05:31

Preview 00:25

Preview 05:58

Absorption Law.
06:27

Identity Law.
02:04

Complement Law.
01:41

Idempotent Law.
01:40

Involution Law.
01:01

Distributive Law.
03:44

The DeMorgan's Theorem.
04:48

Duality Principle.
01:12

Simplification of Boolean Expressions using Boolean Laws.
07:07
+
Logic Gates And Its Simplification
9 Lectures 16:24
Logic Gates.
00:47

AND Gate.
01:15

OR Gate.
01:26

NOT Gate.
01:16

NOR Gate.
02:14

NAND Gate.
02:08

XOR Gate.
01:31

XNOR Gate.
02:04

Logic Gates Simplification.
03:43