This course covers the fundamentals of mathematical concepts, notations, and logic which are required in computer science.
This course facilitates students' development in an abstract and logical way of thinking.
At the end of this course, students will be able to explain the concept of set, mapping, relation, and infinity, and acquire the ability to express them.
Set, Mapping, Relation, Infinity
✔ Specialist skills | Intercultural skills | Communication skills | Critical thinking skills | Practical and/or problem-solving skills |
Before coming to class, students should read the course schedule and check what topics will be covered. Required learning should be completed outside of the classroom for preparation and review purposes.
Course schedule | Required learning | |
---|---|---|
Class 1 | Set: Basic Concepts and Notations | Peruse chapter 1 of the course textbook before coming to class. |
Class 2 | Mapping: Basic Concepts and Notations | Peruse chapter 2 of the course textbook before coming to class. |
Class 3 | Relation 1: Basic Concepts and Notations | Peruse chapter 3.1 and 3.2 of the course textbook before coming to class. |
Class 4 | Relation 2: Various Types of Relations | Peruse chapter 3.3 of the course textbook before coming to class. |
Class 5 | Infinity 1: Infinite Set and Cardinality | Peruse chapter 4.1 and 4.2 of the course textbook before coming to class. |
Class 6 | Infinity 2: Countable and Uncountable | Peruse chapter 4.3 of the course textbook before coming to class. |
Class 7 | Exercise problems | Review the course contents. Use the exercise problems to better understand the topics covered, and evaluate one's own progress. |
To enhance effective learning, students are encouraged to spend approximately 100 minutes preparing for class and another 100 minutes reviewing class content afterwards (including assignments) for each class.
They should do so by referring to textbooks and other course material.
Mathematical Foundation for Computer Science, Taisuke Sato, Atsushi Takahashi, Toshiya Itoh, Shuichi Ueno, Ohmsha. 2014,ISBN 978-4-274-21610-7
A Basis for Theoretical Computer Science, M.Arbib, A.Kfoury, R.Moll,, Springer-Verlag New York Inc., 1981
Students will be assessed on their understanding of the concepts of set, mapping, relation, and infinity, and their abiilty to express them. Students' course scores are based on the final examination and the participation to the lecture.
The participation to the lecture will be assessed on exercise problems during class etc.
No prerequisites