1922 (v.6) Software Technology 152

---

 

Area:	Department of Computing
Credits:	25.0
Contact Hours:	7.0
Lecture:	1 x 2 Hours Weekly
Tutorial:	3 x 1 Hours Weekly
Practical:	1 x 2 Hours Weekly
Prerequisite(s):	1920 (v.6) Software Technology 151 or any previous version
Syllabus:	Intro and OO review. File IO. Stacks, queues and lists. Recursion. Trees. Object serialisation. Advanced trees. Hash tables. Sorting. Heaps.
Unit Outcomes:	On successful completion of this unit, the student will be able to use simple and complex data structures for computer programming, understand the implementation and testing of sorting algorithms and data structures using an OO approach in the Java programming language and understand File I/O in Java.
Text and references listed above are for your information only and current as of September 30, 2003. Please check with the unit coordinator for up-to-date information.
Unit References:	Flanagan, D., 1997, Java in a Nutshell, 2nd Edition, O'Reilly and Associates, Cambridge. Lambert, K. and Osborne M., 1999, 'Java- A Framework for Programming and Problem Solving', PWS Publishing. Pacific Grove. Savitch W., 1999, 'Java - An Introduction to Computer Science and Programming', Prentice Hall, Upper Saddle River
Unit Texts:	LaFore, R., 1998, 'Data Structures and Algorithms in Java', Waite Group Press, Corte Madera.
Unit Assessment Breakdown:	News Group 10%. Mid Semester Test 10%. Prac work 10%. Final Examination 70%.In order to pass the unit a student must achieve at least 50% on the examination, and must attend and have a mark recorded for the two practical work assessments.
Year Location Period Internal Area External Central External 2004 Bentley Campus Semester 1 Y     2004 Bentley Campus Semester 2 Y