TÜRKÇE
ENGLISH
Information
| Unit | |
| Code | SD0195 |
| Name | Algorithmic thinking for people who do not know computer programming |
| Term | 2017-2018 Academic Year |
| Term | Fall |
| Duration (T+A) | 2-0 (T-A) (17 Week) |
| ECTS | 3 ECTS |
| National Credit | 2 National Credit |
| Teaching Language | Türkçe |
| Level | Belirsiz |
| Label | NFE Non-Field Elective Courses (University) UCC University Common Course |
| Mode of study | Yüz Yüze Öğretim |
| Catalog Information Coordinator | Öğr. Gör. Dr. YOLDAŞ ERDOĞAN |
| Course Instructor |
Öğr. Gör. Dr. YOLDAŞ ERDOĞAN
(Güz)
(A Group)
(Ins. in Charge)
Öğr. Gör. Dr. YOLDAŞ ERDOĞAN (Güz) (B Group) (Ins. in Charge) |
Course Goal / Objective
To teach algorithmic logic and simple computer programming
Course Content
This course; Computers are aimed at teaching computer programming, computer terminology and logical fiction. At the same time, computer science teaches the history, software and hardware terms and the relationship between them. The main aim of the course is to understand the problem to be solved, to form solution steps, to write computer programs and to find mistakes in this program.
Course Precondition
Resources
Notes
Course Learning Outcomes
| Order | Course Learning Outcomes |
|---|---|
| LO01 | Students learn the basic concepts of algorithm design to solve engineering problems. |
| LO02 | Students learn to analyze the algorithms they design. |
| LO03 | Students learn to create different algorithms for a problem, test it and compare algorithms. |
| LO04 | Students learn the basic concepts of computer programming with the FLOWGORITHM program. |
| LO05 | Students learn flow charts and algorithms design techniques. |
Week Plan
| Week | Topic | Preparation | Methods |
|---|---|---|---|
| 1 | Programming languages, mathematical operations, comparison operations, logical operations | Reading, Applying | |
| 2 | Algorithm, terms and operators used in algorithms | Reading, Applying | |
| 3 | Shapes used in flow diagram | Reading, Applying | |
| 4 | Data types used in programming languages and general structures of programming languages | Reading, Applying | |
| 5 | Understand the problem, analyze and create the algorithm | Reading, Applying | |
| 6 | Algorithm and loop concept | Reading, Applying | |
| 7 | Understand counters and assignments | Reading, Applying | |
| 8 | 1st midterm examination | Reading, Applying | |
| 9 | Examples and algorithmic solutions | Reading, Applying | |
| 10 | How to become a good programmer | Reading, Applying | |
| 11 | Algorithm and comparison operations | Reading, Applying | |
| 12 | Arrays and usage areas | Reading, Applying | |
| 13 | Examples and algorithmic solutions | Reading, Applying | |
| 14 | General applications | Reading, Applying | |
| 15 | General applications | ||
| 16 | final exam | ||
| 17 | final exam |
Assessment (Exam) Methods and Criteria
| Assessment Type | Midterm / Year Impact | End of Term / End of Year Impact |
|---|---|---|
| 1. Midterm Exam | 100 | 40 |
| General Assessment | ||
| Midterm / Year Total | 100 | 40 |
| 1. Final Exam | - | 60 |
| Grand Total | - | 100 |
Student Workload - ECTS
| Works | Number | Time (Hour) | Workload (Hour) |
|---|---|---|---|
| Course Related Works | |||
| Class Time (Exam weeks are excluded) | 14 | 2 | 28 |
| Out of Class Study (Preliminary Work, Practice) | 14 | 2 | 28 |
| Assesment Related Works | |||
| Homeworks, Projects, Others | 0 | 0 | 0 |
| Mid-term Exams (Written, Oral, etc.) | 1 | 4 | 4 |
| Final Exam | 1 | 4 | 4 |
| Total Workload (Hour) | 64 | ||
| Total Workload / 25 (h) | 2,56 | ||
| ECTS | 3 ECTS | ||