2016 Programming I

Font size  SML

Register update notification mail Add to favorite lecture list
Academic unit or major
Computer Science
Fujii Atsushi 
Class Format
Media-enhanced courses
Day/Period(Room No.)
Course number
Academic year
Offered quarter
Syllabus updated
Lecture notes updated
Language used
Access Index

Course description and aims

This course provides fundamental knowledge of programming, components of programming languages, and fundamental data structures and algorithms, focusing on procedural programming languages.

This course aims to learn mechanisms of programs and knowledge of programming, by means of procedural programming languages.

Students are requested to understand and utilize components of programming languages, fundamental data structures, and fundamental algorithms.

Student learning outcomes

By the end of this course, students will be able to understand
(1) Foundations of procedural programming,
(2) Components of procedural programming languages,
(3) Fundamental data structures and algorithms in procedural programming, and
(4) Various kinds of techniques in procedural programming.


Foundations of procedural programming languages, such as data types, control structures, functions, procedures, recursion, and input/output processing.
Fundamental data structures and algorithms, such as arrays, lists, trees, search and sorting.

Competencies that will be developed

Specialist skills Intercultural skills Communication skills Critical thinking skills Practical and/or problem-solving skills

Class flow

Each lesson corresponds to exercises in Experiments on Computer Science I.

Course schedule/Required learning

  Course schedule Required learning
Class 1 Introduction to procedural programming languages Specified in the class
Class 2 Data types Specified in the class
Class 3 Input and output processing Specified in the class
Class 4 Control structures: conditional branches and loops Specified in the class
Class 5 Arrays Specified in the class
Class 6 Strings Specified in the class
Class 7 Functions Specified in the class
Class 8 Sorting Specified in the class
Class 9 Binary search Specified in the class
Class 10 Pointers Specified in the class
Class 11 Recursion Specified in the class
Class 12 Stuctures Specified in the class
Class 13 Files Specified in the class


C Programming Language (Prentice Hall Software) Brian W. Ritchie, Dennis Kernighan

Reference books, course materials, etc.


Assessment criteria and methods

Midterm and term-end examinations, additional auizzes

Related courses

  • CSC.T241 : Fundamentals of Computing
  • ZUS.S203 : Experiments on Computer Science I
  • ZUS.S202 : Programming II
  • ZUS.F302 : Discrete Structures and Algorithms
  • ZUS.S301 : Programming III
  • CSC.T343 : Databases

Prerequisites (i.e., required knowledge, skills, courses, etc.)




Page Top