🌟 MCA Gold Medalist 🌟 Star Educator 🌟Gate Qualified 🔴UGC NET qualified🌟BOOK published on LINUX ADMINISTRATION by kalyani publish

Nisha Mittal

In this course Nisha Mittal will teach you all important concepts related to Boolean Algebra for NTA NET computer science, KVS PGT aspirants, and HTET .  Also here you will get previous year Question with solutions of UGC NET computer science.

Prepare for UGC NET 2019 by watching our free online lessons covering UGC Net syllabus and also helping you solve Previous year question papers. Pursue your dream of JRF.

NTA-UGC-NET & SET Exams

Hindi

(Hindi) Boolean Algebra and Logic Simplification: NTA-UGC NET

Digital Logic Circuits

Computer System Architecture

Computer Science & Application

NET Exams

Ace the toughest competitive and government exams in India 

Test Preparation

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

Boolean Operations and Expressions (in Hindi)

In this lesson we will cover laws of Boolean Algebra in detail for NTA NET computer science, KVS PGT aspirants, HTET exams

Laws of Boolean Algebra (in Hindi)

In this lesson we will learn about de Morgan's theorem in detail . This theorem is very important in Boolean Algebra , as this is applied to minimize any given expression in exams like NTA NET computer science, KVS PGT, GATE computer science, HTET

De Morgan's Theorem (in Hindi)

In this lesson Nisha Mittal will teach you about sum of products (minterms) and product of sums (maxterms ) in detail for NTA NET computer science, KVS PGT, GATE computer science, HTET exams

Standard Forms of Boolean Expressions (in Hindi)

In this lesson Nisha Mittal will teach you about k map in detail for NTA NET computer science, KVS PGT aspirants, GATE computer science

K Map 2, 3, 4 Variables (in Hindi)

Learn to solve Boolean expression easily .

Solve the logic expression (in Hindi )

Learn How to solve gate diagram to find out Boolean expression easily

Boolean expression of gate diagram (in Hindi)

Learn to solve and find out Boolean expression by using many NOR gates

Boolean expression of logic circuits of NOR gates (in Hindi)

Which one  of  the  following expressions does NOT represent exclusive  NOR of  x  and y? (A)  xy+x’y’ (B)  x⊕y’ (C)  x’⊕y (D)  x’⊕y’ 

Exclusive NOR and exclusive OR terms in detail

Exclusive NOR of x and y (in Hindi)

Consider  the  following  Boolean expression  for  F: F(P,  Q,  R,  S) =  PQ  +  P'QR  +  P'QR'S The  minimal  sum-of-products  form  of  F is (A)  PQ  +  QR  +  QS (B)  P  +  Q  +  R  +  S (C)  P’  +  Q’  +  R’  +  S’ (D)  P’R  +  P’R’S  +  P 

Learn to find minimal SOP form easily by using Boolean laws.

Minimal SOP (in Hindi )

Which one  of  the  following expressions does NOT represent exclusive  NOR of  x  and y? (A)  xy+x’y’ (B)  x⊕y’ (C)  x’⊕y (D)  x’⊕y’ 

Solve a given expression to show commutative and associative law

Find true statement easily (in Hindi)

What  is  the  Boolean  expression for  the  output  f  of  the  combinational  logic  circuit of NOR gates  given  below? (A)  (Q+R)’ (B)  (P+Q)’ (C)  (P+R) (D)  (P+Q+R)’ 

Learn to find out minimum number of NOR gates for NTA NET computer science, KVS PGT COMPUTER SCIENCE, GATE computer science

Minimum number of NOR gates required (in Hindi)

When will be the output of an AND gate is HIGH if there are three inputs, A, B, and C ? 1. A = 0, B = 0, C = 0 2.A = 1, B = 1, C = 0 3.A = 1, B = 0, C = 1 4.A = 1, B = 1, C = 1  

Learn to find out Output of AND gate will be high at what values

Output of gate is HIGH (in Hindi)

Which  logic  gate has  the  following  truth  table? 1. An exclusive  NOR  gate   2. A  two-input  OR  gate   3. An exclusive  OR  gate   4. A  two-input  AND  gate 
Learn to solve exclusive OR and exclusive NOR gate truth table values easily for NTA NET computer science, PGT COMPUTER SCIENCE

Find the truth table value (in Hindi )

The  simplified  SOP  (Sum  Of Product)  form of the  boolean  expression (P  +  Q’  +  R’)  . (P  + Q’  + R)  . (P  + Q  +  R’)  is (A)  (P’.Q  + R’) (B)  (P  + Q’.R’) (C)  (P’.Q  +  R) (D)  (P.Q  + R) 

Simplified SOP form from POS for GATE computer science, KVS PGT COMPUTER SCIENCE, NTA NET computer science

Simplified SOP (in Hindi)

The minterm expansion of f(P, Q, R) = PQ + QR’ + PR’ is 
(A) m2 + m4 + m6 + m7 
(B) m0 + m1 + m3 + m5 
(C) m0 + m1 + m6 + m7 
(D) m2 + m3 + m4 + m5

The minterm expansion of f(P, Q, R)(in Hindi)

Given f1, f3 and f in canonical sum of products form for the circuit (in Hindi )

1.Select  the  Boolean  expression  that is not  equivalent  to  x·x+x·x'   (a) x  ·  (x  +  x'  )   (b) (x  +  x'  )  · x   (c)   x'   (d)   x   


2.Select  the  expression  which  is equivalent  to  x  · y  +  x  ·  y  ·  z   (a) x  ·  y   (b) x  ·  z   (c) y  ·  z   (d)   x  ·  y  ·  z

Select the Boolean expression that is not equivalent to x·x+x·x' (in Hindi )

For  a  binary half-subtractor  having two inputs  A  and  B,  the  correct  set of logical  outputs  D(=A  minus  B) and  X(=borrow)  are 
1.D=AB+A'B,X=A'B 
2.D=A'B+AB',X=AB' 
3.D=A'B+AB',X=A'B 
4.D=AB+A'B,X=AB'

Half-subtractor the correct set of logical outputs (in Hindi )

Output of Combinational circuit (in Hindi)

Dual  of  EX-OR  is equal  to   (A)  NAND   (B)  NOR   (C)  EX-NOR   (D)  None  of  these

Dual of Ex Or (in Hindi)

The  output  of  the  combinational  circuit given  below  is

The equivalent term of xOR gate (in Hindi )

If A⊕B=C, then: (A)  A⊕C=B                    (B)  B⊕C=A (C)  A⊕B⊕C=1              (D)  A⊕B⊕C=0 Which options are false?

Find false value in XOR operations (in Hindi )

(P + Q’)(PQ’ + PR)(P’R’ + Q’) simplifies (in Hindi)

Simplify ⊕ the Exclusive OR (XOR) operation (in Hindi)

W, x, y, z are boolean variables, find INCORRECT(in Hindi)

Let ⊕ and ⊙ denote the Exclusive OR and Exclusive NOR operations,(in Hindi)

The  simultaneous  equations  on the Boolean  variables x, y,  z and w,   x+y+z=1 xy=0 xz+w=1 xy+z'w'=0 have  the following solution for x,  y,  z and w, respectively:   
A. 0  1  0  0   
B.   1  1  0  1   
C.   1  0  1  1   
D.   1  0  0  0

The simultaneous equations on Boolean variables given find values of variables (in Hindi)

Let 
x1⊕x2⊕x3⊕x4  = 0  where  x1,  x2,  x3,  x4  are Boolean  variables,  and  ⊕  is the XOR  operator. Which  one  of  the  following  must always be TRUE? 
(A)  x1x2x3x4  = 0 
(B)  x1x3+x2  = 0 
(C)  x′1⊕x′3=x′2⊕x′4 
(D)  x1+x2+x3+x4  = 0

Which is true if x1⊕x2⊕x3⊕x4 = 0 (in Hindi)

Which  of  the  following  expressions  is  equivalent to  (A⊕B)⊕C 
1.(A+B+C)(A'+B'+C') 
2.(A+B+C)(A'+B'+C) 
3.ABC+A'(B⊕C)+B'(A⊕C) 
4. None

Which of the following expressions is equivalent to (A⊕B)⊕C (in Hindi)

Define  the  connective *  for  the Boolean variables  X and Y  as: X  * Y = XY  + X’  Y’. Let Z = X  * Y. Consider  the following  expressions  P,  Q and  R.  P: X = Y*Z  Q: Y =  X*Z  R:  X*Y*Z=1 Which  of  the  following  is  TRUE?
 (A)  Only  P and  Q are  valid
 (B)  Only  Q and  R are valid.
 (C)  Only  P and  R  are valid.
 (D)  All  P,  Q, R are valid.

The connective * for the Boolean variables X and Y (in Hindi)’

How many half adder and full adders required to add 16 bit numbers ?

The number of full and half-adders required to add 16-bit numbers (in Hindi)

Let f(A,B)=A′+B Simplified expression for function f(f(x+y,y),z) ? (In Hindi)

Let * be defined as x*y= x'+y. Let z = x*y. Value of z*x is ( in Hindi)

Simplyfy Boolean algebra for NTA NET computer science

When simplified with Boolean Algebra (x + y)(x + z) simplifies to (in Hindi )

Study material for NTA NET computer science examination.

How many AND gates are required to realize Y = CD+EF+G (in Hindi)

The output of a logic gate is 1 when all its inputs are at logic 0 (in Hindi)

Which of the following digital logic blocks suitable for implementing code( in Hindi)

Boolean Functions (Expressions)( in Hindi )

UGC NET computer science examination preparation easily

The number of distinct Boolean expressions of 4 variables is (in Hindi )

Boolean Functions of Two Variables( in Hindi )

Operator precedence (in Hindi )

Which expression is not NOR( in Hindi )

Find contradiction( in Hindi )

Solve expression easily( in Hindi )

DeMorgan’s Law the simplified form of Expression( in Hindi )

Simplify F (A,B,C)=Σ (0, 2, 4, 5, 6) Result would be? (In Hindi )

What is the value of the postfix expression ( in Hindi )

Involution law (in Hindi )

In this course we will cover all topics related to Flip Flops, types of flip flops in detail for UGC NET computer science. so follow the lessons in a sequential manner for better understanding.

(Hindi) Flip Flops Digital Electronics - UGC NET Computer Science

In this course we 'll cover all topics related to Registers and it's types in an easy language . Register is the most important topic from examination point of view for NTA NET computer science studnets. Register is group of N Flip Flops cascaded together to store N bit data . For more easy detail Follow these lessons in a sequence way .

(Hindi) Registers and it's types - NTA UGC NET Computer Science

This course will cover all important topics for UGC NET computer science related to Counters ( digital electronics ).Also we are going to cover previous year questions  related to this topic.

(Hindi) Counters And It's Types -NTA UGC NET Computer Science

In this course Nisha Mittal will cover Multiplexer Topic with Previous Year Questions for NTA NET computer science

(Hindi) Multiplexer Topic With Previous Year Questions for NTA NET Computer Science

In this course Nisha Mittal will provide solutions of questions of kmap . And will teach you how to solve these questions easily and quicky

(Hindi ) All About K Map for NTA NET Computer Science

In this course, Nisha Mittal will teach you the conversion from one number system to another number system in an easy manner .This course is very useful for NTA NET computer science, KVS PGT aspirants, GATE Aspirants.

Lessons

50 lessons • 4h 37m

Invalid Date

NaN

Boolean Operations and Expressions (in Hindi)

Invalid Date

NaN

Laws of Boolean Algebra (in Hindi)

Invalid Date

NaN

De Morgan's Theorem (in Hindi)

Invalid Date

NaN

Standard Forms of Boolean Expressions (in Hindi)

Invalid Date

NaN

K Map 2, 3, 4 Variables (in Hindi)

Invalid Date

NaN

Solve the logic expression (in Hindi )

Invalid Date

NaN

Boolean expression of gate diagram (in Hindi)

Invalid Date

NaN

Boolean expression of logic circuits of NOR gates (in Hindi)

Invalid Date

NaN

Exclusive NOR of x and y (in Hindi)

Invalid Date

NaN

Minimal SOP (in Hindi )

+ See all lessons