Discrete Structures
Subject 433-295 (2009)
Note: This is an archived Handbook entry from 2009. Search for this in the current handbook
Credit Points: | 12.50 | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Level: | 2 (Undergraduate) | ||||||||||||
Dates & Locations: | This subject has the following teaching availabilities in 2009: Semester 2, - Taught on campus.
On campus Timetable can be viewed here. For information about these dates, click here. | ||||||||||||
Time Commitment: | Contact Hours: 2 one-hour lectures; 1 two-hour workshop (per week) Total Time Commitment: 120 hours | ||||||||||||
Prerequisites: | One first year mathematics subject (12.5 points). | ||||||||||||
Corequisites: | None | ||||||||||||
Recommended Background Knowledge: | None | ||||||||||||
Non Allowed Subjects: | 433-255 Logic and Computation | ||||||||||||
Core Participation Requirements: |
For the purposes of considering request for Reasonable Adjustments under the Disability Standards for Education (Cwth 2005), and Student Support and Engagement Policy, academic requirements for this subject are articulated in the Subject Overview, Learning Outcomes, Assessment and Generic Skills sections of this entry. It is University policy to take all reasonable steps to minimise the impact of disability upon academic study, and reasonable adjustments will be made to enhance a student's participation in the University's programs. Students who feel their disability may impact on meeting the requirements of this subject are encouraged to discuss this matter with a Faculty Student Adviser and Student Equity and Disability Support: http://services.unimelb.edu.au/disability |
Coordinator
Assoc Prof Harald Christian SondergaardSubject Overview: | Formal logic and discrete mathematics provide the theoretical foundations for computer science. This subject is an introduction to the science of computing. It provides a grounding in the theories of logic, automata and formal languages, providing concepts that underpin virtually all the practical tools contributed by the discipline, for automated storage, retrieval, manipulation and communication of data. Topics include: sets, functions, relations, and combinatorics; propositional and predicate logic; proof principles; induction and recursion, well-ordering; regular languages, finite-state automata, context-free grammars and languages, pumping lemmas, parsing. |
---|---|
Objectives: | On successful completion of the subject, students should be able to:
|
Assessment: | Project work during the semester, expected to take about 24 hours (20%); two homework sets, one during each half of the semester, expected to take 8 hours each (20%); and a 2-hour end-of-semester written examination (60%). To pass the subject, students must obtain at least 50% overall, and at least 30/60 in the written examination. |
Prescribed Texts: | K. Doets and J. van Eijck. The Haskell Road to Logic, Maths and Programming. King's College Publ., 2004. |
Recommended Texts: | M. Sipser. Introduction to the Theory of Computation. Thomson Course Technology, second edition, 2006. |
Breadth Options: | This subject potentially can be taken as a breadth subject component for the following courses: You should visit learn more about breadth subjects and read the breadth requirements for your degree, and should discuss your choice with your student adviser, before deciding on your subjects. |
Fees Information: | Subject EFTSL, Level, Discipline & Census Date |
Generic Skills: |
On completion of the subject students should have developed the:
|
Notes: |
This subject is available as breadth in the following Bachelors courses: Arts, Commerce, Environments and Music. Students taking this subject will be expected to regularly access an internet-enabled computer. This subject is available for science credit to students enrolled in the BSc (both pre-2008 and new degrees), BASc or a combined BSc course. |
Related Course(s): |
Bachelor of Computer Science Bachelor of Engineering Bachelor of Engineering (Biomedical)Bioinformatics Bachelor of Engineering (Electrical Engineering)/Bachelor of Science |
Download PDF version.