Recent questions tagged boolean-algebra

0 votes

1 answer

1

UGCNET-june2007-9
If A⊕B=C, then: (A) A⊕C=B (B) B⊕C=A (C) A⊕B⊕C=1 (D) A⊕B⊕C=0

asked Sep 28 in Digital Logic by rishu_darkshadow Boss (5.5k points) | 59 views

0 votes

1 answer

2

keneth r rosen
HOW TO SOLVE THIS USING BOOLEAN ALGEBRA;

asked May 7 in Mathematical Logic by iarnav Loyal (4.6k points) | 70 views

0 votes

1 answer

3

keneth r rosen
WHAT IS DNF Disjunctive normal form IN BOOLEAN ALGEBRA?

asked May 7 in Mathematical Logic by iarnav Loyal (4.6k points) | 41 views

0 votes

1 answer

4

keneth r rosen
how to find / what will be the DNF(Disjunctive normal form) of :

asked May 7 in Mathematical Logic by iarnav Loyal (4.6k points) | 30 views

+1 vote

2 answers

5

keneth r rosen
how to solve this using rules of boolean algebra:

asked May 7 in Mathematical Logic by iarnav Loyal (4.6k points) | 144 views

0 votes

1 answer

6

[Digital Electronics] Gate 2011 ECE

asked Dec 23, 2016 in Digital Logic by rahul sharma 5 Veteran (15k points) | 192 views

+3 votes

1 answer

7

GATE1987-1-II
The total number of Boolean functions which can be realised with four variables is: $4$ $17$ $256$ $65, 536$

asked Nov 7, 2016 in Digital Logic by makhdoom ghaya Veteran (39.8k points) | 210 views

+5 votes

2 answers

8

DLC :
Five soldiers A, B, C, D and E volunteer to perform an important military task if their following conditions are satisfied (i) either A or B or both must go (ii) either C or E but both must not go (iii) either both A and C go or neither goes (iv) ... combination of soldiers who can get the arrangement will be a). $ADE$ b). $BD(C + E)$ c). $AC$ d). $ABCD'E'$

asked Sep 20, 2016 in Digital Logic by mcjoshi Veteran (27.4k points) | 247 views

0 votes

1 answer

9

GATE 1998
How many minterms (excluding redundant terms) does the minimal switching function f (v,w, x, y, z) = x + ȳ z originally have? a. 16 b. 20 c. 24 d. 32

asked Aug 14, 2016 in Digital Logic by pC Veteran (23k points) | 362 views

0 votes

1 answer

10

GATE 1998 ECE
Two 2's complement number having sign bits X and Y are added and the sign bit of the result is Z. then, the occurrence of overflow is indicated by the Boolean function. A. XYZ B. X Y Z C. X YZ + XY Z D. XY + YZ + ZX

asked Aug 14, 2016 in Digital Logic by pC Veteran (23k points) | 512 views

+6 votes

3 answers

11

No. of Boolean Function
Constraint Equation is given as : $F(x,y,z) = F(\bar x,y,\bar z) + F(x,\bar y,z)$ How many Boolean functions are possible for 3 variable input function F(x,y,z) such that above condition is satisfied ?

asked Aug 1, 2016 in Digital Logic by Debashish Deka Veteran (56.9k points) | 574 views

+4 votes

3 answers

12

UGCNET-June2013-II-41
How many different Boolean functions of degree 4 are there? $2^4$ $2^8$ $2^{12}$ $2^{16}$

asked Jul 14, 2016 in Digital Logic by jothee Veteran (92.7k points) | 433 views

+1 vote

1 answer

13

Hamming Distance with Boolean equation

asked Jun 28, 2016 in Digital Logic by Yordan Bozadzhiev (33 points) | 145 views

+2 votes

1 answer

14

UGCNET-June2014-II-17
A Boolean function $F$ is called self dual if and only if $F(x_{1}, x_{2},.....x_{n}) = F(\bar{x}_{1}, \bar{x}_{2},....\bar{x}_{n})$. How many Boolean functions of degree $n$ are self-dual ? $2^{n}$ $(2)^{2^{n}}$ $(2)^{n^{2}}$ $(2)^{2^{n-1}}$

asked Jun 25, 2016 in Digital Logic by makhdoom ghaya Veteran (39.8k points) | 383 views

+1 vote

0 answers

15

Lattice | Boolean Albegra
Need IN Depth Explanation for each option POSET [ A ; <= ] is a) Bounded Lattics b) Distributive Lattice c) Complemented Lattice d) Boolean Algebra POSET [ P(A) ; $\subseteq$ ] is a) Bounded Lattics b) Distributive ... .. How to Solve general questions like this..? Need in depth explanation for each option and each question. Thanks.

asked Jun 23, 2016 in Set Theory & Algebra by pC Veteran (23k points) | 169 views

+4 votes

3 answers

16

ISRO2011-30
In Boolean algebra, rule (X+Y)(X+Z) = Y+XZ X+YZ XY+Z XZ+Y

asked Jun 22, 2016 in Digital Logic by jothee Veteran (92.7k points) | 809 views

0 votes

1 answer

17

DL \ minimize boolean functions

asked Jun 2, 2016 in Digital Logic by Desert_Warrior Boss (9.6k points) | 128 views

+1 vote

0 answers

18

ISI2012-A-2c
Professor Hijibiji has defined the following Boolean algebra $\mathcal{B} = (B, +, *)$, where $B = \{1, 2, 3, 5, 6, 10, 15, 30\}$, i.e., the set of all eight factors of 30; the two binary operators '+' and '*' respectively ... divisor) of two integer operands. Define the complementation operation $\bar{a}$ for all $a \in B$ such that $\bar{\bar{a}}= a$.

asked Jun 2, 2016 in Digital Logic by jothee Veteran (92.7k points) | 36 views

+1 vote

0 answers

19

ISI2012-A-2b
Professor Hijibiji has defined the following Boolean algebra $\mathcal{B} = (B, +, *)$, where $B = \{1, 2, 3, 5, 6, 10, 15, 30\}$, i.e., the set of all eight factors of 30; the two binary operators ’+ ... the LCM (least common multiple) and GCD (greatest common divisor) of two integer operands. Which are the identity elements for $\mathcal{B}$?

asked Jun 2, 2016 in Digital Logic by jothee Veteran (92.7k points) | 30 views

+1 vote

0 answers

20

ISI2012-A-2a
Professor Hijibiji has defined the following Boolean algebra $\mathcal{B} = (B, +, *)$, where $B = \{1, 2, 3, 5, 6, 10, 15, 30\}$, i.e., the set of all eight factors of 30; the two binary ... ) and GCD (greatest common divisor) of two integer operands. Show that the two operations of $\mathcal{B}$ satisfy associativity commutativity distributivity.

asked Jun 2, 2016 in Digital Logic by jothee Veteran (92.7k points) | 26 views

+10 votes

3 answers

21

GATE2016-2-08
Let, $x_{1} ⊕ x_{2} ⊕ x_{3} ⊕ x_{4}= 0$ where $x_{1}, x_{2}, x_{3}, x_{4}$ are Boolean variables, and $⊕$ is the XOR operator. Which one of the following must always be TRUE? $x_{1}x_{2}x_{3}x_{4} = 0$ $x_{1}x_{3} + x_{2} = 0$ $\bar{x}_{1} ⊕ \bar{x}_{3} = \bar{x}_{2} ⊕ \bar{x}_{4}$ $x_{1} + x_{2} + x_{3} + x_{4} = 0$

asked Feb 12, 2016 in Digital Logic by Akash Kanase Veteran (45.9k points) | 1.5k views

0 votes

3 answers

22

number of binary operations on set

asked Jan 24, 2016 in Digital Logic by Pradip Nichite Active (2.5k points) | 453 views

0 votes

1 answer

23

Boolean function property

asked Jan 24, 2016 in Digital Logic by Pradip Nichite Active (2.5k points) | 169 views

+2 votes

1 answer

24

Computing the dual of the boolean function

asked Jan 16, 2016 in Digital Logic by Utk Active (2.4k points) | 906 views

+2 votes

2 answers

25

The number of possible boolean functions that can be defined for n boolean variables over n valued boolean algebra is

asked Dec 26, 2015 in Digital Logic by Payal Rastogi Active (1.8k points) | 693 views

+2 votes

3 answers

26

dual of function
Dual of EX-OR is equal to (A) NAND (B) NOR (C) EX-NOR (D) None of these

asked Nov 29, 2015 in Digital Logic by shreshtha5 Active (2.4k points) | 1k views

+5 votes

3 answers

27

Boolean Algebra
Consider a Hasse Diagram for a Boolean Algebra of Order 3 What can we comment about it? How is it successfully able to represent the Boolean Algebra System? Is there an easy way to check for distributive lattice, or any other ... should provide a complete answer to all parts of the question. Whatever one can supply to support its answer is welcomed.

asked Nov 11, 2015 in Set Theory & Algebra by amarVashishth Veteran (29.3k points) | 459 views

+2 votes

3 answers

28

How many of $16$ boolean functions in $2$ variables $x$ and $y$ can be represented using only

asked Oct 7, 2015 in Digital Logic by Pooja Palod Veteran (32.9k points) | 292 views

+4 votes

3 answers

29

TIFR2010-B-21
For $x \in \{0,1\}$, let $\lnot x$ denote the negation of $x$, that is $$\lnot \, x = \begin{cases}1 & \mbox{iff } x = 0\\ 0 & \mbox{iff } x = 1\end{cases}$$. If $x \in \{0,1\}^n$, then $\lnot \, x$ denotes the component wise negation of $x$; ... ) = f(x) \land f(\lnot x)$ $g(x) = f(x) \lor f(\lnot x)$ $g(x) = \lnot f(\lnot x)$ None of the above.

asked Oct 5, 2015 in Digital Logic by makhdoom ghaya Veteran (39.8k points) | 426 views

+11 votes

2 answers

30

GATE2000-2.10
The simultaneous equations on the Boolean variables x, y, z and w, $$x + y + z = 1 \\xy = 0\\xz + w = 1\\xy + \bar{z}\bar{w} = 0$$ have the following solution for x, y, z and w, respectively: 0 1 0 0 1 1 0 1 1 0 1 1 1 0 0 0

asked Sep 14, 2014 in Digital Logic by Kathleen Veteran (66.3k points) | 641 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions tagged boolean-algebra

Recent Posts

Recent Blog Comments

Recent Badges