Wired Faculty
Sponsor Area
Boolean Algebra Here is the CBSE Computer And Communication Technology Chapter 12 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 12 NCERT Solutions for Class 12 Computer And Communication Technology Boolean Algebra Chapter 12 The following is a summary in Hindi and English for the academic year
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
Verify the following using truth table:
|
X |
X’ |
X.X’ |
X+1 |
|
0 |
1 |
0 |
1 |
|
0 |
1 |
0 |
1 |
|
1 |
0 |
0 |
1 |
|
1 |
0 |
0 |
1 |
Write the SOP form of a Boolean Function F, which is represented in a truth table as follows:
|
X |
Y |
Z |
F |
|
0 |
0 |
0 |
1 |
|
0 |
0 |
1 |
0 |
|
0 |
1 |
0 |
1 |
|
0 |
1 |
1 |
0 |
|
1 |
0 |
0 |
1 |
|
1 |
0 |
1 |
0 |
|
1 |
1 |
0 |
0 |
|
1 |
1 |
1 |
1 |
Sponsor Area
Sponsor Area
Mock Test Series
