Documente Academic
Documente Profesional
Documente Cultură
t = _______.
3. The number of edges incident on a vertex with self loops counted twice is called the ___________ of the vertex. 4. The true with n vertex has __________ edges.
5. The set of all possible outcomes of a random experiment is called the
b) A=-A
c) A=
d) A=-
q) = __________________.
~q d) ~p
8. A graph in which all vertices are of equal degree is called ____________ graph. a) Complete b) Connected c) Simple d) Regular
9. A vertex with minimum eccentricity in a graph G is called a _____________ of G.
a) radius b) diameter c) centre d) root 10. The mean and variance of the Poisson distribution are equal to ______________.
a)
b) npq
c)
d) 2
Section B
11. a) Prove that every square matrix can be expressed uniquely as the sum a symmetric and a skew symmetric matrix. (OR)
1-i 3 -i
12. a) Construct truth table for the connectives 1) conjunction 2) disjunction 3) Implication 4) Negation (OR) b) Simplify the following statements (i) p (p
q)
(ii) ~( p
q) ^ (~p
q)
13. a) A graph G is disconnected if and only if its vertex set V can be partitioned into two non empty disjoint subsets V1 & V2 such that there exists no edge in G whose on end vertex is in subsets V1 and the other in subset V2. b) Explain walk, path and circuits in an undirected graph with examples 14. a) Phone that A graph is a tree if it is minimally connected (OR) b) Explain Kruskals algorithm of finding shortest spanning tree in a graph . 15. a) A bag contains 3 red and 3 blue balls. 2 draws of 2 balls each are made. Find the chance that the first draw gives 2 red balls and the second draw 2 blue balls (a) if the balls are returned to the bag after the first draw. (b) if the balls are not returned. (OR) b)During the course of a day a machine turns out either 0,1, or 2 defective pens with probabilities 1/6,2/3 & 1/6 respectively. Calculate the mean value and the Variance of the defective pens produced by the machine in a day.
Section-C
16) Verify that the matrix A=
1 0 2 0 2 -1
0 0 -1 Satisfies its own characteristics equation and hence or otherwise obtain the value of A -1.
17) By means of truth table, show that p (q v r)=(p q) ^ (p r). 18) A simple graph with n vertices and k components can have atmost (n-k) (n-k+1)/2 edges. 19) Explain the various traversals of binary tree. 20) A lady buys a dozen eggs of which two turn out to be bad. She chooses four eggs to scramble for breakfast. Find the chance that she chooses. a) all good eggs. b) three good and one bad. c) two good and two bad. d) atleast one bad egg.