▶Japanese
Post to SNS
- Home
- > School of Computing
- > Undergraduate major in Computer Science
- > Procedural Programming Fundamentals
- School of Science
-
School of Engineering
- Undergraduate major in Mechanical Engineering
- Undergraduate major in Systems and Control Engineering
- Undergraduate major in Electrical and Electronic Engineering
- Undergraduate major in Information and Communications Engineering
- Undergraduate major in Industrial Engineering and Economics
- Common courses
- School of Materials and Chemical Technology
- School of Computing
- School of Life Science and Technology
- School of Environment and Society
- 工学院，物質理工学院，環境・社会理工学院共通科目
- Liberal arts and basic science courses
- First-Year Courses
- School of Science
- School of Engineering
- School of Materials and Chemical Technology
- School of Computing
- School of Life Science and Technology
-
School of Environment and Society
- Department of Architecture and Building Engineering
- Department of Civil and Environmental Engineering
- Department of Transdisciplinary Science and Engineering
- Department of Social and Human Sciences
- Department of Innovation Science
- Graduate major in Technology and Innovation Management
- Common courses
- Liberal arts and basic science courses
- Academic unit or major
- Undergraduate major in Computer Science
- Instructor(s)
- Akiyama Yutaka Fujii Atsushi Ohue Masahito
- Class Format
- Lecture / Exercise
- Media-enhanced courses
- Day/Period(Room No.)
- Mon7-8(W611) Thr5-8(情報工学系計算機室)
- Group
- -
- Course number
- CSC.T243
- Credits
- 3
- Academic year
- 2017
- Offered quarter
- 1Q
- Syllabus updated
- 2017/3/17
- Lecture notes updated
- -
- Language used
- Japanese
- Access Index
-
Course description and aims
This course provides the theory and practice for fundamental procedural C programming, by means of lectures and exercises.
In the first half, students acquire grammar knowledge on C languages such as data types, operators, control structures, functions and recursion through lectures and exercises. In the second half, students learn algorithms to solve concrete problems such as search and sorting. In addition, array, file I/O, character and string types, etc. are acquired along with the knowledge learned in the first half. In the second half exercise, students are requested to fully utilize those knowledge and skills to implement large programs for statistical analysis and searching for large amount of data.
Student learning outcomes
(1) Understand data types, standard input/output, operators, control flows, functions, recursion, arrays, file input/output and character/string types of C language, and create programs utilized them.
(2) Understand multiple search algorithms and sorting algorithms, and create programs to realize them.
(3) Create programs to solve problems such as data analysis, and explain their solutions.
Keywords
Procedural programming, data type, standard I/O, control flow, array, function, file I/O, recursion, sort, search, algorithm, and data analysis
Competencies that will be developed
| ✔ Specialist skills | Intercultural skills | Communication skills | Critical thinking skills | Practical and/or problem-solving skills |
Class flow
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
| Course schedule | Required learning | |
|---|---|---|
| Class 1 | [Exercise] Introduction to fundamental programming and preparation to computer environments | Available during each class. |
| Class 2 | [Lecture] Hardware/software, integer/real type, operator, and standard I/O | Available during each class. |
| Class 3 | [Exercise] Hardware/software, four arithmetic operations, and standard I/O | Available during each class. |
| Class 4 | [Lecture] Control flow (conditional branch, loop) | Available during each class. |
| Class 5 | [Exercise] Control flow | Available during each class. |
| Class 6 | [Lecture] Function, recursion, and scope of variable | Available during each class. |
| Class 7 | [Exercise] Function and recursion | Available during each class. |
| Class 8 | [Lecture] Array, multi-dimensional arrays, and file I/O | Available during each class. |
| Class 9 | [Exercise] Array, multi-dimensional arrays, and file I/O | Available during each class. |
| Class 10 | [Lecture] character and string type | Available during each class. |
| Class 11 | [Exercise] Program design related to basic information processing task (statistics, measurement and control, etc.) | Available during each class. |
| Class 12 | [Lecture] Search algorithm | Available during each class. |
| Class 13 | [Exercise] Program implementation of basic information processing task. | Available during each class. |
| Class 14 | [Lecture] Sort algorithm | Available during each class. |
| Class 15 | [Exercise] Program evaluation of basic information processing task. | Available during each class. |
Textbook(s)
Materials will be available during each lecture and exercise.
Reference books, course materials, etc.
Brian W. Kernighan, Dennis M. Ritchie. C Programming Language (Second Ed.), Prentice Hall, 1988.
Assessment criteria and methods
written examination (50%) and report for project-based programming (50%)
Related courses
- CSC.T253 ： Advanced Procedural Programming
- CSC.T263 ： Functional Programming Fundamentals
- CSC.T273 ： Object-Oriented Programming
- CSC.T271 ： Data Structures and Algorithms
- CSC.T344 ： System Programming
- CSC.T354 ： Parallel Programming
- CSC.T362 ： Numerical Analysis
- LAS.I111 ： Information Literacy I
- LAS.I112 ： Information Literacy II
Prerequisites (i.e., required knowledge, skills, courses, etc.)
No requirement.
Office hours
Wednesday afternoon (appointment via e-mail is required)
