Find the Boolean expression in the DNF form for the function defined in tabular form below:
| x | y | z | |
| 1 | 0 | 1 | 1 |
| 0 | 1 | 0 | 0 |
| 0 | 0 | 1 | 1 |
| 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 |
| 0 | 1 | 1 | 1 |
| 1 | 1 | 0 | 1 |
| 0 | 0 | 0 | 0 |
Given the truth table, the function is 1 for the following inputs:
* x=1, y=0, z=1
* x=0, y=0, z=1
* x=1, y=1, z=1
_________ _________ ________ _________ _____ ___ ___ __________ ____ _____ ___ ____.
____ ________ ______ _________ _____ ______ _____ _____.
______ ______ ______ ____ ______ ________ __________ ______ ________ ____.
____ _____ ____ ________ ___ ___ __________ _________ ______ ______ ____ _______.
____ _______ ________ ______ ______.
___ _______ ____ ____ _______ __________ _______ _______ ____.
________ ________ ________ _________ ______ ____.
___ ___ ____ ____ _____ ___.
____ ________ __________ ___ __________ _________.
_____ __________ ___ ______ ________ _____ _____ _____ _______ _____ _________.
_____ _____ ____ _________ ________ _________ _____ __________ ____ ________ ________.
_____.
Get Full Answer on WhatsApp
Check whether the following statements are true or not. Justify your answers with a short proof or a counter example
i) If the contrapositive of a statement is true, then the statement itself is also true.
ii) is a linear homogeneous recurrence relation.
iii) A particular solution of the recurrence relationhas the form
iv) There exists a boolean expression in variables
v) If a dice is rolled thrice, then the probability of getting a 6 each time is
vi) Every odd cycle has the same chromatic and edge chromatic numbers.
vii) Every Eulerian graph is Hamiltonian.
viii) 3 4 S gives the number of ways in which any 3 objects can be placed in any 4 boxes.
ix) There exists a self-complementary planar graph on 5 or more vertices.
x) The number of partitions of 6 is 10.
A box contains 6 red and 4 green balls. Four balls are selected from the box at random. What is the probability that two of the selected balls will be red and two will be green?
Is there a 4-regular graph on 7 vertices? Justify your answer.
There are about 77 crore ways to arrange the letters of the word “COMBINATORICS”. Count the exact number of such ways.
Solve the recurrence relation:
using generating function technique. Also find 5 a using your answer.
Is the complement of the Peterson graph planar? Justify your answer.
How many numbers from 0 to 759 are not divisible by either 3 or 7?