Algoritmien suunnittelu ja analysointi (6 op / 3.0 ov) |
| Abbreviation: ASA |
| Learning outcomes: - to know methods for analyzing algorighms and designing efficient algorithms
- to know some central algorithmic problems and their solutions
- to understand and be able to apply exact formulations of computational problems
- to know limitations of automated computation (non-solvability, NP completeness)
- to obtain algorithmic literacy |
| Content: The concepts of algorithm and computational complexity. Algorithm analysis and design principles, and their application on information processing tasks. |
| Learning Material: Lecture notes (in Finnish); Cormen Th., Leiserson Ch. and Rivest R.: Introduction to algorithms, The MIT Press 1990 (or 2001). |
| Degree / Programme: Computer Science |
| Teaching / Learning methods: Lectures 34 h (21%), Tutorial 16 h (10%), Independent Study 110 h (69%) |
| Teaching Languages: English |
| Conduct: Written Examination, Participation in Teaching. Details: passing by exams and solving homework exercises; alternatively by final exam alone |
| Assessment: 0 (Fail) - 5 (Excellent). Details: based of formula round(6*E + 2*H - 2,5), where E is the fraction of exam points out of the maximum, and H is the fraction of solved homework exercises out of the total. |
| Prerequisites: Data structures and algorithms, Theory of programming and computing, initial level (approbatur) mathematics |
| Organizing Department: Department of Computer Science |
| Course Director: Professor of Computer Science |
| Teachers: Prof. Pekka Kilpeläinen |
| Contact Persons: Pekka.Kilpelainen@cs.uku.fi |
| Registration for the course: through Wossikka |