UGC NET June-2019 CS Paper-2
November 27, 2023UGC NET June-2019 CS Paper-2
November 27, 2023UGC NET June-2019 CS Paper-2
|
Question 16
|
How many different Boolean functions of degree n are there?
|
22n
|
|
|
(22)2
|
|
|
22n-1
|
|
|
2n
|
Question 16 Explanation:
There are 2 n different n-tuples of 0s and 1s.
A Boolean function is an assignment of 0 or 1 to each of these 2 n different n-tuples.
Therefore, there are 2 2^n different Boolean functions.
Example: How many different Boolean functions of degree 4 are there?
Solution: 16
A Boolean function is an assignment of 0 or 1 to each of these 2 n different n-tuples.
Therefore, there are 2 2^n different Boolean functions.
Example: How many different Boolean functions of degree 4 are there?
Solution: 16
Correct Answer: A
Question 16 Explanation:
There are 2 n different n-tuples of 0s and 1s.
A Boolean function is an assignment of 0 or 1 to each of these 2 n different n-tuples.
Therefore, there are 2 2^n different Boolean functions.
Example: How many different Boolean functions of degree 4 are there?
Solution: 16
A Boolean function is an assignment of 0 or 1 to each of these 2 n different n-tuples.
Therefore, there are 2 2^n different Boolean functions.
Example: How many different Boolean functions of degree 4 are there?
Solution: 16