NCERT Solutions for Class 12 Computer And Communication Technology Computer Science With Python Chapter 11 Boolean Algebra

Boolean Algebra Here is the CBSE Computer And Communication Technology Chapter 11 for Class 12 students. Summary and detailed explanation of the lesson, including the definitions of difficult words. All of the exercises and questions and answers from the lesson's back end have been completed. NCERT Solutions for Class 12 Computer And Communication Technology Boolean Algebra Chapter 11 NCERT Solutions for Class 12 Computer And Communication Technology Boolean Algebra Chapter 11 The following is a summary in Hindi and English for the academic year

A PHP Error was encountered

Severity: Notice

Message: Undefined variable: current_year

Filename: ncert_suluctions/Chapter_Question.php

Line Number: 246

Backtrace:

File: /home/wiredfa1/public_html/application/views/final/ncert_suluctions/Chapter_Question.php
Line: 246
Function: _error_handler

File: /home/wiredfa1/public_html/application/controllers/Ncert_Solutions.php
Line: 250
Function: view

File: /home/wiredfa1/public_html/index.php
Line: 315
Function: require_once

Question 1

Wired Faculty App

State Distributive Laws of Boolean Algebra and verify them using truth table.

(i) X. (Y+Z)= X.Y + X.Z
(ii) X + Y.Z= (X + Y). (X+Z)

Solution

(i)

X	Y	Z	Y+Z	X.(Y+Z)	X.Y	X.Z	X.Y+X.Z
0	0	0	0	0	0	0	0
0	0	1	1	0	0	0	0
0	1	0	1	0	0	0	0
0	1	1	1	0	0	0	0
1	0	0	0	0	0	0	0
1	0	1	1	1	0	1	1
1	1	0	1	1	1	0	1
1	1	1	1	1	1	1	1

(ii)

X	Y	Z	Y.Z	X+Y.Z	(X+Y)	(X+Z)	(X+Y).(X+Z)
0	0	0	0	0	0	0	0
0	0	1	0	0	0	1	0
0	1	0	0	0	1	0	0
0	1	1	1	1	1	1	1
1	0	0	0	1	1	1	1
1	0	1	0	1	1	1	1
1	1	0	0	1	1	1	1
1	1	1	1	1	1	1	1

Sponsor Area

For Daily Free Study Material Join wiredfaculty

WhatsApp Group

Download Android App

Ncert Book Download

NCERT Solutions for Class 12 Computer And Communication Technology Computer Science With Python Chapter 11 Boolean Algebra

A PHP Error was encountered

State Distributive Laws of Boolean Algebra and verify them using truth table.

(i) X. (Y+Z)= X.Y + X.Z
(ii) X + Y.Z= (X + Y). (X+Z)

Draw the Logic Circuit of the following Boolean Expression using only NAND Gates:
X.Y + Y.Z

Derive a Canonical SOP expression for a Boolean function F, represented by the following truth table:

U V W F(U,V,W)
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 0

Reduce the following Boolean Expression to its simplest form using K-Map:
F(X,Y,Z,W)= Σ (0,1,2,3,4,5,10,11,14)

State DeMorgan’s Laws of Boolean Algebra and verify them using truth table.

Draw the Logic Circuit of the following Boolean Expression using only NOR Gates:
( A+B).(C+D)

Derive a Canonical POS expression for a Boolean function G, represented by the following truth table:

X Y X G(X,Y,Z)
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1

Reduce the following Boolean expression to its simplest form using K-Map:
E(U,V,Z,W)= Σ (2,3,6,8,9,10,11,12,13)

Verify the following using Boolean Laws.
A’+ B’.C = A’.B’.C’+ A’.B.C’+ A’.B.C + A’.B’.C+ A.B’.C

Write the Boolean Expression for the result of the Logic Circuit as shown below:

Mock Test Series

NCERT Sample Papers

Entrance Exams Preparation

Phone Number

Email Address

Location

For Daily Free Study Material Join wiredfaculty

WhatsApp Group

Download Android App

Ncert Book Download

NCERT Solutions for Class 12 Computer And Communication Technology Computer Science With Python Chapter 11 Boolean Algebra

A PHP Error was encountered

State Distributive Laws of Boolean Algebra and verify them using truth table.(i) X. (Y+Z)= X.Y + X.Z (ii) X + Y.Z= (X + Y). (X+Z)

Draw the Logic Circuit of the following Boolean Expression using only NAND Gates:X.Y + Y.Z

Derive a Canonical SOP expression for a Boolean function F, represented by the following truth table:U V W F(U,V,W) 0 0 0 1 0 0 1 0 0 1 0 1 0 1 1 1 1 0 0 0 1 0 1 0 1 1 0 1 1 1 1 0

Reduce the following Boolean Expression to its simplest form using K-Map:F(X,Y,Z,W)= Σ (0,1,2,3,4,5,10,11,14)

State DeMorgan’s Laws of Boolean Algebra and verify them using truth table.

Draw the Logic Circuit of the following Boolean Expression using only NOR Gates:( A+B).(C+D)

Derive a Canonical POS expression for a Boolean function G, represented by the following truth table: X Y X G(X,Y,Z) 0 0 0 0 0 0 1 0 0 1 0 1 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 0 1 1 1 1

Reduce the following Boolean expression to its simplest form using K-Map:E(U,V,Z,W)= Σ (2,3,6,8,9,10,11,12,13)

Verify the following using Boolean Laws.A’+ B’.C = A’.B’.C’+ A’.B.C’+ A’.B.C + A’.B’.C+ A.B’.C

Write the Boolean Expression for the result of the Logic Circuit as shown below:

Mock Test Series

NCERT Sample Papers

Entrance Exams Preparation

State Distributive Laws of Boolean Algebra and verify them using truth table.

(i) X. (Y+Z)= X.Y + X.Z
(ii) X + Y.Z= (X + Y). (X+Z)

Draw the Logic Circuit of the following Boolean Expression using only NAND Gates:
X.Y + Y.Z

Derive a Canonical SOP expression for a Boolean function F, represented by the following truth table:

U V W F(U,V,W)
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 0

Reduce the following Boolean Expression to its simplest form using K-Map:
F(X,Y,Z,W)= Σ (0,1,2,3,4,5,10,11,14)

Draw the Logic Circuit of the following Boolean Expression using only NOR Gates:
( A+B).(C+D)

Derive a Canonical POS expression for a Boolean function G, represented by the following truth table:

X Y X G(X,Y,Z)
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1

Reduce the following Boolean expression to its simplest form using K-Map:
E(U,V,Z,W)= Σ (2,3,6,8,9,10,11,12,13)

Verify the following using Boolean Laws.
A’+ B’.C = A’.B’.C’+ A’.B.C’+ A’.B.C + A’.B’.C+ A.B’.C