Course Information
SemesterCourse Unit CodeCourse Unit TitleL+PCreditNumber of ECTS Credits
6MATH312COMPUTATIONAL MATHEMATICS AND ALGORITHMS2+236

Course Details
Language of Instruction English
Level of Course Unit First Cycle
Department / Program MATHEMATICS
Mode of Delivery Face to Face
Type of Course Unit Elective
Objectives of the Course Mathematical algorithms are essential tool in solving various science and engineering problems. This course introduces to science and engineering students fundamental algorithms, their analysis and use.
Course Content
Course Methods and Techniques
Prerequisites and co-requisities None
Course Coordinator None
Name of Lecturers Associate Prof. Berkant Ustaoğlu
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources R. Sedgewick “Algorithms”, Addison-Wesley 2004
H. Cohen “A course in computational algebraic number theory”, Springer

Course Category

Planned Learning Activities and Teaching Methods
Activities are given in detail in the section of "Assessment Methods and Criteria" and "Workload Calculation"

Assessment Methods and Criteria
In-Term Studies Quantity Percentage
Midterm exams 0 % 0
Quizzes 0 % 0
Homeworks 5 % 10
Other activities 0 % 0
Laboratory works 0 % 0
Projects 1 % 30
Final examination 1 % 20
Total
7
% 60

ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Weekly Course Time 42 1 42
Outside Activities About Course (Attendance, Presentation, Midterm exam,Final exam, Quiz etc.) 14 8 112
Exams and Exam Preparations 7 5 35
Total Work Load   Number of ECTS Credits 6 189

Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 The ability to understand and apply mathematical techniques for solving problems.
2 To model and solve practical problems with the assistance of mathematical tools.
3 The ability to demonstrate knowledge of basic mathematical theorems.
4 To be able to prove basic discrete mathematics theorems.


Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 Algorithms, polynomials, matrices and data structures R. Sedgewick “Algorithms”, Addison-Wesley 2004 H. Cohen “A course in computational algebraic number theory”, Springer
2 Pascal`s algorithm, recursion, analysis of algorithms R. Sedgewick “Algorithms”, Addison-Wesley 2004 H. Cohen “A course in computational algebraic number theory”, Springer
3 Euclid's algorithm, Chinese Remainder for integers R. Sedgewick “Algorithms”, Addison-Wesley 2004 H. Cohen “A course in computational algebraic number theory”, Springer
4 Polynomial evaluation, polynomial multiplication, Euclid`s algorithm for polynomials R. Sedgewick “Algorithms”, Addison-Wesley 2004 H. Cohen “A course in computational algebraic number theory”, Springer
5 Fast Fourier transform and its applications R. Sedgewick “Algorithms”, Addison-Wesley 2004 H. Cohen “A course in computational algebraic number theory”, Springer
6 Primality testing R. Sedgewick “Algorithms”, Addison-Wesley 2004 H. Cohen “A course in computational algebraic number theory”, Springer
7 Integer factorization algorithm R. Sedgewick “Algorithms”, Addison-Wesley 2004 H. Cohen “A course in computational algebraic number theory”, Springer
8 Gram-Schimdt ortogonalization, LLL R. Sedgewick “Algorithms”, Addison-Wesley 2004 H. Cohen “A course in computational algebraic number theory”, Springer
9 Dynamic programming R. Sedgewick “Algorithms”, Addison-Wesley 2004 H. Cohen “A course in computational algebraic number theory”, Springer
10 Greedy algorithms. R. Sedgewick “Algorithms”, Addison-Wesley 2004 H. Cohen “A course in computational algebraic number theory”, Springer
11 Geometric algorithms R. Sedgewick “Algorithms”, Addison-Wesley 2004 H. Cohen “A course in computational algebraic number theory”, Springer
12 Maximum matching, spanning tree algorithms, shortest paths R. Sedgewick “Algorithms”, Addison-Wesley 2004 H. Cohen “A course in computational algebraic number theory”, Springer
13 Weighted graph algorithms R. Sedgewick “Algorithms”, Addison-Wesley 2004 H. Cohen “A course in computational algebraic number theory”, Springer
14 Directed graph algorithms R. Sedgewick “Algorithms”, Addison-Wesley 2004 H. Cohen “A course in computational algebraic number theory”, Springer
15 Final 1st week R. Sedgewick “Algorithms”, Addison-Wesley 2004 H. Cohen “A course in computational algebraic number theory”, Springer
16 Final 2nd week R. Sedgewick “Algorithms”, Addison-Wesley 2004 H. Cohen “A course in computational algebraic number theory”, Springer
 


Contribution of Learning Outcomes to Programme Outcomes
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11 P12 P13 P14
C1 1 1 2 3 2 1 4 3 1 3 4 3
C2 4 1 3 2 2 2 4 4 4 4 3
C3 4 4 2 3 2 1 4 3 4 4 2
C4 4 2 4 2 1 3 2 2 4 2 2

Contribution: 0: Null 1:Slight 2:Moderate 3:Significant 4:Very Significant


https://obs.iyte.edu.tr/oibs/bologna/progCourseDetails.aspx?curCourse=163209&lang=en