| Course Unit Code | Course Unit Title | Type of Course Unit | Year of Study | Semester | Number of ECTS Credits | | BLY1012017851 | ALGORITMS AND PROGRAMMING-I | Compulsory | 1 | 1 | 4 |
|
| Level of Course Unit |
| Short Cycle |
| Objectives of the Course |
| The aim of this course is to make an introduction to computer programming, state the basic concepts of programming and algorithm, explain the methods of making algotihms and give a brief explanation of structural programming.
|
| Name of Lecturer(s) |
| Öğr.Gör.Gökhan Alper FİGEN |
| Learning Outcomes |
| 1 | Realize the basic concepts of programming. | | 2 | Realize the algorithm logic, making the algorithms and subjects of the structural programming. | | 3 | Recognize the basic knowledge about C/C++ programming language with respect to algorithm concept. | | 4 | Design easy, understandable and effective program with algorithms and flow diagrams for solving the problems. | | 5 | Find and correct the errors in programs and problem solving. |
|
| Mode of Delivery |
| Formal Education |
| Prerequisites and co-requisities |
| None |
| Recommended Optional Programme Components |
| None |
| Course Contents |
| Concept of the algorithm. Flow diagrams. Programming and programming language. Structural programming. Arrays. Ordering and searching algorithms in rhe arrays. Multi dimensional arrays(matrices). Files and their basic concepts. The concept of format andinput-output formatting. Subprogramming(subroutines).
|
| Weekly Detailed Course Contents |
|
| 1 | The concept of algorithm and algorithm design | | | | 2 | Flow diagrams and their design | | | | 3 | Programming, languages and structural programming concepts | | | | 4 | Basic concepts of the C-Programming | | | | 5 | Decisive(conditional) structures | | | | 6 | Cyclic structures | | | | 7 | Arrays(vectors) | | | | 8 | Searching and ordering algorithms in arrays -MIDTERM | | | | 9 | Multi dimensional arrays(matrices) | | | | 10 | Sub-programming and some examples | | | | 11 | Recursion and recursion programming | | | | 12 | Formats, and input-output formatting | | | | 13 | Usage of the files and basic concepts | | | | 14 | Actual algorithm examples | | | | 15 | FİNAL EXAM | | |
|
| Recommended or Required Reading |
| Algorithms in C (Fundamentals, Data Structures, Sorting, Searching) Robert Sedgewick
Problem Solving and Program Design in C - Jeri R. Hanly, Elliot B. Koffman - Pearson |
| Planned Learning Activities and Teaching Methods |
|
| Assessment Methods and Criteria | |
| SUM | 0 | |
| SUM | 0 | | Yarıyıl (Yıl) İçi Etkinlikleri | 40 | | Yarıyıl (Yıl) Sonu Etkinlikleri | 60 | | SUM | 100 |
| | Language of Instruction | | Turkish | | Work Placement(s) | | None |
|
| Workload Calculation |
|
| Midterm Examination | 1 | 1 | 1 |
| Final Examination | 1 | 1 | 1 |
| Attending Lectures | 14 | 2 | 28 |
| Self Study | 14 | 2 | 28 |
| Individual Study for Homework Problems | 14 | 2 | 28 |
| Individual Study for Mid term Examination | 1 | 8 | 8 |
| Individual Study for Final Examination | 1 | 10 | 10 |
| Reading | 1 | 2 | 2 |
|
| Contribution of Learning Outcomes to Programme Outcomes |
| LO1 | 4 | 3 | | | | | 3 | | 4 | 5 | | | | | | | 3 | | | 3 | 2 | | | | | | | | | | LO2 | 3 | 4 | | | | | 4 | | 5 | 5 | | | | | | | 4 | | | 2 | 5 | | | | | | | | | | LO3 | 4 | 3 | | | | | 5 | | 3 | 4 | | | | | | | 2 | | | 3 | 4 | | | | | | | | | | LO4 | 5 | 2 | | | | | 4 | | 3 | 4 | | | | | | | 4 | | | 4 | 4 | | | | | | | | | | LO5 | 5 | 4 | | | | | 4 | | 3 | 4 | | | | | | | 5 | | | 3 | 5 | | | | | | | | |
|
| * Contribution Level : 1 Very low 2 Low 3 Medium 4 High 5 Very High |
|
|
|
|
Ordu University Rectorate Building ,Cumhuriyet Campus , Center / ORDU / TURKEY • Tel: +90 452 226 52 00
|