Higher Study | Engineering Mathematics | Set Theory & Algebra

How many onto (or surjective) functions are there from an n-element (n ≥ 2) set to a 2-element set?
Suppose X is a set of size n. How many pairs of sets (A,B) exist such that, A ⊆ B ⊆ X .
Consider the following recurrence: f(1) = 1; f(2n) = 2f(n) - 1, for n ≥ 1; f(2n + 1) = 2f(n) + 1, for n ≥ 1. Then, which of the following statements is/are TRUE? 
Consider the binary relation R = {(x, y), (x, z), (z, x), (z, y)} on the set {x, y, z}. Which of the following is TRUE?
Which of the following Boolean rules is correct?
Which of the following is a functionally complete set of gates? (i) NAND (ii) NOT
Which term is redudent in the expression AB+A’C+BC?
Which of the following is not a valid expression of Boolean Algebra?
Ads