| Course title | |||||
| アルゴリズム序論演習 [Algorithms : Laboratory Exercises] | |||||
| Course category | technology speciality courses,ets. | Requirement | Credit | 1 | |
| Department | Year | 2～4 | Semester | 1st | |
| Course type | 1st | Course code | 022809 | ||
| Instructor(s) | |||||
| 北川 直哉 [KITAGAWA Naoya] | |||||
| Facility affiliation | Faculty of Engineering | Office | Email address | ||
| Course description |
|
This course reviews the structure and pointers, and create order-conscious programs in C. Furthermore, students learn various algorithms and data structures. |
| Expected Learning |
| See the Curriculum maps. |
| Course schedule |
|
Basically Students must create a program for each class. 1 Linear search, Binary search 2 Bubble sort, Selection sort 3 Insertion sort 4 Computational complexity 5 Stack 6 Queue 7 Linked list 8 Linked List 2 9 Merge sort 10 Quick sort 11 Hash 12 Tree 13 Partial ordered tree and Heap 14 Heap sort 15 Binary search tree |
| Prerequisites |
| In addition to 30 hours that students spend in the class, students are recommended to prepare for and revise the lectures, spending the standard amount of time as specified by the University and using the lecture handouts as well as the references specified below. |
| Required Text(s) and Materials |
| References |
| Assessment/Grading |
| Message from instructor(s) |
| Course keywords |
| Office hours |
| Remarks 1 |
| Remarks 2 |
| Related URL |
| Lecture Language |
| Japanese |
| Language Subject |
| Last update |
| 3/15/2019 1:23:26 PM |