Link to Curtin homepage      CurtinSearch | Curtin Site Index 
Online handbook 2004
CoursesUnitsNew CoursesJoint Uni CoursesDefinition of TermsContact / Help
About Curtin University
Academic calendar
Admissions Information
Applying for a research higher degree
Applying to Curtin
Bookshop
Prospective student service
Curtin scholarships
Enrolment information
Fee Information
Grading system
IT Policy
Student rights and responsibilities
Student policy and procedures
    

12333 (v.4) Design and Analysis of Algorithms 251


 

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):

1922 (v.6) Software Technology 152 or any previous version

Syllabus:

Maths revision and Big-O. Divide and Conquer. Quick-sort and Mergesort. Priority Queues - Heaps and Leftist Trees. Sorting. Graphs-DFS and BFS. PQs and Heapsort. Greedy Algorithms - MCST and Shortest Path Graphs. Data Compression. String Searching. Dynamic Programming. Matrix chain. LCS. Parallel and Distributed Algorithms. Knapsack
 

Unit Outcomes:

On successful completion of this unit, the student will be able to cast problems in algorithmic terms, identify efficient algorithms to solve problems, construct their own algorithms to solve problems and analyse algorithms to determine resource requirements.

Texts and references listed below are for your information only and current as of September 30, 2003. Some units taught offshore are modified at selected locations. Please check with the unit coordinator for up-to-date information and approved offshore variations to unit information before finalising study and textbook purchases.

Unit References:

Sahni, S., 2000, 'Data Structures, Algorithms, and Applications in Java', McGraw-Hill, Cambridge.

Unit Texts:

Corman, T. H. et al, 2001, 'Introduction to Algorithms', MIT Press, Cambridge.
 

Unit Assessment Breakdown:

Test One 15%. Test Two 15%. Assignment 15%. Final examination 55%. To pass this unit students must achieve 50% in the exam and 50% overall.

Field of Education:

 31300 Electrical and Electronic Engineering and Technology (Narrow Grouping)

HECS Band (if applicable):

2  

Extent to which this unit or thesis utilises online information:

 Informational  

Result Type:

 Grade/Mark


Availability

YearLocationPeriodInternalArea ExternalCentral External
2004Bentley CampusSemester 1Y  

Area
External
refers to external course/units run by the School or Department, offered online or through Web CT, or offered by research.
Central
External
refers to external course/units run through the Curtin Bentley-based Distance Education Area

 
Click here for a printable version of this page

    

Picture of sun setting over Henderson Court on Curtin's Bentley Campus

 

Curtin crest