Discrete Mathematics Ⅱ

Course Information

College	Toyama College	Year	2020
Course Title	Discrete Mathematics Ⅱ
Course Code	0116	Course Category	Specialized / Elective
Class Format	Lecture	Credits	School Credit: 1
Department	Department of Electronics and Computer Engineering	Student Grade	4th
Term	First Semester	Classes per Week	2
Textbook and/or Teaching Materials
Instructor	Hayase Yoshikazu

Course Objectives

The lecture aims to understand the basic graph theory.
1. Understand the basic concepts of graphs.
2. basic techniques in graph processing.
3. Understand that graph can be adapted to familiar problems.

Rubric

	Ideal Level of Achievement	Standard Level of Achievement	Unacceptable Level of Achievement)
Evaluation 1	Understand the basic concepts of graphs correctly.	Understand the basic concepts of graphs.	Does not understand the basic concepts of graphs.
Evaluation 2	Understand basic techniques in graph processing correctly.	Understand basic techniques in graph processing.	Does not understand basic techniques in graph processing.
Evaluation 3	Can adapt graphs to familiar problems.	Understand that graphs can be adapted to familiar problems.	Does not understand that graphs can be adapted to familiar problems.

Assigned Department Objectives

JABEE B3 （情報分野について理論的に説明できる）

ディプロマポリシー 1 （電気電子工学，情報工学，通信ネットワークの知識，技術を総合的に身につけ，それらを応用したものづくりができる。）

Teaching Method

Outline:

Lecture on the basic graph theory concepts and the basic methods in graph processing. There are many problems that formulate relationships between objects and their relationships. The graph is an effective mathematical tool for modeling such problems.

Style:

Lecture and exercise

Notice:

Require the score points of 60 or more to reach the evaluation standard of JABEE.
Those whose evaluation is less than 60 points can receive a follow-up program by submitting the approval test application. As a result of the follow-up program, the score will be 60 points if certified. Follow-up program will differ depending on contents that have not been certified, so please check in advance.

Course Plan

			Theme	Goals
1st Semester
	1st Quarter
		1st	Guidance	Understand subjects of Information Mathematics II, basic concepts of graphs, and definitions of graphs.
		2nd	Basics of graphs	Understand the transformation operation of subgraphs and graphs.
		3rd	Basics of graphs	Understand connected graphs and connected components.
		4th	Exercise	Can make programs on graph representation and processing.
		5th	Bipartite graph	Understand bipartite graphs.
		6th	Trees and spanning trees	Understand trees and spanning trees.
		7th	Exercise	Can make programs related to bipartite graph and tree representation and processing.
		8th	Midterm exam	Confirm the degree of comprehension on the basis of graph theory.
	2nd Quarter
		9th	The roundness of the graph	Explanation of answer example and returning the midterm exam. Students understand Hamilton Graph and Euler graph.
		10th	Exercise	Consider salesman problems and postal delivery problems.
		11th	Flat graph	Understand plane graphs and convex polyhedra.
		12th	Flat graph	Understand the degree of connection.
		13th	Directed graph	Understand connection, strong connection, and orientation of the graph.
		14th	Directed graph	Understand Hamilton directed graph and Euler directed graph.
		15th	Final exam	Confirm the degree of understanding basic graph theory concepts, and basic methods of graph processing.
		16th	Evaluation / confirmation	Explanation of answer example and returning the final exam.

Evaluation Method and Weight (%)

	Examination	Exercise	Total
Subtotal	80	20	100
Basic Ability	80	20	100