OHJ-2016 Utilization of Data Structures, I & II 2012


15.08.2013 Course replaced by TIE-20106. Web pages moved to here
tut.ot.tiraka
Main
Grading
Exercises
Homework
Lectures
Material
Restrictions
Exams

Printable version
Page map



Lectures

  • Terhi Kilamo, firstname.lastname@tut.fi
  • Important: course related emails should be send to tiraka@cs.tut.fi. Include "OHJ-2016 UDS, Terhi" in the subject field to contact the lecturer
  • Office: TF113, Office hours Mondays 14-15. No need to preschedule a meeting
Lecture times and places:
  • Thursdays 30.08 - 29.11.: 10-12 TB214
  • Lectures on 13.9 and 20.9 cancelled due to the lecturer's business trip.
  • An extra lecture is going to be held on Monday 17.9. in TB214 8-10.

Syllabus

(subject to change)

30.8

Asymptotic analysis and sorting

  • Practical information about the course
  • Introduction
  • Asymptotic analysis
  • Design principles
    • Brute Force
    • Divide and conquer
    • Randomize
  • Sorting algorithms
reading from the book:
  • 3-83
  • 127-138
  • 161-166
  • 191-193
  • 224-230
  • 251-255
  • HW 1 relates to these
    06.9.
    20.9.
    27.9.

    Lists and arrays

    • stack
    • queue
    • ring buffer
    • skip list
    • hash table
    reading from the book:
  • 112-114
  • 267-272
  • HW 1 DL 28.9. !!
    04.10.

    Trees

    • dynamic set
    • binary search tree
    • red black tree
    • B-tree
    • trie
    reading from the book:
  • 118-123
  • 144-146
  • 215-210
  • 313-336
  • 273-277
  • HW 2 relates to these
    11.10.
    25.10.

    C++ standard library

    • about libraries
    • algorithms
    • containers
    • iterators
    reading from the book:
  • 337-367
  • HW 2 DL 2.11. !!
    01.11.
    08.11.

    Graphs

    • graph representation
    • deapth first search
    • breadth first search
    • Dijkstra's algorithm
    reading from the book:
  • 114-118
  • 168-174
  • 297-300
  • HW 3 relates to these
    15.11.
    22.11.

    More design principles

    • memoization
    • greedy algorithms
    • NP hard problems
    • the travelling salesman
    • approxization
    reading from the book:
  • 281-305
  •  
    29.11.

    Conclusion and revision

    • revision
    reading from the book:
  • 97-98
  • HW 3 DL 07.12. !!


    Last updated 07.09.2012 10:29 - terhi.kilamo@tut.fi