This course provides the theory and practice for advanced procedural C programming, by means of lectures and exercises. The first half focuses on pointer variables, string processing, structures, and dynamic memory allocation, which lead to studying algorithms, data structures, and methodologies for producing a large program in the last half. Additionally, students are requested to fully utilize those knowledge and skills to implement large programs associated with practical information processing, such as solving puzzles and pattern recognition. It is desired that students are equipped with fundamental knowledge for C language through, for example "Procedural programming fundamentals (CSC.T243)".
Students are requested to learn and use the following skills: a) producing C programs associated with pointer variables, structures, and dynamic memory allocation; b) selectively using the optimal algorithm and data structure (e.g., stacks, queues, linked lists, and tree structures) to solve the problem in question; c) programming techniques required for practical information processing tasks and debugging for large programs.
Procedural programming, pointer variables, string processing, structures, dynamic memory allocation, stacks, queues, linked lists, tree structures, tree search, algorithms, data structures, complexity, and debug
|Intercultural skills||Communication skills||✔ Specialist skills||Critical thinking skills||Practical and/or problem-solving skills|
Three time slots in one week consists of a single slot for a lecture and two slots for exercises related to the lecture.
|Course schedule||Required learning|
|Class 1||[Exercise] Introduction to advanced programming and preparation to computer environments||Available during each class.|
|Class 2||[Lecture] Pointer variables||Available during each class.|
|Class 3||[Exercise] Pointer variables||Available during each class.|
|Class 4||[Lecture] String processing||Available during each class.|
|Class 5||[Exercise] String processing||Available during each class.|
|Class 6||[Lecture] Structures and dynamic memory allocation||Available during each class.|
|Class 7||[Exercise] Structures and dynamic memory allocation||Available during each class.|
|Class 8||[Lecture] Stacks, queues, and linked lists||Available during each class.|
|Class 9||[Exercise] Stacks, queues, and linked lists||Available during each class.|
|Class 10||[Lecture] Tree structures||Available during each class.|
|Class 11||[Exercise] A program for advanced information processing: Design||Available during each class.|
|Class 12||[Lecture] Tree search||Available during each class.|
|Class 13||[Exercise] A program for advanced information processing: Implementation||Available during each class.|
|Class 14||[Lecture] Methodologies for producing large programs||Available during each class.|
|Class 15||[Exercise] A program for advanced information processing: Evaluation||Available during each class.|
Materials will be available during each lecture and exercise.
The C Programming Language 2nd Edition, Brian W. Kernighan , Dennis M. Ritchie, Prentice Hall, 1988
written examination (50%) and report for project-based programming (50%)