BİLİŞİM GÜVENLİĞİ TEKNOLOJİSİ
Associate	TR-NQF-HE: Level 5	QF-EHEA: Short Cycle	EQF-LLL: Level 5

Ders Genel Tanıtım Bilgileri

Course Code:

2000121004

Ders İsmi:

Design of Algorithm

Ders Yarıyılı:

Spring

Ders Kredileri:

Theoretical	Practical	Credit	ECTS
3	0	3	4

Language of instruction:

Ders Koşulu:

Ders İş Deneyimini Gerektiriyor mu?:

Type of course:

Necessary

Course Level:

Associate

TR-NQF-HE:5. Master`s Degree

QF-EHEA:Short Cycle

EQF-LLL:5. Master`s Degree

Mode of Delivery:

Face to face

Course Coordinator :

Öğr.Gör. Yasemin GÜNTER

Course Lecturer(s):

Öğr.Gör. Yasemin GÜNTER

Course Assistants:

Dersin Amaç ve İçeriği

Course Objectives:	The aim of the course is to learn and apply algorithm design approaches for solving complex problems. Course objectives; knowing algorithm development approaches, use of advanced data structures, matrix algorithms and designing a new algorithm for solving a new problem.
Course Content:	Asymptotic notations, recurrence methods, algorithm development approaches, hash tables, red-black trees, dynamic programming, greedy algorithms, matrix algorithms, linear programming, number theory algorithms, string algorithms, NP-Completeness.

Learning Outcomes

The students who have succeeded in this course;

Learning Outcomes

1 - Knowledge
Theoretical - Conceptual
2 - Skills
Cognitive - Practical
1) Using asymptotic notations and recurrence methods will be able to calculate and compare the running times of algorithms.
2) Will be able to use algorithm development approaches.
3) Will be able to use advanced data structures.
4) Dynamic programming, greedy algorithms and linear programming will know about
5) Will be able to apply matrix algorithms
6) Will learn number theory algorithms.
3 - Competences
Communication and Social Competence
Learning Competence
Field Specific Competence
Competence to Work Independently and Take Responsibility

Ders Akış Planı

Week	Subject	Related Preparation
1)	Meeting students and explaining the content of the course	1.Introduction to The Design and Analysis of Algorithms, Anany Levitin, Pearson ,3 RD Edition. 2. Algorithms and Programming Burcu Yılmazel, Sevcan Yılmaz Gündüz, Alper Kürşat Uysal, Anadolu University Publications,2016.
2)	What is Algorithm? Basic Features of Algorithms, Algorithm Notation Methods	1.Introduction to The Design and Analysis of Algorithms, Anany Levitin, Pearson ,3 RD Edition. 2. Algorithms and Programming Burcu Yılmazel, Sevcan Yılmaz Gündüz, Alper Kürşat Uysal, Anadolu University Publications,2016.
3)	Classification of Algorithms, Data Structures	1.Introduction to The Design and Analysis of Algorithms, Anany Levitin, Pearson ,3 RD Edition. 2. Algorithms and Programming Burcu Yılmazel, Sevcan Yılmaz Gündüz, Alper Kürşat Uysal, Anadolu University Publications,2016.
4)	Arrays, Linked Lists, Queues, and Stacks	1.Introduction to The Design and Analysis of Algorithms, Anany Levitin, Pearson ,3 RD Edition. 2. Algorithms and Programming Burcu Yılmazel, Sevcan Yılmaz Gündüz, Alper Kürşat Uysal, Anadolu University Publications,2016.
5)	Trees, Binary Trees, Methods for Navigating Binary Trees	1.Introduction to The Design and Analysis of Algorithms, Anany Levitin, Pearson ,3 RD Edition. 2. Algorithms and Programming Burcu Yılmazel, Sevcan Yılmaz Gündüz, Alper Kürşat Uysal, Anadolu University Publications,2016.
6)	Binary Search Trees, AVL Trees, Stack Trees	1.Introduction to The Design and Analysis of Algorithms, Anany Levitin, Pearson ,3 RD Edition. 2. Algorithms and Programming Burcu Yılmazel, Sevcan Yılmaz Gündüz, Alper Kürşat Uysal, Anadolu University Publications,2016.
7)	Hash Tables	1.Introduction to The Design and Analysis of Algorithms, Anany Levitin, Pearson ,3 RD Edition. 2. Algorithms and Programming Burcu Yılmazel, Sevcan Yılmaz Gündüz, Alper Kürşat Uysal, Anadolu University Publications,2016.
8)	Midterm Exam-1
9)	Problem Solving with Algorithms, Algorithm Design Techniques	1.Introduction to The Design and Analysis of Algorithms, Anany Levitin, Pearson ,3 RD Edition. 2. Algorithms and Programming Burcu Yılmazel, Sevcan Yılmaz Gündüz, Alper Kürşat Uysal, Anadolu University Publications,2016.
10)	Loop-Iteration Algorithms, Reduce-Conquer Method Algorithms, Recursive Function Algorithms and Divide-Conquer Method Algorithms	1.Introduction to The Design and Analysis of Algorithms, Anany Levitin, Pearson ,3 RD Edition. 2. Algorithms and Programming Burcu Yılmazel, Sevcan Yılmaz Gündüz, Alper Kürşat Uysal, Anadolu University Publications,2016.
11)	Algorithm Analysis	1.Introduction to The Design and Analysis of Algorithms, Anany Levitin, Pearson ,3 RD Edition. 2. Algorithms and Programming Burcu Yılmazel, Sevcan Yılmaz Gündüz, Alper Kürşat Uysal, Anadolu University Publications,2016.
12)	Midterm Exam-2
13)	Comparison of Search Algorithms, Sequential Search, Binary Search and Search Algorithms	1.Introduction to The Design and Analysis of Algorithms, Anany Levitin, Pearson ,3 RD Edition. 2. Algorithms and Programming Burcu Yılmazel, Sevcan Yılmaz Gündüz, Alper Kürşat Uysal, Anadolu University Publications,2016.
14)	Sorting Algorithms, Properties of Sorting Algorithms	1.Introduction to The Design and Analysis of Algorithms, Anany Levitin, Pearson ,3 RD Edition. 2. Algorithms and Programming Burcu Yılmazel, Sevcan Yılmaz Gündüz, Alper Kürşat Uysal, Anadolu University Publications,2016.
15)	Graph Algorithms	1.Introduction to The Design and Analysis of Algorithms, Anany Levitin, Pearson ,3 RD Edition. 2. Algorithms and Programming Burcu Yılmazel, Sevcan Yılmaz Gündüz, Alper Kürşat Uysal, Anadolu University Publications,2016.
16)	Final Exam

Sources

Course Notes / Textbooks:	1.Introduction to The Design and Analysis of Algorithms, Anany Levitin, Pearson ,3 RD Edition. 2. Algoritmalar ve Programlama, Burcu Yılmazel, Sevcan Yılmaz Gündüz, Alper Kürşat Uysal, Anadolu Üniversitesi Yayınları,2016.
References:	1.Introduction to The Design and Analysis of Algorithms, Anany Levitin, Pearson ,3 RD Edition. 2. Algorithms and Programming Burcu Yılmazel, Sevcan Yılmaz Gündüz, Alper Kürşat Uysal, Anadolu University Publications,2016.

Ders - Program Öğrenme Kazanım İlişkisi

Ders Öğrenme Kazanımları	1	2	3	4	5	6
Program Outcomes
1) Having knowledge and skills in security algorithms for programming
2) Ability to install and manage software required for end user security
3) Having the ability to install and manage computer networks and use the network operating system
4) Have basic database and web programming skills

Ders - Öğrenme Kazanımı İlişkisi

No Effect	1 Lowest	2 Low	3 Average	4 High	5 Highest

	Program Outcomes	Level of Contribution
1)	Having knowledge and skills in security algorithms for programming	5
2)	Ability to install and manage software required for end user security	3
3)	Having the ability to install and manage computer networks and use the network operating system	3
4)	Have basic database and web programming skills	3

Öğrenme Etkinliği ve Öğretme Yöntemleri

Anlatım
Beyin fırtınası /Altı şapka
Course
Grup çalışması ve ödevi
Labs
Okuma
Homework
Problem Çözme
Proje Hazırlama
Rapor Yazma
Seminar
Örnek olay çalışması
Web Tabanlı Öğrenme

Ölçme ve Değerlendirme Yöntemleri ve Kriterleri

Yazılı Sınav (Açık uçlu sorular, çoktan seçmeli, doğru yanlış, eşleştirme, boşluk doldurma, sıralama)
Homework
Uygulama
Grup Projesi
Sunum
Raporlama

Assessment & Grading

Semester Requirements	Number of Activities	Level of Contribution
Midterms	1	% 40
Semester Final Exam	1	% 60
total		% 100
PERCENTAGE OF SEMESTER WORK		% 40
PERCENTAGE OF FINAL WORK		% 60
total		% 100

İş Yükü ve AKTS Kredisi Hesaplaması

Activities	Number of Activities	Duration (Hours)	Workload
Course Hours	14	2	28
Study Hours Out of Class	4	15	60
Midterms	1	10	10
Final	1	10	10
Total Workload			108