# Logic Gates And Boolean Algebra in Digital Electronics

Digital Circuit & Design

What you’ll learn

• Here in this course you will learn what is logic gates and what are its sub categories..
• Here you will study each individual logic gates along with its working properties as well as internal integrated circuit structures for each gates.
• With the help of an example it has been illustrated about the requirement of boolean algebra in digital systems.
• Also all the rules and laws such as demorgan’s theorems, associative, distributive, commutative, anding and oring concepts has been proved and well explained.
• You will come to know that why nand as well as nor logic gates are called universal logic gates.
• Last but not the least you will also learn how to solve any logical circuit questions as well as how to reduce or simplify a given boolean algebraic expression.

Course Content

• Introduction –> 4 lectures • 9min.
• Fundamental logic gates –> 3 lectures • 11min.
• Universal logic gates –> 2 lectures • 8min.
• Derived logic gates –> 2 lectures • 6min.
• Demorgan theorems –> 2 lectures • 10min.
• Universality of nand gate –> 3 lectures • 8min.
• Universality of nor logic gate –> 3 lectures • 6min.
• Solving logical circuits –> 2 lectures • 8min.
• Boolean algebra in digital electronics –> 3 lectures • 9min.
• Boolean postulates –> 4 lectures • 11min.
• Duality Principle –> 1 lecture • 4min.
• Law of Complement –> 1 lecture • 4min.
• Solving boolean equations –> 2 lectures • 4min.

Requirements

• You will learn everything you need to know . No Prior knowledge is required..

Hello ,

My name is Riya Pal. I am Electronics Engineer by profession.

1) I have more than eight years of experience in the field of :

Thermal management.

Power electronics.

Heat sink designing .

Computer Architecture & Programming language.

And

2) Published 9 research papers at international level.

3) Currently, I teach Power Electronics.

4) Apart from this , I also handle projects for students and does seminars on Power Electronics .

All of us are familiar with the impact of modern digital computers , communication systems , digital display units , internet , emails etc .One of the main cause of this revolution is the advent of integrated circuits which became possible because of the tremendous progress in digital as well as in analog electronics field . The operation of digital computers , communication systems , digital display units , internet , emails that has become the integral part of our daily life is based on the principal of digital techniques and these systems are referred to as digital systems .

The basic building block or units of digital systems are the various logic gates that you are going to study in this course.

This course is for both computer science engineering students as well as for electronics Students . Below are the contents that is included under logic gates session.

Digital terminologies (what is input , output , what is a system , how to form input combinations for a system , formula , timing waveform)

You will also study about positive logic representation & negative logic representation .

Three classification of logic gates : Basic , Universal & Derived Logic Gates .

Basic logic gates : not / and / or .

Universal logic gates : nand / nor .

Derived logic gates : exor / exnor .

In this course , Demorgan’s first and second theorem has also been explained in complete detail .

Boolean algebra is that branch of algebra in which the values of the variables are either true or false, usually denoted by zero and one respectively. Instead of elementary algebra, where the values of the variables are numbers and the prime operations are addition and multiplication, the main operations of boolean algebra are the conjunction (and) , the disjunction (or) , and the negation (not). It is thus a formalism for describing logical operations, in the same way that elementary algebra describes numerical operations. Boolean algebra was introduced by George Boole in his first book The Mathematical Analysis of Logic. In boolean algebra there exist various postulates /laws such as identity , idempotent , null , inverse , commutative , associative , distributive , principle of duality , the law of complement and also demorgan’s theorems . All these you will study in depth in this course.

Boolean algebra, deals with zero, one and set of logic gates that operates upon binary numbers. With the knowledge of boolean algebra we can design an interconnection of logic gates which can give desired outputs for given inputs. This is the way adder, multipliers etc are made. Once we develop design we can implement it using transistors and embed it inside.

Get Tutorial