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.
Minimum total expected workload equals 12 hours per week comprising:
(a.) Contact hours for on-campus students:
(b.) Additional requirements (all students):
Students will be expected to spend a total of 12 hours per week during semester on this unit as follows:
CSE2304, FIT2009
One of FIT1008, FIT1015 or CSE1303 and 6 points of Level 1 mathematics.
Arun Konagurthu
Consultation hours: TBA in week 1 S1/2014
Anuja Dharmaratne
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 the Student Evaluation of Teaching and Units (SETU) survey. 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, see:
www.monash.edu.au/about/monash-directions/ and on student evaluations, see: www.policy.monash.edu/policy-bank/academic/education/quality/student-evaluation-policy.html
Student feedback has informed a substantive revision to the unit that includes reorienting the content to be supported by a single principal text book and reorganisation to improve the incremental progression of unit content.
If you wish to view how previous students rated this unit, please go to
https://emuapps.monash.edu.au/unitevaluations/index.jsp
| Week | Activities | Assessment |
|---|---|---|
| 0 | Revise concepts learnt in FIT1029 (Dynamic Programming, Divide-Conquer, sorting, Recursion, Invariants, Trees etc.) | No formal assessment or activities are undertaken in week 0 |
| 1 | Introduction Abstract Data Types, Mathematics, Logic, Grammar, Lists and Trees | |
| 2 | Verification, Correctness, Logic, Program Termination and Simple sorts | Non assessed 3hr lab |
| 3 | Introduction to Heaps, priority queues, recursive sorts | Non assessed 1hr tute + 2hr lab |
| 4 | Dynamic Programming Paradigm, Divide and Conquer paradigm using Edit Distance variants (Hirschberg and Ukkonen) | Assignment 1 due (Assessed 3hr lab) |
| 5 | Searching, Hashing and Lookup structures | Non assessed 1hr tute + 2hr lab |
| 6 | Tables, Tries, Radix tree, B-tree etc. | Assignment 2 due (Assessed 3hr lab) |
| 7 | Searching and pattern matching in strings | Non assessed 1hr tute + 2hr lab |
| 8 | Graph algorithms and path problems | Assignment 3 due (Assessed 3hr lab) |
| 9 | Flow Problems and Complexity | Non assessed 1hr tute + 2hr lab |
| 10 | Suffix trees and Suffix arrays | Assignment 4 due (Assessed 3hr lab) |
| 11 | Recursion (Linear, binary, n-ary) | Non assessed 1hr tute + 2hr lab |
| 12 | Summing up design priniciples and useful algorithmic strategies | Assignment 5 due (Assessed 3hr lab) |
| SWOT VAC | No formal assessment is undertaken in SWOT VAC | |
| Examination period | LINK to Assessment Policy: http://policy.monash.edu.au/policy-bank/ academic/education/assessment/ assessment-in-coursework-policy.html |
*Unit Schedule details will be maintained and communicated to you via your learning system.
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 |
Faculty Policy - Unit Assessment Hurdles (http://intranet.monash.edu.au/infotech/resources/staff/edgov/policies/assessment-examinations/assessment-hurdles.html)
Academic Integrity - Please see resources and tutorials at http://www.monash.edu/library/skills/resources/tutorials/academic-integrity/
Main reading:
Additional reading (chapters to be specified clearly in the lecture slides as the course progresses):
Monash Library Unit Reading List (if applicable to the unit)
http://readinglists.lib.monash.edu/index.html
Faculty of Information Technology Style Guide
Examination/other end-of-semester assessment feedback may take the form of feedback classes, provision of sample answers or other group feedback after official results have been published. Please check with your lecturer on the feedback provided and take advantage of this prior to requesting individual consultations with staff. If your unit has an examination, you may request to view your examination script booklet, see http://intranet.monash.edu.au/infotech/resources/students/procedures/request-to-view-exam-scripts.html
Types of feedback you can expect to receive in this unit are:
Submission must be made by the due date otherwise penalties will be enforced.
You must negotiate any extensions formally with your campus unit leader via the in-semester special consideration process: http://www.monash.edu.au/exams/special-consideration.html
It is a University requirement (http://www.policy.monash.edu/policy-bank/academic/education/conduct/student-academic-integrity-managing-plagiarism-collusion-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). Please note that it is your responsibility to retain copies of your assessments.
If Electronic Submission has been approved for your unit, please submit your work via the learning system for this unit, which you can access via links in the my.monash portal.
Please check with your lecturer before purchasing any Required Resources. Limited copies of prescribed texts are available for you to borrow in the library, and prescribed software is available in student labs.
Limited copies of prescribed texts are available for you to borrow in the library.
Mark Allen Weiss. (2012). Data Structures and Algorithm Analysis in Java. (3rd Edition) Pearson (ISBN: 9780132576277).
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. (2009). Introduction to Algorithms. (3rd) MIT Press.
Donald Knuth. (1997). The Art of Computer Programming. () Addison Wesley.
Closed book. No calculators.
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: www.policy.monash.edu.au/policy-bank/academic/education/index.html
Key educational policies include:
Important student resources including Faculty policies are located at http://intranet.monash.edu.au/infotech/resources/students/
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 http://www.monash.edu.au/students. For Malaysia 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, resources and programs that enable you to save time and be more effective in your learning and research. Go to www.lib.monash.edu.au or the library tab in my.monash portal for more information. At Malaysia, visit the Library and Learning Commons at http://www.lib.monash.edu.my/. At South Africa visit http://www.lib.monash.ac.za/.