**1) Let A and B be any two arbitrary events then which one of the following is true ?**

- P( A intersection B) = P(A). P(B)
- P(A union B) = P(A) + P(B)
- P(AB) = P(A intersection B). P(B)
**P(A union B) >= P(A) + P(B)**

**2) If X and Y be the sets. Then the set ( X – Y) union (Y- X) union (X intersection Y ) is equal to?**

**X union Y**- X
^{c}union Y^{c} - X intersection Y
- X
^{c}intersection Y^{c}

**3) If G is an undirected planer graph on n vertices with e edges then ?**

- e<=n
**e<=2n**- e<=3n
- None of these

**4) Which of the following statement is false ?**

- G is connected and is circuitless
**G is connected and has n edges**- G is minimally connected graph
- G is circuitless and has n-1 edges

**5) Probability that two randomly selected cards from a set of two red and two black cards are of same color is ?**

- 1 / 2
**1 / 3**- 2 / 3
- None of these

**6) The number of circuits that can be created by adding an edge between any two vertices in a tree is ?**

- Two
**Exactly one**- At least two
- None

**7) In a tree between every pair of vertices there is ?**

**Exactly one path**- A self loop
- Two circuits
- n number of paths

**8) The minimum number of cards to be dealt from an arbitrarily shuffled deck of 52 cards to guarantee that three cards are from some same suit is ?**

- 8
- 3
**9**- 12

**9) Context free languages are closed under ?**

- union, intersection
- Intersection , complement
**union , kleene star**- Complement , kleene star

**10) Let R be a symmetric and transitive relation on a set A. Then ?**

- R is reflexive and hence a partial order
- R is reflexive and hence an equivalence relation
- R is not reflexive and hence not an equivalence relation
**None of above**