| School/Faculty/Institute |
Faculty of Engineering |
| Course Code |
COMP 201 |
| Course Title in English |
Data Structures and Algorithms |
| Course Title in Turkish |
Veri Yapıları ve Algoritmalar |
| Language of Instruction |
EN |
| Type of Course |
Exercise,Flipped Classroom,Lecture |
| Level of Course |
Introductory |
| Semester |
Fall |
| Contact Hours per Week |
| Lecture: 3 |
Recitation: none |
Lab: 2 |
Other: none |
|
| Estimated Student Workload |
152 hours per semester |
| Number of Credits |
6 ECTS |
| Grading Mode |
Standard Letter Grade
|
| Pre-requisites |
COMP 109 - Computer Programming (JAVA)
|
| Co-requisites |
None |
| Expected Prior Knowledge |
Basic object-oriented programming knowledge |
| Registration Restrictions |
Only undergraduate students |
| Overall Educational Objective |
To learn fundamentals of data structures and how to design and implement data structures to solve basic engineering problems in Java programming language. |
| Course Description |
This course covers the fundamentals of data structures and algorithms such as lists, stacks, queues, heaps, trees, hashing, sorting algorithms, and application of these concepts using Java programming language. |
Course Learning Outcomes and Competences
Upon successful completion of the course, the learner is expected to be able to:
1) Temel veri yapısı kavramlarını anlar;
2) Veri yapıları kullanarak algoritmalar tasarlar;
3) Mühendislik problemlerini çözmek için veri yapıları uygular;
4) Uygulanan çözümün sonuçlarını analiz eder ve raporlar.
|
| Program Learning Outcomes/Course Learning Outcomes |
1 |
2 |
3 |
4 |
Relation to Program Outcomes and Competences
| N None |
S Supportive |
H Highly Related |
| |
|
|
| |
Program Outcomes and Competences |
Level |
Assessed by |
| Prepared by and Date |
, October 2024 |
| Course Coordinator |
YASSINE DRIAS |
| Semester |
Fall |
| Name of Instructor |
|
Course Contents
| Hafta |
Konu |
| 1) |
Veri Yapılarına Giriş
|
| 2) |
Soyut Sınıflar ve Arayüzler
|
| 3) |
Generics (Jenerikler)
|
| 4) |
Listeler (Bölüm 1)
|
| 5) |
Listeler (Bölüm 2)
|
| 6) |
Yığınlar
|
| 7) |
Kuyruklar
|
| 8) |
Algoritmik Karmaşıklık
|
| 9) |
Yığınlar ve Öncelik Kuyrukları
|
| 10) |
Hashleme
|
| 11) |
Özyineleme (Rekürsiyon)
|
| 12) |
Ağaçlar (Bölüm 1)
|
| 13) |
Ağaçlar (Bölüm 2)
|
| 14) |
Veri Yapıları Kullanarak Algoritma Tasarımı
|
| 15) |
Final Sınavı/Proje/Sunum Dönemi
|
| 16) |
Final Sınavı/Proje/Sunum Dönemi
|
| Required/Recommended Readings | Intro. to Java Programming: Comprehensive Ed. (11th Ed., Pearson, 2019), Daniel Liang.
Data Structures and Algorithms in Java, Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser, Adison Wesley 6th Edition
|
| Teaching Methods | Flipped classroom. Students work individually for assignments. |
| Homework and Projects | Assignments |
| Laboratory Work | Laboratory study |
| Computer Use | Required |
| Other Activities | None |
| Assessment Methods |
| Assessment Tools |
Count |
Weight |
| Ödev |
1 |
% 15 |
| Ara Sınavlar |
2 |
% 50 |
| Final |
1 |
% 35 |
| TOTAL |
% 100 |
|
| Course Administration |
driasy@mef.edu.tr
0 212 395 37 45
Instructor’s office: 5th floor,
Phone number: 0 212 395 37 45
Office hours: After the lecture hours.
E-mail address: driasy@mef.edu.tr
Exams: Closed book and closed notes.
Rules for attendance: YÖK regulations.
Missing a midterm: You are expected to be present without exception and to plan any travel around these dates accordingly. Medical emergencies are of course excluded if accompanied by a doctor’s note. A note indicating that you were seen at the health center on the day of the midterm/quiz is not a sufficient documentation of medically excused absence from the midterm/quiz. The note must say that you were medically unable to take the midterm/quiz. Provided that proper documents of excuse are presented, a make-up for the missing midterm/quiz will be given. If you fail to take the midterm/quiz on the assigned day and do not have a valid excuse, you will be given zero (0) on the midterm/quiz. Employment interviews, employer events, weddings, vacations, etc. are not excused absences.
Eligibility to take the final exam: No final exam.
Missing a final: No final exam.
A reminder of proper classroom behavior, code of student conduct: YÖK Regulations
Statement on plagiarism: YÖK Regulations
|