20222CMPSUFMATCA

SCHOOL OF COMPUTING

MATHEMATICS FOR COMPUTING

Level 4 Students – Full Time - Main Exam

Spring Term 2022

EXAMINATION FOR ALL BSc COMPUTING PROGRAMMES

EXAM CODE: 20222CMPSUFMATCA

RECOMMENDED DURATION: 2 Hours *

SUBMISSION WINDOW: 4 Hours from Release **

MATERIALS PERMITTED: This is an open book examination. You may

use sources of information to aid answering
exam questions. Examples of sources of
information may include textbooks, notes,
online journals etc.

MATERIALS PROVIDED: None

SCHOOL SPECIFIC PAPER Students MUST answer ALL [FOUR]

INSTRUCTIONS: questions. To get full marks, your answers
must be well-referenced and well-explained.

The answers must be tidy and clear.

MARKS: As detailed in the paper.

Page 1 of 6
GENERAL INSTRUCTIONS:

*Candidates are not expected to spend any longer than the recommended duration
in preparing their answers for submission. Suggested/maximum word counts,
where appropriate, are indicated alongside questions.

**Candidates must submit their work within 4 hours from the published examination
commencement time; late submissions will not be accepted.

1. Please ensure you read and follow the ‘Directions to Candidates’ on the front
cover of the Answer Book.

2. All examinations will be marked anonymously, so please ensure you fold

down the right hand cover of the Answer Book cover, after you have written
your Name and student ID.

3. All Answer Books should be submitted to the Invigilator at the end of the
exam.

4. By completing and submitting your exam answers, you are agreeing that you
have read the University of Buckingham’s University of
Buckingham’s Academic Integrity Policy and Procedures and that your
submitted work complies with these regulations, does not contain any
plagiarised material, and is entirely your own work.

5. Please also refer to: Examination Rules for Candidates within the
Regulations Handbook:
https://www.buckingham.ac.uk/about/handbooks/regulations-handbook/ for
further guidance.

6. Be tidy: marks may be deducted for untidy work.

Page 2 of 6
Question 1 (100 marks).

(a) i. Define what is meant by a “tautology” in propositional logic;

ii. Suppose p and q are two propositions. Use a truth table to
verify q → (p → q) is a tautology;
iii. Suppose D is a finite domain with D = {d1 , · · · , dn }. Let
P (x) be a predicate where x takes values from the domain D.
Consider the following pseudocode:

for i = 1 to n
if ¬P (di )
return True
break
return False

Which logical formula

∀x¬P (x) or ∃x¬P (x).
is determined by the pseudocode above?
iv. Assume P (x, y) is a predicate with two variables x and y.
Provide a counterexample for the statement below
“∀x∃yP (x, y) and ∃y∀xP (x, y) are logically equivalent”.
[Hint: You may consider a partial order on a finite set as your
binary predicate.]
(50 marks)
(b) i. Define what is meant by a “well-ordered set”.
ii. Which of the following sets are well-ordered? Justify your
answer carefully.
A. {x : x ∈ Z, x > −2};
B. {x : x ∈ Q, x > 0}.
iii. State the induction rule for N;
iv. Use the induction rule to prove the following for n ∈ N where
n > 0:
1 1 1 1 2n − 1
+ + + ··· + n = .
2 4 8 2 2n
(50 marks)

3
Question 2 (100 marks).

(a) Suppose X is a non-empty set and consider the following binary

relation R on P(X) where P(X) is the powerset of X: for A, B ∈
P(X) define
A R B if A ⊆ B;
equivalently, using a different notation (A, B) ∈ R if A ⊆ B.
i. Show the relation R is transitive;
ii. Show the relation R is not an equivalence relation.
(20 marks)
(b) Suppose X ⊆ R and f : X → R is a function. Define carefully
what is meant by “function f is continuous”.
(10 marks)
(c) Provide an example for a function that is continuous but not dif-
ferentiable in exactly two points.
(20 marks)
(d) Recall given D ⊆ R the characteristic function χD is defined as
follows (
1 if x ∈ D ,
χD (x) =
0 if x ∈
/D.
Let A = [−5, 5], B = [−2, −1] and C = N where N = {0, 1, 2, · · · }.
In each item below determine the set of points that the function
is not continuous at and justify carefully your answer.
i. χC ;
ii. χB ◦ χC ;
iii. χA + χB .
(30 marks)
(e) Let I be the interval [−2, 1]. Consider the following function

 2
x + a if x > 1,
f (x) = |x| − χI (x) if x ∈ I,


x+b if x < −2.
Find values for a and b for which f (x) becomes continuous.

(20 marks)

4
Question 3 (100 marks)

(a) Let X ⊆ R and assume f : X → R is a function that is defined

for arbitrary large values of R.
i. Define carefully what is meant by

lim f (x) = b;
x→∞

where b ∈ R ∪ {∞}.
[Hint: You may deal with b ∈ R and b = ∞ separately.]
ii. Let f1 and f2 be two functions where f1 , f2 : N → R. Suppose
f1 (n) = n and f2 (n) = n3 . In each item below compute the
values of limits.
A. limx→∞ f11(x) ;
B. limx→∞ (f2 − f1 )(x);
f1 (x)
C. limx→∞ f2 (x)
.
(40 marks)
(b) Compute the derivation of functions below
2
i. g1 (x) = ex +2x+1 ;
ii. g2 (x) = sin(2x) cos(x2 ).
(30 marks)
(c) Compute the following integration
Z e
(log x)2
dx.
1 2x

[Hint: You may use substitution rule.]

(30 marks)

5
Question 4 (100 marks).

(a) Consider the following systems of linear equations:


 (
x1 − 3x2 + x3 =1
x1 − 3x2 = 1
1) 3x1 − 8x2 + 2x3 = 3 , 2) .

 3x1 − 8x2 = 3
2x1 − 5x2 + x3 =1

i. Create the matrix equation form of each of the systems above.

By the matrix equation form we mean the form Ax = b where
A is a matrix generated from the coefficients and x is the
vector of variables, accordingly;
ii. Compute the determinant of the coefficient matrices you cre-
ated for each system (1) and (2) in item (i);
iii. Solve the system of equations (2) using the inverse of the
coefficient matrix.
(50 marks)
(b) In each recurrence relation below first verify whether the recur-
rence relation is linear and homogeneous and second provide the
explicit formula for the recurrence relation.
i. (
an = 2an−1 + 1 for all n ≥ 1
a0 = 1.
ii. (
bn = 4bn−1 − 4bn−2 for all n ≥ 2
b1 = 6, b0 = 1.
(50 marks)