Your transaction is in progress.
Please Wait...
Course Details
KTO KARATAY UNIVERSITY
Mühendislik ve Doğa Bilimleri Fakültesi
Programme of Mechatronics Engineering
Course Details
Course Code Course Name Year Period Semester T+A+L Credit ECTS
15510002 Algorithms and Programming 2025 Autumn 1 2+1+0 2 3
Course Type Compulsory
Course Cycle Bachelor's (First Cycle) (TQF-HE: Level 6 / QF-EHEA: Level 1 / EQF-LLL: Level 6)
Course Language Turkish
Methods and Techniques 1. Theoretical Lecture: Topics are explained theoretically within the scope of the course. Students listen to lectures to understand the basic concepts of programming and the logic of algorithms. 2. Practical Work: Students work with various examples under the mentorship of the course instructor to apply the topics explained theoretically. Efforts are made to achieve learning outcomes. 3. Step-by-Step Solution: Problems are solved step-by-step, and how each step works is explained. This method helps students gain a better understanding of the topics. 4. Real-Life Examples: Real-life examples and problem scenarios are presented to help students better understand the topics. This allows students to see how to use what they have learned in practice. 5. Laboratory Worksheets and Quizzes: Weekly laboratory worksheets and pre-exam quizzes are used to evaluate students' progress and monitor their understanding of the topics.
Mode of Delivery Face to Face
Prerequisites There are no prerequisites for the course. All students receive instruction starting from the basic level.
Coordinator -
Instructor(s) Asst. Prof. Atakan DAŞDEMİR
Instructor Assistant(s) -
Course Instructor(s)
Name and Surname Room E-Mail Address Internal Meeting Hours
Asst. Prof. Atakan DAŞDEMİR A-127 [email protected] 7479 Thursday
09:00-10:00
Course Content
1. Fundamentals of Computers
-Software and Hardware
-Number Systems
2. Algorithms and Flowcharts
-Pseudo Codes
3. Writing, Compiling and Running a C Program
4. Relational&Logical Operators and Conditional Statements
5. Loops
6. Functions
7. Debugging
8. One-Dimensional/Two-Dimensional Arrays
9. String Class and String Operations
Objectives of the Course
Main goal of the course; To teach students the fundamentals of programming and the principles of algorithm design. Students will gain the algorithmic thinking structure and develop various problem solving techniques using this structure. Additionally, they will learn the basic building blocks of the software development process by practicing coding in C, a low-level and powerful programming language.

Within the scope of the course, students learn basic programming topics such as variables, data types, operators, control structures, loops, functions and data structures; They will gain the skills of establishing algorithms, analyzing problems, producing solutions and coding these solutions effectively. This course aims to reinforce algorithmic thinking skills for introductory C programming language students, creating a solid foundation for transitioning to more complex software development topics in the future.
Contribution of the Course to Field Teaching
Basic Vocational Courses X
Specialization / Field Courses
Support Courses
Transferable Skills Courses
Humanities, Communication and Management Skills Courses
Relationships between Course Learning Outcomes and Program Outcomes
Relationship Levels
Lowest Low Medium High Highest
1 2 3 4 5
# Program Learning Outcomes Level
P2 Ability to identify, formulate and solve complex Mechatronics Engineering problems; ability to select and apply appropriate analysis and modeling methods for this purpose. 5
P6 Ability to work effectively in disciplinary and multi-disciplinary teams; individual working skills 5
Course Learning Outcomes
Upon the successful completion of this course, students will be able to:
No Learning Outcomes Outcome Relationship Measurement Method **
O1 Ability to know number systems P.2.10 1
O2 Ability to understand the basic terminologies used in computer science P.2.24 1
O3 Algorithm P.2.60 1
O4 Algorithm development knowledge and creating the appropriate data structure for the algorithm P.2.61 1
O5 Knowledge of algorithm design and analysis techniques. P.3.17 1
O6 Knowledge of at least one structured programming language. P.3.19 1
O7 Ability to know the classes of programming languages P.5.10 1
O8 Ability to write, compile and debug in C programming language P.6.7 1
** Written Exam: 1, Oral Exam: 2, Homework: 3, Lab./Exam: 4, Seminar/Presentation: 5, Term Paper: 6, Application: 7
Weekly Detailed Course Contents
Week Topics
1 Basic Concepts
2 Algorithm Design and Flowcharts
4 Introduction to Programming Languages
5 Writing, Compiling, and Running a C Program
6 Relational and Logical Operators and Conditional Statements
7 Midterm Exam Preparation
8 Midterm Exam
9 Loops
10 Functions
11 Debugging
12 One-Dimensional / Two-Dimensional Arrays
13 String Class and String Operations
14 Final Exam Preparation
16 Final Exam
Textbook or Material
Resources C How to Program, H. M. Deitel and P. J. Deitel, Prentice Hall, 5th (or above) edition.
Evaluation Method and Passing Criteria
In-Term Studies Quantity Percentage
Attendance - -
Laboratory - -
Practice - -
Course Specific Internship (If Any) - -
Homework - -
Presentation - -
Projects - -
Quiz - -
Midterms 1 40 (%)
Final Exam 1 60 (%)
Total 100 (%)
ECTS / Working Load Table
Quantity Duration Total Work Load
Course Week Number and Time 14 4 56
Out-of-Class Study Time (Pre-study, Library, Reinforcement) 14 3 42
Midterms 1 27 27
Quiz 0 0 0
Homework 0 0 0
Practice 0 0 0
Laboratory 0 0 0
Project 0 0 0
Workshop 0 0 0
Presentation/Seminar Preparation 0 0 0
Fieldwork 0 0 0
Final Exam 1 27 27
Other 0 0 0
Total Work Load: 152
Total Work Load / 30 5,07
Course ECTS Credits: 5
Course - Learning Outcomes Matrix
Relationship Levels
Lowest Low Medium High Highest
1 2 3 4 5
# Learning Outcomes P2 P3 P5 P6
O1 Ability to know number systems 5 - - -
O2 Ability to understand the basic terminologies used in computer science 5 - - -
O3 Algorithm 5 - - -
O4 Algorithm development knowledge and creating the appropriate data structure for the algorithm 5 - - -
O5 Knowledge of algorithm design and analysis techniques. - 5 - -
O6 Knowledge of at least one structured programming language. - 5 - -
O7 Ability to know the classes of programming languages - - - 5
O8 Ability to write, compile and debug in C programming language - - - 5