This unit introduces students to problem solving concepts and techniques fundamental to the science of programming. In doing this it covers problem specification, algorithmic design, analysis and implementation. Detailed topics include analysis of best, average and worst-case time and space complexity; introduction to numerical algorithms; recursion; advanced data structures such as heaps and B-trees; hashing; sorting algorithms; searching algorithms; graph algorithms; and numerical computing.
2 hrs lectures/wk, 3 hr laboratory/fortnight, 1 hr tutorial/fortnight
Students will be expected to spend a total of 12 hours per week during semester on this unit as follows:
One of FIT1008, FIT1015 or CSE1303 and 6 points of Level 1 mathematics.
Loke Kar Seng
Examination (3 hours): 70%; In-semester assessment: 30%
|Assessment Task||Value||Due Date|
|Assignment 1||6 %||Week 4|
|Assignment 2||6 %||Week 6|
|Assignment 3||6 %||Week 8|
|Assignment 4||6 %||Week 10|
|Assignment 5||6 %||Week 12|
|Examination 1||70%||To be advised|
Monash is committed to excellence in education and regularly seeks feedback from students, employers and staff. One of the key formal ways students have to provide feedback is through SETU, Student Evaluation of Teacher and Unit. The University's student evaluation policy requires that every unit is evaluated each year. Students are strongly encouraged to complete the surveys. The feedback is anonymous and provides the Faculty with evidence of aspects that students are satisfied and areas for improvement.
For more information on Monash's educational strategy, and on student evaluations, see:
If you wish to view how previous students rated this unit, please go to
Please check with your lecturer before purchasing any Required Resources. Prescribed texts are available for you to borrow in the library, and prescribed software is available in student labs.
Prescribed texts are available for you to borrow in the library.
Mark Allen Weiss. (2012). Data Structures and Algorithm Analysis in Java. (3rd) Pearson (ISBN: 9780132576277).
Michael T. Goodrich and Roberto Tamassia. (2010). Data Structures and Algorithms in Java. (5th) Wiley (ISBN: 978-0-470-38326-1).
Closed book. No calculators.
|0||No formal assessment or activities are undertaken in week 0|
|1||Overview and Revision of Required Concepts|
|4||Trees II||Assignment 1|
|6||Disjoint Sets||Assignment 2|
|7||Graphs and Graph Search|
|8||Path Problems||Assignment 3|
|9||Flow Problems and Minimum Spanning Trees|
|10||Algorithm Design I||Assignment 4|
|11||Algorithm Design II|
|12||Selected Topics||Assignment 5|
|SWOT VAC||No formal assessment is undertaken SWOT VAC|
|Examination period||LINK to Assessment Policy: http://policy.monash.edu.au/policy-bank/
*Unit Schedule details will be maintained and communicated to you via your MUSO (Blackboard or Moodle) learning system.
Faculty Policy - Unit Assessment Hurdles (http://www.infotech.monash.edu.au/resources/staff/edgov/policies/assessment-examinations/unit-assessment-hurdles.html)
It is a University requirement (http://www.policy.monash.edu/policy-bank/academic/education/conduct/plagiarism-procedures.html) for students to submit an assignment coversheet for each assessment item. Faculty Assignment coversheets can be found at http://www.infotech.monash.edu.au/resources/student/forms/. Please check with your Lecturer on the submission method for your assignment coversheet (e.g. attach a file to the online assignment submission, hand-in a hard copy, or use an online quiz).
You must negotiate any extensions formally with your campus unit leader via the in-semester special consideration process: http://www.infotech.monash.edu.au/resources/student/equity/special-consideration.html.
Monash has educational policies, procedures and guidelines, which are designed to ensure that staff and students are aware of the University's academic standards, and to provide advice on how they might uphold them.
You can find Monash's Education Policies at:
Key educational policies include:
The University provides many different kinds of support services for you. Contact your tutor if you need advice and see the range of services available at www.monash.edu.au/students. For Sunway see http://www.monash.edu.my/Student-services, and for South Africa see http://www.monash.ac.za/current/
The Monash University Library provides a range of services and resources that enable you to save time and be more effective in your learning and research. Go to http://www.lib.monash.edu.au or the library tab in my.monash portal for more information. At Sunway, visit the Library and Learning Commons at http://www.lib.monash.edu.my/. At South Africa visit http://www.lib.monash.ac.za/.
Academic support services may be available for students who have a disability or medical condition. Registration with the Disability Liaison Unit is required. Further information is available as follows:
Mark Allen Weiss:
Data Structures and Algorithm Analysis in Java. 3rd ed
Michael Goodrich and Roberto Tamassia.
Data Structures and Algorithms in Java, 3rd ed
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. Introduction to Algorithms, 2nd Edition, EHT MIT Press & McGraw Hill
Duane Bailey. Java Structures: Data Structures in Java for the Principled Programmer. International Edition, May 1999, Mc Graw Hill. This book is available for free online at http://www.cs.williams.edu/~bailey/JavaStructures/Welcome.html