Course title
L00020001
Discrete Mathematics 1

 SUGIMOTO Tooru
Middle-level Diploma Policy (mDP)
Program / Major mDP Goals
Computer Science and Engineering B-1 コンピュータサイエンスの数理的基礎と問題分析のスキルを身に付けることができる。
Purpose of class
Students can learn fundamental knowledge that is needed for studying information science and engineering courses.
Course description
Students will learn mathematical concepts, notations and logic for information science and engineering. Students first do exercises of reading and writing logical formula. Then they learn the most important concepts for mathematics and information science, that is, sets, functions and relations.
Goals and objectives
  1. To explain meaning of logical formulas and to write logical formulas
  2. To understand basic concepts related to sets, functions and relations
  3. To understand proofs of basic properties of sets, functions and relations
  4. To write simple proofs based on the definition of each concepts
Relationship between 'Goals and Objectives' and 'Course Outcomes'

 Short test Intermediate report Final exam Total.
1. 10% 10% 10% 30%
2. 10% 15% 10% 35%
3. 10% 10% 20%
4. 5% 10% 15%
Total. 20% 40% 40% -
Evaluation method and criteria
Short test (20%), midterm exam (40%) and final exam (40%)
A score of 60 points is based on the ability to solve all practice problems assigned in class.
Language
Japanese
Class schedule

 Class schedule HW assignments (Including preparation and review of the class.) Amount of Time Required
1. Overview of discrete mathematics Read syllabus 90minutes
Solve exercises 110minutes
2. Set (1) : notations See textbook 1.1.1 90minutes
Solve exercises 110minutes
3. Set (2) : subsets, unions, intersections, complements See textbook 1.1.2 90minutes
Solve exercises 110minutes
4. Set (3) : powersets, finite/infinite sets, direct products See textbook 1.1.2 90minutes
Solve exercises 110minutes
5. Function (1) : functions, images, inverse images See textbook 1.2.1 90minutes
Solve exercises 110minutes
6. Function (2) : injections, surjections, composition See textbook 1.2.2 90minutes
Solve exercises 110minutes
7. Function (3) : inverse functions, countable sets See textbook 1.2.3 90minutes
Solve exercises 110minutes
8. Midterm exam and comments Review 190minutes
9. Function (4) : exercises See textbook 1.2 90minutes
Solve exercises 110minutes
10. Relation (1) : binary relations, directed graph representation See textbook 3.1 90minutes
Solve exercises 110minutes
11. Relation (2) : equivalence relations, quotient sets See textbook 3.2 90minutes
Solve exercises 110minutes
12. Relation (3) : partial order, linear order, Hasse diagram See textbook 3.3 90minutes
Solve exercises 110minutes
13. Relation (4) : infinite sets and cardinality, countable sets See textbook 1.3 90minutes
Solve exercises 110minutes
14. Final exam and comments Review all 190minutes
Total. - - 2780minutes
Feedback on exams, assignments, etc.
ways of feedback specific contents about "Other"
Feedback in the class
Textbooks and reference materials
E. Moriya, ”Introduction to Discrete Mathematics”, Science-sha, 2006
Prerequisites
Not required
Office hours and How to contact professors for questions
  • Wednesday, lunch break
Regionally-oriented
Non-regionally-oriented course
Development of social and professional independence
  • Course that cultivates an ability for utilizing knowledge
Active-learning course
More than one class is interactive
Course by professor with work experience
Work experience Work experience and relevance to the course content if applicable
N/A N/A
Education related SDGs:the Sustainable Development Goals
  • 4.QUALITY EDUCATION
Last modified : Sat Mar 14 14:20:13 JST 2026