13587 (v.4) Object Oriented Programming 502
Area: | School of Information Systems |
Credits: | 25.0 |
Contact Hours: | 3.0 |
Lecture: | 1 x 1 Hours Weekly |
Tutorial: | 1 x 1 Hours Weekly |
Laboratory: | 1 x 1 Hours Weekly |
Prerequisite(s): | 307775 (v.2) Introduction to Programming 501 or any previous version
|
Syllabus: | Objected Oriented Programming. Data Structures - linked lists, stacks, queues, trees and hashing. Sorting Algorithms, 3-tier application programming. |
  |
Unit Outcomes: | On successful completion of this unit students will be able to - Program in Java at an intermediate level. Write applications that can use remote or network resources. Write applications that can use remote or network resources. Write applications that interface with Network databases. Write more comprehensive programs using data structures. Choose and use appropriate sorting techniques. Program with Servlet technology in Application Development. Program with Java Server Page Technology. |
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: | Drozdek, A., (2002), Data Structures and Algorithms in Java, USA, Thompson Learning. Waite, M. and Lafore, R., (1998), Data Structures and Algorithms in Java, USA, White Group. |
Unit Texts: | Deitel, H.M., and Deitel, P.J., (2003), Java - How to Program, 5th ed., USA, Prentice Hall. |
  |
Unit Assessment Breakdown: | Application program development 20%. Examination 60%. Test 20%. This is by grade/mark assessment. |
Year | Location | Period | Internal | Area External | Central External | 2004 | Bentley Campus | Semester 2 | Y | | | |
Current as of: February 2, 2004
CRICOS provider code 00301J