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
▶ 3: Application of Boolean Logic
Unit -5 : Communication Technologies
1: Networking Concepts Part I
2: Networking Concepts Part II
3: Networking Protocols
4: Mobile Telecommunication Technologies, Network Security and Internet Services
![CBSE solutions for Computer Science with Python [English] Class 12 chapter 3 - Application of Boolean Logic - Shaalaa.com](/images/computer-science-with-python-english-class-12_6:c0c1e36c6bb846c19fd1bb8caad8e289.jpg "CBSE solutions for Computer Science with Python [English] Class 12 chapter 3 - Application of Boolean Logic")
Advertisements
Solutions for Chapter 3: Application of Boolean Logic
Below listed, you can find solutions for Chapter 3 of CBSE CBSE for Computer Science with Python [English] Class 12.
CBSE solutions for Computer Science with Python [English] Class 12 3 Application of Boolean Logic EXERCISE [Pages 256 - 258]
One of the DeMorgan's theorems states that (x=y)' = x'y'. Simply stated, this means that logically there is no difference between ______.
A NOR and an AND gate with inverted inputs
A NAND and an OR gate with inverted inputs
An AND and a NOR gate with inverted inputs
A NOR and a NAND gate with inverted inputs
An AND gate with 'bubbles' on its input performs the same function as a(n) ______ gate.
NOT
OR
NOR
NAND
How many gates would be required to implement the following Boolean expression before simplification of X4 + X (X+Z) + Y (X+Z)?
1
2
4
5
The NAND and NOR gates are referred to as universal gates because either, ______.
Can be found in almost all digital circuit
Can be used to build all other types of gate.
Are used in all countries of the world
Were the first gates to be integrated
The Boolean expression x = A' + B' + C' is logically equivalent to which single gate?
NAND
NOR
AND
OR
The symbol shown is for a 2-input NAND gate.
True
False
By applying DeMorgan's theorem to a NOR gate two identical truth tables can be produced.
True
False
Give the truth table of following gate:
Give the truth table of following gate:
Give the truth table of following gate:
Give the truth table of following gate:
Give the truth table of following gate:
Give the truth table of following gate:
Convert the following logic gate circuit into a Boolean expression, writing Boolean sub-expression next to each gate.
Convert the following logic gate circuit into a Boolean expression, writing Boolean sub-expression next to each gate.
Convert the following logic gate circuit into a Boolean expression, writing Boolean sub-expression next to each gate.
Draw the circuit diagram for the following using AND, OR and NOT gate(s).
F(a,b,c,) = a + bc'
Draw the circuit diagram for the following using AND, OR and NOT gate(s).
F(x,y,z,) = xy + yz + xy'
Draw the circuit diagram for the following using AND, OR and NOT gate(s).
f(w,x,y,z) = yz' + wxy' + wxz' + wx'z
Draw the circuit diagram for the following using AND, OR and NOT gate(s).
f(x,y,z) = (x + y). (y + z) . (z + x)
Convert the following circuit diagram using NAND gate(s) only. Do not simplify the expression.
Draw truth table and write Boolean function for following circuit.
Draw the logic gate diagram for following expression using NOR gates only.
f(a,b,c) = ?(2,4,5,7,8)
Draw the logic gate diagram for following expression using NOR gates only.
f(x,y,z) = ?(0,1,3,4)
Draw the logic gate diagram for following expression using NOR gates only.
f(w,x,y,z) = ?(2,4,5,6,9)
Which gates are known as universal gate? Why?
Show how AND, OR Not gate functions can be implemented using only:
NAND gate
Show how AND, OR Not gate functions can be implemented using only:
NOR gate
Solutions for 3: Application of Boolean Logic
CBSE solutions for Computer Science with Python [English] Class 12 chapter 3 - Application of Boolean Logic
Shaalaa.com has the CBSE Mathematics Computer Science with Python [English] Class 12 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 Computer Science with Python [English] Class 12 CBSE 3 (Application of Boolean Logic) 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 Computer Science with Python [English] Class 12 chapter 3 Application of Boolean Logic are .
Using CBSE Computer Science with Python [English] Class 12 solutions Application of Boolean Logic 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 Computer Science with Python [English] Class 12 students prefer CBSE Textbook Solutions to score more in exams.
Get the free view of Chapter 3, Application of Boolean Logic Computer Science with Python [English] Class 12 additional questions for Mathematics Computer Science with Python [English] Class 12 CBSE, and you can use Shaalaa.com to keep it handy for your exam preparation.
