Leader: Ken Harris
Gippsland Second semester 2005 (Day)
Gippsland Second semester 2005 (OCL)
Synopsis: Application and implementation of some common data structures: stacks, queues, lists, priority queues, tables, sets and collections. Data representations including: arrays, linked lists, heaps, trees (including balanced trees) and hashing. Design of application programs making use of common data structures. Design and implementation of new data structures. Study of advanced algorithms in areas such as: graph theory, pattern searching and data compression. Access to the University's computer systems through an Internet service provider is compulsory for off-campus students.
Assessment: Assignments 40% and Examination 60%
Contact Hours: 2 hours Lecture and 2 hours Tutorials