COURSE UNIT TITLE

: COMPUTATIONAL MATHEMATICS I

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
ELECTIVE

Offered By

Mathematics

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

DOCTOR CEM ÇELIK

Offered to

Mathematics

Course Objective

The aim of this course is to combine basic mathematical expressions and methods with current programming languages and to learn how to solve mathematical problems using this programming languages when necessary.

Learning Outcomes of the Course Unit

1   Will be able to use the basic functions and variables.
2   Will be able to perform operations such as limit, derivative, integral with symbolic expressions.
3   Will be able to solve equation systems, to make vector and matrix operations.
4   Will be able to use data structures, conditional expressions, loops and procedures.
5   Will be able to use data structures, conditional expressions, loops and procedures.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Variables, elementary functions and usual constants, basic graphics.
2 Symbolic expressions and simplification, transforming expressions, assumptions.
3 Equations, explicit solutions, equations with no explicit solution.
4 Sums, limits, sequences, power series expansions, series.
5 Derivatives, partial derivatives, integrals.
6 Solving linear systems, vector computations, matrix computations.
7 Programming and data structures.
8 Loops and conditionals.
9 Procedures and functions, input and output.
10 Lists and character strings, finite sets, dictionaries.
11 2D graphics, parametric curves, 3D curves.
12 Objects, classes and methods.
13 Elements, parents, categories.
14 Elementary and compound domains.

Recomended or Required Reading

Textbook(s): Zimmermann P., Casamayou A., Cohen N., Connan G., Dumont T., Fousse L., Maltey F., Meulien M., Mezzarobba M., Pernet C., Thiéry N. M., Bray E., Cremona J., Forets M., Ghitza A., Thomas H., Computational Mathematics with SageMath, Philadelphia: Society for Industrial and Applied Mathematics, 2018.
Supplementary Book(s):
References:
Materials: Instructor s notes and presentations.

Planned Learning Activities and Teaching Methods

Lecture notes, presentation, problem solving.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 VZ Vize
2 FN Final
3 BNS BNS VZ * 0.40 + FN * 0.60
4 BUT Bütünleme Notu
5 BBN Bütünleme Sonu Başarı Notu VZ * 0.40 + BUT * 0.60


Further Notes About Assessment Methods

None

Assessment Criteria

%40 (Midterm examination) + %60 (Final examination)

Language of Instruction

English

Course Policies and Rules

You can be successful in this course by studying from your textbooks and lecture notes on the topics to be covered every week, coming to class by solving the given problems, establishing the concepts by discussing the parts you do not understand with your questions, learning the methods, and actively participating in the course.

Contact Details for the Lecturer(s)

Cem Çelik
cem.celik@deu.edu.tr
Phone: 0(232) 301 85 80

Office Hours

To be announced later.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 14 4 56
Preparations before/after weekly lectures 14 4 56
Preparation for midterm exam 1 30 30
Preparation for final exam 1 30 30
Midterm 1 3 3
Final 1 3 3
TOTAL WORKLOAD (hours) 178

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13
LO.1555554
LO.2555554
LO.3555554
LO.4555554
LO.5555554