Computer Engineering
Course Details

KTO KARATAY UNIVERSITY
Faculty of Engineering and Natural Science
Programme of Computer Engineering
Course Details
Faculty of Engineering and Natural Science
Programme of Computer Engineering
Course Details

| Course Code | Course Name | Year | Period | Semester | T+A+L | Credit | ECTS |
|---|---|---|---|---|---|---|---|
| 05010010 | Introduction to Computer Engineering | 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 | - |
| Mode of Delivery | Face to Face |
| Prerequisites | - |
| Coordinator | Asst. Prof. Ali Osman ÇIBIKDİKEN |
| Instructor(s) | Asst. Prof. Atakan DAŞDEMİR |
| Instructor Assistant(s) | - |
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 |
|---|---|---|
| P1 | Adequate knowledge in mathematics, science and related engineering discipline accumulation; theoretical and practical knowledge in these areas, complex engineering the ability to use in problems. | 5 |
| P3 | Ability to design a complex system, process, device or product to meet specific requirements under realistic constraints and conditions; ability to apply modern design methods for this purpose | 5 |
Course Learning Outcomes
| Upon the successful completion of this course, students will be able to: | |||
|---|---|---|---|
| No | Learning Outcomes | Outcome Relationship | Measurement Method ** |
| O1 | Mathematical models of engineering problems are created and simulated | P.1.6 | 1 |
| O2 | Knowledge of algorithm design and analysis techniques. | P.3.1 | 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 Computer Hardware |
| 2 | Problem solving using computers |
| 3 | The concept and notation of algorithms |
| 4 | Problem analysis and algorithm design |
| 5 | Development of algorithms and their implementation in a procedure-oriented language |
| 6 | Integrated programming environment (editing, computing, debugging) |
| 7 | Data types |
| 8 | Operators |
| 9 | Input/output |
| 10 | Structured programming |
| 11 | Program control |
| 12 | Subprograms |
| 13 | Passing parameters |
| 14 | Arrays and array processing |
Textbook or Material
| Resources | An Introduction to Algorithms |
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 | 3 | 42 |
| Out-of-Class Study Time (Pre-study, Library, Reinforcement) | 14 | 3 | 42 |
| Midterms | 1 | 32 | 32 |
| 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 | 34 | 34 |
| Other | 0 | 0 | 0 |
| Total Work Load: | 150 | ||
| Total Work Load / 30 | 5 | ||
| Course ECTS Credits: | 5 | ||
Course - Learning Outcomes Matrix
| Relationship Levels | ||||
| Lowest | Low | Medium | High | Highest |
| 1 | 2 | 3 | 4 | 5 |
| # | Learning Outcomes | P1 | P3 |
|---|---|---|---|
| O1 | Mathematical models of engineering problems are created and simulated | 5 | - |
| O2 | Knowledge of algorithm design and analysis techniques. | - | 5 |
