Year:
COMP518 Programming Languages for Artificial Intelligence
Updated: 02 November 2009| Credit Points | 6 | ||||||||||||||||||||||||
| Offering |
|
||||||||||||||||||||||||
| Intensive School(s) | None | ||||||||||||||||||||||||
| Supervised Exam | There is a UNE Supervised Examination held at the end of the teaching period in which you are enrolled. | ||||||||||||||||||||||||
| Pre-requisites | candidature in a postgraduate award | ||||||||||||||||||||||||
| Co-requisites | None | ||||||||||||||||||||||||
| Restrictions | COMP318 or COMP506 | ||||||||||||||||||||||||
| Notes | None | ||||||||||||||||||||||||
| Combined Units |
COMP318 - Programming Languages for Artificial Intelligence |
||||||||||||||||||||||||
| Coordinator(s) | Ioan Despi (idespi@une.edu.au) | ||||||||||||||||||||||||
| Unit Description |
This unit covers non-procedural languages - SCHEME and PROLOG. SCHEME is a functional programming language. PROLOG is a logic programming language. Topics included in the SCHEME section are: basic list processing functions; conditionals; recursions; and high order functions. Topics included in the PROLOG section are: data structures, recursions; backtracking and cut; practical programming style; debugging; improving efficiency; and operations on trees. |
||||||||||||||||||||||||
| Materials | Text information will be published prior to commencement of the teaching period. | ||||||||||||||||||||||||
| Disclaimer | Offer of some subjects is subject to viability. Information in these unit descriptions is subject to change prior to commencement of semester. |