description: Selected computer algorithms: sorting, searching, string processing and graph algorithms. Algorithm design and analysis techniques. Time and computational complexities of algorithms. Introduction to NP-completeness, parallelisation of algorithms, linear and dynamic programming.
objective: The objective of this course is to teach how complex algorithms can be developed using higher level techniques to solve problems in the most efficient way. The goal of teaching basic algorithms is to show not only how to solve particular problems, but also how to solve new problems when they arise in the future.
oibs-code: 5710315
registered Students: 1
objective: The objective of this course is to teach how complex algorithms can be developed using higher level techniques to solve problems in the most efficient way. The goal of teaching basic algorithms is to show not only how to solve particular problems, but also how to solve new problems when they arise in the future.
oibs-code: 5710315
registered Students: 1
Instructors:
- I. Hakki TOROSLU
email:
OfficeHours: NULL
room: A407
tel: 5585 - Adnan YAZICI
email:
OfficeHours: NULL
room: A306
tel: 5583
- Kerem HADIMLI
email:
room: A206
tel: 5593
- syl315-2009.pdf
- Yazici-AlgorithmAnalysis-2009.pdf
- Yazici-Sorting-2009.pdf
- MyL05.pdf
- MyL06.pdf
- MyL07.pdf
- MyL08.pdf
- lecture_02.pdf
- lecture_17.pdf
- lecture_18.pdf
- lecture_20.pdf
- lecture_21.pdf
- lecture_10.pdf
- lecture_09.pdf
- lecture_08.pdf
- lecture_07.pdf
- lecture_22.pdf
- lecture_05.pdf
- lecture_04.pdf
- lecture_03.pdf
- lecture_01.pdf
- lecture_16.pdf
- lecture_24.pdf
- lecture_15.pdf
- lecture_14.pdf
- lecture_13.pdf
- lecture_06.pdf
- lecture_12.pdf
- lecture_11.pdf
- lecture_19.pdf
- midterm : 2009-11-24 17:30:00, rooms: bmb1, bmb2, bmb4, bmb5
| homeworks | ||||||
|---|---|---|---|---|---|---|
| topic: | ||||||
[[+ hid]] |
hw_title | deadline | graded | selectit | ||
| 1 | 1027 | Homework 1 | 2009-10-30 17:30:00 | no | select | |
| 2 | 1040 | Homework 2 | 2009-11-23 00:05:00 | no | select | |