Students learn the organization of programming languages using types, how programs are evaluated (reduction), functional composition, recursive functions, algebraic data types, pattern matching, parametric polymorphism, higher-order functions.
Students also gain exposure to asymptotic analysis of basic data structures, abstract data types, modules, laziness, and streams.
For additional information regarding Turnitin please visit the ANU Online website.
Thirty hours of lectures, twelve two-hour tutorial/laboratory sessions.
In order to track your progress it is necessary to setup an account and have Cookies enabled.
If you already have an account then Login, otherwise please Register – it's completely free!
Linnaeus University’s campus is located roughly 15 minutes with bicycle from the city centre.
Campus is like a small society in its own right, with the university, student accommodation and student life all in one place.
Data structures and algorithms, the key concepts at the core of computer science, receive their first treatment in this course.
The course covers functional programming in depth, developing the core idea of functions operating on data structures.