Industrial Engineering
Course Details
KTO KARATAY UNIVERSITY
Mühendislik ve Doğa Bilimleri Fakültesi
Programme of Industrial Engineering
Course Details
Mühendislik ve Doğa Bilimleri Fakültesi
Programme of Industrial Engineering
Course Details
| Course Code | Course Name | Year | Period | Semester | T+A+L | Credit | ECTS |
|---|---|---|---|---|---|---|---|
| 15210101 | Algorithm and Programming | 2025 | Autumn | 1 | 2+1+0 | 2,5 | 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 | Prof. Murat DARÇIN |
| 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 |
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
-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.
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 | X |
| Support Courses | |
| Transferable Skills Courses | X |
| 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 |
|---|---|---|
| P4 | The ability to select and utilize appropriate techniques, resources, and modern engineering and information tools, including estimation and modeling, for the analysis and solution of complex industrial engineering problems, while being aware of their limitations. | 5 |
Course Learning Outcomes
| Upon the successful completion of this course, students will be able to: | |||
|---|---|---|---|
| No | Learning Outcomes | Outcome Relationship | Measurement Method ** |
| O1 | Able to use conditional statements. | P.4.48 | 1,6,7 |
| O2 | Able to use recursive functions. | P.4.49 | 1,6,7 |
| O3 | Knows the concepts of structured programming. | P.4.50 | 1,6,7 |
| O4 | Able to evaluate algorithms; able to select one of the possible algorithmic strategies. | P.4.51 | 1,6,7 |
| O5 | Comprehends the knowledge of implementing/designing algorithms using selected algorithmic strategies to solve problems. | P.4.52 | 1,6,7 |
| O6 | Yalın programlama bağlamları içinde algoritmaları tasarlayabilir. | P.4.53 | 1,6,7 |
| ** 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 | Fundamentals of Computers | Software and Hardware - Number Systems |
| 2 | Algorithms and Flowcharts | Pseudocodes |
| 3 | Writing, Compiling and Running a C Program on IDE Dev-C++ | Escape Characters-Memory Concepts-Arithmetic Operations |
| 4 | Relational and Logical Operators and Conditional Expressions |
| 5 | Relational and Logical Operators and Conditional Expressions |
| 6 | Lecture Repetitions and Laboratory Practices |
| 7 | Pre-Exam Quiz and General Review |
| 8 | Mid-term Exam |
| 9 | Loops |
| 10 | Functions |
| 11 | Debugging |
| 12 | Lecture Repetitions and Laboratory Practices |
| 13 | One Dimensional / Two Dimensional Arrays |
| 14 | String Class and Character Array Operations |
| 15 | Pre-Exam Quiz and General Review |
| 16 | Final Exam |
Textbook or Material
| Resources | C How To Program Ninth Edition -Paul Deitel-Pearson |
| Coding in C with the Help of Numerous Solved Examples | Nobel Publishing |
Evaluation Method and Passing Criteria
| In-Term Studies | Quantity | Percentage |
|---|---|---|
| Attendance | - | - |
| Laboratory | - | - |
| Practice | - | - |
| Field Study | - | - |
| Course Specific Internship (If Any) | - | - |
| Homework | - | - |
| Presentation | - | - |
| Projects | - | - |
| Seminar | - | - |
| Quiz | - | - |
| Listening | - | - |
| Midterms | 1 | 40 (%) |
| Final Exam | 1 | 60 (%) |
| Total | 100 (%) | |
ECTS / Working Load Table
| Quantity | Duration | Total Work Load | |
|---|---|---|---|
| Course Week Number and Time | 14 | 2 | 28 |
| Out-of-Class Study Time (Pre-study, Library, Reinforcement) | 14 | 2 | 28 |
| Midterms | 1 | 10 | 10 |
| Quiz | 0 | 0 | 0 |
| Homework | 0 | 0 | 0 |
| Practice | 14 | 1 | 14 |
| 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 | 10 | 10 |
| Other | 0 | 0 | 0 |
| Total Work Load: | 90 | ||
| Total Work Load / 30 | 3 | ||
| Course ECTS Credits: | 3 | ||
Course - Learning Outcomes Matrix
| Relationship Levels | ||||
| Lowest | Low | Medium | High | Highest |
| 1 | 2 | 3 | 4 | 5 |
| # | Learning Outcomes | P4 |
|---|---|---|
| O1 | Able to use conditional statements. | 5 |
| O2 | Able to use recursive functions. | 5 |
| O3 | Knows the concepts of structured programming. | 5 |
| O4 | Able to evaluate algorithms; able to select one of the possible algorithmic strategies. | 5 |
| O5 | Comprehends the knowledge of implementing/designing algorithms using selected algorithmic strategies to solve problems. | 5 |
| O6 | Yalın programlama bağlamları içinde algoritmaları tasarlayabilir. | 5 |