2024 Faculty Courses School of Computing First-Year Courses
Foundations of Computing 2
- Academic unit or major
- First-Year Courses
- Instructor(s)
- Nakamasa Inoue
- Class Format
- Lecture (Face-to-face)
- Media-enhanced courses
- -
- Day of week/Period
(Classrooms) - 5-6 Thu
- Class
- -
- Course Code
- XCO.B102
- Number of credits
- 100
- Course offered
- 2024
- Offered quarter
- 3Q
- Syllabus updated
- Mar 14, 2025
- Language
- Japanese
Syllabus
Course overview and goals
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.
Course description and aims
At the end of this course, students will be able to explain the concept of logic, counting, definition, proof, tree structure, and algorithm, and acquire the basic ways of thinking and the basic techniques for applying them to problems.
Keywords
Logic, Counting, Definition, Proof, Tree Structure, Algorithm
Competencies
- Specialist skills
- Intercultural skills
- Communication skills
- Critical thinking skills
- Practical and/or problem-solving skills
Class flow
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/Objectives
| Course schedule | Objectives | |
|---|---|---|
| Class 1 | Propositional Logic | Peruse chapter 5.1, 5.2 and 5.3 of the course textbook before coming to class. |
| Class 2 | Predicate Calculus | Peruse chapter 5.4 of the course textbook before coming to class. |
| Class 3 | Counting | Peruse chapter 6 of the course textbook before coming to class. |
| Class 4 | Non-Constructive Proof and Mathematical Induction | Peruse chapter 7.1 and 7.2 of the course textbook before coming to class. |
| Class 5 | Recursive and String | Peruse chapter 7.3 and 7.4 of the course textbook before coming to class. |
| Class 6 | Tree Structure and Algorithm | Peruse chapter 8 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. |
Study advice (preparation and review)
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.
Textbook(s)
Mathematical Foundation for Computer Science, Taisuke Sato, Atsushi Takahashi, Toshiya Itoh, Shuichi Ueno, Ohmsha. 2014，ISBN 978-4-274-21610-7
Reference books, course materials, etc.
A Basis for Theoretical Computer Science, M.Arbib, A.Kfoury, R.Moll,, Springer-Verlag New York Inc., 1981
Evaluation methods and criteria
Students will be assessed on their understanding of the concepts of logic, counting, definition, proof, tree structure, and algorithm, and their basic abiilty to apply them to problems. 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.
Related courses
- XCO.B101 ： Foundations of Computing 1
Prerequisites
No prerequisites are necessary, but enrollment in Foundations of Computer Science I is desirable.