12332 (v.2) Foundations of Computer Science 152
| Area: | Department of Computing |
| Credits: | 25.0 |
| Contact Hours: | 3.0 |
| Lecture: | 1 x 2 Hours Weekly |
| Tutorial: | 1 x 1 Hours Weekly |
| Prerequisite(s): | 1920 (v.6) Software Technology 151 or any previous version
|
| Syllabus: | Logic, Rules of Inference, Set Theory, Proof Technology, Induction, Relations, Functions, Recursion, Graph Theory, Trees. |
| |
| Unit Outcomes: | On successful completion of this unit students will have developed skills in various methods of mathematical proof and their applications to run correctness proofs. They will have gained insight into the nature of inductive and recursive techniques by learning to analyse algorithm complexity and develop facility in analysing running times of programs, and through exploring the mathematical implications of various complex data structures such as hash tables, trees and balanced trees. |
| Text and references listed above are for your information only and current as of September 30, 2003. Please check with the unit coordinator for up-to-date information. |
| Unit References: | No prescribed references. |
| Unit Texts: | Rosen, K. H., 1999, 'Discrete Mathematics and its Applications' 4th Edition, McGraw-Hill, Boston. Course notes, available from the Department of Computing website. |
| |
| Unit Assessment Breakdown: | Quizzes 20%. Mid-term Test 20%. Final Examination 60%. A mark of at least 40% must be achieved in the final exam and the overall unit assessment must be at least 50%. |
| Year | Location | Period | Internal | Area External | Central External | | 2004 | Bentley Campus | Semester 1 | Y | | | | 2004 | Bentley Campus | Semester 2 | Y | | | |
Current as of: February 2, 2004
CRICOS provider code 00301J
