Algorithms and Data Structure

Course Information

College	Tsuyama College	Year	2022
Course Title	Algorithms and Data Structure
Course Code	0018	Course Category	Specialized / Compulsory
Class Format	Lecture	Credits	Academic Credit: 4
Department	Department of Computer and Information Engineering	Student Grade	4th
Term	Year-round	Classes per Week	2
Textbook and/or Teaching Materials	Textbook: 紀平 拓男，春日 伸弥「プログラミングの宝箱 アルゴリズムとデータ構造」（SBクリエイティブ）
Instructor	MATSUSHIMA Yukiko

Course Objectives

Learning purposes :
Students who have taken this course can explain well-known algorithms and data structures and answer the name of algorithm and data structures when they read the explanation. They also can explain basic notion and terminology of time complexity and its related notion for considering efficiency of algorithms.

Course Objectives :
1. To be able to explain what is algorithms.
2. To be able to explain typical sort algorithms and search algorithms.
3. To be able to explain typical data structures, e.g. stack, queue, tree structure and so on.
4. To be able to explain string search algorithms.
5. To be able to explain graph data structure.

Rubric

	Excellent	Good	Acceptable	Not acceptable
Achievement 1	Can evaluate the computational complexity of practical programs using the complexity notation and its definition.	Can evaluate the computational complexity of typical programs using the complexity notation and its definition.	Can explain the complexity notation and its definition.	Cannot explain the complexity notation and its definition.
Achievement 2	Can implement practical programs using sort and search algorithms.	Can utilize sort and search algorithms.	Can explain sort and search algorithms.	Cannot explain sort and search algorithms.
Achievement 3	Can implement practical programs using stack, queue and tree structure.	Can utilize stack, queue and tree structure.	Can explain stack, queue and tree structure.	Cannot explain stack, queue and tree structure.
Achievement 4	Can implement practical programs using string search algorithms.	Can utilize string search algorithms.	Can explain string search algorithms.	Cannot explain string search algorithms.
Achievement 5	Can evaluate the practical problems using the graph data structures.	Can evaluate the typical problems using the graph data structures.	Can explain graph data structures.	Cannot explain graph data structures.

Teaching Method

Outline:

General or Specialized : Specialized

Field of learning : Infromation system・Programming・Network

Foundational academic disciplines : Integrated Disciplines/Informatics/Principles of Informatics/Software

Relationship with Educational Objectives :This class is equivalent to "(3) Acquire deep foundation knowledge of the major subject area".

Course outline :Efficiency of solving a problem by computer is depend on algorithm and data structures. This course provides basic skill of choosing and designing algorithms and data structures using typical algorithms and data structures.

Style:

Course method : The lessons will be centered on board writing. In order to deepen the understanding, we will proceed with the lessons while solving the exercises as appropriate.

Grade evaluation method : Regular examination scores are calculated as the average of four examinations. Retesting is not conducted in principle. If the result of the regular test is less than 60 points, the score may be changed if the understanding can be confirmed by the retest. However, the overall evaluation shall not exceed 60 points.

Notice:

Precautions on enrollment : Students must take this class (no more than one-third of the required number of class hours missed).

Course advice :This course is closely connected with programming. Implementation of algorithms that are dealt with in this course makes deeply understanding.

Foundational subjects : Fundamentals of Integrated Science and Technology(1st year), Basic Programming(2nd)

Related subjects : Database Systems(5th year), Advanced Programming(4th), Mathematical Information(4th)

Attendance advice : Delay of attendance will be counted as absence. Entry after confirmation of attendance will be delayed. If you are late, you will be treated as absent from one credit hour for two times.

Characteristics of Class / Division in Learning

Applicable to Remote Class

Ｍｕｓｔ　ｃｏｍｐｌｅｔｅ　ｓｕｂｊｅｃｔｓ

Course Plan

			Theme	Goals
1st Semester
	1st Quarter
		1st	Course Guidance	Understand objectives of this course
		2nd	Bubble Sort	Learn Bubble Sort Algorithm and understand the program of Bubble Sort
		3rd	Quicksort 1	Learn Quicksort Algorithm
		4th	Quicksort 2	Understand the program of Quicksort
		5th	Merge Sort	Learn Merge Sort Algorithm and understand the program of Merge Sort
		6th	Linear Search	Learn Linear Search Algorithm and understand the program of Linear Search
		7th	Binary Search	Learn Binary Search Algorithm and understand the program of Binary Search
		8th	1st Semester Mid-term Exam
	2nd Quarter
		9th	Return 1st Semester Mid-term Exam and correct mistakes	Understand mistakes
		10th	List	Learn List and understand the program of List
		11th	Stack	Learn Stack and understand the program of Stack
		12th	Queue	Learn Queue and understand the program of Queue
		13th	Recursion 1	Learn Recursion
		14th	Recursion 2	Understand the program of Recursion
		15th	(1st Semester Final Exam)
		16th	Return 1st Semester Final Exam and correct mistakes	Understand mistakes
2nd Semester
	3rd Quarter
		1st	Tree Structure 1	Learn Tree Structure
		2nd	Tree Structure 2	Learn Tree Structure
		3rd	Tree Structure 3	Understand the program of Tree Structure
		4th	Map and Hash 1	Learn Map and Hash
		5th	Map and Hash 2	Understand the program of Map and Hash
		6th	String Search Algorithm 1	Learn String Search Algorithm
		7th	String Search Algorithm 2	Understand the program of String Search
		8th	2nd Semester Mid-term Exam
	4th Quarter
		9th	Return 2nd Semester Mid-term Exam and correct mistakes	Understand mistakes
		10th	Tree Traversal	Learn Tree Traversal and understand the program of Tree Traversal
		11th	Graph Data Structure	Learn Graph Data Structure
		12th	Automata	Learn Automata
		13th	Regular Expression	Learn Regular Expression
		14th	Summary and prepare for the Final Exam	Review the algorithms and their programs and be able to explain them.
		15th	(2nd Semester Final Exam)
		16th	Return 2nd Semester Final Exam and correct mistakes	Understand mistakes

Evaluation Method and Weight (%)

	Examination	Presentation	Mutual Evaluations between students	Behavior	Portfolio	Other	Total
Subtotal	100	0	0	0	0	0	100
Basic Proficiency	0	0	0	0	0	0	0
Specialized Proficiency	100	0	0	0	0	0	100
Cross Area Proficiency	0	0	0	0	0	0	0