|
|Tutkinnot| |Opintokokonaisuudet| |Opintojaksot| |Haku| |
OHJ-2016 UTILIZATION OF DATA STRUCTURES, 5 cr
|
Person responsible
Terhi Kilamo
Lecturers
Terhi Kilamo, lecturer, terhi.kilamo@tut.fi
Lecture room and time
Per IV,V: Wednesday 12 - 14, TB207
Per IV: Friday 12 - 14, TB207
Implementation rounds
Implementation 1
| Period 1 | Period 2 | Period 3 | Period 4 | Period 5 | Summer | Language of instruction | |
| Lecture | - | - | - | 4 h/week+ | 2 h/week | - | In English only |
| Assignment | - | - | - | 20 h/per+ | 56 h/per | - | In English only |
| Exam | In English only | ||||||
Objectives
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.
Contents
| 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. |
Requirements for completing the course
A compulsory computer exercise, programming assignments and a final exam.
Assessment criteria
Passed homework assignments and the exam together define the final grade.
Study material
| Type | Name | Author | ISBN | URL, edition, availablitity... | Exam material | Language |
| Lecture slides | Utilization of Data Structures | Yes | English | |||
| Book | Utilization of Data Structures | Minna Ruuska, Terhi Kilamo (compiled by) | 1 84479 360 5 | Available in the Juvenes bookstore | Yes | English |
Prerequisites
| Number | Name | Credits | M/R |
| OHJ-1106 | Programming I | 4 | Mandatory |
| OHJ-1156 | Programming II | 5 | Recommendable |
Other comments
Correspondence of content
8100300 Utilization of Data Structures
| Last modified | 04.05.2005 |
| Modified by | Terhi Kilamo |