r ""

L",.j. ; I

'G;,_>, -

The University of Newcastle

FACULTY OF MATHEMATICS HANDBOOK

CALENDAR 1988 VOLUME 8

The University of Newcastle

./,,' ',.,

THE UNIVERSITY OF NEWCASTLE New South Wales

Location Address: Rankin Drive, Shortland

Postal Address: The University of Newcastle NSW. 2308

Telephone: (049) 680401

Telex: AA28194 - Library AA28618 - Bursar

AA28784 - TUNRA (The University of Newcastle Research Associates Limited)

Facsimile: (049) 675833

Hours of Business: Mondays to Fridays excepting public holidays 9 am to 5 pm

Designed by: Marie-T Wisniowski

Typeset by : The Secretary's Division, The University of Newcastle

Printed by : Knight Brothers , Bryant St, Tighes Hill

The University of Newcastle Calendar consists of the following volumes:

Volume 1- Legislation:

Volume 2- University Bodies and Staff:

Volume 3- Faculty of Architecture Handbook

Volume 4- Faculty of Arts Handbook

Volume 5- Faculty of Economics and Commerce Handbook

Volume 6- Faculty of Education Handbook

Volume 7- Faculty of Engineering Handbook

Volume 8- Faculty of Mathematics Handbook

Volume 9- Faculty of Medicine Handbook

Volume 10- Faculty of Science Handbook

Also available are the Undergraduate Guide and Postgraduate Prospectus

This Volume is intended as a reference handbook for students enrolling in courses conducted by the Faculty of Mathematics.

The colour band, Amethyst BCC 28, on the cover is the lining colour of the hood of Bachelors of Mathematics of this University.

The information in this Handbook is correct as at 1 November, 1987.

ISSN 0159 - 3463

Recommended Price: Three dollars and fifty cents plus postage.

I should first like to welcome all new and re··enrolling students to the Faculty of Mathematics.

Whether 1988 marks the beginning or the continuation of your studies it represents a year of promise and interest for all of us throughout the Nation, and more specifically within this University and Faculty. We have always sought to provide flexible degree programs designed to encompass changes in demand whether from industry, commerce, the public service or research. Significant changes in tertiary education will undoubtcdly occur over the next few years. However, the three Departments of Computer Science, Statistics and Mathematics will continue to provide degree programs ensuring the keen demand for graduates from the Faculty of Mathematics. The range of application of computer science, mathematics and statistics, both in the public and the private sector, now extends into areas which a few years ago would have been considered inconceivable. It is clear that your studies within the Faculty of Mathematics will equip you for a worthwhile and rewarding csreer at the forefront of the social and economic development of this country.

Beyond this, a number of higher degrees is available within the Faculty, for research and scholarship have always been regarded as one of the fundamental activities of a university, and the Faculty of Mathematics has an established reputation both within Australia and internationally as an active research centre.

Perhaps in these days of economic uncertainty the greatest reassurance I can offer you is the knowledge that if you apply yourself diligently and successfully to the courses offered within the Faculty, then upon graduation a rewarding and challenging career is virtually assured.

I wish you every success in your studies in 1988. C.A. CROXTON,

Dean.

SECTION ONE

SECTION TWO

SECTION THREE

SECTION FOUR

SECTION FIVE

SECTION SIX

SECTION SEVEN

FACULTY m,' IVIATHEMAT][CS

FACULTY STAFF

FACULTY INFORMATION

Notes 011 Degrees and Diplomas Review of Academic Progress Time Limits Computer Science Courses Mathematics Courses Statistics Courses Combined Degrce Courscs

Notes for Intending Teachers

UNDERGRADUATE DEGREE REGULA110NS

nachelOl~ Degrees Offered iii the FaCility Bachelor of Computer Sciellcl~

Bachelm' of Mathematics

UNDERGRADUATE SUBJECT DESCRIPTIONS

Computer Science Mathematics Statistics Major Subjects from Other Faculties

POSTGRADUATE DEGREE REGULATIONS

Postgraduate Comses Offered in the Faculty lBllcileior of Computer Science (Honolll's) Bachelor of IVlathematic§ (Honoui's) Diploma in Comjluter Science Diploma in Mathematical Stuilies Diploma in Medil:al Statistics Master Degl'Ccs " General I~egHlatioll§

Master of Computer Science Master of Computing Master of Mathematics Master of Medical Statistics

POSTGRADUATE SUBJECT DESCRIPTIONS

Compnte}' Science Mathematics Statistics

SUHJECT COMPUTER NUMHERS

ComputeI' Science Mathematics Meilical Statistics

1

3

;)

3 3 3 ~.

5 6 7

3

11 3

10

17 Z9 32

41 ,,11 42, 42 43 45 46 4'7 48 49 49 50

S2

59 66

611

(ill 69 '74

SECTION EIGHT GE:NERA1L INFORMATION located between pages 34 :nHI 3:5

PRINCIP AL DATES 1988

Term lfJates Faculty of' Medicine

Advice abd lfllfolTnatioll Faculty Secretaries Cashier's Office Clmxrs and Student Employment Officer Counselling Service

Enrolment of New Students Transfer of COUl'SC

Rc.El1roiment by ContiRming Students Re~Enrolment Kits Lodging Application for Rc~Enrolmellt FOlms Enrolment Approval Payment of ChllJ'ges

lLail) Payment Student Canis Re.Admis§ion after Absence AUendance Status Cliange of' Address Change of Name Cllange of Progi'lmmlC Witluh'awal Confil'nJlatiml of Enrolment Failm'e to lP~lY Overdue Debts l,eavc of Absence AUcndancl) at Classes Genel'al Condllet Notices Student MaUenl Generally EXAMINATWNS Examination PeriodS SiUing for Examinatiolls Ilbdes fol' h?o1f'lllal I<:xamiliatioU§ E~mminatioll nesuHs Special ConsideraHon nefel'l'eli El!!Unitlatioll§ UNSA nSFACTORY PROGRESS

Unsatisfactory Progress

CHARGES Higli.eh" Education Admhli§uatioil Charge Method of Payment Scliolarslli" Holdel's and SIIOI1§Ol~cd Students lLmm§ . Refund of Charges Higber Degi'ee Candidates CAMPUS TRAFFIC AND PARKING

ii ii ii ii ii ii ii ii ii ii ii

iii iii iii iii iii iii iii iii iii IV iv iv iv iv iv iv iv iv iv v v v v v 'I

vii vii

viii viii viii viii viii viii

Dean Assoc.Prof. C.A.Croxton, BSc(Leicester), MA, PhD(Cambridge), FAIl', Flnstl'(Lond)

SUb-Dean Assoc.prof. W.Brislcy, BSc(Sydney), MSc(New South Wales), PhD, DipEd(New Eugl;md)

Fa(;ulty Seeretary Helen Hotchkiss, BA, DipEd(New England)

DEPARTMENT OF COMPUTER SCIENCE Professor lL.Keedy, BD(London), DPhil(Oxfonl), PhD(Monash), FACS, MBCS, AKC (Head of Department)

Scnlor Lecturers D.W.E.Blatt, BSc, I'hD(Sydney), MACS, MACM J.Rosenberg, BSc, PhD(Monash)

Lecturers B.Beresford-Smith, BSc, phD(ANU) Simon, BSc, BA(James Cook), DipCompSc, MMath

Senior Tutor K.Wallacc, BMath

Professional Officer D.M.Koch, BTcch(EE) (SAlT)

Computer Programmers C.M.Gues~ BSc(New South Wales), DipCompSc L.Schembri, BMath P.Sheen, BEng(Comp)

Departmental Secretary D.C.Edwards

DEPARTMENT OF MATHEMATICS Pr'ofc§§or vacant

Associate Professors W.Brisley, BSc(Sydney), MSc (New South Wales), PhD, DipEd(New England) C.A.Croxton, BSc(Leicester), MA, PhD(Cambridge), FAIl', FInstP(Lond) R.B.Eggleton, ESc, MA(Melbourne), PhD(Calgary) J.R.Giles, EA(Sydney), PhD, DipEd(Sydney), ThL P.K.Slmz, PromPhys, CSc, RNDr(Charles) (Head of Department)

Scnior Lecturers W.T.F.Lau, ME(New South Wales), PhD(Sydney) D.L.S.McElwain, BSc(Queensland), PhD(York(Canada», MACS T.K.Sheng, BA(Marian College), BSc(Malaya & London), PhD(Malaya) W.P.Wood, BSc, PhD(New South Wales), FRAS

Lecturers C.J.Ashman, BA, LittB(Ncw England), PhD R.F.Berghout, MSc(Sydney) J.G.Couper, BSc, PhD (New England) M.I.Hayes, EA(Camhridge) G.W.Southem, BA(Ncw South Wales), M.Math, DipCompSc A.Sterna-Karwat, MMath(War~aw),DMath(Warsaw) W.Summerficld, BSc(Adelaide), PhD (Flinders)

Professor Emeritus R.G.Kcats, ESc, PhD (Adelaide), DMath(Waterloo), PIMA, FASA, MACS

Computer Programmer C.S.Hoskins, BMath, PhD

DepartJ.nental Secretary A.Clark, EMath

Office Staff I.Dennis D.Dimmock, BMath(Wollongong), DipEd J.Garnsey, BA(Sydncy)

2

DEPARTMENT 011 STATISTICS Professor A.I.Dobson, BSc(Adclaide), MSc, PhD(Jrunes Cook) (Head of Department)

As§ocillte Professor R.W.Gibherd, BSc, PhD(Adelaide)

Senior Lectul'eI's B.G.Quinn, !:lA, PhD (ANU) D.F.Sinclair, BSc, MStat (NSW), MS, PhD (Florida State)

LCI!hU'0l' 1 VllCRut position

Dep!ll'hmmtni Seuetfli'Y C.M.Claydon

The Faculty of Mathematics comprises the Departments of Computer Science, Mathematics and Statistics. In the degrees of Bachelor of Computer Science and Bachelor of Mathematics and in the Diploma and Masters degrec courses in Computer Science and Medical Statistics there arc also many opportunities to take subjects offered by other depmtmcnts of the University,

NOTES ON DEG!1EE3 AND nJPLOMA§

Ktevicw of Atademic K'rogn!ss

Acting under thc Regulations Govcrnillg Unsatisfactory Progress, as set out in Volumc I of the Calender, the Facnlty Board will review:

1. all full--time students who have failed to pass at least fom subjects at the end of the second year of attendance;

2, all pmHime students who have failcd to subjects at the ene! of the fonI'!l! year

3. all studcnts who have failed to pass at least four subjects after one fulH.imc and two parHime years;

,1. all students, whethcr parHimc OJ' fnll--time, who in their first year of attendancc have a record of complete failure; and

all students who fail a compulsory subject twice, and may take action under the RellulaLious.

Unless there arc mitigating circumstances, a student who fails any elective subjcct twice may not be permitted to cnrol again in that subject.

Time Limits

The variolls dcgree and diploma regulations require that: students complete the relevant coursc within specified time limits. Only in the most extenuating circumstances will the Faculty Board give pcrmission for thesc to be exceeded. Students should conslllt the appropriate regulatiolls for details of the limits applying to the COIlJ'SC in which they are enrolled.

C01VlPUTER SCIENC)E COURSES

Computer Science courses are currently in a state of transition. Before 1986 the Faculty offered a Computer Science II subject and a Computer Science III subject. In 1986 11 new subject Computer Science I was introducecL This led to a revised Computer Science II subject in 198? (which, unlike the old Computer Science II, cannot be taken in two pails). In 1988 two nyw subjects, Computer Science IlIA and Computer Sciencc nIB, replace thc former Computer Science III subject. The computer science subjects and topics being offered in 1988 arc desClibed in the Department of Computer Science entry iu this handbook.

Transition Arrangements

StuclellL~ intcnding to study computer science as part of allY degree must enrol in Computer Science I, which is thc prerequisite for all other computer science subjects; they mllst also enrol in, or have already passed, Mathematics I. The only exception to this l1!le is for students who have becn enrolled in their present degTee since 1985 or earlier and who had a rca son able expectation at the time of their enrolment of later enrolling in thc subject Computer Science II as an introductory computer science subject. Such

students are permitler! to enrol in the transitional subjects Computer Science IIT and lIlT.

WhklJ lndmle Computer Sciellce

Computer Scic'nce call be taken in a wide variety of degrec courses, as follows:

Bachelor Degrees of Mathematics, Science, Arts, Commerce, Economics

In these students may take a major sequence in computer consisting of the subjects: CO!lljJUler Science I (with .Mmhcmatics n, Computer Science II and Computer Science IIIA. In the BMath degree stndents may also take the hononrs subject Computer Science IV.

Students in any of these degrees who have passcd Compnter Science IIII\ with at least credit level may apply for enrolment in the HHchdor of COlllputer Science (Honours) degr('A) (see below).

Bachelor of E'nginecl ing (Computer Engineering)

The stll~jects Computcr Sciencc I and II arc an integral part of this degree (taken as second and third year subjects). It is also possible for stlldclllS to take topics from Comp:JtfOl' Science IIIA ami TIm as clective units.

Students who pass sufficient such elective subjects with at least credit level may apply for enrolment in the Bachelor of Computer Science (Honours) degree (see bclow).

Hachelor of Engineering

The topic Introduction to Programming, an introductory coursc based on Pascal, is part of the electrical enginccring degree. Other engineering students may take this and other topics as electives. (f'or allY student who has not completed Computer Science I thc Introduction to Programming lopic, ol' an approved equivalent, is a prerequisite for most other computer science units.)

Um:hcIOK' 01' Comrm~ei' Science

This new degree course, which was introduced in 1987, has been designed to provide students with the opportunity to study a wide range of subjects ill computer science and related areas, and thus equip them with an excellenl background for a professional career in thc computer indusu'y or as a programmer Of systcms analyst in industry or commerce.

In order to qualify for a BCompSc dcgree, students must pass nine subjects. At least seven of these subjects mllst bc from the Schedule, including three Part I subjects, the Part III subject Computer Seicnce InA and one other Part III subject. In practice this means that a full-time student will typically take the following subjects:

First year Computer Science I, Mathematics I, Computer Engineering I, X

Second year: Computer Sciencc n, Mathematics lICS, y

Third year: Computer Science IlIA, Computer Science nIB.

:I

X will normally be a Pari I subject and Y a Part II subject. Students may take any Part I subject from the list at the end of II.lis section ill ~le slot X. Slot Y will usually be a Part II subject and can mclude other Part II subjects from the S.ch~dllle: At present the only such subjects arc Computcr Engmcermg II and Data Processing II. Alternatively a student can choose a Part II subject from the list below.

Students who wish to transfer from some other degree and who have already taken Computcr Science I and ~ath.ematics I, together with two other Part I subjects, may m sUItable cases be gnmteci standing in these subjects as the ~ a~d Y .subjects, but then they must enrol in Computer Englileenng 1. For such students it would then be impossible to take Computer Engineering n. For thi,; r~ason t~ere is an option for them to study Computer Engmeenng III rather than Computer Science IIIB. The prer~quis.ite for Computer Engineering III is Computer bngmeermg I (not II). (Stmlents should note that they c"am~ot ~ke both Computer Engineering II and Compnter Engllleenng III.)

Up to two subjects which are not on the Schedule may be taken as part of the course. Subjects approved for this purpose include:

Accounting I

Biology I Chemistry I Classical Civilisation I Drama I Economics IA English I

French IA or IS Geography I Geology I German IS or IN Greek I

Biology IlA Chemistry IIA

Part n

Classical Civilisation IrA

Economics IrA Education II Electronics and Iustrumentation II English IIA French IIA GeogTaphy IrA

Geology IrA

History I

Japanese I Latin I Legal Studies I Liuguistics I

Philosophy I Physics IA or m Psychology I Sanskrit I Sociology I

German IIA History IlA

Japanese IrA Legal Studies IIA Mathematics IIA Philosophy IIA

Physics II Psychology IIA Statistics II

For part-time students the degree patterns described abovc can be adjusted appropriately over not more than seven years.

Essay Requirement

Students of the BCompSc degree must complete an essay on some aspeet of the history or philosophy of computeI' ~i~nce.or the social issues raised by computer technology. I1l1s will normally be completed in a student's second 01'

4

third year. Details will be discussed at the beginning of the Computer Science II lectures each year. This involves reading several books and articles in prcparation, so it should not be left until the last minute. The dcgree cannot be awarded until the essay has been satisfactorily completed.

Students Wishing to Transferfrom other Degrees

Standing for subjects taken as part of other degree courses should be discussed in the first instance with the Head of the DepaInnent of Computer Science.

MATHEMATICS COURSES

Mathematics courses are currently offered nndcr the degree regulatlOns as lU previous handbooks for those students who had enrolled in prcvious years, and the Hew regulations as set out in this handbook. Students should note that it is now jJossible, in the Bachclor of Mathematics degree course, to do complete major sequences iu Mathematics and Computer Scieuce, or in Mathematics and Statistics, as well as combining Mathematics with another discipline outside the FacuIty.

Tnmsitioll Anangemcnls

The subject and topic prercquisites which apply to various subjects III Mathematics are set out in this handbook in detail. However, studeuts who had enrolled in previous years should, before completing their enrolment, consult with the Dean and/or thc Head of the Department of Mathcmatics if they are in doubt.

Degrees Which Include Mathematics Subjects

Mathematics subjects may be taken in any degree course in the University.

Mathematics majors exist in the Facultics of Scieuce, and Arts, as wcll as this Faculty, and substantial quantities of Mathematics are required iu the Faculty of Enginecring and may also be taken in the Faculty of Economics and Commerce.

Therc are two major scquences in Mathematics. These are:

(i) Mathematics I, Mathematics IlA plus Mathematics lIC, followcd by Mathematics IIIA.

(ii) Mathematics I, Mathematics IIA, Mathematics IIIB.

A student wishing to specialise in Mathematics as a double major would take the sequence Mathematics I, Mathematics IIA plus Mathematics lIC, Mathematics IllA pins Mathematics HIB as five of the nine subjccts for the degrec.

Thc subject Mathcmatics II CS, introduced in 1987, is composed of topics considered appropriate for studcnt of the B.Comp.Sc. coursc.

Combined Degrees

As set out in the rcgulations, students of sufficient ability may take a Bachelor of Mathematics dcgrec combined with another degree from this or another FacnIty togcther, at a considerable saving in time comparcd with takiug them sequentially. Dctails are set out later in thesc notes.

Choice of Subjects ill the Bachelor of Mathematics Del:l'ce The requirements for the B.Math. degree allow for up to [om of the nine subject.s to be chosen from the subjccts offered in other degree courses. Subjccts which have been approvcd ill the past arc listed below.

Accounting I Biology I Chemistry I Classical Civilisation I

Drama I

Economics IA

Euglish I French lA or IS Geogl'aphy I

Geology 1 German IS or IN

Greek I

Biology !lA, lIB & JIIA

Chcmisny IlA

Part I

Part n

Classical Civilisation IlA

Economics IIA & lIB

Education II Electronics & Instrumentation II

English IIA French IlA, IIS & IlB Geography IIA, UB & HIB Geology IIA & lIB

History I Japanese I

Latin I Lcgal Studics I Linguistics 1

Philosophy 1

Physics lA or IS Psychology I

Sanskrit I Sociology I

German IIA, IIS &

IIB History IrA, IIB & lIC Japanese IIA Legal Studics IIA

Philosophy IIA & IlB

Physics II Psychology IlA & IIB

Enrolmcnt in the following subjects is restricted as indicated below.

Economics lJA - Students shonld also iuclude the Part II Statistics Topic PS, Probability and Statistics, in their course.

Economics liB - This subjcct would nol normally be included in the Bachelor of Mathcmatics course. However if permission is given to include this subject thcn the contcnt should be discussed with the Dean.

A student may uot include both Physics IA and Physics IB in his coursc.

Permissiou will normally be given for thc inclusion in a student's course of subjects which are prerequisites or corcqujsites of subjects appearing in the schedules.

Mathematics with One Other Discipline

Although there is a wide range of optional subjects in the degree course for the Bachelor of Mathematics it is essential that these be chosen with care, espccially by those candidates who aim to apply Mathematics to some specific discipliue. In many such cases it is essential to include certain Part I subjccts in the first year of the degrce course if

it is to be completed in mmllnllm time. Examples of programmes are given bclow; the list is not exhaustive ane! students are invited to consult the Dean cOllcerning otheo!' possible programmes, including part .. time programmes.

B,Math. including Computer Science

Year 1 Mathematics I, Computcr Science I and two other subjects.

Year 2 Mathematics IIA, Mathematics lIC and Computer Science n.

Ycar 3 Mathematics IIlA ancl Computer Science III.

B.Math. including Statistics

Year 1 Mathematics I aud three other subjects. Year 2 Mathematics IIA, Mathematics IIC and Statistics

II. Year 3 Mathematics IlIA and Statistics m.

B.Malh. including Computer Science and Statistics

Year 1 Mathematics I, Computer Science I and two other snbjccts.

Year 2 Mathematics IIA, Computer Science II and Statistics II.

Ycar 3 Computer Scienee III and Statistics m.

B.Math. including Accounting I

Ycar 1 Mathematics I, Accounting I, Economics lA, Computer Scicnce I.

Ycar 2 Mathcmatics IIA, Mathematics HC, Accounting lIC. '

YcaI' 3 Mathematics IUA, Accounting mc (Accounting HIB and Foundations of Finance option).

B.Muth. including a discipline ji-om the Faculty of Science, eg.Psychology

Year 1 Mathematics I, Psychology I and two other subjects.

Year 2 Mathematics lIA, Mathematics HC and Psychology lIC.

Ycar 3 Mathcmatics IIIA, Psychology mc.

B.Math. including an Engineering discipline, eg Civil Engineering

Year I Mathematics I, Engincering I and two other subjects (Physics IA is recommended).

Year2 Mathcmatics IIA, Mathematics lIC and Civil Engineering lIM.

Year 3 Mathematics IIIA and Civil Engineering IIIM.

STATISTICS COURSES

From 1987 it will be possible for students to take a major sequence in statistics consisting of the following subjects:

1 Nole: In order to complete the educational requirements for the professional bodies, it is necessary to pass additional subjects.

5

Mathematics I, Statistics II, Statistics III. This sequence can be taken as part of the Bachelor degrees in Mathematics, Science, Arts, Commerce and Economics.

Statistics II is a new Part II subject which will be offered for the first time in 1987. Students enrolling in Statistics II must have already passed Mathematics I. As a transition arrangement fOJ' 1987 students el1l'olling in thc Part III subject Statistics III must have already passed the Mathematics II topics: H (Applied Statistics), I (Probability and Statistics) and CO (VeetOJ' Calculus and Differential Equations).

From 1988 the prerequisite fOJ' Statistics III will bc Statistics n. Statistics topics, ie parts of Statistics II and Statistics III, arc also available as parts of other subjects. [<'OJ' example, Topic PS (probability and Statistics) may be included in Mathematics nc, Topic AS (Applied Statistics) is part of several Engineering programmes, and Topic RP (Random Processes and Simulation) is part of Mathematics IICS.

COMBINED DEGREE COURSES

'llle decision to take a combined degree course is usually taken at the end of a student's first year in his original degree course, in consultation with the Deans of the Facnlties responsible for the two degrees. Permission to embark on a combined degl'ee course wil! normally require an average of credit levels in first year subjects.

naclll~lo .. of CmlllJlltel' Science alld Another Degree

Combined degree regulations for BCompSc studeilts have now been approved for combined degrees with Computer Science and Arts, Computer, Engineering and Mathematics. Students interested in a combined degree course should discuss their plans with the appropriate Dean(s).

Bachelor Mathamatics and Another Degree

Arts/Mathematics

The details for the combined course follow simply from the requirements for each degree. Each degree requires nine subjects so the combined degree requires 18 subjects less foul' subjects for which standing may be given, thus the combined degree should contain 14 subjects. The Bachelor of Mathematics requires Mathematics I, Mathematics IlA, Mathematics lIC, Mathematics IlIA and either Mathematics IIIB, Computer Science HI, Statistics III or a Part !Il subject from Schedule B of the Schedule of Subjects approved for the degree of Bachelor of Mathematics. This leaves ,nine subjects which must clearly satisfy the requirements for the Arts degree.

The course could be pursued in the following manner:

Year J Mathematics I and three other Part I subjecl~.

Year 2 three Part II subjects including Mathematics IlA and Mathematics lIC and another subject which should be a Part I or Part II subject approved for the degree of Bachelor of Arts.

Year 3 Mathematics IlIA plus two other subjects which must include at least one Part III subject.

6

Year 4 either Mathematics nIB, Computer Science III, Statistics III or a Schedule B subject from the requirements of Bachelor of Mathematics Plus two other subjects which will complete the requirements for the AIts degree.

Commerce/Mathematics

The details of the combined course in Commerce and Mathematics follow from the requirements for each degree. The combined course should contain Mathematics I, Mathematics IIA, Mathematics lIC, Mathematics IIlA and either Mathematics lIIB, Computer Science 1Il, Statistics III or a Part III subject from Schedule B of the Schedule of Subjects approved fOJ' the degree of Bachelor of Mathematics. This leaves twelve subjects which must clearly satisfy the requirements for the Commerce degree. The cOUl'se could be pursued in the following manner:

Year 1 Mathematics I Introductory Quantitative Methods Economics I Accounting I

Year 2 Mathematics IIA Mathematics lIC One BCom subject

Year 3 Mathematics IIIA Three BCom subjects

Year4 Mathematics IlIB, Computer Science 1Il, Statistics III or Part III Schedule B subject from thc requirements for Bachelor of Mathematics Two BCom subjects

Year 5 Threc BCom subjects.

Economics/Mathematics

The details of the combined course in Mathematics and Economics follow simply from the requirements [or each degree. The combined degree COlll'se should contain Mathematics I, Mathematics IIA, Mathematics lIC, Mathematics IIIA and one of Mathematics lllB, Computer Science Ill, Statistics III or a Part III subject from Schedule B of the Schedule of Subjects approved for the degree of Bachelor of Mathematics, and all the subjects satisfying the requirements for the degree of Bachelor of Economics.

The COllrse could be pursued in the following manner:

Year I Mathematics I Introductory Quantitative Methods Economics I One BEe subject

Year 2 Mathematics ITA Mathematics IIC One BEc subject

Year 3 Mathematics IIIA Economics II Two BEe subjects

Year4 Mathematics IIIB, Computer Science III, Statistics III or a Part III Schedule 13 subject [rom the requirements for BMath Two BEe subjects.

Year 5 Three BEe subjects

Engineering/Mathematics

BE/BMath in Chemical Engineering

BE/BMath in Civil Engineering BE/BMath in Computer Engineering BE/BMath in Electrical Engiueering

BE/BMath in Industrial Engineering BE/BMath in Mechauical Enginecring

The details of the combined course in Mathematics and Engineering follow simply from the requirements for each degree. The combined degree course would typically contaiu Mathematics I, Mathematics !lA, Mathematics lIC, Mathematics IlIA and one of Mathematics IIlB, Computer Science III, Statistics III or a Part III subject from Schedule B of the Schedule of Subjects approved for the degree of Bachelor of Mathemat.ics, and all subjects satisfying the requiremenl~ for the degree of Bachelor of Engineering.

Candidates wishing to emol in a combined degree should liaise with the relevant Head of Department and the Dean of the Faculty of Mathematics concerning approved subjects. Sec the 1987 Faculty of Engincering Handbook [or

subject/unit descriptions.

Mathematics/Science

The details for the combined course follow simply from the requirements for each degree. Each degree requires nine subjects so the combined degree requires 18 subjects less four subjects fOJ' which standing may be given, thus the combined degree should contain 14 subjects. The Bachelor of Mathematics could require Mathematics 1, Mathematics IIA, Mathematics IIC, Mathematics IlIA and one of Mathematics IlIB, Computer Science III, S talistics III or a Part III subject from Schedule B of the requirements. This leaves nine subjects which must clearly satisfy the requirements for the Science degree.

The course could be pursued in the followinG manner:

Year I Mathematics I and three other Part r subjects. Year 2 three Part n subjects including Mathcmatics IlA

and Mathcmatics lIC and another Part I subject.

Year:; Mathematics IllA plus two other subjects which must include at least one Part III subject.

Year 4 oue of Mathematics IIIB, Computer Science III, Statistics III or a Schedule B subject from the requirements for Bachelor of Mathematics, plus two other subjects which will complete the requirements for the Science degrec.

NOTES FOR INTENDING TEACHERS Prereqnisites 1'01' Diploma in Education Units

Students in the Faculty of Mathematics who intend to study for the postgraduate Diploma in Education may be interested in the following prereqnisite subjects for that Diploma.

These prerequisites are stated in terms of passes in subjects of the University of Newcastle. Applicants with qualifications from other universities, and those who finished a Newcastle course recently whose courses of study have included subjects which are decmed for this purpose to provide au equivalent foundation, may be admitted to candidature by the Dean of the Faculty of Education on the

recommendation of the Head of the Department of Education.

In the Diploma coursc, the Problems in Teaching and Learning units arc grouped as follows:

(a) Secondary English History Social Sciences (Gccgraphy, Commerce) Modem Languages (French, German, Japanese) Mathematics Science

(b) Primary

Pl'!~l'eq II isites For information about prerequisites, students are invited to contact the Faculty Secretary, Faculty of Education. This contact should be made in the early stages of a degree course.

FOJ' secondary methods a Part III subject in the main teaching area and a Part. II subject in another teaching area.

For primary method at least a Part II subject in one secondary teaching area anc! a Part I subject in mlOthcr sccol1d31Y teaching area.

Note A Part II subject assumes as a prerequisite a pass in a Part I subject in the same discipline. A Part III subject assumes a pass in a Part I subject and a Part II subject in the samc discipline.

Mathematics Educatioll Suhjects

Candidates for the degree of Bachelor of Mathematics intending a career in leaching may wish to include professional studies related directly to teaching in addition to, and concurrently with, the normal course of study in the second and third years by el1l'olling in Mathematics Education II and Mathematics Education III, the contents of which are sct out under Extraneous Subjects.

7

BACHELOR DEml1EIi:S OFh7ERED IN THE }"ACULTY OF MATHEMATICS

Bachelor of Computer Science (BCompSc)

Bachelor of Computer Science (Honours)

[BCompSc(Hons») Bachelor of Mathematics (BM'lth)

Bachelor of Mathematics (Honours) [BMath(Hons»)

REGULATIONS GOVERNING THE mmINARY IH~GREE m i ' ilACHELOn OF COMl'UTEH SCn~NCJ~

1. These Regulations prescribe the requirements for the ordinary degree of Bachelor of Computer Science of the University of Newcastle and <JJ'e made in accordance with the powers vested in the Council under By-Law 5.2.1.

2. Ddiilitioml

In these Regulations, unless the context or subject matter otherwise indicates or requires:

".eom'se" means the programme of studies prescribed from tIme to time to qlWJify a candidate for the degree;

"nelm" means the Dean of the Faculty;

"tl~e deg,"cc" means the degree of Bachelor of Computer SCIence;

meallS the Department offering a particular mld includes auy other body so doing;

means the Faculty of Mathematics;

lilIo3lnl" means the Faculty Board of the Faculty;

"Sch~dllll:" means the Schedule of Subjects to these Regulations;

means any part of Ille course for which a result recorded.

3. 11:m'o!Ri!AcHt

(1) A candidate's enrolment ill any year mnst be approved by the Dean or the Dean's lIominee.

(2) A candidate may not enrol ill any year in any combination of subjects which is incompatible with Ihe requirements of the timetable for that year.

(3) Except with the permiSSion of the Dean given only if satisfied that the academic merit of the candidate so warrants:

(a) a candidate shall 1I0t enrol in more than four subjects in <JJly one academic year;

(IJ) a candidate emolling'in four subjects in anyone academic year shall not enrol in a Part III subject lind !lot more than one Part II subject ill that ycar;

(c) a candidate enrOlling in three subjects in any one academic year shall not enrol in mOl'e I1mn two PIl!t HI subjects ill that year.

to, Q'H!qnilfi(\~a¢im, yaw Admissionl to the Hlegl'ee

(1) To for admission to the degree a cllndidate sh~JI

(a) pass nine subjects, and

(b) complcte to thc satisfaction of the Head of the Department of Computcr Science an essay on some aspect of the history or philosophy of computer science or thc social issues raised by computer tcchnology.

(?,) The nine subjects presented for thc dcgree shall include:

(a) not fewer than seven subjects selected from the Schedulc, provided that a candidatc may not select both Computer Engineering II and Computer Engineering III;

(b) at least three Part I subjects from the Schedule;

(c) Computcr Scicnce IIIA and at lcast one other Part III subject from the Schedulc.

(3) A candidate may select up to twq subjects from subjects offercd in other degree courses in thc UniverSity with thc permission of the Deem, who shall determine the classification of each subject as a Part I, Part II or Part III subjcct.

(4) A candidate may not present for the degree subjects which have previously been counted towards au other degrec or diploma obtained by that candidate, except to such an extent as the Faculty Boarel may pelUlit.

(5) Irrespective of the order in which they are passed, the subjects presented shall, except with the pcrmission of the Dean, conform with one of the following pattems:

Part I subjects Part II subjects Part III subjects

00 4 3 2 ~ 4 2 3 (c) 5 2 2

5. Subject

(1) To complcte a subjeet a candidate shall attend such lectures, tutorials, seminars, laboratory classcs and field work and submit such written or other work as the Department shall require.

(2) To pass a subject a candidate shall complete it and pass such examinations as the Faculty B03xd shall require.

6. Standing

(1) 'fhe Faculty Board may graut standing in specified aud unspecified subjects to a candidate, on slIeh conditions as it ~nay determine, in recognition of work completed m tlus University or another institution.

(2) A candidate may not be granted standing in more than four subjects which have already counted towards a degree to which that candidate has been admittcd or is eligible for admission.

(3) The Dean shall determine the classification of each subject in which standing is granted as a Pmt I, Part II or Pmt III subject.

7. ami Corequisites

(I) Except with the permission of the Faculty Board granted after considering allY recommendation made by

the Head of the Department, no candidatc may enrol ill a subjeclunless that candidate has passed any subjects prescribed as its prerequisites at any grade which may be specified and has already passed or concurrently cnrols in or is already emolied in any subjccts prescribed as its corequisites.

(2) A candidate obtaining a Terminating Pass in a subject shall be decmed not to havc passed that subject for prerequisite purposes.

8, Withdrawal

(1) A caudidate may withdraw from a subject or the course only by informing the Secretary to the University in writing and the withdrawal shall take effect from the date of receipt of such notification.

(2) A clmdidate who withdraws from a subject alier the last Monday in second term shall be deemed to have failed the subject save that, after consulting with the Head of the Department, the Dean may grant permission for withdrawal without pcnalty.

9. Results

The result obtained hy a successful candidate in a subject shall be:

Terminating Pass, Ungraded Pass, Pass, Credit, Distinctiol1, or High Distinction.

10, Time Requirements

Exccpt with the special pelmission of the Faculty Board, a caudidatc shall complete the requirements for the degree within seven calcndar ycars of the commencement of thc degrec course. A candidate who has becn granted standing in accordance with Rcgulation 6 of these Regulations shall be deemed to have commenced the degrec course from a date to be detClmincd by the Deau.

11. Relaxing Provision

In order to provide for exceptional circumstanccs arising in a particular case the Senate on the recommendation of the Faculty Board may relax any provision of these Regulations.

Combined Degree Courses 1:%, General

A candidate may complete th~ requirements for the degrec in conjunction with another Bachelor degree by completing a combined degree course approved by the Faculty Board and also where that other degrec is offered by another Faculty, the Faculty Board of that Faculty.

Admission to a Combined Degree Course

13 (a) shall be subject to thc approval of the Dean or Deans of the two Facultics as the case may be;

(b) shall, cxcept in exceptional circumstances, be at the end of the candidate's first year of enrolment in a degree; and

(c) shall be restricted to candidates with an average of at least credit level who have passed Computer Science I

at a level deemed satisfactory to the Deau, O[ who havc achieved a standm'd of performance deemed satisfactory for the purposes of admission to a combined degree course by the Faculty Board.

14, The work. undertaken by a candidate in a combined degree course shall be no less in quantity and quality than if the two courses were taken separately as shall be ccrtified by thc Deau or the Deans of the two Faculties as the case may be.

IS. To qualify for admission to the two degrees a candidate shall satisfy the requirements for both degrees except as provided in the following Regulations.

16. Computer Science! Ads

(1) To qualify for admission to the ordinary degrees of Bachelor of Computcr Science and Bachelor of Arts, a candidate shall:

(a) pass fourtecn subjects, and

(b) complete to the satisfaction of the Head of the Department of Computer Science an essay on some aspect of the history or philosophy of Computer Science Of the social issues raiscd by computcr technology.

(?) The following restrictions shall apply to a candidate's choice of subjects, namdy:

(a) not fcwer than seven subjccts shall be selected from the Schedule of Subjects to these regulations in accordance with paragraphs (a), (b) and (c) of Regulation 4(2) of these rcgulations

(b) nine of the subjects shall be selected in accordancc with Regulatioll 9 of the Regulat.ions goveming the ordinmy degree of Bachelor of Arts

(c) at least one Part III subject being a subject not included in the Schedule of Subjects for the ordinary degree of Bachelor of Computer Science shall be sclected from the Schedule of Subjects to the Regulations governing the Ordinary degree of Bachelor of Arts.

1 '1. Computer Sdence!El1gineering (Computel' Ellgineering)

To qualify for admission to the degree of Bachelor of Engineering (Computer Engineering) and the ordinary degree of Bachelor of Computer Science, a candidate shall:

(a) pass Computer Scicnce I, Coinputer Engineering I, Mathemat.ics I, Compnter Science II, Mathematics IICS, Computer Scieuce IIlA and Computcr Science IIIB,mld

(b) complete to the satisfaction of the Head of the Department of Computer Science an essay Oll some aspect of the history or philosophy of Computer Science or the social issues raised by computer technology, aud

(c) pass other subjects selected from the programme of subjects approved for the degree of Bachelor of Engineeriug (Computer Engineering), totalling a minimum of 40 units, as calculated for those degrees.

9

).go COmimRI:" §drmee/J\!i(Il!hcml1i:ktl

(:I) To qnalify for admissioll to li1(; onlilwry ri0p;lees of Hachelor of Science ilne! Bachelor or MnthemMics, H sll:lll:

(a) pass fOlI1!PA"m suhjects, mid

(b) cOlilplete to the snlisti~ction of the Henri of the Department of :olilpnter Sciellce all cssny Oil sOllie

of the hisi:(llY or philosophy of ComputeI' or !lIe sodal issues raised by computer

tedmol08Y.

(2) '{he fourteen subjects presented for the degree sllall conform to the following requirements:

(a) Not fewer [liml seven snbjecis shall bfo se]p,cteri (rOlIl the Schedule of Sl1bjecrs to these rcgllliil.iolls in accOI'dance with pmagraphs (a), (b) and (c) of n.eglllation 4(2) of tllese Regulations

(h) Ninc of the subjects shall be selected ill accordance with Regnlations ~(l)(lJ) and (c) and Regulation 4(2) of the Regulations goveminiY, the Ordinary deglec of llachelOl' of Marhcma(jcs

(c) At least two Pmt In subjects shall be selected from the Schedule of Subjects to tlJese regulations

(d) At least two Part HI subjects, being subjects nor. included ill rhe Schedule of Subjects shah be selected from the Schedule of Subjects to the Regulations governing the Ordinary degree of Bacllelor of Mathematics.

SCJPllElI)'VU\ OF SVn,mCT~; H:lchc!m' of SdelH:c

SUbject

]>;u't K

f,{efiUlflts l'rereljllisites lIlld COl'litjuisites

Computer Science I Mathematics J

Computer Engineering r I~mt IX

Compnter Science II

Data P(()cessing II

Mathematics IlCS

Corequisite Mathematics It is assumed that students have studied Higher School Certificate Mathematics at the two-unit level or higher. Coreljuisite Mathematics

Prerequisite Computer Science I Prerequisite Computer Science I Prerequisite Mathematics I

Compnter Engineering III Prerequisite Computer Engineering I

Pal't IU

Computer Science InA

Computer Science IIIB

10

Prerequisite Computer Science II Prerequisite Computer Science II, Mathematics IICS Corequisite Computer Science rnA

ComjJUlcr Engineering l![7 Prcrequisite Com}llltcr I~n[',illeerillg I

!iIEGVLAnor'lS GOVEW\JKNG Hm mWlNAHV IH<:GlU:I,; OF BACHECOi{ OF MATlmlVlAnC5

1. Tlwse I~cglliatiolls prescribe thc rcquirclllcnls for the ordinary degree of Bilchelor of Mathematics of the University of Newcastle and arc made ill accordance wilh the POWClS vestee! ill the Coulicilulldcr ByLmv 5.2.1.

J)cfinitioll§

III these Regulations, unless the context or slIiJject matter otherwise indicates Of requires:

"wnror" means the prO!.;l"all1ll1e of studies prescribed from tjll1c to lime to qnaJify a candirial.C fOf the degTee;

"Brall" me.alls the Dean of 1l1C j'i1clIlIy;

mcallS the degree of i3achelol' of

"1)cplll'lmcut" means the Department offering a partjclllar subject and includes IIny other body so doing;

"F*~!llty" means the FaCUlty of MilIhcmatics;

"K;'~\C!lh.l' llioanl" meallS the Faculty Boare! of the Faculty;

"§chcdllie means a Schedule of Subjects to these Regulatjons;

means any PiU'I. of t.he course for which a result may recorded, provided that for the purpose of these Regulations, Mathematics lIB Part rand Mathelliatics IlB Pmt II shall together count as one subjcn

J, l~ilr()hilellt

(1) A candidate's enrolment. ill any year must be approved by the Dean or the l)~411l'S nomincc.

(2) A candidate may not enrol in any year ill any combinatioIl of sllbjects which is incompatible with the requirements of the timetable for tJ1at year.

(3) Except wil11 the permission of the Dean given only if satisfied that the acariemic merit of the candidate so WaIT,UltS:

(a) a candiclate shall not enrol in more than four sllbjects in any olle academic year;

(b) a candidate enrolling in folll' subjects in anyone academic year shall not enrol in a Part Ul subject mId not more than one Part II subject in that year; and

(c) a candidate enrolling in three subjects in any one academic year shall not enrol in more than two PaIl !II subje,cts in that year.

1. QUillificaiion for Admission to the Degree

(1) To qualify for admission t.o the degree a candidate shall pass nine subjects, including

2 A, candidate may select Computer Engineering II or Computer Enemcenng III, but not both.

(a) at kast two Pall III subjects from Scherlulrcs II. or 13,

(b) ;\lleast OllC of Mailicillatics HIli., lVJatllenlai.ics !lIB ;mel St'lf.istics lll,

(c) at least five snbjccts froll1 Schedule /\, including at least two Pall. II sllbjcons florn that Schedule.

(:.1) Up to foul' subjects from those offered if] oth'e1' dcgrrl~ cOlllses in the University with the tlie Dean, be counted as degree. When approving a Dean shall determine wllether it slJalllJc classified as P;ln I, 1"1Ii.

II 01 PaIt Jl r.

(I) To complete a sulJject ;] calldiclmc shilll auend such lee/mes, tlliori,ds, seminars, laboratory classes and field work and snllmit snell writ.len or Ollie!' \Vo!'k ,JS

the Department shall require.

(2) To pass a sllbjcct a candidate shall cOlnpkte it and pass such cxaminations as the FaCility HO;lrd shall require.

(j, 5iamlinr,

(1) The Faculty Board may ijrant stanriing in and unspecifieri subjects to a candidate, on condilions as it may determine, in recognition of work completed ill this University Of another institution.

(:2) Subject to sub· regulation (3) a calidiclillC iYlay not b(~ granted standing in more than foil<' subjects.

0) A candidate who is all undergfadll'ltc c<lndidale enrolled for a different dCijfCC of the linive!',ity lransf(~r

enrolment. to t.he degree of Bachelor of lV"ilIleIl", with such standing as the l'ilcnlty Board deems appropriate.

'/. Prerequisites illlIl C()n~qubii!'s

(1) Except with the permission of the Faculty Hoard gralHed after considering any {(:cormnendatio[J made by the Hearl of the DCpClIflYlelit, no candidate may en!'ol in a subject unless that candidate has jlJSSeD any subjects prescribed as its prerequisites at any gracle which may be specified anel has alreacly passed or concillfently enrols in Of is already enrolled in any subjects prescribed as its corcqlJi,sitcs.

(2) A candidate obtaining a Terminating Pass in a subject shall be deemed 1101 to have passed t.hat subject for prerequisite purposes.

3. Withdl'awl\!

(1) A canclidate may withdraw from a subject or the course only by informing the Secretary to the University in writing and the withdrawal shall Llke effect from the elate of receipt of such llot.ification.

(2) A. candidate who withdraws fi'om a subjcct after the last Monday in sc,cond term shall be deemed to have failed the subject save that, aftcr consulting with the Head of the Department, the Dean may grant permission for wilhdrawal without penalty.

TII(~ t'esult obl".incri hy a Sl)ccessfni cilndid'lte ill n subject slwll be:

'CenIlin'ltiul:'; P"5S, lfnW'lrlr:lil'ass, Pil.~S, Credit, LJistillCI.iOll, or fligh Distinctiol1.

/0, T!lI.IC ~!,c:;{pdr""\rM"

with tile spcciill !)crmissiofl of the Faculty llomr/, a shall COlIlplet.eo I!leo requirements fOf tile

within nine cillcllda,.· ye,iJ"S of the eOlilltlCnCC!lWJn llic rlef~rec course. 1\ ralldid'1te who has bccn gliHlWd standing in rccogniljoll of work completed elsewhere sllall be c!r,cl!]crilO have commence(i the deg!'ee course fWfll it datc to be r!ctcnnincd by lli(~ Oeml.

J, I{~cJaxhig Pn .. ndsioH

III meier to provide for except iOllal circlllnsl.ances m ising ill paniclIJ;lf case the SClI<1le 011 the recommendation of the Faculty Board may relax any jlrovision of t.hrosc Regulations.

COhlUinr(l Degrce Courses General

l\ candiriate may complete the requirements for the degrclO in conjuliction with allother Ba.chelor degree by completing a combined course approved by the Faculty Board ,lilt! also, where other (1egree is offered by another Faculty, 1 Ill', FacuIty Hoard of that. FaCUlty.

Atimissiol! to ~l Combined Degree Confsc

1:3, (a) shall he subject to the approval of the Dean or \hc Deans of the two FaCilIties as the case may be;

(b) shal!, except in exceptional circumstances, be at the (,m! of the candidate'S first year of emolmeJIt ill a clcp;roe; and

(c) shall be restricted to candidates with an average of at least credit. level who have passed Mathematics I at a level deemed satisfactory by ille Deaf!, or who have achieved a standard of performance deemed satisfactOly for the pur]JOSl'S of admission to a combinecl degree course by the Faculty Hoard.

'Che work Ilndenaken by il candidille in a combined. degree course shall be no less in quantity and quality thall if the two courses were taken separately as shall be certified by the Dean or the Deans of the two Faculties as the case may be.

15. To qualify for admission to the two degrees 11 candidate shall satisfy the requirements for both degrees except as provided in the following Regulations.

16. lViilthcmatics/ Al'ts

(1) To qualify for admission to the ordinary degrees of Bachelor of Arts and Bachelor of Mathematics, a candidate shall pass fourteen subjects which shall include:

(3) five subjects selected from Schedule A for the ordinary degree of Bachelor of Mathematics, of

II

which at least two are Part III subjects from that schedule, and

(b) nine other SUbjects, chosen from the subjects listed in the Schedule of Subjeets approved for the ordinary degIC{o of Bachelor of Arts.

17. Matl1ematics!§ciencl!

(1) To qualify fOl' admission to the ordinary degrees of Bachelor of Mathematics and Bachelor of Science, a candidate shall pass fourteen subjects as follows:

(a) four subjects, being Mathematics I, Mathematics IIA, Mathematics lIC and Mathematics IlIA;

(b) one subject from the following. namely Mathematics lIm, Computer Science III, Statistics III or a Part III subject chosen from the Schedules of Subjects approved for the degree of Bachelor of Mathematics; and

(c) six subjects chosen from the other subjects listed ill tile ScliC{iule of Subjects approved for the deg-rec of Bachelor of Science; and

(d) three subj("£t~, chosen with the approval of the Deans of the Faculties of Mathematics and Sciencc, from the subject~ approved for any of the degree courses offered by the University.

(2) The following restrictions shall apply to a candidate's choice of subjects, namely:-

(a) the number of Part I subjects shall no! exceed six;

(b) the minimum number of Part III subjects shall be three;

(c) a candidate counting Psychology HC shall not be entitled to count either Psychology IIA 01'

Psychology nB;

(d) a candidate counting Psychology mc shall not be entitled to coun! either Psychology IIIA 01' Psychology HIB;

(e) a cfmdidate counting Economics mc shall not be entitled to count either Economics IlIA or Economics ms; (1) candidate counting Geology nrc shall not be entitled to count Geology lIlA Of Geology mH.

Jl8. Matbematics/Commerce

To qualify for admission to the ordinary degrees of Bachelor of Commerce and Bachelor of Matilematics, a candidate shall pass sevelll.een subjects as follows:

(a) five subjects selected from Schedule A of the Regulatiolls Governing the ordinary degree of Bachelor of Mathematics, of which at least two are Part III subjects from that schedule, and

(b) twelve subjects which shall by themselvcs satisfy the rt'A:luii-Cllllenl!$ fol' the degree of Bachelor of Commerce.

19. MathematicsiEnginccring

To qualify for admission to the Ordinary degree of Bachclor of Mathematics and the degree of Bachelor of Engineering, a candidate shall pass:

(a) five subjects selected from Schedule A for the ordinary degree of Bachelor of Mathematics, of which at least two are Part III subjeets from that schedule, and

(b) other subjeets selected from the programme of subjects approved for the degrecs of Bachelor of Engineering (Mechanical), Bachelor of Engineering (Industrial), Bachelor of Engineering (Electrical), Bachelor of EngineCling (Chcmical), Bachelof of Engineering (Civil) Of Bachelor of Engineering (Computer), totalling a minimum of 48 units as calculated for those degrees.

20. Mathematics/Economics

To qualify for admission to thc ordinary degree of Bachelor of Economics and BachelOl' of Mathematics, a candidate shall pass seventeen subjeets as follows:

(a) five subjects selected from Schedule A of the Regulations Governing thc ordinary degree of Bachelor of Mathematics, of which at least two arc Part III subjc£ts from that schedule, and

(b) other subjects totalling a minimum of twelve poiuts which shall by themsclves satisfy the requirements for the degrec of Bachelor of Economics,

21. Mathematics/Computer Science

(1) To qualify for admission to the ordinary degrees of Bachelor of Mathematics and Bachelor of Computer Science, a candidate shall:

(a) pass fourteen subjecw, and

(b) complete to the satisfaction of the Head of the Dep31tment of Computer Science an essay on some aspect of the history or philosophy of Computer Science or the social issues raised by computer technology.

(2) The fOlllteell subjects presented for the degree shall confor1l1 to the following requirements:

(a) Not fewer than seven subjects shall be selected from the Schedule of Subjects for the ordinary degree of Bachelor of Computer Science in accordance with paragraphs (a), (b) aud (c) of Regulation 4(2) of the Regulations governing that degree;

(b) Nine of the subjects shall be selected in accordance with Regulations 4(I)(b) aud (c) and Regulation 4(2) of these Regulations;

(c) At least two Part III subjects shall bc selected from the Schedule of Subjects for the ordinary degree of Bachelor of Computer Science; and

(d) At least two Part III subjects, being subjects not included in the Schedule of Subjects for the ordinary degree of Bachelor of Computer Science, shall be selected from the Schedule of Snbj('£ts to these Regulations.

22, Mathematics/Surveying

To qualify for admission to the Ordinary degrce of Bachelor of Mathematics and the degree of Bachelor of Surveymg, a candidate shall pass:

(a) five subjects selected [rom Schedule A to the Regulations Govcrning the Ordlllary Degrec of Bachelor of Mathematics, of which at least two are PaIl III subjects from that schedule, and

(b) other subject~ selected from the programmc of subjccts approvcd for thc degrees of Bachclor of Surveymg, totalliug a minimum of 48 units as calculated for that dcgrcc.

SCHEDULES OF SUBJECTS Barhclol' of' Mathematics

S IIbject

Part I

Mathematics I

SCHEDULE A

Remarks

Computcr Science I

Part II

Mathematics IrA Mathematics lIC

Statistics II Computer Science II 4

Pal', HI

Mathematics IlIA

Mathematics mB Statistics III 4

Computer Science IIIA

It is assumed that studcnts have studied Higher School Certificate Mathematics at the 2.,unit level or higher. Nevertheless studeuts who studied only two unit Matllematics or who achieved less than 110 out of 150 in three unit Mathematics will find themselves seriously disadvantaged in this subject and should instcad study the subjeet Mathematics IS followed by Mathematics 102 in the subscqucnt ycar. COl'equisite Mathematics 1 3

Prerequisite Mathematics I 3

Prerequisite Mathematics I 3

Corequisite Mathematics IIA Prerequisite Mathematics I 3

Prerequisite Computer Science I

Prerequisites Mathematics IIA arid Mathematics HC Prerequisite Mathematics IIA

Prerequisite Statistics II Prerequisite Computer Science II

3 Students who have passed hoth Mathematics IS and Mathematics 102 will be considered as having satisfied prerequisite requirements of Mathematics I. S'ucces4ul completion of Mathematics IS and Mathematics lO?, will COHnt as onp. Part I Schedule A subject in lieu of Mathematics I.

4 Transition arrang""""'ts to 1986 will be det"rtrllned

candidates enrolled in the course prior particular cases by the Faculty Board.

Subject

SCHEDULE B

Remarks

Part I

Mathematics IS 3

Mathematics 10'1,3

Engineering I

Part IX

Mathematics JIB

Acconnting lIC

Civil Engineering lIM

Psychology HC

Part HI

Accounting mc Biology IlIB

Chemistry IIIA

Chemistry IIIB

Civil Engineering HIM

Communications &

This subject is for students who did not mcet the requirement of Mathematics I in that they have taken less than three units of Mathematics or have achieved less than 110 out of 150 in three unit Mathematics at the Higher School Certificate level. Note that Mathematics IS needs to be complemented with Mathematics 102 in the following year before further Mathematics subjects can he undcrtaken. Prerequisite Mathematics IS, This is a half subject which together with Mathematics IS provides a sufficient prerequisite for second year Mathematics subjects. It is assumed that students have studied Higher School Certificate Mathematics at the two"unit level or higher together with either Mllltistranci Science at the fOllr~ unit level or Physics at the two­unit level and Chemistry at the two-unit level.

Prerequisite Mathematics 1. The Dean lIlay permit a candidate to take this subject in two parts,

Prerequisites Accounting I & Mathematics I Prerequisites Engincering I & Mathematics r Prerequisites Mathematics I, Psychology L A candidate counting Psychology HC shall not be entitled to COUllt Psychology UA or Psychology lIB.

Prerequisites Accounting lIe.

Prerequisites Either Biology IIA or Biology lIB. Prerequisites Mathematics I, Chemistry I and Chemistry IIA

Prerequisites Mathematics I, Chemistry lIA Pl'e~ or Corequisite Chemistry IlIA Prerequisites Civil Engineering lIM. Prerequisite Mathematics HA.

13

Automatic Control Digital Computers & Automatic Control Economics mc Geology mc

Industrial Engineering I Mechauical Engineering mc

Physics InA

Psychology mc

Prerequisite Mathematics IrA.

Prerequisites Economics II 5

Prerequisites Physics lA, Geology IrA and Mathematics IIA. Prerequisite Mathematics IIA.

Prerequisites Mathematics IIA & Mathematics lIC (see Engineering HandboOk).

Prerequisites Physics II & Mathematics IlA. Prerequisites Psychology lIC or Psychology IIA and Psychology lIB.

:5 Tit?] [)ean, Faculty of Mathematics, should be consulted /0 ensure ~hal lhe appropriate Statistics background ff1LJlerial for Econometrics I lS covered.

14

NOTE ON SUBJECT AND TOPIC DESCRIlPTIONS

The subject and topic outlines and reading lists which follow are set out ill a standard format to facilitate easy reference. An explnnatioll is given below of some of the technical terms used iu this Handbook.

arc subjects which must be passed before a enrols in a particular subject. The 0 nl y

prerequisites noted for topics arc any topics or subjects which must be taken before enrolling in the particulur topic. To enrol in any subject which the topic may be pent of, the prerequisites for tllat snbject must still be satisfied.

Where a prerequisite is marked as advisory, leclnrcs will be given on the assumption that the sul~ject or topic has been completed as iUdicated.

COl"cquisites for subjects are those which the candidate mllst pass hcfore enrolment or be taking concurrently.

Corequisitcs for topics are those which the candidate must take before enrolmenl or be taking coucurrently.

Examinatioll Under examination regulations "examination" includes mid-year examinations, assignments, tests or any other work by which the final graclc of a candidate in a subject is assessed. Some attempl has been made to indicate for each subject how asseSSll1ent is determined. See particularly the geueral statcment iu the Department of Mathematics scction headed "Progressive Assessment" referring to Mathematics subjects.

Texts are essential books recommended for purchase.

References are books relevant to the subject or topic which, however, need not be purchased.

The following academic staff have been appointed comse coordinators and should be consulted in c~se of difficulty:

Compnter Science f Simon Computer Science II/IlT

Computer Science InA/ruB/lUI' Dr. J .Rosenberg

Dr. D.W.E.HIatt

Further information about computer science courses appears in the section Notes on Degrees and Diplomas.

Students enrolling in Computer Science subjects do not formally ellJ'ol in their constituent topics. However, Computer Science IV and IVM students, and students who as part of any other Computer Science subject wish to take topics other than exactly as described ill the relevant subjcct description, mllst first obtain permission from the I-lead of the Department of Computer Science.

FART K COMPUTER SCmNCE SmlJECT

GaliOO COtvlPUTIUI, SCXENCE 1

Corequisite Mathematics I

I10urs :; lcctme hours and 2 lahoratory hours per week.

Examinations Two 2AlOtJr papers and one 2··honr lllic!··year paper.

Content

llllroduction to the following aspects of computer science: The design of algorithms. The theory of algorithms. How algorithms are executed as programs by a computer. The fUIlctions of system software (compilers and operating systems). Applications of computers. Social issues raised by computers. An extensive int.roduction to programming in Pascal and a shorter introduction to programming in FORTRAN 71.

Texts

Goldschlager, L. & Lister, A. Computer Science, A Modern Introduction (Jnd ed. Prentice-Hall 1987)

and either

Cooper, D. Condensed Pascal (Norton 1987)

or

Savitch, W.J. Pascal. An Introduction to the Art and Science of Programming ( 2nd cd. Benjamin/Cummings 198'1)

l~AR.T II COMPUTEH SCIENCE SUBJECTS

Computer Science II is the normal Part II computer science subject for students enrolled in all degrees. As a transitional anangemeut, certain students who enrolled before 1986 and who have not taken Computer Science I may enrol in Computer Science IIT. Data Processing II is an optional subject in the B.Comp.Sc. dq"rree.

682100 COMPUTER SCIENCE n Prerequisite Computer Science I

Hours 4 lecture hours and approx. 4 hours of tutorials and practical work per week

Examinations By topic

15

Content

This subject comprises the four topics:

Assembly Language Commercial Programming Comparative Programming Languages Data Stmctures & Algorithms

Descriptions of these topics appear as the subject descriptions for the Diploma in Compnter Science subjects of the same names.in Section Six.

682900 COMXllUTlE:R SClfENCE HT

Prerequisite Mathematics I

Hours 4 lecture hOllrs and approx. 4 hours of tntorials and practical work per week

Examinations By topic

Content

This subject comprises the four topics:

Introduction to Programming Assembly Language Comparative Programming Languages Data Structures & Algorithms

Descriptions of thcse topics appcar as the subject descriptions for the Diploma ill Computer Science subjects of the same names in Section Six.

682110 llMTA PROCESSING lfl[

Prerequisite Computer Science I

Hours 4 lecture hours and approx 4 hours of tutorials and pmctical work per week

lZxaminatiollJ' Dy topic

Coment

This subject comprises the foul' topics:

Microcomputers in Business Analysis Design Methods and Techniques

r'{'~(','inl·;"'1q of the first three topics appear as the subject (ie:seriptiOiiIS for flle Diploma in CompU11"f Science suhjects of ~he Sllme names in Section Six .. At the time of going to press 110 of thc fourth topic is available.

r.')AIrr If)[lf COMlP'llrrJli:n SC][ll':NCR §UBJEC')fS

COlnIllli,;f Science HIA is the Ilorrm\! Part III compnter 3!;ienee for sKuden!s enrolled ill all degrees. Students .mroHed ill the BCompSc. degree may also enrol in

Science HIB. As a special transitional !'l'Kll'ilgement only, students who enrolled in a EMatl! degree hefore 1986 and who have not taken Computer Science I may, tiftct Computer Science II or lIT as

in Computer Science InT.

4'itlJ2@@ COMI"l!JTllU;g, §CJmNCE ]I]][A

CCillflll!lliol' Science n P!!SS{\d in oj' since 1987

Ut)Uf'S <1 1!0I1J!1l l}lJX' wee!" wil11 t!!toriais as l't'AIllirei!, tll(!Ool~mll'

Examination By topic, plus a report on the project lilldcrtaken

Content

This subject comprises a project, and the four topics:

Software Engineering Principles Compiler Desigu Operating Systems Database Design

Deseriptious of these topics appear as the subject descriptions for the Diploma in Computer Science subjects of the same names in Section Six.

683300 COMPUTER SCIENCE nm Prerequisite Computer Science II passed in or since 1987 and Mathematics II CS

Hours 4 lecture hours per week, with tutorials as rcquired, plus a 100-hour project

Examination By topic, plus a report ou the project lmdertaken

Content

This subject comprises a project, and the four topics:

Artificial Intelligence Programming Techniques Computer Networks Compllter Graphics Theory of Computation

Descriptions of these topics appear as the subject descIiptions for the Diploma in Computer Science subjects of the same names in Section Six.

StudellIs concurrently enrolled in Computer Scicnce IIIA and mB will generally undertake one combined double-si?:ed project for the two subjects.

683900 COMPUTER SCIENCE HIT

Prerequisite Computer Science ID', or Computer Science II passed before 1987

flours See individual topics

E.xamination By topic

Content

The subject comprises five topics, including topics 1 to 4 of the list of topics given below. The fifth topic must be topic 5 of the list if that has not already been studied in Computer Science II or lIT; if topic 5 has already been studied, the fifth topic will be chosen from topics 6 to 9 of the list.

1. Software Engineering Principles 2. Compiler Design 3. Operating Systems 4. Database Design 5. Commercial Programming

6. Artificial Intelligence Programming Techniqucs 7. CompnterNetworks 8. Compntef Graphics 9. 'fheolY of Computation

Descriptions of these topics appear as the subject descriptions for the Diploma in Computer Science subjects of the same llames ill Section Six.

The following academic staff have been appointed course coordinators ,rnd should be consulted in case of difficulty:

Mathematics I Dr W.P.Wood Mathematics IS Mr MJ.Hayes Mathematics II Dr.W.Summerficld Mathematics In Dr J.G .Couper

Preliminary Notes

The Department of Mathematics offers and examines subjects, most being composed of topics, each single-unit topic consisting of about 27 lectures and 13 tutorials. Each of the Part I, Part II and Part !II subjects consists of the equivaleut of four single-unit topics. For Mathcmatics I, Mathematics IS, Mathematics 102 and Mathcmatics IICS there is flO choice of topics; for Mathematics ITA, lIB aud lIC there is some choice available to students; for Mathematics IlIA and HIB there is a wieler choicc. No topic may be cOllnted twice in making up distinct subjects.

Progressive Assessment

From time to time during the year students will be given assignments, tests, etc. Where a student's performance in the year has been better than that student's performance in the final examination, then the year's work will be taken into account in determining the final result. On the other hand, when a student's performance during the yesJ has been worse thau that student's performance in the final examination, then the year's work will be ignored in determining the final result. However, performance during the early part of the year is taken into account when considering exclusion for "unsatisfactOlY progress".

Further information about mathematics courses appears in the section Noles on Degrees and Diplomas.

PART I MATHEMATICS SUBJECTS 661100 MATHEMATICS I

Advisory Prerequisite Students intending to study Mathematics I arc advised that although the minimum assumed knowledge for Mathematics I is 2 units of Mathematics at the Higher School Certificate, nevertheless studcnts who have less than 3 units of preparation will usually lind themselves seriously disadvantaged.

lIours 4 lecture hours and 2 tutorial hours per week

Examination Two 3-hol1l' p~pers

Content

The following four topics:

Algebra Real Analysis Calculus Statistics and Computing

Texts

University of Newcastle Mathematics j Tutorial Notes (1988)

Anton, H Elementary Linear Algebra 5th edn (Wiley 1987)

Einlflore, K.G. Mathematical Analysis: A Straightforward Approach 2nd edn (Cambridge University Pcess 19(2)

Farrand, S & Poxon,NJ. Calculus (Harcourt Drace Jovanovich, 1984)

References See under individual topics

MATHEMATICS K TOPIC DESCRIPTIONS

Algebnl

Lecturer P.K. Sma

Induction. Binomial Theorem. Vector geometry in two and three dimensions. Matriccs. Solution of systems of linear equations. Vector spaccs, basis and dimension, snbspaces. Determinants. Linear maps, matrix representatiou, rank and llullity. Eigcnvectors and eigenvalues. Applications.

References

Brisley, W A Basis for Linear Algebra (Wiley 19'/3)

Johnson, R.S. & Vinson, T.O. Elementary Linear Algebra (Harcourt Brace JovlJnovich 1987)

Kolman, B Elementary Linear Algebra (Macmillan 1977)

Liebeck,H Algebra for Scientists and Engineers (Wiley 1971)

Lipschutz, S Linear Algebra (Schaum 1974)

Real Analysis

Lecturer LR. Giles

The real numbcr system. Convergence of sequences and series. Limits and continuity of functions. The theory of differentiation and integration. Polynomial approximation and Taylor's series.

References

Apostol, T. Calculus Vol. I 2nd e<ln (Blaisdell 1967)

Clark, C.W. Elementary Mathematical Analysis (Wadsworth­Brooks 1982)

Giles, J.R. Real Analysis: Anfntroductory Course (Wiley 1972)

Spivak, M. Calculus (Benjamin 1967)

Calculus

Lecturer R.F. Berghout

Revision of differentiation and integration of polynomials and trigonometric fnnctions. Differentiation of rational fUilctions and of implicit and parametrically defined functions. Definition and properties of logarithmic, exponential and hyperbolic functions. Complex numbers. Integration by parts and by substitution tcchniques. Integration of rational functions. First order sepmable and linear differential equations. Second order linem differential

17

equations with constant coefficients. Simple three·· dimensional geometly of curves ami surfaces.

R~ferences

Ayres, F. Calculus (Schaum 197;)

Edwards, C.H. & Penney, D.E. Calculus and Analytical Geometry (Prentice·Hall 1982)

Stein, S.K. Calculus and Analytical Geometry 3rd edn (McGraw·· Hill 1982)

Statistics & Computing

Lecturers AJ. Dobson & W.P. Wood

An introduction to elementary llumerical analysis and computing, including finding roots and estimating integrals. Programming in Pascal starts early in the course, and studcnts are required to compose and nse effective programs and carry out laboratory work.

An introduction to statistics: exploratory data analysis, uncertainty and random variation, probability, nse of MINITAB.

Note:

Text

Students intending to pursue computing studies should also obtain one of thc references for Pascal listed below.

Freedman, D., Pisani, R. & Purves, R. Statistics (W.W.Nonon & Co. 1978)

Referencesfor Pascal

Cooper, D. & Clancy, M. Oh! Pasco I 2nd edll (W.W. Norton & Co. 1982)

Koffman, E.B. Problem Solving and Structured Programming in Pascal 2nd edn (Addison·Wesley 1985)

Savitch, W.J. Pascal. An Introduction to the Art and Science of Programming (Benjamin/Cummings)

Other References

Conte, S.D. & de Boor, C. Elementary Numerical Analysis 3rc! edn (McGraw·HilI 1980)

Ryan, B.F., Joiner, B.L. & Ryan, T.A. Minitab IIandbook 2nd edition (Duxbury Press, Boston 1985)

661200 MATHEMATICS IS

Lecturer MJ.Hayes

This subject is designed to help the students who are likely to finc! great difficulty in passing Mathematics I. The Mathematics Department strongly recommends that students who have done only 2·unit mathematics, or 3-unit mathematics with a mark of less than 110, in the Higher School Certificate, should enrol in Mathematics IS rather

18

than in Mathematics 1. We recommend this because of the very high failure rate for such students in prcvious years.

Mathematics IS will consist of one half of Mathematics [ namely the calculus, statistics and computing sectionS: some revision work in basic school mathcmal.ics, and some work introductory to the remaining algebra and analysis sections of Mathematics I. It will have 6 hours of leclures and tutorials a wcek for the full year, the same as Mathematics I. It will be taught in small groups, where the accent will be on the students doing mnch IlIOTe supervised practice in solving problems than is possible in Mathematics 1.

Students wishing to proceed to a second year mathematics subject, for example students in the Engineering and Mathematics Faculties, after they have passed Mathematics IS, mllst then psass Mathematics 102, which consists of the remaining algebra and analysis sections of Mathematics 1. Thccs stndents may count Mathematics IS and Mathematics 102, as thc equivalent of the full subject Mathematics I, in their degrec.

It is possible for students in the Arts and Science Faculties to count Mathematics IS as a full subject in their degree, though it would not qualify these students to cuter a second year mathematics subject.

Examination To be advised

Content

Differentiation of trig, log, expollential and hyperbolic functions. Geometry of lines, planes, conics; vectors. Methods of integration. Centres of gravity. Complex nnmbers. Differentjal equations. More geometry of curves and survaces.

Elementary algebra and algebraic manipulations. Binomial theorem, iuduction, elementary probability. Numerical analysis: estimating roots of equations and integrals. Computing, using Pascal. Introduction to statistics: exploratory data analysis, uncertainty and random variation, probaability, use of MIN IT AB.

Text

Freedman, D., Pisani, R. & Purves, R. Statistics (W.W.Norton & Co. 1978)

(Texts [or calculus and computing to be advised.)

References

Ayres, F. Calculus (Schaum 1974)

Edwards, C.H. & Peuney, D.E. Calculus and Analytical Geometry (Prentice·llall 1982)

Stein, S.K. Calculus and Analytical Geometry 3rd edn (McGraw· Hill 1982)

Cooper, D. & Clancy, M. Oh! Pascal 2nd eeln (W.W. Norton & Co. 1982)

Koffman, E.B. Problem Solving and Structured Programming in Pascal 2nd edn (Addison·Wcsley 1985)

Savitch, W.J. Pascal. An Introduction to the Art and Science of Programming (Benjamin/CulJlmings)

Conte, S.D. & de Boor, C. Elementary Numerical Analysis 3rd cdB (McGmw· fIil! 1980)

Ryan, B.F., Joiner, B.L. & Ryan, T.J\. Minitab /landbook 2nd editioll (Duxbmy Press, Boston] 985)

6613()() MATHEMlATlCS 102

This is a half suhject, which is an upgrade [or students who have passed Mathematics IS.

Ilours 2lccture hours and I tlltorial hour per week

Examination One 3 hour paper

Content

As for the topics "Algebra" ilnd "Rca! Allillysis" in Mathematics 1.

Note;

Mathematics IS is not a sufficient prerequisite [Of any further Mathematics subjects, except Mathematics 1 02. However, Mathematics IS followed by Mathematics 102 is acceptable as a prerequisite in all cases where Mathematics I as acceptable as a prerequisite.

PAIn n MATHEIVIATICS SUBJECTS

The Department offers three Part II Mathematics subjects. The subject Mathematics IrA is a pre·· or coreqllisite for Mathematics lIC, and llA is a prerequisite for both Mathematics lilA and HIB. Students who wish to include Mathematics ilIA in their third year programme must succeed in both Mathematics IrA and IIC.

The Department also offers the subject Mathematics lICS (jointly with the Department of Statistics).

When selecting topics for Part II subjects, students are advised to consider the prerequisites needed for the various Part III topics offered in the Faculty of Mathematics.

List of 'i'Opkli for Part U lvlilltlicmatic§ 5ubj{!cts

All Part II Topics have Mathematics I as prerequisite

Topic Corequisite or Part III Topic having Prerequisite Topic this Part II

as

A Mathematical Models CO

B Complcx Analysis CO Q,W

CO Vector Calculus & M, N, P, PD, Q, Differential Erjuarions QS, U, W,Z (Double Topic)

D Linear Algebra P,'J',W,X,Z

E Topic in Applicd CO Mathematics e.g. Mechanics and Potcntial Theory

F Numerical Analysis & Computing

G Discrete Mathematics

K Topic in Pure Mathematics T,W,X e.g. Group Theory

L Analysis of Metric Spaces CO V,W

The selection rnles am! definitions of the Part II snl.1iects follow.

Notes: 1. Stnc!ents whose comse includes a Schedule B subject may have their choice of topics specified further thiU! is sct out in the rules below.

2. Students whose course iucludes Physics IIIA are advised to include topics CO, B and at least one oCD, F in their Mathematics Part n subjects.

3. Students who take all three subjects Mathematics IIA, IIB, lIe will be required to take the nine topics above together with either Probability and Statistics or Topic S (Geometry) with some other suitable third year topic. Such students should conslllt the Head of the Depmtmcnt cOllcerning the appropriate choice.

4. Students who take Mathematics IICS together with Mathematics IIA will substitnte a suitable topic for D in Mathematics IlA.

662100 MATHEMATICS HA

Prerequisite Mathematics I

flours 4 lecture hours and 2 tutorial homs per week

Examination Each topic is examined separately

Content

Topics B, CO and D. In exceptional circumstances and with the consent of the Head of the Department some substitution of topics may be allowed.

662200 MATHEMATICS un Prerequisite Mathematics I

flours 4 lecture hOUI'S and 2 tutorial homs per week

Examination Each topic is examined separdtely

19

Content

Fom topics chosen from A to G, where CO counts as two topics, ancl approved by the Head of the Department. In exceptional circumstances and with the consent of the Hcad of the Department one of the topics from Statistics II (offered by the Department of Statistics), K or L may be inclueleel. Stuelents in the Faculty of Mathematics may, with the consent of the Dean, take Mathcmat.ics lIB in two parts, each consisting of two topics.

662300 IViATHEMATICS HC

Prerequisite Mathematics r Corequisite Mathematics IIA

flours 4 hx;tufe hours and 2 tutorial homs per week

1Xamination Each topic is examined sepm'atcly

Content

Topics K, L plus either two topics chosen from A to G, or Probability and Statistics (the elouhle topic offered by the Department of Statistics), or one topic chosen from A to G together with Rmlelom Processes anel Simulation (offered by the Department of Statistics). Under exceptional circumstances, and with the consent of the Head of the Department, some substitution may be allowed.

662410 MATHEMATICS ncs

frerequisite Mathematics I

Hours 4 lecture hours and 2 tutorial hours per week

Examination Each topic is examinee! separately

Content

Topics D,G,F and Random Processes and Simulation (offered by the Deparunent of Statistics).

PART n MA'THEMATICS TOPICS

662101 TOPIC A ., MATHEMATICAL MODELS

Lecturers W.T.F. Lau (1st Semester) A. Stema-Karwat (2nd Semester)

Corequisite Topic CO

flours 1 lecture hour per week and 1 tutorial hour per fortnight

Examination One 2,honr paper

Content

This topic is designed to introduce students to the idea of a mathematical model. Several realistic situations will be treated beginning with an analysis of the non-mathematical origin of the problem, the formulation of the mathematical model, solution of the mathematical problem and interpretation of the theoretical results.

Text Nil

References

Andrews, J.G. & MeClone, R.R. Mathematical Modelling (Butterworth 1976)

20

Bender, E.A. An Introduction to Mathematical Modelling (Wiley 1978)

Boyce, W.E. (cd.) Case Studies in Mathematical Modelling (Pitman 1981)

Dym, C.L. & Ivey, E.S. Principles of Mathematical Modelling (Acadcmic 1980)

Haberman, R. Mathematical Models (Prentice-Hall 1977)

Kemeny, J.G. & Snell, J.L. Mathematical Models in Social Sciences(B1aisclcll 1963)

Lighthill, J. Newer Uses of Mathematics (Pcnguin 1980)

Noble, B. Applications of Undergradu!lte Mathematics in Engineering (M.A.A.!Collier--Macmillan 1967)

Smith,1.M. Mathematicalldeas in Biology (Cambridge 1971)

Smith,I.M. Models in Ecology (Cambridge 1974)

662102 TOrIC B ., COMPLEX ANALYSIS

Lecturer M.J. Hayes

Corequisite Topic CO

IIours 1 lecture hour pCI' week and 1 tutorial hour per fortnight

Examination One 2,hour paper

Content

Complex numbers, Cartesian and polar forms, geometry of the complex plane, solutions of polynomials equations. Complex functions, mapping theory, limits and continuity. Differentiation, the Cauchy, Riemann Theorem. Elementm'Y fnnctions, exponential, logarithmic, trigonometric and hyperbolic functions. Integration, the Cauchy-Goursat Theorem. Cauchy's integral formulae. Liouville's Theorem and the Fundamental Theorem of Algebra. Taylor and Laurent series, analytic continuation. Residue theory, evaluation of some real integrals and series, the Argument Principle and Ronche's Theorem. Conformal mapping and applications.

Text Nil

l?eferences

Churchill, R.V., Brown, l.W. & Verhey, R.F. Complex Variables and Applications (McGraw--Hill 1984)

Grove, E.A. & Ladas, G. Introduction to Complex Variables (Houghton Mifflin 1974)

Kreysig, E. Advanced Engineering Mathematics (Wiley ]979)

Levinson, N. & Redheffer, R.M. Complex Variables (Holden, Day 1970)

O'Neill, P.V. Advanced Engineering Mathematics (Wadsworth 1983)

Spiegel, M.R. Theory and Problems of Complex Variables (McGrilw-HiIlI964)

Tall, D.O. Functions of a Complex Variable l and II (Routlcdge and Kegan Paul 1970)

662109 TOPIC CO ., VECTOR CALCULUS & DIFFERENTIAL EQUATIONS

Lecturer W. Snmmerfield

Prerequisite Nil

flours 2 lecture hours pCI' week and 1 tutorial hOllr per week

Examination One 3,hollf paper

Content

Differential and integral calculus of funclions of several variables: partial derivatives, directional derivative, chain rule, Jaeobians, multiple integrals, Ganss' and Stokes' theorems (with Green's rllCorem as a special case), gradient, divergence and curl. Conservative vector fields. Taylor's polynomial, stationary points. Fourier series: generalisation. First order ordinary differential eqnations: separable, homogeneous, linear. Applications. Higher order (mainly second) linear differential equations: general solution, initial (and boundary) value problems, solution by Laplace transfOl'm. Series solution about ordinary point and regular singular point. A little on Bessel [nnetions, Legendre polynomials and applications of higher order eqnations if lime permits. Stmm,Liollville systems. Second order linear partial differential equations: Laplace, Wave and Diffusion eqnations.

Text

Kreyszig, E.

or

Advanced Engineering Mathematics 5th edn (Paperback, Wiiey 1979)(5th edn is preferable but 4th edn will snffice)

Greenberg, M.D. Foundations c<f Applied Mathematics (Prentice-Hall) (1978)

References

Amazigo, I.C & Rubenfeld, L.A. Advanced Calculus and its Applications to the Engineering and Physical Sciences (Wiley 1980)

Boyce, W.E. & Di Prima, R.C. Elementary Differential Equations and Boundary Value p'roblems (Wilcy 1986)

Churchill, R.V. & Brown, I.W. Fourier Series and Boundary Value Problems (McGraw-Hili 1978)

Courant, R. Differential and Integral Calculv.s VoUI (Wiley 1968)

Edwm'ds, CH. & Penney, D.E. Calculus and Analytic Geometry (Prentice-Hall 1982)

Finizio, N. & Ladas, G. Ordinary Differential Equatiolls with Modern Applications 2nel edn (WadswOllh 198?)

Greenspan, RD. & Benney, D.1. Calculus .. an Introduction to Applied Mathematic.! (McGra~/-Hill 1973)

Haberman, R. Elementary Applied Partial Differential Equations (Prentice, Hall 1983)

O'Neill, P.V. Advanced Engineering Mathematics (Wadsworth 1983)

Piskunov, N. Differential and Inlegral Calculus Vo!.1 and II 2nd edn (Mir 1981)

Powers, D.L. Boundary Value Problems (Academic 1972)

Spiegel, M.R. Theory and Problems of Vector Analysis (Schaum 1959)

Spiegel, M.R. Theory and Problems of Advanced Calculus (Schaum 1974)

Stein, S.K. Calculus and Analytic Geometry 3rel edn (McGraw­Hill 1982)

Stephenson, G. Partial Differential Equations for Scientists and Engineers 3rd edn (Longman 1974)

662.104 TOPIC D - UNEAH ALGEBRA

Lecturer RB. Eggleton

Prerequisite Nil

Jl ours 1 lecture hour per week and 1 tutorial hour per fortnight

Examination One ?-hour paper

Contelll

First semester: A brief review of some material in the algebra component of Mathematics 1. Linear maps, matrix representations. Diagonalisation, eigenvalnes and eigenvectors. Inner product spaces. Orthogonal, unitary, hermitian and normal matrices. Difference equations, Quadratic forms. Linear programming.

Second semester: Gram .. Schmidt process, upper triangular matrices. Characteristic and minimum polynomials. Cayley·­Hamilton theorem. Duality. Jordan form. Some Euclidean geometry, isometries, dimensional rotations.

Text Nil

Riferences

Anton, H. Elemelllary Linear Algebra 4th edn (Wiley 1984)

Bloom, D.M. Linear Algebra and Geometry (Cambridge 1979)

Brisley, W. A Basis for Linear Algebra (Wiley 1973)

21

Lipschutz, S. Linear Algebra (Schaum 1974)

Nering,E.D. Linear Algebra and Matrix Theory (Wiley 1964)

Reza, F. Linear Spaces in Engineering (Ginn 1971)

Roman, S. An Introduction to Linear Algebra (Saullders 1985)

Rones, C. & Anton, H. Applications of Linear Algebra (Wiley 19'/9)

662201 TOPIC E ., TOPIC XN APPUE)J MATHlRMATICS E.G. MECHANICS AND POTENTIAL THEORY

Lecturer C.A. Croxton

Corequisite Topic CO

l! 0 urs 1 lecture hour per week and 1 tutorial hour per fortnight

Examination One 2··hour paper

Content

Summary of vector algebra. V clocity and accelerations. Kinematics of a particle. Newton's Law of Motion. Damped and forced oscillations. Projectiles. Ccntral forces. Inverse square law. The energy equation. Motion of a particle system. Conservation of linear momentum and of angular momentum. Motion with variable mass. Field intensity and potential Gauss theorem. Poisson's Equation. Images. Uniqueness theorem.

Text Nil

References

(See references given ill Topic CO)

Chorlton, F. Textbook of Dynamics (Van Nostrand 1963)

Goodman, L.E. Dynamics (Blackie 1963)

Marion, J.B. Classical Dynamics (Academic 19'/0)

Meirovitch, L. Methods of Analytical Dynamics (McGraw-Hill 1970)

662202 TOPIC If - NUMERICAL ANALYSIS & COMPUTING

Lecturer J.G. Couper

Prerequisite Nil

/lours 1 lectnre hour per week aud 1 tutorial hour per fortnight

Examination One 2-hour paper

Content

FORTRAN. Sourccs of error in computation. Solution of a single non lin em' equation. Interpolation and the Lagrange interpolating polynomiaL Finite differences and applications to interpolation. Numerical differentiation and integration including the trapezoidal rule, Simpson's rule and Gaussian integration formulae. Numerical solution of ordinm'Y

22

differential equations .. Runge-KUlla and predictor-corrector methods. Numerical solutioIl of linear systems of algebraic equations. Applications of numerical methods to a]Jplied mathematics, engineering and the scicnces will be made throughollt the course.

Text

Burdell, R.L. & Faires, J.D. Numerical Analysis 3rt! edn (Prindle, Weber & Schmidt 1985)

References

Atkinson, ICE. An Introduction to Numerical Analysis (John Wiley)

Balfour, A. & Marwick, D.H. Programming in Standard Fortran 77 (Heinemann 1986)

Chemey, W. & Kincaid, D. Numerical Mathematics and Computing 2nd cdn (Brooks-Cole 1985)

Cooper, D. & Clallcy, M. Oh! Pascal! (Wiley 1985)

Crawley, l.W.& Miller, CE. A Structured Approach to Fortran (Prelllice··Hall 1983)

Etter, D.M. Problem Solving with Structured Fortran n (Benjamin 1984)

Etter, D.M. Structured Fortran 77 for Engineers and Scientists (Benjamin 1983)

Gerald, CF. & Wheatly, P.O. Applied Numerical Analysis (Addison-Wesley)

Milrateck, S.L. Fortran 77 (Academic 1983)

McCracken, D.D. Computing for Engineers and Scientists with Fortran 77 (Wiley 1984)

McKeown, P.G. Structured Programming Using Fortran n (Harcourt 1985)

Handbook for VAX/VMS (Uni. Ncle Computing Centre 1983)

VAX-ll Fortran (Uni. Ncle Computing Centre 1983)

662203 TOPlC G - DISCRETE MATHEMATICS

Lecturer R.B. Eggleton

Prerequisite Nil

Hours 1 lecture hour per week and 1 tutorial hour per fortnight

Examination One 2-hour paper

Content

Logic, propositions, proofs. Fundamentals of set theory. Relations and functions. Basic combinatorics. Undirected and dircctccl graphs. Boolean algebra and switching theory.

Text

Skvarcius, R. & Robinson, W.B. Discrete Mathematics with Computer Science Applications (Benjamin/Cummings 1986)

Re(erences

Grimaldi, R.P. Discrete and Combinatorial Mathematics (Addison· Wesley 1985)

Kalmanson, K. An Introduction to Discrete Mathelllaiics and its Applicatiolls (Addison·Wesley 1986)

Dierker, P.P. & Voxman, W.L. Discrete Mathematics (Harcourt Brace Jovanovich 1986)

667.303 TOPIC Ie "TOPIC IN POJ.U~ MATnmVIATIC§ er, GnOUp THEOHY

Lecturer W. Brisky

Prerequisite Nil

II ours 1 lecture hour ]Jer week and 1 tutorial hour per fortnight

Examination One 2-hour paper

Content

Groups, subgroups, isomorphism. Permut.ation groups, groups of linear transformations and matrices, isometries, symmetry groups of regulm' polygons and polyhedra. Cosets, Lagrange's theorem, normal subgroups, isomorphism theorems, correspondence theorem. Orbits, slabilisers, and their applications to the J3urnside··Polya counting procedure. Classification of finile groups of isometries.

Text

Leclennann, W. Introduction to Group Theory (Longman 1976)

References

Baumslag, B. & Chandler, B. Group Theory (Schaum 1968)

Blldden,FJ. The Fascination of Groups (CUP 1972)

Gardiner, CP. A First Course in Group Theory (Springer 1980)

Herstein, LN. Topics in Algebra 2nd edn (Wiley 1975)

Weyl, H. Symmetry (Princeton 1952)

662304 TOPIC L ., ANALYSIS OF METRIC SPACES

Lecturer l.R. Giles

Corequisite CO

Hours 1 lecture hour per week and 1 tutorial hour per fortnight

Examination One 2-hOllr paper

Content

Examples of metric am! normcclliuear spaces. Convergence of sequences, completeness. Cluster points and closed sets. Compactness. Continuity of maps, l1niform continuity and continuity of linear maps. Finite dimellsiollal normed lincm' spaces. Uniform convergence, Contraction mappings.

Text

Giles, J.R. Intmeluetioll to the Analysis of Metric 5'paces (CUP 198'/)

Rrjerences

Bartle, R.G. The Wements of Real Analysis (Wiley 1976)

Giles, J.R. Real Analysis: An IntmductOlY Course (Wiley 19'12)

Goldberg, R.n.. Methods of Real Analysis (Ginn Blaisdell 19(4)

Simmons, G.F. Introduction to Topology and Modern Analysis (McGraw"HiIl1963)

White, A.1. Real Analysis (Addison Wesley 1968)

PART xn MATHEMATICS §UBJECTS

The Depmtment offers Mathematics IlIA and Mathematics nm, each comprising four topics chosen from the list below.

Students proceeding to the degree of Bachelor of Mathematics and taking either Mathematics lIlA' or Mathematics IIIB will be required to complete an essay on a topic chosen from the history or philosophy of Mathematics.

Students wishing to proceed to Mathematics IV are required to take Mathematics lIlA and at least one of Mathcmaties InB, Statistics III or Computer Science m. Students who wish to proceed to Honours will normally be requirecl to study additional topics as prescribed by the Heads of the Departments concerned. Students proceeding to Honours axe requirccl to prepare a seminar paper under supervision, and deliver it in a half-hour session. They may submit this paper as their essay requiremcnt.

Both Mathematics IIA and lIC are prerequisites for entry to Mathematics IIIA. Mathematics IIA is the prerequisite for Mathematics IllB.

Students from other facuIties who wish to enrol iu particular Part III topics, according to the course schedules of those Faculties, should consult the pmticulars of the list below, and should consult the lecturer concemed. In particular, the prerequisites for subjects may not all apply to isolated topics.

23

List of TOllil:§ for Pal't HI Matliematil:s Subjects

Students who are relying on second-year subjects taken before 1986 should consult the lecturers concerned for tmnsition arrangements for prerequisite topics.

Topic Prerequisite(s)

M General Tensors and Rclativity CO

N Variational Methods iJJld Integral CO Equations

o

P PD

Q QS

S T U V W x z

Mathematical Logic and Set Theory

Ordinary Differential Equations Partial Differential Equations

Fluid Mechanics

Quantum and Statistical Mechanics Geometry

Basic Combinatorics Introduction to Optimisation Measure Theory & Integration

Functional Analysis

Fields & Equations Mathematical Principles of Numerical Analysis

CO,D

CO CO,B

CO

D,l(

CO L B, CO, D, K, I. D,K CO,D

Some topics may be offered in alternate years, and, in particular, some may be available as Mathematics IV topics.

The selection rules and definitions of the Part III subjects follow. Notes:

1. In order to take both Mathematics IIIA and Mathematics lIIB, a sltJdent must study at least eight topics fmm the above with due regard to the composition of Mathematics IlIA.

2. Students aiming to take Mathematics IV may be required to undertake study of extra topics. They should consult the Head of Department concerning the <UTangements.

663100 MATHEMATICS HlA

Prerequisites Mathematics IrA & HC

flours 4 lecture hours and 2 tutorial hours per week

Examination Each topic is examined separately

Content

A subject comprising Topic 0, together with three other topics chosen from those listed above, at least one of which should be from the set (P, S, T, U, V, W, X) and one from (M, N, PD, Q, QS, Z). The final choice of topics must be approved by the Head of the Department.

663200 MATHEMATICS mB Prerequisite Mathematics IIA

lIours 4 lecture hours and 2 tutorial hours per week

Examination Each topic is examined separately

2A

Content

A subject comprising four topics chosen from those listed above. In some circumstances, a suitable third year topic from another Department in the Faculty of Mathematics may be included. Students should consult members of academic staff regarding their choice of topics. Thc final choice of topics must be approved by the Head of the Department.

PART HI MATHEMATICS TOPICS

663101 TOPIC M " GENERAL TENSORS AND RELATXVXTY

Lecturer P.K. Smn

Prerequisite Topic CO

Hours 2 lecture hours and 1 tutorial hom per week for 1st half year

Examination One 2··hour paper

Content

Covariant and contravariant vectors, general systems of coordinates. Covariant differentiation, differential operators in general coordinates. Riemannian geometry, metric, cUlvatnre, geodesics. Applications of the tensor calculus to the theory of elasticity, dynamics, electromagnetic field theory, and Einstein's theory of graviwtion.

Text Nil

References

Abram, J. Tensor Calculus through Differential Geometry (Butterworths 1965)

Landau, L.D. & Lifshitz, E.M. The Classical Theory of Fields (pergamon 1962)

Lichnerowicz, A. Elements of Tensor Calculus (Methuen 1962)

Tyldeslcy, J.R. An Introduction to Tensor Analysis (Longman 1975)

Willmore, TJ. An Introduction to Differential Geometry (Oxford 1972)

663102 TOPIC N " VARIATIONAL METHODS AND INTEGRAL EQUATIONS

Lecturer C.J. Ashman

Prerequisite Topic CO

flours 1 lecture hour per wcek and 1 tutorial hour per fortnight

!<'xamination One 2-honr paper

Content

Problems with fixed boundaries: Euler's equation, other governing equations and their solutions; parametric representation. Problems with movable boundaries: lransversality condition; natural boundary conditions; discontinuous solutions; corner conditions. Problems with constraints. Isoperimetrie problems. Direct methocls. Fredholm's equation; Volterra's equation; existence and uniqueness theorems; method of successive approximations;

other methods of solution. Fredholm's equation with degenerate kernels and its solutions.

Text Nil

References

Arthurs, A.M. Complementary Variational Principles (Pergamon 19(4)

Chambers, L.G. Intcgral Equations: A Short Course (International 1976)

Eisgolc, L.E. Calculus of Variations (Pergamon 1963)

Kanwal, R.P. Linear Integral Equations (Academic 1971)

Weinstock, R. Calculus of Variations (McGraw-Hill 1952)

663103 TOPIC 0 " MATHEMATICAL LOGIC AND SET THEORY

Lecturer MJ. Hayes

Prerequisite Topics K & L arc recommended but not essential, but some maturity in tackling axiomatic systems is required.

Hours 1 lecture hour per week and one tutorial per fortnight

Examination One 2-hour paper

Content

The problem of the "number" of elements in an infinite set; paradoxes. Tautologies and an axiomatic treatment of the statement calculus. Logically valid formula and an axiomatic treatment of the predicate calculUS. First order theories, consistency, completeness. Number theory. Goedel's incompleteness theorem. Set theory, axiom of choice, Zorn's lemma.

Text Nil

References

Crossley, J. et al. What is Mathematical Logic? (Oxford 1972)

Halmos, P.R. Naive Set Theory (Springer 1974; Van Nostrand 1960)

Hofstadter, D.R. Gode!, Escher, Bach: an Eternal Golden Braid (penguin 1981)

Kline, M. The Loss of Certainty (Oxford 1980)

Lipschutz, S. Set Theory and Related Topics (Schaum 19(4)

Margaris, A. First Order Mathematical Logic (Blaisdell ]967)

Mendelson, E. Introduction to Mathematical Logic 2nd edn (Van Nostrand 1979, paperback)

663104 TOPIC P " ORDINARY DIFFERENTIAL

Lecturer J.G. Couper

Prerequisites Topics CO & D

/lours 2 lecture hours and 1 tutorial hour per week for 2nd half year

Examination Olle 2-·hour paper

Content

Linear systems with constant coefficients, general solution and stability. Nonlinear systems, existence of solutions, dependence on initial conditions, properties of solutions. Gronwall's inequality, variation of parameters, and stability from linearisation. Liapunov's method for stability. Control theory for linear systems controllability, observability and realisation. Applications will be studied throughout the comse.

Text Nil

Riferences

Anowsmith, D.K. & Place, C.M. Ordinary Differential Equations (Chapman & Hall 1982)

Hirsch, M.W. & Smale, S. Differential Equations, Dynamical Systems and Linear Algebra (Academic 1974)

Jordan, D.W. & Smith, P. Nonlinear Ordinary Differential Equations (Oxford 1977)

663108 TOPIC PD " PARTIAL DIFFERENTIAL EQUA TWNS

Lecturer W.T.F. Lau

Prerequisite Topic CO

Hours 2 lecture hours and 1 tutorial hour per week for 1st half year

Examination One 2-houf paper

Content

First order equations: linear equations, Cauchy problcms; general solutions; nonlinear equations; Cauchy's method characteristics; compatible systems of equations; complete integrals; the methods of Charpit and Jacobi. Higher order equations: linear equations with constant coefficients; reducible and inedueible equations; second order equallons with variable coefficients; characteristics; hyperbolic, parabolic and elliptic equations. Special methods: separation of variables; integral transforms; Green's function. Applications in mathematical physics where appropriate.

Tcxt Nil

References

Courant, R. & Hilbert, D. Methods of Mathematical Physics VoU! Partial Differential Equations (Interscience 1966)

Epstein, B. Partial Differential Equations an Introduction (McGraw-Hill 1962)

25

Haack, W. & Wendland, W. Lectures on Partial and Pha/fi(m Dij5cerentiail<,'quatiofiS (Pergamon 1972)

Smith, M.G. Introduction to the 'J"heory of Partial Differential Equatiolls (Vall Nostrand 196'/)

Sneddon, LN. Elements of Partial Differential Equations (McGraw~ Hill 1957)

663105 TOPIC Q " FLUID MECHANICS

Lecturer W.T.F. Lan

Prerequisites Topics B, CO

llours /: lectnre honrs and 1 tutorial hour per week for 2nd half of year

Examination One 2~hollr paper

Content

Introduction: continuum, presslll'e, viscosity; governing equations and bouudmy conditions; momentum theorem. Potential flows: uniqucness theorem; kinetic energy; simple solutions; equations of streamlines; combination of solutions; method of images; axisymmetrical motion; Stokes's strcam function. Two dimensional motion: complex potential; complex velocity; simple solutions; Millle-Thompson's circle theorem; Blasius's theorem; conformal transformation alld its applications. Viscous flows: Poiseuille and COllctte flows; boundary layers.

Text Nil

References

Batchelor, G.K. An Introduction to Fluid Dynamics (Cambridge 196'/)

Chirgwin, BJI. & PlllmplOn, C, Elementary Classical lIydrodynamics (Pergamon 1967)

Curle, N. & Davies, HJ. Modern Fluid Dynamics 'lois I & n (Van Nostrand 2968, 1971)

Goldstein, S, (cd) Modern Development in Fluid Dynamics Vols I & II (Dovel' 1965)

Milne,:fhompson, L.M, Theoreticaillydrodynamics (Macmillan 1968)

Panton, R. incompressible Flow (Wiley, 1984)

Paterson, AR A First Course in Fluid Dynamics (Cambridge 1983)

Robertson, J .H. Hydrodynamics in Theory and Application (Prentice, Hall 1965)

Lecturer C.A. Croxton

Prerequisite Topic CO

26

I-lours 2 lectlll'c hours and 1 tntodal hour for 2nd half year

Examination One 2-hour papcr

Content

Classical Lagrangian aud Hamiltonian mechanics, Liouville theorem. Statistical Mechanics: basic postulate; microeanollical ensemhle; equipartition; classical ideal gas; canonical ensemhle; energy fluctuations; grand canonical ensemble; densily fluctuations; quantum statistical mechanics; density matrix, ideal Bose gas; ideal Fermi gas; white dwarf stars; Bose~Einstejn condensation; superconductivity.

Qllanlllm mechanics: the wave--particlc duality, concept of prohahility; development, solution amI interpretation of Schrodinger's equations in one, two and three dimensiOIlS; degencxacy; Heisenberg llnccIlainty; molecular stmctllre.

Text Nil

N.eferences

Croxton, C.A, Introductory Eigenphysics (Wiley 1975)

Fong, P. Elementary Quantum Mechanics (Aclc!ison··Wesley 1968)

Hilang, K,

Statistical Mechanics (Wiley 1963)

Landan, L.D.& Lifshitz, E,M. Statistical Physics (Pergamon 1968)

66310'1 TOPIC S - GEOMETRY

Lecturer T.K. Sheng

Prerequisite Nil

llours 2 lectnre hours and 1 tutorial hour pCI' week for ] st half year

Examination One 2 .. holtr paper

Content

Euclidean geometry: axiomatic and analytic approach, transformations, isometries, decomposition into plane reflections, inversions, quadratic geometry. Geometry of incidence: the real pl'Ojcctive plane, invariance, projective transformation, conics, finite project.ive spaces,

Text Nil

References

Blumenthal, L.M. Studies in Geometry (Freeman 1970)

Eves, H. A Survey (if Geometry (Allyn & Bacon 1972)

Garner, L.E. An Outline of Projective Geometry (North Holland 1981)

Greenberg, MJ. Euclidean and nOIl·Euclidean Geometries 2nd eelll (Freeman 1980)

663201 TOPIC T n BASIC COMIHNA'fOKnCS

LeciUrer W. Brisley

Prerequisites At least one jli1rt II mathematics subject (llA or JIB or IIC or IlCS)

!lours 1 lecture hour per week and I tutoJial hour pel' fortnight

Fxaminatio/i One 2 .. holll' paper

Content

Basic counting ideas. Combinalorial ideIltities. Different iIllerpretaliol1s of "the same". PartitiollS. Recurrence relatioIls. Generating fUllctions. PolYil ;llethods anc! exlellsiolls. Equivalence of some "classical Humbers", Construction of some designs and codes.

Text Nil

References

Lin, c.L. Introduction to Combinatorial Mathcmotics (McGraw Hill)

Krishnawunhy, V. Combinatorics: Theory and Applications (Wiley 1986)

BlUaldi Introductory Combinatories (North Holland 19T!)

Bogmt Introductory Combinatorics (Pitman 1981)

Tucker Applied Combinatoric.I'" (Wiley)

Street, A.P. & Wallis, W.D, Combinatorics: A First Course (Chmlcs Babbage Resem'Cll Centre 1982)

663202 TOPIC U co INTUODUCnON TO OPTI1VHZATKON

Lecturer A. Stema·Xmwat

Prerequisite Topic CO

Corequisite Topic 664158 Convex Analysis

Hours About 27 leelme hours

Examination One 2-hour paper

Content

This topic will introdllce basic concepts in optimization theory, It will provide backgl'Ollnd for solving mathematical problems that may arise in economics, engineering, the social sciences and the mathematical sciences. The following topics will be covered: convex and quasi .. convex functions, local and global minima, Farkas' lemma, altemative theorems, Lagrangian, saddle points, necessary and slifficiellt conditions of optimality, regularity conditions, subgradient, subdifferentiability, stable problems, duality for convex problems, differential:le problems, finitely milPY constraints, problems wilh arbitrm'y constraints, the l{llhn--Tucker necessary condition, regularity conditions for differentiable problems, necessary and sufficient conditions of optimality for differentiable problems, duality of differentiable problems converse duality.

Text Nil

References

N.Cameron Introduction to Un!'(!r and COl/vex (Cmnllri,dgc University Press 1985)

,l, Ponstein Approaches to the Thcory of Optimiwtioll (Cambridge University Press 1980)

R.B. Holmes A Course Oil Optimization and Best Approximation (Springer-Verlag, Herlin 19'12)

leI'. Rockafella. Convex Analysis (Princeton University P1'(;5s1970)

B. M,niOS Nonlinear Holland

Theory and Mcthods (North

J. We1l1C( Optimiwtion Theory and Applications (Friedl'. Vicweg & Solin 1984)

D.G, Lllenbcrger Optimiuuion by Vector Space Methods, (John Wiley & Sons 1969)

D.G. Lucnberger Introduction to Linear alld NOlllinear Programming (Addison·Wesley 19'13)

O.L. Mangasarian Nonlinear Programming (McGraw-Hill 1969)

M.R Hestenes " Optimization Theory: The Finite Dimensional Case (Wiley 1975)

663~03 TOPIC V 0> MEASUnE THEOR.Y & INTEGRATION

Lecturer A Sterna·Xarwat

Prerequisite Topic L

llours 2 lecture hours and 1 tutorial hOll!' per week for 2nd half year

Examination OnCo 2 hon!' paper

Content

Algebras of sets, Borel sets. Mcasmes, ouler measures, mcasnrable sets, extension of measures, Lebesgue measnre. Measurahle functions, seqnences of measlll'ahle functions, simple functions. Intcgration, monotone convergence theorem, the relation between Riemann and Lebesgue integrals, Lp-spaces, completeness, Modes of convergence, Product spaces, Fubini's theorem. Signed measures, Hahn decomposition, Radon-Nikodym theorem,

Text Nil

References

Bartle, RoG, The Elements of integration (Wiley 1966)

de Barra,G. Introduction to Measure: Theory (Van Nostrand 1974)

27

Halmos, P.R. Measure TheOlY (Van Nostrand 1950)

Kolmogorov, A.N. & Fomin, S.V. Introductory Real Analysis (Prentice·Hall1970)

Munroe, M.E. Introduction to Measure and Integration (Addison Wesley 1953)

663204 'I'OPIC W " j"UNCTIONAL ANAl.YSIS

Lecturer l.R. Giles

Prerequisites Topics B, CO, D, K, L

Hours 2 lecture hours and 1 tutorial hour per week for 1st half year

Examination One 2··hour paper

Content

Hilbert space, the geometry of the space and the representation of continuous linear funetiollals. Operators on Hilbert space, adjoint, selt~adjoint and projection operators. Complete orthonormal sets and Fourier analysis on Hilbelt space.

Banach spaces, topological and isometric isomorphisms, finite dimensional spaces and their properties. Dual spaces, the Halm·Banach Theorem and reflexivity. Spaces of operators, conjugate operators.

Texts

Giles, l.R. Introduction to Analysis of Metric Spaces (CUP 1987)

Giles, J.R. Introduction to Analysis of Normed Linear Spaces (Uni of Newcastle Lecture Notes 1988)

References

Bachman, G. & Narici, L. Functional Analysis (Academic 1966)

Banach,S. Theone des Operations Lineaires 2nd edn (Chelsea)

Bmwn, A.L. & Page, A. Elements of Functional Analysis (Van Nostrand 1970)

Jameson, G.J.O. Topology and Normed Spaces (Chapman .. Hall19"!4)

Kolmogorov, A.N. & Fomin, S.V. .Elements of the Theory of FUflctions and Functional Analysis Voll (Grayloch 195"1)

Kreysig, E. Introductory Functional Analysis with Applications (Wiley 19'18)

Lius!ernik, L.A. & Soholev, U.J. Elements of Functional Analysis (Frederick Unger 1961)

Simmons, G.F. Introduction to Topology and Modern Analysis (McGraw .. HilI 1963)

Taylor, A.E. Introduction to Functional Analysis (Wiley 1958)

Wilansky, A. Functional Analysis (Blaisdell 1964)

66321"1 TOPIC X <> FIELDS AND EQUA'I'IONS

Lecturer R.F. Berghout

Prerequisites Topics D & K Hours I lecture hour per week and 1 tutorial hour per fortnight

Examination One 2-hour paper

Conlent

In this topic we will study the origin and solution of polynomial equations and their relationships with classical geometrical problems such as duplication of the cube aud trisection of angles. It will fUrlher eXamille the relations between the roots and coefficients of equations, relatious which gave rise to Galois theory and the theory of extension fields. We willieam why equations of degree 5 and higher cannot be solved by radicals, and what the implications of this fact are for algebra and numerical analysis.

Text Nil

References

Birkhoff, G.D. & MacLane, S. A Survey of Modern Algebra (Macmillan 1953)

Edwards, H.M. Galois Theory (Springer 1984)

Herstein, LN. Topics in Algebra (Wiley 1975)

Kaplansky, I. Fields and Rings (Chicago 1969)

Stewart, 1. Galois Theory (Chapman & Hall 1973)

66320'1 TOPIC Z .. MATHEMATICAL PRINCIPLES OF NUMERICAL ANALYSIS

Lecturer W.P. Wood

Prerequisites Topics CO and D; High-level language programming ability is assumed.

Hours 2 lecture hours and 1 tutorial hour per week for 1st haJfyear

Examination One 2-hour paper

Content

Solution of linear systems of algebraic eqnations by direct and linear iterative methods; particular attention will be given to the influence of various types of enors on thc numerical result, to the general theory of convergcnce of the latter class of methods and to the concept of "condition" of a system. Solution by both oue step and multistep methods of initial value problems involving ordinary differential equations. Investigation of stability of linear marching schemes. Boundary value problems. Finite-difference and finite-clement methods of solution of partial differential equations. If time permits, other numerical analysis

problems such as integration, solution of non .. linear equations etc. will be treated.

Text

Burden, R.L. & Faires, J.D. Numerical Analysis 3rd edn (Prindle, Weber & Schmidt 1985)

References

Atkinson, ICE. An Introduction to Numerical Analysis (Wiley 1978)

Ames, W.F. Numerical Methodsfor Partial Differential Equations (Nelson 1969)

Cohen, A.M. et al. Numerical Analysis (MeGraw .. Hill 1973)

Conte, S.D. & de Boor, C. Elementary Numerical Analysis 3rd edn (McGraw-Hili 1980)

Forsythe, G.E., Malcolm, M.A. & Moler, C.B. Computer Methods for Mathematical Computations (Prenlice .. HalI1977)

Isaacson, E. & Kener, H.M. Analysis of Numerical Methods (Wiley 1966)

Lambert, J.D. & Wait, R. Computational Methods in Ordinary Differential Equations (Wiley 1973)

Mitchell, A.R. & Wait, R. The Finite Element Method in Partial Differential Equations (Wiley 1977)

Pizer, S.M. & Wallace, V.L. To Compute Numerically: Concepts and Strategies (Little, Brown & Co. 1983)

Smith, G.D. Numerical Solution of Partial Differential Equations: Finite Difference Methods (Oxford 1978)

Details of courses offered by t.he Department of Statistics can be obtained from the Departmental Secretary or from Professor Dobson. Further information about statistics courses also appears in the section Notes on Degrees and Diplomas.

PART II STATISTICS SUBJECT

(9),100 STATISTICS II

Prerequisite Mathematics I

Hours See individual topics

Examination Each topic is examined sepmlltely

Content

This subject consists of Ihe following topics:

Probability & Statistics

Random Processes and Simulation

Design and Analysis of ExpeIiments

Probability and Statistics is a double topic which is available in Semester 1; it is a prerequisite for Random Processes and Simulation and Design and Analysis of Experiments which are single topies available in Semester 2.

PART n STATISTICS TOPICS

692102 PROBABILITY AND STATISTICS

Lecturer D.F.Sinciair

Prerequisite Mathematics I

Hours Three lecture hours, one tutorial hour and t'\vo computing laboratory hours per week for Semester 1 only.

Examination Assignments, tests and one 3 .. hour examination.

Content

This is a double topic. As the core Statistics topic, this course introduces the key concepts of probability theory, mathematical statistics and data analysis. The emphasis is on CUlTent statistical thinking, and the statistical computer program MINlTAB is used extensively.

Topics covered include: descriptive statistics and exploratory data analysis, probability distributions, random variables, sampling distributions, parameter estimation and confidence intervals, hypothesis testing, goodness-of .. fit tests, contingency tables, correlation and simple linear regression, an introduction to experimental design and analysis of variance, non parametric statistics, and quality control.

Text

Larson, R.J. and Marx, M.L. An Introduction to Mathematical Statistics and its Applications 2nd edition (Prentice Hall 1986)

R<ferences

Koopmans, L.H. Introduction to Contempormy Stalistical Methods 2nd edition (Duxbury 1987)

Ryan, B.F., Joiner, B.L. and Ryan, T.A. MINITAB Handbook 2nd edition (Duxbury 1985)

29

2 01 hJi")PLnm ~i'Il'AnSnCt:i

Prerr'quisitc IVlmilem"tics I

IIOias Two lcctmc honrs !Jet' week (mel p]';wtical work for :;C111csle, 1 only,

},'xrnninatio/l exalllirntiOlI,

AssiglllllCIlIS, tests ,\lid olle )"ltom

COiltent

Topics covered inr;lll<le: pwbability theory, propagation, confidence Yo!' mCilllS illld PWjlortiOIlS, contingency l'lbles,

exploriltOlY dala mlalysis, quality cOllt!'ol, error and hypothesis lests,

simple line,)r regression

Emphasis is placed on data analysis using the slill.istical computer program MH,n' ['All,

Text

Chatfield, Stotistics StlUistics

technology : II COlu'se in AplJlied edn « :haplIli\ll and I faU, 1,OllriOIl 19B1),

fleferellces

Ryall )J,E, Joiner 1l.L, & IVIINI1J1JJ llfllldbook (9Wi),

H.J~.

'i'A r:d., (OUXiltHY hess, Hoston

Statistics :Jnl Celli (f'relllice,(-jall 1(80),

(,') 03 I:.tA)\lnOJVJI j!"IROCE55E~; ANI) S][]VWW,AHON

f,ectura g,G,Qllillll

Prerequisite Mathemmics I

Hours Two lecture hours and one tulolial hom per week for Semester 2 only,

Examination examination,

Content

Assignlllellts, lesU; and one }"ilOIll

This course is nbout the mathcmntical moclelline amI sinmlation of random, or stoc!wstic, processes,

Topics covered include: random walks, Mnrkov chains, M~lrkov processes" hinlHkilLiI processes ,mel rall(lolil number generation, and simulation compllter pnckages,

Text

Taylor, H,lVL and Karlin, S, An [ntroducrion to Stochastic Modelling (Academic Press 1984)

References

Morgan 13J,T, Elements of Simulation (Chapman and Hall 1(84)

Ross, S, Stochastic Processes (Wiley 198:3)

30

697, Ofl DESIGN ANn ANAI,YS1S OF 1:\ XIP~':I{YMENTS

Lecturer RW,Gibbcl'cl

Coreql!isite Plobabilily :\lld S tatisl ies

Hours Two lcetlll'c homs and one ltltorial hour jlcr week for Semesier ), only,

Examinotio/l A:;signr11Cllts, tests and one 2hotl! CXClIll imltiOll ,

Cotltellt

This course covers the design amI the conesponcling analysis, Topics include completely randomized designs, rancJorniz(~d block

factorial designs, analysis of variance and regression and the linenr modeL

of BlvIljp to cany out analyses will he covered,

[Ctt to he dctcilnincd

I?e/prenres

Netcr, L mid WaSSClInall, W, Applied Lincar Statistical Models (Irwin 19'/,1)

Cochran, w,e;, :\lId Cox, (;,M, f/xpaimelltal Designs (Wiley 196t)

Box, (;,10,1'" Huntcr, w,e;, ilnd Hunter ],S, Statistics for J";xperimC/llS (Wiley 1978)

Berenson, IV!.!", Levine, n,M, and Goldstein, M, Intermediate Statistical Methods and !ll'!,licatiotls (Pn:nticc Hall 1 (83)

i'ARIi' Hli ~;TATISnCS SIJll,IECT

6<) Ull) HA'HSHCS m

Prerequisites S latistics II

flours See individual topics

examination Each topic is examillC1! separately

Content

'fhis subject consists of the following topics:

Sm vey Sampling

Timc Series Analysis

Statistical Inference

Generalized Linmr Models

Survey Sampling ,Hid Time Series Analysis mc in Semester I only and Statistical InfcI'cncl' and

Generalised Linear Models in Semester ~ only,

PART HI STATISTICS TOPICS

(,93106 STATISTICAL KNFEHENCE

Prerequisite Probability am! Stat.istics

Hours Two lecture hours pel' week amI one tutorial per week for Semester I only,

Ex!!minaliotl examination

Assignmcnts, tests aIlli onc 2lrolll'

FOlm

Content

ChaflBc of variable, distriblltiOlI of quadratic forms, likelihood methods for cstimatioll and hypothesis testing, relative likelihood, bootsLI'avping,

Text NiL

f( {ji') r e flU\\

Kalbllcisch, J,G, Probability Ilnd Statistical JII/i:rcilce 11 (Spr ingcr 19/9)

(, "i Of; GENFH,AUZED Ur:JEAI{ 1,~(OIH:U;

Lccli!rer AJ, DobsOII

Prerequisite Swtistics lJ

[Jours Two lectme homs ami one tlltorial hOlll per week fo. SCl11(:stcr ~ only

Examination Assignments, tests ,\!lei one 2,holl, CX;:lllliilation

COllietli

Tire course covers the theory of linca .. models and illustrates how !!lany Illcthods analysing; COlliilHIOIlS, binary, and categorical data fit into this fnuneworlc Topics include the exponential family of distrillllliolls, maximum likelihood est.irmllio!I, smnpling distributions for fit statistics, linei1!, modeb for CO!ltilltlOllS dma and analysis of variance), logistic regI'cssion, ,mel logllllcar models, StllClents will implement tliese methods llsing various cornpnter packages, including GUM,

'lex I

Dobson, AJ, An lntrociuuiofl to Statistical Modelling (CI13pman & llall 1983)

69310'/ TIIViE SErUES ANALYSIS

Lecturer RG,Quinn

Prerequisite Probability and Statistics

flours Two lecture hoW's ,md one tutmial hour per week fIll Semester I only,

Examination Assignments and one I.-hour exam illation

COfltenl

This course is about the theory anel practice of Time Series Analysis - the analysis of data collected at regular intervals in lime (or space),

Topics covered include: stationary processes, ARMA models, models I'm periodic phenomena, analysis llsing IVIINITAB and other Time Series packages,

TcxI Nil

References

Cryer, J,D, Time Series Ana/ysis (Dux bury Press j (86)

Fuller, W,A, Introduction to Statistical Time Series (Wiley 19'/6)

Box, GEl', anel Jenkins, (J,M, Time S'eries Analysis: Forecasting and Control (Holden Day 1976)

69 Ul2 ~)mlVIl,:1{ ;;AIVOI'i,]fl\jG

!_ecWra 1~,W,GiblJe,.'d

ere requisite IJrobability nnct Slatistics

!-!O!!'t'S Tv/o Icctlln: holt,'!.) rlod Olle i:niolj;:tllioIJl V(~f fOl ~;emc,;te( :/ onl y

ic'Xalilinatioll exmninntioll

1\;;sigHrncnt~;) tests aod one ~~ h01l.f

Collient

Tilis course covers lile statislic," priIlcipics that are 115(,:(1 to construct and asse;s:; melhods fOl· ami dcHa from fillite populations, Topics coveJ'ed nmelolll faLio and regrcssion r;stilll:ltOl'S, f;ampling sampling, and other rcievHlli. sections from the texL All inrrorillction to the lise of computers for processing and 21.lIaly:;ing smvey data will be Some considemlion of the jlractical pmbJems wiJl obt,\inec1 illlOI1Eh the: class lI"ojcCls,

Text

Balnell, V, Flements of'Sampling TheolY ()<:,U,P, 19'/11)

Ne.lerences

Cocillml, V'l.e;, Sampling techniques 3nl edition (Wiley 1(77)

Kish, L Survey Sampling (Wiley J 96:5)

31

SlJlJ.mCIS XN TillS SCHEDVU\ OF THE BACHELOR OF COI\/J!PU'fm~ SCIENCE DEmmE

S31600 COlVH'Unm ENGINEERING I

Notc:

OF

This snbjcct is available only to students cmolled in the Bachelor of Computer Science degree course.

Corequisite Mathematics I

flours To be advised

Examination To be advisee!

Content

Electrical and Computer F,nginecrine I is an introductory course to electrical circuits and digital systems. The lectures are supported by tutorials and extensive laboratory work. The laboratory component includes an introduction to oscilloscopes, function ecncrators, elcClronic power supplies ,md other laboratory illSlnnnellts.

Part 1

Introduction to Electrical Engineering. Concepts of voltage, current impedance, power and units of same. Voltage sonrces and current sources. Ohms Law, Kirchoff's J ,(\ws. Parallel and series resistive circuits. IlI(luctOls illld capacitors and their properties. Response of series RC and I.e networks when fed from switched o.e. sOlll'ces. a.c. power sources. Peal, ami r.m.S. quantities. Resistors, capacitors and inductors fed frolf! sinusoielal voltage sources. Concept of phase. The phasor. Complex impedance and admittance. Philsor diagrams. Power, apparent power aile! reactive power in a.c. circuits. Power factor. Balanced J·phasc circuit analysis. Natural and forced response. Simple LCI{ circuits.

Part :%

The binary numbering system. Introduction to logic functiollS anel logical circllits. Combinational logic, 3Jlalysis ,md synthesis. MSI and LSI circuits. Elementary sequential logic, flip flops, registers, counters and memory devices. Octal and hexadecimal number systems. Introduction to eoelinr;. Basic structures of computers. The function of the processor, main and seconelary memory, VO devices. Concept of buses. Memory, processor, I/O device interconnection. Function of elata, address anel control buses. Introduction to Basic clements of the processor, anel cont.rol logic. Description of machine Introduction to microprocessor instruction sets. Examples of microcomputer interfacing and applications.

SUB.mers IN SCHEDULE B OF THIE BACHELOR OF lVIATHEMAHCS DEGREE PART K SUBJECTS

541100 ENGINEEIUNG

Advisory Prerequisites

3 unit Mathematics, 2 unit Physics and /. unit Chemistry (emphasis may vary depending on the components selected)

Corequisite Mathematics I

Hours Each unit requires approximmely 47. contact hours

32

Examination Progressive Assessment ami Examinatioll

Content

Fom units chosen from CE 111, ChE 14 j, ChEl :;:' (7. units), GEJOI, GEiSt and MEllI described below. Other units may be substituted with the approval of thc Dean of Ihe Facility.

(i) lOS CElli MECHANICS AND

SnWCTUHES

ullit

Introduction 10 the bchaviour of structures. Statics; forces as vectors, resultant, equilibrium in two dimensions. Beams, Trusses; method of joints, mcthod of sections. S tmical determinacy. Compatibility, properties of sections, stress, strain, Mohr's circle. Columns; su\bility, Euler's formula.

Texts

Atkins, K.J. ct al Mechanics and Structures (Scic,l1ce Press)

Atkins, K.J. ill Mechanics and Smu:turcs

MfChanics and Strue/ures: Worked Problems (Science Press)

(ii) 511108 C EI,H KNDIIJ§TRKAL PROCESS

H'IfUNCH'LE§

IInit

concepts in the process industries. Flow eliagram of a process and metallurgical processes. Calculation of material and energy balances. Properties of vapours and liquids. Equilibrium processes. Humidification, drying. Crystallisation.

(iii) SU H ChE153 CHEMXCAL AND

MANiJFAC'j'lIRING PROCES§ES

), units

An introduction to the stJ'ucturc amI organisation of the chemical and process metallurgical indllstries in Australia, with reference to the world scene. Descriptions of the processes used in the manufacture of the major industrial chemicals, including hydrometallurgical ami smeltin£, operations. Outline of typical unit operations. Description of various processes IIsed in Ule fabrication and utilisation of materials. Visits to a number of industlial pl,mts illustrative of the course material, and preparation of process flow diagnlms.

Text Shreve's Chemical Process Industries, 5th ~dn (McGraw-Hill 19R5)

(iv) 501103 unit. GElO! INTRODIIJCTION TO

ENGINEERING

A course of lectures, seminars and plant visits intended to enhancc an understanding of the role of the professional engineer in indllstry and society.

OF

(v) :lOBO), 'I lllli! GlE);)! )[]\lTRODl)CTWN TO

MA'fliHUAL§ SCmNCJE

The course provides a general int.roduction to materials of engineering sir;nificallce and to the relationships which exist betweeu structmcs, propenies and applications. The detailed treatment. of various aspccts is left to the latter stages of Ure degree programme. The following sections arc giv(~n

approximaalely equal amounts of tjmc and emphasis. Atomic bontling; atomic arrangements in metals, galsses and polymers; the effects of stress ane! ternperatme Oil simple metals; the control of metallic structures by composition and tllellnal treatments; common metals of engineering importance; the structures aml propertics of ceramics and cement products. Polymers, rubbers and woods; cnginecring applications for polymers; the mechanical testing of materials; composite material; the electrical, magnctic, Opt.iCil] :md thermal properties of solie! lnal:elials.

Text

Askelanci, D.R. The Science and Engineering of Materials (P.W.S. Publishers 1984)

or

lililln, H..A. ancl Trojan, P.K. Engineering Materials and Their Applications 7.nel or 3rd edu. (Houghton, Mifflin 1981)

(vi) f,01l1H)o1l mtit IVmUl m~Apmcs AN))

ENGINEEKUNG ORA WING

A study ill communication ilnd analysis by pictorial means. Methods of projectioll coverillr; ort.hagonal projection points, lines, planes :md solids; lengths of lines, angles and intersection between lines, planes and contoured surfaces; orthographic projection, dimellsioning and sectjolling, isometric projection; prospcctive projeetioll.

Text The Australian Engineering Drawing llandbook Part 1

Basic Principles and Techniques (lnstitntion of Engineers, Australia 1987)

PART n SUBJECTS

412700 ACCOUNTlNG HC

Prerequisites Accoullting I, Mathematics I

Hours t\ lecture hours and 4 tntorial honrs per week

Examination 4 papers throughout the year including one 3-hour paper at. end of year for Accounting lIB ami one for AcconntinB lIA

Content

Accounting IIA and Accounting lIB

Accoullting HA

Theory and practice of company accounting; accounting for the formation reconstruction, amalr;amation, take-over, official management, receivership and liquidation of companies; the preparation of holding company and group financial statements; equity accounting; presentation,

analysis and interpretation of financial statements: the valuation of shares and goodwill; funlis sLaWmcnts; accounting for price level change; acconnting for instalment· pmchase, lease agrcement, amI tax·effect accounting.

Accounting Hn

The theory and practice of management concepts allli classification schemes of cost; COSi.

aJl(I forecasting methoelologies; product costing methoelologies and issues in job costing, process costing, joint ane! by .. product costing; allocation of costs; applicatioll of standmcJ costing theory to accounting for manufacturing costs (materials, labom and overhead) and nOfl­manufacturing costs; variance analysis under standard costing: responsibility accounting and performance cVilluation; accoul1tinB models of cost-volume .. profit analysis; cost-benefit decisions; accounting issnes in transfer pricing, capital invcstment analysis, behavioural aspects of accollnting informmion; illvclllory cost coulfol 1!100kls, Selected practical applications of the above arc undertaken with the aid of computer spreadsheet software.

Texts

Johnstoll, T.R. ct al. The Law and Practice of Company Accounting in Australia 6th ecln (Butlerworlhs)

Taylor, R.B. & O'Sbea, B.P. Oueslions on the Law & Practice oj' Company Accounting 4th elin (Butterworths) Companies Act, 1981 (N.S.W. Govt. Printer)

Morse, W.J. & Roth, H.P. Cost Accounting 3nJ edn (Aelelison-Wesley)

Ingalsbc, L. VP·Planner (with diskette) (Merrill Publishing)

:522,'100 CXVU ... ENGINEERING HM

Prerequisites Mathematics I, CE I I 1, ME 131, GE 112 ami MEllI

Hours 5 lecture hours & 2 1/2 tutorial hours per week

Examination Five ] .. tlOur papers

Content

5 units fl'Oll1:

(i) CE;~ 1?

(ii) CE213

(iii) CE231

(iv) CE232 (v) CE224

Mechanics of Soliels

Theory of Structurcs

Fluid Mechanics I

Fluid Mechanics II

Civil Engineering Materials

For descriptjons of these nnits, consult thc 1988 Faculty of Engineering Handbook

"/52300 PSYCHOLOGY UC

Prerequisites Psychology I & Mathematics I

Il ours 3 lecture hours, one 2-holll' practical session & tutorial hOllr per week

Examination Two 3-hoUf papers plus an assessment of practical work. A 2·holll experimental mcthodology exarninalion in July

33

OF

Content

Will examine topics such as animal behaviour, behavioural neurosciences, developmental psychology, experimental methodology, individual differences, information processing, learning and conditioning, social psychology.

Texls To be advised.

PART HI SlmJECT~;

13900 ACCOUNTING me Prerequisites Mathematics lIA & lIC & Accounting lIC

f [ours 4 lecture hours per week

Examination Three 3-hout' papers & progressive assessmcnt

Content

Either

(i) Acconnting IlIA or Accounting HIB anel two appropriately chosen Part III topics offered by the Departments of Mathematics, Statistics and Computet Science and approved by the Head of Ihe Depattment

or

(ii) Accounting lIIB and Foundations of Finance.

ACcOllllting IHA

Prerequisites Accounting I1A ami Accounting DB

(Accounting lIB may be [;1ken as a corequisite)

lIours 2. kcture hour;; per week

Examinotion Two 5"hour pilpers

Content

The course will involve seminar discussion of the principal approaches to [onnulating an accounling theory. ~mphasis will be on cunent issues related to definitions of the elements of an accollnting theory and will include discussion of the objecti ves of financial stAltemelHs; asset valuation and income eletcrmination concepts ariel the futllt'c scope of accounting.

Preliminary Reading

Henderson, S. & Peirson, O. Financial Accounting Theory. Its Nature ond Development (Longman Cheshire)

Texts

Bclkaoui, !\. Accounting Theory (2nd ed Harcourt Brace Jovanovich)

Bloom, R. & Elgers, P. Accounting Theory and Policy (/.nd cd Baxcomt Brace Jovanovich)

References

Articles from journals Stich as The Accollnting Review, Accounling Organisations and Society, Abacus, Accounting and Business Research, JOllrIlal of Business Finance and Accounting, ami JOllrnal of Accounting Resem'ch and extracts from relevant accounting monographs, including the followinz:

American Accounting Association A Statement of Basic Accounting Theory

American Institute of Certified Public Accountants Objectives of Financial Statements

HeClver, W.H. Financial Reporting: lin Accounting Revolution (prelltice-Hall)

Brornwich, M. & I-lopwood, A. (cds) Fssays in fJritish Accounting Research

Chambers, R.J. Accounting, L'valuation and Economic Ji ehavior (Prentice-Hall)

Financial Accounting Stand,u'ds Board Statements of Financial Accounting Concepts

Parker, R.B. & Barcom'!, G.C. Readings in the Concept of Measw'CIllcllt of Income (Cambridge U.1'.)

ACCollilting nIB

Prerequisites Accoullting IIB

I fours 2 lecture hours per week

Examination One :QlOIJ1' paper

Content

The application of analytical reasonine to the lise of COSI accounting in formal models of oreanizationai making: financial modelling, decision estimation anel i111ocation, product mix Significant usc is made of the contents of lnll'OdnctOlY Quantitative Methods.

Text

Kaplan, R.S. Advanced Management Accounting (Prentice,Hall)

References

Hailey, E. Pricing Practices and Strategies (Conference Board)

Corcoran, A. Cos Is (Wiley)

(Jordon, L.A. et ,\1. Normotive Models in Manogerial f)ecisioll-Making (l\! .!\. A . )

Mintzberg, H. /0 the Use of Management Illformation

O'ConnOl, R. Planning limier Uncertainty: Multiple Sccilo/'ios and Contingency Planning (The Conference Board)

~J3619 lFOUNDATWNS OF FINANCE

Prerequisiles Accounting 1, IntroductOlY Quantitative Methods and Economics I

Hours 2 lecture hours and I tutorial hOIl! per week

r;xaminalion Onc j hour final paper

G

(:;,'C separate entry [or F<lcully of Medicine)

JailHary

Friday Public Holiday New Year's Day

for return of ApplicMion for Rc-Emolmc.l11. SWdc.ms

-I J Wcdnc:,>'day Ddelfcd FX~HHin<Hions begin

') "~ Friday DefClfCd EXClmin:niol]'} end

0: J'1!tSdrlY Public Iiolicby ._-- AusLndiC\ Day

.) 1 c";und(J.Y Applir:ations for fcsid\~J1CC in Edw<'!uJs Hall leI!\:, af!\:i' lhis tbtc

Approval ;'icssions for le-enwllinp, studelli!):

t t) Friday Law e(\(O[111'-.:lll sG:-,sion for H'>CIlI011illl', SlUtiC;lts

Mondo,y Firsl Tum hcgi'l$

6

'J. )

16

:> 0

J Bill';

}. i

.J Illy

Friday (loud hiday­

lferlw:sdny L.f~ClIllCS reSl1me

l'liorujay Public l.loliday

Fri(Jay hrsl 'T'CrfJl ends

Almuloy EX;:lwinalil)IlS begin

Friday Examinations G!ld

iViullday Second Terol hegins

Recess commences

(hy

AIof!ciay Pllhlic Iloliday Queen's HinhdilY

Iviond(lY E,"\iHllinaliolls begin

Thursdoy for .."c!PUiOll to lhe

AfoJU)oy L&si. day [OJ l'vilhdr'olVii'J.l with011t (lc:1.dcmic Jll'mdty from full Y'C8.{

ror DC;lU'S discretion)

Frid(,y Second Te\ij\ \~nds

Ai')i~d(ly EXMnininiolls bc[':ill

;;ept(~IilbcJ.-

MOfld(,v Thini '('Cll)) hq:ins

()(;tOl)r-;;(

Saturd,,?y Closillg (Undergf<ldpc~t[~

Mourll/.Y Puhlic Ilolicby - I,nhor Day

:;, g n·UfJY 'third 'J\,";!fll ulds

pellillty from

1989

'/ Monday Ann",,1 Examinations ["'gin

TEfL\-l DATV;:; ELOn OF ~H}'~!HCf PROt; !If\ Tv'C\:lJ~ J 9g~~

inclilding E"steT"

V"c.'l:.tion

FOn1l.,l.tivc Assessment

VaCaliGJ

SWV,\C

!\SscsSiI1cnts

};hni-Ekctivc

Ten!) 1

Vncati()Jl

Telln 7.

Consolidation

Vacation

'felTn ~)

Co,lsolidatioj)

Sluvac

AsseS~:l!lC!lb

Mini-Elective

m

plus Ec'slcr

V?c!lticll

TCIl!) ).

/\ss(::;:m.l.cnts

Vacation

Elective '1

l;'U~Hj

:y,

:vl"y'}3

.Illly

;\ug 1

/;llg L}

Oct 17

Oct 'I.!

Feb n 1/4/38

IYby 23

July):5

Al!g 1

Aug 15

Oct l'l

Oct If}

Apri! 79 iO week tl'.JIH

20

.ltdy

July}9

Aue P

Oct 14

On 71

:..;ov J g

--- April)9

Niay ~W

Jldy n July 29

AUI[ 12

,,- Oct]4

- Oct JJ

Oct }g

9 weeks

1 \'leek

7. weeks

9 weeks

1 week

:~ weeks

?. weeks

10 week teun

3 weeks

9 weeks

] Week

9 weeks

week

v:eek

OCt 31 i\~ov ! 1 ~: we(;ks

Apr )5 I\pr 79 1 ,,'<'eek

June '{j J,'jy 1 1 week

Sept :)

,~';cpt 1/

On j

JO

: Dote not jino/iscti

Year IV

Tenn 1

Term 2

plus Easter

Vacation

Tenn 3

"l'cnn if

GP I'raining Period 1

Vacation

Term 5

Tcm16

Sll1vac

Assess.ments

Feb 1

Mar 14

1/4/88

1hy

May 16

June 27

Aug 8

Aug 18

Allg 29

Oct 10

;'\uv 21

1\ov 28

Feh 1

March 11

April 29

8/4/88

June 2A

Aug 5

Aug ]'I

Aug 26

Oct ')

"'ov 18

C;ov 25

---- Dec 2

Feb 17

6 weeks

6 vlcck term

2 weeks

6 weeks

6 weeks

I liZ wccks (inclusive)

I 1/2 weeks

6 weeks

G wcr.k;;

1 week

I week

2 week:;

v,,,,,, GPTerm

Term 1

Tcnn 2

plus Ea'::tef

Tenn 3

Feb 1) ]'vIM 18 5 wi~ck$

Mar'll April 29 S week tum

/\s~cssmCTlt

Period

Vanlion

Term 4

Stnv:-H~

AS$('.ssmcnt

Term 5

Flectivc

ADVICE A:~D

1/4/1l7

::viay June

june 1 -- lUllf'. I?

June :?O .Yuh 22

Juty 25 lilly 29

/uIg 1 Aug 19

Aug . ~- Sept 23

Sept ?G l~OV 18

5 weeks

j v/ec.k

1 \veek

5 weeks

1 week

:1 weeks

5 weeks:

H weeks

Advice and information 011 nwttcfs <'01'CI:1'<1""

of the University C;:1n be obtained [1'orn a

Faculty Scerl;taries

the F acuIties of people.

For general sbout University reglllRtions, FacHliy rules and studies within the University Hnd so on~ students may

Faculty Architecture

Arts Econornics & Commerce

Education

Engineering

Mathematics

Medicine

Science

con~;1I1t:

Frur!ity Secretary 1\1rs Dianne

Ms Julie Kienl

1'/ls Chris \Vood

Mrs Linda Harriga1l

Mr Peler Day {,*'I<

l\lr Geoff Gonion

Mrs Dianne

M, Julie Kiem

Ms Helen Hotchkiss *

)\1r Brian l(ellchcf

lVl, Helen llotchkiss *

* located in the Student and (northern) end of the

PhOfH1

685711, Of

685711

685296

685695

685,117

685630

685711, Of

685711

685565

685613

685565

[oca/cd in room W329 in the iJehavioural Sciences Building

*** located in room EI1?09 in the Engineering Buildings

***~!': located in room 607A on the 6th floor of the A1edlcal .\'cience Building.

ii

For en'1ulIlcs regarding paxtieular studies within a faculty or department Sub-deans, Deans or Departmental Heads (sec staff section) should be contacted. Cashier's office 1st Floor McMullin Building. Hours 10 a.nL 12 noon and 2 p.m. --- 4 p.m. Accommodatioll Offker Mrs Kalh located in the temporary buildings CHeers and Student Mr Hugh Floyer, phone located in the temporary buildings opposite Mathematics. Counselling Service phone 685255 or 685501 located on the Lower GrollHd Floor (northern cnd) of the McMullin Building.

ENROLIWENT OF STUDENTS Persons. offered cnrohnent are requited to attend the Great Hall early in Februal y to enrol and Detailed instructions arc giV(;ll iu the orie[ of

OF StudCfltS cll({ent1y enrolled in ill1

-course who wish to transfer to a course 111usl complete an

rOnll and judge it with the.ir H"1"'<C""."

at the Sludent AdrninistratioH Jalllwry 1988,

BY CONTINUING

at

Thi.:~re HfC fOllf steps involved for fc-enrolment by cOlltinuinl~ students:

I' collection of the re··enxolment kit the Application for Re-emolment [or111 with

details your <J attendance at for cnrollnent approval, and , payment of the Gencml Service Charge.

(Students who aTe in research higher degree programmes re­enrol mid pay clul,ges by mail). ne,.,Enroh!H~nt

Re-enro!mellt kits will be available fm' collection from 19 to 2? October 1987 from the Tanner Room, Level Three University Union and thereafter from the Student Administr~tioil Office in the Mcl'.;htllin Building. '~fhe :ce­enrolrncnt kit {;'olltains the student's for Re­enrohncnt fonn, the 1999 Class Charges Payable for 1988 and re-enrolment

fOl' n~;~Ek1:rohnent ~Fo:nn5

for R(>enrolment form must be completed and lodged at the Student Administration Office 8

1988. It can be in November or December, students know their cxmnination results

the form, There is no latc chaxge important

Application for Rc-enrol!ncnt form lodged by 8 1988 as late lodgement will mean that enrolment will nol be possible before the late re-enrolment Enrolment Approval All re-enrolling students (except those enrolled in the arc required to attcnd at the Great Han on a specific date time during the period 9-]5 February 1988. Enrolment Approval dates are on posters on University Noticeboards and afC included in the enrolmclll kits issued to students in October. When attending for Enrolment Approval students will collect their approved 1988 programme and student card. Any variations to the proposed programme requires approval. Enrolments in tutorial or laboratory sessions will be

arranged, Stafr from academic Departments will be available to answer enquiries.

Fare concessions forrlls win also be lRsucd. providinr, the (~1enetal Services Charge has. h~cn paid.

A service charge of $10 will be imposed on students who re­e,IlIol after the specified date.

PaYHlent of The re.-enrolment kit n

Statement of Charges the: payrnent of charges at any thne after receiving

All chatfjcs, includinp, debts oHtstallding to the University, must be. p:;lid before 01' rc-enrolroent -_ .. part p~ynlcnt of total amonnt due wilt not accepted by the cashier.

lnail is cheque Of

lodged H\ail outside Office ill McMullin The receipt

win he nlaiJed to the student.

Payment enrolnlCut

cash at the Cashier's Office fl1ay lead to queues (1.1.

'rIte Cashier's Office win 13(:; open for extended hours during the cm:ohncnt $cssions in the period 8-15 1988. further p"ymcnt should be by only.

Exemption h'OfI1

Charge (see page of Higher EducaJjon Adminjstrntion

LATE I}AYlVH~NT

Payment of the General Services -Charge is dnc before or re ..... enrolnlcnL The final datc for is the dale t1H~~ Re-enrolrnent C011rS(', eonc\;.[n(~d in

] 988, after which a late charge;

$10 jf it; received up to ~md including '7 days

$20 if the due

is l'fx:civc;d between g and Itt days after

$30 if pnyntent is lcccivecl 15 or nlon~ days after the due date.

Thereafter enrolment will be cancelled if charges remain unpaid by I MarciL

STUDENT for Enfolmcnt students will be

v/hen a1 the Card has machine

as evideIlce of cn.fohnmH. lettering for use. when

and contains the books from the University intcri-m pasf1wonl for access Centre.

Students arc uff,cd io wke the card is lost or d,>,h-OVcr,

payab1<, beforc the card

of the Comptlting

Cfixe of their Student Canl. If

A student who withdraws from studies should return the Student Card to the Student !-\Urn]l"'.'''''''"''l Office.

wishing to resume on has heen enrolled

Newcastle. but not achnission Adrnissions

PI'W;ULJUH forms may be obtained from the UCAC or from Administration Office and close with the UCAC

on 1 October each year. There is a $40 fee for latc applicatiolls.

ATTgNDANCE STA

candidate for qWJlification other than a postgraduate qualification v;ho enrolled in three quarters or more of a normal fu1l· tl111B programme shall be clem-Hcd to he a [ull~timc stndent \vhcreas- a c;H1dida!c enrolled in either a part-time course O{ less lhan three-quarters of a full-time prognnnme shall be clccrned to be a part-time sludent.

A c[~ndidatc for a postgraduate. qualification shall enrol as either a [un-lime OT a part-iirac student as dcterroi:ncd by the Fnculty Board.

CI-JAC1iGE OF

Student,; arc S ,-udellt

['ailure to notify changes could lead coaespondcnce or course information not student. The cannot accept official communications to reach stude.nt who has not notified the Student Administration Office of a change of address. It s.hould be noted that cxarilluation result,; will be available [or collection in the Drama Workshop in mid December. Results not collected \vi11 b;..'; 111ailed to students. Stude.Ilts \\'ho will be during the long vacation fron1 their address- [nake f'lfYangelnents to have mail

Students W1iO their Harne should advise the Student Adminisl((lJioH (viarriage Of deed poll certificates should be presented for siehting in order that the change c::m he notf'd O~l UniV{~:rsilY records.

CHAI\GE

withdrawing example fwm ,_" different degree or faculty.

Alll'mposed Programme Rt~aSOllg fOf

evjde.H{~C in the certificates must be submittc.d.

J'I"lHll'1"I<nt to withdraw frorn ., P'-'W"·""OI11'" sectiofl

received by the be approved for withdra<,'!f,i

reGorded against the subject or

8 .'\1, " rl '" 'li'"

to the incllldes

or transferring to a

on the Variation of Programme form.

documentMY other approp-ciatc

date listt?:d below ft'tllure being

1v1ouday 26 Septr:n.tbcr 1988

iii

\Vlthdrawal alt~r the above dates failure being recorded <1eainSi iJlC the Dean of tIw. Faculty gfants withdraw wilhout a f<:dlnyc beine; fc{.::ordc{L

unless

[f a student belif:.vefi t1l(1..~ failure s.hould 110t be lcconled because of the cirCllfilStilw:es 1.0 his or het Vlithdr;;waL 11 is importa:ilt that full details these circumstances be provided with r1v;' applicatiol1 to withdrav!.

Studenfj, should pnS1HC ~hat all detai]~; on thnir Approved [ofIn arc em (eeL f"ailure to dwd~ thi~; jHi'onnatioH

create problDw;'j at examination time, A ConfiniUtiiuii-0/" };nrolmen( forTH \vill HOt b('. sent jn 1989,

Any stude.}}!. '..\illo is iJHkbtl,d l,(J lhe Univ(;(sity l)y ):(~~son Ol of rll1Y 1.'1',\ O{ clt.nf[~e, nO/l'paymcnt of any £inc:

OJ' who lw~; ridhd Lu pay tIllY ovcHllle (kbu: f,lwH llot h(~ l){~(tHiu(~d to

Ci!to]nlCJlI ill !l l'olhnviHj{ YC[I(

if(1tl;-;c(ipL 01 zwadewic H':co((i; iJl

gn1,dnatc, 01 bl\ H DiploHlH,

until sHell debts l.l<1.id,

:-;ll.l<!I\)lts

1\ slud,.'lll \'/ho doc.4, l1"t \'!ish three YNF,I,' should \'/( ~lh;.;eJlcc, ! ,C;lV('. of

fi(st yf'llf ['qC If~(l.ve of ;·\1)sew-:e win Hot tor: grillikd {OJ' Inurn dtDU

not be grlhlf:;.d rc!,·o::j)(·ciiVI;]Y,

f ,e:-tvc of

lind will

Col!o\'/ing ilt)IJlics:

at the COntplf~l.iml of Rn

pcrfornl;:nlcc jr; (lce.lllCd may be guntted

fwadl:Hllc YCDl', a cHwlida1c who;;c Lionrd 10 [;1-; sniisfacfOly

r::-nch COllditions :-ts the SHch 1(;[tv0 will not uonnally Facuity Board ill;l:! dr:t~llniHe.

1)(: gl ,mtt~cl for mol';'; than one

Application fOf )l.drni:;simt to unclcY[;J:adw-lle de[~rce COI1{Se::; must he wade lhlO1Jgh 1-1w UCAC (se~ p iii),

lI:ls J10l beeu the Reg n.l.n.t.ion s

of ilJness or for some olhcl llllaVoidal)le c.ause, a stl1dent rnay be ci\cnsed for lion n.uenduucc Ht classes.

for {'xf'.mpLiol1 f{om nttendancc at classes ir:i Wl itiug t.o rllC Head of the Department

\Vlwre tests or tena examilHlt.ioHs hnve should be noted in Ihe application.

froul nttendance at cla.f.ser, docs of the General Se,vices Ch~l1)j(~

GEl\'ERAL CONDOCT

:mcnllJmship of the to ObSCl vc the by .. laws and

the Univel'sity.

Students are expected to conduct thernsc.1ves at all tiHlCS in a seemly fashion. Srnoking is not p20nittcd during lectnres. xu

iv

examinntioH roorns or in the University Libr~lry. Gambling js forbidden.

MClI1bers of the acadell! ic staJf of Ihe adrninisualjve officers, Bnd other persons

have to report on disorderly University.

SCA1101

for til" or irnpropcr

Official Univctsity 110!.ic(':.s (!.re displa.yed on the notice bo,nds Hnd stlldellis arc expected to b~ acquainted with the. contCnls of iho::c iliUlOUllGemenn; which coneCl11 th(~m,

/\ notice LO;lId ou the wall opposite the (";Htnmce to I.edtl"!!:

'fhcaln:· is lIsed for the specific of nxr"(1'lliJlD.tioll lime-tables hnd {"ox(\.lnJ.ualions.

'!'.,;st:; I.mel assessments 111<1y hI: held ill :llJy ;,l1bjecl f(OH1 jime TO tiwc:. In the' (lsseSSlIwnt of H S1.lldCHt':~ F{O?Ij~S~: t.il (t

llOjVf~lS.iiy (:ot1(se, consideration wil] })('. f;i'.'CH to lalJO!";ll,YfY

\\.-'o1"k, IlltOl'iaIs HIld assigl1l(W.\!l~; and lu any ICflO 01" OilH~(

lests !..~ofldU(;tP.(l tllroughol11, [he . 1'h.; j"p.Slll1:; or such assessments twd c1a~;:; \'lude may lIlCOlpmatec1 \villl 111o!;e or Ct)Hflal writ1.c:n CX!1ntiu<ilions.

"I,'OnU,;] \',1riu.cn examinatioHs U\.l{f~ place 0,1 pf(~scribcd dates within llw following periods:

Ivtid

End of YC(lr:

) 6 to ';0 iViny, 198H

7.? June to g July, 19H8

Li to 19 August, 1988

I to ';:S f'-Jovembcr, j 988

Timctahlr:s the i.irnc mid pbcc at ir).dividuul

held \vill be O{r examinations notice board }lear Lf~clure Thcatn~ (opposite the Creat Hall),

:Hi.sr{;(1diHg or !.lH~ t!u\ctable \dH Hot H,nd(~r

dn..'ul!lslHB(,C~; h(; fni!lin~

to nUend HU c:u:~nIlhHl'doH,

l·'onnal exanlinaLiOHS, 'vvherc Students Slt011ld consulL the out the date! time and place or iheir l)x,l(OinalioJls Hnci should (1110\'/ thmur;dvcs plenty of tiEl('. 10 gel

"{OOHl 50 that they Gall takf'. reading linle that is allow(~d

commences. For.mal CXmnillHtions Great Hall an~a mld (in NovClnber) the Spm IS

Centre. The seat allocation list for examinations \viII he placed on the Noticcuomd of the Department running the

and on a noticebounl outside the examination :room, Gall take inlo Hny exulllinal.ion any writing

instrmnent, drawing iustlurnent or eraser. Logarithmic tables rnay :Hot be taken in: they will be availab1f~ fronl the 't1!Jerviso,: if nccde.d. Calculators arc only allowed if specified as. H petmitted aicL They BlUst be lumu held, battery op?rated

and '1 and students shonld note thai. no

(a) to n stHdmlt \vho Is prevented from bringiog into a room n. I}!"og(c1mrnab1e cnlcnlator;

(b) to a r.tn<..leHl who uses (1: cakubtor incon·ectly; or

(c) because of uatt.nlY f(!ilnn~.

1 S of the EXHnliuatir)l! Rcgul,;liiollS sets dOWll thn fortnal exmnil1<~tiollS, fol1o\'/s:

(it) cR.ndjdn\('.s shall eOUlply 'vith it sHpclviso!" relating to the

(b)

(e)

(li)

the GXHiilinatiolJ :~llJ)('.'·Ji:;or which :;t.aft of the CXHl1tinalion;

no c<nJ(\idr1tc. ~;h;)ll ('S!tc! 'IOO'lt

t]liny winnf.(;[, ffom I.he lime. the {~x(nnifll:l.tiolt }!,U~

bl~gUll;

no cflwlidatc sll!dl ]r:;JV" 1118 (~z[JtJ1ilU.\tion room d.l!rinl~

ill(: first thilly ]{Iinnic:f: Of the lnst tell liliutlies of tiw

examiIla!ion;

(c) nO r::llldidatc; shall cul.c( lhc (;X(l[niIVllioll rOOdl ;lflCi

ht~ ha~; Icfl il mtJe~;s (11.11 in?, thl~ fnIl p(~{iod of hi.'; ~lb~;('!lC(', h(' has hr.cu undc( 'ljJ(l!·oved supervision;

(i) '\ candidate ::;!H'il .!jot 1n ill}; into the ex:uI11natiu!1 fOOlll

'~!~'/ b«.g, papt;"C, book, Wlin(',H l!1~uc.(j{ll. dc.~.ice ;){ ~~id \vllalso!>\'[;"\', oUle! IlUU1 such m;IY be Sperl) lCZ!. lOr [fl,:

!"J(ldiclI]a( f'Xall1inaiioH;

(g) n. cilndidnle filwll not by {ldy meaJls 001Htn or t:udcavollJ, to oblain i\np{or)(~j" assiswncc in hi~; \vork, 01

,:odr;:I\'01J"( to tu ;\!lY otlJC{ O(

rOiJlmit (lHY U(c,H;~h qf f~ood order;

(h) a {~a!ldidme s1ud1 nOl trl:.;.(; from Ilw f~XDmi))atioJl {oom

fl!lY c.xanlllw.tion :m;:;w!..'.( boo1-:, piltJt~r Of other n1i.11J:.rial js.'lHed to <~x(lHlj(laLion;

pap(~(, drltwin}j fOf use duriufj ttl,'">,

(i) lID candidate way ,,"toke ill the cxam;'"ttion lOOnl.

of ll!i'(;C; rl1lc~; constitlltes a.n off(~HCf\

Exmni:tl}llion results nnd rc"cnrohIH~lli

for collection hom the U:nUll<1 StHd~.o fo{ collectioll will be examination {OOlllS in

Results not colleeled will be mailed.

\'fiJI be aV~lila1Jlc 1 )ecernber. . 1"he dates

outside lhc rnaiJl

1\'0 x'f!§uHs vdll he giV(;H by tekpjlon~~~

After the release of Ihc {mnual cX;l1nination results a studenl lllay apply to have f! result reviewed, Thcrl~ is a of $8.00 which rcflllldable ill Ille event all

for review mUSt ue with the

rcsul H~ arc rt~leased mtly after careful assess:mcnt of students'

1 A ca/r:u/ator will be permitted provided program (:ards devic('.s nre not token into the e.Y/JnlinmioH ;-omit.

writing 1.0 !he ReIe.vaHt c'-vlct~"";nc(~ shonld

othr:r things, marginal "i"(:k(lSi~d.

ein: {lHIS t[111 C(~S,

(.SlO" 1).(2) of thE Exmnillatiol1

1). /\lso rcf,x 10 Facully Policy.

Application fOHns foJ." from 1hl; ,(;Uldcni Henllb Se)"vin~ BFIOU': (l stwlcnt's consi(lenl.1ioll wiH be; cOHsicli:-:red on ;j10Hnd of pc!"sonal illness 11. IF'. jJ('.(,CSS{lfY for a medical ef'1 rificail; to be I'I1\Jlishcd iu. tlJC fOHn sd out 011 lhe Appltcatlou.

f[" a sl11dC:"J:lt is (lffect,",,(\ by illness ,lU l;:x'Hnioatjotl ;:nui wi:;Ifc:; to COl sVc.ci;d cOllside{(ltio!l, (Y( she 1!lHsl rC!}OJ t ttl jf)f~ sUp:;tVlf,Of in of Ih,; 1'",{Hmil!£ljioJl ;mel. tiWrl J:,;;:lkc

;(!J~)l;.\ ·~diflq (0 tllt~ 'vill!1H drr"t.;e d,IY'--; or lli" of the j':xamiHaLiotl

!\lso ref(;( to t'ilCltlly (,;X(11llj{wl10n

H. r,?lJ latjoH~;,

!'olicy,

The nvjdC\lr;c

npplic:t!ll

g([{'·-:::tcd by the br.::youd our; elrl).! 111(, [._,,,j(liJ

The ;~ncm.I:; uf F;H:Hhi!';~; of j\a;hi(:CiHfC', r~Jlgjnc(;f;Jlf~, ;l,ld

IVLltliei!latk:; rWly }yal!l dr;fcffcd r;xi'Jwi{!(;tioHi;. ,'·;uch examij)~niow..;) if gr;;nltBd, '.0/11! held in ;tnd c'lfldid8J(.S will he ()/lvi:;ed by m;:l.il of 1.he tlUit;[; ,lnd of rh(~ (;;{arlli.twtlO(JS.

Tlw adoptnd I.(~;gHlnlioJi~; nov!',) njuB whiclt SI'! out belo\v.

~;tlld('.1l1S who bCCOlltC linbh f()l acliou lHlckr ih!": Rl;gul<HioJls wiiI be informed accordingly :mail ;lfle·t· Ih.; fek()s,~ of the r::ud of c.x8.Uliu:--)lion wnd \-'!iil be informed of lite prOC(;dUfC to be follow<~d if they wish to 'r,h'ow camw.'

exclusion HUlst 1)(". t.or;etlll::;r with Re· ellfOIHtenl fOHns 8 Jalma·, y

The F<1culty's progress r:::quirernents nrc seL ont elsewhere ill this volume.

1.(1 )These Regulations are. Hladc in accordance with the powers vested in thn Conncil under By .. law ,').1.7.

(2) T1I,,:;0 Reglllmio!ls s!tall apply to all stndent:; of the University C{ccpt Ihose \vho are candidates fOf a de.grcc of lVIastex O[ 1 )octor.

(3) unless the contexl or subject rnatter

v

Ii AdrnisstolH; lueans the Achnisslons (~omrnittee of the SCiU-ltc constituted nll(if'!{ By .. lnw :U.5;

IlDean il WC:LlytS the Dr;ml of a FacnIty in \'/hi~h 11. stndp-nt is enro He(l.

I~o~¥'d II :meallS the FHculty Hoard of n which a student is curoHe(t

L(1) A student's enrol(oeni, ill oe tenninated by the Head of \11,,,: DcpHrtlnCfll subject if that stndent doe:.: not rnainlain a rate progress considered satisfactory by tho Head or n(~V,utrnerlL tn determining \vhcthcr ':1_ studeIll. is failing to nwinU)iIl ~;lltisf.3c1.{Hy

the I-lead of' Lh'pad!J)tH( lJl.il~1 into such f(lCiO{~;

(a) lms(ltisfi,.clo1 y seminars, 1;\I)Or';:lot ~/

(b) hill"" to

(c) fnilnyc to compJt~!r: 'l.-'rllten \'/orl; or othCl

assir;nmeilts; and

(d) failure to cOfnplcle fidel v/ork.

(7.) The enrolme1lt of a slwknl. terminated purStul.lll to

(3)

un1c!;s he hilS

of the intention to consider of the grounds for so

given a reasongble oppoj"j representations cith';f in penon Of in Of both.

A student whose ellrolment in [l

lInde)' rcgl!lal.ion ? (l) of these to the Faculty HO[lXd which shall

subject is terminated nlay QPpeal lbe matter.

(.1) A student whose enrolule.nt in f~ ;~lJbjcCl lS terminated under this l~(:gul[ltion Sh~ill bl~ dcc!flcd to hove faik.(l the ~;ubjecj ,

3.(1) A of

Board rnay review the academic perlofm:ll1ce V/ho docs not 111H\lltain f:. nJlc of

COllf;idcl.'ed si.ltisfacLory by the Faculty Ho?(d detcl1l1inc:

(a) that the stu(lcnt b(: pm mitted IO continlle the COIl(se;

(b) t118t the student be permiued to course to SUdl condj tiOHS

coutim.w the thl: Faclllly

(c) thaI the studCtll 1)(; excludc;d j\. 0 In_ fllrther Cl11"()lo1ent;

(i) in the COl.l(SC~ or (ii) in the COlllse ",ld flllY other COllI'S" offered ill

the Faculty; OJ

(iii) in the !'aclllty; or

(d) it" the f<1Guhy Board cow;iden; irs p0\'.'[~.t"S to de~\l

wilh the case am be reff:1fceJ to the AdHlissions togciher \'.lith a )"(TOlnn!.cndation for such action as 111(; l"ocl1lty BO(l({l cOllsiders approptiatc.

(').) Before H clecisio" is """ie unel,,, :~ (1) (b) (e) 01' (d) of these the .shall hI.'. given an

r[~}Y(C~e(llallOl1s- v/lth re5[>cct to the in person or i)1 writing m bolli,

(3) against nny ckcisiol1 rrwde Hnder or (el of these to the

the matter.

VI

4. When~ the progress- of [I. ;;t.udent who is enrolled in a combined course Of \-vho has previously been excluded [{om enrolrnent in anothcr course or is considered by the

Faculty Hoard 'shall tZ)gcthCT wjth a

IecornnwndatioIl for such action as the Faculty Hoard GOliSickrs approprintc.

ih,; ./\dmissioHS

Regulations be in such by the Admissiol1s Cowlllitt~c mld shall i'o11 (1.CI".n days fro In the datr; of

3 (3) o[ these be prescribed

rmnlc \viLhin to the

student notification of the further pefiod ~lS jhc i\chnis:;iollS CommiO.ee rnay accept.

V) In hea} ing :-111 appc;:l the l\.chuissions COfnnTiUee may t~tkc into consi(kn~tio(\ circIHnSlan(;~:; wllntsoeVCl

l"aisf:~d :md may sed:. af) fit the

(l.clukmic ;'(~cord of the appclhitlt and the till' detcunill.ution t.he. Fanllty iloard. Neither Hor the ::hall act [IS H nH:;]11fJer of the. AdrHif.;f:lolls Committ.e~:. on the h{~Hring of any such appeal.

(3) and lhe Dean or his nornince shan lwve hem d il1 person by the Admi';slons

(!~) T~w !\chnissiow; Cmnntjttce may confiuTl the decision made by a lhHlrd substitute for it any

the is cmpo \-vcred l.O

nt(lke PllJ"SIl9.Hl to thes{~

6.(l) The A.dmissiolls Cornmillce shall consider (luy .wren·eu 10 it by a "FDculty Bowed and liwy:

(a) wake any ckcision \-vhich the "Fr1.CuILy BORE.l ilseH could .h(n/t~ mnde pursuant 1:0 regulation 3 (1) (a) (b) m (c) of these Rcguln.tions; Of

exclude the Mudel1t frmn enrohncllt in such otlie.\.' courses, 01 J;acultics as it think:; fit; or

(c) exclude the ~;lndcnl frOB! thp. University.

C?) 'f"hc Committee shall not make ,my decision pn r.:>u un! 10

regnlatiOlt 6 (I) (b) or (e) of the"" Re;;lllnliOl'" nnkss it has first given 1.0 the r.tudent the 0pPo·ltlJnily to Lc he-.urd in person by 1'he Committee.

(3) det;i~;ion

Rp,gulalioll.

to the Vict:-Chaucdlor against by the I\chni~;sions ComndHee undc"!"

'I, \Vhere there is an [l.lipcnl Hg~\inst

Admissions Cornrnjttce made nnder Rep,ulatiow;, the ViC(~··Chanccllor rnay refer the H1attt~t· back to

the AchnisSlO1lS Com-mittee \vith ie.cmnmcncbtion or shan for the iO ue hen cel by the Council. '1' h c m'l.y the dr-;cisiOH of the AdmissioliS

Com1l1ittc(~ or snbstitutl": for it nny other decision which Ihe hdl11issions CHlpowc}"l.::d to make pursnanJ to tlu:sr. RCBuJatio.<L';,

8.(!) A stndclll \'Iho IIk}s lJGf:.n cxc1ndi.::d from fl1flhcr c-l1{olment ill () l!wy Ulfol 111 conrse in auothe[ Facnlty only witlI ueunission or the F8-.cultv Bom:d of th;,l

(Iud on 'such conditions ns it 1ml.)-; clf'.t(;) mille after allY advice flom the Dean of ilu:. l,'Hcnlty the ~)lu(kHi. \vns exclUDed.

(2) /\ stndel1i who has been excluded. frOlll furthc.l enynlmr.nt. ill nny COlIl"S{\ Faculty OJ' frorn t.he University Buder

these H'.g1l1alions inay for p(~nni:;bion to GlIrol th!~rein again provided 110 case shall enrolment commence before the expiration of two

acadernic YCRfS frOTH the date of the (~xciusioll. A decision on such application sholl he nHl.dc;

the Faculty JJo,)xd. ·where the swdent hns oe('.tl front single course or H single FaculLy;

or

(b) by the Admissions COI1l1nittc(!, in any other G(lSt~.

to enrol pnrSu3Ht io of these Regulations is

may appeal to the

(/.) A swelcnt Regulation 8 C'J.) the Admissions (:hancd1or.

to enrol pursu;::mt to 1,{{;f;',lllcttiOllS i~; by

~\ppc.d to ·V ice

Tlw Gf':HC'-fal ;)el'!jr:r:.s CIHftljC (detn.iJ~i 1J;:~low) i~,

sludenl!;. HeVl lllH_kryntduaLe sludeltl3 charges when they Hucnd to enrol.

by all

I"'Y all

i<c··cnfolling st.nd(~nt;, reG(~iv(-~ in October each year, as part of lhdr xe enrolment. kit, a statement of ::;l11ch;nis arr. expe(:tz~d to chari~es in cnToblenl f"wd payfHGllt by H~qnc~;tr;d. Tlw }::\;-;t daLe for

of ·wilhtmt iOCHyfing H late is t1F~ claIr; ;:c:~S\(ln for

·!988),

Union (J.wxge

varliClllaJ

S If;'1 Pcr iHl!ltl0l

S20

S80 Per annHn1.

T'h.-; f~"X.;JcL 8lTlount must be paid in full by the prescrj}:wd dale.

ChHrf~{~~)

V!.hcrc the :;uu:entcol. of Charges payable form is lod~c(l wilh all payable after the dHe date

jf up 10 aud inc1udilJg 'I dnys 8fter the due date; ! 0 r, if received betv/een g :md I::!, days nfll~r the due date; or $20 " if recf;ivcd 1S or mote days after the due (lill.{~ $30

Oth..., special snpervisiolt

(0) t<-,~vie\'1 of eX(-ln11.nution results

(c) S tatenlent () f rnatricnlatiou stallls fm: non-lnen1bexs of Ihe University

(d) Reph-lcelnent. of Re-cnl"olrnent kit

(e) Re"cmolmcnt after the P"""W!,;U

re~CDl"olrncnt approval

(0 l~cplacerrH:nt of Student Card

t1 High~~i1' Education AdnlinRf:ii.r,ntioH Chnrgc

5~ Jtl](h!hted §tudentR

S15 pC! IJHVel

$8 pcr subject

$8

10

$JO

$5

All charges, incJ.ndine debts oHtstandin~ to the raust be paid he.fore or UpOll enrolmel1t tolal amount dlle will not be accepted by the

;'AlDMINIS'ft'~11\1'}(ON CHA.l<'GE

listed below, the ;11 uaiversi1.ics and

nmlertaking full award courses, or COurses or individuill ~;ubject-s which Gould [oun part of a highn education I-lVJB.rd,

Th(~ dwrgc. pad.-tiHlc or cnrol1nent.

10 ,stmknts enrolling on II full, tillie,

[Ul(l \'/ill be irnposed at the lime of

The following categories of stuclenis wilt br~ exenlp1.ed from the rhargc:

Supporting PnrClti,

\Vik's Pr:Ilsloner whl'n.~ hnslwnd 111valid 1WHS10!if:L

(ii) \Vidow CJas~; /it,

(iii) Un1vcl:;ity ~)i !\k\'!(:i!:;dc.

.'icholarship.

(iv) vic>' Pc();;iunr:rs v/ilh lKm,;ion FY,lnted Oil ba~;is

of invn1idii.Y.

-when; hnsh;:md i:~ fln Invalid SCJ vice P(~nsjon(~{

Vhlf V/ido\'J PensioI1m:; with dependant children.

Defence \Vidow Pensioners ·with de.vcndant children.

C(ln~rs SCIVl(:e Pensioners.

Veterans Disahility Pen,)loners -in receipt of one of thf~ pcnsjol1s listed above.

(v) Students who are and ll<-l.ve been in receipt of uHcmploy­nlCllt benefits for al least three months at the tilHe

to pay th,; nntSl1'Ol!on Clwrge and

who are Brll"olled in pmt-tjuw studies,

Evid(;HC{! Requin-:d \"/iih AppHcation

Concession C,I((,1 (includes C()Jjcl-~ssion), OJ

Security Carel.

C01lt"~s~;ion C'll·d (incl1.Hk~ 'frmlspo"! t COll{;ession), \li

Social Security Card ,mel either PharmaC(;lJlicai

nCflefits COHc'>':sioH Card ()l" Pensi("\w~i" ik,dth

C,)"((l) il\\!i(:Htin~3

depf~!ld;'i1t r:llil(lrcJl

/\ IlOL1~T or of ;.1

11.0t including (~f"j1f:nd(lllt;)'

;1 tlowaw.'c.

,0 ol)tain ffom the Office of

ttw Dep;.tflmcnt of Veteran's A.ffairs.

"F'plJleatlOIl fonns are availau1e at the Student and J;'acn1ty OffiGc.

vii

will be effectively exempted from the a special nllot'lill1ce to offset the charge:

beneficiaries under }\ustudy;

hoidel'S of an HWR-rd under Ihc Postgraduate Awards Seherne, and holders of AbslUdy grnllnL

Studenls in these categories win he [~hHhurs-ed tJnough the student allov-lancc paYJne.nts aU8-118ernents.

Overseas the Overseas Students Charge the administration

to calen} atcd cach YCHr \vill reduced by the arnonnt of the Qdmiulstrnl!on charge.

i\ssistanc{;

(a) Ii Ilstudy

Higher educat~o:n receive .a specjal rrdm 1nistnu. ion

(b) Loans

will ,he

Loans Hre availahle ((1 studcnu.; to charges. The loan p{~riod is fJ.Onrull1y in circumstances, rnay be taken

mouths. should be dircct~d to Mr J Student Office.

METHOO

Students cheque and

Cashier. The Cashier's mail the Cashier's Office in the McMulJin

he addressed to the

SCHOLARSHIP sTt:nE;'iTS

2308. Cheques and money of Newcastle.

1st Floor am to ,12 noon

hours will he extended in Ft~brui1ry,

Sludents holding or other forms 0('

financial assistance must Cashier their Stalenlent of Payable foun together wirh a warnmt or other written that charges \\lill be paid by the

Sponsors ruust provide a separate voucher warrant or for ~ach student sponsored.

LOAT,S

Students who do not have sufficient sho"ld seck a 10,U) from their hank,

charges credit

union or other fina,lc1al institution. for H loan front the Student J ,oan Fllncl should be Hladc to J\-1r. J. Birch. Studenl AdministralioIl Office, shollld be m adc weB in ;ldvance to avoid the charge,

HEFU:\D OF

A refund of the General Services Charge paid on enrolment or th(-~l'cof will U0 lnHdc when siodeH~ notifies the

uno j\dmlTlistratl0n Office of complete by the following dates.

Notification on O{ before 11 th lVfarc:h 1988 1000/0 refund.

Notification on or beforc 7,/tth June 1988

Arter 74th June j 938

viii

50% refund.

No refund.

A refund cheque will he mailed to a student of if applicable a SPOIlSOr. Any change of address must be advised.

A refund will not he made before 31 Mm'Ch 1988.

The Higher Education be refunrlcd if

is

Administration ChArge '''liB notification of "om),lct"

b*~fo:n; 19th

Sm"l!iecs Term, jhe General

from the first day of the W1WC.!W"'O·'Y nj'erN!m~ the first day of First

Term. in the following enrolment is on or (lOcr the fiTst day of 'I'hird General Services

paid will Cover liahility to the end of the long fo110V,.rj[ig the next acadclnlc year.

Ednc(\tion Administnllion charge applies to each e.g. if cmolmrml is on the first day of third IS for that term. On cnrohnent in the

subs{:-{llJcnt years a chm'ge is payable for cach YCtlr.

AND

to Ining motor vehicles (including rnotol

parking approved signs and not excecdint 35

If the Buildings and Grounds. after of SCovell days in v/hich to submit a

Htatement is Gatisfied that any person is in breach 0 f RegulD.1ioHS, he may:

(.n) "\'varn the person against committing any futlher breach; or

(h) irnpose a fine; or

(c) reier the maller to the Vicc-Chanc011oL

The range of fines \\'hieh in respf:-cl of various categories. of breach

Parking in arc as not set aside for pad-dog lip to in special service areas, e.g, loading fire hydrants, etc, up to S 15

Dfiving offences including speeding and dangerolls driving

to stop when signaHed to do so by dH

(Patrol)

10 give infonnntion to an Attendant

La obey the directions uf an Atte:mhmt

up to $30

up to $30

up to S30

up to SJO

The 'fraffk and Parking RegUlations arc statml in 1'1111 in the Calendar, \lolumc 1.

Content

The course is designed to critic!llly appraise a number of financial issues within the firm such as:

Establishing objectives and function of the finance manager; deriving basic financial relations (eg annuities, mean, variance); effident eapital markets; portfolio theory; capital asset pricing model; application of such models to evaluation of capilal projects; working capital managemcnt; SOllfces of finance; capital structures; takeovers and mergers; iutemational fiml.l1ce; dividend policies;

Texts

Alternatives

Van Home, J. Nichol, R. & Wright, K. Financial Management & Policy in Australia (prentice-Hall)

Pierson, G. Bird, R. & Brown, R. Business Finance latest edn (McGraw-Hili)

References

}lllll, R et ill. Share Markets and Portfolio Theory (Queensland Univ. Press)

H~Jrl., W.L Mathematics of Investment (D. C. Heath)

Bishop, S. Crapp, H. & Twite, G. Corporate Finance (Holt, Rinehart & Winston)

'/13200 nXm,OGY nm Prerequisite Mathematks IIA & HC & either Biology rm orUB.

Hours for each subject 4 lecture hours and 8 tutorial and !abnmtnry classes per week

Examination for each Three 2-houf papers.

Content

Biology mn consists of three of the following topics. (Not aU topics m,,, available eaeh year.)

'11310~ Ccll )l"!coc~§§I!§ Prerequisite Biochcmistry 713;:1,0'7 JJ:coIOfIY !'!Y1di lfi:volutioil 71311 0 lEu 'l'iWOlllll!lCIll taX Plant Physiology 713107 IVliammaii!lll1 7JLHO<)l If'131l1t Stnu:bll'e '113 ll06 Y~eBH'odllcti'l'c Physiology

For descriptions consult the 1988 Faculty of Science

:::lZ:flIlO CIVIlL lENGKNmnUNG nnw Prerequisite Civil Engineering TIM, Mathematics IIA & lIC

HOlIl's 6 iectllxe noms & 4 1\2 tutorial/laboratory hours per

Emmillation FOllr 3-hour papers, one 2Alour paper & two 1 lf2~ho!lr terril papers

Content

(i) CE37A Soil Mechanics 111eory of Structures II

(iii) CE333 (iv) CE334 (v) CE35l

Fluid Mechanics III Open Channcl Hydraulics Civil Engincering Systems

For unit descriptions consult thc 1988 Faculty of Enginecring Handbook.

533900

Prerequisites Mathematics UA & lIC (including Topics CO,D)

Hours 6leclure, tutorial & laboratory hoUt's per week

Examination Progressive asscssment & final examination

Content

(i) 503006 GE361 Automatic Control

(ii) 533113 EE344 Communicatious (iii) 534134 12E447 Digital Communications

For unit descriptions consull the 1988 Faculty of Engineering Handbook.

5;;3390Jl OIGIl'AL COMPUTERS AND AVTOMATIC CONTROL

Prerequisites Mathcmatics rIA & lIC (including Topics CO,D)

lIours 6 lecture, tutorial & practical hoLU's pcr wcek

Examination Progressive asscssmcnt & final examination

Content

(i) 503006 GE361

(ii) 532116 EE264

(iii) 533902 EE362

Automatic Control - see entry under Communications and Automatic Control Assembly Langnage and Operating Systems " sec CS II topic: Introduction to Assembly Language and Opcrating Systcms Switching Thcory & Logical Design - sec entry under Diploma in Computer Science subjccts

423800 ECONOMICS nle Prerequisites Mathematics IrA & lIC & Economics IIA

HOIJIS As indicated in the dcscription of the componcnts

Examination To be advised

Content

Two point~ of the following so as to include Econometrics I 01' Mathematical Economics or both:

(i) 423208 Economctrics 1 " 1.0 point (ii) 423204 Mathematical Economics - 1.0 point (iii) 423113 Development - 0.5 point (iv) 423102 International Economics - 0.5 point (v) 423103 Public Economics - LO point (vi) 423114 Growth and Fluctuations - 0.5 point (vii) 423115 Topics in Intcmational Economics 0.5

point

35

(viii) 423116

(i) 4:Z3),oa

Advanced Economic Analysis - 1.0 point (This topic is it prerequisite for Malhemalics/Economics IV)

ECONOMEnUCf;

Lecturers G. Keating, M. Gordon

Prerequisites Economic Statistics II or Statistical Analysis

flours 2 lecture hours per week

Examination Two 2··hour papers

Content

A knowledge of matrix algeora and of the mathematical statistics dealt with in S tatislical Analysis is recommcnded. The course is concerned with examining the theory of and usefulness of thc general linear regression model analysis in app1i(~d economic research and also with providing an introdnction to simultaneous estimation procedures.

rexts

Gnjarati, D. Basic Econometrics (McGraw··Hill)

Johnston, J. Econometric Methods (McGraw·Hill)

References

Goldberger, A. Econometrics (Wiley)

Huang, D.S. Regression and Econometric Methods (Wiley)

Judge, G. Griffiths, W. Hill, C. Lutkepohl, H. & Lee, T. The Theory and Practice of Econometrics (Wiley)

Kmenta, J. Elements of Econometrics (Macmillan)

Koutsoyiannis, A. A Theory of Econometrics (Macmillan)

Pindyck, R.S. & Rubinfcld, D.L. Econometric Models and Economic Forecasts (McGraw-Hill)

(ii) 423204 MA THEMA TICAL ECONOMICS

Lectu.rers C. Aislaoie, K. Renfrew, K. Doeleman

Prerequisites Economics II

Advisory Prerequisite 2 unit Mathematics or its equivalent

[{ours 2 lecture hours per week

Examination Two 2-hour papers

Content

The course is designed to providc an introduction to Mathematical Economics for students who have some mathematical ability out whose university level work in this area has been confined to onc or more statistics-oriented subjects. Topics include linear modelling and constrained optimization, the theory and economic application of difference and differential equations, the mathematical reformulation and interpretation of traditional macro-theory (including matrix algebra), the techniques of input~output analysis, linear (and to a limited extent non~linear)

36

programming, game theory and discussioll of the theory and economic application of the calculus of variation, and optimal conlml techniques,

Text

Archioald, G.e. & Lipsey, RG. An Introduction to a Mathematical Treatment of Economics 3rd edn (Weidenfeld & Nico\soll 19"17)

References

Tn, Pierre N.V. Introductory Optimization Dynamics (Springer·Verlag 1984)

Benavie, A. Mathematical Techniques for Economic Analysis (Prentice" Hall 1972)

Chiang, A. Fundamental Methods of Mathematical Economics ?nd cdn (McGmw-HilII974)

Dernburg, 1'. & J. Macroeconomic Analysis: An Introduction to Comparative Statics and Dynamics (Addison~Wesley 1969)

Dowling, E.T. Mathematicsfor Economists (McGraw Hill 1980)

Hadley, G. & Kemp, M.C. Finite Mathematics in Business and Economics (NorfhHolland 1972)

Haeussler, Jr. E.F. & Paul, R.S. Introductory Mathematical Analysis 2nd edn (Reston Publishing Co. Inc. 1976)

Henderson, J.M. &. Quandt, R. Microeconomic Theory - A Mathematical Approach 2nd edn (McGraw Hill 1971)

lntriligator, M.D. Mathematical Optimization and }<;conomic Theory (Prentice-Hall)

Yamane, T. Mathematics for Economists - An Elementary­Survey (Prentice Hall latest <"..clition)

(iii) 423113 DEVELOPMENT

Lecturer C.W. St:lhl

Prerequisites Economics II

Hours ? lecture hours per week for half of year

Examination One 3··hour paper

Content

The course commences with a discussion of the concepts of development and poverty. Major topics to follow are: underdevelopment of the Australian aboriginals; growth, poverty and income distribution; population growth and development; rural-urban migration; industrial and agricultural development policies; and, trade, aid and foreign investment. Throughout the course case study materials from variolls Third World cOllntries will he llsed, with particular emphasis on Indonesia.

References

Booth, A. & Sundlllm, R.M. Labour Absorption in Agriculture (Oxford U.P., Delhi 1984)

Booth, A. & McCawley, P. The Indonesian Economy During the Soeharto Era (Oxford U.P. 1982)

Gillis, M. et aL Economics of Development (Norton 1983)

Meier, G.M. (ed) Leading Issues in Economic Development 4th edn (Oxford J984)

Sunclrum, RM. Development Economics (Wiley 1983)

Todaro, M.P. Economic Development in the Third World ?nd edn (LongmRrlS 1985)

(iv) .:12310), INTERNATIONAL lECON01VnCS

Lecturer J. Stanton

Prerequisite Economics II

llours ? lecture homs per week for half the year

Examination 5··hour exam and essay

Content

(1) The theory and analysis of trade policy. This covers the role and scope for international specialization, the gains from trade, optimal trade intervention, the effects of trade at the national and internatioual levels and the theory of preferential trading. Australian illustrations are llsed wherever possible.

(2) The theory of oalance of payments jJolicy. This covers balance of paymeuts problems, altemative adjustment processes including a synthesis of the elasticities, absorption and monetary approaches, international monetary systems and balance of payments policy. Aust.ralian illustrations are used wherever possible.

Texts

Carbaugh, ru. lniernational Economics ?nd edn (Wadsworth, Cal, 1985)

Hunter, J. & Wood, J. International Economics (Sydney, Harcourt Brace 1983)

Meier, G.M. International Economics, The Theory of Policy New York (Oxford University Press 1980) (Sun Books 1979)

Reference

Baldwin, R.E. and Richarcison, S.E. (cds) International Trade and Finance (3rd edn) (Boston, Little Brown & Co., 1986)

(v) 4Z3103 PUBLIC ECONOMICS

!,ecturers C. Aislabic, B, Twohill

Prerequisites Ecollomics II

!/ours 2leclure hours per week

}ixaminatio/l Two ?-hour papers and progressive assessment

Content

The dfects of government intervention in the economy through the oudget and through the operation of pllbJicly~ owned ousiness undertakings and inter-goveilllnental fiscal relationships are examined.

At the microecollornic level, there is an analysis of the effects of tax and expenditure policies on, ill particular, community welfare and incentives. At the macroeconomic level, Hggrcgative models are uscclto analyse the relation of fiscal policy to other economic policies for stahility and growth.

References

Brown, C.V. & Jackson, P.lVL Public Sector /\collomics (M81tin Robertson)

Buchanan, J.lVL & Flowers, M.ll. The Public Finances (Irwin)

Culbertson, .T.M. iViacroeconomic Theory and Stabilisation Policy (McGraw·HiII)

Grocnewegen, P.D. (ed) Australian Taxation Policy (J .ongman Cheshire)

Groenewcgen, P.D. Public Finance in Australia: Theory and Practice, (Prentice·· Hall)

Houghton, R.w. (cd) Public Finance (Penguin)

Johansen, L. Public Economics (North Holland)

Mishan, E.J. Cost·Benefil Analysis (Allen & Unwin)

Musgrave, RA. & P.E. Public Finance in Them) and Practice (McGraw-Hill)

Recs, Ray Public Enterprise Economics 2nd edn (Weidenfeld & Nicolson 1984)

Shoup, C.S. Pu.blic Finance (Weidenfeld & Nicolson)

Veale, J. et al. Australian Macroeconomics: Problems and Policy 2nd edn (Preulice-Hall 1983)

Wilkes, J. (ed) The Politics of Taxatioll (Hodder & Stoughton)

37

(vi) t~23H4 GnOW'JfH ANI) FLUCTUATIONS

Lecturer S. Shenoy

Prerequisite Economics 11

Hours 2 lecture honrs fOl' half the year

Examination One 3·,honr paper and pfoglCssive assessment

Content

The course is devoted to a study of the various dimensions of the evolution and 'motion' of the capitalist economic system through time. It coilsiciers explanations of capital accumulation and stlllctural change, real economic growth and fluctuations in growth rates, Specific topics will include expanding reproduction and balanced growth, capital accumulation and income distribution, short-term fluctuations, long·,wave fluctuations and the role of innovations and technological change in gfOwth and fluctuations.

References

Duijn, J. vall The Long Wave ill Economic Life (Allen & Unwin M983)

Harris, )).1. Capital Accumulation and Income Distribution (Routledge & Kegan Pau1197S)

Heertje, A. Economics and Technical Change (Weidenfeld & Nicolson 1977)

K(llccki, M. Selected Essays OIl the Dynamic's of the Capitalist Economy (Cambridge U.P. 1971)

Kregel,J. Rate of Projlt, Distribution and Growth. Two Views (Macmillan 1971)

Lowe,A. The Path of Economic Growth (Cambridge U.P 19'/6)

SteindI, J. Maturity and Stagnation in American Capitalism (Monthly Review Press 1976)

(vB) ~2311S TOPJ(C§ IN H'IlTERNA'HONAL ]ECONOMICS

Lecturer P. Anderson

Prerequisite Economic"" U

110urs 21ectIJre hours per week for half the year

Examination One 3·houl' paper aud progressive assessment

Content

This course pI'Ovides a more advanc('Ai thcoretical treatment of selected topics introduced in the International Economics course. It also uses empilical studies and policy materials to pmvide a more detailed exposition and analysis of trade policy problems. The content consists of:

(1) The noo .. c1assical theory of international trade and equilibrium, the modern theory of tracie, its clarification, extension and qualification, the sources of economic growth and international trade, equivalence

38

among trade intervention measurcs, it gcneral equilibrium approach to protection, analysis of Australian protection policy, international factor mobility and host country costs and benefits,

e) Intcmational mOJlctary economics, the foreign exchange market and the role of arbiu'age, extension of the analysis of the flexible exchange systems, extension of the analysis of fixed 'exchange fate systems, monewry and fiscal policies for internal and external balance, a single open economy and two country model, international monetary reform.

Texis

Glllbel, Herben G. lnternatiollal Economics (Irwin 1981)

Kenen, P,B. The lnternational Economy (prentice-Hall 19R5)

(viii) 4Z3116 ADVANCED ECONOMIC ANALVSIS

Lecturers D. B. Hughes, J. Stanton, J. Burgcss

'nlis course is a prerequisite for Economics IV

Prerequisite l\conomics II

Hours 2. lecture hours per week

Examination Two ?-hour papers and progressive assessment

Content

(i) lViacl'oc(:ouomics:

The course covers a series of macroecollomic issues in both theory and policy. These will inclnde the management of fiscal policy, discretionary stabilisation policy in the opcn-,economy situation, the nature of "monetarist" and "rational expectations" based macroeconomics, dimcnsions of the capitalist "stagflation crisis", and the role of price formation 3ml income distribution in the determinatioll or economic activity.

(ii) Micl'oeconomics:

The aims of this section of the conrse are to consolidate the students' knowledge of microeconomics acquired in Economics I and II, to improve the students' depth of undcrstanding of microeconomics and to extend thcir knowledge of the subject through the introdnction of several new topics in the areas of consumer behaviour thcory, market failure and the role of govemment in the market.

References

(i) Macroeconomics:

Cornwall, J. The Conditions for Economic Recovery (Martin Robertson 1983)

Frisch, H. Theories of Inflation (Cambridge U.P. 1983)

Kaldor,N. The Scourge of Monetarism (Oxford V.P. 1982)

Mayer, T. The Structure 0/ Monetarism (Norton 19'/8)

Sawyer, M.e. Macroeconomic in Question: The Monetarist Orthodoxies and the Kaleckian (Whcatsheaf 19S2)

Shone, R. Issues in ivlacroecol1olllics (Martin Robcrtson 1994)

(ii) IV!kroccOilomier.:

Douglas, EJ. Intermediate Microeconomic Analysis (Prentice .. Hall 1982)

Ferguson, C.E. Microeconolllic Theory (Irwin 1972)

KOllisoyiannis, A. Modern Microeconomics 2nd ec!n (Macmilhm 1979)

Tisdell, CA, Microeconomics of Markets (Wiley, Brisbane 19S2)

?33300 GEOLOGV mc

Prerequisites Physics IA & Geology IrA Students are advised to consult with the Head of the Department of Geology.

543S00 nWUSTKUAL ENGINEERING X

Prerequisites Mathematics IlA & lIC

flours Approximately 6 kctlll'e hOllrs pCI' week

Examination Progressive assessment & examination

Content

Four of thc following:

(i) 543501 ME3S1 (ii) 543502 ME3S3

(iii) 543503 ME3S4 (iv) 5441\69 ME419

(v) 5~4433 ME4S2

(vi) 544470 ME483

(vii) 544464 ME4R4

For unit descriptions Engineering Handbook.

Methods Enginecring Quality Engineering

Design for Production

Bulk Materials Handling Systems I Enginecring Economics I Production Scheduling Engineering Economics II

consult the 19R9 Facuity of

:53900 MECHANICAL ENGINEERING HIe

Prerequisites Mathemat.ics IIA & IIC (including Topics F &H)

Ilours 6 hours per week

Examination Progressive assessment

COlllem

Four units:

(i) GE361

(ii) ME505 (iii) ME487

Automatic Control Advanced Numcrical Programming

Operations Research - Fundamental Techniques

(iv) ME488 Operations Research" Planning, Inventory Control and Management

For unit descriptions consult the 199R Faculty of Engineering Handbook.

H3100 PHV§IC§ nIA

Prerequisites Physics n, at least one Mathematics n SUbject which should include, in addition to topic CO (which counts as two topics), topic Band oue of the topics D and F.

Ilours Approximately 17,() lecture hours and 240 labol'atOly and tutorial hours.

Rxamination Assessment to the cquivalent of 17, 1/? hours of examination timc.

Content

The areas of classical and qmUltl1tl1 physics csscnti,l\ to the undersullldillg of both advanc('Ai pure physics and the m;1ny applications of physics. Some ekctl'Otlics is also included.

Classical Physics

Mathematical methods, advanced mechanics, special theory of relativity, elcc\rornagnctics including waveguide and antenna theory.

Quantum Physics

QualliUm mechanics, atomic and 1I1OIecuiar physics, statistical physics, solid state physics, nuclear physics, electronics.

Laboratory

Parallels the lectlJfC course in overall content, with at least one cxperiment available in each topic, although stuclClltS are not expected to caIry out all the experiments availahle.

Texts Refer to the Physics Department notice b03reJ. Students should rctain their Physics II texts.

7:533()() PSYCHOLOGY JlHC

Prerequisites Mathematics IIA, HC & Psychology lIC

flours 4 !cclme hours and up to 5 hours or practical work perwcck

Examination Pormal examinations at mid-year for 1st Semester topics and at end of year for ?nd Semester topic. Assessment of practical work on a progressive basis.

Content

Will examine topics such as behavioural and clinical neurosciences, experimental methodology and quantitative psychology, information processing and perception, lcaming and conditioning, social and developmental psychology and individual differences.

The practical work is dividcd into

(a) laboratory sessions ~ 3 hours per week. The work will be divided into four sessions of approximately one half semestcr duration. In somc weeks the time rcquirement will vmy from that shown above.

(b) An investigation carried out under supcrvision and written up as a research report. The topic will usually be selected by the student from a list available from the Depm-tment in January. The time requirement is a minimum of 2 hours per week for the full year.

39

Text To be advised

EXTRANEOUS SUBJECTS 160006 lViATIHEMATICS EKHJCATION Xl

(may not be offered in 1988)

Prerequisite Mathematics I

Corequisite A Paxl II Mathematics subject or Statjstics II

Hours 1 lectme hour per week and two 5-day schoolroom observation pedods

Examination One 2··holJX paper

Content

Learning mechanisms, stages of development as delineated by Piaget !l[l(i others, discovery method and its limitations, Bruner model, and multiple embodiment plinciple; thesc topics are central to understanding the learning process and the conditions which make learning possible. Equivalence and equality, consistency and meaning in mathematical definitions, sets and intellectualism in mathematics, finite and categorical geometrics; these topics are chosen to illuminate the rationale for teaching mathematics and thc problem of developing strategies for teaching school mathematics, particularly in the light of the rapid development of mathematics since the seventeenth century. Psychopathological aspects of arithmetic, pedagogical problems associated with geometries, imagcry and problem solving; these and other topics bear on how milch in the way of new concepts pupils can be expected to absorb at various levels.

Jl60t;lO'j MATHlEMA nc§ JErmCAHON UK

(Hot offered ill 1988)

Prerequisite Mathematics Education U

Corequisite A Par!. III Mathematics subject or Statistics 1Il

Hours 1 lecture hour per week and two 5·day schoolroom observation peJiods

Examination One 2·hoUJ paper

Content

Building on the foundation laid in Mathematics Education n, a more thorough study is made of the psychology of learning, limits on the ability to learn and the development of teaching strategies in mathematics. Assignments will [<'..quire students to articulate mathematical insights they arc acquiring concurrently in the academic mathematics topics. The integration of mathematical ideas from different topics will be emphasised, as this is reqt1ired for effective teaching. In tile observation pedods, lesson plans will be studied and compared. widl the results in the classroom.

IUJ§§lAN [l'on THIE §Cll8NTI§'f AND MATHEMATICIAN

Formal enrolment in this course is not required.

Lecturer C.A. CroxtOIl

Prerequisite None, although familiarity with a modem hmguage would be of advantage.

Hours Approximately 27 lectme hours

40

Examination None

Content

This is a voluntary course designed to give students and members of staff a working rcading knowledge of scientific and technical Russian. Translation from Russian into English is costly, and only a very small proportion of the Soviet Union's technical literature is routinely translated into English: often translation of the abstract atone is sufficient to determine whethcr a complete translation is warranted. Emphasis throughout the course will be 011

translation from Russian into English, although both written and spoken Russian will necessarily be involved. The course should provide a good introduction for those seeking a somewhat more litcrary understanding of the language.

POSTGRADUATE COURSES OFFmUm IN THE FACULTY OF MATHElVJIATICS

COllrsewod, HOllours Degrees:

Bachelor of Computer Scicnce (Honours)

Bachelor of Mathematics (Hollours)

Diplomas:

Diploma in Computer Science (DipCompSc)

Diploma ill Mathematical Studies (DipMathStud)

Diploma in Medical Statistics (DipMedStats)5

COIH'SCWOl'!, Master' Degrees:

Master of Computing (MComp)

Master of Medical Statistics (MMedStats)5

Research Degrees:

Master of Computer Scicnce (MCompSc)

Master of Mathematics (MMath)

Doctor of Philosophy (PhD)

Bachelo!" of Computer Science (llollours)

This is a separate degree from the Bachelor of Computer Science, which may be taken full·time over one year or part~ time over two years. Entry requires at least Computer Science IIIA (or its equivalent) wilh at least a credit result. It consists of the single subject Computer Science IV, which inclndes a major project in addition to lecture topics (which will include topics from Computer Science llIB for studcnts who havc not already takcn these).

Bachelor of iVlathenwlic§ (Hoilolln;)

This is a separate degree from the Bachelor of Mathematics, and may be taken full··time over oue year or part··time over two years. It consisfS of the single subject Mathcmatics IV.

I [onollrs level topics in Statistics are available as part of Mathematics IV and Statistics IV is available for students undertaking a Bachelor of Matl1ematics (Honours) degree.

Diploma iii Computer Science

A post-graduate diploma, the Diploma in Computer Science has undergone a complete revision which takes effect. in 198'/. The new regulations assume that students already have a sound knowledgc of basic programming in Pascal. Student.s who cannot demonstrate that they have such a background must first. complete the preliminary subject introduction to Programming (or Computer Science I) before taking the main subjects.

The new regulatiolls basically require students to complete subjects consisting of about. half the second year and half the third year topics of thc Bachelor of Compllter Science degree (m exceptionally a full third year for students with a suiwble hackground), togcthcr with a project involving about 100 hours of work.

The diploma is intended as a part-time course and prerequisites make it difficult to complete in a single fllll~ timc year, unless the candidate already has a good

5 Offered jointly with the Faculty of Medicine.

background (eg having previously completed Computer Science II).

Jl)ipiOllW ill Mathematical Studies

This course is intended for graduates who wish to stndy more Mathematics than was available in their {irst degree. The course is sufficiently flexible to meet most graduates' needs.

Diploma ill Medical §tnti§!ic§

This is a postgraduate course offered jointly by the Faculties of Mathematics and Medicine. The programme cOllsists of coursework and a project involving the application of statistics in a medical rese~rch study.

Master of

'fhis is a Ilew post· graduate courscwork masters degree which requires two years full··time (0 .. the equivalent pali~ time) study, To qualify for the lVlCmnp a student ITlllst pass the subject Computer Science IVM, which involves about one full year of conrsework (normally based Oll tlmt of Computer Scicnce UIB ami IV) together with a very substantial one~year research related project, usually associated with one of the research projects being cmried ont ill the Department of Computer Science.

Applications will be considered from graduates who have completed Computer Sciellcc IllA or its equivalent (eg including the Diploma in Com puler Science). The comse commences at the beginning of the academic year.

Master or Medical Stati§tic~

This degree is offered joilllly by the Faculties of Mat.hematics and Medicine. It consists partly of cOlJl'sework (mainly of units offered in the Diploma in Medical Statistics) and a major project.

Master of Com!lu!!~l> Sdcncl~ alld Do{:tor of Philosophy

The MCompSc and the PhD arc research degrees by thesis, requiring an original contribution to knowledge in the Rl"Ca of com puter science. The entry rcquirement is a 13CompSc(Hons) or equivalent honours degree wilh at least second class honours. Caudiclates are ilonnally rCC0ll111lellllcd

to cnrol initially in the MCompSc and if their work is of all exceptional quality they can latcr transfer into the PhD programme. The area of research is llsually associated with one of the research projects being carried out in the Departmcnt of Computer Science. Enrolmcnt can !akc place at any time in the year. Schol<lrships are available (competitively); applications close abont Oct.ober each year.

lViaster of Mathematics lmrl Doctor of Philosop h y

These are research degrees by thesis requiring original contribution to knowledgc in the area of Mathematics or Stastistics. Entry into cilhcr degree would Ilormally require the Honours degree. Enrolment can tvke place at any lime in the year. Scholarships are available (competitively); applicatiolls close about October each year.

41

J[Ui:Gm,Al'WNS GOVEUNKl\IG THE HONomu; mwmm 011' k'lACHELOKt OJl<' COMPUTER SCln~NCE

L These regulatiolls prescribe the reqllirements for the honours of Bachelor of Computer Scicnce of the University ml(J are mmk in aceonhnGe wilh the powers vested in the Council under By··Law 5.2.1.

2. DcfillHimw

In these Regulations, unless the context or subject matter otherwise indicates 01' requires:

"cour§c" meallS the programme of studies prescribed from time to time to qualify a ellmlidate for the degree;

"Deall" means the Dean of the Facllll y;

"the degree" means the degree of Bachelor of Compnter Science (Honours);

i<'jll"'~""!Pilt .. means the Department offering the honours aml includes allY other body so eloinS;

meims the Family of Mathematics;

")Fm:l!lty nOlll'd" means the Faculty Board of the hlCUlty;

3. Atlmif9sima ~Il Camlidllhlli',)

In order to be admitted to candidature for the degree, an applicant shall

(a) have completed the requirements for admission to the ordinary degr(X; of Bachelor of Computer Science or to any olher degree approved by the Faculty Board, or have already been mImitted to that degree;

(M) have satisfactorily completed allY additional work prescribed by the Head of the Departmcnt; and

(e) have obtaincd approval to enrol given by the Dean on the recommendation of the Head of ilie Department

~. Qmdiffkatimll for AUHAi§sioll to tlw Dcgn~(~

To qualify for ilthnission 1.0 the degree a candidate shall in one year of fulHime study or two years of part-time study pass the following honolJ(s subject.:

Computer Science IV

(I)

(2)

(1)

42

To complete the honours subjcet a candidate shall attend such lectures, tutorials, seminars, laboratory classes ami field work ilud submit sllch written or othe,. 'Norle as the Department shall n>quire.

To pass the honours subject a candidate shall complete it ami pass such examinations as the Faculty Board shall require.

A candidate may withdraw fimll thc honours subject by illfonning the Secretary to the University ill

and the withdrawal shall take effect from the snch notification.

A candidate who withdraws froIlI the honours subject Ilftc.r the last Monday in second term shall be deemed

have fltiled the subject save tilat, after consulting

with Ihe Head of the Department, the Dcan may grant permission for withdrawal without penalty.

'/. Classes of Honoill's

There shall be three classes of honours: Class L Class n am! Class III. Class II shall have two divisions, namely Division 1 and Division 2.

B. Relaxillg Provision

In order to provide for exceptional circumstances arising in a particular case the Senate on the recommendation of the Faculty Board may relax any provision of these Regulations.

REGULAHONS GOVERNING nm HONOURS DEGREE OF BACHELOR OF MATHEMATICS

LThese regulations prescribe the requirements for the honours degree of Bachelor of Mathematics of the University of Newcastle and are made in accordance with the powers vested in the Council under By .. Law 5.2.1.

2. liJefinitinns

In these Regulations, unless the context or subject matter otherwise indicates or fCC) uires:

"course" mcans the programme of studies prescribed from time to time to qualify a candidate for the degree;

"J)call" means the Dean of the Faculty;

"Hw !lcgl'e!~" means the degree of Bachelor of Mathematics (Honours);

means t.he Department or Departments a particular subject iHld includes any other body so

doing;

"I/aculty" means the Facnlty of Mathematics;

"JFaculty iBoanl" means the FaCilIty Board of the i<aclllty;

3. Admission to CHlldidatnrc

In ordcr to be admitted to eandidaturc for the degree, an applicant shall

(a)

(b)

(c)

have completed the requirements for admission to the ordinary degree of Bachelor of Mathematics of the University of Newcastle or to any other degree approved by the Faculty Hoard, or have already beell admitted to that degree;

have satisfactorily completed any additional work prescribed by the I~Iead of thc Department offering the honours subject; and

have obtained approval to enrol given by the Dean on thc recommendation of the Head of the Department offering llle honours subject.

4. Qualil'icHtioll fol' Admission to the D!~gree

To qualify for admission to the degree a candidate shall in one year of fnll-·time study or two years of part .. timc study pass one of the honours subjects listed in the Schednle of Subjects to these Rcgulations.

Subject

(1) To complete the honours subject a candidate shall attend slIch lectlll'es, tutorials, serninars, laboratory classes and field work and submit slIch written or other work as the Department shall require.

(2) To pass the honours subject a c<lmlidale shall complete it and pass snch examinations as the Faculty Boare! shall require.

6. ~VVithdl'awal

(1) A candidate may withdraw from the honours subject only by informing the Secretary to the University in writing and lhe withdrawal shall take effect from the date of receipt of such notification.

(2) A candidate who withdraws from the honours subject after the last Monday ill second term shall be deemed to have failed the subject save that, after consulting with the Head of the Deparlment, the Dean lllay grant permission for withdrawal without penalty.

'I. Classes of Honours

There shall be three classes of honours: Class I, Class II and Class Ill. Class II shall have two divisions, namely Division 1 and Division 2.

3. Rdaxing ]'I'ovision

In oreler to provide 1'01' exceptional circnmstances arising in a jJilrticular case the Senate on the recommendation of the Faculty Board may relax any provision of these Regulations.

scmmUU:i: OF SlmJECTS lladlClOI' of Mathematkl' (HOIIOIH'S)

The prerequisites are to be taken as guides to the required background for candidaws with degrees other than Bachelor of Mathematics from this University.

Mathematics IV

Prerequisite Mathematics lllA and one of Mmhcmatics IllB, Statistics lll, or Computer Science llt

Computer Science l[V

Prerequisites Computer Science 1lI and one of Mathematics IIlA or Mathematics lIlB or Statistics III.

Statistics I V

Prerequisites Statistics III and a Part III subject in either Mathematics or Computer Science

Mathematics IV/Ecollomics IV

Prerequisites Mathematics IIIA & Economics mc

Mathematics IV /Gcoiogy IV

Prerequisites Mathematics lIrA & Geology mc

Mathematics XV/Physics IV

Prerequisites Mathematics IlIA & Physics JIlA

IV Prerequisites Mathematics InA & Psychology me.

ImGULATWNS GOVERNING THE DXPLOMA IN COIVIPUTER SCn<:NCE

These Regulations prescribe the requirelll,ents for the Diploma in Computer Science of the University of Newcaslle and are made in acconlallce with the powers vested in the Councilulliler By-Law 5.2.1.

JI)cfillitioNHl

In these Regulatiolls, nlliess the context or subject matter other wise indicates or requires:

"course" means the programme of stndies presclihed from time to lime to qualify a candidate for the Diploma;

"J)ean" means thc Dean of the fiaculty;

llkKllll'h,w:,lt" meallS the Department offering a pmliculgr ane! incllldes any other body so doing;

"niploma" means the Diploma in Computer Science;

"FIl!:llity" means the Faculty of Mathematics;

"Faellity Hoard" means the FacuIty Board of the FaCility;

"Sehc!luil~" means the Schedule of Subjects to these Regulatiolls;

means allY pail of the course for which a result recorded.

Admission to C:lIIdi{latlln~

3. (1) To be eligible f'Or admission to candidatllre for the Diploma, an applicant shaH

(a) have satisfied the requirements for admission to a degree of the University of Ncwcastle or to a degree of another University approved [or this puqlOse by the Faculty Board; or

(b) have slIch other qnalifications approved by the Faculty Board for the purpose of admission to calldidature.

(7,) An application for admission to candidalure shill! be considered by the Faculty Board, which may alJllrove Of reject any application.

4. The Faculty Board may require a candidate to complete work anel/or examinations additional to the programII1e referred to in Regulation 6 if ill its opinioll the candidate has lIot reached the assumed standard of attainment Oil which the content of any of thc subjects for the Diploma is based.

S. Enl'olment

(1) In any year a cilndidate shall emol only in those subjects approved 011 the recommcndation of the Head of the Departmcnt of Computer Science by the Dean or the Dean's nomi!l(~e.

(2) A candidate may not enrol ill IIny year in allY combination of subjects which is incompatible with ll1e requirements of the timetable for that year.

43

(3) A candidate will not be permitted to enrol in a subject the content of which in thc opinion of the Faculty Board is substantially equivalent to work previously counted towards another degree or diploma, except to such extent as the Faculty Board may permit.

6. Qualil'ication for Admission to the Diploma

(1) To qualify for the award of the Diploma a candidate shall

(a) pass the Preliminary Subject referred to in the Schedule;

(b) pass subjects from those listed in the Schedule, or subjects deemed by the Faculty Board to be their equivalent, with an aggregate unit value of at least twenty~two; and

(c) complete a project prescribed by the Head of the Department of Computer Science to the satisfaction of that Head.

(2) The subjects presented for the Diploma shall includc not fewer than fou!' subjects selected ii'om those listed in the Schedule with a unit value of three.

7. SUbject

(1) To complete a subject a candidate shall attend such lectures, tutorials, scminar's, laboratory classes and field work and submit such written or other work as the Department shall require.

(2) To pass a subject a candidate shall complete it and pass such examinations as the Faculty Board shall require.

8. Standing

(1) The Faculty Board may grant standing in the course to a candidate, on such conditions as it may determine, in recognition of work completed in this University or another institution.

(2) Except for the Preliminary Subject, a candidatc may not be granted standing for work whieh has already counted towards a degree to which that candidate has been admitted or is eligible for admission.

(3) Standing granted to a candidate shall not exceed an aggregate unit value of twelve.

(4) The Dean shall determine the unit value of the work for which standing is granted.

9. Prerequisites and Corequisites

(1) The Faculty Board, on the recommendation of the Hc<\d of the Department, may prescribe prerequisites and/or corequisites for any subject comprising the course.

(2) Except with the approval of the Dean granted after consideling any recommcndation made by the Head of the Department, no candidate may enrol in a subject unless that candidate has passed any subjects prescribed as its prerequisites at any grade which may be specified and has already passed or concurrently enrols in or is already enrolled in any subjects prescribed as its corequisites.

44

(3) A candidate obtaining a Terminating Pass in a subject shall be deemed not to have passed that subject for prerequisitc purposes.

10. Withdrawal

(1) A candidate may withdraw from a subject or the course only by informing the Secretary to the University in writing and the withdrawal shall take effect from the date of receipt of such notification.

(2) A candidate who withdraws from a subject after the relevant datc shall be decmed to have failed the subject save that, after consulting with the Head of the Department, the Dean may grant permission for withdrawal without penalty. The relevant date shall be:

(a) in the case of allY subject offered ill the first half of the academic year .. the last Monday in First Term;

(b) in the case of any subject offered in the second half of the academic year - the fourth Monday in Third Term;

(c) in the case of any other subject - the last Monday in Secone! Term.

11. !Results

The result obtained by a succcssful candidate in a subject shall be:

Terminating Pass, Ungraded Pass, Pass, Credit, Distinction, or High Distinction.

12. Award of the Diploma

The Diploma shall be awarded in two grades, namely: Diploma in Computer Science with Merit and Diploma in Computer Science.

13. Time !Requirements

(1) Except with the special permission of the Faculty Board:

(a) a full-time candidate shall complcte the requirements for the Diploma in not less than one and not more than three calendar years from the commencement of tile course;

(b) a part-time candidate shall complete the requirements for the Diploma in not less than two and not more than five calendar years from the commencement of the coursc.

(2) A candidate who has been granted standing in accordance with Regulation 8 of these Regulations shall be deemed to have commenced the course from a date to be detelmined by the Dean.

14. nelaxing Provision

In order to provide for exceptional circulTlstances arising in a particular case the Senate on the recommendation of the Faculty Board may relax any provision of thcse Regulations.

SCHEDULE OF SUBJECTS

Diploma ill Computer Science

Preliminary SUbject

Introduction to Programming (lP)

Prerequisites

Sul~iects with a Unit Value of Two

Data Structures and Algorithms (DS&A)

Commercial Programming (CP) Assembly Language (AL)

Comparative Programming Languages (CPL)

Systems Analysis (SA)

Systems Design (SD)

Microcomputers in Business (MB) Numerical Analysis (NA) Linc<u' Algebra (LA)

Discrete Mathematics (DM)

Random Processes and Simulation (RP)

Switching Theory and Logical Design (ST&LD)

Microprocessor Systems and Applications (MS&A)

II' IP

II' IP

IP

IP,SA

Mathematics I Mathematics I Mathematics I Mathematics I

Mathematics I

IP,AL&OS

Subjects with a Ullit Value

Software Engineering (SE) Operating Systcms (OS) Database Design (DD)

of Three

Compiler Design (CD)

Artificial Intelligence Programming Techniques (AWl')

Computer Graphics (CG)

Computer Networks (CN) Theory of Computation (TC)

IP,DS&A,AL&OS IP,DS&A,AL&OS

IP,DS&A,A.L&OS, CP

IP,DS&A,AL&OS, CPL

11'

IP,DS&A,AL&OS, NA,LA

IP,DS&A,AL&OS IP,DM

UEGULATI01"lS GOVERNING THE DIPLOMA IN MATHEMATICAL STUDIES

I. These Regulations prescribe the Requirements for the Diploma in Mathematical Studies of the University of Newcastle and are made iu accordance with the powers vestee! in the Council under By-law 5.2.1.

2. In these Regulations unless the context or subjcct matter otJICrwise indicates or rcquires:

"Dean" lTleallS the Dcan of the Faculty of Mathematics;

"Diploma" means the Diploma in Mathematical Studies;

"Faculty Board" means the Faculty Board of the Faculty of Mathematics;

"SUbject" means any part of a candidate's programme of studics [or which a result may be recorded.

3. The Diploma shall be awarded in two gradcs, Diploma in Mathematical Studies with Merit or Diploma in Mathematical Studies.

II. An applicant for admission to candidature for the Diploma shall:

(3) have satisfied all the Requirements for admission to g

degree of the University of Newcastle, or to a of any other tertiary institution approved for this purpose by the Faculty Board; or

(b) in exceptional circmllstances have (Jther qualifications approved for this purpose by the Faculty Board.

5. The Faculty Board will appoint an adviser for each candidate.

6.(1) To qualify for the Diploma, a candidate shall, ill not less than 2 years of part-time study or 1 year of full·· lime study, pass a programme of subjects comprisin[f 12 units of advanced work6 .)

(2) The programme shall consist of subjects offered by the Dep3Jtrnent of Mathematics, Statistics and Computer Science or another Department offering courses with considerable mathematical content

(3) The Faculty BoaI'd may approve a Project for inclusion in the candidate's programme, such a project sh!!.lI have a unit value of 2.

'I. A candidate may be granted standing by the Faculty Board for work completed in this University or in another tertiary institution approved for this purpose by the Faculty Board. Snell standing shall not be given for more than half of the unit total of the programme nor for work 011 the basis of which a degree or diploma has already been conferred or awarded or approved [or conferment or award,

8.(1) To complete a subject a candidate shall attend such lectures, tutorials, seminars and laboratory classes and submit such written work as the Faculty Board may require.

(2) To pass a subject a candidate shall complete it and pass such examinations as the lCiaculty Board may require.

9.(1) A candidate may withdraw from enrolment in a subject or the Diploma only by notifying the Secretary to' the University in writing and the withdrawal shall take effect from thc date of receipt of such notification.

(2) A candidate who withdraws from any subject aflCr the relevant date shall be deemed to have failed in that subject unless granted permission by the Dean to withdraw without penalty. The relevant date shall be:

(a) in the case of any subjeet offered in the fh'st half of the academic year" the last Monday of First Term;

(b) in the case of any subject offered in the second half of the academic year ., the fourth Monday in Third Term;

(c) in the case of any other subject· the last Monday of Second Term.

6 No lUore than 3 units at the Part II level may be counted.

45

10. In order to provide for exceptional circumstances arising ill particular cases, the Senate, Oil the recommendation of the .Faculty Board, may relax ally provision of these Regulations.

I1EGUIAATWN§ GOV}.mNING THl:<: rHPILOMA IN MEDXCAL §TATX§TIC§

1. These Regulatiolls prescribc the requirements for the Diploma ill Medical Statistics of the University of Newcastle and are made in accordance with the powers vested in the Council under By··law 5.2.!.

2. In these ReBulations, unless the context or subject matter otherwise indicates or requires:

"tlw 13mili'Il" means the Board of Studies in Medical Statistics;

"tllc Bliillloml.l" means the Diploma in Medical Statistics.

3. The Diploma shalllA,: awarded in two grades, namely: Diploma in Medical Statistics with Merit Diploma in Medical Statistics.

4. An alyplicam for admission to candidature for the diploma shall: (a) have satisfied aU the rcquirements for admission to a

degree of the University of Newcastle, or to a deBtee of any other terti3ry institution a:pproved for this pmpose by the Hoard, Of

(b) have other qmllificatiollS approved for this pmvose by the Senate on the recommendation of the Board.

5.(1) NOlwithsIlmding the provisions of Regulation 4(a), a studmlt with not mom thall the equivalent of one ye,,]f of f!!II.,lime studies remaining to qualify for a degree may be permitted to enrol as a parHime student for the Diploma with such programme as the Board may

Defore making any decision the Board shall the agreement of the Heads of the Departments

offering the subjects in which the student proposes to enrol and of dIe Dean of the Faculty responsible for the degree course in which the student is enrolled.

(2) In 110 case will a Diploma be awarded until the requirements for the degree have been satisfied.

6. The Board may require H candidate to complete work and/of examinations additional to the programme referred to in Regulation 7 if, in its opinion, he has not reached the asslImed standard of al.lainment 011 which the content of any of the subjects for the diploma is base.!.

7.(1) To qualify for the Diploma a candidate shall, in not less ll1an olle year and not more than two years of full" time study or in no! less than two years and not more than five years of parHime study, complete to the satisfaction of the Board a programme approved by the Board totalling lIot less than ten units.

(2) The pmgramme sllllJI consist of at lell.st two units fmm Schedule A (Epidemiology)

at least four ullits from Schedule B (Statistics) at least one unit fmm Schedule C (Computing)

at lelJ.st Oile unit from Schedule D (Project) (3) A Cllndidate shall not enrol in a subject the content of

which, in t.he opinion of the Board, is substantially

cquivalellt to work already completed towards another degree or diploma. In slIch a case the Board shall prescribe an alternative subject to ally listcd in the Schedule.

8. A candidate may bc granted standing by (he Board [or work completed in this University, or in another tertiary institution approved for this purpose by the Board. Such standinB shall not be Biven for morc than half the unit total of the programmc nor for work on the basis of which a degree or diploma has already hecn conferrcd or awarded or approved [or confelment or award.

9.(1) To complete a subjcct a candidatc shall attend snch lectnres, tutorials, seminars and laboratory classes, and submit sllch written and other work as the Bom'd may {C(luire.

(2) 'fo pass a subjcct, a candidate shall complete it and pass snch examinations as the Board m.ay require.

(3) The result of a successful candidatc in a subject shall be: Ungraded Pass, Pass, Credit, DistinctiOIl or High Distinctioll.

10.(1) A candidate may withdraw from a subject or the course ouly by notifying the Secretary to thc Univcrsity in writing and the withdrawal shall take effect from the date or receipt of such notification.

(2) A candidate who withdraws from any subject after the rclevant dale shall be deemed to have failed in that subject unless granted permissioll by the Chairman of the Board to withdraw without penalty. Thc relevant date shall be:

(a) in the case of any subject offcrcd in thc first half of the academic year - the last Monday in first term;

(b) in the case of any subject offcred in the second half of the academic year - the founh Monday in third term;

(c) in the case of any other subject - the last Monday in second tcrm.

11. In order to provide for exccptioual circumstances arising in particular cases, thc Senate, Oll thc recommendation of the Board, may relax any provision of these Regulations.

SCHEDULE OF SUBJECTS

Diploma in Medical Statistics

Topic Units

Schedulc A (Epidemiology)

Epidemiologic Methods

Study Design Health Care Evalnation

Behavioural Change Assessing Health Problems Population Reseal"ch Seminar

0.5 0.5 0.5 0.5

Schedule B (Statistics)

Biostatistics r7 Biostatistics 1l Applied Statistics'" (AS) Probability and Statistics (PS) Random Processes and Simulation (RP)

Survey Sampling Methods (SS) Demography ami Survival Analysis

Dcsign and Analysis of Experimcnts Generalised Line,u' Modcls

Analysis ofCalcgorical Data

Statistical Consulting

Statistkal Inference Timc Series Analysis

Schedule C (Computing)

lntroduClion to PWBramminB (IP) Data Structures and Algorithms (DS&A) Comparative Programmiug Lallguagcs (CPL)

Systems Analysis (SA) Systems Design (SD)

Schedule D <0 Project worth at least one nnit.

/,

REGULATIONS GOVERNING MASTERS DEGREES Part I General

] .(1) These Regulations prescribe the conditions and requirements relating to the degrees of Master of Architecture, Master of Arts, Master of Commerce, Master of Computcr Science, Master of ComputinB, Master of Education, Master of Educational Studies, Master of Engineering, Master of Enginecring Scicnce, Master of Letters, Master of Mathematics, Master of Medical Sciencc, Mastcr of Psychology (Clinical), Master of Psychology (Educational), Master of Science, Master of Scicntific Studies, Mastcr of Special Education and Master of Surveying.

(?) In these Regulations and the Schedules (hereto, unless the context or subject matter othcrwise indicates Of

requires:

"FaCility Board" means the Faculty Boarel of the Faculty responsible for the coursc in which a person is cnrolled or is proposing to enrol;

"programme" means the programme of rescarch and study prescribed in the Schedule;

"Schedule" means the Schedule of these Regulations pertaining to the course in which a person is .enrolled or is proposing to enrol; and

"thesis" mcans any thesis Of dissertation submitted by a cm1didate.

7 At most one of Biostatistics I and Applied Statistics can be counted.

(3) These Regulations shall not apply to degrees conferred honoris causa.

(4) A deBTee of Master shall be confcrred in OIle grade ouly.

2. An application for admission to candidature for a degree of Mastcr shall be made on the prescribed form aurllotlged with the Secretary to the University by the date.

3.(1) To be eligible for admission to candidature an applicant shall:

(a) (i) have satisfied the requirements for admissioll to a degrec of Bachelor in the University of Newcastle as spccified ill the Schedule; or

(ii) have satisfied the requirements for admissioll to a degree or equivalent qualificatioil, approved for the purpose by the Faculty Board, in another ter,i8fY institntion; or

(iii) have such other qualifications and experience as may be approved by the Senate 911 the recommendation of the Faculty Board or otherwise liS may he specified in the Schedule; mid

(b) have satisfied snch othcr requirements as may be specified in the Schedule.

(?,) Unless otherwise specified in the Schedule, applications for admission to candidature shall he considered by the Faculty Hoard which may approve or reject any applicatjon.

(3) An applicant shall not be admitted to candidature unlcss adequate supervision and facilities are available. Whether these 81"e available shall be determined by the Faculty Board unless the Schedule otherwise provides.

4. To qualify for admission to a degree of Master a candidate shall enrol and satisfy the requirements of these regulations inclndinB the Schedule.

5. The programmc shall be canied out-

(a) under the guidance of a supervisor or supervisors either appointcd by the Faculty Board or as otherwise prescribed in the Schedule; or

(b) as the Faculty Board may othcrwise dctermiuc.

6. Upon request by a candidate the FacnIty BO;.lxd may grmlt leave of absence from the course. Such leave shall not he taken into account ill calculating the period for thc programme preseribC{i in the Schedulc.

7.(1) A candidate may withdraw from a subject or course only by infOlming the Secretary to the University in writing and such withdrawal shall take effect from the date of receipt of such notificatioll.

(2) A candidate who withdraws from any subject after the relevant date shall be deemed to have failed in that subject unless granted permission by the Dean to withdraw withont penalty.

The relevant date shall he:

(a) in the case of a subject offered in the first half of the academic year .. the last Monday in first term;

47

(b) in the case of a subject offered in the second half of the academic year ~ the fourth Monday in third term;

(c) in the case of any other subject - the last Monday ill second tenn.

8.(1) If the Faculty B03l"d is of the opinion that the c3Jldidate is not making satisfactory progress towards the degree then it may terminate the candidature or place such conditions on its continuation as it deems fit.

(2) For the purpose of assessing a candidate's progress, thc Faculty Board may require any candidate to submit a repolt or reports Oil his progress.

(3) A candidate against whom a decision of the Faculty Board has been made nnder Regulation 8(1) of these Regulations may request that the Faculty Board cause his case to be reviewed. Such reqnest shall be made to the Dean of the Faculty within seven days from the date of posting to the candidate thc advice of the Faculty Board's decision or snch furlher period as the Dean may accept.

(4) A candidate may appeal to the Vice~Chancel1or against allY decision made following the review under Regulation 8(3) of these Regulations.

9. In exceptional circumstances arising ill a particnlar case, the Senate, Oil the recommendation of the Paculty Board, may relax any provision of these Regulations.

It>art ][X 18Kamiuatioll IIml Results

10. The Examination Regulations approved from time to time by the Council shall apply to all examinations with respect to a degree of Master with the exception of the examination of a thesis which shall be conducted in accordance with I1w provisions of Regulations 12 to 16 inclusive of these Regulations.

11. The Faculty Board shall consider the results in subjects, the reports of examiners and any other recommendafjons prescribC'.{1 in til? Schedule and shall decide:

(a) to recommend to the Council that the candidate be admitted to the degree; or

(b) ill a case where a thesis has been submitted, to permit the candidate to resubmit all amended thesis within twelve months of the date on which the c31ldidate is advised of tIle result of the first examination or within slich longer period of time as the Faculty Board may prescribe; or

(c) to requil'e the caudidate to undertake such further oral, written or practical examinations as the FaCUlty BO(lJ'(j may prescribe; or

(cO not to recommend tlla! the candidate he admitted to the degree, in which case the candidature shall be terminated.

n'!lJi't UK ~~, P!,(l'I'isiow; Relating to Theses

12.(1) The subject of a thesis shall he approved by the Faculty Board on the recommendation of the Head of the Department in which the candidate is eanying out his research.

48

(2) The thesis shall not contain as its main content any work or material which has previously been submitted by the candidate for a degree in any tertiary institlllion unless the Faculty Board otherwise permits.

13. The candidate shall give to the Secretary to the University three months' written notice of the elate he expects to submit a thesis and slIch notice shall be accompanied by any prescribed fee 8

14.(1) The candidate shall comply with the foUowillt; proVISIons concernmg the presentation of a thesis:

(a) the thesis shall contain an abstract of approximately 200 words describing its content;

(b) the tllCsis shall be typed anc! bound in a lllanner prescribed by the University;

(c) three copies of the thesis shall be submitted together wilh:

(i) a certificate signed by the candidate that the main content of the thesis has not been submitted by the candidate for a degree of any other tertiary institution; and

(ii) a certificate signed by the supervisor indicating whefher the candidate has completed the programme and whether the thesis is of sufficient ~rademic merit to warrant examination; and

(iii) ;f the candidate so desires, any documents or publishf'rj work of the candidate whether bearing on the subject of the thesis or not.

(2) The Faculty Boaru shall determine the course of action to be taken should the certificate of the snpervisor indicate that in the opinion of the supervisor the thesis is not of sufficient academic merit to warrant examination.

15. The University shall be entitled to retain the submitted copies of the thesis, accompanying docnments and published work. The University shall be free to allow the thesis to be consulted or borrowed and, subject to the provisions of the Copyright Act, 1968 (Com), may issue it in whole or any pm"t in photocopy or microfilm or other copying medium.

16.(1) For each candidate two examiners, at least one of whom shall be an external examiner (being it person who is not a member of the staff of the University) shall be appointed either by the Faculty Board or oUlelwise as prescribed in the Schedule.

(2) If the examiners' reports arc sllch that the Faculty Board is unable to make any decision pursuant to regulation 11 of these Regulations, a third examiner shall be appointed either by the FaCUlty Board Of

oUlCfwise as prescribed in the Schedule.

SCHEDULE 1'7- MASTEl~ OF COMPUTER SCIENCE

1. The Faculty of Mathematics shall be responsible for the course leading to the degree of Master of Computer Science.

8 At present there is no fee payable.

2. To bc eligible for admission to c,mdidature an applicant

shall: (a) have satisfied all the reqUirements for admission to thc

degree of Bachelor of ComputcrSclCnce wIth honours class I or class nof the Umverslty of Newcastle or to an hononrs degree, approved for this purpose by the Faculty Board, of the University of Newcastle or any other university; or

(b)

(c)

have satisfiecI all the requirements for admission to a degree of the University of Newcastle or to a degree,. approved for this pmpose by the Faculty Hoard, 01 another tertiary institution and have completed such work and passed snch cxaminations as the Faculty Board may have determined and have achieved a standard at least equivalent to that required for admission to a degree of bachclor with sccond class

honours; or

in exceptional cases produce evidence of possessing such academic or professional qualifications as may be approved by the Faculty Board on the recommendation of the Head of the Department of Com pUler Science.

3. To qualify fm admission to the degree a candidate shall complr,W to the satisfactioll of the Faculty Board a programme consisting of:

(a) SlIch work and examinations as may be prescribed by the Faculty B03J'c!; and

(b) a thesis embodying the results of an original investigation or design.

4. Except with the permission of the Faculty Board, which shall be given only in special circumstances, a candidate

shall

(a) conduct the major proportion of the investigation or design work in tbe University; and

(b) take part in research seminars within the Department of Computer Science.

S. Except with the special permission of the Faculty Board:

(a) a full time candidate shall complete the programme in not less than two and IlOt more than three calendar yem"s from its commencement;

(b) a part lime candidate shall complet(~ the programmc in IlOt Icss than three and not more than five calendar years from its commencement.

SCHEDULE 18 - MASTEl~ (W COMPUTING

I. The Faculty of Mathematics shall be respollsible for the course leading to the degree of Master of Computing.

/<. To be eligible for admission to candidature an applicant shall:

(a) (i) have satisfied all the requirements for admission to the degree of Bachelor of Computer Science of the University of Newcastle or to any other degree approved for this pmpose by the Faculty Board; or

(ii) in exceptional cases produce evidence of possessing snch academic or professional qualificatiolls as may be approvecl by the Faculty Board 011 the recolllillendation of the Head of the Depanment of Computer Science; and

(b) complete such additional work and pass such examinations as the Facnlty Board may cletfcllnine.

3. To qualify for admission to the degree a candidate shall complete to the satisfaction of the Faculty Hoard a programme consisting of

(a) the subject Compnter Science IV M, alld

(b) a project prescdbed by, and cmried out under the direction of, the Heae! of the Dcpmtment. of Computer Science.

4. The Faculty Hoard may grant standing to a candidate Oil snch conditions as it may determine in respect of work undert'lken by the candidate for an uIlcompleted qualification. Stallding shall not be granted for more than half the p!"Ogl'amrne.

5. Except with the permission of the Faculty Hoare!:

(a) a full time calldidate shall compktc the programme ill not less than two and not more than three calendar years from its commencement;

(b) a pari time candidate shall complete the programme in not less than three aud not more than five calenrlar YCi1rs f!"Om its commencement.

SCI-IEDUUj 8 "" - IV,ASTEX{ OF MATHEMATICS

t. The Faculty of Mathematics shall be xcspOlIsible for the course leading to tIle degree of Master of Mathematics.

2. To be eligible for admission to candidature an applicant

shall:

(a) have satisfied all the requirements for admission to a degree of Bachelor of the University of Newcastle with hOllOl!fS in the area of study in which he proposes to carry out. his research or to an honours degree, approved for this purpose by the Faculty Hoard, of another University; or

(b) have satisfied all the requirements for admissioll to a degree of the University of Newcastle or to a degree, approved for this purpose by lhc Faculty Board, of :lIlothcr teltiary institution and have completed snch work and sat for snch examinations as the Faculty Board may have dctennineci and have achieved a standard at least equivalent. 1.0 that required for admission to a degree of Bachelor wit.h second class honours ill an appropriate subject; or

(c) in exceptional cases pmduce evidence of possessing slIch academic or professional qualificatiolls as may be approved by thc Faculty Homd.

3. To qualify for admission to the degree a candidale shall complete to the satisfaction of the Faculty Board a programme consisting of:

(a) such examinations and other such wmk as may be described by the Faculty Board; and

(b) a thesis embodying the results of an original investigation or design.

(f. The programme shall be completed ill not less than two years except that, in the case of a candidate who has completed the requirements for a degree of Bachelor with honours or for a qualification deemed by the Facnlty Board

49

to be equivalent or who has had previolls research experience, the Faculty Hoard may reduce this period by lip to one year.

5. A part·time candidate shall, except with the permission of the Faculty HOHnl, which shall be given ollly in special circurnstallces:

(a) comluet the major proportion of the research or design work ill the University; and

(b) take pan in research seminars witllin the Department ill which he is working.

6. AllY third examiner shall be an external examiner.

REGULATIONS GOVEl~NING 'fHE OEGRKE 017 MASTEU OF MElnCAL STATISTICS

1. These Regulations prescribe the requirements for the degree of Master of Medical Statistics and arc made in accordance with the powers vcsted in the Council nllder ny­Law 5.2.1.

2. )Jcfinitioml

Iii these Regulations, unless the context or subject matter otherwise indicates or leqllires:

"the nOlll!'d" means the Board of Stnclies in MedicRI Statistics:

"tlie Cliainn:m" meallS the Chairman of the Board of Studies in MedicRl S!Rt.istics;

"tile degi'ee" means the degree of Master of Medical Stafistics.

3. GnMliug of negree

The degree shall be eonferred in one g.mde only.

Admi§siml

0. An application for admission 10 candidature for thc degree shall be made Oil the prescribed form and lodged with the Secretary to the University by the preseribc.d date.

S. 'ro be eligible for admission to candidature, an applicant shall

(a) (i) have slltisfied, at a level approved by thc Board, the Reqnirements for admission to the degree of Bachelor of the University of Newcastle or other university or teltiary institut.ion approved by the Hoard;

(it) in exceptional circumstances produce evidence of possessing such academic and professional qnalifications as may be approved by the Board; and

(b) complete such work and pass sneh examinations as the Bellml may determine.

6. Applications for admission to candidature shall be considered by the BOlJxd which may approve or reject any application.

i'OJr the

7. To qualify for admission to the degree a candidate shall have satisfied allY condition imposed on admission to candid»ll1xe under Regulation 5(b) and shall complete to the

50

satisfaction of the Board a programme approved by the Bomc! comprising:

(a) subjects totnlling ] 0 nnits selectee! from snell of those listed in the Schedule of Subjects approved by the Board as are available from t.ime to time, provided Ihat subjects totalling at least four nnits arc to be selected from the Schedule B subjects marked with an asterisk; and

(b) a thesis, comprising half the course, emboclying the resulls of an original invcstigation.

8. I\. candidate shall not enrol in a subject the content of which, in the opinion of the Board, is substantially equivalent to work already completed towards another degree or diploma, The Home! shall prescribe an alternative subject to any subject which a c,mdiclatc might otherwise have to selecl.

9.(1) To complete a subject a candidate shall attend sllch !cctures, tutorials, seminars anel submit such wriucn and other work as the body offering that subject may require.

(2) To pass a subject a candidate shall complete it to rhe satisfaction of the Board ami pass such examination as the Board shall rcquire.

10. Standing

A candidate may bc grantcd standing on such conditions as the Board may detcrmine in respect. of work completed tow3J"ds the Diploma in Medical Statistics or in rcspect of such other work as may be deemed appropriate by thc Board.

1J1.. Progress

(1) If the Board is of the opiniou that the candidate is not making satisfactory progress towards the degrec then it may terminate the candidature or place such conditions OIl its continuation as it deems fit.

(2) A candidate against whom a decision of the Board has been made undcr Regulation 11(1) of these Regulations may request that the Board cause the case t.o be reviewed. Such request shall be made to the Chainmm within seveu days from thc dale of posting to the candidate the advice of the Board's decision or such fmther period as the Chairman may acccpt.

(3) A candidate may appeal to the Vice-Chancellor against ally decision made following the review under Regulation 11(2) of tllese RegUlations.

U. Dutation

The programme shall be completed in not Jess than two years and, except with the permission of the Board, not IlJore than five years.

13. Leave of Absence

Upon request by a candidate, the Board may grant leave of absence from the course. Such leave shall not be taken iuto account in calculating the period prescribed in Regulatiou 12 of these Regulations.

(l) A candidate may withdraw from a subject or .Ihe course ollly by informing the Secretary to the Ulllversity III

wriling and such withdrawill shall take effect from the date of receipt of snch notificatioll.

(2) A candidate who withdraws from ally subject after the relevant date shall be deemed to have failed in that subject unless granted permission by the Chairman to withdraw without penalty.

The relevant date shall bc:

(a) in the case of a subject offered ill the first half of the academic year - the last Monday III first tenn;

(b) in the case of a subject offered in the second half of the academic year - thc fourth Monday III tbId tenn;

(c) in the case of any other subject the last Monday in second term.

15. Relaxing Provision In exceptional circnmstances arising in a particular case, the Senate, on the recommendation of the Board, may relax any provision of Ihese Regulations.

SCHEDULE OF SUBJECTS Master of Medical Statistics

Subject Units

Group A Design and Analysis of Experimcnl~ Epidemiological Methods

Study Design Health Care Evaluation

Behavioural Change I\.ssessing Health Problems Population Rese,m;h Seminar

Biostatistics fI Biostatistics II Applied Statistics'" (AS) Prob<tbility and Statistics (PS) Random Proccss and Simulation (RP) Introduction to Programming (IP) Data Structnres and Algorithms (DS&A) Comparative Programming Languages (CPL)

Systems Analysis (SA)

Systems Design (SO) Project worth at least I unit.

1 0.5 0.5

0.5 0.5

1 2

7 At most one of Biostatistics I and Applied Statistics can be

counted.

GroUIl H Survey Sampling Methods (SS) Demography and Survivall\.nalysis

Generalised Linear Models Analysis of Categorical Data

Statistical Consulting

Statistical Inference Time Series Analysis

51

NOTE ON SU13JEC'll' AN)) TOPIC DESCRH'nON§

The subject and topic outlines and reading lists which follow are set Ollt in a standard format to facilitate easy reference. An explanation is given below of some of the technical tei IllS used in this Handbook.

me subjects which mllst bc passed before a enrols in a particular snbject. The 0 n 1 y

prerequisites noted for topics me any topics or subjects which must be taken before enrolling in the particular topic. To enrol in any subject which the topic may be part of, the prerequisites for that subject must still be satisfied,

Where a prerequisite is marked as advisory, lectures will be givcn on the assumption that the subject or topic has been completed as imlicaU'",L

COl'equisites for subjects arc those which the candidate must pass before ellwlmellt or be wking rOJlcl](rently,

Corequisitcs for topics are those which the candidate mnst take before elll'olment Ot' be taking concurrently,

E:KIHllinatiol1 Under examination regulations "examination" includes mid-year examinations, assignments, tests or any other work by which the final grade of a candidate in a subject is assessed, Some attempt has been made to indicate for each subj(;{;t how assessment is determined. See particularly the general statement in the Department of Mathematics section headed "Progressive Assessment" refening to Mathematics subjects,

TC:Kts are essential books recommended for purchase,

R!;fel"clilIccs are books relevant to the subject or topic which, however, need not be purchased,

52

The following academic staff have been appointed course coordinators and should be consulted in case of dilTiculty:

Computer Science IV/IVM Prof. j,L.Keedy Research degrees Prof. j,L.Kcedy

Diploma in Computer Science Simon

Further information about computer science courses appears in the section Notes on Degrees and Diplomas in Section Two, Students enrolling in Computer Science subjects do not formally enrol in their constituent topics, However, Computer Science IV and IVM students, and students who as part of any other Computer Science subject wish to take topics other than exactly as described in the relevant subject description, must first obtain permission from the Ilead of the Department of Computer Sciencc,

PART XV COMPUTER SCIENCE SUBJECTS 63,,100 COMPlJTllm SCIENCE XV

This subject is the one~year ful1~lime or two-year pan-time honolll's subject in the BCompSc(Hons) and BMath(Hons) degrees, A student desiring admission to this subject should apply in writing to the Head of Department before 20th December of the preceding year.

Prerequisites Computer Science III

Hours Approx 162 lecture hours plus a 400 hour project.

Examination Six 2~hO\ll' papers or equivalent assessment. A thesis relating to the project undertaken,

Content

A selection of six Part IV topics, chosen from the Part IV Computer Science Topics listed below, (In exceptional circllmstances the Head of Department may approve other topics,) Each topic is worth 10% of the final assessment.

Students are also required to complete a substantial practical project (involving approximately 400 hours of work) prescribed by the Head of Department. The results of this project, worth 40% of the final assessment, must be embodied in a thesis, Work on the project normally starts early in Febru3J'Y,

The topics for Computer Science IV (Honours) are listed below, Their descriptions are the same as the corresponding subject descriptions for the Diploma in Computer Science, Students must advise the Head of the Department of Computer Science at the beginning of the year which six topics have been selected, Information about projects can be obtained from file Computer Science Office at the beginning of the academic year.

Computer Number

Topic Dip,Comp,Se, Regulations

680101 Advanced Operating Systems Old 680103 Artificial Intelligence Old 680110 Concurrency, Complexity and VLSI Old 680113 FOImal Semantics of Programming

Languages Old 680118 Software··Oriented Computer Architecture Old 680108 Computer Graphics Revised 680117 Software Engineering Revised

6!Jt}101 COMPUTER SCIENCE XVM

This subject is available only to students cnrollee! in the coursework Master of Computing degree, A student desiring admission to this subject should apply in writing to the Head of Department before ),Ot11 December of the preceding year.

Prerequisites Computer Science II!

!fours Approx no lecture hours plus a 1000 hour project.

Examination Ten 2·,hollt' papers or equivalent assessment. A thesis relating to the project unclerUlken,

Content

A selection of tell topics, normally consisting of at least six topics chosen from the list of Pm t IV computer science topics together with additional topics chosen from Part III computer science topics, (In exceptional circumstances the Head of Department may approve other topics,) Each topic is worth 5 % of the final assessment.

Students are also rcqnired to complete a major research project (involving approximately 1000 hours of work) prescribed by the Head of Department. The results of this project, worth 50% of the final assessment, must be embodied in a thesis, Work on the project normally starts early in Februaty,

Stndents should advise the Head of the Department of Computer Science at the beginning of each year which topics have becn selected, Inform3t.ion about projects can be obtained from the Compnter Science Office at the beginning of file academic year.

DIPLOMA [J"l COMPUTER SCIENCE (11EVISED UEGW .. ATIONS)

The following arc subjects in the (revised) postgraduate Diploma in Computer Science, Some of them may also be available as subjects, topics or units in other courses, The specification of unit value refers to their value in the Diploma in Computer Sciencc.

Subjects taught by the Departments of Computer Science, Management, and Electrical & Computer Engineering are described in this section, Subjects taught by the Departments of Mathematics and Statistics arc described in the Mathematics iUld. Statistics sections of this l-jan(lhook:

S Ilbject

Project

Department

Computer Science

Preliminary Subject

Introduction to Programming

SubJects with a Ullit Value

Computer Science

of Two

Data Structures anri Algorithms Asscmbly Language Comparative Programming Languages

Software Methods and Techniques Commercial Programming

Systems Analysis Systems Design

Microcomputers in Business Numerical Analysis

Computer Science Computer Science Computer Science Computer Science

Management Management Management Management

Matllemalics

Linear Algebra Discrete Mathematics Random Processes am! Simulation Switching Theory and I .ogical Design

Microprocessor Systems and Applications

Mathematics Mathematics Statistics Elee &. Cowp nug Elee & Comp Ellg

Snbjcds with II .JnH V;lllle of 'flin~(;

Software Engineering

Operating Systems Database Design Compiler Design Artificial Intelligence Prowamming Techniques

Computer Graphics Computer Networks Theory of Computation

6110116 PROJECT

CompulCr Science

Computer Science Compnter Science Computer Science Compnter Science

Computer Science Computc!" Scicnce ComplltlOr Sciellce

Projects are allocated from a list available from the Computer Science Office,

61H)U~ INHWI.HJCTXON TO PROGK:tAIVJllVm'YG

l,ec turer D.W ,E, Blatt

Hours ), !cctme hours per week for first semester, pins tutorials and practical work

Examination Assignments and a 2-hour paper

Content

An irtU'Ocillction to stilletmed progmmming and the desig,j of algorithms, The high level language Pascal is covered in some detail. It is llsed to demonstrate the techniques of structured programming and stepwise refinement, good coding style and documentation and methods of program debugging and testing, Topics include the formal definition of high level languages, conditional statements, looping, case statements, the role of goto constructs, pi'Ocedmes, recursion and basic data stmctnrcs,

680112 DATA STRUCTURES AND ALGORrrmVlS

Lecturer B, Bercsford,Smith

Prerequisite Int.:.odnctioll to Programming

IIours ), lecture hours per weck for one semester, plus tutOl ials and practicsJ WOl'k

t:xamination One ?~hou!' paper and assignments

Content

Basic data structures and the design and analysis of algorithms which use these data structures am investigMed. Topics covered will include a review of elementary dat"! sLmctures, an introduction to the concept of an abstract data type and the abstraction and irnplemcntat.ioll of data types selected [wm lists, stacks, queues, trccs, graphs iIIHi sets, Particular attention is given to the problem of SOl ting and some common algorithm design techniqnes snch as divide,· <Ind·· conquer, backtracking and gl'eedy algorithms. Pmctical work will be done in the language Modula·,2,

text To be advised

53

References

Aho, A.V., Hopcroft, J.I:'.. & Ullman, J.D. Dala Stmctures (!nd Algorithms (Addison··Wesley 1(83)

Dahl, 0..1., Dijkstr<1, '·:.W. !Ie Home. C.A.R. Stmcillred Progmmming (Academic Press 19'/?.)

p. f [elman imd R. Veron, Intermediate Problem Solving and Daw Structures (Benjarnin/Clllnmings. 19S6)

Knuth, D.E. The Art of Computer Programming (vol. J, 3) (Addison·Wesley 1968, 19'73)

A. Sale, Modula<J. Discipline and Design (Addison· Wesley . 1(86)

D.F. Stubbs and N.W. Weber, Dow Stmctures with Abstract Data ·types ond Modulo? (Brooks/Cole, 198'1)

Teneballm, A.M. &. Augenstein, MJ. Data 5'tructures using Poscal (Prentice· Hall 198 I)

Welsh, J., Elder, J. !Ie Bustard, D. Sequential Program Structures (Vrentice Hall 198·1)

Wirth, N. Algorithms ,. Data Stmctures ,. Programs (Prentice Hall 19'/6)

N. Wirth, Programming in Modula·/. 7.nd edn (Springer 1(82)

680119 ASSElVmILEIc~ LANGVAGE

Lecturer J. Rosenberll

Prerequisite Introductioll (0 Programminll

flours 2 lecture hours pCI' week for one semester, plus tutorials and practical work

Examination AssillnmCn(S and a 7.·hour paper

Content

This course is divided into two sections. The first section provides an introduction to computcr organisation and assembly language programming. Topics covered include data representation, computer structures, registers, addressing modes, instruction sets, subroutines and the use of stacks.

The second section of the course is an introduction to operating system principles. Topics covered include process management, synchronisation and resource allocation.

Texts

Baase, S. VAX·]] Assembly Language Programming (Prentice· Hall 1(83)

Deitel, H.M. An Introduction to Operating Systems (Addison­Wesley 1(84)

680106 COMPARATIVE PROGRAMMING LANGUAGES

Lecturer Simon

Prerequisite Introduction to Programming

54

Hours 1lectme hours per week for one semester, plus tutorials ,HId practical work

~'xamination Assignments and a 7.·hom paper

Content

This course will examine the principles underlying the comparative study of programming languages. It will consider the essential control anel clata structure components of a programming langu<llle, aml identify instances of those cornponeIlls in various languages. There will also be a brier introduction to the notions and techniqu(~s of program translation via compilers and interpreters.

The prograll1minll languages SNOBOL and C will he introduced dming the comse, to broaden the range or languages available for comparison.

Text

Pratt, T.W. Programming Languages Design ond lmplementalion (Prentice Hall, 7.nd cd. 198,1)

63011'7 SOF'fVVARE ENGINEERING

Lecturer J.L. Keedy

Prerequisite Introduction to Programming, Data StrtlctllrCS & Algorithms, Assembly L.anguage & Operalinll Systems

If ours 2. lecture hours per week (first semester), plus a major assignment (second semester)

Examination One 2·hom paper pIns assignment

Content

After a brief explanation of the nature ancllifc·cycle of large software systems, the software crisis which they have created, and the desirable properties of well·dcsignee! systems, the lectures explore the nature of stable systems in the natural world and in enllineering and consider how humans think about, remember and create complex systems. This leads to a re·evaluation of the principles and techniques used in the conslmction of major software systems, offering new insights into the concepts of modularity and hierarchical structure.

Text

Keedy, J.L.. Software Engineering Principles Notes available from Computer Science Office

References

Sommerville, 1. Sofiwllre Engineering 2nd edn (Addison Wesley 1(85)

680107 COMPILER DESIGN

Lecturer D.W.E. Blatt

Prerequisite Assembly Language and Operating Systems

1/ ours 2 lecture hours per week for one semester plus tutorials and practical work

Examination One 2-hour paper plus assignments

Content

Imroduction to the theory of grammars. Lexical analyscrs, parsing techniques, object code generation. Design of

interpreters. Global and peephole optimisation. Runtime support, error management. Translator writing systems.

The course consists of lectures and <1 project assignlllenl.

TexiS

Aho, A.V., Sethi, R. !Ie Ullman, J.D. Compilers: Principles, rechniqucs ond Fools (Addison·Wesley 1(86)

References

Aho, A.V, & Ullman, J.D. Principles of Compiler Conslruction (Addison .. Wesley 1(77)

Aho, A.V. & Ullman, J.D. The Theory of Parsing, Translation and Compiling (Prentice·HallI9'12)

DOllovan, J.J. Systems Progrwnming (McGrillvHill J9'17.)

Schreiner, A.T. & Friedman, H.G., Jnr. Introduction to Compiler Construction with UNIX (Prentice-Hall 198:;)

Waite, W.M. & Goos, G. Compiler Construction (Springer .. Verlag 1984)

680120 OPERATING SYSTEMS

Lecturer J. Rosenberll

Prerequisite Introduction to Programming

Hours 2 lecture hours per week for one semester, plus tutorials ami practical work

Examination Assignment.s and a 7.-hour paper

Content

This course provides an introduction to operating system s!mcture and design. The course begins with a review of process management and inter-process synchronisation, covered as part of the Assembly Language course. New topics covered include advanced synchronisation techniques, deadlock detection, memory management including virtual storage techniques, multiprocessing and file systems.

The emphasis will be on practical operating systems, and where possible reference will be made to cxisting systems currently in usc.

Texts

Deitel, H.M. An Introduction 10 Operating Systems (Addison .. Wesley 1(84)

6110104 ARTIFICIAL INTELLIGENCE PROGRAMMING TECHNIQVES

Lecturer Simon

Prerequisite Introduction to Prollramming

flours 7. lectw'e hours per week for one semester, plus tntorials and practical work

Examination One 2·hour paper

Content

ArtiCicial Intelligence is an area of Computer Science that has its own characteristic programming requirements. This course will teach programming in the languages LISP anel

Prolog. It will show how the design of these liIngliages was influenced by the nature of the applications for which they were intended, and will show whm place they cnllently hold in the field of AI programmi!lll.

texts

Dratko, I. Prolog P"ogl'amming for Arltficial Intelligence (AcJcJisonWcsley 1(86)

Winston, P.H. & Hom, B.K.P. LISP, 2nd eeln (Addison·Wesley 1981)

References

Clocksin, W.F. & Mellish, C.S. Programming in Prolog, 2nd celn (Springer 1(84)

Siklossy, L. Let's talk USP (Prentice Hall 197))

Wilensky, R. LlSPcraft (Norton, 1(84)

680108 COMPVnm GRAPIHC5

Lecturer D.W.E. Blatt

Prerequisite Introduction to Programming, Data Structures &. Algorithms, Assembly Language &. Operatinll Systems, Linear Alllcbm, Numerical Analysis

flours 2 lecture hours per week for one semester

Examination One 2·hour paper

Content

This course will cover advanced computer llraphics topjcs with relevant matltematical and programming techniques and an overview of graphics hardware dcsillll.

Topics include: Hardware devices for graphics output and input; geometrical transformations; homogeneous coordinates; planar projections; clipping in 2D and 3D; modelling and object hierarchy; standards - GKS, PHIGS; raster algorithms; antialiasing; region fillinll; 3D shape representation; polygon meshes; parametric cubics, Hel"mite, Bezier and B·splines; transforming curves and patches; hidden line removal, hidden surface removal algorithms; shadinll and texture mappinll; diffuse and specuhu' reflection; colour modellinll; llrowth models; fractals and particle systems; animation techniques; advanced graphics hardware architectures; future U'ends in computer graphics.

References

Angell,LO. A Practical Introduction to Computer Graphics (MacMillan 1981)

Brown, M.D. Understanding PflIGS (Template/Mellatek 1985)

Enderle, G., Kansy, Ie & Pfaff, G. Computer Graphics Programming: GKS The Graphics Standard (Springer 1984)

Foley, J.D. & Van Dam, A. Fundamentals of Interactive Computer Graphics (Addison·Wesley 1982)

Freeman, H. Tutorial and Selected Readings in Interactive Computer Graphics (IEEE 1(80)

55

Giloi, W.K. Interactive Computer Graphics (pfenlice Hall 1978)

Gourand, It Computer Display of Curved Surfaces (Garland 19'19)

Harrington, S. Computer Graphics A Programming Approach (McGraw Hill 1983)

Hopgood, ERA. et al. Introduction to the Graphical Kernel System - GKS (Academic Press 1983)

Newman, W.M. & Sproull, R.F. Principles of Interactive Computer Graphics (MacGraw Hill 1973)

Pavlidis, T. Algorithms for Graphics and Image Processing (SpJinger 1982)

Rogers, D.l". & Adams, J.A. Mathematical Elements for Computer Graphics (MacGraw Hill 1976)

Rogers, D.F. Procedural Elements for Computer Graphics (MacGraw Hill 1985)

680121 THEORY OF COMPUTATION

Lecturer B. Beresford-Smith

Prerequisite Introduction to Programming, Discrete Mathematics

Hours 2 lecture hours per week for one semester

Examination One 2-hour paper and assignments

Content

This course gives an introduction to theoretical computer science, covering material in the areas of antomata theory, computability and formal languages. Topics covered will be selected from the following: various types of automata including deterministic, non-detelministic, probabilistic, pushdown, finite, stack, lineal' and time- ~Uld tape··bounded; Turing machines including computability, unsolvability, universality; formal languages and grammars; complexity theory.

Text To be advised

References

Aho A.V., Hopcroft, J.E. and Ullman, J.D. The Design and Analysis of Computer Algorithms (Addison-Wesley 1974)

Cohen, D.LA. Introduction to Computer Theory (John Wiley 1986)

Garey, M.R. and Johnson, D.S. Computers and Intractability (Freeman 1979)

Hoperoft, J.E. Ullman, J.D.

56

Introduction 10 Automata Theory, Languages and Computation (Addison-Wesley 1979)

680111 DATABASE DESIGN

Prerequisite Introduction to Programming, Data Structures & Algorithms, Assembly Langnage

flours 2 leeture hours per week for one semester

Lxamination One 2-holU' paper and assignments

Content

This course provides a basic inu'oductiou to database systems, with particular emphasis on relational database systems. Topics covered will include: basic concepts and terminology, types of systems (hicrarchic, relational, network, inverted list), physical/logical system design, data design, relational theory, relational algebra, relational calculus, data integrity/recovery, sccurity, concurrency, distributed systems. A number of relational database systems will be studied in detail during the conrse.

Text Nil

References

Date, C.J. An Introduction to Database Systems vol 1, 4th eeln (AdelisonWeslcy 1986)

680109 COMPUTER NETWORKS

Prerequisite Introduction to Programming, Data Structures & Algorithms, Assembly Language

Hours 21eclurc hours per week fOf one semester

Examination One 2-hoUf paper aud assignments

Content

This course provides a basic introduction to data communication networks, including both local and wiele area computer networks. Topics include: network access mechanisms, packer-switched and circuit-switched networks, network protocols, flow and congcstion control, routing techniques and quelling mechanisms. A varicty of network llxchitectures will be discussed.

Text Nil

References

Schwartz, M. Telecommunication Networks: Protocols. Modelling and Analysis (Addison-Wesley 1987)

440106 COMMERCIAL rROGRAI\IMING

Lecturer B.Cheek

Prerequisites Introduction to Programming or equivalent

Hours 2 lecture hours per week for first semester

Examination Onc 2-hour paper plus progressive assessment

Content

COBOL as a business data processing and file organisation language. Basic concepts of file handling and maintenance. Sequential, relative and indexed sequcntial file organisations.

Structured techniques, as applied to COBOL programming, are emphasised. Structure diagrams, pseudo-code, programmiug standards, etc.

Students are expected to complete assignmcnts using both COBOL 74 and COBOL 85.

Text,' To be advised

440123 SYSTEMS ANALYSIS

Lecturer B.Cheek

Prerequisites Experience of at least one programming languagc

flours 21ectme hours per week for first semester

Examination One 2-honf paper plus progressive assessment

Content

Structured Analysis and Design Methodology will be introduced. Specific topics include: characteristics of a system, information systems, the role of the systems analyst, the system life·-cyc1e, interview techniques, report writing, documentation techniques (data flow diagrams, data dictionary, flowcharts, etc), cost-benefit aualysis, implementation techniques.

Texts To be advised

440124 SYSTEMS DESIGN

Lecturer B.Check

Prerequisites Systems Analysis

!lours 7. lecture homs per week for second semester

Examination One 2-hour paper pIns progressive assessment

Content

Using techniques introduced in the Systems Analysis course students will work in small groups to design and implement small Oil-line computer based information processing systems. Specific topics include: file design techniques, form design, security controls and backup, system testing ami implementation, the on-goiug maintenance of systems.

Texts To be advised

440131 IVHCIWCOIHPUTERS IN BUSINESS

Lecturer J. Cooper

fI 0 urs 7 Iectme hours per week for first term plus workshops

Examination One 7-hour paper plus progrcssive assessment

Content

The course provides a pract.ical introduction to microcomputers ami their application in the business environment. During the workshop sessions students will gain "hands on" experience using software packages such as electxonic spreadsheets, database management systems and word processors.

Formal lectures will cover topics snch as: microcomputer hardware, microcomputer operating systcms, packaged and cllstom designed software, file concepts. '

Texts To be advised

533902 SWITCHING THEORY AND LOGICAL DESIGN

Prerequisite Mathematics I

Hours 3 hours of lectures, tutorials anc! practical work per week for thc first Scmester

Examination Progressive assessment and final examination

Content

Boolean algebra, combinatorial logic, logic circuits, minimisation techniques, threshold logic. Data representation, biuary aritlunetic, codes, error checking and cOlrecting. Sequential logic, flip«flops, state diagrams, state reduction, races and hazards. Logic subsystems: registers, adders, counters, converters, coders, etc. Basic Hlchitectnre of digital computers.

Lectures will be supplemented by practical assignments on logic trainers and some tutorial sessiolls.

Text

Mano, M.M. Digital Design (Prentice Hall)

503003 MICnOlPROCESSOn SYSTEMS ANn APPLICATIONS

Prerequisite Assembly Language & Opemtillg Systems

Hours :3 homs pel' week for second half of yeai'

Content

Review of basic logic design and number systems. Memory technology: capacity, cost, speed and organisation. Microprocessors and microcomputers: architecture and performance. Bus standards: memory and I/O interfacing, bus handshaking procedures. Interrupt structures and interrupt programming. I/O peripherals: direct memory access, parallel devices, selial devices, timers, disks, I/O programming. Software and hardware development aids for microprocessor systems. Computer intercollnections: taxonomy, characteristics and examples. Examples of microprocessor applications: reai"time systems, dedicated systems ami general puqJOse systems.

Fomtcell hours of laboratory exercises dealing with hardware and microprocessor hardware and software.

Reference

Cantoui, A. An Introduction to Microprocessor Systems: Course Notes, Department of Electrical and Computer Engineering

DIPLOMA IN COlVH'UTER SCmNCE (OU) XU<:GULA nONS)

The following are subjects offered by the Department of Computer Science in the (old) Diploma in Computer Science. Some of them may also he available as subjects, topics or units in other courses. Students registered for the old Diploma may also apply for approval to enrol in subjects offered for the revised Diploma.

680118 SOFTWARK,ORlfENTlb:D COI\lH'UTER ARCHITECTURE

Leetw'er J.L. Keedy

Prerequisite Computer Opcrating Systems

Hours 2 lecture hOllrs per week (olle semester) plus regular assignments (including ('~say)

Kxamination Onc 2-hoUf jJaper

57

Contem

COl1VentiOllR! computer ;m;hitcctmes have usually been designed with little of the needs of the software intended to be Oll them. This topic examines mechanisms which em! fnirly easily be incOlpofated into comlllttel's and which can have a dramatic effect OIl the of software (operatillg systcms, compilers m\(1 programs). 'fhe milin issues disellssed iuclude SHICk organisation, tim stmctnrc of virtual memmy, addressing mechanisms and protectiOIl, as well as support for modularity.

Text Nil

References

Organisation, the JJ550016700 1'1'e8s)

Siewiorek, D.P., )lell, and Newell, 1\. Strw:tures: Principles

Hill 1 98?')

6!lOHH ADVAJIJCI<:lCl OPj[U~AT](NG SYSTEM k1>KU]\!CH]>U~§

Lecturer 11" Ker.dy

Prerequisite Systems

Hours 2 lecture 110m3 pDl' week (oue semester) pIns assignments

Examination One 2:hoHr paper

Content

A el'iti(:al study of operating system teehniques, with emphasis Oil the nalme of processes and the methods used to synehronise them, including a study of voXiOllS advanced mechanisms. Olher aspects studied may include modularity, naming, file system structures and command language design. Vadolls new ideas for stmcturing operating systems ilrG presented.

6!lOlB lfOR1ViAJ~ §EMANTICS OF ll'U.OGUAMIVUNG LANGUAm~§

Lecturer Simon

Prerequisite Programming Languages & Systems or ArtificiallnteUigem;e Pmgmmming 'l'cdm'lo,\lllS

How:I' :2 If',(;t!!HJ llOmB per week (olle semCSti~l)

Examination Olle ~.,hOlxr paper

Content

The symax of pmgnmllning languages is generally describtxl quite concisely and unambiguously in syntax diagrams, BNF or the like; but the semantics, the meaning or the outcome of COIlSi:mcts in the hmguage, is generally described quite sloppily ill English. Several highly formal abstract systems have been developed for the semantic descriptioll of programming languages. This course will look at such systems in general, and at one of them, denotational semanties, in detail.

58

[ext

GOldo]], lVU.C. The Denotatiollai Description of Frogramming l.anguages (Splinger Verlag (979)

Refaences

Milne & Strachey

Stoy

A Theory of Programming Language Semantics (WilcyI9'/6)

IJenolatiOIl(J/ Semantics: The Scoth'ltrachey to Programming r.(Jnguage Theory (MIT

197'1)

6301.0:1 ARTIFICJAL XNTELUGENCE

Lecit/rer SimoIl

llours 2lectnre hours per week (one semester)

L'xaminalion One 2--hour paper

Content

Systems or

This course will provide an overview of Artificial lutelligence, covcring some or aU of the following topics: introduction and history; game playing; representalioll of knowledge; natural language processing; expert systems; automatic dednction; search techniques; compuler vision; compuler learning; philosophical, psychological and social issues.

References

Barr & Feigcnbaum

Boocn

The Handbook of Artificial Intelligence (Pilman 1981)

Artificial Intelligence and Nalural Man (Harvester Press 1977)

Chami:.tk & McDermott Introduction to ArliticialIntelligence (Addison--Wesley 1985)

Nilsson Problem Solving Methods in Artificial Intelligence \.,Mcc,ro.'N\\\\\ \\)'1\)

WillstOll Art{licia! Ime IltjJence, 2nd celn (Aelelisoll--W cslcy 1984)

630110 CONCmUU~NCY, COMPLEXITY ANn vun Lecturer B. Beresford-Smith

Prerequisite Computer Science III Of equivalent

Hours 2 lecture hours per week (one semester)

Examinatioll One 2-houf paper and assignments

Content

This course provides an introducl.ion lo various aspects of VLSI systems. The fundamental idcas of VLSI design arc introduced together wilh a description of the types of software design tools used. The opportunities which VLSI offers for the development of non-conventional

compntational slruetnres and algorilhms appropriate fOl muchines wilh very many p<1mllel processing clements and a high level of concmfency are discussed.

/? {'ferences

Evans, D.f. (ed.) Parallel Processing Systems (Cambridge University Press 1987.)

Hopcroft, J.E. & Ullman, J.D. Introduction to Automata Theory, Languages and Computatio/t (l\ddisooWcsley 1919)

Kuck, D.1., Lawrie, D.H. & Sameh, AlI. (cds) ffigh Speed Computer and Algorithm Organization (Academic Press 19T1)

Mead, C.A. & COllway, L.A. introduction to Vl,SI Systems (Addison-Wesley 1980)

Savage, J .E. Tlw Complexity of Computing (Wiley 19"16)

Traub, J.E (cd) Algorithms and Complexity (Academic: Press 1976)

Ullman, J.D. Computational Aspects of V/,SJ (Computer Scic:nce Press 1984)

The following academic staff have heen appointed course coordinators null should be consnlted in case of difficulty: Mathematics IV Assoc Pmf I.R. Giles l<esemdl Degcees I\ssoc PwfP.K.Smrz Diploma in lVrathcmatical Studies Assoc J',ofW.

PAU.TQV IV!!ATm~lVIA1'H~§ SUH,JJ(CTS

l'HHJ:<::

1\ meeting will hc held on the first Tuesday of firs I term in Room V107 at 1.00 pill to detcITlline the timetable for Mathematics IV topics.

MitHO() MA'nn':lViAnC§ IV

A stlldent. desiring admission to Ihis subject should writing to the Head of the Deparlrnent before 20th n~,Oc"_'1.. __ _

of the preceding year.

Prerequisite Mathematics InA and at lC:i\st OIl{; of Mathematics nIB, Computer Science HI or Statistics III and additional work as prescribed by t.he Heads of the Departments concerned.

Hours At least g lecture honrs per week over Olle full--time year or 4 leeture hours per week over two pm H.ime years.

Fxaminatioll At least eight 2~honf final papers.

A thesis, ie a study nuder direction of a special topic using relevant published material alld present.ed ill written form. Work Oil this thesis llormally starts early in FcbfUary.

Contellt

A selection of at least eight Part IV topics. The topics offered may be from any branch of Mathemat.ics including Pure Mathematics, Applied Mathematics, Statistics, Computer Science and Operatiolls Research as exemplified in the publication Mathematical Reviews. Summaries of topics arc described in the following section of the Handbook, but. the Dep:mment should be cOllsult,;d for further details, including the current list of suitable topics from other Departments. (Students who have passed Computer Science III OJ' Statistics III may, with the permission of the Head of Department, select some of their topics of study tiom courses given ill those depaxtments.)

PART IV MATHEMATICS TOPICS 6641'/9 HISTORY OF ANALYSI§ TO

A¥10mm 1900

Lecturer R.F. Berghout

Prerequisite Nil

IIours About 2'/lcetlire hours

Examination One ',I.-hour paper

Content

A course of 26 lectures on the history of mathematics with emphasis on analysis. Other branches of mathematics will be referred to for putting the ;malysis into (;()ntext.. Where feasible, use will be made of original material, in l.r'dnsiatioll. The course will be assessed by essays and a final 2--hour examination.

Topics to he covered include: pre-Greek concepts of exactness and approximation; Greek cOllcepts of cOlliinuity, irmtio[l<1lity, infinity, infinitesimal, magnitude, ratio,

59

proportion and their treatment in E1emcnts V, XII and thc works of Archimcdcs; developments of number systems and thcir equivalents; scholastic mathcmatics; virtual motion; Rcnaissance quadratnre/cubature by infinitesimals and by "geometry"; Cartesian geomctry; 17th and 18th ccntury calculus; rigorization of analysis in thc 19th century wIth strcss on the developments of nnmbcr systems, continuity, fUllction concept, diffcrcntiability, integrability.

Text Nil

References Lists will be prcsented during the course.

Students interested in this or othcr topics on aspects of the History of Mathematics should approach Mr. Bcrghout as soon as possible,

66UfH RAJ1)][CAL§ & ANNXHILATOH§

Lecturer R.F. Berghont

Prerequisite 'fopies T or X

Hours About 271ectme hours

Examination One l .. hour paper

Content

This tDpic will hriefly outline the classical theory of finite dimensional algebras lmd the emergence of the conccpts of radical, idempotence, ring, chain conditions, ctc. Hopefully thus set in perspective, the next part will deal with the Artin-Hopkins-Jacobsoll ring theory and the significance of other radicals when finiteness conditions are dropped. The relations between varions radicals, noetherian rings, left and right annihilators and the Goldic-Small theorems will end the topic.

Text Nil

References

Cohn, P. Algebra Vol. 2 (Wiley 1977)

Divinsky, N. Rings and Radicals (Allen-Unwin ]964)

Herstein, LN. Non-commutative Rings (Wiley 1968)

Kaplansky, 1. Fields and Rings (Chicago 1969)

McCoy, N. The Theory of Rings (McMillan 1965)

664166 SYMMETUY

Lecturer W. Brisley

Prerequisites Topics D and K

Hours About 2'1 lecture hours

Examination One 2-hour paper

Content

This course studies various aspects of symmetry. Mattcrs discussed may include: in variance of latl.iccs, crystals and associated functions and equations; permutation groups; finite geometries; regular and strongly--regular graphs; design;; tactical configurations, "classical" simple groups, Matrix groups, representations, characters.

Text Nil

60

References

Biggs, N. Finite Groups of Au tom or ph isms (Cambridge 1971)

Carmichael, R.D, Groups of Finite Order (Dover reprint)

Harris, D.C. & Bertolucci, M.D. Symmetry and Spectroscopy (Oxford 1978)

Rosen, J. Symmetry Discovered (Cambridge 19'15)

Shubnikov, A.V. & Koptsik, V.A. Symmetry in Science and Art (Plenum Press 1974)

Weyl, H. Symmetry (Princcton 1973)

White, A.T. Graphs, Groups and Surfaces (North-Holland 19'13)

664169 NONLINEAR O§CILLATIONS

Lecturer J.G. Couper

Prerequisite Topic P

llours About 27 lecturc hours

Examination One 2 .. honr paper

Content

Physical problems often givc rise to ordinary differential equations which have oscillatory solutions. ~[his coursc wIll bc concerned with the existence and stabIlIty of penodlc solutions of such differential equations, and will cover thc following subjects; two-dimensional autonomous systems, limit sets, and the Poincare-Bendixson theorem. Brouwer's fixed point theorem and its usc in finding periodic solutious. Non-critical linear systems and their perturbations. Thc method of averaging. Frequency locking, jump phcnomenou, and subharmonics. Bifurcation of periodic solutions. Attention will bc paid to applications throughout the course.

Text Nil

References

Hale, J.K. Ordinary Differential Equations (Wilcy 1969)

Hirsch, M.W. & Smale, S. Differential Equations, Dynamical Systems and Linear Algebra (Academic 1974)

Marsdcn, I.E. & McCracken, M. The Hopf Bifurcation and its Applications (Springer .. Verlag 1976)

Nayfch, A.B. & Mook, D.T. Nonlinear Oscillations (Wiley 1979)

Stoker, J.J. Nonlinear Vibrations (Wiley 1950)

664197, FLOW STATISTICAL MECHANICS

Lecturer C.A. Croxton

Prerequisite Nil

Hours About 27 lecturc hours

Examination One 2 .. ilour paper

Content

C'uster-diagrammatic expansions -- low density solutions; integrodifferential equations (BGY, HNC, PY) high density solutions; quantum liquids· Wll .. Fcenburg fermion extension; numerical solution of integral equations; phase transitions - diagrammatic approach; critical phenomena; the liquid surfac(~; liquid metals; liquid crystals; molecular dynamics anc! Monte Carlo computer simulation; irreversibility; transport phenomena. Polymeric systems.

Text

Croxton, CA. Introduction to Liquid State Physics (Wiley 19'75)

References

Croxton, CA. Liquid Slate Physics - A Statistical Mechanical Introduction (Cambridge 19'14)

664120 QUANTUM MECHANICS

Lecturer CA. Croxton

Prerequisite Nil

flours About n lecturc hours

Examination One 2 .. hollr paper

Content

Operators; Schrodingcr equation; one dimensional motion; parity; harmonic oscillator; angular momcntum; central potential; eigenfunction; spin and statistics; Rutherford scattering; scattering theory phase shift analysis; nucleon· nucleon interaction; spin-dependcnt interaction; operators and state vectors; Schrodingcr equations of motion; Hcisenberg equation of motion. Quantum molecular orbitals; hybridization; LCAO theory; MO theory.

Texts

Croxton, CA. Introductory Eigenphysics (Wiley 1974)

Matthews, PT. Introduction to Quantum Mechanics (McGraw Hill 1968)

664153 ALGEBRAIC GRAPH THEOHY

Lecturer R.B. Eggleton

Prerequisite Topic D

Hours About 27 lecture hours

Examination Onc 2-houf paper

Content

The adjaccncy matrix of a graph. Path lengths, shortest paths in a graph. Spectrum of a graph. Regular graphs ane! line graphs. Homology of graphs. Spanning trees. Complcxity of a graph. The determinant of thc adjacency matrix. Alltomorphisms of graphs. Vcrtex transitive graphs. The coursc will then continue with a selection from [he following topics, as lime permits. Symmetric graphs, with attention to the trivalent case. Covering graph of a graph. Distance-transitive graph. Realisability of intersection arrays. Primitivity and imprimitivity. Minimal regular graphs of giveu girth. Vertex colourings and the chromatic polynomial.

Text

Biggs, N. Algebraic Graph Theory (Cambridge 197t1)

References

Bondy, I.A. & Murty, U.S.R. Graph Theory with Applications cOfrected edu (Macmillan 19'/'1)

Harary,F. Graph Theory (Addison-Wesley 1969)

Lancaster, P. Theory of Matrices (Academic 1969)

Wilson,IU. Introduction to Graph Theory (Longman 1972)

664173 IVIATlfmMA'I'lCAL PUOnLEM §OLVING

Lecturer R.ll. Eggleton

Prerequisite Topic 0

Hours Abont 27 class hours

Examination One 2 .. holll" paper

Content

The class will be conducted by a team of several staff mcmbers with interests across a wide spectrum of mathematics. The course will contain a series of mathematical problems, presented for solutioll. Participants in the class will be expected to contribute to initial discussion of the problems, then to attempt individual solutions, and subsequently to present their fnll or partial solutions. In the case of prohlems solved only pm'tially by individuals, subsequent class discussion would be aimed at producing a full solution Oil a tcam basis. Finally participants in the class will be expected to write up a polished version of the statement and solution of each problem. The intention of the class is to huild up participants' expericnce in skills appropri'ate for mathematical research. The final examination will be mainly concerncd with problems actually solved dming the year.

References

Refercnces will be suggested during the course.

664196 C)MBINATOIRIC§ OF I?IN](TE GEOME'flUE§

Lecturer R.B. Eggleton

Prerequisite Topics D mId K

Hours About 27 lecture hours

Examination One 2-hour paper

Content

The course is an inU"odllctiolJ to finite geometry, and covers the following an:a5. Near-linear spaces: dependence, dimcnsion, incidcncc matrices, connection number, collincations. Lincar spaces: Steiner systems, the de Druin­Erdos thcorem, Ilumberical properties, exchange property, hypel planes, linear functions. Projective spaces: projective planes, embedding, Bruck's theorem, Desargllcs configuration, Pappus configuration, higher dimcnsional

61

projective spaces. Affine spaces: affine planes, embedding in projective planes, special collineatiollS, Desargues and Pappus configurations, coordinatization, higher dm1cnslollal affine spaces. Polar spaces: direct sum, absolute points, quadrics, subspaces, ineducibility, Shull spaces. Generalized quadrangles: the knowll examples, combinatorial properties, subquadrangles, colliurations of generalized quadrangles. Partial geometries: definition, construction, strongly regular graphs, su\)gcometrics, Pasch's axiom.

Text

Batten, L.M. Combinatorics of Finite Geometries (CUP 1986)

6641113 BANACh'! ALGEBRA

Lecturer J .R. (liles

Corequisite Topic W

Hours About 27 lecture hours

Examination One 2ohour paper

Content

A Ba11ach AJgebra is a mathematical stmcture where the two main strands of pure mathematical study - the topological and the algebraic ., are united in fruitful contact. The course will eover the following snbject matter. Normecl algebras; regular and singular elements; the spectrum of an element and its properties; the Gelfand-Mazur theorem; topological divisors of zero; the spectral radius and spectral mapping theorem for polynomials; ideals ane! maximal ideals. Commutative Banach algebras; the Gelfand theory and the Gelfand representation theorem. Weak topologies, the Banacil-Alaoglu theorem, ti1(l Gelfand topology. Involutions ill Banach algebras; hermitian involutions; the Gelfand·· Naimllrk repr<,,scntatiol1 theorem for commlltive Il" algebras. Numerieal range of an element in a 110rtned algebra; relation of the numerical range to the spectrum; B" algebras are symmetric, discussion of the GelfandoNaimark representation theorem for B" algebras. Applications of Banach algebra theory.

Text

Z,e!azko, W. Banach Algebras (Elsevier 1973)

References

Bacilmall, G. & N3Sici, L. Functional Analysis (Academic 1966)

Bonsall, EE & Duncan, J. Complete Nonned Algebras .(Springer 1973)

Bonsall, F.F. & Duncan, J. Numerical Ranges of Operators on Normal Spaces and Rlements of Non ned Algebras (Cambridge 1970)

Naimark, M.A. Normed Rings (Noorcihoff 1959)

Rickllrt, C.E. General Theory of Banach Algebras (Van Nostrand 19(0)

Rudill,W. Functional AnalYSis (MeGraw-HiIl1973)

Simmons, G.F. Introduction to Topology and Modern Analysis (McGraw-Hill 1963)

Wilansky, A. Functional Analysis (Blaisdell 1964)

664158 CONVEX ANALYSIS

Lecturer J.R. Giles

Corequisite Topic W

[Jours About 27 lecture hours

Examination Onc 2··hoUf paper

Content

Convexity hilS become an increasingly important concept in analysis: mueh of current research in functional analysis concerns generalising to convex fuuctions, properties previously studies for the norm; much 'of interest in convexity has arisen from arcas of applied mathematics related to fixed point theory and optimisation problem$. We begin with a study of convex sets and functions defined on linear spaces: gauges of convex sets, scparalloJl propcrtIes. We then study topology on lincar spaces generated by convex sets: metrisability, normability and finite dimensional cases. Wc examine continuity and scparation for locally convex spaces, continuity for convexity properties and Banach·Alaoglu Thcorem. We study extreme points of convex scts, the Krcin»Milman theorem. We give paniculos attention to the study of differentiation of convex functions on normed linear spaces: Gateaux and Frechet derivative, Mazur's and A.~p!lInd's theorems.

Text

Giles, J.R. Convex Analysis with Application in the Differentiation of Convex Functions (Pitman] 982)

References

Barbu, V. & Precllpanu, T. Convexity and Optimiwtion in Banach Spaces (Sijthoff & Noordhoff 1978)

Clarke, F.H. Optimization and nOfl,smooth analysis (Wiley 19(3)

Day, M.M. Normed Linear Spaces (Springer 1973)

Diestel, J. Geometry of Banach Spaces - Selected Topics (Springer 19'/5)

Rkeland, 1. & Tema11, R. Convex Analysis and Variational Problems (North Holland 1976)

Giles, lR Analysis of Normed Linear Spaces (University of Newcastle 1978)

Holmes, R.B. Geometric Functional Analysis and its Applications (Springer 1975)

Roberts, A.W. & Varberg, D.E. Convex Functions (Academic 1970)

Rockafcllcr, RT. Convex Analysis (Princeton 1970)

Rudin, W. Functional Analysis (McGraw·HiIl1973)

Valentine, F.A. Convex Sets (McGraw-Hili 19M)

Wilansky, A. Functional Analysis (Blaisdell 19M)

661150 GENERAL & ALGEBRAIC TOPOLOGY

Lecturer M.J. Hayes

Prerequisite Topic L

flours About 27 lecture hours

E"xamination One 2~hour paper

Content

Topological spaces are sets with enough properties on which to study continuity. These lectures will concentrate on the geomctrie aspects of these spaces, and will include the following topics: separation, relative and product topologies, compactness, eonncctedncss, homeomorphisms, quotient spaces, homotopy and the fuudamelltal group, deformation retracts. Seifert-Van Kampen Theorem. Covering spaces.

Text Nil

References

Cairns, S.S. Introductory Topology (Ronald 1961)

Lcfshet7:, S. Introduction to Topology (princeton 1949)

Massey, W.S. Algebraic Topology (Harcourt, Brace & World 1967)

Simmons, G.F. Introduction to Topology and Modern Analysis (McGrawoHilI ] 963)

Wallace, A.H. An introduction to Algebraic Topology (Pergamo11 1961)

664114 LINEAR OPERATORS

Lecturer MJ. Hayes

Prerequisites Topics V & W

lIours About 27 lecture hours

Examination One 2-hour paper

Content

The theory of linear operators on Hilbcrt and Banach spaces is a very important theory and is valuable for applications. We consider the algebra of cominuous linear opcrators on a Hormed lincar space, the spectrum and numerical range of a continuous linear operator, and conjugate operators. We discuss the theory of compact linear operators and the Riesz .. Schauder TheOlY for such operators. The course concentrates on spectral theory for different types of operator on Hilbert space: compact normal, selfoadjoint and normal operators.

Text

Brown, A. & Page, A. Elements of Functional Analysis (Vall Nostrand 1970)

Re/erences

Bachman, G. /Jr. Narici, L. Functional Analysis (paperback Academic 19(6)

Dunford, N. &. Schwartz, J. Linear Operators (lnterscience 1958)

torch, E. Spectral Theory (Oxford 1962)

Rndin,W. FUllctional Analysis (McGraw.,HilII973)

Sc1uneidler, W. Linear Operators on Hilbert ~;'pace (Aeademic 1954)

Taylor, A. Functional Analysis (Wiley 1958)

66(H(IS VISCOUS FLOW Tmml~Y

Lecturer W.T.F. Lau

Prerequisite Topic Q /lours About 27 lectme hours

Examination One 2 .. houl" papcr

Content

Basic eqnations. Some exact solutions of the Navier .. Stokes equations. Approximate solutions: theory of very slow motion, boundary layer theory, etc.

Text Nil

Riferences

Batchelor, G.K. An Introduction to Fluid Dynamics (Cambridge 1967)

Landau, L.D. & Lifshitz, E.M. Fluid Mechanics (pergamon] 959)

Langlois, W.E. Slow Viscous Flow (Macmillan 1964)

Pai, S.L Viscous Flow Theory VoU (Van Nostrand 1956)

Roscnhead, L. (cd.) Laminar BoundalY Layers (Oxforcl1963)

Schlichting, H. Boundary Layer Theory (McGraw··HilI 1968)

Teman, R. Navier··Stokes Equations .. Theory and Numerical Analysis (North Holland 19"/6)

664118 PERTURHAT][QN THEORY

Lecturers W. Summerfield and D.L.S. McElwain

Prerequisites Topics CO, P

Hours About 27 lecture hours

Examination One 2·,hollr paper

63

Content

Regular perturbation methods, including parameter anc! coordinate perturbations. A discussion of the sources of nonunifonnity in perturbation expansions. The method of strained coordinates and the methods of matched and composite asymptotic expansions. The method of multiple scales.

Text Nil

References

Bender, C.M. & Ol'szag, S.A Advanced Mathematical Methods for Scientists and Engineers (McGraw-Hill 1978)

Cole, J.D. Perturbation Methods in Applied Mathematics (Blaisdell 1968)

Nayfeh, AH. Introduction to Perturbation Techniques (Wiley 1981)

Nayfeh, AH. Perturbation Methods (Wiley 1973)

Van Dyke,M. Perturbation Methods in Fluid Mechanics (Pm'abolic 1975)

664164 NUMBER THEORY

Lecturer T.K. Sheng

Prerequisite Nil

Hours About 27 lecture hours

Examination One 2-hour paper

Content

Divisibility. Congruences. Quadratic residues, the Legendre symbol, quadratic reciprocity, the Gaussian reciprocity law, the Jacobi symbol. Multiplicative functions, Mobius inversion formula, recurrence functions. Simple continued fractions. Pell's equation. Distribution of primes. Partitions. Asymptotic density. Dispersive and explosive maJlllings.

Text Nil

References

Andrews, G .E. Number Theory (Saunders 1971)

Hardy, G. &. Wright,E.M. Introduction to Number Theory (Oxford 1960)

Niven, I. & Auekerman, H.S. An Introduction to the Theory of Numbers (Wiley 1968) .

664159 FOUNDATIONS OF MODERN DU'FERENTXAL GE01VIETIn{

Lecturer P.K. Smrz

Prerequisite Topic CO

Hours About 2'/ lecture homs

Examination One 2.,[lOur paper

Content

This topic will introduce basic concepts of the local theory of differentiable manifolds. Vector fields, differential forms,

and their mapping. Frobenius' theorem. Fundamental properties of Lie groups and Lie algebras, General linear group. Principle and associated fibre bundles. Connections. Bundle of linear frames, affine connections, Curvature and torsion. Metric, geodesics. Riemannian manifolds.

Text Nil

References

Auslander, L. Differential Geometry (Harper &. Row 1967)

ChevaJley, e. Theory of Lie Groups, VoU (Princeton 1946)

Kobayashi, S. &. Nomizu, K. Foundations of Differential Geometry, VoU (Interscience 1963)

664165 MATHElViAnCAL PHYSIOLOGY

Lecturer W. Summerfield

Prerequisite Nil

!lours About 27 lecture hours

Examination One 2·houl" paper

Content

Physiology· the study of how the body works based on the knowledge of how it is constructed - essentially dates from em'ly in the seventeenth century when the English physician Harvey showed that blood circulates constantly through the body. The intrusion of engineering into this field is well know through the wide pUblicity given to (for example) heart by-pass and kidney dialysis machines, cardiac assist pace-makers, and prosthetic devices such as hip and knee joints; the obviously beneficial union has led to the establishment of Bioengineering Departments within Universities and Hospitals. Perhaps the earliest demonstration of mathematics' useful application in (some m'eas of) physiology is the mid-nineteenth centUlY derivation by Hagen, from the basic equations of continuum motion, of Poiseuille's empirical formula for flow through narrow straight tubes; detailed models of the cardiovascular circulatory system have recently been developed, Mathematical models have also been formulated for actions such as coughing, micturition and walking, as well as for the more vital processes involved in gas exchange in the lungs, mass transport between lungs and blood and blood and tissue, metabolic exchanges within tissues, enzyme kinetics, signal conduction along nerve fibres, sperm transport in the cervix, ..... Indeed, mathematical engineering might now be said to be pmt of the conspiracy to produce super humans (c.g. see "Fast Running Tracks" in Dec. 1978 isslle of Scientific American).

This course will examine in some detail a few of the previously mentioned mathematical models; relevant physiological material will be introduced as required,

Text Nil

References

Bergei, D.H. (ed.) Cardiovascular Fluid Dynamics (Vols I & II) (Academic 1972)

Cam, e.G., Pedley, 1'.1. The Mechanics of the Circulation (Oxford 1978)

Christensen, H.N. Biological Transport (W.A Benjmnin, 1975)

Fung, V.C. Biodynamics: Circulation (Springer-Verlag 1984)

Fung, V.C. Biomechanics: Mechanical Properties of Living Tissues (Springer-Verlag 1981)

Fung, V.e., Perrone, N. & Anliker, M. (eds.) Biomechanics Its Foundations and Objectives (prentice-Hall 1972)

Lightfoot, E.N. Transport Phenomena and Living Systems (Wiley 19'/4)

Margaria, R. Biomechanics and Energetics of Muscular Exercise (Clarendoll 19"16)

Pedley, TJ. The Fluid Mechanics of Large Blood Vessels (Cmnbridge 1980)

West, J.B. (ed.) Bioengineering Aspects of the Lung (Marcel Dekker 1977)

664168 ASTROPHYSICAL APPLICATIONS OF MAGNETOHYDRODYNAMICS

Lecturer W.P. Wood

Prerequisites Topics CO mld PD

flours About 2"1leeture hours

Examination One 2-hour paper

Content

The normal slate of matter in the universe is that of a plasma, or iOllized gas, permeated by magnetic fields. Moreover, these fields (unlike that of the earth) may be dommant, or at least Significant, in controlling the structure of the region. The aim of this course is to invest.igate the effects of astrophysical magnetic fields, ranging Ji'om 10-6

ganss in the galaxy to 1012 gauss in a neutron star.

Text Nil

R c.ferences

Chandrasekhar, S. Hydrodynamic and llydromagnetic Stability (Oxford 1961)

Cowling, T.G. Magnetohydrodynamics (Illterscience 1957)

Dc Jong, T. & Maeder, A(eds.) Star Formation (D. Reidel 1977)

Mestel, L. Effects of Magnetic Fields (Mem.Sc.Roy.Sci. Liege (6) 8 79 1975)

Moffatt, H.K. Magnetic Field Generation in Electrically Conducting Fluids (e.u.P. 1978)

Spiegel, E.A. & Zahn, J.P.(eds) Problems of Stellar Convection (Springer-Verlag 1976)

NOTE:

Other topics may be ol'l\~l'ed fl'om time to visitor§ to the Ueparhnellt:

§tiH.lel1t§ silollid COIISIlIt the lJcj)aJctmcllt early hi the yem' I'cganliul1 them.

COIVHHNlfm SUr.JlECTS XN nm HACll-lEUm mi' m<:mum Note:

Students desiring admission to allY of the followiuy combined honours subjects !lIust apply in wtiting t~ the Dean of the Faculty of Mathematics before 20 December of the preeeding year.

664210 MA'j['mO;:MhnC§/J:H~ONOIVHC§ IV

Prerequisites Mathematics nIh and Economics mc and such additional work as is required for wmbil1e~1 h()nom~ students by the Departments of Mathematics 'aud/or Statistics.

IIours To be advised. A project of mathematical ~m(l economic significance joilltly supervised.

Examination Assessment will be ill the appropriate Mathematics and Ec.ouoll1ks topics. III additioll, the projeet WIll be evaluated by mdependent examiners.

Content

The student shall complete not Jess than 4 topics from the Mathematics IV list and tDpics equivalent to 4 points from ~h~ Economics IV list chosen appropriately alld approved JOll1tly by the Heads of the Departments concerned.

664500 IVdATHEMA'll'XC§!GEOLOGY XV

Prerequisites Geology mc and Mathematics nIA and such additional work as is required for eomhiu('Ai honours students by the Depaxtments of Mathematics and/or Statistics.

Hours To be advised

h-xamination To be advised

Content

At least four topics chosen from those available to honours students in Mathematics for the Cllrrent year together with work offered by t.he Department of Geology for that year. The subject will also include a major thcsis which emh~dics the results of a field research project involving the application of mathematieal studies to a particular geological pJ'Oblcm. Other work cg seminars and assignments may be required by eitllef Department.

Texts To be advised

References To be advised

664300 MhTHEMATXCS!K"HYSJl.C§ )(V

Prerequisites Mathematics InA & Physics IlIA & such additional work as is f('A).uired for combined hOllours students by the Departments of Mathematics and/or Statistics.

Hours To be advised. A project of mathematical aml physical significance, jointly supervised.

Examination Assessment will be in the appropriate Mathematics & Physics topics selected. In additioll the

65

research project will h(; assessed Oil the basis of a written report t1nd a seminal" on the project.

Content

The st!1(lcnt s111\11 eomplete fOlll' topics from Mathematics IV, choseiJ for their application to Physics, ami topics from Physics IV, as approved by Head of Department of Physics, Project work will normally begin in the first week of I'e brmlty .

(i(iilJ.Oi) lV)(AT1H<:MA')[,][CSill'f;YC1HOLOGY IV

Prerequisites M'llhelllatics mA, Psychology mc Hours TO!Y0

ExaminatiolJ To he RlIvis(xl

Contem

4 M:lthema,ics topics chosen fmm ihe Pm t IV l'vlmhernatics

A selection of semin~xs from Psychology IV which Illay lllclmle mathcrrHlticgj applications in Psychology.

A thesis involving the application of Mathematics in

Details of courses offered by the Department of Statistics can be obtaincd hom thc Departmental Secretary or from Professor Dobson. Further Information about statistics courses also appears in the section Notes on Degrees and Diplomas in Section Two.

PART IV SUBJECT

694100 STATISTICS IV

Prerequisites Statistics III and a Pmt III subject in either Mathematics or Computer Science

Hours Approximately 6 lecture hours per week and completion of a substantial project

Examination Six /,,,hOllf examinations or equivalent assessmcnts each worth 10% of the final asscssment, and a thesis relating to the jJr~ject undertaken and worth 40% of the filial assessment.

COlltent

Students are required to take six topics of which at least three mllst be chosen from the Pall IV topics offered by the Depmtment of Statistics, Other topics may be chosen from the Part IV topics offered by the Departmcnt of Mathematics or the Depallment of Computer Scicnce or topics (listed below) offetcd hy other departments,

Students are also required to complete a substantial project. The results of the project, wOfth 40% of the final assessment, must he embodied in a thesis. The project may he a practical one involving the analysis of data, or a theoretical one. Work on the project 1100mally starts early ill Febm81Y.

The list of topics available for Statistics IV other thall those offered by the Depal tment of Statistics, the Department of Mathematics or the Department of Computer Science is as follows:

Managernent Science A and Management Science B offered by the Department of Management

Estimation and System Identification, Adaptive Control and Advanced Digital Signal Processing offered by the Department of Electrical & Computer Engilleering

ll'ART XV STATISTICS TOPICS

69~1i)I ANAI.YSI§ 01'1 CATEGmnCAL nATA

Lecturer D,L. O'Connell

Prerequisite Statistics III or equivaicnt topics

Hours About),7 hours

Examination Assignments amI one major project

Content

The course will discuss the analysis of categorical data. It will begin with a thorough coverage of 2 x 2 tables before moving on to larger (rxc) contingency tables. Topics to be covered include probability models for categorical data, measures of association, measures of agreement, the Mantel, Haenszel method for combining tables, applications of logistic regression and log .. Jinear models,

References

Bishop, Y.M.M., Feinberg, S.E. & Holland, P.W. Discrete Multivariate Analysis: Theory and Practice (MIT Press 197.'5)

Flei~'s, J.L. Statistical Methods for Rates and Proportions 2nd edition (Wiley 1982)

694102 j)EMOGI~APHY AND SURVIVAL ANALYSIS

Lecture/' R.W, Gibberd

Prerequisite Statistics III or equivalent topics

!lours About 27 hours

Examination Assignments and one 2"hour cxamination

Content

This course presents a mathematical treatmcnt of the techniques used in population projections, manpower stndies, and the survival models used in demography and biostatistics.

Text

Lawless, J. Statistical Models & Methods for Lifetime Data (Wiley 1982)

References

Cox, D.R. and Oakes, D. Analysis of Survival Data (Chapman & Hall 1984)

Elandt-Johnson, R.c. & Johnson, N.L. Survival Models and Data Analysis (Wiley 1980)

Kalbfleisch, J.D. & Prentice, R.L. The Statistical Analysis of Failure Time Data (Wiley 1980)

Keyfitz, N. Applied Mathematical Demography (Wiley 1977)

Keyfitz,N. Introduction to the Mathematics of Population (Addison-Wesley 1968)

Pollard, J.H. Mathematical Models for the Growth of J/uman Populations (Cambridge Uni. Press 1975)

694104 STATISTICAL CONSULTING

Lecturer D.ESinclair

Prerequisite Statistics III or equivalent topics

Hours About 27 hours

Examination Continuous assessment

Content

The aim of this course is to develop both the statistical and non··statistical skills required for a successful consultant The course includes a study of the consulting literature, a review of commonIY"llsed statistical procedures, problem formulation and solving, analysis of data sets, report writing and oral presentation, role-playing and consulting with actual clients.

DIPLOMA AND COUIRSEWORK MASTER SUBJECTS

SUbjects taught by the Department of Statistics for thc Diploma in Medical Statistics and Master of Medical Statistics are described in detail in the next section, under

the topics of the same nmne. Students enrolliug ill thes0 subjects should note that a differem computer nmnb(ll' applies (see eud of Ihis handbook), Some of these snbject;; are also available in other diplomas (eg Diploma in Computer Science),

67

Computer Numbers must be shown 011 enrolment and course variation forms in the following manner. Candidates wishing to

enrol ill any subject 1I0t listed shonld consult the Faculty Secretary.

BACHELOR OlF COMPUTER SCIENCE SUBJECTS This list contains only the scheduled subjects for the BCompSc degrcc. The non-scheduled subjects permitted in the BCompSc arc listed under Notes on Degrees.and Diplomas: Computer Sciencc Courses. The computer numbers for these subjects cau be found under the computer numbers for the Bachelor of Mathematics.

Computer Subject Name Number

Part I Subjects 531600 COlVLPUIER ENGINEERING I 681100 COMPUTER SCIENCE I 661100 MATHEMATICS I

Part n 682100 682110 662410 532600

Part HI 683200 683300 683900 533600

Subjects COMPUTER SCIENCE II DATA PROCESSING II MATHEMATICS IICS COMPUIER ENGINEERING II

Subjects COMPUfER SCIENCE IlIA COMPUTER SCIENCE IlIB COMPUTER SCIENCE lIlT COMPUTER ENGINEERING III

BACHELOR ml' C01ViOPUTER SCIENCE (HONOURS) SUBJECTS

684100 COMPmER SCIENCE IV

(REVISED) IHP1LOMA ][N COMPUTER SCIENCE SUBJECTS

680119 ASSEMBLER LANGUAGE 680106 COMPARATIVE PROGRAMMING LANGUAGES

680107 COMPILER DESIGN 680108 COMPUTER GRAPHICS

680112 680114 680117 660149 660150 660151 690111 440106 440123 440124 533902 503003 680120 680121 680109 680111 680104

DATA STRUCTURES AND ALGORrIHMS mTRODUCTIONTOPROGRAMMING SOFTWARE ENGINEERING DISCRETE MATHEMATICS LINEAR ALGEBRA NUMERICAL ANALYSIS RANDOM PROCESSES AND SIMULATION COMMERCIAL PROGRAMMING SYSTEMS ANALYSIS SYSTEMS DESIGN SWITCHING n·IEpRY AND LOGICAL DESIGN MICROPROCESSOR SYSIEMS AND APPLICATIONS

OPERATING SYSTEMS THEORY OF COMPUTA'110N COMPUTER NETWORKS DATABASE DESIGN ARTIFICIAL INTELLIGENCE PROGRAMMING TECHNIQUES

MASTER OF COMl!-'U'll'ING SUBJECTS

684101 COMl"UrER SCIENCE IVM

Comp.uter Numl:ers mus~ be shown on enrolment and course variation forms in the following manner. Candidates wishin to enrol m any subject not listed should consult the Faculty Secretary. . g

BACHELOR OF MATHEMATICS SUBJECTS

Computer SUbject Name Number

Part I Subjects 411100 ACCOUNTING I 711 JOO BIOLOGY I 721100 311400 681100 261100 421300

541100

331100 341101 341300 351100 731100 361500 361600 311100 371100 291100 311200 451100 271100 661100 661200 661300

381100

741200 741300 751100 311300 301100

CHEMISTRY I CLASSICAL CIVILISATION I COMPUTER SCIENCE I DRAMA I ECONOMICS IA

ENGINEERING I (4 components)

ENGLISH I FRENCHIA FRENCH IS GEOGRAPHY I GEOLOGY I GERMANIN GERMAN IS GREEK I HISTORY I JAPANESE I LATINI LEGAL STUDIES I LINGUISTICS I MATHEMATICS I MATHEMATICS IS MATHEMATICS 102

PHILOSOPHY I

PHYSICS fA PHYSICS IE PSYCHOLOGY I SANSKRIT I SOCIOLOGY I

Computer Names of Components Number

511108 521105 531205 541104 501102

381111 381106 381109 381110 381117 381114 381108

Che14l Industrial Process Principles CE III Mechanics and Structures EE 130 Introduction to Electrical Engineering MEllI Graphics and Engineering Drawing GEI51 Introduction to Materials Science

Introduction to Philosophical Problems Moral Problems Philosophy of Religion Critical Reasoning Logic (Symbolic) Political Philosophy Knowlcclge & Explanation

69

Computer Numbers mllst be shown on enrolment and course variation forms in the following manner. Candidates wishing to enrol in any snbject not listed should consult the Faculty Secretary.

Computer Sllbject Name f ,_ • -Con 1J1lter Names of Components Number ' , Number

Part XI Subjects 412700 ACCOONTING lIC

Biological Methods Biochemistry Cell Biology

712104 Moleculm' Genetics 712105 Animal Physiology 712106 Plant Physiology

'11210'/ Population Dynamics ~ ___ ~ __ ---------- ------... ~------

722200 CHEMISTRY IIA ---------

522700 CIVIL ENGINEERING IIM 572113 527,102

CE2l2 Mechanics of Solids CEl31 Fluid Mechanics I

522114 CE213 Theory of Structures 522204 CE232 Fluid Mechanics II 522112 CE224 Civil Engineering Materi~ __ __

------------ ----~----- -------_. ----

312502 CLASSICAL CIVILISATION IIA c682100 COMPUTER SCIENCE II

682900 COMPUTER SCIENCE III' 682910 COMPUTER SCIENCE IIT PART 1 682920 COMPUT'ER SCIENCE III' PART 2

422100 ECONOMICS IIA ___________ _

-0---F,~C-ONOivncS-n-B-(2-c-om-p-o-nenls) 422206 Comparitivc Economic Systems 42220 _ , . 422201 Industry ECOIIOlI1lCS

322200

742200 332100 342100 352100 352200 732200

732300 372100 372200 372300 372500 372600

372700 292100 452100

70

EDUCAT10N II

ELEC1RONICS & INS'IROMENTATION II ENGLISHIIA FRENCHIIA GEOGRAPHY HA GEOGRAPHY lIB GEOLOGYIIA GEOLOGY lIB HISTORYIIA HISTORY lIB HISTORYIIC HISTORYIID HISTORY lIE (not available in 1988) HISTORYHF JAPANESE IIA LEGAL STUDIES IIA

422202 Labour Economics 422107 Money & Banking 42220'1 Economics and Politics

322201 322203 323104 322204

----- ---------Individual/Social Devc!opmeut Comparative Aspects of Education History of Australian Education Modern Educational Theories

Computer Numbers must be shown on enrolment and course variation forms in the following manner. Candidates wishing to enrol in any snbject not listed should consult the Faculty Secretary. Computer Subject Name Number

662100 662200 662210 662220 662300

382100 382200

MATHEMATICS IrA MATHEMATICS lIB MATHEMATICS lIB PART 1 MATHEMATICS HB PART 2 MATHEMATICS HC

PHILOSOPHY IIA

-----~---PHILOSOPHY lIB

--------~

742100 PHYSICS II 752100 PSYCHOLOGY IIA 752200 PSYCHOLOGY HB 752300 PSYCHOLOGY HC

----~ --_._----..

692100 ST ATIS'llCS II

Part IU Subjects

713200

723100 723200

523'100

ACCOUNTING mc

BIOLOGY mB

CHEMISTRY lIlA CHEMISTRY HIB

CIVIL ENGINEERING IIIM

662101 662102 662109

662101 662201

662202 662203 662303

662304

692102 692103 692104

413100

413200

4n:WO 413619

'f13104 713105 713106 713107 713108 713109 713110 71320"

523102 523112 523306 523117 523119

Names oJ Components

Topic A .. Mathematical Models Topic B .. Complex AnalYSis

Topic CO - Vector Calculus & Differential Equations

Topic D Linear Algebra

Topic E .. Topic in Applied Mathematics e.g. Mechanics and Potential Theory

Topic F - Numerical Analysis & Computing Topic G .. Discrete Mathematics

Topic K .. Topic in Pure Mathematics e.g. Group Theory

Topic L - Analysis of Metric SP3CCS

PS: Probability and Statistics RP: Random Processes and Simulation DATI: Design and Analysis of Experiments

Either Accoullting rnA 0-(

Accollilting mB and two Part HI Maths topics or Accollnting HIB and Foulldations of Finance

Cell Processes Immunology

Reproductive Physiology Mammaliml Development

Molecular Biology o[Plant Devclopment Plant Structure mId Function Environmental Plant Physiology Ecology and Evolution

CE324 Soil Mechanics CE314 Thcory of Structures II CE333 Fluid Mechanics III CE334 Open Channel Hydraulics CE351 Civil Engineering Systems

71

Computer Numbers must be shown on enrolment and course variation forms in the following manner. Candidates wishing to enrol in any subject not listed should consult the Faculty Secretary.

ComputeI' Subject Name Computer Names of Components Number Number

533900 COMMUNlCA'fIONS AND AUTOMATIC 503006 GE361 Automatic Control CONrROL 533113 EE344 Communications

534134 EE447 Digital Communications -"~--'-~----'--'

683200 COMPUTER SCIENCE IIIA -~-~---~~.~---.

533901 DIGITAL COMPUTERS AND 503006 GE361 Automatic Control AUTOMATIC CON1ROL 532116 EE264 Assembly Language and Operating

Systems 533902 Switching Theory fIDd Logical Design

423800 ECONOMICS mc 423208 Economeu'ics I (2 cornponents including 42320-1 Mathematical Economics Econometrics I and/or 423113 Development Mathematical Economics) 423102 International Economics

423103 Public Economics 423114 Growth and Fluctuations 423115 Topics in International Economics 423116 Advanced Economic Analysis

733300 GEOLOGYIDC --~--"-

543500 INDUSTRIAL ENGINEERING I 543501 ME381 Methods Engineering (4 components) 543502 ME383 Quality Engineering

543503 ME384 Design for Prodnction 544469 ME419 Bulk Matcrials Handling Systems I 544433 ME482 Engineering Economics I 544470 ME483 Production Scheduling 544464 ME484 Engineering Economics II

663100 MATHEMA11CS IlIA 663101 Topic M - General Tensors and Relativity 663200 MATHEMAI1CS mB 663102 Topic N - Variational Methods and Integral

Equations 663103 Topic 0 - Mathematical Logic and Set Theory 663104 Topic P - Ordinary Differential Equations 663108 Topic PD - Partial Differential Equations 663105 Topic Q - Fluid Mechanics 663215 Topic QS - Qantum and Statistical Mcchanics 663107 Topic S - Geometry 663201 Topic 'I - Basic Combinatorics 663202 TopicU - Introduction to Optimization 663203 Topic V - Measure Theory & Integration 663204 Topic W - Functional Analysis 663217 Topic X <> Fields and Equations 663207 Topic Z - Mathematical Principles of Numerical

Analysis

553900 MECHANICAL ENGINEERING mc 503006 GE361 Automatic Control (4 components) 540143 ME505 Advanced Numerical Programming

544467 ME487 Operations Research - Fundamental Techniques

544468 ME488 Operations Research - Planning, Inventory Control and Management

72

SECTION SEVEN ~< -'<~~~-<~"~c_~~~ATHEMATICS JULBJ~CL COMPUTER NUMBERS

Comp.uter Num,?ers must be shown on enrolment and Cour ". ~~~~ -~ ~-~~~ enrol In any subject not listed should consult the Faculty s~~:~tlOn forms In the following manner. Candidates wishing to Computer Subject Name . Number Computer Names of Components 743100 753300

693100

PHYSICS IIIA PSYCHOLOGY mc

STATISTICS III

BACHELOR OF MATHEMATICS (HONOURS) 664100 MATHEMATICS IV

664210 MATHEMATICS/ECONOMICS IV 664500 MA THEMA TICS/GEOLOGY IV 664300 MATHEMATICS/PHYSICS IV 664200 MATHEMATICS/PSYCHOLOGY IV 684100 COMPUTER SCIENCE IV 694100 STATISTICS IV

Number

693102 693107 693106 693105

SUBJECTS

664179 664151 664166 664106 664169 664192 664120 664153 664173 664142 664103 664196 664158 664150 664114 664145 664118 664164 664159 664165 664168

SS: Survey Sampling

TSA: Time Series AnalYSis SI: Statistical Inference

GLM: Generalized Linear Models

History of Analysis to Around 1900 Radicals & Annihilators Symmetry

Combinatorics Nonlinear Oscillations Fluid Statistical Mechanics Quantum Mechanics Algebraic Graph Theory

Mathematical Problem Solving Topological Graph Theory Banach Algebra

Combinatorics of Finite Geometries Convex Analysis

General & Algebraic Topology Linear Operators Viscous Flow Theory Perturbation Theory Number Theory

Foundatio~s of Modem Differential Geometry Mathemaucal Physiology Astrophysical Applications of Magnetohydrodynamics Introduction to Optimization Generalised Linear Models Analysis of Categorical Data

Demography and Survival Analysis Statistical Consulting Advanced Operating System Artificial Intelligence Computer Graphics

Concurrency, Complexity and VLSI

664197 694105 694101 694102 694104 680101 680103 680108 680110 680113 680117 680118

Formal Semantics of Programming Languages Software Engineering

Software-Oriented Computer Architecture

73

Computer Numbers must be shown on enrolment and course variation forms in the following manner. Candidates wishing to enrol in any subject not listed should consult the Faculty Secretary.

MASTER OF MEDICAL STATISTICS AND DIPLOMA IN MEDICAL STATISTICS SUBJECTS

Computer Number

690101 690102 690103 690119 690106 690107 690108 690109 690110 690111

690112 690113 850007 850008 850009 850010 850011 850022 850023 850004 680114 680112 680106 440123 440124 690116 690117 690118

74

Subject Name

ANALYSIS OF CATEGORICAL DATA APPLIED STATISTICS DEMOGRAPHY AND SURVIVAL ANALYSIS GENERALISED LINEAR MODELS PROBABILITY AND STATISTICS PROJECT - 1 unit PROJECT - 2 units PROJECT - 3 units PROJECT - 4 units RANDOM PROCESSES AND SIMULATION

STATISTICAL CONSULTING SURVEY SAMPLING METHODS MS - EPIDEMIOLOGIC METHODS MS - STUDY DESIGN MS - HEALTH CARE EV ALUA TION MS - BEHAVIOURAL CHANGE MS - ASSESSING HEALTH PROBLEMS MS - BIOSTATISTICS I MS - BIOSTATISTICS II MS - POPULATION RESEARCH SEMINAR INTRODUCTION TO PROGRAMMING DATA STRUCTURES AND ALGORITHMS COMPARATIVE PROGRAMMING LANGUAGES SYSTEMS ANALYSIS SYSTEMS DESIGN DESIGN AND ANALYSIS OF EXPERIMENTS STATISTICAL INFERENCE TIME SERIES ANALYSIS

THE UNIVERSITY OF NEWCASTLE CAMPUS MAP

SR'fE GUIDE by BUILDING NUMBER

A

AN AS IB C CIB CC CG 10 E EA EB

EC ED

EE

Ef EG ES G Grl in

J K l M

IN P Q

R

McMuiihl Administration - Arts Student Services - Cashier Computing Centre - EEO Community Programmes Centtni Animal House Centra! Animal Store Lecture Theatre 1301 Geology Commonwealth Bank Child Care Centre (Kintaiba) Central Garage Physics Lecture Theatre EOl Engineering Administration Chemical & Materials Engineering Mechanical Engineering Civil Engineering & Surveying Electrical & Computer Engineering Engineering Classrooms Bulk Solids Engineering Engineering Science Chemistry Great Hall Basden Theatre HOl Medical Sciences Lecture Theatre K202 Biological Sciences Medical Sciences

Library Materials

Engineering Arcbitecture Drama Theatre Drama Studio Social Sciences Geography - Drama

Social Sciences Commerce - Economics Law - Management

S 18 Post Office S C Auchmuty Sports Centre S H Shllff House S P Sports Pavilion

Squash COIlrtS - Oval No.2 T A TumaAl1llexe T B Temporary Buildings

Careers & Student Employment Chaplains - Sport & Recreation Srudent Accommodation

T C Tennis Courts T H The Hunter Technology

Development Centre U Union V Mathematics

Computer Science - Statistics Radio station 2NUR-FM

W Behavioural Sciences Education - Psychology Sociology

EDW ARDS HALL Administration & Dining BurneU House

House Convocation House Cutler House Friends House HOllse "S" Wardens Residence

HA HB HZ !-IX HC HIF WR WR

ALPHABETICAL LOCATION GUIDE

Administration in McMullin Animal House-Central Arts in McMullin AnhHecture Basden Theatre HOl Behavioural Sciences Biological Sciences BOI Lecture Theatre Bulk Solids Engineering Cllreers & Student Employment in Temporary Buildings Cllshier in McMullin Central Garage

A AN A N H W J B EG

TB A CG

Materials Engineering in Chemical & Materials Engineering M Chemistry G Chaplains in Temporary Buildings Chemiclil & Materials Engineering Child Care Centre (Kin taiba) Civil Engineering & 31lneying Commerce in Social Sciences Commonwealth Bank Community Programmes ill McMullin Computer Science in Mathematics Computing Centre in McMullin Drama in Social Sciences Drama Studio Drama Theatre Economics ill Social Sciences Education ill Behavioural Sciences EEO ill McMullin

TEl

EB CC

ED S CEl

A

v

A R Q p S

W A

Electrical & Computer Engineering Engineering Administration Engineering Classrooms Engineering Science EO! Lecture Theatre Geography in Social Sciences Geology Great Hall K202 Medical Sciences Lecture Theatre Law in Social Sciences Library-Auc!llmnty McMullin Management ill Social Sciences Mathematics Mecbanical Engineering Medica! Sciences Physics Post Office Psychology ill Social Sciences Radio Station 2NUR·FM in Mathematics Sociology in Social Sciences Sports Centre-Allchmuty Sports Pavilion Sport & Recreation in Temporary Bllildillgs Squasll Courts ill Sports Pavilion Staff House Statistics ill Mathematics Student Accommodation in Temporary Bllildings Stuoellt Services in McMullin The Hunter Technology Development Centre Temporary Buildings Tennis Courts Tunra Annen Union

INDEX

EE EA EF ES E R C GH

I S l A S V EC K 10 SEl W

V W SC SP

T8

SF' SH V

f8

A

TH T8 TC TA U