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 2 - Boolean Functions and Reduce Forms - Shaalaa.com](/images/computer-science-with-python-english-class-12_6:c0c1e36c6bb846c19fd1bb8caad8e289.jpg "CBSE solutions for कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२ chapter 2 - Boolean Functions and Reduce Forms")
Advertisements
Solutions for Chapter 2: Boolean Functions and Reduce Forms
Below listed, you can find solutions for Chapter 2 of CBSE CBSE for कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२.
CBSE solutions for कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२ 2 Boolean Functions and Reduce Forms EXERCISE [Pages 233 - 238]
Determine the values of A, B, C and D that make the product term A'BC'D equal to 1.
A = 0, B = 1, C = 0, D = 1
A = 0, B = 0, C = 0, D = 1
A = 1, B = 1, C = 1, D = 1
A = 0, B = 0, C = 1, D = 0
The binary value of 1010 is converted to the product term A'B'C'D.
True
False
Which of the following expression is in SOP form?
(A+B) (C+D)
AB (CD)
(A) B (CD)
AB+CD
A truth table for SOP expression ABC'+ AB'C + A'B'C has how many input combinations?
1
2
4
8
POS equivalent of ABC+ AB'C'+AB'C+ABC'+A'B'C will be ______.
(A'+B'C') (A'+B+C') (A'+B+C)
(A'+B'+C') (A+B'+C) (A+B'+C)
(A+B+C) (A+B'+C) (A+B'+C')
(A+B+C) (A'+B+C') (A+B'+C)
Converting the Boolean expression LM+M (NO+PQ) to SOP form we get ______.
LM +MNOPQ
L+MNQ+MPQ
LM+ M+NO+MPQ
LM+MNO+MPQ
State whether AC+ABC = AC is
True
False
A student makes a mistake somewhere in the process of simplifying the following Boolean expression:
ab + a (b+c)
= ab+ab+c
= ab+c
Determine, where the mistake was made, and what proper sequence of steps should be used to simplify the original expression.
A student makes a mistake somewhere in the process of simplifying the following Boolean expression:
(x'y+z)'
= (x'y)'.z'
= (x')'+y'.z'
= x+y'.z
Determine what the mistake is?
When grouping cells within k-map, the cells must be combined in groups of ______.
2s
1, 2, 4, 8, etc.
4s
3s
Mapping the SOP expression A'B'C' + A'BC' + A'BC +ABC' we get
If you look at the following k-map, you should notice that only two of the input variables- A, B, C, D change their state, in the marked group. The other two variables hold the same value '1'. Identify which variable change, and which stay the same:
Give truth table for Z = x'+y'+z
Give the truth table for Z = x(y + xz + x')
Use Boolean algebra to find the most simplified SOP expression for F=ABD+CD+ ACD+ABC+ABCD
F = ABD+ABC+CD
F= CD+AD
F = BC+AB
F= AC+AD
From the truth table below, determine SOP and POS expression.
| A | B | C | Output X |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 0 |
Specify which axiom/theorem is being used in the following Boolean reduction:
x'y' + x'y'z = x'y'
Specify which axiom/theorem is being used in the following Boolean reduction:
1+A = 1
Specify which axiom/theorem is being used in the following Boolean reduction:
D+CD =D
Specify which axiom/theorem is being used in the following Boolean reduction:
a'.a'=a'
Specify which axiom/theorem is being used in the following Boolean reduction:
(bc)' + bc = 1
Specify which axiom/theorem is being used in the following Boolean reduction:
xyz+zx = xz
Specify which axiom/theorem is being used in the following Boolean reduction:
ca'b' + ab = ab + c
Construct a truth table for the following function and from the truth table obtain an expression for the inverse function.
F1(A,B,C) = A + BC'
Construct a truth table for the following function and from the truth table obtain an expression for the inverse function.
F2(A,B,C) = AC + BC + AB'
Examine the given truth table and then write both SOP & POS boolean expressions describing the output.
| A | B | C | Output |
| 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 |
| 0 | 1 | 0 | 1 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 |
| 1 | 0 | 1 | 1 |
| 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 0 |
Write POS Boolean expressions for F (a, b) = ab'+a'b. Show through Boolean algebra reduction that the SOP & POS expressions are indeed equivalent to one another.
Minimize the following Boolean function using algebraic method.
Z = f(a, b, c) = a'b'c' +a'b + abc' +ac
Minimize the following Boolean functions using algebraic method.
Z = f (a,b,c) = a'b +bc' +bc+ ab'c'
Minimize the following Boolean function using algebraic method.
Z = f (a,b,c) = a'b'c' +
Reduce the following Boolean expression using k-map.
F (a, b, c) = a'b'c'+ a'bc'+ a 'bc' + a'bc + ab'c' + abc' to SOP form
Reduce the following Boolean expression using k-map.
F(w,x,y,z) = (w + x) ( x + z') (w' + y' + z) to SOP form
Reduce the following Boolean expression using k-map.
| A | B | C | F1 |
| 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 |
| 1 | 0 | 1 | 1 |
| 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 0 |
To SOP & POS form
Reduce the following Boolean expression using k-map.
| A | B | C | D | F2 |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 1 | 0 |
| 0 | 0 | 1 | 0 | 0 |
| 0 | 0 | 1 | 1 | 0 |
| 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 1 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 1 |
| 1 | 0 | 1 | 1 | 1 |
| 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 0 |
| 1 | 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 |
To SOP & POS Form
Obtain the minterm canonical form of the Boolean expression by algebraic method.
xyz + xy + x'(yz' + y'z)
Obtain the minterm canonical form of the Boolean expression by algebraic method.
ab + abc + a'b + ab'c
Solutions for 2: Boolean Functions and Reduce Forms
CBSE solutions for कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२ chapter 2 - Boolean Functions and Reduce Forms
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 2 (Boolean Functions and Reduce Forms) 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 2 Boolean Functions and Reduce Forms are .
Using CBSE कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२ solutions Boolean Functions and Reduce Forms 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 2, Boolean Functions and Reduce Forms कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२ additional questions for Mathematics कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२ CBSE, and you can use Shaalaa.com to keep it handy for your exam preparation.
