School of Computing · ANU College of Systems and Society
This course is the first of three core computer science courses on programming. It introduces students to the field of computer science as a discipline for solving problems through computation and provides the foundation for more advanced courses on programming and software development. 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. 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. The functional paradigm demonstrates elegant solutions to many programming problems. The course also introduces students to standard productivity tools for software development that will be used throughout the course and remainder of the computer science degree. These include distributed software revision control systems. The Advanced version of this course covers these topics in more depth, allowing students to deepen their understanding and experience.
Assignments
Learning outcomes 1, 2, 3, 4, 5, 6
Lab Assessment
Learning outcomes 1, 2, 3, 4, 5, 6
Mid-term quiz (hurdle)
Learning outcomes 1, 2, 3
Final Exam (hurdle)
Learning outcomes 1, 2, 3, 4, 5, 6
Lectures, tutorial/laboratory sessions and self study to work through the material, prepare for labs, and complete assignments to reach a total of 130 hours.
Simon Thompson , Haskell: The Craft of Functional Programming — third edition, 2011, Addison Wesley Preliminary Reading There are additional materials (including errata and useful links) at the textbook Web-site.