0

Duality - class-XI

Description: duality
Number of Questions: 7
Created by:
Tags: mathematical logic mathematical reasoning discrete mathematics maths business maths
Attempted 0/7 Correct 0 Score 0

The conditional $( p \wedge q ) \Rightarrow p$ is 

  1. neither tautology nor contradiction

  2. a tautology

  3. a contradiction

  4. both tautology and contradiction


Correct Option: B

Boolean algebra is also called

  1. switching algebra

  2. arithmetic algebra

  3. linear algebra

  4. algebra


Correct Option: A
Explanation:

Boolean algebra is also called switching algebra..


It was invented by mathematician George Boole in 1849.Boolean algebra or 

switching algebra ia a system of mathematical logic to perform different 

mathematical operation in binary system.

$e*x=x*e=x$ is the

  1. commutative property

  2. inverse property

  3. associative property

  4. identity element


Correct Option: D
Explanation:

Given, $e\times x=x\times e=x$

This is possible when $e=1$
This is an identity element.

A Boolean function may be transformed into

  1. logical diagram

  2. logical graph

  3. map

  4. matrix


Correct Option: A
Explanation:

Boolean function:

        It can be represented in the form of diagram with logic gates.

Boolean algebra theorem, gives   $x\cdot (x+y)$   equal to

  1. $x'$

  2. $1$

  3. $x$

  4. $0$


Correct Option: C
Explanation:

    $x\cdot \left( x+y \right) $

$=x\cdot x+xy$
$=x$

To perform product of maxterms Boolean function must be brought into

  1. and terms

  2. or terms

  3. not terms

  4. nand terms


Correct Option: B
Explanation:

For performing Product of Maxterms, it has to be brought into POS, i.e; Product of Sum form. For this, the Boolean Function must be brought into OR terms.

Minterms are also called

  1. standard sum

  2. standard product

  3. standard division

  4. standard subtraction


Correct Option: B
Explanation:

product is called a minterm because it has minimum-satisfiability where as a sum is called a maxterm because it has maximum-satisfiability among all practically interesting boolean functions.

- Hide questions