IAM511 ALGORITHMS AND COMPLEXITY
| Course Code: |
9700511 |
| METU Credit (Theoretical-Laboratory hours/week): |
3(0-0) |
| ECTS Credit: |
8.0 |
| Department: |
Institute Of Applied Mathematics |
| Language of Instruction: |
English |
| Level of Study: |
Graduate |
| Course Coordinator: |
Assoc.Prof.Dr. OÐUZ YAYLA |
| Offered Semester: |
Fall and Spring Semesters. |
Course Content
Formal techniques for design and analysis of algorithms. methods for specifying algorithms.proving an algorithm´s correctness. basics of algorithmic efficiency. asymptotic notations and basic efficiency classes. computational complexity. complexity classes P. NP.NP-completeness/hardness. mathematical analysis of algorithms. divide-and-conquer. space and time trade-offs. and number-theoretical algorithms.
