Introduction to Programming(INF112-A)
| Course Code | Course Name | Semester | Theory | Practice | Lab | Credit | ECTS |
|---|---|---|---|---|---|---|---|
| INF112-A | Introduction to Programming | 1 | 2 | 0 | 2 | 3 | 4 |
| Prerequisites | |
| Admission Requirements |
| Language of Instruction | French |
| Course Type | Compulsory |
| Course Level | Bachelor Degree |
| Course Instructor(s) | Ahmet Teoman NASKALİ tnaskali@gsu.edu.tr (Email) |
| Assistant | Şükrü Demir İnan ÖZER (Email) |
| Objective |
This course aims to provide students with general programming and algorithmic thinking skills through the fundamental concepts of the C programming language. In this context, the main topics covered include an introduction to programming with C, structured program development, control structures, functions, input/output operations, arrays, file handling, and pointers. Students have the opportunity to apply the knowledge they acquire in the course through programming exercises conducted in the laboratory as well as through assignments. |
| Content |
Week 1 – Basic concepts and introduction to C programming Week 2 – Variable types, initialization, and type conversions Week 3 – Loops and control structures Week 4 – Functions Week 5 – Scope of variables and function return types Week 6 – One-dimensional and multi-dimensional arrays Week 7 – Pointers Week 8 – Midterm exam Week 9 – Character arrays and string operations Week 10 – Structures Week 11 – Dynamic memory management Week 12 – Formatted file reading and writing Week 13 – Character-based file reading and writing Week 14 – Program execution, debugging, and command-line arguments |
| Course Learning Outcomes |
A student who successfully completes this course will be able to: 1. Model a given problem in order to solve it and develop the necessary algorithms; gain proficiency in programming concepts and techniques that are widely used in other programming languages. 2. Use the predefined libraries and functions of the language and write new functions when necessary. 3. Develop code to solve a given problem using variables and loops. 4. Explain how conditional statements can be used, with examples. 5. Explain the differences between static and dynamic memory management concepts and their usage. 6. Perform operations on text files and develop appropriate algorithms. |
| Teaching and Learning Methods | Lectures |
| References |
1. Notes: http://kikencere.gsu.edu.tr/course/view.php?id=17 2. H. M. Deitel & P . J. Deitel, "C: How to Program" 3. Ben Klemens, “21st Century C”, O’Reilly Media |
Theory Topics
| Week | Weekly Contents |
|---|
Practice Topics
| Week | Weekly Contents |
|---|
Contribution to Overall Grade
| Number | Contribution | |
|---|---|---|
| Toplam | 0 | 0 |
In-Term Studies
| Number | Contribution | |
|---|---|---|
| Toplam | 0 | 0 |
| No | Program Learning Outcomes | Contribution | ||||
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | ||
| Activities | Number | Period | Total Workload |
|---|---|---|---|
| Total Workload | 0 | ||
| Total Workload / 25 | 0.00 | ||
| Credits ECTS | 0 | ||