Note: This is an archived Handbook entry from 2015.
|Dates & Locations:|| |
This subject has the following teaching availabilities in 2015:Semester 2, Parkville - Taught on campus.
Timetable can be viewed here. For information about these dates, click here.
|Time Commitment:||Contact Hours: 48 hours |
Total Time Commitment:
Study Period Commencement:
COMP20004 Discrete Structures (prior to 2014)
|Recommended Background Knowledge:|| |
Proficiency in discrete mathematics and propositional logic.
|Non Allowed Subjects:||
433-330 Theory of 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
CoordinatorAssoc Prof Tony Wirth
At the heart of theoretical computer science are questions of both philosophical and practical importance. What does it mean for a problem to be solvable by computer? What are the limits of computability? Which types of problems can be solved efficiently? What are our options in the face of intractability? This subject covers such questions in the content of a wide-ranging exploration of the nexus between logic, complexity and algorithms, and examines many important (and sometimes surprising) results about the nature of computing.
Example of assignment
INTENDED LEARNING OUTCOMES (ILO)
On completion of this subject the student is expected to:
Hurdle Requirement: To pass the subject, students must obtain at least:
Assessment addresses all Intended Learning Outcomes (ILOs)
|Prescribed Texts:|| |
Michael Sipser, "Introduction to the Theory of Computation", 3rd Edition.
|Breadth Options:|| |
This subject is not available as a breadth subject.
|Fees Information:||Subject EFTSL, Level, Discipline & Census Date|
On completion of this subject, students should have developed the following skills:
Master of Information Technology |
Master of Information Technology
Master of Philosophy - Engineering
Master of Science (Computer Science)
MIT Computing Specialisation |
MIT Distributed Computing Specialisation
MIT Health Specialisation
MIT Spatial Specialisation
Master of Engineering (Software with Business)
Master of Engineering (Software)
Download PDF version.