Information Systems Engineering
Bachelor TR-NQF-HE: Level 6 QF-EHEA: First Cycle EQF-LLL: Level 6

Ders Genel Tanıtım Bilgileri

Course Code: EFC201
Ders İsmi: Data Structures and Algorithms
Ders Yarıyılı: Fall
Ders Kredileri:
Theoretical Practical Laboratory ECTS
3 2 0 5
Language of instruction: Turkish
Ders Koşulu:
Ders İş Deneyimini Gerektiriyor mu?: No
Type of course: Required
Course Level:
Bachelor TR-NQF-HE:6. Master`s Degree QF-EHEA:First Cycle EQF-LLL:6. Master`s Degree
Mode of Delivery: Face to face
Course Coordinator : Assoc. Prof. Dr. HAKAN AYDIN
Course Lecturer(s): Asst. Prof. Dr. ARiF YELĞİ
Asst. Prof. Dr. BUKET İŞLER
Asst. Prof. Dr. MAHSA TORKAMANIAN AFSHAR
Course Assistants:

Dersin Amaç ve İçeriği

Course Objectives: The objective of this course to introduce abstract data types including arrays, records, strings, linked lists, stacks, queues and trees. And implementation of fundamental computing algorithms (searching and sorting) and abstract data types for computational problems in program design.
Course Content: Arama Algoritmaları, Ağaç Veri Yapısı, Sıralama Algoritmaları -Baloncuk Sıralama, Diziler, Tek Yönlü Bağlı Listeler, Algoritma Kavramı,
Yığın Yapısı, Kuyruk Yapısı, İkili Ağaç Yapısı, İkili Arama Ağaçları, Çizge Algoritmaları, En Kısa Yol Algoritması

Learning Outcomes

The students who have succeeded in this course;
Learning Outcomes
1 - Knowledge
Theoretical - Conceptual
1) Ability to calculate time and memory usage complexity of algorithms
2 - Skills
Cognitive - Practical
1) Ability to use basic data structures to solve algorithmic problems effectively
2) Ability to write programs that use basic data structures
3) Ability to apply to programs using effective search and sorting algorithms
4) Ability to use mathematical symbols used in algorithm analysis in basic algorithm analysis
5) Ability to write programs using data structures and algorithms to perform desired program functions
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)
2)
3)
4)
5)
6)
7)
8)
9)
10)
11)
12)
13)
14)
15)

Sources

Course Notes / Textbooks: -
References: Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.

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

Ders Öğrenme Kazanımları

1

2

4

5

6

3

Program Outcomes

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

No Effect 1 Lowest 2 Low 3 Average 4 High 5 Highest
           
Program Outcomes Level of Contribution

Assessment & Grading

Semester Requirements Number of Activities Level of Contribution
Homework Assignments 2 % 20
Midterms 1 % 30
Final 1 % 50
total % 100
PERCENTAGE OF SEMESTER WORK % 50
PERCENTAGE OF FINAL WORK % 50
total % 100