Courses Handbook 2007 - [ Archived ]

310122 (v.1) Discrete Structures 102


Area:

Department of Mathematics and Statistics

Credits:

25.0

Contact Hours:

4.0
 
** The tuition pattern below provides details of the types of classes and their duration. This is to be used as a guide only. For more precise information please check your unit outline. **
 

Lecture:

1 x 3 Hours Weekly

Tutorial:

1 x 1 Hours Weekly
 

Syllabus:

Number Theory, Euclid's Algorithm, Chinese Remainder Theorem, cryptography, RSA, matrices, graphs and trees, traversal structures, spanning trees, computational complexity, computability, countability and uncountability, P and NP.
 
** To ensure that the most up-to-date information about unit references, texts and outcomes appears, they will be provided in your unit outline prior to commencement. **
 

Field of Education:

010100 Mathematical Sciences (Narrow Grouping)

Funding Cluster:

04 - Mathematics, Statistics

SOLT (Online) Definitions*:

Essential
*Extent to which this unit or thesis utilises online information

Result Type:

Grade/Mark

Availability

Availability Information has not been provided by the respective School or Area. Prospective students should contact the School or Area listed above for further information.

 
Curtin Search Curtin Site Index