Lesson 1 of 49 • 178 upvotes • 9:07mins
In this course we will cover Digital Electronics important Topic related to Boolean Algebra and Boolean expression for ugc net computer science and GATE computer science
49 lessons • 5h 43m
Boolean Operations and Expressions (in Hindi)
9:07mins
Laws of Boolean Algebra (in Hindi)
10:03mins
De Morgan's Theorem (in Hindi)
8:28mins
Standard Forms of Boolean Expressions (in Hindi)
8:26mins
K Map 2, 3, 4 Variables (in Hindi)
8:17mins
Solve the logic expression (in Hindi )
8:03mins
Boolean expression of gate diagram (in Hindi)
7:07mins
Boolean expression of logic circuits of NOR gates (in Hindi)
8:39mins
Exclusive NOR of x and y (in Hindi)
7:24mins
Minimal SOP (in Hindi )
7:05mins
Find true statement easily (in Hindi)
7:00mins
Minimum number of NOR gates required (in Hindi)
6:13mins
Output of gate is HIGH (in Hindi)
3:31mins
Find the truth table value (in Hindi )
8:17mins
Simplified SOP (in Hindi)
8:23mins
The minterm expansion of f(P, Q, R)(in Hindi)
8:03mins
Given f1, f3 and f in canonical sum of products form for the circuit (in Hindi )
8:21mins
Select the Boolean expression that is not equivalent to x·x+x·x' (in Hindi )
8:09mins
Half-subtractor the correct set of logical outputs (in Hindi )
8:06mins
Output of Combinational circuit (in Hindi)
8:26mins
Dual of Ex Or (in Hindi)
6:06mins
The equivalent term of xOR gate (in Hindi )
8:01mins
Find false value in XOR operations (in Hindi )
6:42mins
(P + Q’)(PQ’ + PR)(P’R’ + Q’) simplifies (in Hindi)
8:02mins
Simplify ⊕ the Exclusive OR (XOR) operation (in Hindi)
8:18mins
W, x, y, z are boolean variables, find INCORRECT(in Hindi)
6:52mins
Let ⊕ and ⊙ denote the Exclusive OR and Exclusive NOR operations,(in Hindi)
8:03mins
The simultaneous equations on Boolean variables given find values of variables (in Hindi)
8:05mins
Which is true if x1⊕x2⊕x3⊕x4 = 0 (in Hindi)
8:03mins
Which of the following expressions is equivalent to (A⊕B)⊕C (in Hindi)
8:27mins
The connective * for the Boolean variables X and Y (in Hindi)’
8:13mins
The number of full and half-adders required to add 16-bit numbers (in Hindi)
8:04mins
Let f(A,B)=A′+B Simplified expression for function f(f(x+y,y),z) ? (In Hindi)
7:15mins
Let * be defined as x*y= x'+y. Let z = x*y. Value of z*x is ( in Hindi)
6:11mins
When simplified with Boolean Algebra (x + y)(x + z) simplifies to (in Hindi )
6:38mins
How many AND gates are required to realize Y = CD+EF+G (in Hindi)
7:51mins
The output of a logic gate is 1 when all its inputs are at logic 0 (in Hindi)
4:30mins
Which of the following digital logic blocks suitable for implementing code( in Hindi)
5:01mins
Boolean Functions (Expressions)( in Hindi )
3:34mins
The number of distinct Boolean expressions of 4 variables is (in Hindi )
3:36mins
Boolean Functions of Two Variables( in Hindi )
4:34mins
Operator precedence (in Hindi )
5:05mins
Which expression is not NOR( in Hindi )
5:15mins
Find contradiction( in Hindi )
6:07mins
Solve expression easily( in Hindi )
5:14mins
DeMorgan’s Law the simplified form of Expression( in Hindi )
5:10mins
Simplify F (A,B,C)=Σ (0, 2, 4, 5, 6) Result would be? (In Hindi )
6:14mins
What is the value of the postfix expression ( in Hindi )
5:27mins
Involution law (in Hindi )
5:07mins