A Boolean operator Ө is defined as follows: 1Ө1=1, 1Ө0=0, 0Ө1=0 and 0Ө0=1 What will be the truth value of the expression (xӨy)Өz = xӨ(yӨz)? (A) Always false (B) Always true (C) Sometimes true (D) True when x, y, z are all true

A Boolean operator Ө is defined as follows:

1Ө1=1, 1Ө0=0, 0Ө1=0 and 0Ө0=1

What will be the truth value of the expression (xӨy)Өz = xӨ(yӨz)?

(A) Always false

(B) Always true

(C) Sometimes true

(D) True when x, y, z are all true
by

1 Answer

Answer :

(B) Always true
by

Related questions

The simplified function in product of sums of Boolean function F(W, X, Y, Z) = Σ(0, 1, 2, 5, 8, 9, 10) is (A) (W' + X') (Y' + Z') (X' + Z) (B) (W' + X') (Y' + Z') (X' + Z') (C) (W' + X') (Y' + Z) (X' + Z) (D) (W' + X') (Y + Z') (X' + Z)

Description : The simplified function in product of sums of Boolean function F(W, X, Y, Z) = Σ(0, 1, 2, 5, 8, 9, 10) is (A) (W' + X') (Y' + Z') (X' + Z) (B) (W' + X') (Y' + Z') (X' + Z') (C) (W' + X') (Y' + Z) (X' + Z) (D) (W' + X') (Y + Z') (X' + Z)

Last Answer : (A) (W' + X') (Y' + Z') (X' + Z)

Simplified Boolean equation for the following truth table is: Image(A) F = yz’ + y’z (B) F = xy’ + x’y (C) F = x’z + xz’ (D) F = x’z + xz’ + xyz

Description : Simplified Boolean equation for the following truth table is: (A) F = yz’ + y’z (B) F = xy’ + x’y (C) F = x’z + xz’ (D) F = x’z + xz’ + xyz 

Last Answer : (C) F = x’z + xz’ 

A recursive function h, is defined as follows: h(m)=k, if m=0 = 1, if m=1 = 2h(m-1) + 4h(m-2), if m≥2 If the value of h(4) is 88 then the value of k is: (1) 0 (2) 1 (3) 2 (4) -1

Description : A recursive function h, is defined as follows: h(m)=k, if m=0  = 1, if m=1 = 2h(m-1) + 4h(m-2), if m≥2 If the value of h(4) is 88 then the value of k is: (1) 0 (2) 1 (3) 2 (4) -1

Last Answer : (3) 2 

A three dimensional array in ‘C’ is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer): (A) &A[0][0][0]+w(y*z*q+z*p+r) (B) &A[0][0][0]+w(y*z*p+z*q+r) (C) &A[0][0][0]+w(x*y*p+z*q+r) (D) &A[0][0][0]+w(x*y*q+z*p+r)

Description : A three dimensional array in C' is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer): (A) &A[0][0][0]+w(y*z*q+z*p+r) (B) &A ... *q+r) (C) &A[0][0][0]+w(x*y*p+z*q+r) (D) &A[0][0][0]+w(x*y*q+z*p+r)

Last Answer : Answer: B

Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB(x))) Then, f(A+B) is equal to (A) {(0.5,12), (0.6,13), (1,14), (0.7,15), (0.7,16), (1,17), (1,18)} (B) {(0.5,12), (0.6,13), (1,14), (1,15), (1,16), (1,17), (1,18)} (C) {(0.3,12), (0.5,13), (0.5,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Description : Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB( ... ,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Last Answer : (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} 

Which of the following control expressions are valid for an if statement? A) An integer expression B) A Boolean expression C) Either A or B D) Neither A nor B

Description : Which of the following control expressions are valid for an if statement? A) An integer expression B) A Boolean expression C) Either A or B D) Neither A nor B

Last Answer : B) A Boolean expression

Which of the following control expressions are valid for an if statement? A) An integer expression B) A Boolean expression C) Either A or B D) Neither A nor B

Description : Which of the following control expressions are valid for an if statement? A) An integer expression B) A Boolean expression C) Either A or B D) Neither A nor B

Last Answer : B) A Boolean expression

In java, ............. can only test for equality, where as ............ can evaluate any type of the Boolean expression. A) switch, if B) if, switch C) if, break D) continue, if

Description : In java, ............. can only test for equality, where as ............ can evaluate any type of the Boolean expression. A) switch, if B) if, switch C) if, break D) continue, if

Last Answer : A) switch, if

Which of the following control expressions are valid for an if statement? A) an integer expression B) a Boolean expression C) either A or B D) Neither A nor B

Description : Which of the following control expressions are valid for an if statement? A) an integer expression B) a Boolean expression C) either A or B D) Neither A nor B

Last Answer : B) a Boolean expression

The dual of a Boolean expression is obtained by interchanging (A) Boolean sums and Boolean products (B) Boolean sums and Boolean products or interchanging 0's and 1's (C) Boolean sums and Boolean products and interchanging 0's & 1's (D) Interchanging 0's and 1's

Description : The dual of a Boolean expression is obtained by interchanging (A) Boolean sums and Boolean products (B) Boolean sums and Boolean products or interchanging 0's and 1's (C) Boolean sums and Boolean products and interchanging 0's & 1's (D) Interchanging 0's and 1's

Last Answer : (C) Boolean sums and Boolean products and interchanging 0's & 1's

Consider the following statements : (a) Boolean expressions and logic networks correspond to labelled acyclic digraphs. (b) Optimal Boolean expressions may not correspond to simplest networks. (c) Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover may not give an optimal expression. Which of these statement(s) is/ are correct? (A) (a) only (B) (b) only (C) (a) and (b) (D) (a), (b) and (c)

Description : Consider the following statements : (a) Boolean expressions and logic networks correspond to labelled acyclic digraphs. (b) Optimal Boolean expressions may not correspond to simplest networks. (c) Choosing essential blocks first in a Karnaugh map ... (b) only (C) (a) and (b) (D) (a), (b) and (c)

Last Answer : (D) (a), (b) and (c) 

A Boolean function F defined on the three input variables x, y and z is 1 if and only if number of 1(one) input is even. -Technology

Description : A Boolean function F defined on the three input variables x, y and z is 1 if and only if number of 1(one) input is even. -Technology

Last Answer : This answer was deleted by our moderators...

State True or False. i) While overloading operators new operator can be overloaded. ii) The binary operator such as +, -, * and must explicitly return a value. A) True, True B) True, False C) False, True D) False, False

Description : State True or False. i) While overloading operators new operator can be overloaded. ii) The binary operator such as +, -, * and must explicitly return a value. A) True, True B) True, False C) False, True D) False, False

Last Answer : C) False, True

The sum of product expression for a Boolean function can be derived from its truth table by

Description : The sum of product expression for a Boolean function can be derived from its truth table by (a) AND operation of the product terms. (b) NOR operation of the product terms. (c) OR operation of the product terms. (d) NAND operation of the product terms.

Last Answer : C. OR operation of the product terms

Select operator is not a unary operator. ii) Project operator chooses subset of attributes or columns of a relation. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Description : Select operator is not a unary operator. ii) Project operator chooses subset of attributes or columns of a relation. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Last Answer : C) i-False, ii-True

Cartesian product in relational algebra is (A) a Unary operator. (B) a Binary operator. (C) a Ternary operator. (D) not defined.

Description : Cartesian product in relational algebra is (A) a Unary operator. (B) a Binary operator. (C) a Ternary operator. (D) not defined.

Last Answer : (B) a Binary operator.

Let P(m,n) be the statement “m divides n” where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions. (a) ∃m ∀n P(m,n) (b) ∀n P(1,n) (c) ∀m ∀n P(m,n) (A) (a)-True; (b)-True; (c)-False (B) (a)-True; (b)-False; (c)-False (C) (a)-False; (b)-False; (c)-False (D) (a)-True; (b)-True; (c)-True

Description : Let P(m,n) be the statement m divides n where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions. (a) ∃m ∀n P(m,n) (b) ∀n P(1,n) ( ... -False (C) (a)-False; (b)-False; (c)-False (D) (a)-True; (b)-True; (c)-True

Last Answer : Answer: A

Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6

Description : Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6

Last Answer : (D) 6

For the circuit shown in figure, the Boolean expression for the output y in terms of inputs P, Q, R and S is

Description : For the circuit shown in figure, the Boolean expression for the output y in terms of inputs P, Q, R and S is

Last Answer : For the circuit shown in figure, the Boolean expression for the output y in terms of inputs P, Q, R and S is P+Q+R+S

The “PROJECT” operator of a relational algebra creates a new table that has always (A) More columns than columns in original table (B) More rows than original table (C) Same number of rows as the original table (D) Same number of columns as the original table

Description : The “PROJECT” operator of a relational algebra creates a new table that has always (A) More columns than columns in original table (B) More rows than original table (C) Same number of rows as the original table (D) Same number of columns as the original table

Last Answer : (C) Same number of rows as the original table

State true or false for Java Program. i) Data members of an interface are by default final ii) An abstract class has implementations of all methods defined inside it. A) i-false, ii-false B) i-false, ii-true C) i-true, ii-false D) i-true, ii-true

Description : State true or false for Java Program. i) Data members of an interface are by default final ii) An abstract class has implementations of all methods defined inside it. A) i-false, ii-false B) i-false, ii-true C) i-true, ii-false D) i-true, ii-true

Last Answer : C) i-true, ii-false

There are exactly ................ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state. (A) 64 (B) 256 (C) 1024 (D) 5832

Description : There are exactly ................ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state. (A) 64 (B) 256 (C) 1024 (D) 5832

Last Answer : Answer: D

In java, string is a ............. A) primitive data type B) abstract data type C) combination of boolean D) None of the above

Description : In java, string is a ............. A) primitive data type B) abstract data type C) combination of boolean D) None of the above

Last Answer : B) abstract data type

The simplified form of a Boolean equation (AB’+AB’C+AC)(A’C’+B’) is : (A) AB’ (B) AB’C (C) A’B (D) ABC

Description : The simplified form of a Boolean equation (AB’+AB’C+AC)(A’C’+B’) is : (A) AB’ (B) AB’C (C) A’B (D) ABC

Last Answer : (A) AB’

The Karnaugh map for a Boolean function is given as Image The simplified Boolean equation for the above Karnaugh Map is (A) AB + CD + AB’ + AD (B) AB + AC + AD + BCD (C) AB + AD + BC + ACD (D) AB + AC + BC + BCD

Description : The Karnaugh map for a Boolean function is given as The simplified Boolean equation for the above Karnaugh Map is (A) AB + CD + AB’ + AD (B) AB + AC + AD + BCD (C) AB + AD + BC + ACD (D) AB + AC + BC + BCD

Last Answer : (B) AB + AC + AD + BCD

When simplified with Boolean Algebra (x + y)(x + z) simplifies to (A) x (B) x + x(y + z) (C) x(1 + yz) (D) x + yz

Description : When simplified with Boolean Algebra (x + y)(x + z) simplifies to (A) x (B) x + x(y + z) (C) x(1 + yz) (D) x + yz

Last Answer : Ans: D When simplified with Boolean Algebra (x + y)(x + z) simplifies to x + yz [(x + y) (x + z)] = xx + xz + xy + yz = x + xz + xy + yz (Qxx = x) = x(1+z) + xy + yz = x + xy + yz {Q(1+z) = 1} = x(1 + y) + yz = x + yz {Q(1+y) = 1}]

Let R and S be two fuzzy relations defined as: Image Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

Description : Let R and S be two fuzzy relations defined as: Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

Last Answer : Answer: C

Venn diagram is a kind of diagram to (A) represent and assess the truth of elementary inferences with the help of Boolean Algebra of classes. (B) represent and assess the validity of elementary inferences with the help of Boolean Algebra of classes. (C) represent but not assess the validity of elementary inferences with the help of Boolean Algebra of classes. (D) assess but not represent the validity of elementary inferences with the help of Boolean Algebra of classes.

Description : Venn diagram is a kind of diagram to (A) represent and assess the truth of elementary inferences with the help of Boolean Algebra of classes. (B) represent and assess the validity of ... but not represent the validity of elementary inferences with the help of Boolean Algebra of classes.

Last Answer : (B) represent and assess the validity of elementary inferences with the help of Boolean Algebra of classes.

A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave

Description : A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave 

Last Answer : (C) Convex 

compiler optimization, operator strength reduction uses mathematical identities to replace slow math operations with faster operations. Which of the following code replacements is an illustration of operator strength reduction? (A) Replace P + P by 2 * P or Replace 3 + 4 by 7. (B) Replace P * 32 by P<<5 (C) Replace P * 0 by 0 (D) Replace (P<<4) – P by P * 15

Description : compiler optimization, operator strength reduction uses mathematical identities to replace slow math operations with faster operations. Which of the following code replacements is an illustration of operator strength reduction? (A) Replace P + ... * P or Replace 3 + 4 by 7. (B) Replace P * 32 by P

Last Answer : (B) Replace P * 32 by P

Find the false statement: (A) The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999). (B) A weak relationship occurs when two relationship types are linked by either Event-Precedent sequence or Condition-Precedent sequence (C) Conceptual model is not accurate representation of "Universe of interest". (D) Ternary, Quaternary and Quintary relationships are shown through a series of application scenario's and vignette's

Description : Find the false statement: (A) The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999). (B) A weak relationship occurs when two ... Ternary, Quaternary and Quintary relationships are shown through a series of application scenario's and vignette's

Last Answer : (C) Conceptual model is not accurate representation of "Universe of interest".

State true or false. i) The degree of root node is always zero. ii) Nodes that are not root and not leaf are called as internal nodes. A) True, True B) True, False C) False, True D) False, False

Description : State true or false. i) The degree of root node is always zero. ii) Nodes that are not root and not leaf are called as internal nodes. A) True, True B) True, False C) False, True D) False, False

Last Answer : C) False, True

In homogenous coordinate system (x, y, z) the points with z = 0 are called (A) Cartesian points (B) Parallel points (C) Origin point (D) Point at infinity

Description : In homogenous coordinate system (x, y, z) the points with z = 0 are called (A) Cartesian points (B) Parallel points (C) Origin point (D) Point at infinity

Last Answer : (D) Point at infinity

Once upon a time, in a temple, there were three deities: Truth, Lie and Wisdom. The Truth Deity always told the truth. The Lie Deity always told the lie. The Wisdom Deity sometimes told the truth, sometimes told the lie. Unfortunately, those three deities looked exactly the same, so that no one could distinguish them. One day, a sage came by and he differentiated them by the following trick: He asked the deity sitting on the left: 'Who is the middle deity?'- 'Truth', said the deity. He asked the deity sitting in the middle: 'Who are you?'- 'Wisdom', replied the deity. He asked the deity sitting on the right: 'Who is the middle deitie?'- 'Lie', the deity answered.How could the sage distinguish the three deities? -Riddles

Description : Once upon a time, in a temple, there were three deities: Truth, Lie and Wisdom. The Truth Deity always told the truth. The Lie Deity always told the lie. The Wisdom Deity sometimes told the ... the middle deitie?'- 'Lie', the deity answered.How could the sage distinguish the three deities? -Riddles

Last Answer : The left deity is Wisdom; the middle one is Lie, and the right one is Truth. Explain: The left deity (L) said that the middle one (M) is Truth; therefore, L cannot be Truth (because there cannot be two ... cannot be Truth. Thus, R is Truth. According to him, M is Lie and as a result, L is Wisdom.

What type of gate is represented by the output Boolean expression R T Å ?

Description : What type of gate is represented by the output Boolean expression R T Å ?

Last Answer : Exclusive NOR (X-NOR).

What is the output Boolean expression for an AND gate with A and B as inputs when the B input is inverted?

Description : What is the output Boolean expression for an AND gate with A and B as inputs when the B input is inverted?

Last Answer : AB

What is the output Boolean expression for a NOR gate with R and T as inputs?

Description : What is the output Boolean expression for a NOR gate with R and T as inputs?

Last Answer : (R +T)’

What is the output Boolean expression for a NAND gate with inputs A, B, and C?

Description : What is the output Boolean expression for a NAND gate with inputs A, B, and C?

Last Answer : C B A

Write the Boolean expression for an OR gate having G, K

Description : Write the Boolean expression for an OR gate having G, K

Last Answer : . f = G+K+L.

What is the Boolean expression for the output of an AND gate that has R and S as inputs?

Description : What is the Boolean expression for the output of an AND gate that has R and S as inputs?

Last Answer : f = RS.

Karnaugh map is used for the purpose of (A) Reducing the electronic circuits used. (B) To map the given Boolean logic function. (C) To minimize the terms in a Boolean expression. (D) To maximize the terms of a given a Boolean expression.

Description : Karnaugh map is used for the purpose of (A) Reducing the electronic circuits used. (B) To map the given Boolean logic function. (C) To minimize the terms in a Boolean expression. (D) To maximize the terms of a given a Boolean expression.

Last Answer : (C) To minimize the terms in a Boolean expression.

Write simple example of Boolean expression for SOP and POS.

Description : Write simple example of Boolean expression for SOP and POS. 

Last Answer : SOP form:

As defined in physics, work is: w) a scalar quantity x) always a positive quantity y) a vector quantity z) always zero

Description : As defined in physics, work is: w) a scalar quantity x) always a positive quantity y) a vector quantity z) always zero

Last Answer : ANSWER: W -- A SCALAR QUANTITY

Which of the following statement is true? i) An address with all bits 1 is interpreted as all networks or all hosts. ii) The class A network 128.0.0.0 is defined as the loopback network. A) i only B) ii only C) Both A and B D) None of the above

Description : Which of the following statement is true? i) An address with all bits 1 is interpreted as all networks or all hosts. ii) The class A network 128.0.0.0 is defined as the loopback network. A) i only B) ii only C) Both A and B D) None of the above

Last Answer : A) i only

Which of the following pairs of ions is more stable? (a) `CH_(3)CH_(2)O^(Ө)and CH_(2)=underset("(II)")(CH)-O^(Ө)` (b) `(CH_(3))_(2)underset("(I)")over

Description : Which of the following pairs of ions is more stable? (a) `CH_(3)CH_(2)O^(Ө)and CH_(2)=underset("(II)")(CH)-O^(Ө)` (b) `(CH_(3))_(2)underset("(I)")over

Last Answer : Which of the following pairs of ions is more stable? (a) `CH_(3)CH_(2)O^(Ө)and CH_(2)=underset("(II)" ... underset(..)O-CH=CH-CH=overset(o+)"N"Me_(2)`

Which of the following pairs of ions is more stable? (a) `CH_(3)CH_(2)O^(Ө)and CH_(2)=underset("(II)")(CH)-O^(Ө)` (b) `(CH_(3))_(2)underset("(I)")over

Description : Which of the following pairs of ions is more stable? (a) `CH_(3)CH_(2)O^(Ө)and CH_(2)=underset("(II)")(CH)-O^(Ө)` (b) `(CH_(3))_(2)underset("(I)")over

Last Answer : Which of the following pairs of ions is more stable? (a) `CH_(3)CH_(2)O^(Ө)and CH_(2)=underset("(II)" ... underset(..)O-CH=CH-CH=overset(o+)"N"Me_(2)`

`4M(s)+overset(Ө)(C)N(aq.)+2H_(2)O(aq.)+O_(2)(g)` `" " to 4[M(CN)_(2)]^(Ө)(aq.)+4overset(Ө)(O)H(aq.)

Description : `4M(s)+overset(Ө)(C)N(aq.)+2H_(2)O(aq.)+O_(2)(g)` `" " to 4[M(CN)_(2)]^(Ө)(aq.)+4overset(Ө)(O)H(aq.)

Last Answer : `4M(s)+overset(Ө)(C)N(aq.)+2H_(2)O(aq.)+O_(2)(g)` `" " to 4[M(CN)_(2)]^(Ө)(aq.)+4overset(Ө)(O)H(aq.) A ... 2)` D. `[Ag(CN)_(2)]^(-),[Zn(CN)_(4)]^(-2)`