Table of Contents
|
This course is mandatory for BSc Computer Science.
Students of other curricula may choose this course.
Team
- Lecture: Prof. Dr. Ralf Lämmel
- Lab: Andrei Varanovich
- Hiwis: Philipp Schuster and Tim Budweg
Synopsis and format
See the official (timeless) synopsis for this module in the curriculum. The following text is closely tied to the specific edition. See the general course site for additional material, e.g., pointers to applicable textbooks for those interested. The course introduces the functional programming paradigm with the Haskell programming language as the primary language throughout the course. Short excursions to other representatives of the functional programming paradigm may be undertaken. The course covers basics of functional programming (functions, datatypes, list processing, higher-order functions, etc.), functional design of data structures and algorithms, more advanced, mathematically influenced concepts (such as monoids, monads, and functors), selected programming techniques around data processing (e.g., generic programming) and basic software engineering methods for functional programs (e.g., documentation, testing, and packaging). The course is heavily sample- and wiki-based while the chrestomathy of the 101companies:Project provides many of the underlying resources. Links to extra resources such as Wikipedia, the Haskell wiki, and online textbooks are provided systematically.
Links
Exam
Resit
2 December, 9.00-10.00am, Room K 101
(Be there at 8.45am so that we can start on time.)
Final
- 19 July, 12:15pm-1:15pm, M 201.
- KLIPS-based registration required; in preparation.
- Dry-run exam: solved.pdf; unsolved.pdf.
- Final: solved.pdf; unsolved.pdf.
Lectures
See lecture dates, times, and places on KLIPS.
See lecture topics and material on 101wiki.
Labs
- 25.04.2013: Technology setup and issue of first assignment
- 02.05.2013: Discussion of completed assignment and issue of next assignment
- 16.05.2013: Discussion of completed assignment and issue of next assignment
- 06.06.2013: Discussion of completed assignment and issue of next assignment
- 13.06.2013: Discussion of completed assignment and issue of next assignment
- 20.06.2013: Discussion of completed assignment and issue of next assignment
- 27.06.2013: Discussion of completed assignment and issue of next assignment
- 04.07.2013: Discussion of completed assignment and issue of last assignment
- 11.07.2013: Discussion of completed assignment
- 18.07.2013: Exam preparation (consultation)
Assignments
The assignments are designed to help understand all material covered in the lecture. Also, the assignments support effective preparation for the exam. Issued assignments may be discussed briefly in the lecture or the lab. Completed assignments are discussed in detail in the lab. Students may be asked to present their solutions. There are student assistants who check submitted solutions. Each student has a folder at https://svn.uni-koblenz.de/fp/main/fp13/students/<insert your Benutzerkennung here> . Each assignment consists of one or more options represented by an incomplete source file. These files are pushed to the student folders on the date of issue and have to be completed and committed by the deadline (End of Day). If there are multiple options for an assignment your score will be the maximum of your scores for each of the individual options.
No. | Date of issue | Deadline |
---|---|---|
1 | 25.04.2013 | 01.05.2013 |
2 | 02.05.2013 | 15.05.2013 |
3 | 16.05.2013 | 29.05.2013 |
4 | 30.05.2013 | 05.06.2013 |
5 | 06.06.2013 | 12.06.2013 |
6 | 15.06.2013 | freebie |
7 | 20.06.2013 | 26.06.2013 |
8 | 27.06.2013 | 03.07.2013 |
9 | 04.07.2013 | 10.07.2013 |
Exam admission rules
Students need to pass homework assignments as follows:
- Students submit individual submissions for the assignments.
- Submission must arrive by the deadline (End of Day). Late submissions are not graded.
- 6 submissions need to receive a score 1 or better.
- 4 submissions need to receive a score 2.
- Each student presents at least twice successfully in the lab.
- Students need to register for exam via KLIPS.
Scores: Missing or late submissions receive score 0. Submissions which are essentially correct, modulo smaller problems, receive score 2. Submissions which show the beginning of a solution in a proper manner but are non-trivially incorrect or incomplete receive score 1. Extra requirements for the solution (regarding conventions, best practices, testing etc.) are communicated by the teaching staff and they need to be satisfied by successful solutions. In fact, automated testing (based on public and additional test cases) will be used to grade exams.