TIE-20106 Data Structures and Algorithms, 5 cr

Person responsible

Matti Rintala

Lessons

Implementation Period Person responsible Requirements
TIE-20106 2019-01 3 - 4 Matti Rintala
The course grade is formed from points, which are earned from weekly excercises, lectures, lecture essays, online visualization assignments, and programming assignments. A minimum number of points have to be earned from each part. In addition to this, students have to pass the exam.

Learning Outcomes

After completing the course, the student knows the commonly used algorithm design techniques. The student can implement basic data structures independently, and knows how to apply related algorithms to them. The student is able to analyze the asymptotic complexity of simple programs and knows how to use library implementations to build more complex data structures.

Study material

Type Name Author ISBN URL Additional information Examination material
Book   Introduction to Algorithms   Cormen, Leiserson, Rivest, Stein   9780262033848       No   
Book   Introduction to the Desing & Analysis of Algorithms. 2nd ed.   Anany Levitin   321358287       No   
Lecture slides   Data structures and algorithms           Yes   

Prerequisites

Course Mandatory/Advisable Description
TIE-02207 Programming 2: Basics Mandatory    
TIE-02408 Programming 3: Techniques Advisable    

Additional information about prerequisites
Students are expected to be programming literate. Programming knowledge on C++ is required (level of knowledge should be comparable to course Basic course on Programming).



Correspondence of content

Course Corresponds course  Description 
TIE-20106 Data Structures and Algorithms, 5 cr TIE-20100 Data Structures and Algorithms, 5 cr  
TIE-20106 Data Structures and Algorithms, 5 cr OHJ-2016 Utilization of Data Structures, 5 cr  

Updated by: Kunnari Jaana, 05.03.2019