Scribd
Upload
113 views2 pages

Test 2 (6:00pm, 29th September, 2021) : MATHS135-21B Discrete Structures

The document provides instructions and questions for a discrete mathematics test. It is a 2 hour test worth 60 total marks. It contains 6 questions testing various concepts in discrete mathematics including binary relations, digraphs, equivalence relations, partial orders, modular arithmetic, and number theory. Students are allowed to use notes and a basic calculator, but no internet access or communication during the test. Showing all work is required and cheating will be reported to the university disciplinary committee.

Uploaded by

David Su
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
113 views2 pages

Test 2 (6:00pm, 29th September, 2021) : MATHS135-21B Discrete Structures

The document provides instructions and questions for a discrete mathematics test. It is a 2 hour test worth 60 total marks. It contains 6 questions testing various concepts in discrete mathematics including binary relations, digraphs, equivalence relations, partial orders, modular arithmetic, and number theory. Students are allowed to use notes and a basic calculator, but no internet access or communication during the test. Showing all work is required and cheating will be reported to the university disciplinary committee.

Uploaded by

David Su
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/ 2

-1-

Test 2 (6:00pm, 29th September, 2021)


MATHS135-21B Discrete Structures
The test is scheduled to last 2 hours. Attempt all questions – marks are as indicated. Total
marks: 60. It’s okay to use a calculator for arithmetic but please show all your working.
The test is 2 hours duration. You must stop working at 8:00pm. Attempt all six questions
– marks are as indicated. Total marks: 60. Upload a single pdf of your scanned solutions
via Moodle (under Test 2) before 8:15pm. Keep your camera on until your pdf is uploaded.
Rules for the test: The test is open book. This includes: anything on the MATHS135
Moodle page; any prepared notes; a dictionary (on-line is okay); basic calculator functions.
This does not include: Use of Google or other internet search engines; any communication
with other persons; any programs or software that might help you. Please show all working.
The test must be hand-written, unless permission has been granted otherwise. Hand-writing
on a tablet or other device is allowed. In the event of a technical mishap do not panic, just
email me what happened as soon as possible - [email protected]
Cheating can be proven - any evidence of cheating will be forwarded to the
University Disciplinary Committee.

1. For the following relations R1 and R2 , determine whether they are (i) reflexive; (ii)
symmetric; (iii) anti-symmetric and (iv) transitive. Explain your answer in each case.
[8 marks]

(a) X is the set of people in the world. For each a, b ∈ X, (a, b) ∈ R1 if and only if a
and b are sisters.
(b) For each a, b ∈ Z, (a, b) ∈ R2 if and only if ab ≥ 0.

2. Let X = {a, b, c, d} and suppose R is the binary relation given by

R = {(a, b), (b, b), (b, c), (c, a), (c, d), (d, d)}.

(a) Draw a digraph for R. [1 mark]


(b) Assuming a < b < c < d, give the matrix MR corresponding to the relation R. [1
mark]
(c) Using the matrix MR , determine whether R is anti-symmetric. [2 marks]
[3]
(d) Using the matrix MR , give the number of paths from a to d of length 3. [5 marks]
(e) Using Warshall’s Algorithm, determine the matrix for R+ . [5 marks]
(f) Using the matrix for R+ , determine whether there is a path (i) from d to b; (ii)
from c to itself. [2 marks]

TURN OVER
-2-

3. Let X = {a, b, c, d} and let R be the binary relation

R = {(a, a), (a, c), (a, d), (c, a), (b, b), (c, d), (c, c), (d, a), (d, c), (d, d)}

defined on X.

(a) Assuming a < b < c < d, give the matrix MR corresponding to the relation R. [1
mark]
(b) Using the matrix MR , determine whether R is reflexive, symmetric and transitive.
[6 marks]
(c) Explain why R is an equivalence relation. [1 mark]
(d) What is [a]R . [1 mark]
(e) Give the partition of X into the equivalence classes determined by R. [2 marks]

4. On the set X = {r, s, t, u, v}, a partial order ≤ is defined so that the Hasse diagram is
as follows:

r u

s t

Give the definition of ≤ as a set of ordered pairs. [4 marks.]

5. Show that for any integer n, the expression n(n − 2)(n + 2) is divisible by 3. [4 marks]

6. Give the multiplication table for Z5 . [3 marks]

(a) Using your answer, find out the inverse of each element of Z5 (where this is
defined) [2 marks].
(b) Either solve 5x ≡ 3 (mod 5) or explain why there is no solution. [3 marks]
(c) Either solve 4x ≡ 2 (mod 10) or explain why there is no solution. [3 marks]
(d) Simplify 20212021 (mod 5). Show your working. [3 marks]
(e) Simplify 32018 (mod 5). Show your working. [3 marks]

You might also like