Course Catalog 2012-2013
Basic

Basic Pori International Postgraduate Open University

|Degrees|     |Study blocks|     |Courses|    

Course Catalog 2012-2013

OHJ-2016 Utilization of Data Structures, 5 cr

Person responsible

Terhi Kilamo

Lessons

Study type P1 P2 P3 P4 Summer Implementations Lecture times and places
Lectures
Excercises
Assignment
 4 h/week
 2 h/week
 35 h/per
+2 h/week
+2 h/week
+35 h/per



 



 



 
OHJ-2016 2012-01 Thursday 10 - 12, TB214

Requirements

A compulsory computer exercise, programming assignments and a final exam.
Completion parts must belong to the same implementation

Principles and baselines related to teaching and learning

-

Learning outcomes

After completing the course, the student knows the commonly used sorting algorithms and their complexity. The student can implement basic data structures (lists and trees) independently, and knows how to apply relating algorithms to them. The student is able to analyze the complexity of simple programs and knows how to use the C++ standard library sensibly.

Content

Content Core content Complementary knowledge Specialist knowledge
1. Asymptotic efficiency and complexity notations.   Understanding the logarithmic complexity of divide and conquer algorithms   More advanced complexity analysis 
2. Sorting algorithms. The difference between quadratic and O(NlogN) sorting.  Different algorithms   
3. Lists, hash tables and the binary search tree  Red-Black tree  Not as widely used data structures 
4. C++ standard library: data structures and algorithms. Choosing the best alternative. Using the suitable data structure.  Using the STl algorithms, itrator categories, special containers.  Tha standard library and programmer defined data types. 
5. Graphs. The basic idea of graph algorithms.  Breadth first search, depth first search, Dijkstra's algorithm.  Other graph algorithms. 

Evaluation criteria for the course

Passed homework assignments and the exam together define the final grade.

Assessment scale:

Numerical evaluation scale (1-5) will be used on the course

Partial passing:

Completion parts must belong to the same implementation

Study material

Type Name Author ISBN URL Edition, availability, ... Examination material Language
Book   Utilization of Data Structures   Minna Ruuska, Terhi Kilamo (compiled by)   1 84479 360 5     Available in the Juvenes bookstore      English  
Lecture slides   Utilization of Data Structures              English  

Prerequisites

Course Mandatory/Advisable Description
OHJ-1156 Programming II Mandatory    

Prerequisite relations (Requires logging in to POP)



Correspondence of content

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

More precise information per implementation

Implementation Description Methods of instruction Implementation
OHJ-2016 2012-01        

Last modified23.02.2012