Computer Mathematics (A) Syllabus and Assessment Statement

COMPUTER MATHEMATICS (06531) 4.5 points
COMPUTER MATHEMATICS A (06530) 6 points

Lectures 3(13); Tutorial 1(13) Levels, School of Mathematics
Semester 2

Prerequisite : Nil

Aim
To develop aspects of discrete mathematics relevant to computer science and related disciplines.

Graduate Qualities
By undertaking this subject, students will progress in the development of the following qualities:

	1 Body of knowledge	2 Lifelong learning	3 Effective problem solvers	4 Work alone and in teams	5 Ethical action	6 Communicate effectively	7 Internat’l perspective
Point weighting	2·5	0·5	1·0	0·5	-	-	-

Objectives
On completion of this subject the student should be able to:

apply the techniques of propositional calculus to decide the validity of arguments;
formulate recursive algorithms and verify general formulae using induction;
use combinatorial techniques to analyse algorithms and graphs;
differentiate between polynomial and exponential time complexity of algorithms.

Syllabus
Logic: propositions, truth tables, quantifiers, theorem and proof. Boolean algebra, circuit synthesis. Sets, relations, functions. Algorithms, recursion, time complexity, analysis. Recurrence relations. Graphs, paths and cycles. Trees, spanning trees, binary trees, tree traversals.

Teaching and Learning Arrangements
This subject will be delivered using the following means:
Lectures, to introduce principles and framework;
Tutorials, to exercise principles and techniques;
Tutorial assignments to encourage students to maintain contact with subject material.

Assessment
Examination 70%
Assignments 30%

Textbook
Johnsonbaugh, R, Discrete Mathematics, (4th edition), Prentice Hall, 1997 (the 3rd edition may also be used). All tutorial and assignment questions will be taken from the text.

References
Grossman, P., Discrete Mathematics for Computing, Macmillan Education Australia, 1995.
Munro, J.E., Discrete Mathematics for Computing, Thomas Nelson Australia, 1992.
Roman, S., An Introduction to Discrete Mathematics, (2nd edition), Harcourt Brace Jovanovich, 1989.
Ross, K.A. and Wright, C.R.B., Discrete Mathematics, Prentice Hall, 1992.

Subject Coordinator :
Stephen Lucas

July 1999

Computer Mathematics (06531)
Computer Mathematics A (06530)

Statement of Assessment 1999

This subject will be assessed by tutorial assignments (30%) and a final examination (70%) at the end of semester 2.

Assignments

Five (5) tutorial assignments of equal value (6% each) will be set.
They are to be handed in at tutorials in alternate weeks from the week beginning 16 August 1999 to that beginning 25 October 1999.
Assignments must be handed in personally to your tutor at the tutorial. A penalty of 10% of the assignment value will be imposed for each day late.

Tutorials
Attendance at tutorials is compulsory. Any student not attending at least 75% of tutorials may be precluded from sitting the final examination. Tutorial attendance requires the student’s attendance throughout the tutorial session. Students should express their tutorial time preferences by filling in the appropriate form.

Examination

Worth 70%

Based on material presented in lectures and tutorials

Three (3) hours duration

A single handwritten A4 sheet (2 sided) of information may be referred to during the examination

ENTEXT students or students with genuine disabilities may be granted 30 minutes of additional time in the examination

Students are advised to consult the University Calendar, Volume 2, for details on University Policy on assessment and examinations

Stephen Lucas
OC1-20 [Levels] 8302 3741
stephen.lucas@unisa.edu.au

Ross Frick
OC1-13 [Levels] 8302 3083
ross.frick@unisa.edu.au

Information concerning this subject will appear from time to time on the notice board outside OC1-20.

Lecture classes for Semester 2, 1999 (all at the Levels)

	Ross Frick, GP1-09	Stephen Lucas, F1-25
1	Thursday 12:10 pm	Tuesday 5:10 pm
2	Thursday 1:10 pm	Tuesday 6:10 pm
3	Tuesday 12:10 pm (following week)	Thursday 5:10 pm

The three hours of lectures for each week can be attended in any one of 4 ways:

all 3 afternoon hours in GP1-09 (Thurs, 3rd lecture of previous week; Tues, lectures 1 & 2 of this week),
all 3 evening lectures in F1-25 (Tues, 1 & 2 of this week, Thurs, 3 of this week),
all 3 Tuesday lectures (12.10 in GP1-09, 3rd of previous week, 5.10 in F1-25, 1 & 2 of this week),
all 3 Thursday lectures (12.10 in GP1-09, 1 & 2 of this week, 5.10 in F1-25, 3rd of this week).

Keeping you informed:
These subjects have a website, at http://www.roma.unisa.edu.au/06531/
This site should be accessible from any University pool computer, through the University's intranet. Students with internet access from elsewhere should also be able to access this site.
Notices and information concerning these subjects will appear from time to time at the website and on the notice board outside OC1-20.
On occasion, electronic mail will be sent to all students enrolled in Computer Mathematics and Computer Mathematics A.