Advertisements
Online Mock Tests
Chapters
1: Review of Phython
2: Concept of Object Oriented Programming
3: Classes in Python
4: Inheritance
Unit -2 : Advanced Programming with Python
1: Liner List Manipulation
2: Stacks & Queues in list
3: Data File Handling
4: Exception Handling & Generate Functions
Unit -3 : Databases Management Systems and SQL
1: Databases Concepts and SQL
2: Structure Query Language
Unit -4 : Introduction to Boolean Algebra
▶ 1: Boolean Algebra
2: Boolean Functions and Reduce Forms
Chapter 3: Application of Boolean Logic
Unit -5 : Communication Technologies
Chapter 1: Networking Concepts Part I
Chapter 2: Networking Concepts Part II
Chapter 3: Networking Protocols
Chapter 4: Mobile Telecommunication Technologies, Network Security and Internet Services
![CBSE solutions for कम्प्यूटर साइंस विद पाइथान [अंग्रेजी] कक्षा १२ chapter 1 - Boolean Algebra - Shaalaa.com](/images/computer-science-with-python-english-class-12_6:c0c1e36c6bb846c19fd1bb8caad8e289.jpg "CBSE solutions for कम्प्यूटर साइंस विद पाइथान [अंग्रेजी] कक्षा १२ chapter 1 - Boolean Algebra")
Advertisements
Solutions for Chapter 1: Boolean Algebra
Below listed, you can find solutions for Chapter 1 of CBSE CBSE for कम्प्यूटर साइंस विद पाइथान [अंग्रेजी] कक्षा १२.
CBSE solutions for कम्प्यूटर साइंस विद पाइथान [अंग्रेजी] कक्षा १२ 1 Boolean Algebra EXERCISE [Pages 217 - 219]
The commutative law of Boolean algebra states that
A + B = A · B.
True
False
Applying Dr. Morgan's theorem to the expression (ABC)', we get ______.
A' + B' + C'
(A + B + C)'
A + B' + C·C'
A(B + C)
Which Boolean Algebra theorem allow us to group operands in an expression in any order without affecting the results of the operation:
Associative
Commutative
Boolean
Distributive
Applying Dr. Morgans theorem to the expression ((x+y)'+z)', we get ______.
(x + y)z
(x' + y')z
(x + y)z'
(x' + y')z'
Applying the distributive law to the expression A (B+C'+D), we get ______.
AB + AC + AD
ABCD
A + B + C + D
AB + AC' + AD
A variable is a symbol used to represent a logical quantity that can have a value of 1 or 0.
True
False
The OR operation is Boolean multiplication and the AND operation is Boolean addition.
True
False
In Boolean Algebra, A+1 = 1
True
False
In the Commutative law, in ORing and ANDing of two variables. The order in which the variables are ORed or ANDed makes no difference.
True
False
Verify using truth table, DeMorgan's theorem for three variables.
Construct a truth table for the following function.
F1(A,B,C) = A + BC'
Construct a truth table for the following function.
F2(A,B,C) = AC + BC + AB'
Construct a truth table for the following function.
F3(w,x,y,z) = y'z + wxy' + wxz' + wx'z
Construct a truth table for the following function.
(x + y) . ( y + z) . (z + x)
Expand the following expression using De Morgan's theorem.
F1(A,B,C) = (AB)'(ABC)'(A'C)'
Expand the following expression using De Morgan's theorem.
F2(A,B,C) = ((AB + B'C).(AC + A'C'))'
State the fundamental axioms of Boolean algebra.
Explain principle of Duality of Boolean algebra.
What do you mean by literal?
List the theorems of Boolean Algebra.
What is the difference between operator in mathematics and logic?
Write Dual of A + 1 = 1.
Write Dual of x + x'y = x + y.
Write Dual of x + x' = 1.
Write Dual of x'(y + z) + x'(y' + z').
How is Boolean Algebra different from Arithmetic algebra?
Prove the following:
C + A (C + B) + BC = C + AB
Prove following:
(A + C)A + AC + C = A + C
Prove following:
BC + A(B+C) = AB + BC + AC
Prove following:
B + A (B + C) + BC = B + AC
Prove following:
x+ (x. y) = x
Prove following:
(a' + b') . (a' + b) . (a + b') = a' . b'
For the given truth table, write Boolean expression for function G1, G2, G3, G4, G5.
| X | Y | Z | G1 | G2 | G3 | G4 | G5 |
|---|---|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 0 | 1 | 0 | 0 | 1 | 0 |
| 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 |
| 1 | 0 | 0 | 1 | 0 | 0 | 1 | 1 |
| 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 |
| 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 |
Express the OR operator in the terms of AND and NOT operator.
List the reasons used for algebraic proof of Associative theorm.
Solutions for 1: Boolean Algebra
CBSE solutions for कम्प्यूटर साइंस विद पाइथान [अंग्रेजी] कक्षा १२ chapter 1 - Boolean Algebra
Shaalaa.com has the CBSE Mathematics कम्प्यूटर साइंस विद पाइथान [अंग्रेजी] कक्षा १२ CBSE solutions in a manner that help students grasp basic concepts better and faster. The detailed, step-by-step solutions will help you understand the concepts better and clarify any confusion. CBSE solutions for Mathematics कम्प्यूटर साइंस विद पाइथान [अंग्रेजी] कक्षा १२ CBSE 1 (Boolean Algebra) include all questions with answers and detailed explanations. This will clear students' doubts about questions and improve their application skills while preparing for board exams.
Further, we at Shaalaa.com provide such solutions so students can prepare for written exams. CBSE textbook solutions can be a core help for self-study and provide excellent self-help guidance for students.
Concepts covered in कम्प्यूटर साइंस विद पाइथान [अंग्रेजी] कक्षा १२ chapter 1 Boolean Algebra are .
Using CBSE कम्प्यूटर साइंस विद पाइथान [अंग्रेजी] कक्षा १२ solutions Boolean Algebra exercise by students is an easy way to prepare for the exams, as they involve solutions arranged chapter-wise and also page-wise. The questions involved in CBSE Solutions are essential questions that can be asked in the final exam. Maximum CBSE कम्प्यूटर साइंस विद पाइथान [अंग्रेजी] कक्षा १२ students prefer CBSE Textbook Solutions to score more in exams.
Get the free view of Chapter 1, Boolean Algebra कम्प्यूटर साइंस विद पाइथान [अंग्रेजी] कक्षा १२ additional questions for Mathematics कम्प्यूटर साइंस विद पाइथान [अंग्रेजी] कक्षा १२ CBSE, and you can use Shaalaa.com to keep it handy for your exam preparation.
