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 | 1 | 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. Teorik Anlatım: Konular ders kapsamında teorik olarak anlatılır. Öğrenciler programlamanın temel kavramlarını ve algoritmaların mantığını kavrayabilmeleri için konu anlatımları dinler. 2. Uygulamalı Çalışmalar: Öğrenciler, teorik olarak anlatılan konuların uygulamasını yapmak için ders eğitmeni mentorlüğünde çeşitli örneklerle çalışmalar gerçekleştirir. Kazanımlar elde edilmeye çalışılır. 3. Adım Adım Çözümleme: Karşılaşılan problemler adım adım çözülerek her adımın nasıl işlediği açıklanır. Bu yöntemle öğrencilerin konulara daha hakim olması sağlanır. 4.Gerçek Hayat Örnekleri: Konuların daha iyi anlaşılması için gerçek hayattan örnekler ve problem senaryoları sunulur. Böylece öğrenciler öğrendiklerini pratikte nasıl kullanacağını görür. 5. Laboratuvar Föyleri ve Quizler: Haftalık laboratuvar föyleri ve sınav öncesi quizler ile öğrencilerin ilerlemesi değerlendirilir, konuların anlaşılıp anlaşılmadığı takip edilir. |
| Mode of Delivery | Face to Face |
| Prerequisites | Dersin herhangi bir ön koşulu bulunmamaktadır. Tüm öğrencilere temel seviyeden başlanarak eğitim verilmektedir. |
| Coordinator | Prof. Murat DARÇIN |
| Instructor(s) | Lect. Uğur POLAT |
| Instructor Assistant(s) | - |
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 | Şartlı ifadeleri kullanabilir. | P.4.48 | 1,6,7 |
| O2 | Recursive fonksiyonları kullanabilir. | P.4.49 | 1,6,7 |
| O3 | Yapısal programlamanın kavramlarını bilir. | P.4.50 | 1,6,7 |
| O4 | Algoritmaları değerlendirebilir; olası algoritma stratejilerinden birini seçebilir. | P.4.51 | 1,6,7 |
| O5 | Problemleri çözmek için seçilen algoritmik stratejileri kullanarak algoritmaları gerçekleştirme/tasarlama bilgilerini kavrar. | 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 | Şartlı ifadeleri kullanabilir. | 5 |
| O2 | Recursive fonksiyonları kullanabilir. | 5 |
| O3 | Yapısal programlamanın kavramlarını bilir. | 5 |
| O4 | Algoritmaları değerlendirebilir; olası algoritma stratejilerinden birini seçebilir. | 5 |
| O5 | Problemleri çözmek için seçilen algoritmik stratejileri kullanarak algoritmaları gerçekleştirme/tasarlama bilgilerini kavrar. | 5 |
| O6 | Yalın programlama bağlamları içinde algoritmaları tasarlayabilir. | 5 |