0% found this document useful (0 votes)
13 views19 pages

COMP1210-Test 1 - Summer - 2024

Uploaded by

Avalei March
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
13 views19 pages

COMP1210-Test 1 - Summer - 2024

Uploaded by

Avalei March
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

COMP1210: MATHEMATICS FOR COMPUTING

THE UNIVERSITY OF THE WEST INDIES


DEPARTMENT OF COMPUTING

INCOURSE TEST 1

Date and Time: Thursday, June 27, 2024 @ 9:00 am

Duration: 1 hour and 30 minutes

INSTRUCTIONS TO CANDIDATES:
This paper has 19 page(s) and 20
multiple choice questions.

Select the option of your choice.

One mark is given for each question.


The maximum score is 20 percent.

Do All Questions. Calculators ARE allowed.

1
Question 1

Which of the following statements is NOT a proposition?

(A) Ice floats in water.

(B) Do your homework.

(C) China is in Europe.

(D) 2 + 2 = 5.

(E) The COMP1210 test 1 is relatively difficult.

Question 2

Which of the following statements is NOT logically equivalent to


p⇒q:

(A) ∼ q ⇒ ∼ p

(B) ∼ p ∨ q

(C) ∼ (p ∧ ∼ q)

(D) ∼ q ∨ p

(E) None of the options

2
Question 3

An equivalent formulation of the statement p ⇒ q is

(A) p if q

(B) q only if p

(C) q when p

(D) p iff q

(E) A necessary condition for q is p

3
Question 4

An equivalent formulation of the statement:

“Jim plays Lawn Tennis only if he played Table Tennis or Chess,


” is:

(A) If Jim plays Table Tennis or Chess, then he played Lawn


Tennis

(B) If Jim plays Table Tennis, then he played Lawn Tennis or


Chess

(C) If Jim plays Lawn Tennis, then he played Table Tennis or


Chess

(D) Jim may play Lawn Tennis if he played Table Tennis or


Chess

(E) Jim plays Lawn Tennis if and only if he played Table Tennis
or Chess

4
Question 5

Given the expression (∼ q ) ⇒ p. The negation is

(A) q ∧ p

(B) ∼ q ∨ ∼ p

(C) ∼ q ∧ ∼ p

(D) q ⇒ ∼ p

(E) ∼ p ⇒ q

5
Question 6

The negation of the statement

∀ x ∈ R ∃ y ∈ R such that if x > y then 0 ≤ y 2 < x2

is

(A) ∃ x ∈ R ∀ y ∈ R such that if x ≤ y then x2 ≤ y 2 < 0

(B) ∃ x ∈ R ∀ y ∈ R such that x ≤ y and y 2 < 0 or


y 2 ≥ x2

(C) ∃ x ∈ R ∀ y ∈ R such that x ≤ y or 0 ≤ y 2 < x2

(D) ∃ x ∈ R ∀ y ∈ R such that x > y and y 2 < 0 or


y 2 ≥ x2

(E) ∃ x ∈ R ∀ y ∈ R such that x > y and x2 ≤ y 2 < 0

6
Question 7

The converse of the statement:

“If I study then I will pass COMP1210,” is:

(A) If I do not pass COMP1210 then I did not study

(B) If I pass COMP1210 then I studied

(C) If I pass COMP1210 then I did not study

(D) If I do not study then I will not pass COMP1210

(E) None of the options

7
Question 8

Consider the real numbers


x, y and z.
Which of the following is FALSE?

(A) ∀ x and ∀ y, ∃ z such that x y = z

(B) ∀ x and ∀ y, ∃ z such that x z = y

(C) ∃ x such that ∀ y, ∃ z such that x + y = z

(D) ∀ x, ∃ y and ∃ z such that z > y implies that z > x + y

(E) None are false

8
Question 9

”There is an integer whose cube is an odd number,” in symbolic


form is

(A) ∃ x ∈ Z such that x3 = 2p + 1, p ∈ Z

(B) ∀ x ∈ Z, x3 = 2p + 1, p ∈ Z

(C) ∃ x ∈ Z such that x3 = 2p + 1, p ∈ R

(D) ∃ x ∈ Z such that x3 = 2p + 1, p ∈ N

(E) ∃ x ∈ Z such that x3 = 2p, p ∈ Z

Question 10

Let D = {2, 3, 4}.

Which of the following is TRUE?

(A) ”∀ x ∈ D, x2 ≥ x”

(B) ”∀ x ∈ R, x2 ≥ x”

(C) ”∃ x ∈ D such that x2 = x”

(D) ”∃ x ∈ D such that x2 ≤ x”

(E) ALL OF THE OPTIONS


9
Question 11

In symbolic form, the statement

”For every girl in set G there is a boy in set B ” is

(A) ∀ g ∈ G, ∀ b ∈ B

(B) ∃ g ∈ G, ∃ b ∈ B

(C) ∀ g ∈ G, ∃ b ∈ B

(D) ∃ g ∈ G, such that b ∈ B

(E) ∃ g ∈ G, ∀ b ∈ B

10
Question 12

Given the following statements:

(i) To prove ”∀ x, P (x)” : show that P (x) is TRUE for all x in


its domain

(ii) To prove ”∀ x, P (x)” : Show that P (x) is false for all x in


its domain

(iii) To prove ”∃ x, P (x)” : find an x for which P (x) is true

(iv) To disprove ”∀ x, P (x)” : find a counter example. That is,


find an x for which P (x) is false

(v) To prove ”∃ x, P (x)” : show that P (x) is false for all x

(vi) To disprove ”∃ x, P (x)” : show that P (x) is false for all x

Which of the above statements are TRUE?

(A) (i), (ii), (iii) and (iv) only

(B) (i), (iii), (iv) and (v) only

(C) (i), (iii) and (vi) only

(D) (i), (iii), (iv), and (vi) only

(E) (i), and (iv) only


11
Question 13

In symbolic form, using ∃ or ∀, the statement


“ The equation ex = 2 has only one real solution in the interval
( 0, 2 ) , ” is

(A) ∀ x ∈ ( 0, 2 ), ex − 2 = 0

(B) ∃ x ∈ R such that ex − 2 = 0

(C) ∃ x ∈ ( 0, 2 ) such that ex − 2 = 0

(D) ∀ x ∈ R, ex − 2 = 0

(E) ∀ x ∈ ( 0, 2 ), ex − 2 6= 0

12
Question 14

Which of the following is TRUE?

An argument is said to be valid if

(A) it leads to a contradiction

(B) in the cases where the premises are true at least one
conclusion must be true

(C) all the premises are true and some of the conclusions

(D) at least one of the premise is true and also the conclusion

(E) it leads to a tautology

13
Question 15

Every prime number is odd.

Which of the following is TRUE to best prove or disprove


the statement above?

(A) This statement will have to be proved using direct proof

(B) This statement will have to be proved using the


contrapositive implication

(C) This statement will have to be disproved using a


counterexample

(D) This statement will have to be proved using the


method of Induction

(E) ALL OF THE OPTIONS

14
Question 16

Suppose x ∈ Z. If 31x + 5 is even, then x is odd.

Which method of proof would be most suitable/appropriate to prove


the statement above?

(A) Contrapositive implication

(B) Direct proof

(C) Contradiction

(D) Counter example

(E) None of the options

15
Question 17

For the inductive steps, which of the following is TRUE?

(A) Base case : n = 1, Assumption case : n = k,


Implication case : n = k + 1

(B) Base case : n = 2, Assumption case : n = k,


Implication case : n = k + 1

(C) Base case : n = 3, Assumption case : n = k,


Implication case : n = k + 1

(D) Base case : First value of n for which the argument holds
true, Assumption case : n = k,
Implication case : n = k + 1

(E) NONE OF THE ABOVE OPTIONS

16
Question 18

Given the statement


(13)n − 1 is divisible by 12, ∀ n ∈ N.

If t ∈ Z , then the solution for the implication case would be:

(A) It is true for n = k + 1 since (13)k+1 − 1 = 12( 13t + 1 ),


where 13t + 1 ∈ Z

(B) It is true for n = k + 1 since (13)k+1 − 1 = 12( 13t − 1 ),


where 13t − 1 ∈ Z

(C) It is true for n = k + 1 since (13)k+1 = 12( 13t + 1 ),


where 13t + 1 ∈ Z

(D) It is true for n = k + 1 since (13)k+1 − 1 = 12( 13t + 1 ),


where 13t + 1 ∈ Z+

(E) NONE OF THE ABOVE OPTIONS

17
Question 19

Given that
3
3 + 6 + 9 + 12 + · · · + 3n = n(n + 1),
2
∀ n ∈ Z+.

In terms of the summation, which of the following is TRUE:

n
X 3
(A) 3 + 6 + 9 + 12 + · · · + 3n = i(i + 1)
i=1
2

n
X
(B) 3 + 6 + 9 + 12 + · · · + 3n = 3i
i=1

k
X
(C) 3 + 6 + 9 + 12 + · · · + 3n = 3i
i=1

n
X
(D) 3 + 6 + 9 + 12 + · · · + 3n = 3n
i=1

(E) CANNOT BE DETERMINED

18
Question 20

Given that
n(n + 1)(2n + 7)
1(3) + 2(4) + 3(5) +4(6) + · · · + n(n+2) = ,
6
∀ n ∈ N.

The expression for the implication case would be:


 
Xk
(A)  j (j + 2)  + (k + 1)
j=1

 
k
X
(B)  n (n + 2)  + (k + 1) (k + 3)
j=1

 
k+1
X k(k + 1)(2k + 7)
(C)  j (j + 2)  +
j=1
6

 
k
X
(D)  j (j + 2)  + (k + 1) (k + 3)
j=1

(E) NONE OF THE ABOVE OPTIONS

END OF TEST
19

You might also like