|
|
| BIL2014 | Algorithms | 3+0+0 | ECTS:5 | | Year / Semester | Spring Semester | | Level of Course | First Cycle | | Status | Compulsory | | Department | DEPARTMENT of COMPUTER ENGINEERING | | Prerequisites and co-requisites | None | | Mode of Delivery | Face to face | | Contact Hours | 14 weeks - 3 hours of lectures per week | | Lecturer | Doç. Dr. Vasif NABİYEV | | Co-Lecturer | None | | Language of instruction | Turkish | | Professional practise ( internship ) | None | | | | The aim of the course: | | The aim of this course is to teach the fundamental algorithms and basic computational techniques. |
| Learning Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | LO - 1 : | describe basic algorithmic notations and concepts | 1.1 - 1.2 - 2.1 - 5.3 | 1,2 | | LO - 2 : | describe basic searching and sorting algorithms and compare them with each other | 1.1 - 1.2 - 2.1 - 5.3 | 3,4 | | LO - 3 : | calculate and analyze algorithm complexity, and describe basic programming techniques. | 1.1 - 1.2 - 2.1 - 5.3 | 3,5 | | LO - 4 : | build algorithms for problems which occurs in computerized applications. | 1.1 - 1.2 - 2.1 - 5.3 | 5 | | LO - 5 : | solve basic mathematical and geometrical problems and apply them in computer programming conveniently. | 1.1 - 1.2 - 2.1 - 5.3 | 1,5,6 | | 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 | | |
| Deterministic and non-deterministic algorithms, Algorithmic Complexity and efficiency, Analysis of Algorithms. Sorting Algorithms. Bubble sort. Select sort. Shellsort. Quicksort. Removing Recursion. A Linear Sort. Searching Algorithms. Geometric Algorithms. Random Numbers. Matrix Operations. NP-Completeness. Combinatorial algorithms. |
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | Introduction to Algorithmas. Computation History. deterministic and Non-deterministic Algorithms | | | Week 2 | Algorithm Complexity. Algorithm Analysis. | | | Week 3 | Classification of Algorithms. NP Algorithms | | | Week 4 | Mathematical Algorithms. | | | Week 5 | Recursion.Reccurences | | | Week 6 | Combinations. | | | Week 7 | Combinator algorithms | | | Week 8 | Mid-term exam | | | Week 9 | Number Theory. Prime Numbers, Euclid Algorithm | | | Week 10 | Mathching. Searching Algoritms | | | Week 11 | Sorting Algorithms | | | Week 12 | Matrix techniques | | | Week 13 | Elementary Geometric Methods. Points, lines and Polygons | | | Week 14 | Data secyrity and Cryptology. Simple Methods. Encryption and Decryption. | | | Week 15 | Covering and Number Partition Theory | | | Week 16 | End-of-term exam | | | |
| 1 | Özel Ders notları, | | | 2 | Nabiyev V. , 2009, Seçkin Y., Algoritmalar: Teoriden Uygulamalara, Ankara | | | |
| 1 | Cormen, Thomas, Leiserson,Charles, Rivest, Ronald and Stein Clifford, 2003 Introduction to Algorithms, Prentice-Hall | | | 2 | Anany V. Levitin, 2006, Introduction to the Design and Analysis of Algorithms (2nd Edition) | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Mid-term exam | 8 | 27/03/2014 | 2 | 50 | | End-of-term exam | 16 | 03/06/2014 | 2 | 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 | 5 | 14 | 70 | | Arasınav için hazırlık | 10 | 1 | 10 | | Arasınav | 2 | 1 | 2 | | Kısa sınav | 2 | 1 | 2 | | Dönem sonu sınavı için hazırlık | 12 | 1 | 12 | | Dönem sonu sınavı | 2 | 1 | 2 | | Diğer 1 | 10 | 5 | 50 | | Total work load | | | 190 |
|