DMTH137 Session 2 2017
Week 11 Tutorial Exercises : Extended Euclidean algorithm
Base Conversion, Congruences
1 Tutorial questions for you
This section contains the problems you should attempt at home
DMTH137 Session 2 2017
TH
We
13
7
e
Tu
k2
t
o
ria
So
lut
ls
ion
s
Week 2 Tutorial Exercises : Propositional Logic
1 Tutorial questions for you
This section contains the problems you should attempt at
DMTH137 Homework solutions from Week 6
prepared by the unit convenor
Due: Week 7
Marking notes 10 marks total. There are 7 marks for correctness of the logic/maths.
The other 3 marks are for presentat
DMTH137 Homework solutions from Week 5
prepared by the unit convenor
Due: Week 6
Marking notes 10 marks total. There are 7 marks for correctness of the logic/maths.
The other 3 marks are for presentat
DMTH137 Homework solutions from Week 7
prepared by the unit convenor
Due: Week 8
Marking notes 10 marks total. There are 7 marks for correctness of the logic/maths.
The other 3 marks are for presentat
DMTH137 Homework solutions from Week 4
prepared by the unit convenor
Due: Week 5
Marking notes 10 marks total. There are 7 marks for correctness of the logic/maths.
The other 3 marks are for presentat
DMTH137 Homework solutions from Week 8
prepared by the unit convenor
Due: Week 9
Marking notes 10 marks total. There are 7 marks for correctness of the logic/maths.
The other 3 marks are for presentat
DMTH137 Homework solutions from Week 9
prepared by the unit convenor
Due: Week 9
Marking notes 10 marks total. There are 7 marks for correctness of the logic/maths.
The other 3 marks are for presentat
DMTH137 Session 2 2017
Week 10 Tutorial Exercises : Divisors, Euclidean algorithm
1 Tutorial questions for you
This section contains the problems you should attempt at home in preparation for your tut
DMTH137 Session 2 2017
Week 6 Tutorial Exercises : Functions, Relations, Counting
1 Tutorial questions for you
This section contains the problems you should attempt at home in preparation for your tut
DMTH137 Session 2 2017
Week 5 Tutorial Exercises : Graphs, Graph Algorithms
1 Tutorial questions for you
This section contains the problems you should attempt at home in preparation for your tutorial.
DMTH137 Session 2 2017
Week 8 Tutorial Exercises : Graph colouring, Induction
1 Tutorial questions for you
This section contains the problems you should attempt at home in preparation for your tutoria
DMTH137 Session 2 2017
Week 7 Tutorial Exercises : Counting Techniques
1 Tutorial questions for you
This section contains the problems you should attempt at home in preparation for your tutorial.
1. H
DMTH137 Session 2 2017
TH
We
13
7
e
Tu
k3
t
o
ria
So
lut
ls
ion
s
Week 3 Tutorial Exercises : Quantifiers, Proofs, Sets
1 Tutorial questions for you
This section contains the problems you should attem
DMTH137 Session 2 2017
Week 4 Tutorial Exercises : Sets, Relations, Graphs
1 Tutorial questions for you
This section contains the problems you should attempt at home in preparation for your tutorial.
DMTH137 Session 2 2017
Week 9 Tutorial Exercises : Vectors, Matrices
1 Tutorial questions for you
This section contains the problems you should attempt at home in preparation for your tutorial.
1. Let
DMTH137 Homework solutions from Week 2
prepared by the unit convenor
Due: Week 3
Marking notes 10 marks total. There are 7 marks for correctness of the logic/maths.
The other 3 marks are for presentat
DMTH137 Homework solutions from Week 3
prepared by the unit convenor
Due: Week 4
Marking notes 10 marks total. There are 7 marks for correctness of the logic/maths.
The other 3 marks are for presentat
DMTH137 Assignment 1
Luka Kerr 45203369
Logic
1. (a) Let p = The app will install
Let q = You have the latest operating system
Proposition : p q
Converse:
If the app will install, then you have the la
(b) In the following Venn diagrams, note how the shaded regions would remain the same if the locations of sets B
and C were interchanged. Write down expressions for each of the shaded regions, where t
Vectors and Matrices graphics programming
The ability to create computer graphics that change with a parameter is very important, not just for Mathematics,
Scientific Visualisation, Computer Games, bu
What is the total weight of the minimal spanning tree?
Functions and Counting Techniques
4.
Let f : Z12 Z12 : x 9x + 1 where arithmetic is done modulo 12.
(a) Show that f is neither injective, nor sur
DMTH137 Assignment 2, Solutions
Graph Algorithms, Counting Techniques
DM
As
T
sig H13
n
7
m
Sol
e
n
uti t 2
ons ,
Due 5:00 pm. Monday 10 October
Graph Algorithms
1. Explain why a simple graph G = (V,
DMTH137 Assignment 1, Solutions
Logic, Sets, Relations, Graphs
DM
As
TH
sig
1
3
n
7
m
Sol
e
n
uti
t1
ons
Due 1:00 pm. Monday 5 September
Logic & Predicates, Sets, Relations
1. (a)
p q p q p q q (p q)