Beruflich Dokumente
Kultur Dokumente
net/publication/262872633
CITATION READS
1 553
7 authors, including:
Some of the authors of this publication are also working on these related projects:
All content following this page was uploaded by Neil A. Gordon on 05 June 2014.
Introduction
Modern industrial and commercial problems are increasingly complex and often require
analytical tools in part for their solution. Discrete mathematics has considerable elegance
and interest as a purely mathematical theory, but can also provide tools to solve problems
in (amongst other areas) computer science, cryptography, DNA sequencing and
management. Modern undergraduate mathematics courses need to reflect the growing
importance of such applications and equip their students with the necessary understanding
for the use of techniques in Discrete Mathematics. (One American aerospace company
apparently now employs more ‘discrete’ mathematicians than ‘continuous’
mathematicians). The Group favours a Discrete Mathematics ‘core’ but with different
emphases depending on the target audience. We explore ways in which discrete
mathematics could be taught incorporating IT and innovative teaching methods.
We first consider two possible core modules in Discrete Mathematics: one for Mathematics
students, one for Computer Science students, followed by a number of possible modules
for subsequent years. The needs of Mathematics students, which (for example) include
greater emphasis on the notion of proof, are likely to differ somewhat from those of
Computer Science students; thus these two groups may well need to be taught in separate
streams.
Core modules
We suggest two possible initial core modules: one for Computer Science students (with a
good base in GCSE Mathematics) and one for Mathematics students. The Computer
Science core is intended to be approximately 20 CATs points (one year is 120 CATs
points). The Mathematics core is intended to be about 10-15 CATs points since we believe
that a typical Mathematics programme already incorporates a large amount of essential
material in the first year. Proofs play a very small part in the Computer Science module
and a large part in the Mathematics module. Of course these possible syllabuses will need
local modification in the light of the other courses in the curriculum.
43
Computing Science core (two semesters)
Further modules
For the last three we envisage collaboration between the departments, as appropriate.
44
Innovative Teaching Methods
Using Applications
Discrete mathematics is inherently attractive to students because of the wide range of
applications which are easy to formulate and comprehend. An applications-led approach
to teaching discrete mathematics is a way to introduce novel ideas. We looked at separate
topics in the core structure to see what applications could be used to motivate the subject.
Induction: Sequences could be generated iteratively and the closed formula given and
checked by numerical investigation and then validated by induction.
Similar problems using difference equations to model the complexity of algorithms, and
problems using induction to prove the simple algorithms involving a loop, may be found in
the course material for the Open University course M261.
Again in M261, Set Theory is used to simplify segments of code where decisions are made
based on values taken by complex boolean fuctions.
Matrix algebra: There are applications here in computer graphics, as matrices are
used to carry out transformations in two and three-dimensional space. In addition,
adjacency matrices may be used in graph theory applications.
45
Group work
Discrete mathematics lends itself to group work more readily than other areas of
mathematics because problems are often more accessible. We favour small-scale group
work, which can help students to consolidate abstract ideas, rather than large-scale project
work with presentations and reports. For example, students engage in workshop sessions
in which they work on elementary applications from an investigative point of view. The
application is described in a workshop pack in which the students are led through the
problem solution via a series of leading questions.
Examples of applications tackled are the use of graphs to model the bracing of rectangular
structures, and in solving recreational games such as ‘Instant Insanity’. In another
example, pairs of students use Maple to encode and send encrypted messages to each other,
which are then decoded. (The basis of the coding was the RSA algorithm.)
Using IT
There is scope for using computer algebra packages such as Maple or Mathematica, which
have specialised discrete Mathematics sections, and a number of texts have incorporated IT
implementations of Discrete Mathematical techniques. For example, a recent book by
Wilson and Aldous comes with a CD-ROM, which contains a database of small graphs and
the facilities to manipulate and investigate these. The module ‘Applications in Discrete
Mathematics’ in Mathwise presents a number of problems and applications to initiate the
teaching of specific Discrete Mathematics topics. The Open University embeds IT usage
in a number of its Discrete Mathematics courses - which gives the students a feel for the
difficulty of the problem posed.
Andrew Rae of Brunel University has run a Discrete Mathematics Course for 140 students
of varying background without giving any lectures. He devised a self-paced learning
system based on laboratory sessions and tutorial help. This was backed up by video
material, available for students to view in their own time in the library. The Course had
ten units, each timed for two weeks. Each unit contained an initial handout, two half-hour
videos and a diagnostic test, carried out under supervision. Students volunteered for the
tests when ready, and the results were then discussed individually with the Course Tutor.
The tests did not affect the students’ results, as the Course was assessed by examination.
46
Other conferences have addressed the availability of web-based materials. See for
example
x the Proceedings of UMTC 2000: http://www.umtc.ac.uk/
x CTI Mathematics Workshop 1990
http://www.bham.ac.uk/ctimath/workshops/wdis.htm
References
General
47