Algebraic and Numerical Computations In Algorithm Design
Mathematics
Institute of Natural and Applied Sciences
Second Cycle (Master's Degree)
| Course Unit Title | Course Unit Code | Type of Course Unit | Level of Course Unit | Year of Study | Semester | ECTS Credits |
|---|---|---|---|---|---|---|
| Algebraic and Numerical Computations In Algorithm Design | MAT501 | Elective | Master's degree | 1 | Fall | 8 |
Name of Lecturer(s)
Prof. Dr. Serdal PAMUK
Associate Prof. Dr. Arzu COŞKUN
Associate Prof. Dr. Hülya KODAL SEVİNDİR
Learning Outcomes of the Course Unit
1) List basic definitions and notions.
2) Explain complexity notion on algorithms.
3) Calculate complexity for some algorithms.
4) State basic algebraic and numerical calculations on algorithm design.
5) State some algorithms on math and engineering.
6) State different ways to design fast/superfast algorithms.
Program Competencies-Learning Outcomes Relation
| Program Competencies | ||||||||
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | ||
| Learning Outcomes | ||||||||
| 1 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
| 2 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
| 3 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
| 4 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
| 5 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
| 6 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
Mode of Delivery
Face to Face
Prerequisites and Co-Requisites
None
Recommended Optional Programme Components
Not Required
Course Contents
This course provides candidates with profound knowledge on complexity notion for algorithms, polynomial interpolation (preconditiong usage), optimality of Horner's algorithm, fast fourier transformation, fast polynomial algorithms. Schönhage and Strassen algorithms, polynomial rootfinding, pade approximation, extended Euclidean algorithm, rational interpolation, pade approximation, interpolation algorithms for multivariable polynomials, algebraic techniques on coding.
Recommended or Required Reading
Planned Learning Activities and Teaching Methods
Assessment Methods and Criteria
Contribution of Semester Studies to Course Grade |
40% |
|||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
||||||||||||||||||
Contribution of Final Examination to Course Grade |
60% |
|||||||||||||||||
Total | 100% | |||||||||||||||||
Language of Instruction
Turkish
Work Placement(s)
Not Required