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

Instructors:

• I. Hakki TOROSLU
  email:
  OfficeHours: NULL
  room: A407
  tel: 5585
• Adnan YAZICI
  email:
  OfficeHours: NULL
  room: A306
  tel: 5583

Assistants:

• Kerem HADIMLI
  email:
  room: A206
  tel: 5593