Ders Planı

ISTANBUL AYDIN UNIVERSITY

CLASS 1

Lesson plan / ANALYSIS AND DESIGN OF ALGORITHMS

Lesson Information

Course Credit	3.0
Course ECTS Credit	5.0
Teaching Language of Instruction	Türkçe
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	Assist. Prof. Dr. ADEM ÖZYAVAŞ
Instructor (s)
Course Assistant

Purpose and Content

The aim of the course	The objective of this course unit is to analyze the structures of algorithms, the problems in their design and applications, the complexity of the algorithms and the problems in computation, as well as the types of algorithms and the runtime estimation methods. All these are necessary to design and apply for solving practical problems.
Course Content	The concept of algorithm, Simplist sorting algorithms, Designing approachs: recursive and divide-and-conquer strategies; asymptotic notations, complexity analysis, running times defining, algorithm design techniques: greedy methods, min-cost spanning trees, backtracking algorithms, branch-and-bound methodology

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	Introduction. Insertion sort algorithm.
2	Algorithm analysing methods.Examples
3	Designing algorithms: recursive and divide-and-conquer methods.
4	Asymptotic notations.
5	Practical complexity analysis.
6	Running times defining.
7	Linear lists: a chain ıterator class in C++.
8	Midterm exam.
9	Arrays as classes.
10	Trees: tournament and binary-search trees.
11	AVL and B-trees.
12	Algorithm-design techniques: the Greedy method, Divide-and-conquer method.
13	Backtracking algorithms. Branch-and-Bound methodology
14	Applications examples: using "open" and "closed" lists.

Resources

1-Cormen T.H. etc. "Introduction to Algorithms", The MIT Press, 2001.

EUA Kurumsal Öz değerlendirme Programı İzleme Raporu