(JOENSUU): Data Structures and Algorithms II (TRAII) (4 cr)
Code: C-10088-3621424-3006
General information
- Enrollment
- 14.10.2024 - 01.11.2024
- Registration for the implementation has ended.
- Timing
- 28.10.2024 - 11.12.2024
- Implementation has ended.
- Number of ECTS credits allocated
- 4 cr
- Local portion
- 4 cr
- Mode of delivery
- Blended learning
- Institution
- University of Eastern Finland, Itä-Suomen yliopisto, Joensuun kampus
- Teaching languages
- Finnish
- Seats
- 0 - 100
- Course
- C-10088-3621424
Evaluation scale
Five step scale
Objective
Learning outcomes: The student will know how to analyse asymptotic time complexity of algorithms, including recursive algorithms and can measure and extrapolate running real time of programs understand basic concepts of graphs, graph properties and graphs as abstract data types understand elementary graph algorithms and is able to design, implement, and analyse simple graph algorithms know elementary algorithm strategies and be able to apply those know how to use mass storage efficiently and be able to analyse running time of algorithms using mass storage
Content
Algorithms and running time analysis. Experimental time complexity analysis. Graphs, graph algorithms, and applying graph algorithms. Using mass storage efficiently
Location and time
Classroom teaching, lectures available online also, tutoring sessions
Materials
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Introduction to Algorithms, 3rd Ed. The MIT Press, 2009. Lecture notes
Teaching methods
Modes of study: Course exam ja exercises, or general exam. Lectures 26h, exercises 14h, course exam 3h, making exercises 50h, other independent learning 14h Evaluation criteria: Course exam 35%, graded exercises 35%, weekly tests 20%, other exercises 10% + bonus max 10% (attendance required for this 10+10%).
Qualifications
Data Structures and Algorithms I