ANM02001 Computer Fundamentals

Hiroshima University Syllabus

Japanese

Academic Year 2024Year School/Graduate School School of Integrated Arts and Sciences Department of Integrated Arts and Sciences

Lecture Code ANM02001 Subject Classification Specialized Education

Subject Name コンピュータ基礎論

Subject Name
（Katakana）コンピュータキソロン

Subject Name in
English Computer Fundamentals

Instructor WATANABE HIDENOBU,SUZUKI SHUNYA

Instructor
(Katakana) ワタナベ　ヒデノブ,スズキ　シュンヤ

Campus Higashi-Hiroshima Semester/Term 2nd-Year,  First Semester,  2Term

Days, Periods, and Classrooms (2T) Mon1-4：IAS K208

Lesson Style Lecture Lesson Style
(More Details) 　

Lecture

Credits 2.0 Class Hours/Week 　 Language of Instruction J : Japanese

Course Level 2 : Undergraduate Low-Intermediate

Course Area（Area） 25 : Science and Technology

Course Area（Discipline） 02 : Information Science

Eligible Students Second/ Third/ Fourth Grade students in Faculty of Integrated Arts and Sciences, and other students

Keywords The foundations of computing theory, computability theory, algorithms, recursively enumerable sets, and computational complexity

Special Subject for Teacher Education 　 Special Subject 　

Class Status
within Educational
Program
(Applicable only to targeted subjects for undergraduate students)
Criterion referenced
Evaluation
(Applicable only to targeted subjects for undergraduate students) Integrated Arts and Sciences
（Knowledge and Understanding）
・Knowledge and understanding of the importance and characteristics of each discipline and basic theoretical framework.
（Abilities and Skills）
・The ability and skills to specify necessary theories and methods for consideration of issues.

Class Objectives
/Class Outline One of the most fundamental tasks in computer system theory is to solve problems using computers.  Firstly, in order to develop a program, we need to design an algorithm.  However, it is known that problems exist that cannot be solved by computers.  In this series of lectures, we learn the limitations of computation by investigating what kinds of problems are computable or incomputable.  Finally, we prove that some problems of practical importance are incomputable.

Objectives of the class:
1. To understand the definition and properties of computable problems and algorithm.
2. To understand countable sets and recursively enumerable sets using recursive functions.

Class Schedule lesson1 Guidance, Introduction to Foundations of Computing Theory
(Hidenobu Watanabe)
lesson2 Unit of Data
(Hidenobu Watanabe)
lesson3 Algorithms and Programs
(Hidenobu Watanabe)
lesson4 Fundamental Algorithms
(Hidenobu Watanabe)
lesson5 Good or Bad of Algorithms, Recursive Functions and Algorithms
(Hidenobu Watanabe)
lesson6 Solution with a Fine-tooth Comb and Amount of Calculation
(Hidenobu Watanabe)
lesson7 Report and Comment #1
(Hidenobu Watanabe)
lesson8 Errors in Computational Numerical Calculation
(Hidenobu Watanabe)
lesson9 Random Number Generation by the Computers
(Toshiya Suzuki)
lesson10 Hash Function and its Applications
(Toshiya Suzuki)
lesson11 Report and Comment #2
(Toshiya Suzuki)
lesson12 Flow Chart
(Toshiya Suzuki)
lesson13 State Machine Diagram
(Toshiya Suzuki)
lesson14 Summary
(Toshiya Suzuki)
lesson15 Report and Comment #3
(Toshiya Suzuki)

Reports (three times)

Text/Reference
Books,etc. Textbook: Osamu Wataanbe, "Computer science as liberal arts education".
Reference book: Takumi Kasai and Seinosuke Toda, "the Theory of Computation", Sipser, M., "Introduction to the Theory of Computation," 2nd edition.

PC or AV used in
Class,etc. 　

(More Details) Classroom lecture by textbook and slides.
We recommend purchasing the textbook.
To purchase the reference books is not required. Please refer to them at the library as necessary.
Laptop PC (BYOD)

Learning techniques to be incorporated 　

Suggestions on
Preparation and
Review Basically, the handouts will be provided by the website using an E-learning system. Please feel free to use them for your preparation and review.

Requirements

Grading Method Reports (100%)

Practical Experience

Summary of Practical Experience and Class Contents based on it

Message

Other

Please fill in the class improvement questionnaire which is carried out on all classes.
Instructors will reflect on your feedback and utilize the information for improving their teaching.

Academic Year	2024Year	School/Graduate School	School of Integrated Arts and Sciences Department of Integrated Arts and Sciences
Lecture Code	ANM02001	Subject Classification	Specialized Education
Subject Name	コンピュータ基礎論
Subject Name （Katakana）	コンピュータキソロン
Subject Name in English	Computer Fundamentals
Instructor	WATANABE HIDENOBU,SUZUKI SHUNYA
Instructor (Katakana)	ワタナベ　ヒデノブ,スズキ　シュンヤ
Campus	Higashi-Hiroshima	Semester/Term	2nd-Year, First Semester, 2Term
Days, Periods, and Classrooms	(2T) Mon1-4：IAS K208
Lesson Style	Lecture	Lesson Style (More Details)
Lecture
Credits	2.0	Class Hours/Week		Language of Instruction	J : Japanese
Course Level	2 : Undergraduate Low-Intermediate
Course Area（Area）	25 : Science and Technology
Course Area（Discipline）	02 : Information Science
Eligible Students	Second/ Third/ Fourth Grade students in Faculty of Integrated Arts and Sciences, and other students
Keywords	The foundations of computing theory, computability theory, algorithms, recursively enumerable sets, and computational complexity
Special Subject for Teacher Education		Special Subject
Class Status within Educational Program (Applicable only to targeted subjects for undergraduate students)
Criterion referenced Evaluation (Applicable only to targeted subjects for undergraduate students)	Integrated Arts and Sciences （Knowledge and Understanding）・Knowledge and understanding of the importance and characteristics of each discipline and basic theoretical framework. （Abilities and Skills）・The ability and skills to specify necessary theories and methods for consideration of issues.
Class Objectives /Class Outline	One of the most fundamental tasks in computer system theory is to solve problems using computers. Firstly, in order to develop a program, we need to design an algorithm. However, it is known that problems exist that cannot be solved by computers. In this series of lectures, we learn the limitations of computation by investigating what kinds of problems are computable or incomputable. Finally, we prove that some problems of practical importance are incomputable. Objectives of the class: 1. To understand the definition and properties of computable problems and algorithm. 2. To understand countable sets and recursively enumerable sets using recursive functions.
Class Schedule	lesson1 Guidance, Introduction to Foundations of Computing Theory (Hidenobu Watanabe) lesson2 Unit of Data (Hidenobu Watanabe) lesson3 Algorithms and Programs (Hidenobu Watanabe) lesson4 Fundamental Algorithms (Hidenobu Watanabe) lesson5 Good or Bad of Algorithms, Recursive Functions and Algorithms (Hidenobu Watanabe) lesson6 Solution with a Fine-tooth Comb and Amount of Calculation (Hidenobu Watanabe) lesson7 Report and Comment #1 (Hidenobu Watanabe) lesson8 Errors in Computational Numerical Calculation (Hidenobu Watanabe) lesson9 Random Number Generation by the Computers (Toshiya Suzuki) lesson10 Hash Function and its Applications (Toshiya Suzuki) lesson11 Report and Comment #2 (Toshiya Suzuki) lesson12 Flow Chart (Toshiya Suzuki) lesson13 State Machine Diagram (Toshiya Suzuki) lesson14 Summary (Toshiya Suzuki) lesson15 Report and Comment #3 (Toshiya Suzuki) Reports (three times)
Text/Reference Books,etc.	Textbook: Osamu Wataanbe, "Computer science as liberal arts education". Reference book: Takumi Kasai and Seinosuke Toda, "the Theory of Computation", Sipser, M., "Introduction to the Theory of Computation," 2nd edition.
PC or AV used in Class,etc.
(More Details)	Classroom lecture by textbook and slides. We recommend purchasing the textbook. To purchase the reference books is not required. Please refer to them at the library as necessary. Laptop PC (BYOD)
Learning techniques to be incorporated
Suggestions on Preparation and Review	Basically, the handouts will be provided by the website using an E-learning system. Please feel free to use them for your preparation and review.
Requirements
Grading Method	Reports (100%)
Practical Experience
Summary of Practical Experience and Class Contents based on it
Message
Other
Please fill in the class improvement questionnaire which is carried out on all classes. Instructors will reflect on your feedback and utilize the information for improving their teaching.

Back to syllabus main page