Ders Planı

CLASS 1

Lesson plan / ALGORITHMIC MATHEMATICS

Lesson Information

Course Credit	3.0
Course ECTS Credit	5.0
Teaching Language of Instruction	İngilizce
Level of Course	Bachelor's Degree, TYYÇ: Level 6, EQF-LLL: Level 6, QF-EHEA: First Cycle
Type of Course	Compulsory
Mode of Delivery	Face-to-face
Does the course require compulsory or optional work experience?	Z
Course Coordinator	Prof. Dr. RAFET AKDENİZ
Instructor (s)
Course Assistant	Naım Ajlounı

Purpose and Content

The aim of the course	To provide the students: 1. The importance of studying the complexity of a given algorithm. 2. Various algorithmic design techniques.
Course Content	Algorithmic Analysis & design (complexity analysis time & space); Algorithmic strategies & Analysis of fundamental computing algorithms; Induction & recurrence. Solving homogeneous & non homogeneous recurrence relations. expanding recurrence, change of variable, and master method to solve non homogeneous recurrences. Emphasis on divide & conquer Algorithms like mergesort, quicksort, binary search, majority & Minmax algorithms.

The aim of the course

To provide the students: 1. The importance of studying the complexity of a given algorithm. 2. Various algorithmic design techniques.

Course Content

Algorithmic Analysis & design (complexity analysis time & space); Algorithmic strategies & Analysis of fundamental computing algorithms; Induction & recurrence. Solving homogeneous & non homogeneous recurrence relations. expanding recurrence, change of variable, and master method to solve non homogeneous recurrences. Emphasis on divide & conquer Algorithms like mergesort, quicksort, binary search, majority & Minmax algorithms.

Learning Outcomes

Adequate knowledge in mathematics, physical sciences and the computer engineering subjects of individual branches; the ability to implement theoretical and practical knowledge in the respective areas to modeling and solving computer engineering problems.
Ability to reflect the developments in Information and Communication Technologies to the applications of Information Technology.
Ability to identify, define, formulate and solve complex computer engineering problems; ability to select and implement the appropriate analysis and modeling methods in this respect.
Ability to design experiments for analysing computer engineering problems, to conduct experiments, to collect data, to analyse and interpret the results.
Ability to design a complex informtacis system, process, device or product to meet specific requirements under realistic restrictions and conditions; ability to implement the modern design methods for this purpose.
Ability to use, choose and develop modern techniques and means required for computer engineering applications; ability to use information technologies effectively.
Ability to work effectively in interdisciplinary and multi-disciplinary teams; ability to work individually..
Knowledge of applications in business life like project management, risk management and change management; awareness about entrepreneurship, innovativeness and sustainable development.
Awareness of the necessity of lifelong learning; ability to reach information, follow the latest developments in science and technology; ability to ensure self-renewal perpetually.
Ability to communicate efficiently both in oral and written ways in Turkish; knowledge of at least one foreign language; ability to effectively prepare reports and understand written reports, prepare design and production reports, effective presentation, giving and receiving clear and understandable instructions.
Knowledge on the effects of informatics applications on health, environment and safety in terms of universal and social aspects and information about the problems of the era; awareness on the legal results of informatics solutions.
Acting in line with ethical principles, sense of professional and ethical responsibility; knowledge on the standards of engineering applications.

Weekly Course Subjects

1	Course Syllabus Discussion, Introduction to Proofs, Direct Proofs
2	Indirect Proofs, Proof by Mathematical Induction
3	Proof by Mathematical Induction, Induction and Algorithms
4	Induction and Algorithms
5	Fundamental Counting Methods
6	Fundamental Counting Methods
7	Fundamental Counting Methods
8	Midterm Exam
9	Fundamental Counting Methods
10	Difference Equations
11	Difference Equations
12	Difference Equations
13	Difference Equations
14	Difference Equations

Resources

1- Book of Proof by Richard Hammack

2- Discrete Algorithmic Mathematics by Stephen B Maurer

CLASS 1

CLASS 2

CLASS 3

CLASS 4

Lesson Information

Purpose and Content

Learning Outcomes

Weekly Course Subjects

Resources

ABOUT IAU

COMMITTEE

PUBLICATIONS

MEDIA CENTER