Title of the course: Computational Complexity
Instructor: Mr. Chris Stephenson
Institution: İstanbul Bilgi Ü.
Dates: 17-30 July 2017
Prerequisites: Birinci sınıf itibaren üniversite öğrencileri ya da ileri liselilere uygun.
Level: Undergraduate.
Abstract: 1. Asymptotic notations and their properties
2. Sorts. Recurrence relations on asymptotic functions
3. Binary search and Binary heaps
4. Binary trees
5. Balanced binary trees - AVL trees
6. Dijkstra’s algorithm for graphs.
Language: TR, EN