Set of prime numbers is finite.

• A) False
• B) True
• C)
• D)

If the Basis step is true, then there is no need to go further in the proof by Mathematical Induction.

• A) False
• B) True
• C)
• D)

which of the followings is the correct option for 9!/0! ?

• A) 1
• B) 9!
• C) 9
• D) 0

A student has 3 optional courses in mathematics and 5 optional courses in physics, how many total choices for him to take one course?

• A) 35
• B) 7
• C) 9
• D) 8

The first step of describing algorithms formally is ?

• A) The output variable names, labeled by data type.
• B) An end statement.
• C) The name of the algorithm, together with a list of input and output variables.
• D) The statements that make the body of the algorithm.

GCD of (9, 27) will be ______.

• A) 27
• B) 3
• C) 5
• D) 9

${\text{The}}\,{\text{statement}}\,{n^2} > n + 3\,{\text{is}}\,{\text{true}}\,{\text{when}}\,\_\_\_\_\_\,{\text{.}}$

• A) $n \geqslant 1$
• B) $n \geqslant - 1$
• C) $n \geqslant 2$
• D) $n \geqslant 3$

The product of any two consecutive positive integers is divisible by 2.

• A) False
• B) True
• C)
• D)

A proof by …………is based on the logical equivalence between a statement and its contrapositive.

• A) contraposition
• B) contradiction
• C) mathematical induction
• D) counter example

To prove by mathematical induction for 1+5+9+----------+(4n-3)=n(2n-1) for all positive integers,the inductive step is true for n=k is _________.

• A) 1+5+9+-----------+(4k-3)=k(2k+1)
• B) 1+5+9+-----------+(4k+3)=k(2k+1)
• C) 1+5+9+-----------+(4k-3)=k(2k-1)
• D) 1+5+9+-----------+(4k+3)=k(2k-1)

'Reductio ad absurdum' is another name of ----------

• A) proof by contrapositive
• B) Direct Method of proof
• C) proof by contradiction
• D) None of these.

The ---- of a predicate variable is the set of all values that may be substituted in place
of the variable.

• A) Range
• B) Domain
• C)
• D)

A proof by …………….. is based on the fact that either a statement is true or it is false but not both.

• A) mathematical induction
• B) superposition
• C) contraposition
• D) contradiction

Basis and Inductive steps are part of proof by …………

• A) mathematical induction
• B) contradiction
• C) superposition
• D) contraposition

The quantity a - d · q equals the?

• A) Remainder
• B) None
• C) Quotient
• D) Divisor

Combination is used when we have to select 'k' elements from a set of 'n' elements with the following properties.

• A) Order matters and repetition is allowed
• B) Order does not matter and repetition is allowed
• C) Order does not matter and repetition is not allowed
• D) Order matters and repetition is not allowed.

The predicate describing the initial state is
called _____.

• A) Out put variables
• B) pre-condition of the algorithm
• C) post-condition of the algorithm
• D) None

P(2,2)=…………

• A) 2!
• B) 4!
• C) 1
• D) 0

Proof by ……..uses the equivalence p →q ≡(p∧~q) →c

• A) superposition
• B) contradiction
• C) mathematical induction
• D) contraposition

There are three bus lines between A and B, and two bus lines between B and C.
Find the number of ways a person can travel by bus from A to C by way of B ?

• A) 13
• B) 6
• C) 11
• D) 5