|
|
| HAKA1008 | Algorithm and Programming | 2+1+0 | ECTS:4 | | Year / Semester | Spring Semester | | Level of Course | Short Cycle | | Status | Compulsory | | Department | DEPARTMENT of ARCHITECTURE and CITY PLANNING | | Prerequisites and co-requisites | None | | Mode of Delivery | Face to face, Lab work , Practical | | Contact Hours | 14 weeks - 2 hours of lectures and 1 hour of practicals per week | | Lecturer | -- | | Co-Lecturer | None | | Language of instruction | Turkish | | Professional practise ( internship ) | None | | | | The aim of the course: | | To understand how to solve a problem, considering the logic of computer work. The solution to develop related algorithms and flow charts |
| Learning Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | LO - 1 : | Programming techniques knows
| 1,2,3,12 | 1,3,4 | | LO - 2 : | Knows the basic features of the algorithm, scheduling, performs the analysis and simulation.
| 1,2,3,12 | 1,3,4 | | LO - 3 : | Creates a flow charth diagram | 1,2,3,12 | 1,3,4 | | 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 | | |
| Number systems, binary number system, octal number system, hexadecimal number system, relations between number systems, programming techniques, identification, program design, general concepts, programs and attempt to eliminate errors in the data storage methods, the recognition of problem-solving principles and techniques, the basic features of the algorithm , the use of arithmetic expressions, decision and control mechanisms, control structures, the concept of the loop and loop structures, modular programming techniques, algorithms, flow charts and flow charts of conversion, application examples, variable definitions, memory optimization, disk optimization, planning algorithms, algorithm analysis, algorithm simulation
|
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | Principles and stages of problem solving, algorithm and flow charts
| | | Week 2 | Principles and stages of problem solving, algorithm and flow charts
| | | Week 3 | Principles and stages of problem solving, algorithm and flow charts
| | | Week 4 | Principles and stages of problem solving, algorithm and flow charts
| | | Week 5 | Variables, control statements and loops
| | | Week 6 | Variables, control statements and loops
| | | Week 7 | Variables, control statements and loops
| | | Week 8 | One-and two-dimensional arrays
| | | Week 9 | Midterm Examaination | | | Week 10 | One-and two-dimensional arrays
| | | Week 11 | One-and two-dimensional arrays
| | | Week 12 | One-and two-dimensional arrays
| | | Week 13 | Sub programs
| | | Week 14 | Sub programs
| | | Week 15 | Several applications | | | Week 16 | Final examination | | | |
| 1 | Vatansever,F., Algoritma Geliştirme ve Programlamaya Giriş, SeçkinYay, Ankara 2004. | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Mid-term exam | 9 | | 1 | 50 | | End-of-term exam | 16 | | 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 | 2 | 14 | 28 | | Arasınav için hazırlık | 6 | 9 | 54 | | Arasınav | 1 | 1 | 1 | | Uygulama | 1 | 14 | 14 | | Dönem sonu sınavı için hazırlık | 3 | 8 | 24 | | Dönem sonu sınavı | 1 | 1 | 1 | | Total work load | | | 122 |
|