Handbook 1996 : Faculty of Science (Volume 4 page 211)
Mathematics subject : Next:618-252 | Prev:618-242 | Search | Help

618-251 "Discrete Mathematics" appears differently in several places - choose the one you want:

1. 618-251 Mathematics, Faculty of Science.
2. 618-251 Math. & Stats., Faculty of Educ(Parkville).

1. Mathematics, Faculty of Science (v4, p211) : Next:618-252 | Prev:618-242

618-251 Discrete Mathematics

Note: Students may not gain credit for more than one of 618-251, 618-131 (1996 Handbook) 618-141 (1995 Handbook), and the Mathematical Sciences subject 617-170 Discrete Mathematics and Statistics taught in previous years.

Credit points: 12

Coordinator: Professor C F Miller.

Prerequisite: One of 618-102 (1995 Handbook), 618-112, 618-122, 618-200, 618-211.

Contact: 39 lectures (three a week)

Timetable: First semester

Objectives:

On completion of this subject, students should:

Comprehend:

• the notion of validity of a mathematical formula
• the concept of a mathematical proof
• the principle of mathematical induction
• the use of logical notation
• countability and uncountability

Have developed:

• skills and experience in using the language of sets, functions and relations
• skills in counting and combinatorics
• elementary skills in analysing graphs
• the ability to prove simple theorems properly
• skills in proving results by mathematical induction.

Appreciate:

• the need for mathematical rigour
• the variety of applications of discrete mathematical techniques

Content:

The natural numbers: well-ordering, forms of mathematical induction, division algorithm, greatest common divisor, prime factorization, recursion. Combinatorics: graphs and trees, paths, cycles, counting principles. Logic: logical notation, propositional connectives, quantifiers, truth tables, logical validity, counter-examples, methods of proof. Set theory: sets and set operations, functions, relations, orderings, equivalence relations and partitions, cardinality, countable and uncountable sets. Additional topics selected from: difference equations, generating functions, graph theory.

Assessment:

Up to 26 pages of written assignments and up to three hours of end-of-semester written examination.

1. Mathematics, Faculty of Science (v4, p211) : Next:618-252 | Prev:618-242

2. Math. & Stats., Faculty of Educ(Parkville) (v5, p147) : Next:618-252 | Prev:618-242

618-251 Discrete Mathematics

Note: Students may not gain credit for more than one of 618-251, 618-131 (1996 Handbook) 618-141 (1995 Handbook), and the Mathematical Sciences subject 617-170 Discrete Mathematics and Statistics taught in previous years.

Credit points: 12.0

Coordinator: Professor C F Miller.

Prerequisite: One of 618-102 (1995 Handbook), 618-112, 618-122, 618-200, 618-211.

Contact: 39 lectures (three each week)

Timetable: First semester.

Objectives:

On completion of this subject, students should:

Comprehend:

• the notion of validity of a mathematical formula;
• the concept of a mathematical proof;
• the principle of mathematical induction;
• the use of logical notation;
• countability and uncountability.

Have developed:

• skills and experience in using the language of sets, functions and relations;
• skills in counting and combinatorics;
• elementary skills in analysing graphs;
• the ability to prove simple theorems properly;
• skills in proving results by mathematical induction.

Appreciate:

• the need for mathematical rigour;
• the variety of applications of discrete mathematical techniques.

Content:

The natural numbers Well-ordering, forms of mathematical induction, division algorithm, greatest common divisor, prime factorization, recursion. Combinatorics Graphs and trees, paths, cycles, counting principles. Logic Logical notation, propositional connectives, quantifiers, truth tables, logical validity, counter-examples, methods of proof. Set theory Sets and set operations, functions, relations, orderings, equivalence relations and partitions, cardinality, countable and uncountable sets. Additional topics selected from: Difference equations, generating functions, graph theory.

Assessment:

Up to 26 pages of written assignments and up to three hours of end-of-semester written examination.

* Note that CONTACT, CONTENT, OBJECTIVES, POINTS differs from the maintainer's version above. A log of variations is available.

2. Math. & Stats., Faculty of Educ(Parkville) (v5, p147) : Next:618-252 | Prev:618-242

Up to navigation aids

Status:          Official 1996
Date created:    Oct  9 1995
Last modified:   Oct  9 1995
Authorised by:   Academic Registrar
Email enquiries: Course_Information@registrar.unimelb.edu.au

Copyright © University of Melbourne 1995,1996.