Faculty of Engineering and Natural Sciences · Software Engineering (English 30%) · Undergraduate
Course Objective
The Introduction to Algorithms and Programming course aims to equip students with the essential foundational knowledge and skills to step into the world of programming using the C programming language.
Course Content
The course will cover fundamental programming concepts such as variables, data types, operators, loops, conditional statements, and functions. Within the scope of the course, students will acquire skills in algorithm development and problem-solving.
The course aims to provide students with the ability to debug programs and troubleshoot issues effectively. It also focuses on enhancing programming logic and problem-solving skills, teaching students how to break down complex problems into simple steps for solution.
Course Learning Outcomes
- Students acquire the skills to break down complex problems into smaller, manageable steps and express these steps clearly and effectively through algorithm development.
- Students gain an understanding of the fundamental concepts and structure of the programming language. This includes programming constructs such as variables, data types, operators, loops, conditional statements, and functions.
- Students develop basic knowledge and skills to understand and use the C programming language.
- Students become familiar with fundamental data structures and algorithms.
- Students learn the skills to identify, correct, and test code errors.
- Students gain the ability to analyze and solve complex problems.
- Students enhance their ability to complete programming projects through collaboration and group work.
- Students develop the skills to adhere to coding standards and write code that is readable and maintainable.
- The course provides students with a fundamental introduction to computer science and establishes a foundation for further exploration in this field.
- Students gain self-efficacy in programming and algorithm development, allowing them to apply these skills in future projects or endeavors
Core Area Distribution
Teaching Methods
Assessment & Evaluation
ECTS / Workload
| Activity | Quantity | Duration (h) | Total Workload |
|---|---|---|---|
| Course Duration (Including Exam Week) | 15 | 3 | 45 |
| Out of Class Study Period | 15 | 2 | 30 |
| Midterm | 1 | 2 | 2 |
| Quiz | 4 | 1 | 4 |
| Assignment | 0 | 0 | 0 |
| Practice | 15 | 2 | 30 |
| Final | 1 | 2 | 2 |
Course Schedule
| Week | Subject | Preparation |
|---|---|---|
| 1 | Introduction to C Programming - Compilers & Interpreters | |
| 2 | Algorithms, Pseudocode, Flowcharts - Basic Concepts for Programming (Tokens, Expressions, Left Value, Right Value) | Repeat 1. week |
| 3 | Algorithms, Pseudocode, Flowcharts - Basic Concepts for Programming (Tokens, Expressions, Left Value, Right Value) | Repeat 2. week |
| 4 | Statements (if, if… else, while, for, switch … case, do while, break&continue) | Repeat 3. week |
| 5 | Statements (if, if… else, while, for, switch … case, do while, break&continue) | Repeat 4. week |
| 6 | Operators | Repeat 5. week |
| 7 | Type Conversion | Repeat 6. week |
| 8 | Midterm | Repeat 1.- 7. week |
| 9 | Arrays and Matrixes | - |
| 10 | Functions | Repeat 9. week |
| 11 | Pointers | Repeat 10. week |
| 12 | Characters & Strings | Repeat 11. week |
| 13 | File Processing | Repeat 12. week |
| 14 | Dynamic Memory Management | Repeat 13. week |
| 15 | Final Exam | Repat 1. - 14. week |