List of top Computer Science & Information Technology Questions on Discrete Mathematics

The tautology \[ \bigl(p \wedge (p \rightarrow q)\bigr) \rightarrow q \] is the basis of the following rule of inference:

Choose the correct statement about connected components.

How many different strings can be made by reordering the letters of the word SUCCESS?

What is the solution of the recurrence relation \[ a_n=6a_{n-1}-9a_{n-2} \] with initial conditions \[ a_0=1,\qquad a_1=6? \]

What is \(R^3\) of \[ R=\{(1,1),(2,1),(3,2),(4,3)\}? \]

How many relations are there on a set with \(3\) elements?

What is the Four Colour Theorem?

Which among the following represents idempotent law?

Let \(f\) and \(g\) be the functions from the set of integers to the set of integers defined by \[ f(x)=2x+3 \] and \[ g(x)=3x+2. \] What is the composition of \(f\) and \(g\)?

Suppose that there are eight runners in a race. The winner receives a gold medal, the second-place finisher receives a silver medal, and the third-place finisher receives a bronze medal. How many different ways are there to award these medals, if all possible outcomes of the race can occur and there are no ties?