| Course Unit Code | Course Unit Title | Type of Course Unit | Year of Study | Semester | Number of ECTS Credits | | YÖN203 | Introduction to Algorithm and Programming | Compulsory | 2 | 3 | 5 |
|
| Level of Course Unit |
| First Cycle |
| Objectives of the Course |
| The aim of this course is to develop up-to-down programs and to learn and implement basic programming using the C language. |
| Name of Lecturer(s) |
| Dr. Öğr. Üyesi. Doruk AYBERKİN |
| Learning Outcomes |
| 1 | Writing and analysis of the algorithm can. | | 2 | Algorithm written in a programming language that can encode with. | | 3 | Produce a solution to problems with analytical thinking. | | 4 | develop algorithm | | 5 | Explain the features of improved/available algorithms |
|
| Mode of Delivery |
| Normal Education |
| Prerequisites and co-requisities |
| None |
| Recommended Optional Programme Components |
| None |
| Course Contents |
| Introduction to algorithms, problem solving with flow diagrams, runtime and complexity concepts, sorting algorithms, recursion and binary tree representations, reduction links, binary search techniques in data structures, operations on matrices and matrices. Basic concepts in programming languages |
| Weekly Detailed Course Contents |
|
| 1 | Introduction | | | | 2 | Introduction to Algorithm Analysis | | | | 3 | Analysis of Algorithm and an Application with Programming Language | | | | 4 | Recursive Algorithms, Recursive Relations, Multi-Dimensional / Triangle / Band / Sparse Matrix Representations | | | | 5 | Recursive Algorithms, Recursive Relations (coding with an programming language) | | | | 6 | Önişleç/Araişleç/Sonişleç İfadeler. Tek/Çift Bağlaçlı (Döngülü) Listeler | | | | 7 | Önişleç/Araişleç/Sonişleç İfadeler. Tek/Çift Bağlaçlı (Döngülü) Listelerin Bir programlama dili ile kullanılması | | | | 8 | Midterm Exam | | | | 9 | Selection, Insertion, Bubble, Quick, Merge, Heap Sorting Algorithms | | | | 10 | Coding of Selection, Insertion, Bubble, Quick, Merge, Heap Sorting Algorithms | | | | 11 | Applications of Stack and Queues | | | | 12 | Arrays and Structures with Examples | | | | 13 | Tree Data Structures | | | | 14 | Binary Tree, Binary Search Tree, Recursive and Binary Tree Traversals, Guided Binary Trees | | | | 15 | Project Preperation | | |
|
| Recommended or Required Reading |
| Deitel & Deitel, 2000. C++ How To Program. Third Edition. New Jersey: Prentice Hall |
| Planned Learning Activities and Teaching Methods |
|
| Assessment Methods and Criteria | |
| Midterm Examination | 1 | 100 | | SUM | 100 | |
| Final Examination | 1 | 100 | | SUM | 100 | | Term (or Year) Learning Activities | 40 | | End Of Term (or Year) Learning Activities | 60 | | SUM | 100 |
| | Language of Instruction | | Turkish | | Work Placement(s) | | None |
|
| Workload Calculation |
|
| Midterm Examination | 1 | 15 | 15 |
| Final Examination | 1 | 15 | 15 |
| Practice | 14 | 2 | 28 |
| Individual Study for Mid term Examination | 8 | 4 | 32 |
| Individual Study for Final Examination | 8 | 4 | 32 |
| Homework | 8 | 2 | 16 |
|
| Contribution of Learning Outcomes to Programme Outcomes |
| LO1 | 4 | 4 | 4 | 5 | 4 | 5 | | LO2 | 5 | 5 | 4 | 5 | 5 | 5 | | LO3 | 5 | 5 | 5 | 5 | 5 | 5 | | LO4 | 5 | 5 | 5 | 5 | 5 | 5 | | LO5 | 4 | 4 | 4 | 4 | 5 | 5 |
|
| * Contribution Level : 1 Very low 2 Low 3 Medium 4 High 5 Very High |
 |
| |