Before choosing course
In this course you will learn two very important programming paradigmns: functional programming and concurrent programming. There will be quite alot of programming during the course so be prepared to spend time infront of the computer.
You will create the image to the left by tracing some milljon light rays as they bounce around in a room. Sounds complicated but using some vector arithmetic it's easier than one might think.
Choose semester and course offering
Choose semester and course offering to see information from the correct course syllabus and course offering.
Content and learning outcomes
Course contents
The course goes through partly the programming techniques that are used in functional programming languages, partly how programmes can be divided into several executing threads and how these can be coordinated. Examples of programming techniques are recursive definitions, non-updateable data structures, functions of higher order and so called “closures”. Coordination of multiple threads is shown, partly through modification of common data structures, partly through message passing between processes.
The course will use a programming language as the main language but also show similarities and differences with other functional languages.
Intended learning outcomes
After passing the course, students should be able to:
- use recursion, pattern matching and non-modifiable data structures upon implementation in a functional programming language.
For higher grades, the student should also be able to
- use functions as first order objects and work with the functions of higher order
- explain the basics of functional programming, its structure and operational semantics
- evaluate functions with regard to time complexity
- use message based multi-threaded programming.
Course Disposition
No information inserted
Literature and preparations
Specific prerequisites
- Completed course ID1018 Programming I, or equivalent.
- Completed course component ARBA-Course work in course ID1020 Algorithms and Data Structures, or equivalent.
- Completed course IX1500/SF1610 Discrete Mathematics, or equivalent.
Recommended prerequisites
No information inserted
Equipment
No information inserted
Literature
No information inserted
Examination and completion
If the course is discontinued, students may request to be examined during the following two academic years.
Grading scale
A, B, C, D, E, FX, F
Examination
- TEN2 - Examination, 7,5 hp, betygsskala: A, B, C, D, E, FX, F
Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.
The examiner may apply another examination format when re-examining individual students.
Opportunity to complete the requirements via supplementary examination
No information inserted
Opportunity to raise an approved grade via renewed examination
No information inserted
Examiner
Ethical approach
- All members of a group are responsible for the group's work.
- In any assessment, every student shall honestly disclose any help received and sources used.
- In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.
Further information
Course web
Further information about the course can be found on the Course web at the link below. Information on the Course web will later be moved to this site.
Course web ID1019Offered by
Main field of study
Technology
Education cycle
First cycle
Add-on studies
No information inserted
Supplementary information
In this course, the EECS code of honor applies, see: http://www.kth.se/en/eecs/utbildning/hederskodex.