|
|
| YBS1013 | Introduction to Algorithms and Programming | 3+0+0 | ECTS:6 | | Year / Semester | Fall Semester | | Level of Course | First Cycle | | Status | Compulsory | | Department | DEPARTMENT of MANAGEMENT INFORMATION SYSTEMS | | Prerequisites and co-requisites | None | | Mode of Delivery | | | Contact Hours | 14 weeks - 3 hours of lectures per week | | Lecturer | Dr. Öğr. Üyesi Merve YILDIZ | | Co-Lecturer | | | Language of instruction | Turkish | | Professional practise ( internship ) | None | | | | The aim of the course: | | The aim of this course is to provide basic concepts of algorithm and programming and to develop algorithm and programming skills.
|
| Learning Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | LO - 1 : | Can create an algorithm to solve a problem. | 1 | 1, | | LO - 2 : | Knows the basic features, components and structures of programming. | 1 | 1, | | LO - 3 : | Can distinguish data structures. | 1 | 1, | | LO - 4 : | Can program to solve simple problems. | 1 | 1, | | CTPO : Contribution to programme outcomes, TOA :Type of assessment (1: written exam, 2: Oral exam, 3: Homework assignment, 4: Laboratory exercise/exam, 5: Seminar / presentation, 6: Term paper), LO : Learning Outcome | | |
| Algorithm, Algorithm Representation Forms, Complexity of Algorithm, Sorting Algorithms,Data Types, Variables, Operators, Control Structures, Functions, Data Structures |
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | Algorithm
| | | Week 2 | Algorithm Representation Forms | | | Week 3 | Complexity of Algorithm | | | Week 4 | Sorting Algorithms | | | Week 5 | Data Types, Variables, Operators | | | Week 6 | Control Structures (Conditionals) | | | Week 7 | Control Structures (Loops) | | | Week 8 | Functions (İterative & Recursive) | | | Week 9 | MIDTERM EXAM | | | Week 10 | Data Structures (Array, List, Linked List) | | | Week 11 | Data Structures (Queue, Stack)
| | | Week 12 | Data Structures (Tree)
| | | Week 13 | Data Structures (Graph)
| | | Week 14 | Example Practices
| | | Week 15 | Example Practices | | | Week 16 | FINAL EXAM
| | | |
| 1 | Nabiyev, V. V. (2013). Teoriden Uygulamalara Algoritmalar (4.bs.). Ankara: Seçkin Yayıncılık | | | |
| 1 | Çölkesen, R. (2014). Veri Yapıları ve Algoritmalar (9.bs.). İstanbul: Papatya Yayıncılık | | | 2 | Cormen, T. H., Leiserson, C. E., Rivest, R. L. & Stein, C. (2009). Introduction to Algorithms (3.edt.). Cambridge: MIT Press | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Mid-term exam | 9 | /11/2025 | 1 | 50 | | End-of-term exam | 16 | /01/2026 | 1 | 50 | | |
| Student Work Load and its Distribution | | Type of work | Duration (hours pw) | No of weeks / Number of activity | Hours in total per term | | Yüz yüze eğitim | 3 | 14 | 42 | | Sınıf dışı çalışma | 1 | 14 | 14 | | Arasınav için hazırlık | 2 | 8 | 16 | | Arasınav | 1 | 1 | 1 | | Dönem sonu sınavı için hazırlık | 2 | 14 | 28 | | Dönem sonu sınavı | 1 | 1 | 1 | | Total work load | | | 102 |
|