adplus-dvertising
frame-decoration

Question

If F and G are Boolean functions of degree n. Then, which of the following is true?

a.

F ≤ F + G and F G ≤ F

b.

G ≤ F + G and F G ≥ G

c.

F ≥ F + G and F G ≤ F

d.

G ≥ F + G and F G ≤ F

Answer: (a).F ≤ F + G and F G ≤ F

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. If F and G are Boolean functions of degree n. Then, which of the following is true?

Similar Questions

Discover Related MCQs

Q. Match the following identities/laws to their corresponding name:

(a) x + x = x
x • x = x                      i. Dominance
(b) x + 0 = x
x • 1 = x                      ii. Absorption
(c) x + 1 = 1
x • 0 = 0                      iii. Idempotent
(d) x • (x + y) = x           iv. Identity

Codes:
     (a)  (b)  (c)  (d)

Q. How many different Boolean functions of degree 4 are there?

Q. 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)?

Q. Which one of the following is decimal value of a signed binary number 1101010, if it is in  2's complement form?

Q. A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein's conditions are satisfied on a pair wise basis; that is
P1 || P2 || P3 || ..... || Pk if and only if:

Q. The simplified function in product of sums of Boolean function F(W, X, Y, Z) = Σ(0, 1, 2, 5, 8, 9, 10) is

Q. If an integer needs two bytes of storage, then the maximum value of a signed integer is

Q. If an integer needs two bytes of storage, then the maximum value of unsigned integer is

Q. Negative numbers cannot be represented in

Q. X – = Y + 1 means

Q. The absorption law in Boolean algebra say that

Q. The number of 1’s present in the binary representation of

10 × 256 + 5 × 16 + 5 is

Q. The hexadecimal number equivalent to (1762.46)8 is

Q. (A + B)(AB)’ is equivalent to

Q. Encoding of data bits 0011 into 7-bit even Parity Hamming Code is

Q. What is decimal equivalent of BCD 11011.1100?

Q. The simplified form of the Boolean expression (X+Y+XY)(X+Z) is

Q. The answer of the operation (10111)2 * (1110)2 in hex equivalence is

Q. How many 1’s are present in the binary representation of

3 × 512 + 7 × 64 + 5 × 8 + 3

Q. The Boolean expression x’y’z+yz+xz is equivalent to: