The sum of two odd integers is ....

• A) odd
• B) even
• C)
• D)

If the square of an integer is even , then that integer is ……..

• A) neither even nor odd
• B) even
• C) odd
• D) either even or odd

Which of the following is not an irrational number?

• A) √4
• B) √2
• C) √3
• D) √5

If 'n' is an odd integer then '3n+2' is ....

• A) even
• B) odd
• C)
• D)

In inductive step of proof by mathematical induction, the assumption is made for ………..

• A) n=k+1
• B) n=k
• C) n=0
• D) n=1

Which of the followings is the factorial form of 5 . 4 ?

• A) 5/3
• B) 5!/3
• C) 5/3!
• D) 5!/3!

How many possible outcomes are there when a fair coin is tossed four times ?

• A) 8
• B) 16
• C) 32
• D) 4

(-1)^n = 1 for n=……….
(^ stands for power)

• A) 7
• B) 3
• C) 4
• D) 5

Proof by Contradiction is a/an........ method of proof.

• A) Direct
• B) Indirect
• C)
• D)

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

• A) 1=1(2(1)+1)
• B) 1=1(2(1)-1)
• C)
• D)

A non-zero integer d divides an integer n if and only if there exists an integer k such that ------------

• A) n = d + k
• B) n = d k
• C) n = d - k
• D) n = d / k

The sum of a rational and irrational number ……..

• A) is always a rational number
• B) none of these
• C) may or may not be rational number
• D) is always an irrational number

There are 5 Chinese books and 6 English books, a Student wants to select one optional book for both subject, total number of choices will be?

• A) 30
• B) 10
• C) 11
• D) 15

To prove by mathematical induction for
1+2+3+…….+n=(n)(n+1)/2 for all positive integers, the basis step is __________.

• A) 1+2+3+……..+k=(k+1)(k+2)/2
• B) None of the above
• C) 1=(1)(1+1)/2
• D) 1+2+3+……..+k=(k)(k+1)/2

The sum of two integers is even when ……….

• A) one is zero and one is odd
• B) one is prime and one is composite
• C) both are even or both are odd
• D) one is even and one is odd

The word "algorithm" refers to a step-by-step method for performing some action.

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

The method of loop invariants is based on the principle
of _____.

• A) Division algorithm
• B) Mathematical induction
• C)
• D)

For every prime number n, n + 2 is prime.
Which of the following prime number disproves the above statement.

• A) n=3
• B) n=11
• C) n=5
• D) n=7

If one event can occur in ${n_1}$ ways, a second event can occur in ${n_2}$ ways, a third event can occur in ${n_3}$ ways, how ways all of the events can occur in the order?

• A) ${n_1} + {n_2} + {n_3}$
• B) ${n_1}.{n_2}.{n_3}$
• C)
• D)

$${\text{The}}\,{\text{sequence}}\,1 + 2 + 3 + 4 - - - - - - + n\,{\text{is}}\,{\text{equal}}\,{\text{to}}\,\_\_\_\_\_\_\_\,.$$

• A) $$\frac{{{n^2}}}{2}$$
• B) $$\frac{{n\left( {n + 1} \right)}}{2}$$
• C) $$\frac{{n\left( {n + 1} \right)\left( {2n + 1} \right)}}{6}$$
• D) $$\frac{{{n^2}{{\left( {n + 1} \right)}^2}}}{4}$$