Prove that in a finite graph, the number of vertices of odd degree is always even.

How many minimum spanning tress does the following graph have? Draw them (Weights are assigned to the edges).

If the proposition $$\neg p \Rightarrow q$$ is true, then the truth value of the proposition $$\neg p \vee \left( {p \Rightarrow q} \right)$$ where $$'\neg '$$ is negation, $$' \vee '$$ is inclusive or and $$' \Rightarrow '$$ is implication, is

The probability that a number selected at random between $$100$$ and $$999$$ (both inclusive ) will not contain the digit $$7$$ is